diff --git a/src/boost/bind/arg.hpp b/src/boost/bind/arg.hpp
deleted file mode 100644
index cb52e668..00000000
--- a/src/boost/bind/arg.hpp
+++ /dev/null
@@ -1,69 +0,0 @@
-#ifndef BOOST_BIND_ARG_HPP_INCLUDED
-#define BOOST_BIND_ARG_HPP_INCLUDED
-
-// MS compatible compilers support #pragma once
-
-#if defined(_MSC_VER) && (_MSC_VER >= 1020)
-# pragma once
-#endif
-
-//
-//  bind/arg.hpp
-//
-//  Copyright (c) 2002 Peter Dimov and Multi Media Ltd.
-//
-// Distributed under the Boost 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/bind/bind.html for documentation.
-//
-
-#include <boost/config.hpp>
-#include <boost/is_placeholder.hpp>
-
-namespace boost
-{
-
-template<bool Eq> struct _arg_eq
-{
-};
-
-template<> struct _arg_eq<true>
-{
-    typedef void type;
-};
-
-template< int I > struct arg
-{
-    BOOST_CONSTEXPR arg()
-    {
-    }
-
-    template< class T > BOOST_CONSTEXPR arg( T const & /* t */, typename _arg_eq< I == is_placeholder<T>::value >::type * = 0 )
-    {
-    }
-};
-
-template< int I > BOOST_CONSTEXPR bool operator==( arg<I> const &, arg<I> const & )
-{
-    return true;
-}
-
-#if !defined( BOOST_NO_TEMPLATE_PARTIAL_SPECIALIZATION )
-
-template< int I > struct is_placeholder< arg<I> >
-{
-    enum _vt { value = I };
-};
-
-template< int I > struct is_placeholder< arg<I> (*) () >
-{
-    enum _vt { value = I };
-};
-
-#endif
-
-} // namespace boost
-
-#endif // #ifndef BOOST_BIND_ARG_HPP_INCLUDED
diff --git a/src/boost/bind/bind.hpp b/src/boost/bind/bind.hpp
deleted file mode 100644
index fd0ee144..00000000
--- a/src/boost/bind/bind.hpp
+++ /dev/null
@@ -1,2346 +0,0 @@
-#ifndef BOOST_BIND_BIND_HPP_INCLUDED
-#define BOOST_BIND_BIND_HPP_INCLUDED
-
-// MS compatible compilers support #pragma once
-
-#if defined(_MSC_VER) && (_MSC_VER >= 1020)
-# pragma once
-#endif
-
-//
-//  bind.hpp - binds function objects to arguments
-//
-//  Copyright (c) 2001-2004 Peter Dimov and Multi Media Ltd.
-//  Copyright (c) 2001 David Abrahams
-//  Copyright (c) 2005 Peter Dimov
-//
-// Distributed under the Boost 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/bind/bind.html for documentation.
-//
-
-#include <boost/bind/detail/requires_cxx11.hpp>
-#include <boost/config.hpp>
-#include <boost/bind/mem_fn.hpp>
-#include <boost/type.hpp>
-#include <boost/is_placeholder.hpp>
-#include <boost/bind/arg.hpp>
-#include <boost/bind/detail/result_traits.hpp>
-#include <boost/bind/std_placeholders.hpp>
-#include <boost/config/workaround.hpp>
-#include <boost/visit_each.hpp>
-#include <boost/core/ref.hpp>
-#include <boost/core/enable_if.hpp>
-#include <boost/bind/detail/is_same.hpp>
-
-#if !defined( BOOST_NO_CXX11_RVALUE_REFERENCES )
-#include <utility> // std::forward
-#endif
-
-// Borland-specific bug, visit_each() silently fails to produce code
-
-#if defined(BOOST_BORLANDC)
-#  define BOOST_BIND_VISIT_EACH boost::visit_each
-#else
-#  define BOOST_BIND_VISIT_EACH visit_each
-#endif
-
-#include <boost/bind/storage.hpp>
-
-#ifdef BOOST_MSVC
-# pragma warning(push)
-# pragma warning(disable: 4512) // assignment operator could not be generated
-#endif
-
-namespace boost
-{
-
-template<class T> class weak_ptr;
-
-namespace _bi // implementation details
-{
-
-// ref_compare
-
-template<class T> bool ref_compare( T const & a, T const & b, long )
-{
-    return a == b;
-}
-
-template<int I> bool ref_compare( arg<I> const &, arg<I> const &, int )
-{
-    return true;
-}
-
-template<int I> bool ref_compare( arg<I> (*) (), arg<I> (*) (), int )
-{
-    return true;
-}
-
-template<class T> bool ref_compare( reference_wrapper<T> const & a, reference_wrapper<T> const & b, int )
-{
-    return a.get_pointer() == b.get_pointer();
-}
-
-// bind_t forward declaration for listN
-
-template<class R, class F, class L> class bind_t;
-
-template<class R, class F, class L> bool ref_compare( bind_t<R, F, L> const & a, bind_t<R, F, L> const & b, int )
-{
-    return a.compare( b );
-}
-
-// value
-
-template<class T> class value
-{
-public:
-
-    value(T const & t): t_(t) {}
-
-    T & get() { return t_; }
-    T const & get() const { return t_; }
-
-    bool operator==(value const & rhs) const
-    {
-        return t_ == rhs.t_;
-    }
-
-private:
-
-    T t_;
-};
-
-// ref_compare for weak_ptr
-
-template<class T> bool ref_compare( value< weak_ptr<T> > const & a, value< weak_ptr<T> > const & b, int )
-{
-    return !(a.get() < b.get()) && !(b.get() < a.get());
-}
-
-// type
-
-template<class T> class type {};
-
-// unwrap
-
-template<class F> struct unwrapper
-{
-    static inline F & unwrap( F & f, long )
-    {
-        return f;
-    }
-
-    template<class F2> static inline F2 & unwrap( reference_wrapper<F2> rf, int )
-    {
-        return rf.get();
-    }
-
-    template<class R, class T> static inline _mfi::dm<R, T> unwrap( R T::* pm, int )
-    {
-        return _mfi::dm<R, T>( pm );
-    }
-};
-
-// listN
-
-class list0
-{
-public:
-
-    list0() {}
-
-    template<class T> T & operator[] (_bi::value<T> & v) const { return v.get(); }
-
-    template<class T> T const & operator[] (_bi::value<T> const & v) const { return v.get(); }
-
-    template<class T> T & operator[] (reference_wrapper<T> const & v) const { return v.get(); }
-
-    template<class R, class F, class L> typename result_traits<R, F>::type operator[] (bind_t<R, F, L> & b) const { return b.eval(*this); }
-
-    template<class R, class F, class L> typename result_traits<R, F>::type operator[] (bind_t<R, F, L> const & b) const { return b.eval(*this); }
-
-    template<class R, class F, class A> R operator()(type<R>, F & f, A &, long)
-    {
-        return unwrapper<F>::unwrap(f, 0)();
-    }
-
-    template<class R, class F, class A> R operator()(type<R>, F const & f, A &, long) const
-    {
-        return unwrapper<F const>::unwrap(f, 0)();
-    }
-
-    template<class F, class A> void operator()(type<void>, F & f, A &, int)
-    {
-        unwrapper<F>::unwrap(f, 0)();
-    }
-
-    template<class F, class A> void operator()(type<void>, F const & f, A &, int) const
-    {
-        unwrapper<F const>::unwrap(f, 0)();
-    }
-
-    template<class V> void accept(V &) const
-    {
-    }
-
-    bool operator==(list0 const &) const
-    {
-        return true;
-    }
-};
-
-#ifdef BOOST_MSVC
-// MSVC is bright enough to realise that the parameter rhs 
-// in operator==may be unused for some template argument types:
-#pragma warning(push)
-#pragma warning(disable:4100)
-#endif
-
-template< class A1 > class list1: private storage1< A1 >
-{
-private:
-
-    typedef storage1< A1 > base_type;
-
-public:
-
-    explicit list1( A1 a1 ): base_type( a1 ) {}
-
-    A1 operator[] (boost::arg<1>) const { return base_type::a1_; }
-
-    A1 operator[] (boost::arg<1> (*) ()) const { return base_type::a1_; }
-
-    template<class T> T & operator[] ( _bi::value<T> & v ) const { return v.get(); }
-
-    template<class T> T const & operator[] ( _bi::value<T> const & v ) const { return v.get(); }
-
-    template<class T> T & operator[] (reference_wrapper<T> const & v) const { return v.get(); }
-
-    template<class R, class F, class L> typename result_traits<R, F>::type operator[] (bind_t<R, F, L> & b) const { return b.eval(*this); }
-
-    template<class R, class F, class L> typename result_traits<R, F>::type operator[] (bind_t<R, F, L> const & b) const { return b.eval(*this); }
-
-    template<class R, class F, class A> R operator()(type<R>, F & f, A & a, long)
-    {
-        return unwrapper<F>::unwrap(f, 0)(a[base_type::a1_]);
-    }
-
-    template<class R, class F, class A> R operator()(type<R>, F const & f, A & a, long) const
-    {
-        return unwrapper<F const>::unwrap(f, 0)(a[base_type::a1_]);
-    }
-
-    template<class F, class A> void operator()(type<void>, F & f, A & a, int)
-    {
-        unwrapper<F>::unwrap(f, 0)(a[base_type::a1_]);
-    }
-
-    template<class F, class A> void operator()(type<void>, F const & f, A & a, int) const
-    {
-        unwrapper<F const>::unwrap(f, 0)(a[base_type::a1_]);
-    }
-
-    template<class V> void accept(V & v) const
-    {
-        base_type::accept(v);
-    }
-
-    bool operator==(list1 const & rhs) const
-    {
-        return ref_compare(base_type::a1_, rhs.a1_, 0);
-    }
-};
-
-struct logical_and;
-struct logical_or;
-
-template< class A1, class A2 > class list2: private storage2< A1, A2 >
-{
-private:
-
-    typedef storage2< A1, A2 > base_type;
-
-public:
-
-    list2( A1 a1, A2 a2 ): base_type( a1, a2 ) {}
-
-    A1 operator[] (boost::arg<1>) const { return base_type::a1_; }
-    A2 operator[] (boost::arg<2>) const { return base_type::a2_; }
-
-    A1 operator[] (boost::arg<1> (*) ()) const { return base_type::a1_; }
-    A2 operator[] (boost::arg<2> (*) ()) const { return base_type::a2_; }
-
-    template<class T> T & operator[] (_bi::value<T> & v) const { return v.get(); }
-
-    template<class T> T const & operator[] (_bi::value<T> const & v) const { return v.get(); }
-
-    template<class T> T & operator[] (reference_wrapper<T> const & v) const { return v.get(); }
-
-    template<class R, class F, class L> typename result_traits<R, F>::type operator[] (bind_t<R, F, L> & b) const { return b.eval(*this); }
-
-    template<class R, class F, class L> typename result_traits<R, F>::type operator[] (bind_t<R, F, L> const & b) const { return b.eval(*this); }
-
-    template<class R, class F, class A> R operator()(type<R>, F & f, A & a, long)
-    {
-        return unwrapper<F>::unwrap(f, 0)(a[base_type::a1_], a[base_type::a2_]);
-    }
-
-    template<class R, class F, class A> R operator()(type<R>, F const & f, A & a, long) const
-    {
-        return unwrapper<F const>::unwrap(f, 0)(a[base_type::a1_], a[base_type::a2_]);
-    }
-
-    template<class F, class A> void operator()(type<void>, F & f, A & a, int)
-    {
-        unwrapper<F>::unwrap(f, 0)(a[base_type::a1_], a[base_type::a2_]);
-    }
-
-    template<class F, class A> void operator()(type<void>, F const & f, A & a, int) const
-    {
-        unwrapper<F const>::unwrap(f, 0)(a[base_type::a1_], a[base_type::a2_]);
-    }
-
-    template<class A> bool operator()( type<bool>, logical_and & /*f*/, A & a, int )
-    {
-        return a[ base_type::a1_ ] && a[ base_type::a2_ ];
-    }
-
-    template<class A> bool operator()( type<bool>, logical_and const & /*f*/, A & a, int ) const
-    {
-        return a[ base_type::a1_ ] && a[ base_type::a2_ ];
-    }
-
-    template<class A> bool operator()( type<bool>, logical_or & /*f*/, A & a, int )
-    {
-        return a[ base_type::a1_ ] || a[ base_type::a2_ ];
-    }
-
-    template<class A> bool operator()( type<bool>, logical_or const & /*f*/, A & a, int ) const
-    {
-        return a[ base_type::a1_ ] || a[ base_type::a2_ ];
-    }
-
-    template<class V> void accept(V & v) const
-    {
-        base_type::accept(v);
-    }
-
-    bool operator==(list2 const & rhs) const
-    {
-        return ref_compare(base_type::a1_, rhs.a1_, 0) && ref_compare(base_type::a2_, rhs.a2_, 0);
-    }
-};
-
-template< class A1, class A2, class A3 > class list3: private storage3< A1, A2, A3 >
-{
-private:
-
-    typedef storage3< A1, A2, A3 > base_type;
-
-public:
-
-    list3( A1 a1, A2 a2, A3 a3 ): base_type( a1, a2, a3 ) {}
-
-    A1 operator[] (boost::arg<1>) const { return base_type::a1_; }
-    A2 operator[] (boost::arg<2>) const { return base_type::a2_; }
-    A3 operator[] (boost::arg<3>) const { return base_type::a3_; }
-
-    A1 operator[] (boost::arg<1> (*) ()) const { return base_type::a1_; }
-    A2 operator[] (boost::arg<2> (*) ()) const { return base_type::a2_; }
-    A3 operator[] (boost::arg<3> (*) ()) const { return base_type::a3_; }
-
-    template<class T> T & operator[] (_bi::value<T> & v) const { return v.get(); }
-
-    template<class T> T const & operator[] (_bi::value<T> const & v) const { return v.get(); }
-
-    template<class T> T & operator[] (reference_wrapper<T> const & v) const { return v.get(); }
-
-    template<class R, class F, class L> typename result_traits<R, F>::type operator[] (bind_t<R, F, L> & b) const { return b.eval(*this); }
-
-    template<class R, class F, class L> typename result_traits<R, F>::type operator[] (bind_t<R, F, L> const & b) const { return b.eval(*this); }
-
-    template<class R, class F, class A> R operator()(type<R>, F & f, A & a, long)
-    {
-        return unwrapper<F>::unwrap(f, 0)(a[base_type::a1_], a[base_type::a2_], a[base_type::a3_]);
-    }
-
-    template<class R, class F, class A> R operator()(type<R>, F const & f, A & a, long) const
-    {
-        return unwrapper<F const>::unwrap(f, 0)(a[base_type::a1_], a[base_type::a2_], a[base_type::a3_]);
-    }
-
-    template<class F, class A> void operator()(type<void>, F & f, A & a, int)
-    {
-        unwrapper<F>::unwrap(f, 0)(a[base_type::a1_], a[base_type::a2_], a[base_type::a3_]);
-    }
-
-    template<class F, class A> void operator()(type<void>, F const & f, A & a, int) const
-    {
-        unwrapper<F const>::unwrap(f, 0)(a[base_type::a1_], a[base_type::a2_], a[base_type::a3_]);
-    }
-
-    template<class V> void accept(V & v) const
-    {
-        base_type::accept(v);
-    }
-
-    bool operator==(list3 const & rhs) const
-    {
-        return
-            
-            ref_compare( base_type::a1_, rhs.a1_, 0 ) &&
-            ref_compare( base_type::a2_, rhs.a2_, 0 ) &&
-            ref_compare( base_type::a3_, rhs.a3_, 0 );
-    }
-};
-
-template< class A1, class A2, class A3, class A4 > class list4: private storage4< A1, A2, A3, A4 >
-{
-private:
-
-    typedef storage4< A1, A2, A3, A4 > base_type;
-
-public:
-
-    list4( A1 a1, A2 a2, A3 a3, A4 a4 ): base_type( a1, a2, a3, a4 ) {}
-
-    A1 operator[] (boost::arg<1>) const { return base_type::a1_; }
-    A2 operator[] (boost::arg<2>) const { return base_type::a2_; }
-    A3 operator[] (boost::arg<3>) const { return base_type::a3_; }
-    A4 operator[] (boost::arg<4>) const { return base_type::a4_; }
-
-    A1 operator[] (boost::arg<1> (*) ()) const { return base_type::a1_; }
-    A2 operator[] (boost::arg<2> (*) ()) const { return base_type::a2_; }
-    A3 operator[] (boost::arg<3> (*) ()) const { return base_type::a3_; }
-    A4 operator[] (boost::arg<4> (*) ()) const { return base_type::a4_; }
-
-    template<class T> T & operator[] (_bi::value<T> & v) const { return v.get(); }
-
-    template<class T> T const & operator[] (_bi::value<T> const & v) const { return v.get(); }
-
-    template<class T> T & operator[] (reference_wrapper<T> const & v) const { return v.get(); }
-
-    template<class R, class F, class L> typename result_traits<R, F>::type operator[] (bind_t<R, F, L> & b) const { return b.eval(*this); }
-
-    template<class R, class F, class L> typename result_traits<R, F>::type operator[] (bind_t<R, F, L> const & b) const { return b.eval(*this); }
-
-    template<class R, class F, class A> R operator()(type<R>, F & f, A & a, long)
-    {
-        return unwrapper<F>::unwrap(f, 0)(a[base_type::a1_], a[base_type::a2_], a[base_type::a3_], a[base_type::a4_]);
-    }
-
-    template<class R, class F, class A> R operator()(type<R>, F const & f, A & a, long) const
-    {
-        return unwrapper<F const>::unwrap(f, 0)(a[base_type::a1_], a[base_type::a2_], a[base_type::a3_], a[base_type::a4_]);
-    }
-
-    template<class F, class A> void operator()(type<void>, F & f, A & a, int)
-    {
-        unwrapper<F>::unwrap(f, 0)(a[base_type::a1_], a[base_type::a2_], a[base_type::a3_], a[base_type::a4_]);
-    }
-
-    template<class F, class A> void operator()(type<void>, F const & f, A & a, int) const
-    {
-        unwrapper<F const>::unwrap(f, 0)(a[base_type::a1_], a[base_type::a2_], a[base_type::a3_], a[base_type::a4_]);
-    }
-
-    template<class V> void accept(V & v) const
-    {
-        base_type::accept(v);
-    }
-
-    bool operator==(list4 const & rhs) const
-    {
-        return
-
-            ref_compare( base_type::a1_, rhs.a1_, 0 ) &&
-            ref_compare( base_type::a2_, rhs.a2_, 0 ) &&
-            ref_compare( base_type::a3_, rhs.a3_, 0 ) &&
-            ref_compare( base_type::a4_, rhs.a4_, 0 );
-    }
-};
-
-template< class A1, class A2, class A3, class A4, class A5 > class list5: private storage5< A1, A2, A3, A4, A5 >
-{
-private:
-
-    typedef storage5< A1, A2, A3, A4, A5 > base_type;
-
-public:
-
-    list5( A1 a1, A2 a2, A3 a3, A4 a4, A5 a5 ): base_type( a1, a2, a3, a4, a5 ) {}
-
-    A1 operator[] (boost::arg<1>) const { return base_type::a1_; }
-    A2 operator[] (boost::arg<2>) const { return base_type::a2_; }
-    A3 operator[] (boost::arg<3>) const { return base_type::a3_; }
-    A4 operator[] (boost::arg<4>) const { return base_type::a4_; }
-    A5 operator[] (boost::arg<5>) const { return base_type::a5_; }
-
-    A1 operator[] (boost::arg<1> (*) ()) const { return base_type::a1_; }
-    A2 operator[] (boost::arg<2> (*) ()) const { return base_type::a2_; }
-    A3 operator[] (boost::arg<3> (*) ()) const { return base_type::a3_; }
-    A4 operator[] (boost::arg<4> (*) ()) const { return base_type::a4_; }
-    A5 operator[] (boost::arg<5> (*) ()) const { return base_type::a5_; }
-
-    template<class T> T & operator[] (_bi::value<T> & v) const { return v.get(); }
-
-    template<class T> T const & operator[] (_bi::value<T> const & v) const { return v.get(); }
-
-    template<class T> T & operator[] (reference_wrapper<T> const & v) const { return v.get(); }
-
-    template<class R, class F, class L> typename result_traits<R, F>::type operator[] (bind_t<R, F, L> & b) const { return b.eval(*this); }
-
-    template<class R, class F, class L> typename result_traits<R, F>::type operator[] (bind_t<R, F, L> const & b) const { return b.eval(*this); }
-
-    template<class R, class F, class A> R operator()(type<R>, F & f, A & a, long)
-    {
-        return unwrapper<F>::unwrap(f, 0)(a[base_type::a1_], a[base_type::a2_], a[base_type::a3_], a[base_type::a4_], a[base_type::a5_]);
-    }
-
-    template<class R, class F, class A> R operator()(type<R>, F const & f, A & a, long) const
-    {
-        return unwrapper<F const>::unwrap(f, 0)(a[base_type::a1_], a[base_type::a2_], a[base_type::a3_], a[base_type::a4_], a[base_type::a5_]);
-    }
-
-    template<class F, class A> void operator()(type<void>, F & f, A & a, int)
-    {
-        unwrapper<F>::unwrap(f, 0)(a[base_type::a1_], a[base_type::a2_], a[base_type::a3_], a[base_type::a4_], a[base_type::a5_]);
-    }
-
-    template<class F, class A> void operator()(type<void>, F const & f, A & a, int) const
-    {
-        unwrapper<F const>::unwrap(f, 0)(a[base_type::a1_], a[base_type::a2_], a[base_type::a3_], a[base_type::a4_], a[base_type::a5_]);
-    }
-
-    template<class V> void accept(V & v) const
-    {
-        base_type::accept(v);
-    }
-
-    bool operator==(list5 const & rhs) const
-    {
-        return
-
-            ref_compare( base_type::a1_, rhs.a1_, 0 ) &&
-            ref_compare( base_type::a2_, rhs.a2_, 0 ) &&
-            ref_compare( base_type::a3_, rhs.a3_, 0 ) &&
-            ref_compare( base_type::a4_, rhs.a4_, 0 ) &&
-            ref_compare( base_type::a5_, rhs.a5_, 0 );
-    }
-};
-
-template<class A1, class A2, class A3, class A4, class A5, class A6> class list6: private storage6< A1, A2, A3, A4, A5, A6 >
-{
-private:
-
-    typedef storage6< A1, A2, A3, A4, A5, A6 > base_type;
-
-public:
-
-    list6( A1 a1, A2 a2, A3 a3, A4 a4, A5 a5, A6 a6 ): base_type( a1, a2, a3, a4, a5, a6 ) {}
-
-    A1 operator[] (boost::arg<1>) const { return base_type::a1_; }
-    A2 operator[] (boost::arg<2>) const { return base_type::a2_; }
-    A3 operator[] (boost::arg<3>) const { return base_type::a3_; }
-    A4 operator[] (boost::arg<4>) const { return base_type::a4_; }
-    A5 operator[] (boost::arg<5>) const { return base_type::a5_; }
-    A6 operator[] (boost::arg<6>) const { return base_type::a6_; }
-
-    A1 operator[] (boost::arg<1> (*) ()) const { return base_type::a1_; }
-    A2 operator[] (boost::arg<2> (*) ()) const { return base_type::a2_; }
-    A3 operator[] (boost::arg<3> (*) ()) const { return base_type::a3_; }
-    A4 operator[] (boost::arg<4> (*) ()) const { return base_type::a4_; }
-    A5 operator[] (boost::arg<5> (*) ()) const { return base_type::a5_; }
-    A6 operator[] (boost::arg<6> (*) ()) const { return base_type::a6_; }
-
-    template<class T> T & operator[] (_bi::value<T> & v) const { return v.get(); }
-
-    template<class T> T const & operator[] (_bi::value<T> const & v) const { return v.get(); }
-
-    template<class T> T & operator[] (reference_wrapper<T> const & v) const { return v.get(); }
-
-    template<class R, class F, class L> typename result_traits<R, F>::type operator[] (bind_t<R, F, L> & b) const { return b.eval(*this); }
-
-    template<class R, class F, class L> typename result_traits<R, F>::type operator[] (bind_t<R, F, L> const & b) const { return b.eval(*this); }
-
-    template<class R, class F, class A> R operator()(type<R>, F & f, A & a, long)
-    {
-        return unwrapper<F>::unwrap(f, 0)(a[base_type::a1_], a[base_type::a2_], a[base_type::a3_], a[base_type::a4_], a[base_type::a5_], a[base_type::a6_]);
-    }
-
-    template<class R, class F, class A> R operator()(type<R>, F const & f, A & a, long) const
-    {
-        return unwrapper<F const>::unwrap(f, 0)(a[base_type::a1_], a[base_type::a2_], a[base_type::a3_], a[base_type::a4_], a[base_type::a5_], a[base_type::a6_]);
-    }
-
-    template<class F, class A> void operator()(type<void>, F & f, A & a, int)
-    {
-        unwrapper<F>::unwrap(f, 0)(a[base_type::a1_], a[base_type::a2_], a[base_type::a3_], a[base_type::a4_], a[base_type::a5_], a[base_type::a6_]);
-    }
-
-    template<class F, class A> void operator()(type<void>, F const & f, A & a, int) const
-    {
-        unwrapper<F const>::unwrap(f, 0)(a[base_type::a1_], a[base_type::a2_], a[base_type::a3_], a[base_type::a4_], a[base_type::a5_], a[base_type::a6_]);
-    }
-
-    template<class V> void accept(V & v) const
-    {
-        base_type::accept(v);
-    }
-
-    bool operator==(list6 const & rhs) const
-    {
-        return
-
-            ref_compare( base_type::a1_, rhs.a1_, 0 ) &&
-            ref_compare( base_type::a2_, rhs.a2_, 0 ) &&
-            ref_compare( base_type::a3_, rhs.a3_, 0 ) &&
-            ref_compare( base_type::a4_, rhs.a4_, 0 ) &&
-            ref_compare( base_type::a5_, rhs.a5_, 0 ) &&
-            ref_compare( base_type::a6_, rhs.a6_, 0 );
-    }
-};
-
-template<class A1, class A2, class A3, class A4, class A5, class A6, class A7> class list7: private storage7< A1, A2, A3, A4, A5, A6, A7 >
-{
-private:
-
-    typedef storage7< A1, A2, A3, A4, A5, A6, A7 > base_type;
-
-public:
-
-    list7( A1 a1, A2 a2, A3 a3, A4 a4, A5 a5, A6 a6, A7 a7 ): base_type( a1, a2, a3, a4, a5, a6, a7 ) {}
-
-    A1 operator[] (boost::arg<1>) const { return base_type::a1_; }
-    A2 operator[] (boost::arg<2>) const { return base_type::a2_; }
-    A3 operator[] (boost::arg<3>) const { return base_type::a3_; }
-    A4 operator[] (boost::arg<4>) const { return base_type::a4_; }
-    A5 operator[] (boost::arg<5>) const { return base_type::a5_; }
-    A6 operator[] (boost::arg<6>) const { return base_type::a6_; }
-    A7 operator[] (boost::arg<7>) const { return base_type::a7_; }
-
-    A1 operator[] (boost::arg<1> (*) ()) const { return base_type::a1_; }
-    A2 operator[] (boost::arg<2> (*) ()) const { return base_type::a2_; }
-    A3 operator[] (boost::arg<3> (*) ()) const { return base_type::a3_; }
-    A4 operator[] (boost::arg<4> (*) ()) const { return base_type::a4_; }
-    A5 operator[] (boost::arg<5> (*) ()) const { return base_type::a5_; }
-    A6 operator[] (boost::arg<6> (*) ()) const { return base_type::a6_; }
-    A7 operator[] (boost::arg<7> (*) ()) const { return base_type::a7_; }
-
-    template<class T> T & operator[] (_bi::value<T> & v) const { return v.get(); }
-
-    template<class T> T const & operator[] (_bi::value<T> const & v) const { return v.get(); }
-
-    template<class T> T & operator[] (reference_wrapper<T> const & v) const { return v.get(); }
-
-    template<class R, class F, class L> typename result_traits<R, F>::type operator[] (bind_t<R, F, L> & b) const { return b.eval(*this); }
-
-    template<class R, class F, class L> typename result_traits<R, F>::type operator[] (bind_t<R, F, L> const & b) const { return b.eval(*this); }
-
-    template<class R, class F, class A> R operator()(type<R>, F & f, A & a, long)
-    {
-        return unwrapper<F>::unwrap(f, 0)(a[base_type::a1_], a[base_type::a2_], a[base_type::a3_], a[base_type::a4_], a[base_type::a5_], a[base_type::a6_], a[base_type::a7_]);
-    }
-
-    template<class R, class F, class A> R operator()(type<R>, F const & f, A & a, long) const
-    {
-        return unwrapper<F const>::unwrap(f, 0)(a[base_type::a1_], a[base_type::a2_], a[base_type::a3_], a[base_type::a4_], a[base_type::a5_], a[base_type::a6_], a[base_type::a7_]);
-    }
-
-    template<class F, class A> void operator()(type<void>, F & f, A & a, int)
-    {
-        unwrapper<F>::unwrap(f, 0)(a[base_type::a1_], a[base_type::a2_], a[base_type::a3_], a[base_type::a4_], a[base_type::a5_], a[base_type::a6_], a[base_type::a7_]);
-    }
-
-    template<class F, class A> void operator()(type<void>, F const & f, A & a, int) const
-    {
-        unwrapper<F const>::unwrap(f, 0)(a[base_type::a1_], a[base_type::a2_], a[base_type::a3_], a[base_type::a4_], a[base_type::a5_], a[base_type::a6_], a[base_type::a7_]);
-    }
-
-    template<class V> void accept(V & v) const
-    {
-        base_type::accept(v);
-    }
-
-    bool operator==(list7 const & rhs) const
-    {
-        return
-
-            ref_compare( base_type::a1_, rhs.a1_, 0 ) &&
-            ref_compare( base_type::a2_, rhs.a2_, 0 ) &&
-            ref_compare( base_type::a3_, rhs.a3_, 0 ) &&
-            ref_compare( base_type::a4_, rhs.a4_, 0 ) &&
-            ref_compare( base_type::a5_, rhs.a5_, 0 ) &&
-            ref_compare( base_type::a6_, rhs.a6_, 0 ) &&
-            ref_compare( base_type::a7_, rhs.a7_, 0 );
-    }
-};
-
-template< class A1, class A2, class A3, class A4, class A5, class A6, class A7, class A8 > class list8: private storage8< A1, A2, A3, A4, A5, A6, A7, A8 >
-{
-private:
-
-    typedef storage8< A1, A2, A3, A4, A5, A6, A7, A8 > base_type;
-
-public:
-
-    list8( A1 a1, A2 a2, A3 a3, A4 a4, A5 a5, A6 a6, A7 a7, A8 a8 ): base_type( a1, a2, a3, a4, a5, a6, a7, a8 ) {}
-
-    A1 operator[] (boost::arg<1>) const { return base_type::a1_; }
-    A2 operator[] (boost::arg<2>) const { return base_type::a2_; }
-    A3 operator[] (boost::arg<3>) const { return base_type::a3_; }
-    A4 operator[] (boost::arg<4>) const { return base_type::a4_; }
-    A5 operator[] (boost::arg<5>) const { return base_type::a5_; }
-    A6 operator[] (boost::arg<6>) const { return base_type::a6_; }
-    A7 operator[] (boost::arg<7>) const { return base_type::a7_; }
-    A8 operator[] (boost::arg<8>) const { return base_type::a8_; }
-
-    A1 operator[] (boost::arg<1> (*) ()) const { return base_type::a1_; }
-    A2 operator[] (boost::arg<2> (*) ()) const { return base_type::a2_; }
-    A3 operator[] (boost::arg<3> (*) ()) const { return base_type::a3_; }
-    A4 operator[] (boost::arg<4> (*) ()) const { return base_type::a4_; }
-    A5 operator[] (boost::arg<5> (*) ()) const { return base_type::a5_; }
-    A6 operator[] (boost::arg<6> (*) ()) const { return base_type::a6_; }
-    A7 operator[] (boost::arg<7> (*) ()) const { return base_type::a7_; }
-    A8 operator[] (boost::arg<8> (*) ()) const { return base_type::a8_; }
-
-    template<class T> T & operator[] (_bi::value<T> & v) const { return v.get(); }
-
-    template<class T> T const & operator[] (_bi::value<T> const & v) const { return v.get(); }
-
-    template<class T> T & operator[] (reference_wrapper<T> const & v) const { return v.get(); }
-
-    template<class R, class F, class L> typename result_traits<R, F>::type operator[] (bind_t<R, F, L> & b) const { return b.eval(*this); }
-
-    template<class R, class F, class L> typename result_traits<R, F>::type operator[] (bind_t<R, F, L> const & b) const { return b.eval(*this); }
-
-    template<class R, class F, class A> R operator()(type<R>, F & f, A & a, long)
-    {
-        return unwrapper<F>::unwrap(f, 0)(a[base_type::a1_], a[base_type::a2_], a[base_type::a3_], a[base_type::a4_], a[base_type::a5_], a[base_type::a6_], a[base_type::a7_], a[base_type::a8_]);
-    }
-
-    template<class R, class F, class A> R operator()(type<R>, F const & f, A & a, long) const
-    {
-        return unwrapper<F const>::unwrap(f, 0)(a[base_type::a1_], a[base_type::a2_], a[base_type::a3_], a[base_type::a4_], a[base_type::a5_], a[base_type::a6_], a[base_type::a7_], a[base_type::a8_]);
-    }
-
-    template<class F, class A> void operator()(type<void>, F & f, A & a, int)
-    {
-        unwrapper<F>::unwrap(f, 0)(a[base_type::a1_], a[base_type::a2_], a[base_type::a3_], a[base_type::a4_], a[base_type::a5_], a[base_type::a6_], a[base_type::a7_], a[base_type::a8_]);
-    }
-
-    template<class F, class A> void operator()(type<void>, F const & f, A & a, int) const
-    {
-        unwrapper<F const>::unwrap(f, 0)(a[base_type::a1_], a[base_type::a2_], a[base_type::a3_], a[base_type::a4_], a[base_type::a5_], a[base_type::a6_], a[base_type::a7_], a[base_type::a8_]);
-    }
-
-    template<class V> void accept(V & v) const
-    {
-        base_type::accept(v);
-    }
-
-    bool operator==(list8 const & rhs) const
-    {
-        return
-            
-            ref_compare( base_type::a1_, rhs.a1_, 0 ) &&
-            ref_compare( base_type::a2_, rhs.a2_, 0 ) &&
-            ref_compare( base_type::a3_, rhs.a3_, 0 ) &&
-            ref_compare( base_type::a4_, rhs.a4_, 0 ) &&
-            ref_compare( base_type::a5_, rhs.a5_, 0 ) &&
-            ref_compare( base_type::a6_, rhs.a6_, 0 ) &&
-            ref_compare( base_type::a7_, rhs.a7_, 0 ) &&
-            ref_compare( base_type::a8_, rhs.a8_, 0 );
-    }
-};
-
-template<class A1, class A2, class A3, class A4, class A5, class A6, class A7, class A8, class A9> class list9: private storage9< A1, A2, A3, A4, A5, A6, A7, A8, A9 >
-{
-private:
-
-    typedef storage9< A1, A2, A3, A4, A5, A6, A7, A8, A9 > base_type;
-
-public:
-
-    list9( A1 a1, A2 a2, A3 a3, A4 a4, A5 a5, A6 a6, A7 a7, A8 a8, A9 a9 ): base_type( a1, a2, a3, a4, a5, a6, a7, a8, a9 ) {}
-
-    A1 operator[] (boost::arg<1>) const { return base_type::a1_; }
-    A2 operator[] (boost::arg<2>) const { return base_type::a2_; }
-    A3 operator[] (boost::arg<3>) const { return base_type::a3_; }
-    A4 operator[] (boost::arg<4>) const { return base_type::a4_; }
-    A5 operator[] (boost::arg<5>) const { return base_type::a5_; }
-    A6 operator[] (boost::arg<6>) const { return base_type::a6_; }
-    A7 operator[] (boost::arg<7>) const { return base_type::a7_; }
-    A8 operator[] (boost::arg<8>) const { return base_type::a8_; }
-    A9 operator[] (boost::arg<9>) const { return base_type::a9_; }
-
-    A1 operator[] (boost::arg<1> (*) ()) const { return base_type::a1_; }
-    A2 operator[] (boost::arg<2> (*) ()) const { return base_type::a2_; }
-    A3 operator[] (boost::arg<3> (*) ()) const { return base_type::a3_; }
-    A4 operator[] (boost::arg<4> (*) ()) const { return base_type::a4_; }
-    A5 operator[] (boost::arg<5> (*) ()) const { return base_type::a5_; }
-    A6 operator[] (boost::arg<6> (*) ()) const { return base_type::a6_; }
-    A7 operator[] (boost::arg<7> (*) ()) const { return base_type::a7_; }
-    A8 operator[] (boost::arg<8> (*) ()) const { return base_type::a8_; }
-    A9 operator[] (boost::arg<9> (*) ()) const { return base_type::a9_; }
-
-    template<class T> T & operator[] (_bi::value<T> & v) const { return v.get(); }
-
-    template<class T> T const & operator[] (_bi::value<T> const & v) const { return v.get(); }
-
-    template<class T> T & operator[] (reference_wrapper<T> const & v) const { return v.get(); }
-
-    template<class R, class F, class L> typename result_traits<R, F>::type operator[] (bind_t<R, F, L> & b) const { return b.eval(*this); }
-
-    template<class R, class F, class L> typename result_traits<R, F>::type operator[] (bind_t<R, F, L> const & b) const { return b.eval(*this); }
-
-    template<class R, class F, class A> R operator()(type<R>, F & f, A & a, long)
-    {
-        return unwrapper<F>::unwrap(f, 0)(a[base_type::a1_], a[base_type::a2_], a[base_type::a3_], a[base_type::a4_], a[base_type::a5_], a[base_type::a6_], a[base_type::a7_], a[base_type::a8_], a[base_type::a9_]);
-    }
-
-    template<class R, class F, class A> R operator()(type<R>, F const & f, A & a, long) const
-    {
-        return unwrapper<F const>::unwrap(f, 0)(a[base_type::a1_], a[base_type::a2_], a[base_type::a3_], a[base_type::a4_], a[base_type::a5_], a[base_type::a6_], a[base_type::a7_], a[base_type::a8_], a[base_type::a9_]);
-    }
-
-    template<class F, class A> void operator()(type<void>, F & f, A & a, int)
-    {
-        unwrapper<F>::unwrap(f, 0)(a[base_type::a1_], a[base_type::a2_], a[base_type::a3_], a[base_type::a4_], a[base_type::a5_], a[base_type::a6_], a[base_type::a7_], a[base_type::a8_], a[base_type::a9_]);
-    }
-
-    template<class F, class A> void operator()(type<void>, F const & f, A & a, int) const
-    {
-        unwrapper<F const>::unwrap(f, 0)(a[base_type::a1_], a[base_type::a2_], a[base_type::a3_], a[base_type::a4_], a[base_type::a5_], a[base_type::a6_], a[base_type::a7_], a[base_type::a8_], a[base_type::a9_]);
-    }
-
-    template<class V> void accept(V & v) const
-    {
-        base_type::accept(v);
-    }
-
-    bool operator==(list9 const & rhs) const
-    {
-        return
-
-            ref_compare( base_type::a1_, rhs.a1_, 0 ) &&
-            ref_compare( base_type::a2_, rhs.a2_, 0 ) &&
-            ref_compare( base_type::a3_, rhs.a3_, 0 ) &&
-            ref_compare( base_type::a4_, rhs.a4_, 0 ) &&
-            ref_compare( base_type::a5_, rhs.a5_, 0 ) &&
-            ref_compare( base_type::a6_, rhs.a6_, 0 ) &&
-            ref_compare( base_type::a7_, rhs.a7_, 0 ) &&
-            ref_compare( base_type::a8_, rhs.a8_, 0 ) &&
-            ref_compare( base_type::a9_, rhs.a9_, 0 );
-    }
-};
-
-#ifdef BOOST_MSVC
-#pragma warning(pop)
-#endif
-
-// bind_t
-
-#if !defined(BOOST_NO_CXX11_RVALUE_REFERENCES) && !(defined(BOOST_GCC) && BOOST_GCC < 40600)
-
-template< class A1 > class rrlist1
-{
-private:
-
-    A1 & a1_; // not A1&& because of msvc-10.0
-
-public:
-
-    explicit rrlist1( A1 & a1 ): a1_( a1 ) {}
-
-    A1 && operator[] (boost::arg<1>) const { return std::forward<A1>( a1_ ); } // not static_cast because of g++ 4.9
-
-    A1 && operator[] (boost::arg<1> (*) ()) const { return std::forward<A1>( a1_ ); }
-
-    template<class T> T & operator[] ( _bi::value<T> & v ) const { return v.get(); }
-
-    template<class T> T const & operator[] ( _bi::value<T> const & v ) const { return v.get(); }
-
-    template<class T> T & operator[] (reference_wrapper<T> const & v) const { return v.get(); }
-
-    template<class R, class F, class L> typename result_traits<R, F>::type operator[] (bind_t<R, F, L> & b) const
-    {
-        rrlist1<A1&> a( a1_ );
-        return b.eval( a );
-    }
-
-    template<class R, class F, class L> typename result_traits<R, F>::type operator[] (bind_t<R, F, L> const & b) const
-    {
-        rrlist1<A1&> a( a1_ );
-        return b.eval( a );
-    }
-};
-
-template< class A1, class A2 > class rrlist2
-{
-private:
-
-    A1 & a1_;
-    A2 & a2_;
-
-public:
-
-    rrlist2( A1 & a1, A2 & a2 ): a1_( a1 ), a2_( a2 ) {}
-
-    A1 && operator[] (boost::arg<1>) const { return std::forward<A1>( a1_ ); }
-    A2 && operator[] (boost::arg<2>) const { return std::forward<A2>( a2_ ); }
-
-    A1 && operator[] (boost::arg<1> (*) ()) const { return std::forward<A1>( a1_ ); }
-    A2 && operator[] (boost::arg<2> (*) ()) const { return std::forward<A2>( a2_ ); }
-
-    template<class T> T & operator[] ( _bi::value<T> & v ) const { return v.get(); }
-
-    template<class T> T const & operator[] ( _bi::value<T> const & v ) const { return v.get(); }
-
-    template<class T> T & operator[] (reference_wrapper<T> const & v) const { return v.get(); }
-
-    template<class R, class F, class L> typename result_traits<R, F>::type operator[] (bind_t<R, F, L> & b) const
-    {
-        rrlist2<A1&, A2&> a( a1_, a2_ );
-        return b.eval( a );
-    }
-
-    template<class R, class F, class L> typename result_traits<R, F>::type operator[] (bind_t<R, F, L> const & b) const
-    {
-        rrlist2<A1&, A2&> a( a1_, a2_ );
-        return b.eval( a );
-    }
-};
-
-template< class A1, class A2, class A3 > class rrlist3
-{
-private:
-
-    A1 & a1_;
-    A2 & a2_;
-    A3 & a3_;
-
-public:
-
-    rrlist3( A1 & a1, A2 & a2, A3 & a3 ): a1_( a1 ), a2_( a2 ), a3_( a3 ) {}
-
-    A1 && operator[] (boost::arg<1>) const { return std::forward<A1>( a1_ ); }
-    A2 && operator[] (boost::arg<2>) const { return std::forward<A2>( a2_ ); }
-    A3 && operator[] (boost::arg<3>) const { return std::forward<A3>( a3_ ); }
-
-    A1 && operator[] (boost::arg<1> (*) ()) const { return std::forward<A1>( a1_ ); }
-    A2 && operator[] (boost::arg<2> (*) ()) const { return std::forward<A2>( a2_ ); }
-    A3 && operator[] (boost::arg<3> (*) ()) const { return std::forward<A3>( a3_ ); }
-
-    template<class T> T & operator[] ( _bi::value<T> & v ) const { return v.get(); }
-
-    template<class T> T const & operator[] ( _bi::value<T> const & v ) const { return v.get(); }
-
-    template<class T> T & operator[] (reference_wrapper<T> const & v) const { return v.get(); }
-
-    template<class R, class F, class L> typename result_traits<R, F>::type operator[] (bind_t<R, F, L> & b) const
-    {
-        rrlist3<A1&, A2&, A3&> a( a1_, a2_, a3_ );
-        return b.eval( a );
-    }
-
-    template<class R, class F, class L> typename result_traits<R, F>::type operator[] (bind_t<R, F, L> const & b) const
-    {
-        rrlist3<A1&, A2&, A3&> a( a1_, a2_, a3_ );
-        return b.eval( a );
-    }
-};
-
-template< class A1, class A2, class A3, class A4 > class rrlist4
-{
-private:
-
-    A1 & a1_;
-    A2 & a2_;
-    A3 & a3_;
-    A4 & a4_;
-
-public:
-
-    rrlist4( A1 & a1, A2 & a2, A3 & a3, A4 & a4 ): a1_( a1 ), a2_( a2 ), a3_( a3 ), a4_( a4 ) {}
-
-    A1 && operator[] (boost::arg<1>) const { return std::forward<A1>( a1_ ); }
-    A2 && operator[] (boost::arg<2>) const { return std::forward<A2>( a2_ ); }
-    A3 && operator[] (boost::arg<3>) const { return std::forward<A3>( a3_ ); }
-    A4 && operator[] (boost::arg<4>) const { return std::forward<A4>( a4_ ); }
-
-    A1 && operator[] (boost::arg<1> (*) ()) const { return std::forward<A1>( a1_ ); }
-    A2 && operator[] (boost::arg<2> (*) ()) const { return std::forward<A2>( a2_ ); }
-    A3 && operator[] (boost::arg<3> (*) ()) const { return std::forward<A3>( a3_ ); }
-    A4 && operator[] (boost::arg<4> (*) ()) const { return std::forward<A4>( a4_ ); }
-
-    template<class T> T & operator[] ( _bi::value<T> & v ) const { return v.get(); }
-
-    template<class T> T const & operator[] ( _bi::value<T> const & v ) const { return v.get(); }
-
-    template<class T> T & operator[] (reference_wrapper<T> const & v) const { return v.get(); }
-
-    template<class R, class F, class L> typename result_traits<R, F>::type operator[] (bind_t<R, F, L> & b) const
-    {
-        rrlist4<A1&, A2&, A3&, A4&> a( a1_, a2_, a3_, a4_ );
-        return b.eval( a );
-    }
-
-    template<class R, class F, class L> typename result_traits<R, F>::type operator[] (bind_t<R, F, L> const & b) const
-    {
-        rrlist4<A1&, A2&, A3&, A4&> a( a1_, a2_, a3_, a4_ );
-        return b.eval( a );
-    }
-};
-
-template< class A1, class A2, class A3, class A4, class A5 > class rrlist5
-{
-private:
-
-    A1 & a1_;
-    A2 & a2_;
-    A3 & a3_;
-    A4 & a4_;
-    A5 & a5_;
-
-public:
-
-    rrlist5( A1 & a1, A2 & a2, A3 & a3, A4 & a4, A5 & a5 ): a1_( a1 ), a2_( a2 ), a3_( a3 ), a4_( a4 ), a5_( a5 ) {}
-
-    A1 && operator[] (boost::arg<1>) const { return std::forward<A1>( a1_ ); }
-    A2 && operator[] (boost::arg<2>) const { return std::forward<A2>( a2_ ); }
-    A3 && operator[] (boost::arg<3>) const { return std::forward<A3>( a3_ ); }
-    A4 && operator[] (boost::arg<4>) const { return std::forward<A4>( a4_ ); }
-    A5 && operator[] (boost::arg<5>) const { return std::forward<A5>( a5_ ); }
-
-    A1 && operator[] (boost::arg<1> (*) ()) const { return std::forward<A1>( a1_ ); }
-    A2 && operator[] (boost::arg<2> (*) ()) const { return std::forward<A2>( a2_ ); }
-    A3 && operator[] (boost::arg<3> (*) ()) const { return std::forward<A3>( a3_ ); }
-    A4 && operator[] (boost::arg<4> (*) ()) const { return std::forward<A4>( a4_ ); }
-    A5 && operator[] (boost::arg<5> (*) ()) const { return std::forward<A5>( a5_ ); }
-
-    template<class T> T & operator[] ( _bi::value<T> & v ) const { return v.get(); }
-
-    template<class T> T const & operator[] ( _bi::value<T> const & v ) const { return v.get(); }
-
-    template<class T> T & operator[] (reference_wrapper<T> const & v) const { return v.get(); }
-
-    template<class R, class F, class L> typename result_traits<R, F>::type operator[] (bind_t<R, F, L> & b) const
-    {
-        rrlist5<A1&, A2&, A3&, A4&, A5&> a( a1_, a2_, a3_, a4_, a5_ );
-        return b.eval( a );
-    }
-
-    template<class R, class F, class L> typename result_traits<R, F>::type operator[] (bind_t<R, F, L> const & b) const
-    {
-        rrlist5<A1&, A2&, A3&, A4&, A5&> a( a1_, a2_, a3_, a4_, a5_ );
-        return b.eval( a );
-    }
-};
-
-template< class A1, class A2, class A3, class A4, class A5, class A6 > class rrlist6
-{
-private:
-
-    A1 & a1_;
-    A2 & a2_;
-    A3 & a3_;
-    A4 & a4_;
-    A5 & a5_;
-    A6 & a6_;
-
-public:
-
-    rrlist6( A1 & a1, A2 & a2, A3 & a3, A4 & a4, A5 & a5, A6 & a6 ): a1_( a1 ), a2_( a2 ), a3_( a3 ), a4_( a4 ), a5_( a5 ), a6_( a6 ) {}
-
-    A1 && operator[] (boost::arg<1>) const { return std::forward<A1>( a1_ ); }
-    A2 && operator[] (boost::arg<2>) const { return std::forward<A2>( a2_ ); }
-    A3 && operator[] (boost::arg<3>) const { return std::forward<A3>( a3_ ); }
-    A4 && operator[] (boost::arg<4>) const { return std::forward<A4>( a4_ ); }
-    A5 && operator[] (boost::arg<5>) const { return std::forward<A5>( a5_ ); }
-    A6 && operator[] (boost::arg<6>) const { return std::forward<A6>( a6_ ); }
-
-    A1 && operator[] (boost::arg<1> (*) ()) const { return std::forward<A1>( a1_ ); }
-    A2 && operator[] (boost::arg<2> (*) ()) const { return std::forward<A2>( a2_ ); }
-    A3 && operator[] (boost::arg<3> (*) ()) const { return std::forward<A3>( a3_ ); }
-    A4 && operator[] (boost::arg<4> (*) ()) const { return std::forward<A4>( a4_ ); }
-    A5 && operator[] (boost::arg<5> (*) ()) const { return std::forward<A5>( a5_ ); }
-    A6 && operator[] (boost::arg<6> (*) ()) const { return std::forward<A6>( a6_ ); }
-
-    template<class T> T & operator[] ( _bi::value<T> & v ) const { return v.get(); }
-
-    template<class T> T const & operator[] ( _bi::value<T> const & v ) const { return v.get(); }
-
-    template<class T> T & operator[] (reference_wrapper<T> const & v) const { return v.get(); }
-
-    template<class R, class F, class L> typename result_traits<R, F>::type operator[] (bind_t<R, F, L> & b) const
-    {
-        rrlist6<A1&, A2&, A3&, A4&, A5&, A6&> a( a1_, a2_, a3_, a4_, a5_, a6_ );
-        return b.eval( a );
-    }
-
-    template<class R, class F, class L> typename result_traits<R, F>::type operator[] (bind_t<R, F, L> const & b) const
-    {
-        rrlist6<A1&, A2&, A3&, A4&, A5&, A6&> a( a1_, a2_, a3_, a4_, a5_, a6_ );
-        return b.eval( a );
-    }
-};
-
-template< class A1, class A2, class A3, class A4, class A5, class A6, class A7 > class rrlist7
-{
-private:
-
-    A1 & a1_;
-    A2 & a2_;
-    A3 & a3_;
-    A4 & a4_;
-    A5 & a5_;
-    A6 & a6_;
-    A7 & a7_;
-
-public:
-
-    rrlist7( A1 & a1, A2 & a2, A3 & a3, A4 & a4, A5 & a5, A6 & a6, A7 & a7 ): a1_( a1 ), a2_( a2 ), a3_( a3 ), a4_( a4 ), a5_( a5 ), a6_( a6 ), a7_( a7 ) {}
-
-    A1 && operator[] (boost::arg<1>) const { return std::forward<A1>( a1_ ); }
-    A2 && operator[] (boost::arg<2>) const { return std::forward<A2>( a2_ ); }
-    A3 && operator[] (boost::arg<3>) const { return std::forward<A3>( a3_ ); }
-    A4 && operator[] (boost::arg<4>) const { return std::forward<A4>( a4_ ); }
-    A5 && operator[] (boost::arg<5>) const { return std::forward<A5>( a5_ ); }
-    A6 && operator[] (boost::arg<6>) const { return std::forward<A6>( a6_ ); }
-    A7 && operator[] (boost::arg<7>) const { return std::forward<A7>( a7_ ); }
-
-    A1 && operator[] (boost::arg<1> (*) ()) const { return std::forward<A1>( a1_ ); }
-    A2 && operator[] (boost::arg<2> (*) ()) const { return std::forward<A2>( a2_ ); }
-    A3 && operator[] (boost::arg<3> (*) ()) const { return std::forward<A3>( a3_ ); }
-    A4 && operator[] (boost::arg<4> (*) ()) const { return std::forward<A4>( a4_ ); }
-    A5 && operator[] (boost::arg<5> (*) ()) const { return std::forward<A5>( a5_ ); }
-    A6 && operator[] (boost::arg<6> (*) ()) const { return std::forward<A6>( a6_ ); }
-    A7 && operator[] (boost::arg<7> (*) ()) const { return std::forward<A7>( a7_ ); }
-
-    template<class T> T & operator[] ( _bi::value<T> & v ) const { return v.get(); }
-
-    template<class T> T const & operator[] ( _bi::value<T> const & v ) const { return v.get(); }
-
-    template<class T> T & operator[] (reference_wrapper<T> const & v) const { return v.get(); }
-
-    template<class R, class F, class L> typename result_traits<R, F>::type operator[] (bind_t<R, F, L> & b) const
-    {
-        rrlist7<A1&, A2&, A3&, A4&, A5&, A6&, A7&> a( a1_, a2_, a3_, a4_, a5_, a6_, a7_ );
-        return b.eval( a );
-    }
-
-    template<class R, class F, class L> typename result_traits<R, F>::type operator[] (bind_t<R, F, L> const & b) const
-    {
-        rrlist7<A1&, A2&, A3&, A4&, A5&, A6&, A7&> a( a1_, a2_, a3_, a4_, a5_, a6_, a7_ );
-        return b.eval( a );
-    }
-};
-
-template< class A1, class A2, class A3, class A4, class A5, class A6, class A7, class A8 > class rrlist8
-{
-private:
-
-    A1 & a1_;
-    A2 & a2_;
-    A3 & a3_;
-    A4 & a4_;
-    A5 & a5_;
-    A6 & a6_;
-    A7 & a7_;
-    A8 & a8_;
-
-public:
-
-    rrlist8( A1 & a1, A2 & a2, A3 & a3, A4 & a4, A5 & a5, A6 & a6, A7 & a7, A8 & a8 ): a1_( a1 ), a2_( a2 ), a3_( a3 ), a4_( a4 ), a5_( a5 ), a6_( a6 ), a7_( a7 ), a8_( a8 ) {}
-
-    A1 && operator[] (boost::arg<1>) const { return std::forward<A1>( a1_ ); }
-    A2 && operator[] (boost::arg<2>) const { return std::forward<A2>( a2_ ); }
-    A3 && operator[] (boost::arg<3>) const { return std::forward<A3>( a3_ ); }
-    A4 && operator[] (boost::arg<4>) const { return std::forward<A4>( a4_ ); }
-    A5 && operator[] (boost::arg<5>) const { return std::forward<A5>( a5_ ); }
-    A6 && operator[] (boost::arg<6>) const { return std::forward<A6>( a6_ ); }
-    A7 && operator[] (boost::arg<7>) const { return std::forward<A7>( a7_ ); }
-    A8 && operator[] (boost::arg<8>) const { return std::forward<A8>( a8_ ); }
-
-    A1 && operator[] (boost::arg<1> (*) ()) const { return std::forward<A1>( a1_ ); }
-    A2 && operator[] (boost::arg<2> (*) ()) const { return std::forward<A2>( a2_ ); }
-    A3 && operator[] (boost::arg<3> (*) ()) const { return std::forward<A3>( a3_ ); }
-    A4 && operator[] (boost::arg<4> (*) ()) const { return std::forward<A4>( a4_ ); }
-    A5 && operator[] (boost::arg<5> (*) ()) const { return std::forward<A5>( a5_ ); }
-    A6 && operator[] (boost::arg<6> (*) ()) const { return std::forward<A6>( a6_ ); }
-    A7 && operator[] (boost::arg<7> (*) ()) const { return std::forward<A7>( a7_ ); }
-    A8 && operator[] (boost::arg<8> (*) ()) const { return std::forward<A8>( a8_ ); }
-
-    template<class T> T & operator[] ( _bi::value<T> & v ) const { return v.get(); }
-
-    template<class T> T const & operator[] ( _bi::value<T> const & v ) const { return v.get(); }
-
-    template<class T> T & operator[] (reference_wrapper<T> const & v) const { return v.get(); }
-
-    template<class R, class F, class L> typename result_traits<R, F>::type operator[] (bind_t<R, F, L> & b) const
-    {
-        rrlist8<A1&, A2&, A3&, A4&, A5&, A6&, A7&, A8&> a( a1_, a2_, a3_, a4_, a5_, a6_, a7_, a8_ );
-        return b.eval( a );
-    }
-
-    template<class R, class F, class L> typename result_traits<R, F>::type operator[] (bind_t<R, F, L> const & b) const
-    {
-        rrlist8<A1&, A2&, A3&, A4&, A5&, A6&, A7&, A8&> a( a1_, a2_, a3_, a4_, a5_, a6_, a7_, a8_ );
-        return b.eval( a );
-    }
-};
-
-template< class A1, class A2, class A3, class A4, class A5, class A6, class A7, class A8, class A9 > class rrlist9
-{
-private:
-
-    A1 & a1_;
-    A2 & a2_;
-    A3 & a3_;
-    A4 & a4_;
-    A5 & a5_;
-    A6 & a6_;
-    A7 & a7_;
-    A8 & a8_;
-    A9 & a9_;
-
-public:
-
-    rrlist9( A1 & a1, A2 & a2, A3 & a3, A4 & a4, A5 & a5, A6 & a6, A7 & a7, A8 & a8, A9 & a9 ): a1_( a1 ), a2_( a2 ), a3_( a3 ), a4_( a4 ), a5_( a5 ), a6_( a6 ), a7_( a7 ), a8_( a8 ), a9_( a9 ) {}
-
-    A1 && operator[] (boost::arg<1>) const { return std::forward<A1>( a1_ ); }
-    A2 && operator[] (boost::arg<2>) const { return std::forward<A2>( a2_ ); }
-    A3 && operator[] (boost::arg<3>) const { return std::forward<A3>( a3_ ); }
-    A4 && operator[] (boost::arg<4>) const { return std::forward<A4>( a4_ ); }
-    A5 && operator[] (boost::arg<5>) const { return std::forward<A5>( a5_ ); }
-    A6 && operator[] (boost::arg<6>) const { return std::forward<A6>( a6_ ); }
-    A7 && operator[] (boost::arg<7>) const { return std::forward<A7>( a7_ ); }
-    A8 && operator[] (boost::arg<8>) const { return std::forward<A8>( a8_ ); }
-    A9 && operator[] (boost::arg<9>) const { return std::forward<A9>( a9_ ); }
-
-    A1 && operator[] (boost::arg<1> (*) ()) const { return std::forward<A1>( a1_ ); }
-    A2 && operator[] (boost::arg<2> (*) ()) const { return std::forward<A2>( a2_ ); }
-    A3 && operator[] (boost::arg<3> (*) ()) const { return std::forward<A3>( a3_ ); }
-    A4 && operator[] (boost::arg<4> (*) ()) const { return std::forward<A4>( a4_ ); }
-    A5 && operator[] (boost::arg<5> (*) ()) const { return std::forward<A5>( a5_ ); }
-    A6 && operator[] (boost::arg<6> (*) ()) const { return std::forward<A6>( a6_ ); }
-    A7 && operator[] (boost::arg<7> (*) ()) const { return std::forward<A7>( a7_ ); }
-    A8 && operator[] (boost::arg<8> (*) ()) const { return std::forward<A8>( a8_ ); }
-    A9 && operator[] (boost::arg<9> (*) ()) const { return std::forward<A9>( a9_ ); }
-
-    template<class T> T & operator[] ( _bi::value<T> & v ) const { return v.get(); }
-
-    template<class T> T const & operator[] ( _bi::value<T> const & v ) const { return v.get(); }
-
-    template<class T> T & operator[] (reference_wrapper<T> const & v) const { return v.get(); }
-
-    template<class R, class F, class L> typename result_traits<R, F>::type operator[] (bind_t<R, F, L> & b) const
-    {
-        rrlist9<A1&, A2&, A3&, A4&, A5&, A6&, A7&, A8&, A9&> a( a1_, a2_, a3_, a4_, a5_, a6_, a7_, a8_, a9_ );
-        return b.eval( a );
-    }
-
-    template<class R, class F, class L> typename result_traits<R, F>::type operator[] (bind_t<R, F, L> const & b) const
-    {
-        rrlist9<A1&, A2&, A3&, A4&, A5&, A6&, A7&, A8&, A9&> a( a1_, a2_, a3_, a4_, a5_, a6_, a7_, a8_, a9_ );
-        return b.eval( a );
-    }
-};
-
-template<class R, class F, class L> class bind_t
-{
-private:
-
-    F f_;
-    L l_;
-
-public:
-
-    typedef typename result_traits<R, F>::type result_type;
-    typedef bind_t this_type;
-
-    bind_t( F f, L const & l ): f_( f ), l_( l ) {}
-
-    //
-
-    result_type operator()()
-    {
-        list0 a;
-        return l_( type<result_type>(), f_, a, 0 );
-    }
-
-    result_type operator()() const
-    {
-        list0 a;
-        return l_( type<result_type>(), f_, a, 0 );
-    }
-
-    template<class A1> result_type operator()( A1 && a1 )
-    {
-        rrlist1< A1 > a( a1 );
-        return l_( type<result_type>(), f_, a, 0 );
-    }
-
-    template<class A1> result_type operator()( A1 && a1 ) const
-    {
-        rrlist1< A1 > a( a1 );
-        return l_(type<result_type>(), f_, a, 0);
-    }
-
-    template<class A1, class A2> result_type operator()( A1 && a1, A2 && a2 )
-    {
-        rrlist2< A1, A2 > a( a1, a2 );
-        return l_( type<result_type>(), f_, a, 0 );
-    }
-
-    template<class A1, class A2> result_type operator()( A1 && a1, A2 && a2 ) const
-    {
-        rrlist2< A1, A2 > a( a1, a2 );
-        return l_( type<result_type>(), f_, a, 0 );
-    }
-
-    template<class A1, class A2, class A3> result_type operator()( A1 && a1, A2 && a2, A3 && a3 )
-    {
-        rrlist3< A1, A2, A3 > a( a1, a2, a3 );
-        return l_( type<result_type>(), f_, a, 0 );
-    }
-
-    template<class A1, class A2, class A3> result_type operator()( A1 && a1, A2 && a2, A3 && a3 ) const
-    {
-        rrlist3< A1, A2, A3 > a( a1, a2, a3 );
-        return l_( type<result_type>(), f_, a, 0 );
-    }
-
-    template<class A1, class A2, class A3, class A4> result_type operator()( A1 && a1, A2 && a2, A3 && a3, A4 && a4 )
-    {
-        rrlist4< A1, A2, A3, A4 > a( a1, a2, a3, a4 );
-        return l_( type<result_type>(), f_, a, 0 );
-    }
-
-    template<class A1, class A2, class A3, class A4> result_type operator()( A1 && a1, A2 && a2, A3 && a3, A4 && a4 ) const
-    {
-        rrlist4< A1, A2, A3, A4 > a( a1, a2, a3, a4 );
-        return l_( type<result_type>(), f_, a, 0 );
-    }
-
-    template<class A1, class A2, class A3, class A4, class A5> result_type operator()( A1 && a1, A2 && a2, A3 && a3, A4 && a4, A5 && a5 )
-    {
-        rrlist5< A1, A2, A3, A4, A5 > a( a1, a2, a3, a4, a5 );
-        return l_( type<result_type>(), f_, a, 0 );
-    }
-
-    template<class A1, class A2, class A3, class A4, class A5> result_type operator()( A1 && a1, A2 && a2, A3 && a3, A4 && a4, A5 && a5 ) const
-    {
-        rrlist5< A1, A2, A3, A4, A5 > a( a1, a2, a3, a4, a5 );
-        return l_( type<result_type>(), f_, a, 0 );
-    }
-
-    template<class A1, class A2, class A3, class A4, class A5, class A6> result_type operator()( A1 && a1, A2 && a2, A3 && a3, A4 && a4, A5 && a5, A6 && a6 )
-    {
-        rrlist6< A1, A2, A3, A4, A5, A6 > a( a1, a2, a3, a4, a5, a6 );
-        return l_( type<result_type>(), f_, a, 0 );
-    }
-
-    template<class A1, class A2, class A3, class A4, class A5, class A6> result_type operator()( A1 && a1, A2 && a2, A3 && a3, A4 && a4, A5 && a5, A6 && a6 ) const
-    {
-        rrlist6< A1, A2, A3, A4, A5, A6 > a( a1, a2, a3, a4, a5, a6 );
-        return l_( type<result_type>(), f_, a, 0 );
-    }
-
-    template<class A1, class A2, class A3, class A4, class A5, class A6, class A7> result_type operator()( A1 && a1, A2 && a2, A3 && a3, A4 && a4, A5 && a5, A6 && a6, A7 && a7 )
-    {
-        rrlist7< A1, A2, A3, A4, A5, A6, A7 > a( a1, a2, a3, a4, a5, a6, a7 );
-        return l_( type<result_type>(), f_, a, 0 );
-    }
-
-    template<class A1, class A2, class A3, class A4, class A5, class A6, class A7> result_type operator()( A1 && a1, A2 && a2, A3 && a3, A4 && a4, A5 && a5, A6 && a6, A7 && a7 ) const
-    {
-        rrlist7< A1, A2, A3, A4, A5, A6, A7 > a( a1, a2, a3, a4, a5, a6, a7 );
-        return l_( type<result_type>(), f_, a, 0 );
-    }
-
-    template<class A1, class A2, class A3, class A4, class A5, class A6, class A7, class A8> result_type operator()( A1 && a1, A2 && a2, A3 && a3, A4 && a4, A5 && a5, A6 && a6, A7 && a7, A8 && a8 )
-    {
-        rrlist8< A1, A2, A3, A4, A5, A6, A7, A8 > a( a1, a2, a3, a4, a5, a6, a7, a8 );
-        return l_( type<result_type>(), f_, a, 0 );
-    }
-
-    template<class A1, class A2, class A3, class A4, class A5, class A6, class A7, class A8> result_type operator()( A1 && a1, A2 && a2, A3 && a3, A4 && a4, A5 && a5, A6 && a6, A7 && a7, A8 && a8 ) const
-    {
-        rrlist8< A1, A2, A3, A4, A5, A6, A7, A8 > a( a1, a2, a3, a4, a5, a6, a7, a8 );
-        return l_( type<result_type>(), f_, a, 0 );
-    }
-
-    template<class A1, class A2, class A3, class A4, class A5, class A6, class A7, class A8, class A9> result_type operator()( A1 && a1, A2 && a2, A3 && a3, A4 && a4, A5 && a5, A6 && a6, A7 && a7, A8 && a8, A9 && a9 )
-    {
-        rrlist9< A1, A2, A3, A4, A5, A6, A7, A8, A9 > a( a1, a2, a3, a4, a5, a6, a7, a8, a9 );
-        return l_( type<result_type>(), f_, a, 0 );
-    }
-
-    template<class A1, class A2, class A3, class A4, class A5, class A6, class A7, class A8, class A9> result_type operator()( A1 && a1, A2 && a2, A3 && a3, A4 && a4, A5 && a5, A6 && a6, A7 && a7, A8 && a8, A9 && a9 ) const
-    {
-        rrlist9< A1, A2, A3, A4, A5, A6, A7, A8, A9 > a( a1, a2, a3, a4, a5, a6, a7, a8, a9 );
-        return l_( type<result_type>(), f_, a, 0 );
-    }
-
-    //
-
-    template<class A> result_type eval( A & a )
-    {
-        return l_( type<result_type>(), f_, a, 0 );
-    }
-
-    template<class A> result_type eval( A & a ) const
-    {
-        return l_( type<result_type>(), f_, a, 0 );
-    }
-
-    template<class V> void accept( V & v ) const
-    {
-#if !defined( BOOST_NO_ARGUMENT_DEPENDENT_LOOKUP ) && !defined( BOOST_BORLANDC )
-        using boost::visit_each;
-#endif
-
-        BOOST_BIND_VISIT_EACH( v, f_, 0 );
-        l_.accept( v );
-    }
-
-    bool compare( this_type const & rhs ) const
-    {
-        return ref_compare( f_, rhs.f_, 0 ) && l_ == rhs.l_;
-    }
-};
-
-#elif !defined( BOOST_NO_VOID_RETURNS )
-
-template<class R, class F, class L> class bind_t
-{
-public:
-
-    typedef bind_t this_type;
-
-    bind_t(F f, L const & l): f_(f), l_(l) {}
-
-#define BOOST_BIND_RETURN return
-#include <boost/bind/bind_template.hpp>
-#undef BOOST_BIND_RETURN
-
-};
-
-#else // no void returns
-
-template<class R> struct bind_t_generator
-{
-
-template<class F, class L> class implementation
-{
-public:
-
-    typedef implementation this_type;
-
-    implementation(F f, L const & l): f_(f), l_(l) {}
-
-#define BOOST_BIND_RETURN return
-#include <boost/bind/bind_template.hpp>
-#undef BOOST_BIND_RETURN
-
-};
-
-};
-
-template<> struct bind_t_generator<void>
-{
-
-template<class F, class L> class implementation
-{
-private:
-
-    typedef void R;
-
-public:
-
-    typedef implementation this_type;
-
-    implementation(F f, L const & l): f_(f), l_(l) {}
-
-#define BOOST_BIND_RETURN
-#include <boost/bind/bind_template.hpp>
-#undef BOOST_BIND_RETURN
-
-};
-
-};
-
-template<class R2, class F, class L> class bind_t: public bind_t_generator<R2>::BOOST_NESTED_TEMPLATE implementation<F, L>
-{
-public:
-
-    bind_t(F f, L const & l): bind_t_generator<R2>::BOOST_NESTED_TEMPLATE implementation<F, L>(f, l) {}
-
-};
-
-#endif
-
-// function_equal
-
-#ifndef BOOST_NO_ARGUMENT_DEPENDENT_LOOKUP
-
-// put overloads in _bi, rely on ADL
-
-# ifndef BOOST_NO_FUNCTION_TEMPLATE_ORDERING
-
-template<class R, class F, class L> bool function_equal( bind_t<R, F, L> const & a, bind_t<R, F, L> const & b )
-{
-    return a.compare(b);
-}
-
-# else
-
-template<class R, class F, class L> bool function_equal_impl( bind_t<R, F, L> const & a, bind_t<R, F, L> const & b, int )
-{
-    return a.compare(b);
-}
-
-# endif // #ifndef BOOST_NO_FUNCTION_TEMPLATE_ORDERING
-
-#else // BOOST_NO_ARGUMENT_DEPENDENT_LOOKUP
-
-// put overloads in boost
-
-} // namespace _bi
-
-# ifndef BOOST_NO_FUNCTION_TEMPLATE_ORDERING
-
-template<class R, class F, class L> bool function_equal( _bi::bind_t<R, F, L> const & a, _bi::bind_t<R, F, L> const & b )
-{
-    return a.compare(b);
-}
-
-# else
-
-template<class R, class F, class L> bool function_equal_impl( _bi::bind_t<R, F, L> const & a, _bi::bind_t<R, F, L> const & b, int )
-{
-    return a.compare(b);
-}
-
-# endif // #ifndef BOOST_NO_FUNCTION_TEMPLATE_ORDERING
-
-namespace _bi
-{
-
-#endif // BOOST_NO_ARGUMENT_DEPENDENT_LOOKUP
-
-// add_value
-
-#if !defined(BOOST_NO_TEMPLATE_PARTIAL_SPECIALIZATION) || (__SUNPRO_CC >= 0x530)
-
-#if defined( BOOST_BORLANDC ) && BOOST_WORKAROUND( BOOST_BORLANDC, BOOST_TESTED_AT(0x582) )
-
-template<class T> struct add_value
-{
-    typedef _bi::value<T> type;
-};
-
-#else
-
-template< class T, int I > struct add_value_2
-{
-    typedef boost::arg<I> type;
-};
-
-template< class T > struct add_value_2< T, 0 >
-{
-    typedef _bi::value< T > type;
-};
-
-template<class T> struct add_value
-{
-    typedef typename add_value_2< T, boost::is_placeholder< T >::value >::type type;
-};
-
-#endif
-
-template<class T> struct add_value< value<T> >
-{
-    typedef _bi::value<T> type;
-};
-
-template<class T> struct add_value< reference_wrapper<T> >
-{
-    typedef reference_wrapper<T> type;
-};
-
-template<int I> struct add_value< arg<I> >
-{
-    typedef boost::arg<I> type;
-};
-
-template<int I> struct add_value< arg<I> (*) () >
-{
-    typedef boost::arg<I> (*type) ();
-};
-
-template<class R, class F, class L> struct add_value< bind_t<R, F, L> >
-{
-    typedef bind_t<R, F, L> type;
-};
-
-#else
-
-template<int I> struct _avt_0;
-
-template<> struct _avt_0<1>
-{
-    template<class T> struct inner
-    {
-        typedef T type;
-    };
-};
-
-template<> struct _avt_0<2>
-{
-    template<class T> struct inner
-    {
-        typedef value<T> type;
-    };
-};
-
-typedef char (&_avt_r1) [1];
-typedef char (&_avt_r2) [2];
-
-template<class T> _avt_r1 _avt_f(value<T>);
-template<class T> _avt_r1 _avt_f(reference_wrapper<T>);
-template<int I> _avt_r1 _avt_f(arg<I>);
-template<int I> _avt_r1 _avt_f(arg<I> (*) ());
-template<class R, class F, class L> _avt_r1 _avt_f(bind_t<R, F, L>);
-
-_avt_r2 _avt_f(...);
-
-template<class T> struct add_value
-{
-    static T t();
-    typedef typename _avt_0<sizeof(_avt_f(t()))>::template inner<T>::type type;
-};
-
-#endif
-
-// list_av_N
-
-template<class A1> struct list_av_1
-{
-    typedef typename add_value<A1>::type B1;
-    typedef list1<B1> type;
-};
-
-template<class A1, class A2> struct list_av_2
-{
-    typedef typename add_value<A1>::type B1;
-    typedef typename add_value<A2>::type B2;
-    typedef list2<B1, B2> type;
-};
-
-template<class A1, class A2, class A3> struct list_av_3
-{
-    typedef typename add_value<A1>::type B1;
-    typedef typename add_value<A2>::type B2;
-    typedef typename add_value<A3>::type B3;
-    typedef list3<B1, B2, B3> type;
-};
-
-template<class A1, class A2, class A3, class A4> struct list_av_4
-{
-    typedef typename add_value<A1>::type B1;
-    typedef typename add_value<A2>::type B2;
-    typedef typename add_value<A3>::type B3;
-    typedef typename add_value<A4>::type B4;
-    typedef list4<B1, B2, B3, B4> type;
-};
-
-template<class A1, class A2, class A3, class A4, class A5> struct list_av_5
-{
-    typedef typename add_value<A1>::type B1;
-    typedef typename add_value<A2>::type B2;
-    typedef typename add_value<A3>::type B3;
-    typedef typename add_value<A4>::type B4;
-    typedef typename add_value<A5>::type B5;
-    typedef list5<B1, B2, B3, B4, B5> type;
-};
-
-template<class A1, class A2, class A3, class A4, class A5, class A6> struct list_av_6
-{
-    typedef typename add_value<A1>::type B1;
-    typedef typename add_value<A2>::type B2;
-    typedef typename add_value<A3>::type B3;
-    typedef typename add_value<A4>::type B4;
-    typedef typename add_value<A5>::type B5;
-    typedef typename add_value<A6>::type B6;
-    typedef list6<B1, B2, B3, B4, B5, B6> type;
-};
-
-template<class A1, class A2, class A3, class A4, class A5, class A6, class A7> struct list_av_7
-{
-    typedef typename add_value<A1>::type B1;
-    typedef typename add_value<A2>::type B2;
-    typedef typename add_value<A3>::type B3;
-    typedef typename add_value<A4>::type B4;
-    typedef typename add_value<A5>::type B5;
-    typedef typename add_value<A6>::type B6;
-    typedef typename add_value<A7>::type B7;
-    typedef list7<B1, B2, B3, B4, B5, B6, B7> type;
-};
-
-template<class A1, class A2, class A3, class A4, class A5, class A6, class A7, class A8> struct list_av_8
-{
-    typedef typename add_value<A1>::type B1;
-    typedef typename add_value<A2>::type B2;
-    typedef typename add_value<A3>::type B3;
-    typedef typename add_value<A4>::type B4;
-    typedef typename add_value<A5>::type B5;
-    typedef typename add_value<A6>::type B6;
-    typedef typename add_value<A7>::type B7;
-    typedef typename add_value<A8>::type B8;
-    typedef list8<B1, B2, B3, B4, B5, B6, B7, B8> type;
-};
-
-template<class A1, class A2, class A3, class A4, class A5, class A6, class A7, class A8, class A9> struct list_av_9
-{
-    typedef typename add_value<A1>::type B1;
-    typedef typename add_value<A2>::type B2;
-    typedef typename add_value<A3>::type B3;
-    typedef typename add_value<A4>::type B4;
-    typedef typename add_value<A5>::type B5;
-    typedef typename add_value<A6>::type B6;
-    typedef typename add_value<A7>::type B7;
-    typedef typename add_value<A8>::type B8;
-    typedef typename add_value<A9>::type B9;
-    typedef list9<B1, B2, B3, B4, B5, B6, B7, B8, B9> type;
-};
-
-// operator!
-
-struct logical_not
-{
-    template<class V> bool operator()(V const & v) const { return !v; }
-};
-
-template<class R, class F, class L>
-    bind_t< bool, logical_not, list1< bind_t<R, F, L> > >
-    operator! (bind_t<R, F, L> const & f)
-{
-    typedef list1< bind_t<R, F, L> > list_type;
-    return bind_t<bool, logical_not, list_type> ( logical_not(), list_type(f) );
-}
-
-// relational operators
-
-#define BOOST_BIND_OPERATOR( op, name ) \
-\
-struct name \
-{ \
-    template<class V, class W> bool operator()(V const & v, W const & w) const { return v op w; } \
-}; \
- \
-template<class R, class F, class L, class A2> \
-    bind_t< bool, name, list2< bind_t<R, F, L>, typename add_value<A2>::type > > \
-    operator op (bind_t<R, F, L> const & f, A2 a2) \
-{ \
-    typedef typename add_value<A2>::type B2; \
-    typedef list2< bind_t<R, F, L>, B2> list_type; \
-    return bind_t<bool, name, list_type> ( name(), list_type(f, a2) ); \
-}
-
-BOOST_BIND_OPERATOR( ==, equal )
-BOOST_BIND_OPERATOR( !=, not_equal )
-
-BOOST_BIND_OPERATOR( <, less )
-BOOST_BIND_OPERATOR( <=, less_equal )
-
-BOOST_BIND_OPERATOR( >, greater )
-BOOST_BIND_OPERATOR( >=, greater_equal )
-
-BOOST_BIND_OPERATOR( &&, logical_and )
-BOOST_BIND_OPERATOR( ||, logical_or )
-
-#undef BOOST_BIND_OPERATOR
-
-#if defined(__GNUC__) && BOOST_WORKAROUND(__GNUC__, < 3)
-
-// resolve ambiguity with rel_ops
-
-#define BOOST_BIND_OPERATOR( op, name ) \
-\
-template<class R, class F, class L> \
-    bind_t< bool, name, list2< bind_t<R, F, L>, bind_t<R, F, L> > > \
-    operator op (bind_t<R, F, L> const & f, bind_t<R, F, L> const & g) \
-{ \
-    typedef list2< bind_t<R, F, L>, bind_t<R, F, L> > list_type; \
-    return bind_t<bool, name, list_type> ( name(), list_type(f, g) ); \
-}
-
-BOOST_BIND_OPERATOR( !=, not_equal )
-BOOST_BIND_OPERATOR( <=, less_equal )
-BOOST_BIND_OPERATOR( >, greater )
-BOOST_BIND_OPERATOR( >=, greater_equal )
-
-#endif
-
-// visit_each, ADL
-
-#if !defined( BOOST_NO_ARGUMENT_DEPENDENT_LOOKUP ) && !defined( BOOST_BORLANDC ) \
-   && !(defined(__GNUC__) && __GNUC__ == 3 && __GNUC_MINOR__ <= 3)
-
-template<class V, class T> void visit_each( V & v, value<T> const & t, int )
-{
-    using boost::visit_each;
-    BOOST_BIND_VISIT_EACH( v, t.get(), 0 );
-}
-
-template<class V, class R, class F, class L> void visit_each( V & v, bind_t<R, F, L> const & t, int )
-{
-    t.accept( v );
-}
-
-#endif
-
-} // namespace _bi
-
-// visit_each, no ADL
-
-#if defined( BOOST_NO_ARGUMENT_DEPENDENT_LOOKUP ) || defined( BOOST_BORLANDC ) \
-  || (defined(__GNUC__) && __GNUC__ == 3 && __GNUC_MINOR__ <= 3)
-
-template<class V, class T> void visit_each( V & v, _bi::value<T> const & t, int )
-{
-    BOOST_BIND_VISIT_EACH( v, t.get(), 0 );
-}
-
-template<class V, class R, class F, class L> void visit_each( V & v, _bi::bind_t<R, F, L> const & t, int )
-{
-    t.accept( v );
-}
-
-#endif
-
-// is_bind_expression
-
-template< class T > struct is_bind_expression
-{
-    enum _vt { value = 0 };
-};
-
-#if !defined( BOOST_NO_TEMPLATE_PARTIAL_SPECIALIZATION )
-
-template< class R, class F, class L > struct is_bind_expression< _bi::bind_t< R, F, L > >
-{
-    enum _vt { value = 1 };
-};
-
-#endif
-
-// bind
-
-#ifndef BOOST_BIND
-#define BOOST_BIND bind
-#endif
-
-// generic function objects
-
-template<class R, class F>
-    _bi::bind_t<R, F, _bi::list0>
-    BOOST_BIND(F f)
-{
-    typedef _bi::list0 list_type;
-    return _bi::bind_t<R, F, list_type> (f, list_type());
-}
-
-template<class R, class F, class A1>
-    _bi::bind_t<R, F, typename _bi::list_av_1<A1>::type>
-    BOOST_BIND(F f, A1 a1)
-{
-    typedef typename _bi::list_av_1<A1>::type list_type;
-    return _bi::bind_t<R, F, list_type> (f, list_type(a1));
-}
-
-template<class R, class F, class A1, class A2>
-    _bi::bind_t<R, F, typename _bi::list_av_2<A1, A2>::type>
-    BOOST_BIND(F f, A1 a1, A2 a2)
-{
-    typedef typename _bi::list_av_2<A1, A2>::type list_type;
-    return _bi::bind_t<R, F, list_type> (f, list_type(a1, a2));
-}
-
-template<class R, class F, class A1, class A2, class A3>
-    _bi::bind_t<R, F, typename _bi::list_av_3<A1, A2, A3>::type>
-    BOOST_BIND(F f, A1 a1, A2 a2, A3 a3)
-{
-    typedef typename _bi::list_av_3<A1, A2, A3>::type list_type;
-    return _bi::bind_t<R, F, list_type>(f, list_type(a1, a2, a3));
-}
-
-template<class R, class F, class A1, class A2, class A3, class A4>
-    _bi::bind_t<R, F, typename _bi::list_av_4<A1, A2, A3, A4>::type>
-    BOOST_BIND(F f, A1 a1, A2 a2, A3 a3, A4 a4)
-{
-    typedef typename _bi::list_av_4<A1, A2, A3, A4>::type list_type;
-    return _bi::bind_t<R, F, list_type>(f, list_type(a1, a2, a3, a4));
-}
-
-template<class R, class F, class A1, class A2, class A3, class A4, class A5>
-    _bi::bind_t<R, F, typename _bi::list_av_5<A1, A2, A3, A4, A5>::type>
-    BOOST_BIND(F f, A1 a1, A2 a2, A3 a3, A4 a4, A5 a5)
-{
-    typedef typename _bi::list_av_5<A1, A2, A3, A4, A5>::type list_type;
-    return _bi::bind_t<R, F, list_type>(f, list_type(a1, a2, a3, a4, a5));
-}
-
-template<class R, class F, class A1, class A2, class A3, class A4, class A5, class A6>
-    _bi::bind_t<R, F, typename _bi::list_av_6<A1, A2, A3, A4, A5, A6>::type>
-    BOOST_BIND(F f, A1 a1, A2 a2, A3 a3, A4 a4, A5 a5, A6 a6)
-{
-    typedef typename _bi::list_av_6<A1, A2, A3, A4, A5, A6>::type list_type;
-    return _bi::bind_t<R, F, list_type>(f, list_type(a1, a2, a3, a4, a5, a6));
-}
-
-template<class R, class F, class A1, class A2, class A3, class A4, class A5, class A6, class A7>
-    _bi::bind_t<R, F, typename _bi::list_av_7<A1, A2, A3, A4, A5, A6, A7>::type>
-    BOOST_BIND(F f, A1 a1, A2 a2, A3 a3, A4 a4, A5 a5, A6 a6, A7 a7)
-{
-    typedef typename _bi::list_av_7<A1, A2, A3, A4, A5, A6, A7>::type list_type;
-    return _bi::bind_t<R, F, list_type>(f, list_type(a1, a2, a3, a4, a5, a6, a7));
-}
-
-template<class R, class F, class A1, class A2, class A3, class A4, class A5, class A6, class A7, class A8>
-    _bi::bind_t<R, F, typename _bi::list_av_8<A1, A2, A3, A4, A5, A6, A7, A8>::type>
-    BOOST_BIND(F f, A1 a1, A2 a2, A3 a3, A4 a4, A5 a5, A6 a6, A7 a7, A8 a8)
-{
-    typedef typename _bi::list_av_8<A1, A2, A3, A4, A5, A6, A7, A8>::type list_type;
-    return _bi::bind_t<R, F, list_type>(f, list_type(a1, a2, a3, a4, a5, a6, a7, a8));
-}
-
-template<class R, class F, class A1, class A2, class A3, class A4, class A5, class A6, class A7, class A8, class A9>
-    _bi::bind_t<R, F, typename _bi::list_av_9<A1, A2, A3, A4, A5, A6, A7, A8, A9>::type>
-    BOOST_BIND(F f, A1 a1, A2 a2, A3 a3, A4 a4, A5 a5, A6 a6, A7 a7, A8 a8, A9 a9)
-{
-    typedef typename _bi::list_av_9<A1, A2, A3, A4, A5, A6, A7, A8, A9>::type list_type;
-    return _bi::bind_t<R, F, list_type>(f, list_type(a1, a2, a3, a4, a5, a6, a7, a8, a9));
-}
-
-// generic function objects, alternative syntax
-
-template<class R, class F>
-    _bi::bind_t<R, F, _bi::list0>
-    BOOST_BIND(boost::type<R>, F f)
-{
-    typedef _bi::list0 list_type;
-    return _bi::bind_t<R, F, list_type> (f, list_type());
-}
-
-template<class R, class F, class A1>
-    _bi::bind_t<R, F, typename _bi::list_av_1<A1>::type>
-    BOOST_BIND(boost::type<R>, F f, A1 a1)
-{
-    typedef typename _bi::list_av_1<A1>::type list_type;
-    return _bi::bind_t<R, F, list_type> (f, list_type(a1));
-}
-
-template<class R, class F, class A1, class A2>
-    _bi::bind_t<R, F, typename _bi::list_av_2<A1, A2>::type>
-    BOOST_BIND(boost::type<R>, F f, A1 a1, A2 a2)
-{
-    typedef typename _bi::list_av_2<A1, A2>::type list_type;
-    return _bi::bind_t<R, F, list_type> (f, list_type(a1, a2));
-}
-
-template<class R, class F, class A1, class A2, class A3>
-    _bi::bind_t<R, F, typename _bi::list_av_3<A1, A2, A3>::type>
-    BOOST_BIND(boost::type<R>, F f, A1 a1, A2 a2, A3 a3)
-{
-    typedef typename _bi::list_av_3<A1, A2, A3>::type list_type;
-    return _bi::bind_t<R, F, list_type>(f, list_type(a1, a2, a3));
-}
-
-template<class R, class F, class A1, class A2, class A3, class A4>
-    _bi::bind_t<R, F, typename _bi::list_av_4<A1, A2, A3, A4>::type>
-    BOOST_BIND(boost::type<R>, F f, A1 a1, A2 a2, A3 a3, A4 a4)
-{
-    typedef typename _bi::list_av_4<A1, A2, A3, A4>::type list_type;
-    return _bi::bind_t<R, F, list_type>(f, list_type(a1, a2, a3, a4));
-}
-
-template<class R, class F, class A1, class A2, class A3, class A4, class A5>
-    _bi::bind_t<R, F, typename _bi::list_av_5<A1, A2, A3, A4, A5>::type>
-    BOOST_BIND(boost::type<R>, F f, A1 a1, A2 a2, A3 a3, A4 a4, A5 a5)
-{
-    typedef typename _bi::list_av_5<A1, A2, A3, A4, A5>::type list_type;
-    return _bi::bind_t<R, F, list_type>(f, list_type(a1, a2, a3, a4, a5));
-}
-
-template<class R, class F, class A1, class A2, class A3, class A4, class A5, class A6>
-    _bi::bind_t<R, F, typename _bi::list_av_6<A1, A2, A3, A4, A5, A6>::type>
-    BOOST_BIND(boost::type<R>, F f, A1 a1, A2 a2, A3 a3, A4 a4, A5 a5, A6 a6)
-{
-    typedef typename _bi::list_av_6<A1, A2, A3, A4, A5, A6>::type list_type;
-    return _bi::bind_t<R, F, list_type>(f, list_type(a1, a2, a3, a4, a5, a6));
-}
-
-template<class R, class F, class A1, class A2, class A3, class A4, class A5, class A6, class A7>
-    _bi::bind_t<R, F, typename _bi::list_av_7<A1, A2, A3, A4, A5, A6, A7>::type>
-    BOOST_BIND(boost::type<R>, F f, A1 a1, A2 a2, A3 a3, A4 a4, A5 a5, A6 a6, A7 a7)
-{
-    typedef typename _bi::list_av_7<A1, A2, A3, A4, A5, A6, A7>::type list_type;
-    return _bi::bind_t<R, F, list_type>(f, list_type(a1, a2, a3, a4, a5, a6, a7));
-}
-
-template<class R, class F, class A1, class A2, class A3, class A4, class A5, class A6, class A7, class A8>
-    _bi::bind_t<R, F, typename _bi::list_av_8<A1, A2, A3, A4, A5, A6, A7, A8>::type>
-    BOOST_BIND(boost::type<R>, F f, A1 a1, A2 a2, A3 a3, A4 a4, A5 a5, A6 a6, A7 a7, A8 a8)
-{
-    typedef typename _bi::list_av_8<A1, A2, A3, A4, A5, A6, A7, A8>::type list_type;
-    return _bi::bind_t<R, F, list_type>(f, list_type(a1, a2, a3, a4, a5, a6, a7, a8));
-}
-
-template<class R, class F, class A1, class A2, class A3, class A4, class A5, class A6, class A7, class A8, class A9>
-    _bi::bind_t<R, F, typename _bi::list_av_9<A1, A2, A3, A4, A5, A6, A7, A8, A9>::type>
-    BOOST_BIND(boost::type<R>, F f, A1 a1, A2 a2, A3 a3, A4 a4, A5 a5, A6 a6, A7 a7, A8 a8, A9 a9)
-{
-    typedef typename _bi::list_av_9<A1, A2, A3, A4, A5, A6, A7, A8, A9>::type list_type;
-    return _bi::bind_t<R, F, list_type>(f, list_type(a1, a2, a3, a4, a5, a6, a7, a8, a9));
-}
-
-#if !defined(BOOST_NO_TEMPLATE_PARTIAL_SPECIALIZATION) && !defined(BOOST_NO_FUNCTION_TEMPLATE_ORDERING)
-
-// adaptable function objects
-
-template<class F>
-    _bi::bind_t<_bi::unspecified, F, _bi::list0>
-    BOOST_BIND(F f)
-{
-    typedef _bi::list0 list_type;
-    return _bi::bind_t<_bi::unspecified, F, list_type> (f, list_type());
-}
-
-template<class F, class A1>
-    _bi::bind_t<_bi::unspecified, F, typename _bi::list_av_1<A1>::type>
-    BOOST_BIND(F f, A1 a1)
-{
-    typedef typename _bi::list_av_1<A1>::type list_type;
-    return _bi::bind_t<_bi::unspecified, F, list_type> (f, list_type(a1));
-}
-
-template<class F, class A1, class A2>
-    _bi::bind_t<_bi::unspecified, F, typename _bi::list_av_2<A1, A2>::type>
-    BOOST_BIND(F f, A1 a1, A2 a2)
-{
-    typedef typename _bi::list_av_2<A1, A2>::type list_type;
-    return _bi::bind_t<_bi::unspecified, F, list_type> (f, list_type(a1, a2));
-}
-
-template<class F, class A1, class A2, class A3>
-    _bi::bind_t<_bi::unspecified, F, typename _bi::list_av_3<A1, A2, A3>::type>
-    BOOST_BIND(F f, A1 a1, A2 a2, A3 a3)
-{
-    typedef typename _bi::list_av_3<A1, A2, A3>::type list_type;
-    return _bi::bind_t<_bi::unspecified, F, list_type>(f, list_type(a1, a2, a3));
-}
-
-template<class F, class A1, class A2, class A3, class A4>
-    _bi::bind_t<_bi::unspecified, F, typename _bi::list_av_4<A1, A2, A3, A4>::type>
-    BOOST_BIND(F f, A1 a1, A2 a2, A3 a3, A4 a4)
-{
-    typedef typename _bi::list_av_4<A1, A2, A3, A4>::type list_type;
-    return _bi::bind_t<_bi::unspecified, F, list_type>(f, list_type(a1, a2, a3, a4));
-}
-
-template<class F, class A1, class A2, class A3, class A4, class A5>
-    _bi::bind_t<_bi::unspecified, F, typename _bi::list_av_5<A1, A2, A3, A4, A5>::type>
-    BOOST_BIND(F f, A1 a1, A2 a2, A3 a3, A4 a4, A5 a5)
-{
-    typedef typename _bi::list_av_5<A1, A2, A3, A4, A5>::type list_type;
-    return _bi::bind_t<_bi::unspecified, F, list_type>(f, list_type(a1, a2, a3, a4, a5));
-}
-
-template<class F, class A1, class A2, class A3, class A4, class A5, class A6>
-    _bi::bind_t<_bi::unspecified, F, typename _bi::list_av_6<A1, A2, A3, A4, A5, A6>::type>
-    BOOST_BIND(F f, A1 a1, A2 a2, A3 a3, A4 a4, A5 a5, A6 a6)
-{
-    typedef typename _bi::list_av_6<A1, A2, A3, A4, A5, A6>::type list_type;
-    return _bi::bind_t<_bi::unspecified, F, list_type>(f, list_type(a1, a2, a3, a4, a5, a6));
-}
-
-template<class F, class A1, class A2, class A3, class A4, class A5, class A6, class A7>
-    _bi::bind_t<_bi::unspecified, F, typename _bi::list_av_7<A1, A2, A3, A4, A5, A6, A7>::type>
-    BOOST_BIND(F f, A1 a1, A2 a2, A3 a3, A4 a4, A5 a5, A6 a6, A7 a7)
-{
-    typedef typename _bi::list_av_7<A1, A2, A3, A4, A5, A6, A7>::type list_type;
-    return _bi::bind_t<_bi::unspecified, F, list_type>(f, list_type(a1, a2, a3, a4, a5, a6, a7));
-}
-
-template<class F, class A1, class A2, class A3, class A4, class A5, class A6, class A7, class A8>
-    _bi::bind_t<_bi::unspecified, F, typename _bi::list_av_8<A1, A2, A3, A4, A5, A6, A7, A8>::type>
-    BOOST_BIND(F f, A1 a1, A2 a2, A3 a3, A4 a4, A5 a5, A6 a6, A7 a7, A8 a8)
-{
-    typedef typename _bi::list_av_8<A1, A2, A3, A4, A5, A6, A7, A8>::type list_type;
-    return _bi::bind_t<_bi::unspecified, F, list_type>(f, list_type(a1, a2, a3, a4, a5, a6, a7, a8));
-}
-
-template<class F, class A1, class A2, class A3, class A4, class A5, class A6, class A7, class A8, class A9>
-    _bi::bind_t<_bi::unspecified, F, typename _bi::list_av_9<A1, A2, A3, A4, A5, A6, A7, A8, A9>::type>
-    BOOST_BIND(F f, A1 a1, A2 a2, A3 a3, A4 a4, A5 a5, A6 a6, A7 a7, A8 a8, A9 a9)
-{
-    typedef typename _bi::list_av_9<A1, A2, A3, A4, A5, A6, A7, A8, A9>::type list_type;
-    return _bi::bind_t<_bi::unspecified, F, list_type>(f, list_type(a1, a2, a3, a4, a5, a6, a7, a8, a9));
-}
-
-#endif // !defined(BOOST_NO_TEMPLATE_PARTIAL_SPECIALIZATION) && !defined(BOOST_NO_FUNCTION_TEMPLATE_ORDERING)
-
-// function pointers
-
-#define BOOST_BIND_CC
-#define BOOST_BIND_ST
-#define BOOST_BIND_NOEXCEPT
-
-#include <boost/bind/bind_cc.hpp>
-
-# if defined( __cpp_noexcept_function_type ) || defined( _NOEXCEPT_TYPES_SUPPORTED )
-#   undef BOOST_BIND_NOEXCEPT
-#   define BOOST_BIND_NOEXCEPT noexcept
-#   include <boost/bind/bind_cc.hpp>
-# endif
-
-#undef BOOST_BIND_CC
-#undef BOOST_BIND_ST
-#undef BOOST_BIND_NOEXCEPT
-
-#if defined(BOOST_BIND_ENABLE_STDCALL) && !defined(_M_X64)
-
-#define BOOST_BIND_CC __stdcall
-#define BOOST_BIND_ST
-#define BOOST_BIND_NOEXCEPT
-
-#include <boost/bind/bind_cc.hpp>
-
-#undef BOOST_BIND_CC
-#undef BOOST_BIND_ST
-#undef BOOST_BIND_NOEXCEPT
-
-#endif
-
-#if defined(BOOST_BIND_ENABLE_FASTCALL) && !defined(_M_X64)
-
-#define BOOST_BIND_CC __fastcall
-#define BOOST_BIND_ST
-#define BOOST_BIND_NOEXCEPT
-
-#include <boost/bind/bind_cc.hpp>
-
-#undef BOOST_BIND_CC
-#undef BOOST_BIND_ST
-#undef BOOST_BIND_NOEXCEPT
-
-#endif
-
-#ifdef BOOST_BIND_ENABLE_PASCAL
-
-#define BOOST_BIND_ST pascal
-#define BOOST_BIND_CC
-#define BOOST_BIND_NOEXCEPT
-
-#include <boost/bind/bind_cc.hpp>
-
-#undef BOOST_BIND_ST
-#undef BOOST_BIND_CC
-#undef BOOST_BIND_NOEXCEPT
-
-#endif
-
-// member function pointers
-
-#define BOOST_BIND_MF_NAME(X) X
-#define BOOST_BIND_MF_CC
-#define BOOST_BIND_MF_NOEXCEPT
-
-#include <boost/bind/bind_mf_cc.hpp>
-#include <boost/bind/bind_mf2_cc.hpp>
-
-# if defined( __cpp_noexcept_function_type ) || defined( _NOEXCEPT_TYPES_SUPPORTED )
-#   undef BOOST_BIND_MF_NOEXCEPT
-#   define BOOST_BIND_MF_NOEXCEPT noexcept
-#   include <boost/bind/bind_mf_cc.hpp>
-#   include <boost/bind/bind_mf2_cc.hpp>
-# endif
-
-#undef BOOST_BIND_MF_NAME
-#undef BOOST_BIND_MF_CC
-#undef BOOST_BIND_MF_NOEXCEPT
-
-#if defined(BOOST_MEM_FN_ENABLE_CDECL) && !defined(_M_X64)
-
-#define BOOST_BIND_MF_NAME(X) X##_cdecl
-#define BOOST_BIND_MF_CC __cdecl
-#define BOOST_BIND_MF_NOEXCEPT
-
-#include <boost/bind/bind_mf_cc.hpp>
-#include <boost/bind/bind_mf2_cc.hpp>
-
-#undef BOOST_BIND_MF_NAME
-#undef BOOST_BIND_MF_CC
-#undef BOOST_BIND_MF_NOEXCEPT
-
-#endif
-
-#if defined(BOOST_MEM_FN_ENABLE_STDCALL) && !defined(_M_X64)
-
-#define BOOST_BIND_MF_NAME(X) X##_stdcall
-#define BOOST_BIND_MF_CC __stdcall
-#define BOOST_BIND_MF_NOEXCEPT
-
-#include <boost/bind/bind_mf_cc.hpp>
-#include <boost/bind/bind_mf2_cc.hpp>
-
-#undef BOOST_BIND_MF_NAME
-#undef BOOST_BIND_MF_CC
-#undef BOOST_BIND_MF_NOEXCEPT
-
-#endif
-
-#if defined(BOOST_MEM_FN_ENABLE_FASTCALL) && !defined(_M_X64)
-
-#define BOOST_BIND_MF_NAME(X) X##_fastcall
-#define BOOST_BIND_MF_CC __fastcall
-#define BOOST_BIND_MF_NOEXCEPT
-
-#include <boost/bind/bind_mf_cc.hpp>
-#include <boost/bind/bind_mf2_cc.hpp>
-
-#undef BOOST_BIND_MF_NAME
-#undef BOOST_BIND_MF_CC
-#undef BOOST_BIND_MF_NOEXCEPT
-
-#endif
-
-// data member pointers
-
-#if defined(BOOST_NO_TEMPLATE_PARTIAL_SPECIALIZATION) || defined(BOOST_NO_FUNCTION_TEMPLATE_ORDERING) \
-    || ( defined(BOOST_BORLANDC) && BOOST_WORKAROUND( BOOST_BORLANDC, BOOST_TESTED_AT( 0x620 ) ) )
-
-template<class R, class T, class A1>
-_bi::bind_t< R, _mfi::dm<R, T>, typename _bi::list_av_1<A1>::type >
-    BOOST_BIND(R T::*f, A1 a1)
-{
-    typedef _mfi::dm<R, T> F;
-    typedef typename _bi::list_av_1<A1>::type list_type;
-    return _bi::bind_t<R, F, list_type>( F(f), list_type(a1) );
-}
-
-#else
-
-namespace _bi
-{
-
-template< class Pm, int I > struct add_cref;
-
-template< class M, class T > struct add_cref< M T::*, 0 >
-{
-    typedef M type;
-};
-
-template< class M, class T > struct add_cref< M T::*, 1 >
-{
-#ifdef BOOST_MSVC
-#pragma warning(push)
-#pragma warning(disable:4180)
-#endif
-    typedef M const & type;
-#ifdef BOOST_MSVC
-#pragma warning(pop)
-#endif
-};
-
-template< class R, class T > struct add_cref< R (T::*) (), 1 >
-{
-    typedef void type;
-};
-
-#if !defined(__IBMCPP__) || __IBMCPP_FUNC_CV_TMPL_ARG_DEDUCTION
-
-template< class R, class T > struct add_cref< R (T::*) () const, 1 >
-{
-    typedef void type;
-};
-
-#if defined( __cpp_noexcept_function_type ) || defined( _NOEXCEPT_TYPES_SUPPORTED )
-
-template< class R, class T > struct add_cref< R (T::*) () const noexcept, 1 >
-{
-    typedef void type;
-};
-
-#endif // __cpp_noexcept_function_type
-
-#endif // __IBMCPP__
-
-template<class R> struct isref
-{
-    enum value_type { value = 0 };
-};
-
-template<class R> struct isref< R& >
-{
-    enum value_type { value = 1 };
-};
-
-template<class R> struct isref< R* >
-{
-    enum value_type { value = 1 };
-};
-
-template<class Pm, class A1> struct dm_result
-{
-    typedef typename add_cref< Pm, 1 >::type type;
-};
-
-template<class Pm, class R, class F, class L> struct dm_result< Pm, bind_t<R, F, L> >
-{
-    typedef typename bind_t<R, F, L>::result_type result_type;
-    typedef typename add_cref< Pm, isref< result_type >::value >::type type;
-};
-
-} // namespace _bi
-
-template< class A1, class M, class T >
-
-_bi::bind_t<
-    typename _bi::dm_result< M T::*, A1 >::type,
-    _mfi::dm<M, T>,
-    typename _bi::list_av_1<A1>::type
->
-
-BOOST_BIND( M T::*f, A1 a1 )
-{
-    typedef typename _bi::dm_result< M T::*, A1 >::type result_type;
-    typedef _mfi::dm<M, T> F;
-    typedef typename _bi::list_av_1<A1>::type list_type;
-    return _bi::bind_t< result_type, F, list_type >( F( f ), list_type( a1 ) );
-}
-
-#endif
-
-} // namespace boost
-
-#ifndef BOOST_BIND_NO_PLACEHOLDERS
-
-# include <boost/bind/placeholders.hpp>
-
-#endif
-
-#ifdef BOOST_MSVC
-# pragma warning(default: 4512) // assignment operator could not be generated
-# pragma warning(pop)
-#endif
-
-#endif // #ifndef BOOST_BIND_BIND_HPP_INCLUDED
diff --git a/src/boost/bind/bind_cc.hpp b/src/boost/bind/bind_cc.hpp
deleted file mode 100644
index 278aa9a2..00000000
--- a/src/boost/bind/bind_cc.hpp
+++ /dev/null
@@ -1,117 +0,0 @@
-//
-//  bind/bind_cc.hpp - support for different calling conventions
-//
-//  Do not include this header directly.
-//
-//  Copyright (c) 2001 Peter Dimov and Multi Media Ltd.
-//
-// Distributed under the Boost 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/bind/bind.html for documentation.
-//
-
-template<class R>
-    _bi::bind_t<R, BOOST_BIND_ST R (BOOST_BIND_CC *) () BOOST_BIND_NOEXCEPT, _bi::list0>
-    BOOST_BIND(BOOST_BIND_ST R (BOOST_BIND_CC *f) () BOOST_BIND_NOEXCEPT)
-{
-    typedef BOOST_BIND_ST R (BOOST_BIND_CC *F) () BOOST_BIND_NOEXCEPT;
-    typedef _bi::list0 list_type;
-    return _bi::bind_t<R, F, list_type> (f, list_type());
-}
-
-template<class R, class B1, class A1>
-    _bi::bind_t<R, BOOST_BIND_ST R (BOOST_BIND_CC *) (B1) BOOST_BIND_NOEXCEPT, typename _bi::list_av_1<A1>::type>
-    BOOST_BIND(BOOST_BIND_ST R (BOOST_BIND_CC *f) (B1) BOOST_BIND_NOEXCEPT, A1 a1)
-{
-    typedef BOOST_BIND_ST R (BOOST_BIND_CC *F) (B1) BOOST_BIND_NOEXCEPT;
-    typedef typename _bi::list_av_1<A1>::type list_type;
-    return _bi::bind_t<R, F, list_type> (f, list_type(a1));
-}
-
-template<class R, class B1, class B2, class A1, class A2>
-    _bi::bind_t<R, BOOST_BIND_ST R (BOOST_BIND_CC *) (B1, B2) BOOST_BIND_NOEXCEPT, typename _bi::list_av_2<A1, A2>::type>
-    BOOST_BIND(BOOST_BIND_ST R (BOOST_BIND_CC *f) (B1, B2) BOOST_BIND_NOEXCEPT, A1 a1, A2 a2)
-{
-    typedef BOOST_BIND_ST R (BOOST_BIND_CC *F) (B1, B2) BOOST_BIND_NOEXCEPT;
-    typedef typename _bi::list_av_2<A1, A2>::type list_type;
-    return _bi::bind_t<R, F, list_type> (f, list_type(a1, a2));
-}
-
-template<class R,
-    class B1, class B2, class B3,
-    class A1, class A2, class A3>
-    _bi::bind_t<R, BOOST_BIND_ST R (BOOST_BIND_CC *) (B1, B2, B3) BOOST_BIND_NOEXCEPT, typename _bi::list_av_3<A1, A2, A3>::type>
-    BOOST_BIND(BOOST_BIND_ST R (BOOST_BIND_CC *f) (B1, B2, B3) BOOST_BIND_NOEXCEPT, A1 a1, A2 a2, A3 a3)
-{
-    typedef BOOST_BIND_ST R (BOOST_BIND_CC *F) (B1, B2, B3) BOOST_BIND_NOEXCEPT;
-    typedef typename _bi::list_av_3<A1, A2, A3>::type list_type;
-    return _bi::bind_t<R, F, list_type>(f, list_type(a1, a2, a3));
-}
-
-template<class R,
-    class B1, class B2, class B3, class B4,
-    class A1, class A2, class A3, class A4>
-    _bi::bind_t<R, BOOST_BIND_ST R (BOOST_BIND_CC *) (B1, B2, B3, B4) BOOST_BIND_NOEXCEPT, typename _bi::list_av_4<A1, A2, A3, A4>::type>
-    BOOST_BIND(BOOST_BIND_ST R (BOOST_BIND_CC *f) (B1, B2, B3, B4) BOOST_BIND_NOEXCEPT, A1 a1, A2 a2, A3 a3, A4 a4)
-{
-    typedef BOOST_BIND_ST R (BOOST_BIND_CC *F) (B1, B2, B3, B4) BOOST_BIND_NOEXCEPT;
-    typedef typename _bi::list_av_4<A1, A2, A3, A4>::type list_type;
-    return _bi::bind_t<R, F, list_type>(f, list_type(a1, a2, a3, a4));
-}
-
-template<class R,
-    class B1, class B2, class B3, class B4, class B5,
-    class A1, class A2, class A3, class A4, class A5>
-    _bi::bind_t<R, BOOST_BIND_ST R (BOOST_BIND_CC *) (B1, B2, B3, B4, B5) BOOST_BIND_NOEXCEPT, typename _bi::list_av_5<A1, A2, A3, A4, A5>::type>
-    BOOST_BIND(BOOST_BIND_ST R (BOOST_BIND_CC *f) (B1, B2, B3, B4, B5) BOOST_BIND_NOEXCEPT, A1 a1, A2 a2, A3 a3, A4 a4, A5 a5)
-{
-    typedef BOOST_BIND_ST R (BOOST_BIND_CC *F) (B1, B2, B3, B4, B5) BOOST_BIND_NOEXCEPT;
-    typedef typename _bi::list_av_5<A1, A2, A3, A4, A5>::type list_type;
-    return _bi::bind_t<R, F, list_type>(f, list_type(a1, a2, a3, a4, a5));
-}
-
-template<class R,
-    class B1, class B2, class B3, class B4, class B5, class B6,
-    class A1, class A2, class A3, class A4, class A5, class A6>
-    _bi::bind_t<R, BOOST_BIND_ST R (BOOST_BIND_CC *) (B1, B2, B3, B4, B5, B6) BOOST_BIND_NOEXCEPT, typename _bi::list_av_6<A1, A2, A3, A4, A5, A6>::type>
-    BOOST_BIND(BOOST_BIND_ST R (BOOST_BIND_CC *f) (B1, B2, B3, B4, B5, B6) BOOST_BIND_NOEXCEPT, A1 a1, A2 a2, A3 a3, A4 a4, A5 a5, A6 a6)
-{
-    typedef BOOST_BIND_ST R (BOOST_BIND_CC *F) (B1, B2, B3, B4, B5, B6) BOOST_BIND_NOEXCEPT;
-    typedef typename _bi::list_av_6<A1, A2, A3, A4, A5, A6>::type list_type;
-    return _bi::bind_t<R, F, list_type>(f, list_type(a1, a2, a3, a4, a5, a6));
-}
-
-template<class R,
-    class B1, class B2, class B3, class B4, class B5, class B6, class B7,
-    class A1, class A2, class A3, class A4, class A5, class A6, class A7>
-    _bi::bind_t<R, BOOST_BIND_ST R (BOOST_BIND_CC *) (B1, B2, B3, B4, B5, B6, B7) BOOST_BIND_NOEXCEPT, typename _bi::list_av_7<A1, A2, A3, A4, A5, A6, A7>::type>
-    BOOST_BIND(BOOST_BIND_ST R (BOOST_BIND_CC *f) (B1, B2, B3, B4, B5, B6, B7) BOOST_BIND_NOEXCEPT, A1 a1, A2 a2, A3 a3, A4 a4, A5 a5, A6 a6, A7 a7)
-{
-    typedef BOOST_BIND_ST R (BOOST_BIND_CC *F) (B1, B2, B3, B4, B5, B6, B7) BOOST_BIND_NOEXCEPT;
-    typedef typename _bi::list_av_7<A1, A2, A3, A4, A5, A6, A7>::type list_type;
-    return _bi::bind_t<R, F, list_type>(f, list_type(a1, a2, a3, a4, a5, a6, a7));
-}
-
-template<class R,
-    class B1, class B2, class B3, class B4, class B5, class B6, class B7, class B8,
-    class A1, class A2, class A3, class A4, class A5, class A6, class A7, class A8>
-    _bi::bind_t<R, BOOST_BIND_ST R (BOOST_BIND_CC *) (B1, B2, B3, B4, B5, B6, B7, B8) BOOST_BIND_NOEXCEPT, typename _bi::list_av_8<A1, A2, A3, A4, A5, A6, A7, A8>::type>
-    BOOST_BIND(BOOST_BIND_ST R (BOOST_BIND_CC *f) (B1, B2, B3, B4, B5, B6, B7, B8) BOOST_BIND_NOEXCEPT, A1 a1, A2 a2, A3 a3, A4 a4, A5 a5, A6 a6, A7 a7, A8 a8)
-{
-    typedef BOOST_BIND_ST R (BOOST_BIND_CC *F) (B1, B2, B3, B4, B5, B6, B7, B8) BOOST_BIND_NOEXCEPT;
-    typedef typename _bi::list_av_8<A1, A2, A3, A4, A5, A6, A7, A8>::type list_type;
-    return _bi::bind_t<R, F, list_type>(f, list_type(a1, a2, a3, a4, a5, a6, a7, a8));
-}
-
-template<class R,
-    class B1, class B2, class B3, class B4, class B5, class B6, class B7, class B8, class B9,
-    class A1, class A2, class A3, class A4, class A5, class A6, class A7, class A8, class A9>
-    _bi::bind_t<R, BOOST_BIND_ST R (BOOST_BIND_CC *) (B1, B2, B3, B4, B5, B6, B7, B8, B9) BOOST_BIND_NOEXCEPT, typename _bi::list_av_9<A1, A2, A3, A4, A5, A6, A7, A8, A9>::type>
-    BOOST_BIND(BOOST_BIND_ST R (BOOST_BIND_CC *f) (B1, B2, B3, B4, B5, B6, B7, B8, B9) BOOST_BIND_NOEXCEPT, A1 a1, A2 a2, A3 a3, A4 a4, A5 a5, A6 a6, A7 a7, A8 a8, A9 a9)
-{
-    typedef BOOST_BIND_ST R (BOOST_BIND_CC *F) (B1, B2, B3, B4, B5, B6, B7, B8, B9) BOOST_BIND_NOEXCEPT;
-    typedef typename _bi::list_av_9<A1, A2, A3, A4, A5, A6, A7, A8, A9>::type list_type;
-    return _bi::bind_t<R, F, list_type>(f, list_type(a1, a2, a3, a4, a5, a6, a7, a8, a9));
-}
diff --git a/src/boost/bind/bind_mf2_cc.hpp b/src/boost/bind/bind_mf2_cc.hpp
deleted file mode 100644
index be20b1d9..00000000
--- a/src/boost/bind/bind_mf2_cc.hpp
+++ /dev/null
@@ -1,228 +0,0 @@
-//
-//  bind/bind_mf2_cc.hpp - member functions, type<> syntax
-//
-//  Do not include this header directly.
-//
-//  Copyright (c) 2001 Peter Dimov and Multi Media Ltd.
-//  Copyright (c) 2008 Peter Dimov
-//
-//  Distributed under the Boost 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/bind/bind.html for documentation.
-//
-
-// 0
-
-template<class Rt2, class R, class T,
-    class A1>
-    _bi::bind_t<Rt2, _mfi::BOOST_BIND_MF_NAME(mf0)<R, T>, typename _bi::list_av_1<A1>::type>
-    BOOST_BIND(boost::type<Rt2>, R (BOOST_BIND_MF_CC T::*f) () BOOST_BIND_MF_NOEXCEPT, A1 a1)
-{
-    typedef _mfi::BOOST_BIND_MF_NAME(mf0)<R, T> F;
-    typedef typename _bi::list_av_1<A1>::type list_type;
-    return _bi::bind_t<Rt2, F, list_type>(F(f), list_type(a1));
-}
-
-template<class Rt2, class R, class T,
-    class A1>
-    _bi::bind_t<Rt2, _mfi::BOOST_BIND_MF_NAME(cmf0)<R, T>, typename _bi::list_av_1<A1>::type>
-    BOOST_BIND(boost::type<Rt2>, R (BOOST_BIND_MF_CC T::*f) () const BOOST_BIND_MF_NOEXCEPT, A1 a1)
-{
-    typedef _mfi::BOOST_BIND_MF_NAME(cmf0)<R, T> F;
-    typedef typename _bi::list_av_1<A1>::type list_type;
-    return _bi::bind_t<Rt2, F, list_type>(F(f), list_type(a1));
-}
-
-// 1
-
-template<class Rt2, class R, class T,
-    class B1,
-    class A1, class A2>
-    _bi::bind_t<Rt2, _mfi::BOOST_BIND_MF_NAME(mf1)<R, T, B1>, typename _bi::list_av_2<A1, A2>::type>
-    BOOST_BIND(boost::type<Rt2>, R (BOOST_BIND_MF_CC T::*f) (B1) BOOST_BIND_MF_NOEXCEPT, A1 a1, A2 a2)
-{
-    typedef _mfi::BOOST_BIND_MF_NAME(mf1)<R, T, B1> F;
-    typedef typename _bi::list_av_2<A1, A2>::type list_type;
-    return _bi::bind_t<Rt2, F, list_type>(F(f), list_type(a1, a2));
-}
-
-template<class Rt2, class R, class T,
-    class B1,
-    class A1, class A2>
-    _bi::bind_t<Rt2, _mfi::BOOST_BIND_MF_NAME(cmf1)<R, T, B1>, typename _bi::list_av_2<A1, A2>::type>
-    BOOST_BIND(boost::type<Rt2>, R (BOOST_BIND_MF_CC T::*f) (B1) const BOOST_BIND_MF_NOEXCEPT, A1 a1, A2 a2)
-{
-    typedef _mfi::BOOST_BIND_MF_NAME(cmf1)<R, T, B1> F;
-    typedef typename _bi::list_av_2<A1, A2>::type list_type;
-    return _bi::bind_t<Rt2, F, list_type>(F(f), list_type(a1, a2));
-}
-
-// 2
-
-template<class Rt2, class R, class T,
-    class B1, class B2,
-    class A1, class A2, class A3>
-    _bi::bind_t<Rt2, _mfi::BOOST_BIND_MF_NAME(mf2)<R, T, B1, B2>, typename _bi::list_av_3<A1, A2, A3>::type>
-    BOOST_BIND(boost::type<Rt2>, R (BOOST_BIND_MF_CC T::*f) (B1, B2) BOOST_BIND_MF_NOEXCEPT, A1 a1, A2 a2, A3 a3)
-{
-    typedef _mfi::BOOST_BIND_MF_NAME(mf2)<R, T, B1, B2> F;
-    typedef typename _bi::list_av_3<A1, A2, A3>::type list_type;
-    return _bi::bind_t<Rt2, F, list_type>(F(f), list_type(a1, a2, a3));
-}
-
-template<class Rt2, class R, class T,
-    class B1, class B2,
-    class A1, class A2, class A3>
-    _bi::bind_t<Rt2, _mfi::BOOST_BIND_MF_NAME(cmf2)<R, T, B1, B2>, typename _bi::list_av_3<A1, A2, A3>::type>
-    BOOST_BIND(boost::type<Rt2>, R (BOOST_BIND_MF_CC T::*f) (B1, B2) const BOOST_BIND_MF_NOEXCEPT, A1 a1, A2 a2, A3 a3)
-{
-    typedef _mfi::BOOST_BIND_MF_NAME(cmf2)<R, T, B1, B2> F;
-    typedef typename _bi::list_av_3<A1, A2, A3>::type list_type;
-    return _bi::bind_t<Rt2, F, list_type>(F(f), list_type(a1, a2, a3));
-}
-
-// 3
-
-template<class Rt2, class R, class T,
-    class B1, class B2, class B3,
-    class A1, class A2, class A3, class A4>
-    _bi::bind_t<Rt2, _mfi::BOOST_BIND_MF_NAME(mf3)<R, T, B1, B2, B3>, typename _bi::list_av_4<A1, A2, A3, A4>::type>
-    BOOST_BIND(boost::type<Rt2>, R (BOOST_BIND_MF_CC T::*f) (B1, B2, B3) BOOST_BIND_MF_NOEXCEPT, A1 a1, A2 a2, A3 a3, A4 a4)
-{
-    typedef _mfi::BOOST_BIND_MF_NAME(mf3)<R, T, B1, B2, B3> F;
-    typedef typename _bi::list_av_4<A1, A2, A3, A4>::type list_type;
-    return _bi::bind_t<Rt2, F, list_type>(F(f), list_type(a1, a2, a3, a4));
-}
-
-template<class Rt2, class R, class T,
-    class B1, class B2, class B3,
-    class A1, class A2, class A3, class A4>
-    _bi::bind_t<Rt2, _mfi::BOOST_BIND_MF_NAME(cmf3)<R, T, B1, B2, B3>, typename _bi::list_av_4<A1, A2, A3, A4>::type>
-    BOOST_BIND(boost::type<Rt2>, R (BOOST_BIND_MF_CC T::*f) (B1, B2, B3) const BOOST_BIND_MF_NOEXCEPT, A1 a1, A2 a2, A3 a3, A4 a4)
-{
-    typedef _mfi::BOOST_BIND_MF_NAME(cmf3)<R, T, B1, B2, B3> F;
-    typedef typename _bi::list_av_4<A1, A2, A3, A4>::type list_type;
-    return _bi::bind_t<Rt2, F, list_type>(F(f), list_type(a1, a2, a3, a4));
-}
-
-// 4
-
-template<class Rt2, class R, class T,
-    class B1, class B2, class B3, class B4,
-    class A1, class A2, class A3, class A4, class A5>
-    _bi::bind_t<Rt2, _mfi::BOOST_BIND_MF_NAME(mf4)<R, T, B1, B2, B3, B4>, typename _bi::list_av_5<A1, A2, A3, A4, A5>::type>
-    BOOST_BIND(boost::type<Rt2>, R (BOOST_BIND_MF_CC T::*f) (B1, B2, B3, B4) BOOST_BIND_MF_NOEXCEPT, A1 a1, A2 a2, A3 a3, A4 a4, A5 a5)
-{
-    typedef _mfi::BOOST_BIND_MF_NAME(mf4)<R, T, B1, B2, B3, B4> F;
-    typedef typename _bi::list_av_5<A1, A2, A3, A4, A5>::type list_type;
-    return _bi::bind_t<Rt2, F, list_type>(F(f), list_type(a1, a2, a3, a4, a5));
-}
-
-template<class Rt2, class R, class T,
-    class B1, class B2, class B3, class B4,
-    class A1, class A2, class A3, class A4, class A5>
-    _bi::bind_t<Rt2, _mfi::BOOST_BIND_MF_NAME(cmf4)<R, T, B1, B2, B3, B4>, typename _bi::list_av_5<A1, A2, A3, A4, A5>::type>
-    BOOST_BIND(boost::type<Rt2>, R (BOOST_BIND_MF_CC T::*f) (B1, B2, B3, B4) const BOOST_BIND_MF_NOEXCEPT, A1 a1, A2 a2, A3 a3, A4 a4, A5 a5)
-{
-    typedef _mfi::BOOST_BIND_MF_NAME(cmf4)<R, T, B1, B2, B3, B4> F;
-    typedef typename _bi::list_av_5<A1, A2, A3, A4, A5>::type list_type;
-    return _bi::bind_t<Rt2, F, list_type>(F(f), list_type(a1, a2, a3, a4, a5));
-}
-
-// 5
-
-template<class Rt2, class R, class T,
-    class B1, class B2, class B3, class B4, class B5,
-    class A1, class A2, class A3, class A4, class A5, class A6>
-    _bi::bind_t<Rt2, _mfi::BOOST_BIND_MF_NAME(mf5)<R, T, B1, B2, B3, B4, B5>, typename _bi::list_av_6<A1, A2, A3, A4, A5, A6>::type>
-    BOOST_BIND(boost::type<Rt2>, R (BOOST_BIND_MF_CC T::*f) (B1, B2, B3, B4, B5) BOOST_BIND_MF_NOEXCEPT, A1 a1, A2 a2, A3 a3, A4 a4, A5 a5, A6 a6)
-{
-    typedef _mfi::BOOST_BIND_MF_NAME(mf5)<R, T, B1, B2, B3, B4, B5> F;
-    typedef typename _bi::list_av_6<A1, A2, A3, A4, A5, A6>::type list_type;
-    return _bi::bind_t<Rt2, F, list_type>(F(f), list_type(a1, a2, a3, a4, a5, a6));
-}
-
-template<class Rt2, class R, class T,
-    class B1, class B2, class B3, class B4, class B5,
-    class A1, class A2, class A3, class A4, class A5, class A6>
-    _bi::bind_t<Rt2, _mfi::BOOST_BIND_MF_NAME(cmf5)<R, T, B1, B2, B3, B4, B5>, typename _bi::list_av_6<A1, A2, A3, A4, A5, A6>::type>
-    BOOST_BIND(boost::type<Rt2>, R (BOOST_BIND_MF_CC T::*f) (B1, B2, B3, B4, B5) const BOOST_BIND_MF_NOEXCEPT, A1 a1, A2 a2, A3 a3, A4 a4, A5 a5, A6 a6)
-{
-    typedef _mfi::BOOST_BIND_MF_NAME(cmf5)<R, T, B1, B2, B3, B4, B5> F;
-    typedef typename _bi::list_av_6<A1, A2, A3, A4, A5, A6>::type list_type;
-    return _bi::bind_t<Rt2, F, list_type>(F(f), list_type(a1, a2, a3, a4, a5, a6));
-}
-
-// 6
-
-template<class Rt2, class R, class T,
-    class B1, class B2, class B3, class B4, class B5, class B6,
-    class A1, class A2, class A3, class A4, class A5, class A6, class A7>
-    _bi::bind_t<Rt2, _mfi::BOOST_BIND_MF_NAME(mf6)<R, T, B1, B2, B3, B4, B5, B6>, typename _bi::list_av_7<A1, A2, A3, A4, A5, A6, A7>::type>
-    BOOST_BIND(boost::type<Rt2>, R (BOOST_BIND_MF_CC T::*f) (B1, B2, B3, B4, B5, B6) BOOST_BIND_MF_NOEXCEPT, A1 a1, A2 a2, A3 a3, A4 a4, A5 a5, A6 a6, A7 a7)
-{
-    typedef _mfi::BOOST_BIND_MF_NAME(mf6)<R, T, B1, B2, B3, B4, B5, B6> F;
-    typedef typename _bi::list_av_7<A1, A2, A3, A4, A5, A6, A7>::type list_type;
-    return _bi::bind_t<Rt2, F, list_type>(F(f), list_type(a1, a2, a3, a4, a5, a6, a7));
-}
-
-template<class Rt2, class R, class T,
-    class B1, class B2, class B3, class B4, class B5, class B6,
-    class A1, class A2, class A3, class A4, class A5, class A6, class A7>
-    _bi::bind_t<Rt2, _mfi::BOOST_BIND_MF_NAME(cmf6)<R, T, B1, B2, B3, B4, B5, B6>, typename _bi::list_av_7<A1, A2, A3, A4, A5, A6, A7>::type>
-    BOOST_BIND(boost::type<Rt2>, R (BOOST_BIND_MF_CC T::*f) (B1, B2, B3, B4, B5, B6) const BOOST_BIND_MF_NOEXCEPT, A1 a1, A2 a2, A3 a3, A4 a4, A5 a5, A6 a6, A7 a7)
-{
-    typedef _mfi::BOOST_BIND_MF_NAME(cmf6)<R, T, B1, B2, B3, B4, B5, B6> F;
-    typedef typename _bi::list_av_7<A1, A2, A3, A4, A5, A6, A7>::type list_type;
-    return _bi::bind_t<Rt2, F, list_type>(F(f), list_type(a1, a2, a3, a4, a5, a6, a7));
-}
-
-// 7
-
-template<class Rt2, class R, class T,
-    class B1, class B2, class B3, class B4, class B5, class B6, class B7,
-    class A1, class A2, class A3, class A4, class A5, class A6, class A7, class A8>
-    _bi::bind_t<Rt2, _mfi::BOOST_BIND_MF_NAME(mf7)<R, T, B1, B2, B3, B4, B5, B6, B7>, typename _bi::list_av_8<A1, A2, A3, A4, A5, A6, A7, A8>::type>
-    BOOST_BIND(boost::type<Rt2>, R (BOOST_BIND_MF_CC T::*f) (B1, B2, B3, B4, B5, B6, B7) BOOST_BIND_MF_NOEXCEPT, A1 a1, A2 a2, A3 a3, A4 a4, A5 a5, A6 a6, A7 a7, A8 a8)
-{
-    typedef _mfi::BOOST_BIND_MF_NAME(mf7)<R, T, B1, B2, B3, B4, B5, B6, B7> F;
-    typedef typename _bi::list_av_8<A1, A2, A3, A4, A5, A6, A7, A8>::type list_type;
-    return _bi::bind_t<Rt2, F, list_type>(F(f), list_type(a1, a2, a3, a4, a5, a6, a7, a8));
-}
-
-template<class Rt2, class R, class T,
-    class B1, class B2, class B3, class B4, class B5, class B6, class B7,
-    class A1, class A2, class A3, class A4, class A5, class A6, class A7, class A8>
-    _bi::bind_t<Rt2, _mfi::BOOST_BIND_MF_NAME(cmf7)<R, T, B1, B2, B3, B4, B5, B6, B7>, typename _bi::list_av_8<A1, A2, A3, A4, A5, A6, A7, A8>::type>
-    BOOST_BIND(boost::type<Rt2>, R (BOOST_BIND_MF_CC T::*f) (B1, B2, B3, B4, B5, B6, B7) const BOOST_BIND_MF_NOEXCEPT, A1 a1, A2 a2, A3 a3, A4 a4, A5 a5, A6 a6, A7 a7, A8 a8)
-{
-    typedef _mfi::BOOST_BIND_MF_NAME(cmf7)<R, T, B1, B2, B3, B4, B5, B6, B7> F;
-    typedef typename _bi::list_av_8<A1, A2, A3, A4, A5, A6, A7, A8>::type list_type;
-    return _bi::bind_t<Rt2, F, list_type>(F(f), list_type(a1, a2, a3, a4, a5, a6, a7, a8));
-}
-
-// 8
-
-template<class Rt2, class R, class T,
-    class B1, class B2, class B3, class B4, class B5, class B6, class B7, class B8,
-    class A1, class A2, class A3, class A4, class A5, class A6, class A7, class A8, class A9>
-    _bi::bind_t<Rt2, _mfi::BOOST_BIND_MF_NAME(mf8)<R, T, B1, B2, B3, B4, B5, B6, B7, B8>, typename _bi::list_av_9<A1, A2, A3, A4, A5, A6, A7, A8, A9>::type>
-    BOOST_BIND(boost::type<Rt2>, R (BOOST_BIND_MF_CC T::*f) (B1, B2, B3, B4, B5, B6, B7, B8) BOOST_BIND_MF_NOEXCEPT, A1 a1, A2 a2, A3 a3, A4 a4, A5 a5, A6 a6, A7 a7, A8 a8, A9 a9)
-{
-    typedef _mfi::BOOST_BIND_MF_NAME(mf8)<R, T, B1, B2, B3, B4, B5, B6, B7, B8> F;
-    typedef typename _bi::list_av_9<A1, A2, A3, A4, A5, A6, A7, A8, A9>::type list_type;
-    return _bi::bind_t<Rt2, F, list_type>(F(f), list_type(a1, a2, a3, a4, a5, a6, a7, a8, a9));
-}
-
-template<class Rt2, class R, class T,
-    class B1, class B2, class B3, class B4, class B5, class B6, class B7, class B8,
-    class A1, class A2, class A3, class A4, class A5, class A6, class A7, class A8, class A9>
-    _bi::bind_t<Rt2, _mfi::BOOST_BIND_MF_NAME(cmf8)<R, T, B1, B2, B3, B4, B5, B6, B7, B8>, typename _bi::list_av_9<A1, A2, A3, A4, A5, A6, A7, A8, A9>::type>
-    BOOST_BIND(boost::type<Rt2>, R (BOOST_BIND_MF_CC T::*f) (B1, B2, B3, B4, B5, B6, B7, B8) const BOOST_BIND_MF_NOEXCEPT, A1 a1, A2 a2, A3 a3, A4 a4, A5 a5, A6 a6, A7 a7, A8 a8, A9 a9)
-{
-    typedef _mfi::BOOST_BIND_MF_NAME(cmf8)<R, T, B1, B2, B3, B4, B5, B6, B7, B8> F;
-    typedef typename _bi::list_av_9<A1, A2, A3, A4, A5, A6, A7, A8, A9>::type list_type;
-    return _bi::bind_t<Rt2, F, list_type>(F(f), list_type(a1, a2, a3, a4, a5, a6, a7, a8, a9));
-}
diff --git a/src/boost/bind/bind_mf_cc.hpp b/src/boost/bind/bind_mf_cc.hpp
deleted file mode 100644
index 5a1610b4..00000000
--- a/src/boost/bind/bind_mf_cc.hpp
+++ /dev/null
@@ -1,441 +0,0 @@
-//
-//  bind/bind_mf_cc.hpp - support for different calling conventions
-//
-//  Do not include this header directly.
-//
-//  Copyright (c) 2001 Peter Dimov and Multi Media Ltd.
-//
-// Distributed under the Boost 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/bind/bind.html for documentation.
-//
-
-// 0
-
-template<class R, class T,
-    class A1>
-    _bi::bind_t<R, _mfi::BOOST_BIND_MF_NAME(mf0)<R, T>, typename _bi::list_av_1<A1>::type>
-    BOOST_BIND(R (BOOST_BIND_MF_CC T::*f) () BOOST_BIND_MF_NOEXCEPT, A1 a1)
-{
-    typedef _mfi::BOOST_BIND_MF_NAME(mf0)<R, T> F;
-    typedef typename _bi::list_av_1<A1>::type list_type;
-    return _bi::bind_t<R, F, list_type>(F(f), list_type(a1));
-}
-
-template<class R, class T,
-    class A1>
-    _bi::bind_t<R, _mfi::BOOST_BIND_MF_NAME(cmf0)<R, T>, typename _bi::list_av_1<A1>::type>
-    BOOST_BIND(R (BOOST_BIND_MF_CC T::*f) () const BOOST_BIND_MF_NOEXCEPT, A1 a1)
-{
-    typedef _mfi::BOOST_BIND_MF_NAME(cmf0)<R, T> F;
-    typedef typename _bi::list_av_1<A1>::type list_type;
-    return _bi::bind_t<R, F, list_type>(F(f), list_type(a1));
-}
-
-template<class Rt2, class R, class T,
-    class A1>
-    typename boost::enable_if_c<!_bi::is_same<Rt2, R>::value,
-    _bi::bind_t<Rt2, _mfi::BOOST_BIND_MF_NAME(mf0)<R, T>, typename _bi::list_av_1<A1>::type>
-    >::type BOOST_BIND(R (BOOST_BIND_MF_CC T::*f) () BOOST_BIND_MF_NOEXCEPT, A1 a1)
-{
-    typedef _mfi::BOOST_BIND_MF_NAME(mf0)<R, T> F;
-    typedef typename _bi::list_av_1<A1>::type list_type;
-    return _bi::bind_t<Rt2, F, list_type>(F(f), list_type(a1));
-}
-
-template<class Rt2, class R, class T,
-    class A1>
-    typename boost::enable_if_c<!_bi::is_same<Rt2, R>::value,
-    _bi::bind_t<Rt2, _mfi::BOOST_BIND_MF_NAME(cmf0)<R, T>, typename _bi::list_av_1<A1>::type>
-    >::type BOOST_BIND(R (BOOST_BIND_MF_CC T::*f) () const BOOST_BIND_MF_NOEXCEPT, A1 a1)
-{
-    typedef _mfi::BOOST_BIND_MF_NAME(cmf0)<R, T> F;
-    typedef typename _bi::list_av_1<A1>::type list_type;
-    return _bi::bind_t<Rt2, F, list_type>(F(f), list_type(a1));
-}
-
-// 1
-
-template<class R, class T,
-    class B1,
-    class A1, class A2>
-    _bi::bind_t<R, _mfi::BOOST_BIND_MF_NAME(mf1)<R, T, B1>, typename _bi::list_av_2<A1, A2>::type>
-    BOOST_BIND(R (BOOST_BIND_MF_CC T::*f) (B1) BOOST_BIND_MF_NOEXCEPT, A1 a1, A2 a2)
-{
-    typedef _mfi::BOOST_BIND_MF_NAME(mf1)<R, T, B1> F;
-    typedef typename _bi::list_av_2<A1, A2>::type list_type;
-    return _bi::bind_t<R, F, list_type>(F(f), list_type(a1, a2));
-}
-
-template<class R, class T,
-    class B1,
-    class A1, class A2>
-    _bi::bind_t<R, _mfi::BOOST_BIND_MF_NAME(cmf1)<R, T, B1>, typename _bi::list_av_2<A1, A2>::type>
-    BOOST_BIND(R (BOOST_BIND_MF_CC T::*f) (B1) const BOOST_BIND_MF_NOEXCEPT, A1 a1, A2 a2)
-{
-    typedef _mfi::BOOST_BIND_MF_NAME(cmf1)<R, T, B1> F;
-    typedef typename _bi::list_av_2<A1, A2>::type list_type;
-    return _bi::bind_t<R, F, list_type>(F(f), list_type(a1, a2));
-}
-
-template<class Rt2, class R, class T,
-    class B1,
-    class A1, class A2>
-    typename boost::enable_if_c<!_bi::is_same<Rt2, R>::value,
-    _bi::bind_t<Rt2, _mfi::BOOST_BIND_MF_NAME(mf1)<R, T, B1>, typename _bi::list_av_2<A1, A2>::type>
-    >::type BOOST_BIND(R (BOOST_BIND_MF_CC T::*f) (B1) BOOST_BIND_MF_NOEXCEPT, A1 a1, A2 a2)
-{
-    typedef _mfi::BOOST_BIND_MF_NAME(mf1)<R, T, B1> F;
-    typedef typename _bi::list_av_2<A1, A2>::type list_type;
-    return _bi::bind_t<Rt2, F, list_type>(F(f), list_type(a1, a2));
-}
-
-template<class Rt2, class R, class T,
-    class B1,
-    class A1, class A2>
-    typename boost::enable_if_c<!_bi::is_same<Rt2, R>::value,
-    _bi::bind_t<Rt2, _mfi::BOOST_BIND_MF_NAME(cmf1)<R, T, B1>, typename _bi::list_av_2<A1, A2>::type>
-    >::type BOOST_BIND(R (BOOST_BIND_MF_CC T::*f) (B1) const BOOST_BIND_MF_NOEXCEPT, A1 a1, A2 a2)
-{
-    typedef _mfi::BOOST_BIND_MF_NAME(cmf1)<R, T, B1> F;
-    typedef typename _bi::list_av_2<A1, A2>::type list_type;
-    return _bi::bind_t<Rt2, F, list_type>(F(f), list_type(a1, a2));
-}
-
-// 2
-
-template<class R, class T,
-    class B1, class B2,
-    class A1, class A2, class A3>
-    _bi::bind_t<R, _mfi::BOOST_BIND_MF_NAME(mf2)<R, T, B1, B2>, typename _bi::list_av_3<A1, A2, A3>::type>
-    BOOST_BIND(R (BOOST_BIND_MF_CC T::*f) (B1, B2) BOOST_BIND_MF_NOEXCEPT, A1 a1, A2 a2, A3 a3)
-{
-    typedef _mfi::BOOST_BIND_MF_NAME(mf2)<R, T, B1, B2> F;
-    typedef typename _bi::list_av_3<A1, A2, A3>::type list_type;
-    return _bi::bind_t<R, F, list_type>(F(f), list_type(a1, a2, a3));
-}
-
-template<class R, class T,
-    class B1, class B2,
-    class A1, class A2, class A3>
-    _bi::bind_t<R, _mfi::BOOST_BIND_MF_NAME(cmf2)<R, T, B1, B2>, typename _bi::list_av_3<A1, A2, A3>::type>
-    BOOST_BIND(R (BOOST_BIND_MF_CC T::*f) (B1, B2) const BOOST_BIND_MF_NOEXCEPT, A1 a1, A2 a2, A3 a3)
-{
-    typedef _mfi::BOOST_BIND_MF_NAME(cmf2)<R, T, B1, B2> F;
-    typedef typename _bi::list_av_3<A1, A2, A3>::type list_type;
-    return _bi::bind_t<R, F, list_type>(F(f), list_type(a1, a2, a3));
-}
-
-template<class Rt2, class R, class T,
-    class B1, class B2,
-    class A1, class A2, class A3>
-    typename boost::enable_if_c<!_bi::is_same<Rt2, R>::value,
-    _bi::bind_t<Rt2, _mfi::BOOST_BIND_MF_NAME(mf2)<R, T, B1, B2>, typename _bi::list_av_3<A1, A2, A3>::type>
-    >::type BOOST_BIND(R (BOOST_BIND_MF_CC T::*f) (B1, B2) BOOST_BIND_MF_NOEXCEPT, A1 a1, A2 a2, A3 a3)
-{
-    typedef _mfi::BOOST_BIND_MF_NAME(mf2)<R, T, B1, B2> F;
-    typedef typename _bi::list_av_3<A1, A2, A3>::type list_type;
-    return _bi::bind_t<Rt2, F, list_type>(F(f), list_type(a1, a2, a3));
-}
-
-template<class Rt2, class R, class T,
-    class B1, class B2,
-    class A1, class A2, class A3>
-    typename boost::enable_if_c<!_bi::is_same<Rt2, R>::value,
-    _bi::bind_t<Rt2, _mfi::BOOST_BIND_MF_NAME(cmf2)<R, T, B1, B2>, typename _bi::list_av_3<A1, A2, A3>::type>
-    >::type BOOST_BIND(R (BOOST_BIND_MF_CC T::*f) (B1, B2) const BOOST_BIND_MF_NOEXCEPT, A1 a1, A2 a2, A3 a3)
-{
-    typedef _mfi::BOOST_BIND_MF_NAME(cmf2)<R, T, B1, B2> F;
-    typedef typename _bi::list_av_3<A1, A2, A3>::type list_type;
-    return _bi::bind_t<Rt2, F, list_type>(F(f), list_type(a1, a2, a3));
-}
-
-// 3
-
-template<class R, class T,
-    class B1, class B2, class B3,
-    class A1, class A2, class A3, class A4>
-    _bi::bind_t<R, _mfi::BOOST_BIND_MF_NAME(mf3)<R, T, B1, B2, B3>, typename _bi::list_av_4<A1, A2, A3, A4>::type>
-    BOOST_BIND(R (BOOST_BIND_MF_CC T::*f) (B1, B2, B3) BOOST_BIND_MF_NOEXCEPT, A1 a1, A2 a2, A3 a3, A4 a4)
-{
-    typedef _mfi::BOOST_BIND_MF_NAME(mf3)<R, T, B1, B2, B3> F;
-    typedef typename _bi::list_av_4<A1, A2, A3, A4>::type list_type;
-    return _bi::bind_t<R, F, list_type>(F(f), list_type(a1, a2, a3, a4));
-}
-
-template<class R, class T,
-    class B1, class B2, class B3,
-    class A1, class A2, class A3, class A4>
-    _bi::bind_t<R, _mfi::BOOST_BIND_MF_NAME(cmf3)<R, T, B1, B2, B3>, typename _bi::list_av_4<A1, A2, A3, A4>::type>
-    BOOST_BIND(R (BOOST_BIND_MF_CC T::*f) (B1, B2, B3) const BOOST_BIND_MF_NOEXCEPT, A1 a1, A2 a2, A3 a3, A4 a4)
-{
-    typedef _mfi::BOOST_BIND_MF_NAME(cmf3)<R, T, B1, B2, B3> F;
-    typedef typename _bi::list_av_4<A1, A2, A3, A4>::type list_type;
-    return _bi::bind_t<R, F, list_type>(F(f), list_type(a1, a2, a3, a4));
-}
-
-template<class Rt2, class R, class T,
-    class B1, class B2, class B3,
-    class A1, class A2, class A3, class A4>
-    typename boost::enable_if_c<!_bi::is_same<Rt2, R>::value,
-    _bi::bind_t<Rt2, _mfi::BOOST_BIND_MF_NAME(mf3)<R, T, B1, B2, B3>, typename _bi::list_av_4<A1, A2, A3, A4>::type>
-    >::type BOOST_BIND(R (BOOST_BIND_MF_CC T::*f) (B1, B2, B3) BOOST_BIND_MF_NOEXCEPT, A1 a1, A2 a2, A3 a3, A4 a4)
-{
-    typedef _mfi::BOOST_BIND_MF_NAME(mf3)<R, T, B1, B2, B3> F;
-    typedef typename _bi::list_av_4<A1, A2, A3, A4>::type list_type;
-    return _bi::bind_t<Rt2, F, list_type>(F(f), list_type(a1, a2, a3, a4));
-}
-
-template<class Rt2, class R, class T,
-    class B1, class B2, class B3,
-    class A1, class A2, class A3, class A4>
-    typename boost::enable_if_c<!_bi::is_same<Rt2, R>::value,
-    _bi::bind_t<Rt2, _mfi::BOOST_BIND_MF_NAME(cmf3)<R, T, B1, B2, B3>, typename _bi::list_av_4<A1, A2, A3, A4>::type>
-    >::type BOOST_BIND(R (BOOST_BIND_MF_CC T::*f) (B1, B2, B3) const BOOST_BIND_MF_NOEXCEPT, A1 a1, A2 a2, A3 a3, A4 a4)
-{
-    typedef _mfi::BOOST_BIND_MF_NAME(cmf3)<R, T, B1, B2, B3> F;
-    typedef typename _bi::list_av_4<A1, A2, A3, A4>::type list_type;
-    return _bi::bind_t<Rt2, F, list_type>(F(f), list_type(a1, a2, a3, a4));
-}
-
-// 4
-
-template<class R, class T,
-    class B1, class B2, class B3, class B4,
-    class A1, class A2, class A3, class A4, class A5>
-    _bi::bind_t<R, _mfi::BOOST_BIND_MF_NAME(mf4)<R, T, B1, B2, B3, B4>, typename _bi::list_av_5<A1, A2, A3, A4, A5>::type>
-    BOOST_BIND(R (BOOST_BIND_MF_CC T::*f) (B1, B2, B3, B4) BOOST_BIND_MF_NOEXCEPT, A1 a1, A2 a2, A3 a3, A4 a4, A5 a5)
-{
-    typedef _mfi::BOOST_BIND_MF_NAME(mf4)<R, T, B1, B2, B3, B4> F;
-    typedef typename _bi::list_av_5<A1, A2, A3, A4, A5>::type list_type;
-    return _bi::bind_t<R, F, list_type>(F(f), list_type(a1, a2, a3, a4, a5));
-}
-
-template<class R, class T,
-    class B1, class B2, class B3, class B4,
-    class A1, class A2, class A3, class A4, class A5>
-    _bi::bind_t<R, _mfi::BOOST_BIND_MF_NAME(cmf4)<R, T, B1, B2, B3, B4>, typename _bi::list_av_5<A1, A2, A3, A4, A5>::type>
-    BOOST_BIND(R (BOOST_BIND_MF_CC T::*f) (B1, B2, B3, B4) const BOOST_BIND_MF_NOEXCEPT, A1 a1, A2 a2, A3 a3, A4 a4, A5 a5)
-{
-    typedef _mfi::BOOST_BIND_MF_NAME(cmf4)<R, T, B1, B2, B3, B4> F;
-    typedef typename _bi::list_av_5<A1, A2, A3, A4, A5>::type list_type;
-    return _bi::bind_t<R, F, list_type>(F(f), list_type(a1, a2, a3, a4, a5));
-}
-
-template<class Rt2, class R, class T,
-    class B1, class B2, class B3, class B4,
-    class A1, class A2, class A3, class A4, class A5>
-    typename boost::enable_if_c<!_bi::is_same<Rt2, R>::value,
-    _bi::bind_t<Rt2, _mfi::BOOST_BIND_MF_NAME(mf4)<R, T, B1, B2, B3, B4>, typename _bi::list_av_5<A1, A2, A3, A4, A5>::type>
-    >::type BOOST_BIND(R (BOOST_BIND_MF_CC T::*f) (B1, B2, B3, B4) BOOST_BIND_MF_NOEXCEPT, A1 a1, A2 a2, A3 a3, A4 a4, A5 a5)
-{
-    typedef _mfi::BOOST_BIND_MF_NAME(mf4)<R, T, B1, B2, B3, B4> F;
-    typedef typename _bi::list_av_5<A1, A2, A3, A4, A5>::type list_type;
-    return _bi::bind_t<Rt2, F, list_type>(F(f), list_type(a1, a2, a3, a4, a5));
-}
-
-template<class Rt2, class R, class T,
-    class B1, class B2, class B3, class B4,
-    class A1, class A2, class A3, class A4, class A5>
-    typename boost::enable_if_c<!_bi::is_same<Rt2, R>::value,
-    _bi::bind_t<Rt2, _mfi::BOOST_BIND_MF_NAME(cmf4)<R, T, B1, B2, B3, B4>, typename _bi::list_av_5<A1, A2, A3, A4, A5>::type>
-    >::type BOOST_BIND(R (BOOST_BIND_MF_CC T::*f) (B1, B2, B3, B4) const BOOST_BIND_MF_NOEXCEPT, A1 a1, A2 a2, A3 a3, A4 a4, A5 a5)
-{
-    typedef _mfi::BOOST_BIND_MF_NAME(cmf4)<R, T, B1, B2, B3, B4> F;
-    typedef typename _bi::list_av_5<A1, A2, A3, A4, A5>::type list_type;
-    return _bi::bind_t<Rt2, F, list_type>(F(f), list_type(a1, a2, a3, a4, a5));
-}
-
-// 5
-
-template<class R, class T,
-    class B1, class B2, class B3, class B4, class B5,
-    class A1, class A2, class A3, class A4, class A5, class A6>
-    _bi::bind_t<R, _mfi::BOOST_BIND_MF_NAME(mf5)<R, T, B1, B2, B3, B4, B5>, typename _bi::list_av_6<A1, A2, A3, A4, A5, A6>::type>
-    BOOST_BIND(R (BOOST_BIND_MF_CC T::*f) (B1, B2, B3, B4, B5) BOOST_BIND_MF_NOEXCEPT, A1 a1, A2 a2, A3 a3, A4 a4, A5 a5, A6 a6)
-{
-    typedef _mfi::BOOST_BIND_MF_NAME(mf5)<R, T, B1, B2, B3, B4, B5> F;
-    typedef typename _bi::list_av_6<A1, A2, A3, A4, A5, A6>::type list_type;
-    return _bi::bind_t<R, F, list_type>(F(f), list_type(a1, a2, a3, a4, a5, a6));
-}
-
-template<class R, class T,
-    class B1, class B2, class B3, class B4, class B5,
-    class A1, class A2, class A3, class A4, class A5, class A6>
-    _bi::bind_t<R, _mfi::BOOST_BIND_MF_NAME(cmf5)<R, T, B1, B2, B3, B4, B5>, typename _bi::list_av_6<A1, A2, A3, A4, A5, A6>::type>
-    BOOST_BIND(R (BOOST_BIND_MF_CC T::*f) (B1, B2, B3, B4, B5) const BOOST_BIND_MF_NOEXCEPT, A1 a1, A2 a2, A3 a3, A4 a4, A5 a5, A6 a6)
-{
-    typedef _mfi::BOOST_BIND_MF_NAME(cmf5)<R, T, B1, B2, B3, B4, B5> F;
-    typedef typename _bi::list_av_6<A1, A2, A3, A4, A5, A6>::type list_type;
-    return _bi::bind_t<R, F, list_type>(F(f), list_type(a1, a2, a3, a4, a5, a6));
-}
-
-template<class Rt2, class R, class T,
-    class B1, class B2, class B3, class B4, class B5,
-    class A1, class A2, class A3, class A4, class A5, class A6>
-    typename boost::enable_if_c<!_bi::is_same<Rt2, R>::value,
-    _bi::bind_t<Rt2, _mfi::BOOST_BIND_MF_NAME(mf5)<R, T, B1, B2, B3, B4, B5>, typename _bi::list_av_6<A1, A2, A3, A4, A5, A6>::type>
-    >::type BOOST_BIND(R (BOOST_BIND_MF_CC T::*f) (B1, B2, B3, B4, B5) BOOST_BIND_MF_NOEXCEPT, A1 a1, A2 a2, A3 a3, A4 a4, A5 a5, A6 a6)
-{
-    typedef _mfi::BOOST_BIND_MF_NAME(mf5)<R, T, B1, B2, B3, B4, B5> F;
-    typedef typename _bi::list_av_6<A1, A2, A3, A4, A5, A6>::type list_type;
-    return _bi::bind_t<Rt2, F, list_type>(F(f), list_type(a1, a2, a3, a4, a5, a6));
-}
-
-template<class Rt2, class R, class T,
-    class B1, class B2, class B3, class B4, class B5,
-    class A1, class A2, class A3, class A4, class A5, class A6>
-    typename boost::enable_if_c<!_bi::is_same<Rt2, R>::value,
-    _bi::bind_t<Rt2, _mfi::BOOST_BIND_MF_NAME(cmf5)<R, T, B1, B2, B3, B4, B5>, typename _bi::list_av_6<A1, A2, A3, A4, A5, A6>::type>
-    >::type BOOST_BIND(R (BOOST_BIND_MF_CC T::*f) (B1, B2, B3, B4, B5) const BOOST_BIND_MF_NOEXCEPT, A1 a1, A2 a2, A3 a3, A4 a4, A5 a5, A6 a6)
-{
-    typedef _mfi::BOOST_BIND_MF_NAME(cmf5)<R, T, B1, B2, B3, B4, B5> F;
-    typedef typename _bi::list_av_6<A1, A2, A3, A4, A5, A6>::type list_type;
-    return _bi::bind_t<Rt2, F, list_type>(F(f), list_type(a1, a2, a3, a4, a5, a6));
-}
-
-// 6
-
-template<class R, class T,
-    class B1, class B2, class B3, class B4, class B5, class B6,
-    class A1, class A2, class A3, class A4, class A5, class A6, class A7>
-    _bi::bind_t<R, _mfi::BOOST_BIND_MF_NAME(mf6)<R, T, B1, B2, B3, B4, B5, B6>, typename _bi::list_av_7<A1, A2, A3, A4, A5, A6, A7>::type>
-    BOOST_BIND(R (BOOST_BIND_MF_CC T::*f) (B1, B2, B3, B4, B5, B6) BOOST_BIND_MF_NOEXCEPT, A1 a1, A2 a2, A3 a3, A4 a4, A5 a5, A6 a6, A7 a7)
-{
-    typedef _mfi::BOOST_BIND_MF_NAME(mf6)<R, T, B1, B2, B3, B4, B5, B6> F;
-    typedef typename _bi::list_av_7<A1, A2, A3, A4, A5, A6, A7>::type list_type;
-    return _bi::bind_t<R, F, list_type>(F(f), list_type(a1, a2, a3, a4, a5, a6, a7));
-}
-
-template<class R, class T,
-    class B1, class B2, class B3, class B4, class B5, class B6,
-    class A1, class A2, class A3, class A4, class A5, class A6, class A7>
-    _bi::bind_t<R, _mfi::BOOST_BIND_MF_NAME(cmf6)<R, T, B1, B2, B3, B4, B5, B6>, typename _bi::list_av_7<A1, A2, A3, A4, A5, A6, A7>::type>
-    BOOST_BIND(R (BOOST_BIND_MF_CC T::*f) (B1, B2, B3, B4, B5, B6) const BOOST_BIND_MF_NOEXCEPT, A1 a1, A2 a2, A3 a3, A4 a4, A5 a5, A6 a6, A7 a7)
-{
-    typedef _mfi::BOOST_BIND_MF_NAME(cmf6)<R, T, B1, B2, B3, B4, B5, B6> F;
-    typedef typename _bi::list_av_7<A1, A2, A3, A4, A5, A6, A7>::type list_type;
-    return _bi::bind_t<R, F, list_type>(F(f), list_type(a1, a2, a3, a4, a5, a6, a7));
-}
-
-template<class Rt2, class R, class T,
-    class B1, class B2, class B3, class B4, class B5, class B6,
-    class A1, class A2, class A3, class A4, class A5, class A6, class A7>
-    typename boost::enable_if_c<!_bi::is_same<Rt2, R>::value,
-    _bi::bind_t<Rt2, _mfi::BOOST_BIND_MF_NAME(mf6)<R, T, B1, B2, B3, B4, B5, B6>, typename _bi::list_av_7<A1, A2, A3, A4, A5, A6, A7>::type>
-    >::type BOOST_BIND(R (BOOST_BIND_MF_CC T::*f) (B1, B2, B3, B4, B5, B6) BOOST_BIND_MF_NOEXCEPT, A1 a1, A2 a2, A3 a3, A4 a4, A5 a5, A6 a6, A7 a7)
-{
-    typedef _mfi::BOOST_BIND_MF_NAME(mf6)<R, T, B1, B2, B3, B4, B5, B6> F;
-    typedef typename _bi::list_av_7<A1, A2, A3, A4, A5, A6, A7>::type list_type;
-    return _bi::bind_t<Rt2, F, list_type>(F(f), list_type(a1, a2, a3, a4, a5, a6, a7));
-}
-
-template<class Rt2, class R, class T,
-    class B1, class B2, class B3, class B4, class B5, class B6,
-    class A1, class A2, class A3, class A4, class A5, class A6, class A7>
-    typename boost::enable_if_c<!_bi::is_same<Rt2, R>::value,
-    _bi::bind_t<Rt2, _mfi::BOOST_BIND_MF_NAME(cmf6)<R, T, B1, B2, B3, B4, B5, B6>, typename _bi::list_av_7<A1, A2, A3, A4, A5, A6, A7>::type>
-    >::type BOOST_BIND(R (BOOST_BIND_MF_CC T::*f) (B1, B2, B3, B4, B5, B6) const BOOST_BIND_MF_NOEXCEPT, A1 a1, A2 a2, A3 a3, A4 a4, A5 a5, A6 a6, A7 a7)
-{
-    typedef _mfi::BOOST_BIND_MF_NAME(cmf6)<R, T, B1, B2, B3, B4, B5, B6> F;
-    typedef typename _bi::list_av_7<A1, A2, A3, A4, A5, A6, A7>::type list_type;
-    return _bi::bind_t<Rt2, F, list_type>(F(f), list_type(a1, a2, a3, a4, a5, a6, a7));
-}
-
-// 7
-
-template<class R, class T,
-    class B1, class B2, class B3, class B4, class B5, class B6, class B7,
-    class A1, class A2, class A3, class A4, class A5, class A6, class A7, class A8>
-    _bi::bind_t<R, _mfi::BOOST_BIND_MF_NAME(mf7)<R, T, B1, B2, B3, B4, B5, B6, B7>, typename _bi::list_av_8<A1, A2, A3, A4, A5, A6, A7, A8>::type>
-    BOOST_BIND(R (BOOST_BIND_MF_CC T::*f) (B1, B2, B3, B4, B5, B6, B7) BOOST_BIND_MF_NOEXCEPT, A1 a1, A2 a2, A3 a3, A4 a4, A5 a5, A6 a6, A7 a7, A8 a8)
-{
-    typedef _mfi::BOOST_BIND_MF_NAME(mf7)<R, T, B1, B2, B3, B4, B5, B6, B7> F;
-    typedef typename _bi::list_av_8<A1, A2, A3, A4, A5, A6, A7, A8>::type list_type;
-    return _bi::bind_t<R, F, list_type>(F(f), list_type(a1, a2, a3, a4, a5, a6, a7, a8));
-}
-
-template<class R, class T,
-    class B1, class B2, class B3, class B4, class B5, class B6, class B7,
-    class A1, class A2, class A3, class A4, class A5, class A6, class A7, class A8>
-    _bi::bind_t<R, _mfi::BOOST_BIND_MF_NAME(cmf7)<R, T, B1, B2, B3, B4, B5, B6, B7>, typename _bi::list_av_8<A1, A2, A3, A4, A5, A6, A7, A8>::type>
-    BOOST_BIND(R (BOOST_BIND_MF_CC T::*f) (B1, B2, B3, B4, B5, B6, B7) const BOOST_BIND_MF_NOEXCEPT, A1 a1, A2 a2, A3 a3, A4 a4, A5 a5, A6 a6, A7 a7, A8 a8)
-{
-    typedef _mfi::BOOST_BIND_MF_NAME(cmf7)<R, T, B1, B2, B3, B4, B5, B6, B7> F;
-    typedef typename _bi::list_av_8<A1, A2, A3, A4, A5, A6, A7, A8>::type list_type;
-    return _bi::bind_t<R, F, list_type>(F(f), list_type(a1, a2, a3, a4, a5, a6, a7, a8));
-}
-
-template<class Rt2, class R, class T,
-    class B1, class B2, class B3, class B4, class B5, class B6, class B7,
-    class A1, class A2, class A3, class A4, class A5, class A6, class A7, class A8>
-    typename boost::enable_if_c<!_bi::is_same<Rt2, R>::value,
-    _bi::bind_t<Rt2, _mfi::BOOST_BIND_MF_NAME(mf7)<R, T, B1, B2, B3, B4, B5, B6, B7>, typename _bi::list_av_8<A1, A2, A3, A4, A5, A6, A7, A8>::type>
-    >::type BOOST_BIND(R (BOOST_BIND_MF_CC T::*f) (B1, B2, B3, B4, B5, B6, B7) BOOST_BIND_MF_NOEXCEPT, A1 a1, A2 a2, A3 a3, A4 a4, A5 a5, A6 a6, A7 a7, A8 a8)
-{
-    typedef _mfi::BOOST_BIND_MF_NAME(mf7)<R, T, B1, B2, B3, B4, B5, B6, B7> F;
-    typedef typename _bi::list_av_8<A1, A2, A3, A4, A5, A6, A7, A8>::type list_type;
-    return _bi::bind_t<Rt2, F, list_type>(F(f), list_type(a1, a2, a3, a4, a5, a6, a7, a8));
-}
-
-template<class Rt2, class R, class T,
-    class B1, class B2, class B3, class B4, class B5, class B6, class B7,
-    class A1, class A2, class A3, class A4, class A5, class A6, class A7, class A8>
-    typename boost::enable_if_c<!_bi::is_same<Rt2, R>::value,
-    _bi::bind_t<Rt2, _mfi::BOOST_BIND_MF_NAME(cmf7)<R, T, B1, B2, B3, B4, B5, B6, B7>, typename _bi::list_av_8<A1, A2, A3, A4, A5, A6, A7, A8>::type>
-    >::type BOOST_BIND(R (BOOST_BIND_MF_CC T::*f) (B1, B2, B3, B4, B5, B6, B7) const BOOST_BIND_MF_NOEXCEPT, A1 a1, A2 a2, A3 a3, A4 a4, A5 a5, A6 a6, A7 a7, A8 a8)
-{
-    typedef _mfi::BOOST_BIND_MF_NAME(cmf7)<R, T, B1, B2, B3, B4, B5, B6, B7> F;
-    typedef typename _bi::list_av_8<A1, A2, A3, A4, A5, A6, A7, A8>::type list_type;
-    return _bi::bind_t<Rt2, F, list_type>(F(f), list_type(a1, a2, a3, a4, a5, a6, a7, a8));
-}
-
-// 8
-
-template<class R, class T,
-    class B1, class B2, class B3, class B4, class B5, class B6, class B7, class B8,
-    class A1, class A2, class A3, class A4, class A5, class A6, class A7, class A8, class A9>
-    _bi::bind_t<R, _mfi::BOOST_BIND_MF_NAME(mf8)<R, T, B1, B2, B3, B4, B5, B6, B7, B8>, typename _bi::list_av_9<A1, A2, A3, A4, A5, A6, A7, A8, A9>::type>
-    BOOST_BIND(R (BOOST_BIND_MF_CC T::*f) (B1, B2, B3, B4, B5, B6, B7, B8) BOOST_BIND_MF_NOEXCEPT, A1 a1, A2 a2, A3 a3, A4 a4, A5 a5, A6 a6, A7 a7, A8 a8, A9 a9)
-{
-    typedef _mfi::BOOST_BIND_MF_NAME(mf8)<R, T, B1, B2, B3, B4, B5, B6, B7, B8> F;
-    typedef typename _bi::list_av_9<A1, A2, A3, A4, A5, A6, A7, A8, A9>::type list_type;
-    return _bi::bind_t<R, F, list_type>(F(f), list_type(a1, a2, a3, a4, a5, a6, a7, a8, a9));
-}
-
-template<class R, class T,
-    class B1, class B2, class B3, class B4, class B5, class B6, class B7, class B8,
-    class A1, class A2, class A3, class A4, class A5, class A6, class A7, class A8, class A9>
-    _bi::bind_t<R, _mfi::BOOST_BIND_MF_NAME(cmf8)<R, T, B1, B2, B3, B4, B5, B6, B7, B8>, typename _bi::list_av_9<A1, A2, A3, A4, A5, A6, A7, A8, A9>::type>
-    BOOST_BIND(R (BOOST_BIND_MF_CC T::*f) (B1, B2, B3, B4, B5, B6, B7, B8) const BOOST_BIND_MF_NOEXCEPT, A1 a1, A2 a2, A3 a3, A4 a4, A5 a5, A6 a6, A7 a7, A8 a8, A9 a9)
-{
-    typedef _mfi::BOOST_BIND_MF_NAME(cmf8)<R, T, B1, B2, B3, B4, B5, B6, B7, B8> F;
-    typedef typename _bi::list_av_9<A1, A2, A3, A4, A5, A6, A7, A8, A9>::type list_type;
-    return _bi::bind_t<R, F, list_type>(F(f), list_type(a1, a2, a3, a4, a5, a6, a7, a8, a9));
-}
-
-template<class Rt2, class R, class T,
-    class B1, class B2, class B3, class B4, class B5, class B6, class B7, class B8,
-    class A1, class A2, class A3, class A4, class A5, class A6, class A7, class A8, class A9>
-    typename boost::enable_if_c<!_bi::is_same<Rt2, R>::value,
-    _bi::bind_t<Rt2, _mfi::BOOST_BIND_MF_NAME(mf8)<R, T, B1, B2, B3, B4, B5, B6, B7, B8>, typename _bi::list_av_9<A1, A2, A3, A4, A5, A6, A7, A8, A9>::type>
-    >::type BOOST_BIND(R (BOOST_BIND_MF_CC T::*f) (B1, B2, B3, B4, B5, B6, B7, B8) BOOST_BIND_MF_NOEXCEPT, A1 a1, A2 a2, A3 a3, A4 a4, A5 a5, A6 a6, A7 a7, A8 a8, A9 a9)
-{
-    typedef _mfi::BOOST_BIND_MF_NAME(mf8)<R, T, B1, B2, B3, B4, B5, B6, B7, B8> F;
-    typedef typename _bi::list_av_9<A1, A2, A3, A4, A5, A6, A7, A8, A9>::type list_type;
-    return _bi::bind_t<Rt2, F, list_type>(F(f), list_type(a1, a2, a3, a4, a5, a6, a7, a8, a9));
-}
-
-template<class Rt2, class R, class T,
-    class B1, class B2, class B3, class B4, class B5, class B6, class B7, class B8,
-    class A1, class A2, class A3, class A4, class A5, class A6, class A7, class A8, class A9>
-    typename boost::enable_if_c<!_bi::is_same<Rt2, R>::value,
-    _bi::bind_t<Rt2, _mfi::BOOST_BIND_MF_NAME(cmf8)<R, T, B1, B2, B3, B4, B5, B6, B7, B8>, typename _bi::list_av_9<A1, A2, A3, A4, A5, A6, A7, A8, A9>::type>
-    >::type BOOST_BIND(R (BOOST_BIND_MF_CC T::*f) (B1, B2, B3, B4, B5, B6, B7, B8) const BOOST_BIND_MF_NOEXCEPT, A1 a1, A2 a2, A3 a3, A4 a4, A5 a5, A6 a6, A7 a7, A8 a8, A9 a9)
-{
-    typedef _mfi::BOOST_BIND_MF_NAME(cmf8)<R, T, B1, B2, B3, B4, B5, B6, B7, B8> F;
-    typedef typename _bi::list_av_9<A1, A2, A3, A4, A5, A6, A7, A8, A9>::type list_type;
-    return _bi::bind_t<Rt2, F, list_type>(F(f), list_type(a1, a2, a3, a4, a5, a6, a7, a8, a9));
-}
diff --git a/src/boost/bind/bind_template.hpp b/src/boost/bind/bind_template.hpp
deleted file mode 100644
index 212ced7f..00000000
--- a/src/boost/bind/bind_template.hpp
+++ /dev/null
@@ -1,345 +0,0 @@
-//
-//  bind/bind_template.hpp
-//
-//  Do not include this header directly.
-//
-//  Copyright (c) 2001-2004 Peter Dimov and Multi Media Ltd.
-//
-// Distributed under the Boost 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/bind/bind.html for documentation.
-//
-
-    typedef typename result_traits<R, F>::type result_type;
-
-    result_type operator()()
-    {
-        list0 a;
-        BOOST_BIND_RETURN l_(type<result_type>(), f_, a, 0);
-    }
-
-    result_type operator()() const
-    {
-        list0 a;
-        BOOST_BIND_RETURN l_(type<result_type>(), f_, a, 0);
-    }
-
-    template<class A1> result_type operator()(A1 & a1)
-    {
-        list1<A1 &> a(a1);
-        BOOST_BIND_RETURN l_(type<result_type>(), f_, a, 0);
-    }
-
-    template<class A1> result_type operator()(A1 & a1) const
-    {
-        list1<A1 &> a(a1);
-        BOOST_BIND_RETURN l_(type<result_type>(), f_, a, 0);
-    }
-
-#if !defined(BOOST_NO_FUNCTION_TEMPLATE_ORDERING) \
- && !BOOST_WORKAROUND(__EDG_VERSION__, <= 238)
-
-    template<class A1> result_type operator()(A1 const & a1)
-    {
-        list1<A1 const &> a(a1);
-        BOOST_BIND_RETURN l_(type<result_type>(), f_, a, 0);
-    }
-
-    template<class A1> result_type operator()(A1 const & a1) const
-    {
-        list1<A1 const &> a(a1);
-        BOOST_BIND_RETURN l_(type<result_type>(), f_, a, 0);
-    }
-
-#endif
-
-    template<class A1, class A2> result_type operator()(A1 & a1, A2 & a2)
-    {
-        list2<A1 &, A2 &> a(a1, a2);
-        BOOST_BIND_RETURN l_(type<result_type>(), f_, a, 0);
-    }
-
-    template<class A1, class A2> result_type operator()(A1 & a1, A2 & a2) const
-    {
-        list2<A1 &, A2 &> a(a1, a2);
-        BOOST_BIND_RETURN l_(type<result_type>(), f_, a, 0);
-    }
-
-#if !defined(BOOST_NO_FUNCTION_TEMPLATE_ORDERING) \
- && !BOOST_WORKAROUND(__EDG_VERSION__, <= 238)
-
-    template<class A1, class A2> result_type operator()(A1 const & a1, A2 & a2)
-    {
-        list2<A1 const &, A2 &> a(a1, a2);
-        BOOST_BIND_RETURN l_(type<result_type>(), f_, a, 0);
-    }
-
-    template<class A1, class A2> result_type operator()(A1 const & a1, A2 & a2) const
-    {
-        list2<A1 const &, A2 &> a(a1, a2);
-        BOOST_BIND_RETURN l_(type<result_type>(), f_, a, 0);
-    }
-
-
-    template<class A1, class A2> result_type operator()(A1 & a1, A2 const & a2)
-    {
-        list2<A1 &, A2 const &> a(a1, a2);
-        BOOST_BIND_RETURN l_(type<result_type>(), f_, a, 0);
-    }
-
-    template<class A1, class A2> result_type operator()(A1 & a1, A2 const & a2) const
-    {
-        list2<A1 &, A2 const &> a(a1, a2);
-        BOOST_BIND_RETURN l_(type<result_type>(), f_, a, 0);
-    }
-
-
-    template<class A1, class A2> result_type operator()(A1 const & a1, A2 const & a2)
-    {
-        list2<A1 const &, A2 const &> a(a1, a2);
-        BOOST_BIND_RETURN l_(type<result_type>(), f_, a, 0);
-    }
-
-    template<class A1, class A2> result_type operator()(A1 const & a1, A2 const & a2) const
-    {
-        list2<A1 const &, A2 const &> a(a1, a2);
-        BOOST_BIND_RETURN l_(type<result_type>(), f_, a, 0);
-    }
-
-#endif
-
-    template<class A1, class A2, class A3> result_type operator()(A1 & a1, A2 & a2, A3 & a3)
-    {
-        list3<A1 &, A2 &, A3 &> a(a1, a2, a3);
-        BOOST_BIND_RETURN l_(type<result_type>(), f_, a, 0);
-    }
-
-    template<class A1, class A2, class A3> result_type operator()(A1 & a1, A2 & a2, A3 & a3) const
-    {
-        list3<A1 &, A2 &, A3 &> a(a1, a2, a3);
-        BOOST_BIND_RETURN l_(type<result_type>(), f_, a, 0);
-    }
-
-#if !defined(BOOST_NO_FUNCTION_TEMPLATE_ORDERING) \
- && !BOOST_WORKAROUND(__EDG_VERSION__, <= 238)
-
-    template<class A1, class A2, class A3> result_type operator()(A1 const & a1, A2 const & a2, A3 const & a3)
-    {
-        list3<A1 const &, A2 const &, A3 const &> a(a1, a2, a3);
-        BOOST_BIND_RETURN l_(type<result_type>(), f_, a, 0);
-    }
-
-    template<class A1, class A2, class A3> result_type operator()(A1 const & a1, A2 const & a2, A3 const & a3) const
-    {
-        list3<A1 const &, A2 const &, A3 const &> a(a1, a2, a3);
-        BOOST_BIND_RETURN l_(type<result_type>(), f_, a, 0);
-    }
-
-#endif
-
-    template<class A1, class A2, class A3, class A4> result_type operator()(A1 & a1, A2 & a2, A3 & a3, A4 & a4)
-    {
-        list4<A1 &, A2 &, A3 &, A4 &> a(a1, a2, a3, a4);
-        BOOST_BIND_RETURN l_(type<result_type>(), f_, a, 0);
-    }
-
-    template<class A1, class A2, class A3, class A4> result_type operator()(A1 & a1, A2 & a2, A3 & a3, A4 & a4) const
-    {
-        list4<A1 &, A2 &, A3 &, A4 &> a(a1, a2, a3, a4);
-        BOOST_BIND_RETURN l_(type<result_type>(), f_, a, 0);
-    }
-
-#if !defined(BOOST_NO_FUNCTION_TEMPLATE_ORDERING) \
- && !BOOST_WORKAROUND(__EDG_VERSION__, <= 238)
-
-    template<class A1, class A2, class A3, class A4> result_type operator()(A1 const & a1, A2 const & a2, A3 const & a3, A4 const & a4)
-    {
-        list4<A1 const &, A2 const &, A3 const &, A4 const &> a(a1, a2, a3, a4);
-        BOOST_BIND_RETURN l_(type<result_type>(), f_, a, 0);
-    }
-
-    template<class A1, class A2, class A3, class A4> result_type operator()(A1 const & a1, A2 const & a2, A3 const & a3, A4 const & a4) const
-    {
-        list4<A1 const &, A2 const &, A3 const &, A4 const &> a(a1, a2, a3, a4);
-        BOOST_BIND_RETURN l_(type<result_type>(), f_, a, 0);
-    }
-
-#endif
-
-    template<class A1, class A2, class A3, class A4, class A5> result_type operator()(A1 & a1, A2 & a2, A3 & a3, A4 & a4, A5 & a5)
-    {
-        list5<A1 &, A2 &, A3 &, A4 &, A5 &> a(a1, a2, a3, a4, a5);
-        BOOST_BIND_RETURN l_(type<result_type>(), f_, a, 0);
-    }
-
-    template<class A1, class A2, class A3, class A4, class A5> result_type operator()(A1 & a1, A2 & a2, A3 & a3, A4 & a4, A5 & a5) const
-    {
-        list5<A1 &, A2 &, A3 &, A4 &, A5 &> a(a1, a2, a3, a4, a5);
-        BOOST_BIND_RETURN l_(type<result_type>(), f_, a, 0);
-    }
-
-#if !defined(BOOST_NO_FUNCTION_TEMPLATE_ORDERING) \
- && !BOOST_WORKAROUND(__EDG_VERSION__, <= 238)
-
-    template<class A1, class A2, class A3, class A4, class A5> result_type operator()(A1 const & a1, A2 const & a2, A3 const & a3, A4 const & a4, A5 const & a5)
-    {
-        list5<A1 const &, A2 const &, A3 const &, A4 const &, A5 const &> a(a1, a2, a3, a4, a5);
-        BOOST_BIND_RETURN l_(type<result_type>(), f_, a, 0);
-    }
-
-    template<class A1, class A2, class A3, class A4, class A5> result_type operator()(A1 const & a1, A2 const & a2, A3 const & a3, A4 const & a4, A5 const & a5) const
-    {
-        list5<A1 const &, A2 const &, A3 const &, A4 const &, A5 const &> a(a1, a2, a3, a4, a5);
-        BOOST_BIND_RETURN l_(type<result_type>(), f_, a, 0);
-    }
-
-#endif
-
-    template<class A1, class A2, class A3, class A4, class A5, class A6> result_type operator()(A1 & a1, A2 & a2, A3 & a3, A4 & a4, A5 & a5, A6 & a6)
-    {
-        list6<A1 &, A2 &, A3 &, A4 &, A5 &, A6 &> a(a1, a2, a3, a4, a5, a6);
-        BOOST_BIND_RETURN l_(type<result_type>(), f_, a, 0);
-    }
-
-    template<class A1, class A2, class A3, class A4, class A5, class A6> result_type operator()(A1 & a1, A2 & a2, A3 & a3, A4 & a4, A5 & a5, A6 & a6) const
-    {
-        list6<A1 &, A2 &, A3 &, A4 &, A5 &, A6 &> a(a1, a2, a3, a4, a5, a6);
-        BOOST_BIND_RETURN l_(type<result_type>(), f_, a, 0);
-    }
-
-#if !defined(BOOST_NO_FUNCTION_TEMPLATE_ORDERING) \
- && !BOOST_WORKAROUND(__EDG_VERSION__, <= 238)
-
-    template<class A1, class A2, class A3, class A4, class A5, class A6> result_type operator()(A1 const & a1, A2 const & a2, A3 const & a3, A4 const & a4, A5 const & a5, A6 const & a6)
-    {
-        list6<A1 const &, A2 const &, A3 const &, A4 const &, A5 const &, A6 const &> a(a1, a2, a3, a4, a5, a6);
-        BOOST_BIND_RETURN l_(type<result_type>(), f_, a, 0);
-    }
-
-    template<class A1, class A2, class A3, class A4, class A5, class A6> result_type operator()(A1 const & a1, A2 const & a2, A3 const & a3, A4 const & a4, A5 const & a5, A6 const & a6) const
-    {
-        list6<A1 const &, A2 const &, A3 const &, A4 const &, A5 const &, A6 const &> a(a1, a2, a3, a4, a5, a6);
-        BOOST_BIND_RETURN l_(type<result_type>(), f_, a, 0);
-    }
-
-#endif
-
-    template<class A1, class A2, class A3, class A4, class A5, class A6, class A7> result_type operator()(A1 & a1, A2 & a2, A3 & a3, A4 & a4, A5 & a5, A6 & a6, A7 & a7)
-    {
-        list7<A1 &, A2 &, A3 &, A4 &, A5 &, A6 &, A7 &> a(a1, a2, a3, a4, a5, a6, a7);
-        BOOST_BIND_RETURN l_(type<result_type>(), f_, a, 0);
-    }
-
-    template<class A1, class A2, class A3, class A4, class A5, class A6, class A7> result_type operator()(A1 & a1, A2 & a2, A3 & a3, A4 & a4, A5 & a5, A6 & a6, A7 & a7) const
-    {
-        list7<A1 &, A2 &, A3 &, A4 &, A5 &, A6 &, A7 &> a(a1, a2, a3, a4, a5, a6, a7);
-        BOOST_BIND_RETURN l_(type<result_type>(), f_, a, 0);
-    }
-
-#if !defined(BOOST_NO_FUNCTION_TEMPLATE_ORDERING) \
- && !BOOST_WORKAROUND(__EDG_VERSION__, <= 238)
-
-    template<class A1, class A2, class A3, class A4, class A5, class A6, class A7> result_type operator()(A1 const & a1, A2 const & a2, A3 const & a3, A4 const & a4, A5 const & a5, A6 const & a6, A7 const & a7)
-    {
-        list7<A1 const &, A2 const &, A3 const &, A4 const &, A5 const &, A6 const &, A7 const &> a(a1, a2, a3, a4, a5, a6, a7);
-        BOOST_BIND_RETURN l_(type<result_type>(), f_, a, 0);
-    }
-
-    template<class A1, class A2, class A3, class A4, class A5, class A6, class A7> result_type operator()(A1 const & a1, A2 const & a2, A3 const & a3, A4 const & a4, A5 const & a5, A6 const & a6, A7 const & a7) const
-    {
-        list7<A1 const &, A2 const &, A3 const &, A4 const &, A5 const &, A6 const &, A7 const &> a(a1, a2, a3, a4, a5, a6, a7);
-        BOOST_BIND_RETURN l_(type<result_type>(), f_, a, 0);
-    }
-
-#endif
-
-    template<class A1, class A2, class A3, class A4, class A5, class A6, class A7, class A8> result_type operator()(A1 & a1, A2 & a2, A3 & a3, A4 & a4, A5 & a5, A6 & a6, A7 & a7, A8 & a8)
-    {
-        list8<A1 &, A2 &, A3 &, A4 &, A5 &, A6 &, A7 &, A8 &> a(a1, a2, a3, a4, a5, a6, a7, a8);
-        BOOST_BIND_RETURN l_(type<result_type>(), f_, a, 0);
-    }
-
-    template<class A1, class A2, class A3, class A4, class A5, class A6, class A7, class A8> result_type operator()(A1 & a1, A2 & a2, A3 & a3, A4 & a4, A5 & a5, A6 & a6, A7 & a7, A8 & a8) const
-    {
-        list8<A1 &, A2 &, A3 &, A4 &, A5 &, A6 &, A7 &, A8 &> a(a1, a2, a3, a4, a5, a6, a7, a8);
-        BOOST_BIND_RETURN l_(type<result_type>(), f_, a, 0);
-    }
-
-#if !defined(BOOST_NO_FUNCTION_TEMPLATE_ORDERING) \
- && !BOOST_WORKAROUND(__EDG_VERSION__, <= 238)
-
-    template<class A1, class A2, class A3, class A4, class A5, class A6, class A7, class A8> result_type operator()(A1 const & a1, A2 const & a2, A3 const & a3, A4 const & a4, A5 const & a5, A6 const & a6, A7 const & a7, A8 const & a8)
-    {
-        list8<A1 const &, A2 const &, A3 const &, A4 const &, A5 const &, A6 const &, A7 const &, A8 const &> a(a1, a2, a3, a4, a5, a6, a7, a8);
-        BOOST_BIND_RETURN l_(type<result_type>(), f_, a, 0);
-    }
-
-    template<class A1, class A2, class A3, class A4, class A5, class A6, class A7, class A8> result_type operator()(A1 const & a1, A2 const & a2, A3 const & a3, A4 const & a4, A5 const & a5, A6 const & a6, A7 const & a7, A8 const & a8) const
-    {
-        list8<A1 const &, A2 const &, A3 const &, A4 const &, A5 const &, A6 const &, A7 const &, A8 const &> a(a1, a2, a3, a4, a5, a6, a7, a8);
-        BOOST_BIND_RETURN l_(type<result_type>(), f_, a, 0);
-    }
-
-#endif
-
-    template<class A1, class A2, class A3, class A4, class A5, class A6, class A7, class A8, class A9> result_type operator()(A1 & a1, A2 & a2, A3 & a3, A4 & a4, A5 & a5, A6 & a6, A7 & a7, A8 & a8, A9 & a9)
-    {
-        list9<A1 &, A2 &, A3 &, A4 &, A5 &, A6 &, A7 &, A8 &, A9 &> a(a1, a2, a3, a4, a5, a6, a7, a8, a9);
-        BOOST_BIND_RETURN l_(type<result_type>(), f_, a, 0);
-    }
-
-    template<class A1, class A2, class A3, class A4, class A5, class A6, class A7, class A8, class A9> result_type operator()(A1 & a1, A2 & a2, A3 & a3, A4 & a4, A5 & a5, A6 & a6, A7 & a7, A8 & a8, A9 & a9) const
-    {
-        list9<A1 &, A2 &, A3 &, A4 &, A5 &, A6 &, A7 &, A8 &, A9 &> a(a1, a2, a3, a4, a5, a6, a7, a8, a9);
-        BOOST_BIND_RETURN l_(type<result_type>(), f_, a, 0);
-    }
-
-#if !defined(BOOST_NO_FUNCTION_TEMPLATE_ORDERING) \
- && !BOOST_WORKAROUND(__EDG_VERSION__, <= 238)
-
-    template<class A1, class A2, class A3, class A4, class A5, class A6, class A7, class A8, class A9> result_type operator()(A1 const & a1, A2 const & a2, A3 const & a3, A4 const & a4, A5 const & a5, A6 const & a6, A7 const & a7, A8 const & a8, A9 const & a9)
-    {
-        list9<A1 const &, A2 const &, A3 const &, A4 const &, A5 const &, A6 const &, A7 const &, A8 const &, A9 const &> a(a1, a2, a3, a4, a5, a6, a7, a8, a9);
-        BOOST_BIND_RETURN l_(type<result_type>(), f_, a, 0);
-    }
-
-    template<class A1, class A2, class A3, class A4, class A5, class A6, class A7, class A8, class A9> result_type operator()(A1 const & a1, A2 const & a2, A3 const & a3, A4 const & a4, A5 const & a5, A6 const & a6, A7 const & a7, A8 const & a8, A9 const & a9) const
-    {
-        list9<A1 const &, A2 const &, A3 const &, A4 const &, A5 const &, A6 const &, A7 const &, A8 const &, A9 const &> a(a1, a2, a3, a4, a5, a6, a7, a8, a9);
-        BOOST_BIND_RETURN l_(type<result_type>(), f_, a, 0);
-    }
-
-#endif
-
-    template<class A> result_type eval(A & a)
-    {
-        BOOST_BIND_RETURN l_(type<result_type>(), f_, a, 0);
-    }
-
-    template<class A> result_type eval(A & a) const
-    {
-        BOOST_BIND_RETURN l_(type<result_type>(), f_, a, 0);
-    }
-
-    template<class V> void accept(V & v) const
-    {
-#if !defined( BOOST_NO_ARGUMENT_DEPENDENT_LOOKUP ) && !defined( BOOST_BORLANDC )
-
-        using boost::visit_each;
-
-#endif
-        BOOST_BIND_VISIT_EACH(v, f_, 0);
-        l_.accept(v);
-    }
-
-    bool compare(this_type const & rhs) const
-    {
-        return ref_compare(f_, rhs.f_, 0) && l_ == rhs.l_;
-    }
-
-private:
-
-    F f_;
-    L l_;
diff --git a/src/boost/bind/detail/is_same.hpp b/src/boost/bind/detail/is_same.hpp
deleted file mode 100644
index 995b39f4..00000000
--- a/src/boost/bind/detail/is_same.hpp
+++ /dev/null
@@ -1,36 +0,0 @@
-#ifndef BOOST_BIND_DETAIL_IS_SAME_HPP_INCLUDED
-#define BOOST_BIND_DETAIL_IS_SAME_HPP_INCLUDED
-
-// is_same<T1,T2>::value is true when T1 == T2
-//
-// Copyright 2014 Peter Dimov
-//
-// Distributed under the Boost Software License, Version 1.0.
-// See accompanying file LICENSE_1_0.txt or copy at
-// http://www.boost.org/LICENSE_1_0.txt
-
-#include <boost/config.hpp>
-
-#if defined(BOOST_HAS_PRAGMA_ONCE)
-# pragma once
-#endif
-
-namespace boost
-{
-namespace _bi
-{
-
-template< class T1, class T2 > struct is_same
-{
-    BOOST_STATIC_CONSTANT( bool, value = false );
-};
-
-template< class T > struct is_same< T, T >
-{
-    BOOST_STATIC_CONSTANT( bool, value = true );
-};
-
-} // namespace _bi
-} // namespace boost
-
-#endif // #ifndef BOOST_BIND_DETAIL_IS_SAME_HPP_INCLUDED
diff --git a/src/boost/bind/detail/result_traits.hpp b/src/boost/bind/detail/result_traits.hpp
deleted file mode 100644
index d57d9fd1..00000000
--- a/src/boost/bind/detail/result_traits.hpp
+++ /dev/null
@@ -1,165 +0,0 @@
-#ifndef BOOST_BIND_DETAIL_RESULT_TRAITS_HPP_INCLUDED
-#define BOOST_BIND_DETAIL_RESULT_TRAITS_HPP_INCLUDED
-
-// MS compatible compilers support #pragma once
-
-#if defined(_MSC_VER) && (_MSC_VER >= 1020)
-# pragma once
-#endif
-
-//
-//  bind/detail/result_traits.hpp
-//
-//  boost/bind.hpp support header, return type deduction
-//
-//  Copyright 2006, 2020 Peter Dimov
-//
-//  Distributed under the Boost 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/bind/bind.html for documentation.
-//
-
-#include <boost/config.hpp>
-#include <boost/core/ref.hpp>
-
-#if BOOST_CXX_VERSION >= 201700L
-#include <functional>
-#endif
-
-namespace boost
-{
-
-namespace _bi
-{
-
-template<class R, class F> struct result_traits
-{
-    typedef R type;
-};
-
-struct unspecified {};
-
-template<class F> struct result_traits<unspecified, F>
-{
-    typedef typename F::result_type type;
-};
-
-template<class F> struct result_traits< unspecified, reference_wrapper<F> >
-{
-    typedef typename F::result_type type;
-};
-
-#if BOOST_CXX_VERSION >= 201700L
-
-template<class T> struct result_traits< unspecified, std::plus<T> >
-{
-    typedef T type;
-};
-
-template<class T> struct result_traits< unspecified, std::minus<T> >
-{
-    typedef T type;
-};
-
-template<class T> struct result_traits< unspecified, std::multiplies<T> >
-{
-    typedef T type;
-};
-
-template<class T> struct result_traits< unspecified, std::divides<T> >
-{
-    typedef T type;
-};
-
-template<class T> struct result_traits< unspecified, std::modulus<T> >
-{
-    typedef T type;
-};
-
-template<class T> struct result_traits< unspecified, std::negate<T> >
-{
-    typedef T type;
-};
-
-template<class T> struct result_traits< unspecified, std::equal_to<T> >
-{
-    typedef bool type;
-};
-
-template<class T> struct result_traits< unspecified, std::not_equal_to<T> >
-{
-    typedef bool type;
-};
-
-template<class T> struct result_traits< unspecified, std::greater<T> >
-{
-    typedef bool type;
-};
-
-template<class T> struct result_traits< unspecified, std::less<T> >
-{
-    typedef bool type;
-};
-
-template<class T> struct result_traits< unspecified, std::greater_equal<T> >
-{
-    typedef bool type;
-};
-
-template<class T> struct result_traits< unspecified, std::less_equal<T> >
-{
-    typedef bool type;
-};
-
-template<class T> struct result_traits< unspecified, std::logical_and<T> >
-{
-    typedef bool type;
-};
-
-template<class T> struct result_traits< unspecified, std::logical_or<T> >
-{
-    typedef bool type;
-};
-
-template<class T> struct result_traits< unspecified, std::logical_not<T> >
-{
-    typedef bool type;
-};
-
-template<class T> struct result_traits< unspecified, std::bit_and<T> >
-{
-    typedef T type;
-};
-
-template<class T> struct result_traits< unspecified, std::bit_or<T> >
-{
-    typedef T type;
-};
-
-template<class T> struct result_traits< unspecified, std::bit_xor<T> >
-{
-    typedef T type;
-};
-
-#if defined(BOOST_LIBSTDCXX_VERSION) && BOOST_LIBSTDCXX_VERSION < 40900
-
-// libstdc++ 4.8 and below don't have std::bit_not
-
-#else
-
-template<class T> struct result_traits< unspecified, std::bit_not<T> >
-{
-    typedef T type;
-};
-
-#endif
-
-#endif
-
-} // namespace _bi
-
-} // namespace boost
-
-#endif // #ifndef BOOST_BIND_DETAIL_RESULT_TRAITS_HPP_INCLUDED
diff --git a/src/boost/bind/placeholders.hpp b/src/boost/bind/placeholders.hpp
deleted file mode 100644
index 5e4b96d8..00000000
--- a/src/boost/bind/placeholders.hpp
+++ /dev/null
@@ -1,74 +0,0 @@
-#ifndef BOOST_BIND_PLACEHOLDERS_HPP_INCLUDED
-#define BOOST_BIND_PLACEHOLDERS_HPP_INCLUDED
-
-// MS compatible compilers support #pragma once
-
-#if defined(_MSC_VER) && (_MSC_VER >= 1020)
-# pragma once
-#endif
-
-//
-//  bind/placeholders.hpp - _N definitions
-//
-//  Copyright (c) 2002 Peter Dimov and Multi Media Ltd.
-//  Copyright 2015 Peter Dimov
-//
-//  Distributed under the Boost 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/bind/bind.html for documentation.
-//
-
-#include <boost/bind/arg.hpp>
-#include <boost/config.hpp>
-
-namespace boost
-{
-
-namespace placeholders
-{
-
-#if defined(BOOST_BORLANDC) || defined(__GNUC__) && (__GNUC__ < 4)
-
-inline boost::arg<1> _1() { return boost::arg<1>(); }
-inline boost::arg<2> _2() { return boost::arg<2>(); }
-inline boost::arg<3> _3() { return boost::arg<3>(); }
-inline boost::arg<4> _4() { return boost::arg<4>(); }
-inline boost::arg<5> _5() { return boost::arg<5>(); }
-inline boost::arg<6> _6() { return boost::arg<6>(); }
-inline boost::arg<7> _7() { return boost::arg<7>(); }
-inline boost::arg<8> _8() { return boost::arg<8>(); }
-inline boost::arg<9> _9() { return boost::arg<9>(); }
-
-#elif !defined(BOOST_NO_CXX17_INLINE_VARIABLES)
-
-BOOST_INLINE_CONSTEXPR boost::arg<1> _1;
-BOOST_INLINE_CONSTEXPR boost::arg<2> _2;
-BOOST_INLINE_CONSTEXPR boost::arg<3> _3;
-BOOST_INLINE_CONSTEXPR boost::arg<4> _4;
-BOOST_INLINE_CONSTEXPR boost::arg<5> _5;
-BOOST_INLINE_CONSTEXPR boost::arg<6> _6;
-BOOST_INLINE_CONSTEXPR boost::arg<7> _7;
-BOOST_INLINE_CONSTEXPR boost::arg<8> _8;
-BOOST_INLINE_CONSTEXPR boost::arg<9> _9;
-
-#else
-
-BOOST_STATIC_CONSTEXPR boost::arg<1> _1;
-BOOST_STATIC_CONSTEXPR boost::arg<2> _2;
-BOOST_STATIC_CONSTEXPR boost::arg<3> _3;
-BOOST_STATIC_CONSTEXPR boost::arg<4> _4;
-BOOST_STATIC_CONSTEXPR boost::arg<5> _5;
-BOOST_STATIC_CONSTEXPR boost::arg<6> _6;
-BOOST_STATIC_CONSTEXPR boost::arg<7> _7;
-BOOST_STATIC_CONSTEXPR boost::arg<8> _8;
-BOOST_STATIC_CONSTEXPR boost::arg<9> _9;
-
-#endif
-
-} // namespace placeholders
-
-} // namespace boost
-
-#endif // #ifndef BOOST_BIND_PLACEHOLDERS_HPP_INCLUDED
diff --git a/src/boost/bind/std_placeholders.hpp b/src/boost/bind/std_placeholders.hpp
deleted file mode 100644
index 125ff240..00000000
--- a/src/boost/bind/std_placeholders.hpp
+++ /dev/null
@@ -1,40 +0,0 @@
-#ifndef BOOST_BIND_STD_PLACEHOLDERS_HPP_INCLUDED
-#define BOOST_BIND_STD_PLACEHOLDERS_HPP_INCLUDED
-
-// MS compatible compilers support #pragma once
-
-#if defined(_MSC_VER) && (_MSC_VER >= 1020)
-# pragma once
-#endif
-
-// Copyright 2021 Peter Dimov
-// Distributed under the Boost Software License, Version 1.0.
-// https://www.boost.org/LICENSE_1_0.txt
-
-#include <boost/bind/detail/requires_cxx11.hpp>
-#include <boost/is_placeholder.hpp>
-#include <boost/config.hpp>
-
-#if !defined(BOOST_NO_CXX11_HDR_FUNCTIONAL) && !defined(BOOST_NO_CXX11_DECLTYPE) && !defined(BOOST_NO_CXX11_HDR_TYPE_TRAITS)
-
-#include <functional>
-#include <type_traits>
-
-namespace boost
-{
-
-template<> struct is_placeholder< typename std::decay<decltype(std::placeholders::_1)>::type > { enum _vt { value = 1 }; };
-template<> struct is_placeholder< typename std::decay<decltype(std::placeholders::_2)>::type > { enum _vt { value = 2 }; };
-template<> struct is_placeholder< typename std::decay<decltype(std::placeholders::_3)>::type > { enum _vt { value = 3 }; };
-template<> struct is_placeholder< typename std::decay<decltype(std::placeholders::_4)>::type > { enum _vt { value = 4 }; };
-template<> struct is_placeholder< typename std::decay<decltype(std::placeholders::_5)>::type > { enum _vt { value = 5 }; };
-template<> struct is_placeholder< typename std::decay<decltype(std::placeholders::_6)>::type > { enum _vt { value = 6 }; };
-template<> struct is_placeholder< typename std::decay<decltype(std::placeholders::_7)>::type > { enum _vt { value = 7 }; };
-template<> struct is_placeholder< typename std::decay<decltype(std::placeholders::_8)>::type > { enum _vt { value = 8 }; };
-template<> struct is_placeholder< typename std::decay<decltype(std::placeholders::_9)>::type > { enum _vt { value = 9 }; };
-
-} // namespace boost
-
-#endif
-
-#endif // #ifndef BOOST_BIND_STD_PLACEHOLDERS_HPP_INCLUDED
diff --git a/src/boost/bind/storage.hpp b/src/boost/bind/storage.hpp
deleted file mode 100644
index 2ab0db18..00000000
--- a/src/boost/bind/storage.hpp
+++ /dev/null
@@ -1,476 +0,0 @@
-#ifndef BOOST_BIND_STORAGE_HPP_INCLUDED
-#define BOOST_BIND_STORAGE_HPP_INCLUDED
-
-// MS compatible compilers support #pragma once
-
-#if defined(_MSC_VER) && (_MSC_VER >= 1020)
-# pragma once
-#endif
-
-//
-//  bind/storage.hpp
-//
-//  boost/bind.hpp support header, optimized storage
-//
-//  Copyright (c) 2006 Peter Dimov
-//
-//  Distributed under the Boost 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/bind/bind.html for documentation.
-//
-
-#include <boost/bind/detail/requires_cxx11.hpp>
-#include <boost/config.hpp>
-#include <boost/bind/arg.hpp>
-
-#ifdef BOOST_MSVC
-# pragma warning(push)
-# pragma warning(disable: 4512) // assignment operator could not be generated
-#endif
-
-namespace boost
-{
-
-namespace _bi
-{
-
-// 1
-
-template<class A1> struct storage1
-{
-    explicit storage1( A1 a1 ): a1_( a1 ) {}
-
-    template<class V> void accept(V & v) const
-    {
-        BOOST_BIND_VISIT_EACH(v, a1_, 0);
-    }
-
-    A1 a1_;
-};
-
-#if !defined( BOOST_NO_TEMPLATE_PARTIAL_SPECIALIZATION ) && !defined( BOOST_BORLANDC )
-
-template<int I> struct storage1< boost::arg<I> >
-{
-    explicit storage1( boost::arg<I> ) {}
-
-    template<class V> void accept(V &) const { }
-
-    static boost::arg<I> a1_() { return boost::arg<I>(); }
-};
-
-template<int I> struct storage1< boost::arg<I> (*) () >
-{
-    explicit storage1( boost::arg<I> (*) () ) {}
-
-    template<class V> void accept(V &) const { }
-
-    static boost::arg<I> a1_() { return boost::arg<I>(); }
-};
-
-#endif
-
-// 2
-
-template<class A1, class A2> struct storage2: public storage1<A1>
-{
-    typedef storage1<A1> inherited;
-
-    storage2( A1 a1, A2 a2 ): storage1<A1>( a1 ), a2_( a2 ) {}
-
-    template<class V> void accept(V & v) const
-    {
-        inherited::accept(v);
-        BOOST_BIND_VISIT_EACH(v, a2_, 0);
-    }
-
-    A2 a2_;
-};
-
-#if !defined( BOOST_NO_TEMPLATE_PARTIAL_SPECIALIZATION )
-
-template<class A1, int I> struct storage2< A1, boost::arg<I> >: public storage1<A1>
-{
-    typedef storage1<A1> inherited;
-
-    storage2( A1 a1, boost::arg<I> ): storage1<A1>( a1 ) {}
-
-    template<class V> void accept(V & v) const
-    {
-        inherited::accept(v);
-    }
-
-    static boost::arg<I> a2_() { return boost::arg<I>(); }
-};
-
-template<class A1, int I> struct storage2< A1, boost::arg<I> (*) () >: public storage1<A1>
-{
-    typedef storage1<A1> inherited;
-
-    storage2( A1 a1, boost::arg<I> (*) () ): storage1<A1>( a1 ) {}
-
-    template<class V> void accept(V & v) const
-    {
-        inherited::accept(v);
-    }
-
-    static boost::arg<I> a2_() { return boost::arg<I>(); }
-};
-
-#endif
-
-// 3
-
-template<class A1, class A2, class A3> struct storage3: public storage2< A1, A2 >
-{
-    typedef storage2<A1, A2> inherited;
-
-    storage3( A1 a1, A2 a2, A3 a3 ): storage2<A1, A2>( a1, a2 ), a3_( a3 ) {}
-
-    template<class V> void accept(V & v) const
-    {
-        inherited::accept(v);
-        BOOST_BIND_VISIT_EACH(v, a3_, 0);
-    }
-
-    A3 a3_;
-};
-
-#if !defined( BOOST_NO_TEMPLATE_PARTIAL_SPECIALIZATION )
-
-template<class A1, class A2, int I> struct storage3< A1, A2, boost::arg<I> >: public storage2< A1, A2 >
-{
-    typedef storage2<A1, A2> inherited;
-
-    storage3( A1 a1, A2 a2, boost::arg<I> ): storage2<A1, A2>( a1, a2 ) {}
-
-    template<class V> void accept(V & v) const
-    {
-        inherited::accept(v);
-    }
-
-    static boost::arg<I> a3_() { return boost::arg<I>(); }
-};
-
-template<class A1, class A2, int I> struct storage3< A1, A2, boost::arg<I> (*) () >: public storage2< A1, A2 >
-{
-    typedef storage2<A1, A2> inherited;
-
-    storage3( A1 a1, A2 a2, boost::arg<I> (*) () ): storage2<A1, A2>( a1, a2 ) {}
-
-    template<class V> void accept(V & v) const
-    {
-        inherited::accept(v);
-    }
-
-    static boost::arg<I> a3_() { return boost::arg<I>(); }
-};
-
-#endif
-
-// 4
-
-template<class A1, class A2, class A3, class A4> struct storage4: public storage3< A1, A2, A3 >
-{
-    typedef storage3<A1, A2, A3> inherited;
-
-    storage4( A1 a1, A2 a2, A3 a3, A4 a4 ): storage3<A1, A2, A3>( a1, a2, a3 ), a4_( a4 ) {}
-
-    template<class V> void accept(V & v) const
-    {
-        inherited::accept(v);
-        BOOST_BIND_VISIT_EACH(v, a4_, 0);
-    }
-
-    A4 a4_;
-};
-
-#if !defined( BOOST_NO_TEMPLATE_PARTIAL_SPECIALIZATION )
-
-template<class A1, class A2, class A3, int I> struct storage4< A1, A2, A3, boost::arg<I> >: public storage3< A1, A2, A3 >
-{
-    typedef storage3<A1, A2, A3> inherited;
-
-    storage4( A1 a1, A2 a2, A3 a3, boost::arg<I> ): storage3<A1, A2, A3>( a1, a2, a3 ) {}
-
-    template<class V> void accept(V & v) const
-    {
-        inherited::accept(v);
-    }
-
-    static boost::arg<I> a4_() { return boost::arg<I>(); }
-};
-
-template<class A1, class A2, class A3, int I> struct storage4< A1, A2, A3, boost::arg<I> (*) () >: public storage3< A1, A2, A3 >
-{
-    typedef storage3<A1, A2, A3> inherited;
-
-    storage4( A1 a1, A2 a2, A3 a3, boost::arg<I> (*) () ): storage3<A1, A2, A3>( a1, a2, a3 ) {}
-
-    template<class V> void accept(V & v) const
-    {
-        inherited::accept(v);
-    }
-
-    static boost::arg<I> a4_() { return boost::arg<I>(); }
-};
-
-#endif
-
-// 5
-
-template<class A1, class A2, class A3, class A4, class A5> struct storage5: public storage4< A1, A2, A3, A4 >
-{
-    typedef storage4<A1, A2, A3, A4> inherited;
-
-    storage5( A1 a1, A2 a2, A3 a3, A4 a4, A5 a5 ): storage4<A1, A2, A3, A4>( a1, a2, a3, a4 ), a5_( a5 ) {}
-
-    template<class V> void accept(V & v) const
-    {
-        inherited::accept(v);
-        BOOST_BIND_VISIT_EACH(v, a5_, 0);
-    }
-
-    A5 a5_;
-};
-
-#if !defined( BOOST_NO_TEMPLATE_PARTIAL_SPECIALIZATION )
-
-template<class A1, class A2, class A3, class A4, int I> struct storage5< A1, A2, A3, A4, boost::arg<I> >: public storage4< A1, A2, A3, A4 >
-{
-    typedef storage4<A1, A2, A3, A4> inherited;
-
-    storage5( A1 a1, A2 a2, A3 a3, A4 a4, boost::arg<I> ): storage4<A1, A2, A3, A4>( a1, a2, a3, a4 ) {}
-
-    template<class V> void accept(V & v) const
-    {
-        inherited::accept(v);
-    }
-
-    static boost::arg<I> a5_() { return boost::arg<I>(); }
-};
-
-template<class A1, class A2, class A3, class A4, int I> struct storage5< A1, A2, A3, A4, boost::arg<I> (*) () >: public storage4< A1, A2, A3, A4 >
-{
-    typedef storage4<A1, A2, A3, A4> inherited;
-
-    storage5( A1 a1, A2 a2, A3 a3, A4 a4, boost::arg<I> (*) () ): storage4<A1, A2, A3, A4>( a1, a2, a3, a4 ) {}
-
-    template<class V> void accept(V & v) const
-    {
-        inherited::accept(v);
-    }
-
-    static boost::arg<I> a5_() { return boost::arg<I>(); }
-};
-
-#endif
-
-// 6
-
-template<class A1, class A2, class A3, class A4, class A5, class A6> struct storage6: public storage5< A1, A2, A3, A4, A5 >
-{
-    typedef storage5<A1, A2, A3, A4, A5> inherited;
-
-    storage6( A1 a1, A2 a2, A3 a3, A4 a4, A5 a5, A6 a6 ): storage5<A1, A2, A3, A4, A5>( a1, a2, a3, a4, a5 ), a6_( a6 ) {}
-
-    template<class V> void accept(V & v) const
-    {
-        inherited::accept(v);
-        BOOST_BIND_VISIT_EACH(v, a6_, 0);
-    }
-
-    A6 a6_;
-};
-
-#if !defined( BOOST_NO_TEMPLATE_PARTIAL_SPECIALIZATION )
-
-template<class A1, class A2, class A3, class A4, class A5, int I> struct storage6< A1, A2, A3, A4, A5, boost::arg<I> >: public storage5< A1, A2, A3, A4, A5 >
-{
-    typedef storage5<A1, A2, A3, A4, A5> inherited;
-
-    storage6( A1 a1, A2 a2, A3 a3, A4 a4, A5 a5, boost::arg<I> ): storage5<A1, A2, A3, A4, A5>( a1, a2, a3, a4, a5 ) {}
-
-    template<class V> void accept(V & v) const
-    {
-        inherited::accept(v);
-    }
-
-    static boost::arg<I> a6_() { return boost::arg<I>(); }
-};
-
-template<class A1, class A2, class A3, class A4, class A5, int I> struct storage6< A1, A2, A3, A4, A5, boost::arg<I> (*) () >: public storage5< A1, A2, A3, A4, A5 >
-{
-    typedef storage5<A1, A2, A3, A4, A5> inherited;
-
-    storage6( A1 a1, A2 a2, A3 a3, A4 a4, A5 a5, boost::arg<I> (*) () ): storage5<A1, A2, A3, A4, A5>( a1, a2, a3, a4, a5 ) {}
-
-    template<class V> void accept(V & v) const
-    {
-        inherited::accept(v);
-    }
-
-    static boost::arg<I> a6_() { return boost::arg<I>(); }
-};
-
-#endif
-
-// 7
-
-template<class A1, class A2, class A3, class A4, class A5, class A6, class A7> struct storage7: public storage6< A1, A2, A3, A4, A5, A6 >
-{
-    typedef storage6<A1, A2, A3, A4, A5, A6> inherited;
-
-    storage7( A1 a1, A2 a2, A3 a3, A4 a4, A5 a5, A6 a6, A7 a7 ): storage6<A1, A2, A3, A4, A5, A6>( a1, a2, a3, a4, a5, a6 ), a7_( a7 ) {}
-
-    template<class V> void accept(V & v) const
-    {
-        inherited::accept(v);
-        BOOST_BIND_VISIT_EACH(v, a7_, 0);
-    }
-
-    A7 a7_;
-};
-
-#if !defined( BOOST_NO_TEMPLATE_PARTIAL_SPECIALIZATION )
-
-template<class A1, class A2, class A3, class A4, class A5, class A6, int I> struct storage7< A1, A2, A3, A4, A5, A6, boost::arg<I> >: public storage6< A1, A2, A3, A4, A5, A6 >
-{
-    typedef storage6<A1, A2, A3, A4, A5, A6> inherited;
-
-    storage7( A1 a1, A2 a2, A3 a3, A4 a4, A5 a5, A6 a6, boost::arg<I> ): storage6<A1, A2, A3, A4, A5, A6>( a1, a2, a3, a4, a5, a6 ) {}
-
-    template<class V> void accept(V & v) const
-    {
-        inherited::accept(v);
-    }
-
-    static boost::arg<I> a7_() { return boost::arg<I>(); }
-};
-
-template<class A1, class A2, class A3, class A4, class A5, class A6, int I> struct storage7< A1, A2, A3, A4, A5, A6, boost::arg<I> (*) () >: public storage6< A1, A2, A3, A4, A5, A6 >
-{
-    typedef storage6<A1, A2, A3, A4, A5, A6> inherited;
-
-    storage7( A1 a1, A2 a2, A3 a3, A4 a4, A5 a5, A6 a6, boost::arg<I> (*) () ): storage6<A1, A2, A3, A4, A5, A6>( a1, a2, a3, a4, a5, a6 ) {}
-
-    template<class V> void accept(V & v) const
-    {
-        inherited::accept(v);
-    }
-
-    static boost::arg<I> a7_() { return boost::arg<I>(); }
-};
-
-#endif
-
-// 8
-
-template<class A1, class A2, class A3, class A4, class A5, class A6, class A7, class A8> struct storage8: public storage7< A1, A2, A3, A4, A5, A6, A7 >
-{
-    typedef storage7<A1, A2, A3, A4, A5, A6, A7> inherited;
-
-    storage8( A1 a1, A2 a2, A3 a3, A4 a4, A5 a5, A6 a6, A7 a7, A8 a8 ): storage7<A1, A2, A3, A4, A5, A6, A7>( a1, a2, a3, a4, a5, a6, a7 ), a8_( a8 ) {}
-
-    template<class V> void accept(V & v) const
-    {
-        inherited::accept(v);
-        BOOST_BIND_VISIT_EACH(v, a8_, 0);
-    }
-
-    A8 a8_;
-};
-
-#if !defined( BOOST_NO_TEMPLATE_PARTIAL_SPECIALIZATION )
-
-template<class A1, class A2, class A3, class A4, class A5, class A6, class A7, int I> struct storage8< A1, A2, A3, A4, A5, A6, A7, boost::arg<I> >: public storage7< A1, A2, A3, A4, A5, A6, A7 >
-{
-    typedef storage7<A1, A2, A3, A4, A5, A6, A7> inherited;
-
-    storage8( A1 a1, A2 a2, A3 a3, A4 a4, A5 a5, A6 a6, A7 a7, boost::arg<I> ): storage7<A1, A2, A3, A4, A5, A6, A7>( a1, a2, a3, a4, a5, a6, a7 ) {}
-
-    template<class V> void accept(V & v) const
-    {
-        inherited::accept(v);
-    }
-
-    static boost::arg<I> a8_() { return boost::arg<I>(); }
-};
-
-template<class A1, class A2, class A3, class A4, class A5, class A6, class A7, int I> struct storage8< A1, A2, A3, A4, A5, A6, A7, boost::arg<I> (*) () >: public storage7< A1, A2, A3, A4, A5, A6, A7 >
-{
-    typedef storage7<A1, A2, A3, A4, A5, A6, A7> inherited;
-
-    storage8( A1 a1, A2 a2, A3 a3, A4 a4, A5 a5, A6 a6, A7 a7, boost::arg<I> (*) () ): storage7<A1, A2, A3, A4, A5, A6, A7>( a1, a2, a3, a4, a5, a6, a7 ) {}
-
-    template<class V> void accept(V & v) const
-    {
-        inherited::accept(v);
-    }
-
-    static boost::arg<I> a8_() { return boost::arg<I>(); }
-};
-
-#endif
-
-// 9
-
-template<class A1, class A2, class A3, class A4, class A5, class A6, class A7, class A8, class A9> struct storage9: public storage8< A1, A2, A3, A4, A5, A6, A7, A8 >
-{
-    typedef storage8<A1, A2, A3, A4, A5, A6, A7, A8> inherited;
-
-    storage9( A1 a1, A2 a2, A3 a3, A4 a4, A5 a5, A6 a6, A7 a7, A8 a8, A9 a9 ): storage8<A1, A2, A3, A4, A5, A6, A7, A8>( a1, a2, a3, a4, a5, a6, a7, a8 ), a9_( a9 ) {}
-
-    template<class V> void accept(V & v) const
-    {
-        inherited::accept(v);
-        BOOST_BIND_VISIT_EACH(v, a9_, 0);
-    }
-
-    A9 a9_;
-};
-
-#if !defined( BOOST_NO_TEMPLATE_PARTIAL_SPECIALIZATION )
-
-template<class A1, class A2, class A3, class A4, class A5, class A6, class A7, class A8, int I> struct storage9< A1, A2, A3, A4, A5, A6, A7, A8, boost::arg<I> >: public storage8< A1, A2, A3, A4, A5, A6, A7, A8 >
-{
-    typedef storage8<A1, A2, A3, A4, A5, A6, A7, A8> inherited;
-
-    storage9( A1 a1, A2 a2, A3 a3, A4 a4, A5 a5, A6 a6, A7 a7, A8 a8, boost::arg<I> ): storage8<A1, A2, A3, A4, A5, A6, A7, A8>( a1, a2, a3, a4, a5, a6, a7, a8 ) {}
-
-    template<class V> void accept(V & v) const
-    {
-        inherited::accept(v);
-    }
-
-    static boost::arg<I> a9_() { return boost::arg<I>(); }
-};
-
-template<class A1, class A2, class A3, class A4, class A5, class A6, class A7, class A8, int I> struct storage9< A1, A2, A3, A4, A5, A6, A7, A8, boost::arg<I> (*) () >: public storage8< A1, A2, A3, A4, A5, A6, A7, A8 >
-{
-    typedef storage8<A1, A2, A3, A4, A5, A6, A7, A8> inherited;
-
-    storage9( A1 a1, A2 a2, A3 a3, A4 a4, A5 a5, A6 a6, A7 a7, A8 a8, boost::arg<I> (*) () ): storage8<A1, A2, A3, A4, A5, A6, A7, A8>( a1, a2, a3, a4, a5, a6, a7, a8 ) {}
-
-    template<class V> void accept(V & v) const
-    {
-        inherited::accept(v);
-    }
-
-    static boost::arg<I> a9_() { return boost::arg<I>(); }
-};
-
-#endif
-
-} // namespace _bi
-
-} // namespace boost
-
-#ifdef BOOST_MSVC
-# pragma warning(default: 4512) // assignment operator could not be generated
-# pragma warning(pop)
-#endif
-
-#endif // #ifndef BOOST_BIND_STORAGE_HPP_INCLUDED
diff --git a/src/boost/container/allocator_traits.hpp b/src/boost/container/allocator_traits.hpp
deleted file mode 100644
index f5f73efa..00000000
--- a/src/boost/container/allocator_traits.hpp
+++ /dev/null
@@ -1,502 +0,0 @@
-//////////////////////////////////////////////////////////////////////////////
-//
-// (C) Copyright Pablo Halpern 2009. Distributed under the Boost
-// Software License, Version 1.0. (See accompanying file
-// LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
-//
-//////////////////////////////////////////////////////////////////////////////
-//
-// (C) Copyright Ion Gaztanaga 2011-2013. Distributed under the Boost
-// 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.
-//
-//////////////////////////////////////////////////////////////////////////////
-#ifndef BOOST_CONTAINER_ALLOCATOR_ALLOCATOR_TRAITS_HPP
-#define BOOST_CONTAINER_ALLOCATOR_ALLOCATOR_TRAITS_HPP
-
-#ifndef BOOST_CONFIG_HPP
-#  include <boost/config.hpp>
-#endif
-
-#if defined(BOOST_HAS_PRAGMA_ONCE)
-#  pragma once
-#endif
-
-#include <boost/container/detail/config_begin.hpp>
-#include <boost/container/detail/workaround.hpp>
-
-// container
-#include <boost/container/container_fwd.hpp>
-#include <boost/container/detail/mpl.hpp>
-#include <boost/container/detail/type_traits.hpp>  //is_empty
-#include <boost/container/detail/placement_new.hpp>
-#ifndef BOOST_CONTAINER_DETAIL_STD_FWD_HPP
-#include <boost/container/detail/std_fwd.hpp>
-#endif
-// intrusive
-#include <boost/intrusive/pointer_traits.hpp>
-#include <boost/intrusive/detail/mpl.hpp>
-// move
-#include <boost/move/utility_core.hpp>
-// move/detail
-#if defined(BOOST_NO_CXX11_VARIADIC_TEMPLATES)
-#include <boost/move/detail/fwd_macros.hpp>
-#endif
-// other boost
-#include <boost/static_assert.hpp>
-
-#ifndef BOOST_CONTAINER_DOXYGEN_INVOKED
-
-#if defined(BOOST_GCC) && (BOOST_GCC >= 40600)
-#pragma GCC diagnostic push
-#pragma GCC diagnostic ignored "-Wunused-result"
-#endif
-
-#define BOOST_INTRUSIVE_HAS_MEMBER_FUNCTION_CALLABLE_WITH_FUNCNAME allocate
-#define BOOST_INTRUSIVE_HAS_MEMBER_FUNCTION_CALLABLE_WITH_NS_BEG namespace boost { namespace container { namespace dtl {
-#define BOOST_INTRUSIVE_HAS_MEMBER_FUNCTION_CALLABLE_WITH_NS_END   }}}
-#define BOOST_INTRUSIVE_HAS_MEMBER_FUNCTION_CALLABLE_WITH_MIN 2
-#define BOOST_INTRUSIVE_HAS_MEMBER_FUNCTION_CALLABLE_WITH_MAX 2
-#include <boost/intrusive/detail/has_member_function_callable_with.hpp>
-
-#define BOOST_INTRUSIVE_HAS_MEMBER_FUNCTION_CALLABLE_WITH_FUNCNAME destroy
-#define BOOST_INTRUSIVE_HAS_MEMBER_FUNCTION_CALLABLE_WITH_NS_BEG namespace boost { namespace container { namespace dtl {
-#define BOOST_INTRUSIVE_HAS_MEMBER_FUNCTION_CALLABLE_WITH_NS_END   }}}
-#define BOOST_INTRUSIVE_HAS_MEMBER_FUNCTION_CALLABLE_WITH_MIN 1
-#define BOOST_INTRUSIVE_HAS_MEMBER_FUNCTION_CALLABLE_WITH_MAX 1
-#include <boost/intrusive/detail/has_member_function_callable_with.hpp>
-
-#define BOOST_INTRUSIVE_HAS_MEMBER_FUNCTION_CALLABLE_WITH_FUNCNAME construct
-#define BOOST_INTRUSIVE_HAS_MEMBER_FUNCTION_CALLABLE_WITH_NS_BEG namespace boost { namespace container { namespace dtl {
-#define BOOST_INTRUSIVE_HAS_MEMBER_FUNCTION_CALLABLE_WITH_NS_END   }}}
-#define BOOST_INTRUSIVE_HAS_MEMBER_FUNCTION_CALLABLE_WITH_MIN 1
-#define BOOST_INTRUSIVE_HAS_MEMBER_FUNCTION_CALLABLE_WITH_MAX 9
-#include <boost/intrusive/detail/has_member_function_callable_with.hpp>
-
-#if defined(BOOST_GCC) && (BOOST_GCC >= 40600)
-#pragma GCC diagnostic pop
-#endif
-
-#endif   //#ifndef BOOST_CONTAINER_DOXYGEN_INVOKED
-
-namespace boost {
-namespace container {
-
-#ifndef BOOST_CONTAINER_DOXYGEN_INVOKED
-
-template<class T, class VoidAllocator, class Options>
-class small_vector_allocator;
-
-namespace allocator_traits_detail {
-
-BOOST_INTRUSIVE_HAS_STATIC_MEMBER_FUNC_SIGNATURE(has_max_size, max_size)
-BOOST_INTRUSIVE_HAS_STATIC_MEMBER_FUNC_SIGNATURE(has_select_on_container_copy_construction, select_on_container_copy_construction)
-
-}  //namespace allocator_traits_detail {
-
-namespace dtl {
-
-//workaround needed for C++03 compilers with no construct()
-//supporting rvalue references
-template<class Allocator>
-struct is_std_allocator
-{  static const bool value = false; };
-
-template<class T>
-struct is_std_allocator< std::allocator<T> >
-{  static const bool value = true; };
-
-template<class T, class Options>
-struct is_std_allocator< small_vector_allocator<T, std::allocator<T>, Options > >
-{  static const bool value = true; };
-
-template<class Allocator>
-struct is_not_std_allocator
-{  static const bool value = !is_std_allocator<Allocator>::value; };
-
-BOOST_INTRUSIVE_INSTANTIATE_DEFAULT_TYPE_TMPLT(pointer)
-BOOST_INTRUSIVE_INSTANTIATE_EVAL_DEFAULT_TYPE_TMPLT(const_pointer)
-BOOST_INTRUSIVE_INSTANTIATE_DEFAULT_TYPE_TMPLT(reference)
-BOOST_INTRUSIVE_INSTANTIATE_DEFAULT_TYPE_TMPLT(const_reference)
-BOOST_INTRUSIVE_INSTANTIATE_EVAL_DEFAULT_TYPE_TMPLT(void_pointer)
-BOOST_INTRUSIVE_INSTANTIATE_EVAL_DEFAULT_TYPE_TMPLT(const_void_pointer)
-BOOST_INTRUSIVE_INSTANTIATE_DEFAULT_TYPE_TMPLT(size_type)
-BOOST_INTRUSIVE_INSTANTIATE_DEFAULT_TYPE_TMPLT(propagate_on_container_copy_assignment)
-BOOST_INTRUSIVE_INSTANTIATE_DEFAULT_TYPE_TMPLT(propagate_on_container_move_assignment)
-BOOST_INTRUSIVE_INSTANTIATE_DEFAULT_TYPE_TMPLT(propagate_on_container_swap)
-BOOST_INTRUSIVE_INSTANTIATE_DEFAULT_TYPE_TMPLT(is_always_equal)
-BOOST_INTRUSIVE_INSTANTIATE_DEFAULT_TYPE_TMPLT(difference_type)
-BOOST_INTRUSIVE_INSTANTIATE_DEFAULT_TYPE_TMPLT(is_partially_propagable)
-
-}  //namespace dtl {
-
-#endif   //#ifndef BOOST_CONTAINER_DOXYGEN_INVOKED
-
-//! The class template allocator_traits supplies a uniform interface to all allocator types.
-//! This class is a C++03-compatible implementation of std::allocator_traits
-template <typename Allocator>
-struct allocator_traits
-{
-   //allocator_type
-   typedef Allocator allocator_type;
-   //value_type
-   typedef typename allocator_type::value_type value_type;
-
-   #if defined(BOOST_CONTAINER_DOXYGEN_INVOKED)
-      //! Allocator::pointer if such a type exists; otherwise, value_type*
-      //!
-      typedef unspecified pointer;
-      //! Allocator::const_pointer if such a type exists ; otherwise, pointer_traits<pointer>::rebind<const
-      //!
-      typedef see_documentation const_pointer;
-      //! Non-standard extension
-      //! Allocator::reference if such a type exists; otherwise, value_type&
-      typedef see_documentation reference;
-      //! Non-standard extension
-      //! Allocator::const_reference if such a type exists ; otherwise, const value_type&
-      typedef see_documentation const_reference;
-      //! Allocator::void_pointer if such a type exists ; otherwise, pointer_traits<pointer>::rebind<void>.
-      //!
-      typedef see_documentation void_pointer;
-      //! Allocator::const_void_pointer if such a type exists ; otherwise, pointer_traits<pointer>::rebind<const
-      //!
-      typedef see_documentation const_void_pointer;
-      //! Allocator::difference_type if such a type exists ; otherwise, pointer_traits<pointer>::difference_type.
-      //!
-      typedef see_documentation difference_type;
-      //! Allocator::size_type if such a type exists ; otherwise, make_unsigned<difference_type>::type
-      //!
-      typedef see_documentation size_type;
-      //! Allocator::propagate_on_container_copy_assignment if such a type exists, otherwise a type
-      //! with an internal constant static boolean member <code>value</code> == false.
-      typedef see_documentation propagate_on_container_copy_assignment;
-      //! Allocator::propagate_on_container_move_assignment if such a type exists, otherwise a type
-      //! with an internal constant static boolean member <code>value</code> == false.
-      typedef see_documentation propagate_on_container_move_assignment;
-      //! Allocator::propagate_on_container_swap if such a type exists, otherwise a type
-      //! with an internal constant static boolean member <code>value</code> == false.
-      typedef see_documentation propagate_on_container_swap;
-      //! Allocator::is_always_equal if such a type exists, otherwise a type
-      //! with an internal constant static boolean member <code>value</code> == is_empty<Allocator>::value
-      typedef see_documentation is_always_equal;
-      //! Allocator::is_partially_propagable if such a type exists, otherwise a type
-      //! with an internal constant static boolean member <code>value</code> == false
-      //! <b>Note</b>: Non-standard extension used to implement `small_vector_allocator`.
-      typedef see_documentation is_partially_propagable;
-      //! Defines an allocator: Allocator::rebind<T>::other if such a type exists; otherwise, Allocator<T, Args>
-      //! if Allocator is a class template instantiation of the form Allocator<U, Args>, where Args is zero or
-      //! more type arguments ; otherwise, the instantiation of rebind_alloc is ill-formed.
-      //!
-      //! In C++03 compilers <code>rebind_alloc</code> is a struct derived from an allocator
-      //! deduced by previously detailed rules.
-      template <class T> using rebind_alloc = see_documentation;
-
-      //! In C++03 compilers <code>rebind_traits</code> is a struct derived from
-      //! <code>allocator_traits<OtherAlloc></code>, where <code>OtherAlloc</code> is
-      //! the allocator deduced by rules explained in <code>rebind_alloc</code>.
-      template <class T> using rebind_traits = allocator_traits<rebind_alloc<T> >;
-
-      //! Non-standard extension: Portable allocator rebind for C++03 and C++11 compilers.
-      //! <code>type</code> is an allocator related to Allocator deduced deduced by rules explained in <code>rebind_alloc</code>.
-      template <class T>
-      struct portable_rebind_alloc
-      {  typedef see_documentation type;  };
-   #else
-      //pointer
-      typedef BOOST_INTRUSIVE_OBTAIN_TYPE_WITH_DEFAULT(boost::container::dtl::, Allocator,
-         pointer, value_type*)
-            pointer;
-      //const_pointer
-      typedef BOOST_INTRUSIVE_OBTAIN_TYPE_WITH_EVAL_DEFAULT(boost::container::dtl::, Allocator,
-         const_pointer, typename boost::intrusive::pointer_traits<pointer>::template
-            rebind_pointer<const value_type>)
-               const_pointer;
-      //reference
-      typedef BOOST_INTRUSIVE_OBTAIN_TYPE_WITH_DEFAULT(boost::container::dtl::, Allocator,
-         reference, typename dtl::unvoid_ref<value_type>::type)
-            reference;
-      //const_reference
-      typedef BOOST_INTRUSIVE_OBTAIN_TYPE_WITH_DEFAULT(boost::container::dtl::, Allocator,
-         const_reference, typename dtl::unvoid_ref<const value_type>::type)
-               const_reference;
-      //void_pointer
-      typedef BOOST_INTRUSIVE_OBTAIN_TYPE_WITH_EVAL_DEFAULT(boost::container::dtl::, Allocator,
-         void_pointer, typename boost::intrusive::pointer_traits<pointer>::template
-            rebind_pointer<void>)
-               void_pointer;
-      //const_void_pointer
-      typedef BOOST_INTRUSIVE_OBTAIN_TYPE_WITH_EVAL_DEFAULT(boost::container::dtl::, Allocator,
-         const_void_pointer, typename boost::intrusive::pointer_traits<pointer>::template
-            rebind_pointer<const void>)
-               const_void_pointer;
-      //difference_type
-      typedef BOOST_INTRUSIVE_OBTAIN_TYPE_WITH_DEFAULT(boost::container::dtl::, Allocator,
-         difference_type, std::ptrdiff_t)
-            difference_type;
-      //size_type
-      typedef BOOST_INTRUSIVE_OBTAIN_TYPE_WITH_DEFAULT(boost::container::dtl::, Allocator,
-         size_type, std::size_t)
-            size_type;
-      //propagate_on_container_copy_assignment
-      typedef BOOST_INTRUSIVE_OBTAIN_TYPE_WITH_DEFAULT(boost::container::dtl::, Allocator,
-         propagate_on_container_copy_assignment, dtl::false_type)
-            propagate_on_container_copy_assignment;
-      //propagate_on_container_move_assignment
-      typedef BOOST_INTRUSIVE_OBTAIN_TYPE_WITH_DEFAULT(boost::container::dtl::, Allocator,
-         propagate_on_container_move_assignment, dtl::false_type)
-            propagate_on_container_move_assignment;
-      //propagate_on_container_swap
-      typedef BOOST_INTRUSIVE_OBTAIN_TYPE_WITH_DEFAULT(boost::container::dtl::, Allocator,
-         propagate_on_container_swap, dtl::false_type)
-            propagate_on_container_swap;
-      //is_always_equal
-      typedef BOOST_INTRUSIVE_OBTAIN_TYPE_WITH_DEFAULT(boost::container::dtl::, Allocator,
-         is_always_equal, dtl::is_empty<Allocator>)
-            is_always_equal;
-      //is_partially_propagable
-      typedef BOOST_INTRUSIVE_OBTAIN_TYPE_WITH_DEFAULT(boost::container::dtl::, Allocator,
-         is_partially_propagable, dtl::false_type)
-            is_partially_propagable;
-
-      //rebind_alloc & rebind_traits
-      #if !defined(BOOST_NO_CXX11_TEMPLATE_ALIASES)
-         //C++11
-         template <typename T> using rebind_alloc  = typename boost::intrusive::pointer_rebind<Allocator, T>::type;
-         template <typename T> using rebind_traits = allocator_traits< rebind_alloc<T> >;
-      #else    // #if !defined(BOOST_NO_CXX11_TEMPLATE_ALIASES)
-         //Some workaround for C++03 or C++11 compilers with no template aliases
-         template <typename T>
-         struct rebind_alloc : boost::intrusive::pointer_rebind<Allocator,T>::type
-         {
-            typedef typename boost::intrusive::pointer_rebind<Allocator,T>::type Base;
-            #if !defined(BOOST_NO_CXX11_VARIADIC_TEMPLATES)
-               template <typename... Args>
-               rebind_alloc(BOOST_FWD_REF(Args)... args) : Base(boost::forward<Args>(args)...) {}
-            #else    // #if !defined(BOOST_NO_CXX11_VARIADIC_TEMPLATES)
-               #define BOOST_CONTAINER_ALLOCATOR_TRAITS_REBIND_ALLOC(N) \
-               BOOST_MOVE_TMPL_LT##N BOOST_MOVE_CLASS##N BOOST_MOVE_GT##N\
-               explicit rebind_alloc(BOOST_MOVE_UREF##N) : Base(BOOST_MOVE_FWD##N){}\
-               //
-               BOOST_MOVE_ITERATE_0TO9(BOOST_CONTAINER_ALLOCATOR_TRAITS_REBIND_ALLOC)
-               #undef BOOST_CONTAINER_ALLOCATOR_TRAITS_REBIND_ALLOC
-            #endif   // #if !defined(BOOST_NO_CXX11_VARIADIC_TEMPLATES)
-         };
-
-         template <typename T>
-         struct rebind_traits
-            : allocator_traits<typename boost::intrusive::pointer_rebind<Allocator, T>::type>
-         {};
-      #endif   // #if !defined(BOOST_NO_CXX11_TEMPLATE_ALIASES)
-
-      //portable_rebind_alloc
-      template <class T>
-      struct portable_rebind_alloc
-      {  typedef typename boost::intrusive::pointer_rebind<Allocator, T>::type type;  };
-   #endif   //BOOST_CONTAINER_DOXYGEN_INVOKED
-
-   //! <b>Returns</b>: <code>a.allocate(n)</code>
-   //!
-   BOOST_CONTAINER_FORCEINLINE static pointer allocate(Allocator &a, size_type n)
-   {  return a.allocate(n);  }
-
-   //! <b>Returns</b>: <code>a.deallocate(p, n)</code>
-   //!
-   //! <b>Throws</b>: Nothing
-   BOOST_CONTAINER_FORCEINLINE static void deallocate(Allocator &a, pointer p, size_type n)
-   {  a.deallocate(p, n);  }
-
-   //! <b>Effects</b>: calls <code>a.allocate(n, p)</code> if that call is well-formed;
-   //! otherwise, invokes <code>a.allocate(n)</code>
-   BOOST_CONTAINER_FORCEINLINE static pointer allocate(Allocator &a, size_type n, const_void_pointer p)
-   {
-      const bool value = boost::container::dtl::
-         has_member_function_callable_with_allocate
-            <Allocator, const size_type, const const_void_pointer>::value;
-      dtl::bool_<value> flag;
-      return allocator_traits::priv_allocate(flag, a, n, p);
-   }
-
-   //! <b>Effects</b>: calls <code>a.destroy(p)</code> if that call is well-formed;
-   //! otherwise, invokes <code>p->~T()</code>.
-   template<class T>
-   BOOST_CONTAINER_FORCEINLINE static void destroy(Allocator &a, T*p) BOOST_NOEXCEPT_OR_NOTHROW
-   {
-      typedef T* destroy_pointer;
-      const bool value = boost::container::dtl::
-         has_member_function_callable_with_destroy
-            <Allocator, const destroy_pointer>::value;
-      dtl::bool_<value> flag;
-      allocator_traits::priv_destroy(flag, a, p);
-   }
-
-   //! <b>Returns</b>: <code>a.max_size()</code> if that expression is well-formed; otherwise,
-   //! <code>numeric_limits<size_type>::max()</code>.
-   BOOST_CONTAINER_FORCEINLINE static size_type max_size(const Allocator &a) BOOST_NOEXCEPT_OR_NOTHROW
-   {
-      const bool value = allocator_traits_detail::has_max_size<Allocator, size_type (Allocator::*)() const>::value;
-      dtl::bool_<value> flag;
-      return allocator_traits::priv_max_size(flag, a);
-   }
-
-   //! <b>Returns</b>: <code>a.select_on_container_copy_construction()</code> if that expression is well-formed;
-   //! otherwise, a.
-   BOOST_CONTAINER_FORCEINLINE static BOOST_CONTAINER_DOC1ST(Allocator,
-      typename dtl::if_c
-         < allocator_traits_detail::has_select_on_container_copy_construction<Allocator BOOST_MOVE_I Allocator (Allocator::*)() const>::value
-         BOOST_MOVE_I Allocator BOOST_MOVE_I const Allocator & >::type)
-   select_on_container_copy_construction(const Allocator &a)
-   {
-      const bool value = allocator_traits_detail::has_select_on_container_copy_construction
-         <Allocator, Allocator (Allocator::*)() const>::value;
-      dtl::bool_<value> flag;
-      return allocator_traits::priv_select_on_container_copy_construction(flag, a);
-   }
-
-   #if !defined(BOOST_NO_CXX11_VARIADIC_TEMPLATES) || defined(BOOST_CONTAINER_DOXYGEN_INVOKED)
-      //! <b>Effects</b>: calls <code>a.construct(p, std::forward<Args>(args)...)</code> if that call is well-formed;
-      //! otherwise, invokes <code>`placement new` (static_cast<void*>(p)) T(std::forward<Args>(args)...)</code>
-      template <class T, class ...Args>
-      BOOST_CONTAINER_FORCEINLINE static void construct(Allocator & a, T* p, BOOST_FWD_REF(Args)... args)
-      {
-         static const bool value = ::boost::move_detail::and_
-            < dtl::is_not_std_allocator<Allocator>
-            , boost::container::dtl::has_member_function_callable_with_construct
-                  < Allocator, T*, Args... >
-            >::value;
-         dtl::bool_<value> flag;
-         allocator_traits::priv_construct(flag, a, p, ::boost::forward<Args>(args)...);
-      }
-   #endif
-
-   //! <b>Returns</b>: <code>a.storage_is_unpropagable(p)</code> if is_partially_propagable::value is true; otherwise,
-   //! <code>false</code>.
-   BOOST_CONTAINER_FORCEINLINE static bool storage_is_unpropagable(const Allocator &a, pointer p) BOOST_NOEXCEPT_OR_NOTHROW
-   {
-      dtl::bool_<is_partially_propagable::value> flag;
-      return allocator_traits::priv_storage_is_unpropagable(flag, a, p);
-   }
-
-   //! <b>Returns</b>: <code>true</code> if <code>is_always_equal::value == true</code>, otherwise,
-   //! <code>a == b</code>.
-   BOOST_CONTAINER_FORCEINLINE static bool equal(const Allocator &a, const Allocator &b) BOOST_NOEXCEPT_OR_NOTHROW
-   {
-      dtl::bool_<is_always_equal::value> flag;
-      return allocator_traits::priv_equal(flag, a, b);
-   }
-
-   #if !defined(BOOST_CONTAINER_DOXYGEN_INVOKED)
-   private:
-   BOOST_CONTAINER_FORCEINLINE static pointer priv_allocate(dtl::true_type, Allocator &a, size_type n, const_void_pointer p)
-   {  return a.allocate(n, p);  }
-
-   BOOST_CONTAINER_FORCEINLINE static pointer priv_allocate(dtl::false_type, Allocator &a, size_type n, const_void_pointer)
-   {  return a.allocate(n);  }
-
-   template<class T>
-   BOOST_CONTAINER_FORCEINLINE static void priv_destroy(dtl::true_type, Allocator &a, T* p) BOOST_NOEXCEPT_OR_NOTHROW
-   {  a.destroy(p);  }
-
-   template<class T>
-   BOOST_CONTAINER_FORCEINLINE static void priv_destroy(dtl::false_type, Allocator &, T* p) BOOST_NOEXCEPT_OR_NOTHROW
-   {  p->~T(); (void)p;  }
-
-   BOOST_CONTAINER_FORCEINLINE static size_type priv_max_size(dtl::true_type, const Allocator &a) BOOST_NOEXCEPT_OR_NOTHROW
-   {  return a.max_size();  }
-
-   BOOST_CONTAINER_FORCEINLINE static size_type priv_max_size(dtl::false_type, const Allocator &) BOOST_NOEXCEPT_OR_NOTHROW
-   {  return size_type(-1)/sizeof(value_type);  }
-
-   BOOST_CONTAINER_FORCEINLINE static Allocator priv_select_on_container_copy_construction(dtl::true_type, const Allocator &a)
-   {  return a.select_on_container_copy_construction();  }
-
-   BOOST_CONTAINER_FORCEINLINE static const Allocator &priv_select_on_container_copy_construction(dtl::false_type, const Allocator &a) BOOST_NOEXCEPT_OR_NOTHROW
-   {  return a;  }
-
-   #if !defined(BOOST_NO_CXX11_VARIADIC_TEMPLATES)
-      template<class T, class ...Args>
-      BOOST_CONTAINER_FORCEINLINE static void priv_construct(dtl::true_type, Allocator &a, T *p, BOOST_FWD_REF(Args) ...args)
-      {  a.construct( p, ::boost::forward<Args>(args)...);  }
-
-      template<class T, class ...Args>
-      BOOST_CONTAINER_FORCEINLINE static void priv_construct(dtl::false_type, Allocator &, T *p, BOOST_FWD_REF(Args) ...args)
-      {  ::new((void*)p, boost_container_new_t()) T(::boost::forward<Args>(args)...); }
-   #else // #if !defined(BOOST_NO_CXX11_VARIADIC_TEMPLATES)
-      public:
-
-      #define BOOST_CONTAINER_ALLOCATOR_TRAITS_CONSTRUCT_IMPL(N) \
-      template<class T BOOST_MOVE_I##N BOOST_MOVE_CLASS##N >\
-      BOOST_CONTAINER_FORCEINLINE static void construct(Allocator &a, T *p BOOST_MOVE_I##N BOOST_MOVE_UREF##N)\
-      {\
-         static const bool value = ::boost::move_detail::and_ \
-            < dtl::is_not_std_allocator<Allocator> \
-            , boost::container::dtl::has_member_function_callable_with_construct \
-                  < Allocator, T* BOOST_MOVE_I##N BOOST_MOVE_FWD_T##N > \
-            >::value; \
-         dtl::bool_<value> flag;\
-         (priv_construct)(flag, a, p BOOST_MOVE_I##N BOOST_MOVE_FWD##N);\
-      }\
-      //
-      BOOST_MOVE_ITERATE_0TO8(BOOST_CONTAINER_ALLOCATOR_TRAITS_CONSTRUCT_IMPL)
-      #undef BOOST_CONTAINER_ALLOCATOR_TRAITS_CONSTRUCT_IMPL
-
-      private:
-      /////////////////////////////////
-      // priv_construct
-      /////////////////////////////////
-      #define BOOST_CONTAINER_ALLOCATOR_TRAITS_PRIV_CONSTRUCT_IMPL(N) \
-      template<class T BOOST_MOVE_I##N BOOST_MOVE_CLASS##N >\
-      BOOST_CONTAINER_FORCEINLINE static void priv_construct(dtl::true_type, Allocator &a, T *p BOOST_MOVE_I##N BOOST_MOVE_UREF##N)\
-      {  a.construct( p BOOST_MOVE_I##N BOOST_MOVE_FWD##N );  }\
-      \
-      template<class T BOOST_MOVE_I##N BOOST_MOVE_CLASS##N >\
-      BOOST_CONTAINER_FORCEINLINE static void priv_construct(dtl::false_type, Allocator &, T *p BOOST_MOVE_I##N BOOST_MOVE_UREF##N)\
-      {  ::new((void*)p, boost_container_new_t()) T(BOOST_MOVE_FWD##N); }\
-      //
-      BOOST_MOVE_ITERATE_0TO8(BOOST_CONTAINER_ALLOCATOR_TRAITS_PRIV_CONSTRUCT_IMPL)
-      #undef BOOST_CONTAINER_ALLOCATOR_TRAITS_PRIV_CONSTRUCT_IMPL
-
-   #endif   // #if !defined(BOOST_NO_CXX11_VARIADIC_TEMPLATES)
-
-   template<class T>
-   BOOST_CONTAINER_FORCEINLINE static void priv_construct(dtl::false_type, Allocator &, T *p, const ::boost::container::default_init_t&)
-   {  ::new((void*)p, boost_container_new_t()) T; }
-
-   BOOST_CONTAINER_FORCEINLINE static bool priv_storage_is_unpropagable(dtl::true_type, const Allocator &a, pointer p)
-   {  return a.storage_is_unpropagable(p);  }
-
-   BOOST_CONTAINER_FORCEINLINE static bool priv_storage_is_unpropagable(dtl::false_type, const Allocator &, pointer)
-   {  return false;  }
-
-   BOOST_CONTAINER_FORCEINLINE static bool priv_equal(dtl::true_type,  const Allocator &, const Allocator &)
-   {  return true;  }
-
-   BOOST_CONTAINER_FORCEINLINE static bool priv_equal(dtl::false_type, const Allocator &a, const Allocator &b)
-   {  return a == b;  }
-
-   #endif   //#if defined(BOOST_CONTAINER_DOXYGEN_INVOKED)
-};
-
-#if !defined(BOOST_CONTAINER_DOXYGEN_INVOKED)
-
-template<class T, class AllocatorOrVoid>
-struct real_allocator
-{
-   typedef AllocatorOrVoid type;
-};
-
-template<class T>
-struct real_allocator<T, void>
-{
-   typedef new_allocator<T> type;
-};
-
-#endif   //#if defined(BOOST_CONTAINER_DOXYGEN_INVOKED)
-
-}  //namespace container {
-}  //namespace boost {
-
-#include <boost/container/detail/config_end.hpp>
-
-#endif // ! defined(BOOST_CONTAINER_ALLOCATOR_ALLOCATOR_TRAITS_HPP)
diff --git a/src/boost/container/container_fwd.hpp b/src/boost/container/container_fwd.hpp
deleted file mode 100644
index 9e82fdef..00000000
--- a/src/boost/container/container_fwd.hpp
+++ /dev/null
@@ -1,388 +0,0 @@
-//////////////////////////////////////////////////////////////////////////////
-//
-// (C) Copyright Ion Gaztanaga 2005-2014. Distributed under the Boost
-// 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.
-//
-//////////////////////////////////////////////////////////////////////////////
-
-#ifndef BOOST_CONTAINER_CONTAINER_FWD_HPP
-#define BOOST_CONTAINER_CONTAINER_FWD_HPP
-
-#ifndef BOOST_CONFIG_HPP
-#  include <boost/config.hpp>
-#endif
-
-#if defined(BOOST_HAS_PRAGMA_ONCE)
-#  pragma once
-#endif
-
-//! \file
-//! This header file forward declares the following containers:
-//!   - boost::container::vector
-//!   - boost::container::stable_vector
-//!   - boost::container::static_vector
-//!   - boost::container::small_vector_base
-//!   - boost::container::small_vector
-//!   - boost::container::devector
-//!   - boost::container::slist
-//!   - boost::container::list
-//!   - boost::container::set
-//!   - boost::container::multiset
-//!   - boost::container::map
-//!   - boost::container::multimap
-//!   - boost::container::flat_set
-//!   - boost::container::flat_multiset
-//!   - boost::container::flat_map
-//!   - boost::container::flat_multimap
-//!   - boost::container::basic_string
-//!   - boost::container::string
-//!   - boost::container::wstring
-//!
-//! Forward declares the following allocators:
-//!   - boost::container::allocator
-//!   - boost::container::node_allocator
-//!   - boost::container::adaptive_pool
-//!
-//! Forward declares the following polymorphic resource classes:
-//!   - boost::container::pmr::memory_resource
-//!   - boost::container::pmr::polymorphic_allocator
-//!   - boost::container::pmr::monotonic_buffer_resource
-//!   - boost::container::pmr::pool_options
-//!   - boost::container::pmr::unsynchronized_pool_resource
-//!   - boost::container::pmr::synchronized_pool_resource
-//!
-//! And finally it defines the following types
-
-#ifndef BOOST_CONTAINER_DOXYGEN_INVOKED
-
-//Std forward declarations
-#ifndef BOOST_CONTAINER_DETAIL_STD_FWD_HPP
-   #include <boost/container/detail/std_fwd.hpp>
-#endif
-
-namespace boost{
-namespace intrusive{
-namespace detail{
-   //Create namespace to avoid compilation errors
-}}}
-
-namespace boost{ namespace container{ namespace dtl{
-   namespace bi = boost::intrusive;
-   namespace bid = boost::intrusive::detail;
-}}}
-
-namespace boost{ namespace container{ namespace pmr{
-   namespace bi = boost::intrusive;
-   namespace bid = boost::intrusive::detail;
-}}}
-
-#include <cstddef>
-
-#endif   //#ifndef BOOST_CONTAINER_DOXYGEN_INVOKED
-
-//////////////////////////////////////////////////////////////////////////////
-//                             Containers
-//////////////////////////////////////////////////////////////////////////////
-
-namespace boost {
-namespace container {
-
-#ifndef BOOST_CONTAINER_DOXYGEN_INVOKED
-
-template<class T>
-class new_allocator;
-
-template <class T
-         ,class Allocator = void
-         ,class Options   = void>
-class vector;
-
-template <class T
-         ,class Allocator = void >
-class stable_vector;
-
-template < class T
-         , std::size_t Capacity
-         , class Options = void>
-class static_vector;
-
-template < class T
-         , class Allocator = void
-         , class Options   = void >
-class small_vector_base;
-
-template < class T
-         , std::size_t N
-         , class Allocator = void
-         , class Options   = void  >
-class small_vector;
-
-template <class T
-         ,class Allocator = void
-         ,class Options   = void>
-class devector;
-
-template <class T
-         ,class Allocator = void
-         ,class Options   = void>
-class deque;
-
-template <class T
-         ,class Allocator = void >
-class list;
-
-template <class T
-         ,class Allocator = void >
-class slist;
-
-template <class Key
-         ,class Compare  = std::less<Key>
-         ,class Allocator = void
-         ,class Options = void>
-class set;
-
-template <class Key
-         ,class Compare  = std::less<Key>
-         ,class Allocator = void
-         ,class Options = void >
-class multiset;
-
-template <class Key
-         ,class T
-         ,class Compare  = std::less<Key>
-         ,class Allocator = void
-         ,class Options = void >
-class map;
-
-template <class Key
-         ,class T
-         ,class Compare  = std::less<Key>
-         ,class Allocator = void
-         ,class Options = void >
-class multimap;
-
-template <class Key
-         ,class Compare  = std::less<Key>
-         ,class Allocator = void >
-class flat_set;
-
-template <class Key
-         ,class Compare  = std::less<Key>
-         ,class Allocator = void >
-class flat_multiset;
-
-template <class Key
-         ,class T
-         ,class Compare  = std::less<Key>
-         ,class Allocator = void >
-class flat_map;
-
-template <class Key
-         ,class T
-         ,class Compare  = std::less<Key>
-         ,class Allocator = void >
-class flat_multimap;
-
-#ifndef BOOST_NO_CXX11_TEMPLATE_ALIASES
-
-//! Alias templates for small_flat_[multi]{set|map} using small_vector as container
-
-template < class Key
-         , std::size_t N
-         , class Compare  = std::less<Key>
-         , class SmallVectorAllocator = void
-         , class SmallVectorOptions   = void  >
-using small_flat_set = flat_set<Key, Compare, small_vector<Key, N, SmallVectorAllocator, SmallVectorOptions>>;
-
-template < class Key
-         , std::size_t N
-         , class Compare  = std::less<Key>
-         , class SmallVectorAllocator = void
-         , class SmallVectorOptions   = void  >
-using small_flat_multiset = flat_multiset<Key, Compare, small_vector<Key, N, SmallVectorAllocator, SmallVectorOptions>>;
-
-template < class Key
-         , class T
-         , std::size_t N
-         , class Compare  = std::less<Key>
-         , class SmallVectorAllocator = void
-         , class SmallVectorOptions   = void  >
-using small_flat_map = flat_map<Key, T, Compare, small_vector<std::pair<Key, T>, N, SmallVectorAllocator, SmallVectorOptions>>;
-
-template < class Key
-         , class T
-         , std::size_t N
-         , class Compare  = std::less<Key>
-         , class SmallVectorAllocator = void
-         , class SmallVectorOptions   = void  >
-using small_flat_multimap = flat_multimap<Key, T, Compare, small_vector<std::pair<Key, T>, N, SmallVectorAllocator, SmallVectorOptions>>;
-
-#endif // #ifndef BOOST_NO_CXX11_TEMPLATE_ALIASES
-
-
-//! A portable metafunction to obtain a small_flat_set
-template < class Key
-         , std::size_t N
-         , class Compare  = std::less<Key>
-         , class SmallVectorAllocator = void
-         , class SmallVectorOptions   = void  >
-struct small_flat_set_of
-{
-   typedef flat_set<Key, Compare, small_vector<Key, N, SmallVectorAllocator, SmallVectorOptions> > type;
-};
-
-//! A portable metafunction to obtain a small_flat_multiset
-template < class Key
-         , std::size_t N
-         , class Compare  = std::less<Key>
-         , class SmallVectorAllocator = void
-         , class SmallVectorOptions   = void  >
-struct small_flat_multiset_of
-{
-   typedef flat_multiset<Key, Compare, small_vector<Key, N, SmallVectorAllocator, SmallVectorOptions> > type;
-};
-
-//! A portable metafunction to obtain a small_flat_map
-template < class Key
-         , class T
-         , std::size_t N
-         , class Compare  = std::less<Key>
-         , class SmallVectorAllocator = void
-         , class SmallVectorOptions   = void  >
-struct small_flat_map_of
-{
-   typedef flat_map<Key, T, Compare, small_vector<std::pair<Key, T>, N, SmallVectorAllocator, SmallVectorOptions> > type;
-};
-
-//! A portable metafunction to obtain a small_flat_multimap
-template < class Key
-         , class T
-         , std::size_t N
-         , class Compare  = std::less<Key>
-         , class SmallVectorAllocator = void
-         , class SmallVectorOptions   = void  >
-struct small_flat_multimap_of
-{
-   typedef flat_multimap<Key, T, Compare, small_vector<std::pair<Key, T>, N, SmallVectorAllocator, SmallVectorOptions> > type;
-};
-
-template <class CharT
-         ,class Traits = std::char_traits<CharT>
-         ,class Allocator  = void >
-class basic_string;
-
-typedef basic_string <char>   string;
-typedef basic_string<wchar_t> wstring;
-
-static const std::size_t ADP_nodes_per_block    = 256u;
-static const std::size_t ADP_max_free_blocks    = 2u;
-static const std::size_t ADP_overhead_percent   = 1u;
-static const std::size_t ADP_only_alignment     = 0u;
-
-template < class T
-         , std::size_t NodesPerBlock   = ADP_nodes_per_block
-         , std::size_t MaxFreeBlocks   = ADP_max_free_blocks
-         , std::size_t OverheadPercent = ADP_overhead_percent
-         , unsigned Version = 2
-         >
-class adaptive_pool;
-
-template < class T
-         , unsigned Version = 2
-         , unsigned int AllocationDisableMask = 0>
-class allocator;
-
-static const std::size_t NodeAlloc_nodes_per_block = 256u;
-
-template
-   < class T
-   , std::size_t NodesPerBlock = NodeAlloc_nodes_per_block
-   , std::size_t Version = 2>
-class node_allocator;
-
-namespace pmr {
-
-class memory_resource;
-
-template<class T>
-class polymorphic_allocator;
-
-class monotonic_buffer_resource;
-
-struct pool_options;
-
-template <class Allocator>
-class resource_adaptor_imp;
-
-class unsynchronized_pool_resource;
-
-class synchronized_pool_resource;
-
-}  //namespace pmr {
-
-#endif   //#ifndef BOOST_CONTAINER_DOXYGEN_INVOKED
-
-//! Type used to tag that the input range is
-//! guaranteed to be ordered
-struct ordered_range_t
-{};
-
-//! Value used to tag that the input range is
-//! guaranteed to be ordered
-static const ordered_range_t ordered_range = ordered_range_t();
-
-//! Type used to tag that the input range is
-//! guaranteed to be ordered and unique
-struct ordered_unique_range_t
-   : public ordered_range_t
-{};
-
-//! Value used to tag that the input range is
-//! guaranteed to be ordered and unique
-static const ordered_unique_range_t ordered_unique_range = ordered_unique_range_t();
-
-//! Type used to tag that the inserted values
-//! should be default initialized
-struct default_init_t
-{};
-
-//! Value used to tag that the inserted values
-//! should be default initialized
-static const default_init_t default_init = default_init_t();
-#ifndef BOOST_CONTAINER_DOXYGEN_INVOKED
-
-//! Type used to tag that the inserted values
-//! should be value initialized
-struct value_init_t
-{};
-
-//! Value used to tag that the inserted values
-//! should be value initialized
-static const value_init_t value_init = value_init_t();
-
-namespace container_detail_really_deep_namespace {
-
-//Otherwise, gcc issues a warning of previously defined
-//anonymous_instance and unique_instance
-struct dummy
-{
-   dummy()
-   {
-      (void)ordered_range;
-      (void)ordered_unique_range;
-      (void)default_init;
-   }
-};
-
-}  //detail_really_deep_namespace {
-
-typedef const std::piecewise_construct_t & piecewise_construct_t;
-
-#endif   //#ifndef BOOST_CONTAINER_DOXYGEN_INVOKED
-
-}}  //namespace boost { namespace container {
-
-#endif //#ifndef BOOST_CONTAINER_CONTAINER_FWD_HPP
diff --git a/src/boost/container/detail/addressof.hpp b/src/boost/container/detail/addressof.hpp
deleted file mode 100644
index 00679b8f..00000000
--- a/src/boost/container/detail/addressof.hpp
+++ /dev/null
@@ -1,33 +0,0 @@
-//////////////////////////////////////////////////////////////////////////////
-//
-// (C) Copyright Ion Gaztanaga 2014-2015. Distributed under the Boost
-// 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.
-//
-//////////////////////////////////////////////////////////////////////////////
-#ifndef BOOST_CONTAINER_DETAIL_ADDRESSOF_HPP
-#define BOOST_CONTAINER_DETAIL_ADDRESSOF_HPP
-
-#ifndef BOOST_CONFIG_HPP
-#  include <boost/config.hpp>
-#endif
-
-#if defined(BOOST_HAS_PRAGMA_ONCE)
-#  pragma once
-#endif
-
-#include <boost/move/detail/addressof.hpp>
-
-namespace boost {
-namespace container {
-namespace dtl {
-
-using boost::move_detail::addressof;
-
-}  //namespace dtl {
-}  //namespace container {
-}  //namespace boost {
-
-#endif   //#ifndef BOOST_CONTAINER_DETAIL_ADDRESSOF_HPP
diff --git a/src/boost/container/detail/advanced_insert_int.hpp b/src/boost/container/detail/advanced_insert_int.hpp
deleted file mode 100644
index 0238805d..00000000
--- a/src/boost/container/detail/advanced_insert_int.hpp
+++ /dev/null
@@ -1,542 +0,0 @@
-//////////////////////////////////////////////////////////////////////////////
-//
-// (C) Copyright Ion Gaztanaga 2008-2013. Distributed under the Boost
-// 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.
-//
-//////////////////////////////////////////////////////////////////////////////
-
-#ifndef BOOST_CONTAINER_ADVANCED_INSERT_INT_HPP
-#define BOOST_CONTAINER_ADVANCED_INSERT_INT_HPP
-
-#ifndef BOOST_CONFIG_HPP
-#  include <boost/config.hpp>
-#endif
-
-#if defined(BOOST_HAS_PRAGMA_ONCE)
-#  pragma once
-#endif
-
-#include <boost/container/detail/config_begin.hpp>
-#include <boost/container/detail/workaround.hpp>
-
-// container
-#include <boost/container/allocator_traits.hpp>
-// container/detail
-#include <boost/container/detail/copy_move_algo.hpp>
-#include <boost/container/detail/destroyers.hpp>
-#include <boost/container/detail/mpl.hpp>
-#include <boost/container/detail/type_traits.hpp>
-#include <boost/container/detail/iterator.hpp>
-#include <boost/container/detail/iterators.hpp>
-#include <boost/move/detail/iterator_to_raw_pointer.hpp>
-#if defined(BOOST_NO_CXX11_VARIADIC_TEMPLATES)
-#include <boost/move/detail/fwd_macros.hpp>
-#endif
-// move
-
-#include <boost/move/utility_core.hpp>
-#include <boost/move/detail/force_ptr.hpp>
-// other
-#include <boost/assert.hpp>
-
-namespace boost { namespace container { namespace dtl {
-
-template<class Allocator, class FwdIt>
-struct move_insert_range_proxy
-{
-   typedef typename allocator_traits<Allocator>::value_type value_type;
-
-   BOOST_CONTAINER_FORCEINLINE explicit move_insert_range_proxy(FwdIt first)
-      :  first_(first)
-   {}
-
-   template<class Iterator>
-   BOOST_CONTAINER_FORCEINLINE void uninitialized_copy_n_and_update(Allocator &a, Iterator p, std::size_t n)
-   {
-      this->first_ = ::boost::container::uninitialized_move_alloc_n_source
-         (a, this->first_, n, p);
-   }
-
-   template<class Iterator>
-   BOOST_CONTAINER_FORCEINLINE void copy_n_and_update(Allocator &, Iterator p, std::size_t n)
-   {
-      this->first_ = ::boost::container::move_n_source(this->first_, n, p);
-   }
-
-   FwdIt first_;
-};
-
-
-template<class Allocator, class FwdIt>
-struct insert_range_proxy
-{
-   typedef typename allocator_traits<Allocator>::value_type value_type;
-
-   BOOST_CONTAINER_FORCEINLINE explicit insert_range_proxy(FwdIt first)
-      :  first_(first)
-   {}
-
-   template<class Iterator>
-   BOOST_CONTAINER_FORCEINLINE void uninitialized_copy_n_and_update(Allocator &a, Iterator p, std::size_t n)
-   {
-      this->first_ = ::boost::container::uninitialized_copy_alloc_n_source(a, this->first_, n, p);
-   }
-
-   template<class Iterator>
-   BOOST_CONTAINER_FORCEINLINE void copy_n_and_update(Allocator &, Iterator p, std::size_t n)
-   {
-      this->first_ = ::boost::container::copy_n_source(this->first_, n, p);
-   }
-
-   FwdIt first_;
-};
-
-
-template<class Allocator>
-struct insert_n_copies_proxy
-{
-   typedef typename allocator_traits<Allocator>::value_type value_type;
-
-   BOOST_CONTAINER_FORCEINLINE explicit insert_n_copies_proxy(const value_type &v)
-      :  v_(v)
-   {}
-
-   template<class Iterator>
-   BOOST_CONTAINER_FORCEINLINE void uninitialized_copy_n_and_update(Allocator &a, Iterator p, std::size_t n) const
-   {  boost::container::uninitialized_fill_alloc_n(a, v_, n, p);  }
-
-   template<class Iterator>
-   BOOST_CONTAINER_FORCEINLINE void copy_n_and_update(Allocator &, Iterator p, std::size_t n) const
-   {
-      while (n){
-         --n;
-         *p = v_;
-         ++p;
-      }
-   }
-
-   const value_type &v_;
-};
-
-template<class Allocator>
-struct insert_value_initialized_n_proxy
-{
-   typedef ::boost::container::allocator_traits<Allocator> alloc_traits;
-   typedef typename allocator_traits<Allocator>::value_type value_type;
-   typedef typename dtl::aligned_storage<sizeof(value_type), dtl::alignment_of<value_type>::value>::type storage_t;
-
-   template<class Iterator>
-   BOOST_CONTAINER_FORCEINLINE void uninitialized_copy_n_and_update(Allocator &a, Iterator p, std::size_t n) const
-   {  boost::container::uninitialized_value_init_alloc_n(a, n, p);  }
-
-   template<class Iterator>
-   void copy_n_and_update(Allocator &a, Iterator p, std::size_t n) const
-   {
-      while (n){
-         --n;
-         storage_t v;
-         alloc_traits::construct(a, move_detail::force_ptr<value_type *>(&v));
-         value_type *vp = move_detail::force_ptr<value_type *>(&v);
-         value_destructor<Allocator> on_exit(a, *vp); (void)on_exit;
-         *p = ::boost::move(*vp);
-         ++p;
-      }
-   }
-};
-
-template<class Allocator>
-struct insert_default_initialized_n_proxy
-{
-   typedef ::boost::container::allocator_traits<Allocator> alloc_traits;
-   typedef typename allocator_traits<Allocator>::value_type value_type;
-   typedef typename dtl::aligned_storage<sizeof(value_type), dtl::alignment_of<value_type>::value>::type storage_t;
-
-   template<class Iterator>
-   BOOST_CONTAINER_FORCEINLINE void uninitialized_copy_n_and_update(Allocator &a, Iterator p, std::size_t n) const
-   {  boost::container::uninitialized_default_init_alloc_n(a, n, p);  }
-
-   template<class Iterator>
-   void copy_n_and_update(Allocator &a, Iterator p, std::size_t n) const
-   {
-      if(!is_pod<value_type>::value){
-         while (n){
-            --n;
-            typename dtl::aligned_storage<sizeof(value_type), dtl::alignment_of<value_type>::value>::type v;
-            alloc_traits::construct(a, move_detail::force_ptr<value_type *>(&v), default_init);
-            value_type *vp = move_detail::force_ptr<value_type *>(&v);
-            value_destructor<Allocator> on_exit(a, *vp); (void)on_exit;
-            *p = ::boost::move(*vp);
-            ++p;
-         }
-      }
-   }
-};
-
-template<class Allocator>
-struct insert_copy_proxy
-{
-   typedef boost::container::allocator_traits<Allocator> alloc_traits;
-   typedef typename alloc_traits::value_type value_type;
-
-   static const bool single_value = true;
-
-   BOOST_CONTAINER_FORCEINLINE explicit insert_copy_proxy(const value_type &v)
-      :  v_(v)
-   {}
-
-   template<class Iterator>
-   BOOST_CONTAINER_FORCEINLINE void uninitialized_copy_n_and_update(Allocator &a, Iterator p, std::size_t n) const
-   {
-      BOOST_ASSERT(n == 1);  (void)n;
-      alloc_traits::construct( a, boost::movelib::iterator_to_raw_pointer(p), v_);
-   }
-
-   template<class Iterator>
-   BOOST_CONTAINER_FORCEINLINE void copy_n_and_update(Allocator &, Iterator p, std::size_t n) const
-   {
-      BOOST_ASSERT(n == 1);  (void)n;
-      *p = v_;
-   }
-
-   const value_type &v_;
-};
-
-
-template<class Allocator>
-struct insert_move_proxy
-{
-   typedef boost::container::allocator_traits<Allocator> alloc_traits;
-   typedef typename alloc_traits::value_type value_type;
-
-   static const bool single_value = true;
-
-   BOOST_CONTAINER_FORCEINLINE explicit insert_move_proxy(value_type &v)
-      :  v_(v)
-   {}
-
-   template<class Iterator>
-   BOOST_CONTAINER_FORCEINLINE void uninitialized_copy_n_and_update(Allocator &a, Iterator p, std::size_t n) const
-   {
-      BOOST_ASSERT(n == 1);  (void)n;
-      alloc_traits::construct( a, boost::movelib::iterator_to_raw_pointer(p), ::boost::move(v_) );
-   }
-
-   template<class Iterator>
-   BOOST_CONTAINER_FORCEINLINE void copy_n_and_update(Allocator &, Iterator p, std::size_t n) const
-   {
-      BOOST_ASSERT(n == 1);  (void)n;
-      *p = ::boost::move(v_);
-   }
-
-   value_type &v_;
-};
-
-template<class It, class Allocator>
-BOOST_CONTAINER_FORCEINLINE insert_move_proxy<Allocator> get_insert_value_proxy(BOOST_RV_REF(typename boost::container::iterator_traits<It>::value_type) v)
-{
-   return insert_move_proxy<Allocator>(v);
-}
-
-template<class It, class Allocator>
-BOOST_CONTAINER_FORCEINLINE insert_copy_proxy<Allocator> get_insert_value_proxy(const typename boost::container::iterator_traits<It>::value_type &v)
-{
-   return insert_copy_proxy<Allocator>(v);
-}
-
-}}}   //namespace boost { namespace container { namespace dtl {
-
-#if !defined(BOOST_NO_CXX11_VARIADIC_TEMPLATES)
-
-#include <boost/container/detail/variadic_templates_tools.hpp>
-#include <boost/move/utility_core.hpp>
-
-namespace boost {
-namespace container {
-namespace dtl {
-
-template<class Allocator, class ...Args>
-struct insert_nonmovable_emplace_proxy
-{
-   typedef boost::container::allocator_traits<Allocator>   alloc_traits;
-   typedef typename alloc_traits::value_type       value_type;
-   typedef typename build_number_seq<sizeof...(Args)>::type index_tuple_t;
-
-   static const bool single_value = true;
-
-   BOOST_CONTAINER_FORCEINLINE explicit insert_nonmovable_emplace_proxy(BOOST_FWD_REF(Args)... args)
-      : args_(args...)
-   {}
-
-   template<class Iterator>
-   BOOST_CONTAINER_FORCEINLINE void uninitialized_copy_n_and_update(Allocator &a, Iterator p, std::size_t n)
-   {  this->priv_uninitialized_copy_some_and_update(a, index_tuple_t(), p, n);  }
-
-   private:
-   template<std::size_t ...IdxPack, class Iterator>
-   BOOST_CONTAINER_FORCEINLINE void priv_uninitialized_copy_some_and_update(Allocator &a, const index_tuple<IdxPack...>&, Iterator p, std::size_t n)
-   {
-      BOOST_ASSERT(n == 1); (void)n;
-      alloc_traits::construct( a, boost::movelib::iterator_to_raw_pointer(p), ::boost::forward<Args>(get<IdxPack>(this->args_))... );
-   }
-
-   protected:
-   tuple<Args&...> args_;
-};
-
-template<class Allocator, class ...Args>
-struct insert_emplace_proxy
-   :  public insert_nonmovable_emplace_proxy<Allocator, Args...>
-{
-   typedef insert_nonmovable_emplace_proxy<Allocator, Args...> base_t;
-   typedef boost::container::allocator_traits<Allocator>   alloc_traits;
-   typedef typename base_t::value_type             value_type;
-   typedef typename base_t::index_tuple_t          index_tuple_t;
-
-   static const bool single_value = true;
-
-   BOOST_CONTAINER_FORCEINLINE explicit insert_emplace_proxy(BOOST_FWD_REF(Args)... args)
-      : base_t(::boost::forward<Args>(args)...)
-   {}
-
-   template<class Iterator>
-   BOOST_CONTAINER_FORCEINLINE void copy_n_and_update(Allocator &a, Iterator p, std::size_t n)
-   {  this->priv_copy_some_and_update(a, index_tuple_t(), p, n);  }
-
-   private:
-
-   template<std::size_t ...IdxPack, class Iterator>
-   BOOST_CONTAINER_FORCEINLINE void priv_copy_some_and_update(Allocator &a, const index_tuple<IdxPack...>&, Iterator p, std::size_t n)
-   {
-      BOOST_ASSERT(n ==1); (void)n;
-      typename dtl::aligned_storage<sizeof(value_type), dtl::alignment_of<value_type>::value>::type v;
-      alloc_traits::construct(a, move_detail::force_ptr<value_type *>(&v), ::boost::forward<Args>(get<IdxPack>(this->args_))...);
-      value_type *vp = move_detail::force_ptr<value_type *>(&v);
-      BOOST_CONTAINER_TRY{
-         *p = ::boost::move(*vp);
-      }
-      BOOST_CONTAINER_CATCH(...){
-         alloc_traits::destroy(a, vp);
-         BOOST_CONTAINER_RETHROW
-      }
-      BOOST_CONTAINER_CATCH_END
-      alloc_traits::destroy(a, vp);
-   }
-};
-
-//Specializations to avoid an unneeded temporary when emplacing from a single argument o type value_type
-template<class Allocator>
-struct insert_emplace_proxy<Allocator, typename boost::container::allocator_traits<Allocator>::value_type>
-   : public insert_move_proxy<Allocator>
-{
-   static const bool single_value = true;
-
-   BOOST_CONTAINER_FORCEINLINE explicit insert_emplace_proxy(typename boost::container::allocator_traits<Allocator>::value_type &&v)
-   : insert_move_proxy<Allocator>(v)
-   {}
-};
-
-//We use "add_const" here as adding "const" only confuses MSVC12(and maybe later) provoking
-//compiler error C2752 ("more than one partial specialization matches").
-//Any problem is solvable with an extra layer of indirection? ;-)
-template<class Allocator>
-struct insert_emplace_proxy<Allocator
-   , typename boost::container::dtl::add_const<typename boost::container::allocator_traits<Allocator>::value_type>::type
-   >
-   : public insert_copy_proxy<Allocator>
-{
-
-   static const bool single_value = true;
-
-   BOOST_CONTAINER_FORCEINLINE explicit insert_emplace_proxy(const typename boost::container::allocator_traits<Allocator>::value_type &v)
-   : insert_copy_proxy<Allocator>(v)
-   {}
-};
-
-template<class Allocator>
-struct insert_emplace_proxy<Allocator, typename boost::container::allocator_traits<Allocator>::value_type &>
-   : public insert_copy_proxy<Allocator>
-{
-   static const bool single_value = true;
-
-   BOOST_CONTAINER_FORCEINLINE explicit insert_emplace_proxy(const typename boost::container::allocator_traits<Allocator>::value_type &v)
-   : insert_copy_proxy<Allocator>(v)
-   {}
-};
-
-template<class Allocator>
-struct insert_emplace_proxy<Allocator
-   , typename boost::container::dtl::add_const<typename boost::container::allocator_traits<Allocator>::value_type>::type &
-   >
-   : public insert_copy_proxy<Allocator>
-{
-   static const bool single_value = true;
-
-   BOOST_CONTAINER_FORCEINLINE explicit insert_emplace_proxy(const typename boost::container::allocator_traits<Allocator>::value_type &v)
-   : insert_copy_proxy<Allocator>(v)
-   {}
-};
-
-}}}   //namespace boost { namespace container { namespace dtl {
-
-#else // !defined(BOOST_NO_CXX11_VARIADIC_TEMPLATES)
-
-#include <boost/container/detail/value_init.hpp>
-
-namespace boost {
-namespace container {
-namespace dtl {
-
-#define BOOST_CONTAINER_ADVANCED_INSERT_INT_CODE(N) \
-template< class Allocator BOOST_MOVE_I##N BOOST_MOVE_CLASS##N >\
-struct insert_nonmovable_emplace_proxy##N\
-{\
-   typedef boost::container::allocator_traits<Allocator> alloc_traits;\
-   typedef typename alloc_traits::value_type value_type;\
-   \
-   static const bool single_value = true;\
-   \
-   BOOST_CONTAINER_FORCEINLINE explicit insert_nonmovable_emplace_proxy##N(BOOST_MOVE_UREF##N)\
-      BOOST_MOVE_COLON##N BOOST_MOVE_FWD_INIT##N {}\
-   \
-   template<class Iterator>\
-   BOOST_CONTAINER_FORCEINLINE void uninitialized_copy_n_and_update(Allocator &a, Iterator p, std::size_t n)\
-   {\
-      BOOST_ASSERT(n == 1); (void)n;\
-      alloc_traits::construct(a, boost::movelib::iterator_to_raw_pointer(p) BOOST_MOVE_I##N BOOST_MOVE_MFWD##N);\
-   }\
-   \
-   template<class Iterator>\
-   BOOST_CONTAINER_FORCEINLINE void copy_n_and_update(Allocator &, Iterator, std::size_t)\
-   {  BOOST_ASSERT(false);   }\
-   \
-   protected:\
-   BOOST_MOVE_MREF##N\
-};\
-\
-template< class Allocator BOOST_MOVE_I##N BOOST_MOVE_CLASS##N >\
-struct insert_emplace_proxy_arg##N\
-   : insert_nonmovable_emplace_proxy##N< Allocator BOOST_MOVE_I##N BOOST_MOVE_TARG##N >\
-{\
-   typedef insert_nonmovable_emplace_proxy##N\
-      < Allocator BOOST_MOVE_I##N BOOST_MOVE_TARG##N > base_t;\
-   typedef typename base_t::value_type value_type;\
-   typedef boost::container::allocator_traits<Allocator> alloc_traits;\
-   \
-   static const bool single_value = true;\
-   \
-   BOOST_CONTAINER_FORCEINLINE explicit insert_emplace_proxy_arg##N(BOOST_MOVE_UREF##N)\
-      : base_t(BOOST_MOVE_FWD##N){}\
-   \
-   template<class Iterator>\
-   BOOST_CONTAINER_FORCEINLINE void copy_n_and_update(Allocator &a, Iterator p, std::size_t n)\
-   {\
-      BOOST_ASSERT(n == 1); (void)n;\
-      typename dtl::aligned_storage<sizeof(value_type), dtl::alignment_of<value_type>::value>::type v;\
-      alloc_traits::construct(a, move_detail::force_ptr<value_type *>(&v) BOOST_MOVE_I##N BOOST_MOVE_MFWD##N);\
-      value_type *vp = move_detail::force_ptr<value_type *>(&v);\
-      BOOST_CONTAINER_TRY{\
-         *p = ::boost::move(*vp);\
-      }\
-      BOOST_CONTAINER_CATCH(...){\
-         alloc_traits::destroy(a, vp);\
-         BOOST_CONTAINER_RETHROW\
-      }\
-      BOOST_CONTAINER_CATCH_END\
-      alloc_traits::destroy(a, vp);\
-   }\
-};\
-//
-BOOST_MOVE_ITERATE_0TO9(BOOST_CONTAINER_ADVANCED_INSERT_INT_CODE)
-#undef BOOST_CONTAINER_ADVANCED_INSERT_INT_CODE
-
-#if defined(BOOST_NO_CXX11_RVALUE_REFERENCES)
-
-//Specializations to avoid an unneeded temporary when emplacing from a single argument o type value_type
-template<class Allocator>
-struct insert_emplace_proxy_arg1<Allocator, ::boost::rv<typename boost::container::allocator_traits<Allocator>::value_type> >
-   : public insert_move_proxy<Allocator>
-{
-   static const bool single_value = true;
-
-   BOOST_CONTAINER_FORCEINLINE explicit insert_emplace_proxy_arg1(typename boost::container::allocator_traits<Allocator>::value_type &v)
-   : insert_move_proxy<Allocator>(v)
-   {}
-};
-
-template<class Allocator>
-struct insert_emplace_proxy_arg1<Allocator, typename boost::container::allocator_traits<Allocator>::value_type>
-   : public insert_copy_proxy<Allocator>
-{
-   static const bool single_value = true;
-
-   BOOST_CONTAINER_FORCEINLINE explicit insert_emplace_proxy_arg1(const typename boost::container::allocator_traits<Allocator>::value_type &v)
-   : insert_copy_proxy<Allocator>(v)
-   {}
-};
-
-#else //e.g. MSVC10 & MSVC11
-
-//Specializations to avoid an unneeded temporary when emplacing from a single argument o type value_type
-template<class Allocator>
-struct insert_emplace_proxy_arg1<Allocator, typename boost::container::allocator_traits<Allocator>::value_type>
-   : public insert_move_proxy<Allocator>
-{
-   static const bool single_value = true;
-
-   BOOST_CONTAINER_FORCEINLINE explicit insert_emplace_proxy_arg1(typename boost::container::allocator_traits<Allocator>::value_type &&v)
-   : insert_move_proxy<Allocator>(v)
-   {}
-};
-
-//We use "add_const" here as adding "const" only confuses MSVC10&11 provoking
-//compiler error C2752 ("more than one partial specialization matches").
-//Any problem is solvable with an extra layer of indirection? ;-)
-template<class Allocator>
-struct insert_emplace_proxy_arg1<Allocator
-   , typename boost::container::dtl::add_const<typename boost::container::allocator_traits<Allocator>::value_type>::type
-   >
-   : public insert_copy_proxy<Allocator>
-{
-   static const bool single_value = true;
-
-   BOOST_CONTAINER_FORCEINLINE explicit insert_emplace_proxy_arg1(const typename boost::container::allocator_traits<Allocator>::value_type &v)
-   : insert_copy_proxy<Allocator>(v)
-   {}
-};
-
-template<class Allocator>
-struct insert_emplace_proxy_arg1<Allocator, typename boost::container::allocator_traits<Allocator>::value_type &>
-   : public insert_copy_proxy<Allocator>
-{
-   static const bool single_value = true;
-
-   BOOST_CONTAINER_FORCEINLINE explicit insert_emplace_proxy_arg1(const typename boost::container::allocator_traits<Allocator>::value_type &v)
-   : insert_copy_proxy<Allocator>(v)
-   {}
-};
-
-template<class Allocator>
-struct insert_emplace_proxy_arg1<Allocator
-   , typename boost::container::dtl::add_const<typename boost::container::allocator_traits<Allocator>::value_type>::type &
-   >
-   : public insert_copy_proxy<Allocator>
-{
-   static const bool single_value = true;
-
-   BOOST_CONTAINER_FORCEINLINE explicit insert_emplace_proxy_arg1(const typename boost::container::allocator_traits<Allocator>::value_type &v)
-   : insert_copy_proxy<Allocator>(v)
-   {}
-};
-
-#endif
-
-}}}   //namespace boost { namespace container { namespace dtl {
-
-#endif   // !defined(BOOST_NO_CXX11_VARIADIC_TEMPLATES)
-
-#include <boost/container/detail/config_end.hpp>
-
-#endif //#ifndef BOOST_CONTAINER_ADVANCED_INSERT_INT_HPP
diff --git a/src/boost/container/detail/algorithm.hpp b/src/boost/container/detail/algorithm.hpp
deleted file mode 100644
index ce5582bc..00000000
--- a/src/boost/container/detail/algorithm.hpp
+++ /dev/null
@@ -1,185 +0,0 @@
-//////////////////////////////////////////////////////////////////////////////
-//
-// (C) Copyright Ion Gaztanaga 2014-2014.
-//
-// Distributed under the Boost 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.
-//
-//////////////////////////////////////////////////////////////////////////////
-
-#ifndef BOOST_CONTAINER_DETAIL_ALGORITHM_HPP
-#define BOOST_CONTAINER_DETAIL_ALGORITHM_HPP
-
-#ifndef BOOST_CONFIG_HPP
-#  include <boost/config.hpp>
-#endif
-
-#if defined(BOOST_HAS_PRAGMA_ONCE)
-#  pragma once
-#endif
-
-#include <boost/intrusive/detail/algorithm.hpp>
-
-namespace boost {
-namespace container {
-
-using boost::intrusive::algo_equal;
-using boost::intrusive::algo_lexicographical_compare;
-
-template<class Func>
-class binder1st
-{
-   public:
-	typedef typename Func::second_argument_type  argument_type;
-	typedef typename Func::result_type           result_type;
-
-	binder1st(const Func& func, const typename Func::first_argument_type& arg)
-   	: op(func), value(arg)
-	{}
-
-	result_type operator()(const argument_type& arg) const
-   {	return op(value, arg);  }
-
-	result_type operator()(argument_type& arg) const
-   {  return op(value, arg);   }
-
-   private:
-	Func op;
-	typename Func::first_argument_type value;
-};
-
-template<class Func, class T> 
-inline binder1st<Func> bind1st(const Func& func, const T& arg)
-{	return boost::container::binder1st<Func>(func, arg);  }
-
-template<class Func>
-class binder2nd
-{
-   public:
-	typedef typename Func::first_argument_type   argument_type;
-	typedef typename Func::result_type           result_type;
-
-	binder2nd(const Func& func, const typename Func::second_argument_type& arg)
-	   : op(func), value(arg)
-   {}
-
-	result_type operator()(const argument_type& arg) const
-   {  return op(arg, value);  }
-
-	result_type operator()(argument_type& arg) const
-	{  return op(arg, value);  }
-
-   private:
-	Func op;
-	typename Func::second_argument_type value;
-};
-
-template<class Func, class T>
-inline binder2nd<Func> bind2nd(const Func& func, const T& arg)
-{
-   return (boost::container::binder2nd<Func>(func, arg));
-}
-
-template<class Func>
-class unary_negate
-{
-   public:
-   typedef typename Func::argument_type   argument_type;
-   typedef typename Func::result_type     result_type;
-
-	explicit unary_negate(const Func& func)
-		: m_func(func)
-   {}
-
-	bool operator()(const typename Func::argument_type& arg) const
-	{  return !m_func(arg);  }
-
-   private:
-	Func m_func;
-};
-
-template<class Func> inline
-unary_negate<Func> not1(const Func& func)
-{
-   return boost::container::unary_negate<Func>(func);
-}
-
-template<class InputIt, class UnaryPredicate>
-InputIt find_if(InputIt first, InputIt last, UnaryPredicate p)
-{
-   for (; first != last; ++first) {
-      if (p(*first)) {
-         return first;
-      }
-   }
-   return last;
-}
-
-template<class ForwardIt1, class ForwardIt2, class BinaryPredicate>
-  ForwardIt1 find_end (ForwardIt1 first1, ForwardIt1 last1
-                      ,ForwardIt2 first2, ForwardIt2 last2
-                      ,BinaryPredicate p)
-{
-   if (first2==last2)
-      return last1;  // specified in C++11
-
-   ForwardIt1 ret = last1;
-
-   while (first1!=last1)
-   {
-      ForwardIt1 it1 = first1;
-      ForwardIt2 it2 = first2;
-      while ( p(*it1, *it2) ) {
-         ++it1; ++it2;
-         if (it2==last2) {
-            ret=first1;
-            break;
-         }
-         if (it1==last1)
-         return ret;
-      }
-      ++first1;
-   }
-   return ret;
-}
-
-template<class InputIt, class ForwardIt, class BinaryPredicate>
-InputIt find_first_of(InputIt first1, InputIt last1, ForwardIt first2, ForwardIt last2, BinaryPredicate p)
-{
-   for (; first1 != last1; ++first1) {
-      for (ForwardIt it = first2; it != last2; ++it) {
-         if (p(*first1, *it)) {
-            return first1;
-         }
-      }
-   }
-   return last1;
-}
-
-template<class ForwardIt1, class ForwardIt2, class BinaryPredicate>
-ForwardIt1 search(ForwardIt1 first1, ForwardIt1 last1,
-                        ForwardIt2 first2, ForwardIt2 last2, BinaryPredicate p)
-{
-   for (; ; ++first1) {
-      ForwardIt1 it = first1;
-      for (ForwardIt2 it2 = first2; ; ++it, ++it2) {
-         if (it2 == last2) {
-            return first1;
-         }
-         if (it == last1) {
-            return last1;
-         }
-         if (!p(*it, *it2)) {
-            break;
-         }
-      }
-   }
-}
-
-}  //namespace container {
-}  //namespace boost {
-
-#endif   //#ifndef BOOST_CONTAINER_DETAIL_ALGORITHM_HPP
diff --git a/src/boost/container/detail/alloc_helpers.hpp b/src/boost/container/detail/alloc_helpers.hpp
deleted file mode 100644
index 5ca2ca72..00000000
--- a/src/boost/container/detail/alloc_helpers.hpp
+++ /dev/null
@@ -1,60 +0,0 @@
-//////////////////////////////////////////////////////////////////////////////
-//
-// (C) Copyright Ion Gaztanaga 2014-2015. Distributed under the Boost
-// 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.
-//
-//////////////////////////////////////////////////////////////////////////////
-#ifndef BOOST_CONTAINER_DETAIL_ALLOC_TRAITS_HPP
-#define BOOST_CONTAINER_DETAIL_ALLOC_TRAITS_HPP
-
-#ifndef BOOST_CONFIG_HPP
-#  include <boost/config.hpp>
-#endif
-
-#if defined(BOOST_HAS_PRAGMA_ONCE)
-#  pragma once
-#endif
-
-// move
-#include <boost/move/adl_move_swap.hpp>
-#include <boost/move/utility_core.hpp>
-
-namespace boost {
-namespace container {
-namespace dtl {
-
-template<class AllocatorType>
-BOOST_CONTAINER_FORCEINLINE void swap_alloc(AllocatorType &, AllocatorType &, dtl::false_type)
-   BOOST_NOEXCEPT_OR_NOTHROW
-{}
-
-template<class AllocatorType>
-BOOST_CONTAINER_FORCEINLINE void swap_alloc(AllocatorType &l, AllocatorType &r, dtl::true_type)
-{  boost::adl_move_swap(l, r);   }
-
-template<class AllocatorType>
-BOOST_CONTAINER_FORCEINLINE void assign_alloc(AllocatorType &, const AllocatorType &, dtl::false_type)
-   BOOST_NOEXCEPT_OR_NOTHROW
-{}
-
-template<class AllocatorType>
-BOOST_CONTAINER_FORCEINLINE void assign_alloc(AllocatorType &l, const AllocatorType &r, dtl::true_type)
-{  l = r;   }
-
-template<class AllocatorType>
-BOOST_CONTAINER_FORCEINLINE void move_alloc(AllocatorType &, AllocatorType &, dtl::false_type)
-   BOOST_NOEXCEPT_OR_NOTHROW
-{}
-
-template<class AllocatorType>
-BOOST_CONTAINER_FORCEINLINE void move_alloc(AllocatorType &l, AllocatorType &r, dtl::true_type)
-{  l = ::boost::move(r);   }
-
-}  //namespace dtl {
-}  //namespace container {
-}  //namespace boost {
-
-#endif   //#ifndef BOOST_CONTAINER_DETAIL_ALLOC_TRAITS_HPP
diff --git a/src/boost/container/detail/allocation_type.hpp b/src/boost/container/detail/allocation_type.hpp
deleted file mode 100644
index 1e8aa673..00000000
--- a/src/boost/container/detail/allocation_type.hpp
+++ /dev/null
@@ -1,58 +0,0 @@
-///////////////////////////////////////////////////////////////////////////////
-//
-// (C) Copyright Ion Gaztanaga 2005-2013. Distributed under the Boost
-// 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.
-//
-///////////////////////////////////////////////////////////////////////////////
-
-#ifndef BOOST_CONTAINER_ALLOCATION_TYPE_HPP
-#define BOOST_CONTAINER_ALLOCATION_TYPE_HPP
-
-#ifndef BOOST_CONFIG_HPP
-#  include <boost/config.hpp>
-#endif
-
-#if defined(BOOST_HAS_PRAGMA_ONCE)
-#  pragma once
-#endif
-
-#include <boost/container/detail/config_begin.hpp>
-#include <boost/container/detail/workaround.hpp>
-
-namespace boost {
-namespace container {
-
-#ifndef BOOST_CONTAINER_DOXYGEN_INVOKED
-enum allocation_type_v
-{
-   // constants for allocation commands
-   allocate_new_v   = 0x01,
-   expand_fwd_v     = 0x02,
-   expand_bwd_v     = 0x04,
-//   expand_both    = expand_fwd | expand_bwd,
-//   expand_or_new  = allocate_new | expand_both,
-   shrink_in_place_v = 0x08,
-   nothrow_allocation_v = 0x10,
-   zero_memory_v = 0x20,
-   try_shrink_in_place_v = 0x40
-};
-
-typedef unsigned int allocation_type;
-#endif   //#ifndef BOOST_CONTAINER_DOXYGEN_INVOKED
-static const allocation_type allocate_new       = (allocation_type)allocate_new_v;
-static const allocation_type expand_fwd         = (allocation_type)expand_fwd_v;
-static const allocation_type expand_bwd         = (allocation_type)expand_bwd_v;
-static const allocation_type shrink_in_place    = (allocation_type)shrink_in_place_v;
-static const allocation_type try_shrink_in_place= (allocation_type)try_shrink_in_place_v;
-static const allocation_type nothrow_allocation = (allocation_type)nothrow_allocation_v;
-static const allocation_type zero_memory        = (allocation_type)zero_memory_v;
-
-}  //namespace container {
-}  //namespace boost {
-
-#include <boost/container/detail/config_end.hpp>
-
-#endif   //BOOST_CONTAINER_ALLOCATION_TYPE_HPP
diff --git a/src/boost/container/detail/allocator_version_traits.hpp b/src/boost/container/detail/allocator_version_traits.hpp
deleted file mode 100644
index 391f4666..00000000
--- a/src/boost/container/detail/allocator_version_traits.hpp
+++ /dev/null
@@ -1,162 +0,0 @@
-//////////////////////////////////////////////////////////////////////////////
-//
-// (C) Copyright Ion Gaztanaga 2012-2013. Distributed under the Boost
-// 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.
-//
-//////////////////////////////////////////////////////////////////////////////
-
-#ifndef BOOST_CONTAINER_DETAIL_ALLOCATOR_VERSION_TRAITS_HPP
-#define BOOST_CONTAINER_DETAIL_ALLOCATOR_VERSION_TRAITS_HPP
-
-#ifndef BOOST_CONFIG_HPP
-#  include <boost/config.hpp>
-#endif
-
-#if defined(BOOST_HAS_PRAGMA_ONCE)
-#  pragma once
-#endif
-
-#include <boost/container/detail/config_begin.hpp>
-#include <boost/container/detail/workaround.hpp>
-
-#include <boost/container/allocator_traits.hpp>             //allocator_traits
-#include <boost/container/throw_exception.hpp>
-#include <boost/container/detail/multiallocation_chain.hpp> //multiallocation_chain
-#include <boost/container/detail/version_type.hpp>          //version_type
-#include <boost/container/detail/allocation_type.hpp>       //allocation_type
-#include <boost/container/detail/mpl.hpp>                   //integral_constant
-#include <boost/intrusive/pointer_traits.hpp>               //pointer_traits
-
-namespace boost {
-namespace container {
-namespace dtl {
-
-template<class Allocator, unsigned Version = boost::container::dtl::version<Allocator>::value>
-struct allocator_version_traits
-{
-   typedef ::boost::container::dtl::integral_constant
-      <unsigned, Version> alloc_version;
-
-   typedef typename Allocator::multiallocation_chain multiallocation_chain;
-
-   typedef typename boost::container::allocator_traits<Allocator>::pointer    pointer;
-   typedef typename boost::container::allocator_traits<Allocator>::size_type  size_type;
-
-   //Node allocation interface
-   BOOST_CONTAINER_FORCEINLINE static pointer allocate_one(Allocator &a)
-   {  return a.allocate_one();   }
-
-   BOOST_CONTAINER_FORCEINLINE static void deallocate_one(Allocator &a, const pointer &p)
-   {  a.deallocate_one(p);   }
-
-   BOOST_CONTAINER_FORCEINLINE static void allocate_individual(Allocator &a, size_type n, multiallocation_chain &m)
-   {  return a.allocate_individual(n, m);   }
-
-   BOOST_CONTAINER_FORCEINLINE static void deallocate_individual(Allocator &a, multiallocation_chain &holder)
-   {  a.deallocate_individual(holder);   }
-
-   BOOST_CONTAINER_FORCEINLINE static pointer allocation_command(Allocator &a, allocation_type command,
-                         size_type limit_size, size_type &prefer_in_recvd_out_size, pointer &reuse)
-   {  return a.allocation_command(command, limit_size, prefer_in_recvd_out_size, reuse);  }
-};
-
-template<class Allocator>
-struct allocator_version_traits<Allocator, 1>
-{
-   typedef ::boost::container::dtl::integral_constant
-      <unsigned, 1> alloc_version;
-
-   typedef typename boost::container::allocator_traits<Allocator>::pointer    pointer;
-   typedef typename boost::container::allocator_traits<Allocator>::size_type  size_type;
-   typedef typename boost::container::allocator_traits<Allocator>::value_type value_type;
-
-   typedef typename boost::intrusive::pointer_traits<pointer>::
-         template rebind_pointer<void>::type                void_ptr;
-   typedef dtl::basic_multiallocation_chain
-      <void_ptr>                                            multialloc_cached_counted;
-   typedef boost::container::dtl::
-      transform_multiallocation_chain
-         < multialloc_cached_counted, value_type>           multiallocation_chain;
-
-   //Node allocation interface
-   BOOST_CONTAINER_FORCEINLINE static pointer allocate_one(Allocator &a)
-   {  return a.allocate(1);   }
-
-   BOOST_CONTAINER_FORCEINLINE static void deallocate_one(Allocator &a, const pointer &p)
-   {  a.deallocate(p, 1);   }
-
-   static void deallocate_individual(Allocator &a, multiallocation_chain &holder)
-   {
-      size_type n = holder.size();
-      typename multiallocation_chain::iterator it = holder.begin();
-      while(n){
-         --n;
-         pointer p = boost::intrusive::pointer_traits<pointer>::pointer_to(*it);
-         ++it;
-         a.deallocate(p, 1);
-      }
-   }
-
-   struct allocate_individual_rollback
-   {
-      BOOST_CONTAINER_FORCEINLINE allocate_individual_rollback(Allocator &a, multiallocation_chain &chain)
-         : mr_a(a), mp_chain(&chain)
-      {}
-
-      BOOST_CONTAINER_FORCEINLINE ~allocate_individual_rollback()
-      {
-         if(mp_chain)
-            allocator_version_traits::deallocate_individual(mr_a, *mp_chain);
-      }
-
-      BOOST_CONTAINER_FORCEINLINE void release()
-      {
-         mp_chain = 0;
-      }
-
-      Allocator &mr_a;
-      multiallocation_chain * mp_chain;
-   };
-
-   static void allocate_individual(Allocator &a, size_type n, multiallocation_chain &m)
-   {
-      allocate_individual_rollback rollback(a, m);
-      while(n--){
-         m.push_front(a.allocate(1));
-      }
-      rollback.release();
-   }
-
-   static pointer allocation_command(Allocator &a, allocation_type command,
-                         size_type, size_type &prefer_in_recvd_out_size, pointer &reuse)
-   {
-      pointer ret = pointer();
-      if(BOOST_UNLIKELY(!(command & allocate_new) && !(command & nothrow_allocation))){
-         throw_logic_error("version 1 allocator without allocate_new flag");
-      }
-      else{
-         BOOST_CONTAINER_TRY{
-            ret = a.allocate(prefer_in_recvd_out_size);
-         }
-         BOOST_CONTAINER_CATCH(...){
-            if(!(command & nothrow_allocation)){
-               BOOST_CONTAINER_RETHROW
-            }
-         }
-         BOOST_CONTAINER_CATCH_END
-         reuse = pointer();
-      }
-      return ret;
-   }
-};
-
-}  //namespace dtl {
-}  //namespace container {
-}  //namespace boost {
-
-#include <boost/container/detail/config_end.hpp>
-
-#endif // ! defined(BOOST_CONTAINER_DETAIL_ALLOCATOR_VERSION_TRAITS_HPP)
diff --git a/src/boost/container/detail/compare_functors.hpp b/src/boost/container/detail/compare_functors.hpp
deleted file mode 100644
index ae4ffcea..00000000
--- a/src/boost/container/detail/compare_functors.hpp
+++ /dev/null
@@ -1,134 +0,0 @@
-///////////////////////////////////////////////////////////////////////////////
-//
-// (C) Copyright Ion Gaztanaga 2014-2014. Distributed under the Boost
-// 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.
-//
-///////////////////////////////////////////////////////////////////////////////
-
-#ifndef BOOST_CONTAINER_DETAIL_COMPARE_FUNCTORS_HPP
-#define BOOST_CONTAINER_DETAIL_COMPARE_FUNCTORS_HPP
-
-#ifndef BOOST_CONFIG_HPP
-#  include <boost/config.hpp>
-#endif
-
-#if defined(BOOST_HAS_PRAGMA_ONCE)
-#  pragma once
-#endif
-
-#include <boost/intrusive/detail/ebo_functor_holder.hpp>
-#include <boost/container/detail/workaround.hpp>
-
-namespace boost {
-namespace container {
-
-template<class ValueType>
-class equal_to_value
-{
-   typedef ValueType value_type;
-   const value_type &t_;
-
-   public:
-   BOOST_CONTAINER_FORCEINLINE explicit equal_to_value(const value_type &t)
-      :  t_(t)
-   {}
-
-   BOOST_CONTAINER_FORCEINLINE bool operator()(const value_type &t)const
-   {  return t_ == t;   }
-};
-
-template<class Node, class Pred, class Ret = bool>
-struct value_to_node_compare
-   :  Pred
-{
-   typedef Pred predicate_type;
-   typedef Node node_type;
-
-   BOOST_CONTAINER_FORCEINLINE value_to_node_compare()
-      : Pred()
-   {}
-
-   BOOST_CONTAINER_FORCEINLINE explicit value_to_node_compare(Pred pred)
-      :  Pred(pred)
-   {}
-
-   BOOST_CONTAINER_FORCEINLINE Ret operator()(const Node &a, const Node &b) const
-   {  return static_cast<const Pred&>(*this)(a.get_data(), b.get_data());  }
-
-   BOOST_CONTAINER_FORCEINLINE Ret operator()(const Node &a) const
-   {  return static_cast<const Pred&>(*this)(a.get_data());  }
-
-   BOOST_CONTAINER_FORCEINLINE Ret operator()(const Node &a, const Node &b)
-   {  return static_cast<Pred&>(*this)(a.get_data(), b.get_data());  }
-
-   BOOST_CONTAINER_FORCEINLINE Ret operator()(const Node &a)
-   {  return static_cast<Pred&>(*this)(a.get_data());  }
-
-   BOOST_CONTAINER_FORCEINLINE predicate_type &       predicate()        { return static_cast<predicate_type&>(*this); }
-   BOOST_CONTAINER_FORCEINLINE const predicate_type & predicate()  const { return static_cast<predicate_type&>(*this); }
-};
-
-template<class KeyPred, class KeyOfValue, class Node, class Ret = bool>
-struct key_node_pred
-   :  public boost::intrusive::detail::ebo_functor_holder<KeyPred>
-{
-   BOOST_CONTAINER_FORCEINLINE explicit key_node_pred(const KeyPred &comp)
-      :  base_t(comp)
-   {}
-
-   BOOST_CONTAINER_FORCEINLINE explicit key_node_pred()
-   {}
-
-   typedef boost::intrusive::detail::ebo_functor_holder<KeyPred> base_t;
-   typedef KeyPred                     key_predicate;
-   typedef KeyOfValue                  key_of_value;
-   typedef typename KeyOfValue::type   key_type;
-
-
-   BOOST_CONTAINER_FORCEINLINE static const key_type &key_from(const Node &n)
-   {
-      return key_of_value()(n.get_data());
-   }
-
-   template <class T>
-   BOOST_CONTAINER_FORCEINLINE static const T &
-      key_from(const T &t)
-   {  return t;  }
-
-   BOOST_CONTAINER_FORCEINLINE const key_predicate &key_pred() const
-   {  return static_cast<const key_predicate &>(*this);  }
-
-   BOOST_CONTAINER_FORCEINLINE key_predicate &key_pred()
-   {  return static_cast<key_predicate &>(*this);  }
-
-   BOOST_CONTAINER_FORCEINLINE Ret operator()(const key_type &key) const
-   {  return this->key_pred()(key);  }
-
-   template<class U>
-   BOOST_CONTAINER_FORCEINLINE Ret operator()(const U &nonkey) const
-   {  return this->key_pred()(this->key_from(nonkey));  }
-
-   BOOST_CONTAINER_FORCEINLINE bool operator()(const key_type &key1, const key_type &key2) const
-   {  return this->key_pred()(key1, key2);  }
-
-   template<class U>
-   BOOST_CONTAINER_FORCEINLINE bool operator()(const key_type &key1, const U &nonkey2) const
-   {  return this->key_pred()(key1, this->key_from(nonkey2));  }
-
-   template<class U>
-   BOOST_CONTAINER_FORCEINLINE bool operator()(const U &nonkey1, const key_type &key2) const
-   {  return this->key_pred()(this->key_from(nonkey1), key2);  }
-
-   template<class U, class V>
-   BOOST_CONTAINER_FORCEINLINE bool operator()(const U &nonkey1, const V &nonkey2) const
-   {  return this->key_pred()(this->key_from(nonkey1), this->key_from(nonkey2));  }
-};
-
-
-}  //namespace container {
-}  //namespace boost {
-
-#endif   //BOOST_CONTAINER_DETAIL_COMPARE_FUNCTORS_HPP
diff --git a/src/boost/container/detail/config_begin.hpp b/src/boost/container/detail/config_begin.hpp
deleted file mode 100644
index e1075d1d..00000000
--- a/src/boost/container/detail/config_begin.hpp
+++ /dev/null
@@ -1,61 +0,0 @@
-//////////////////////////////////////////////////////////////////////////////
-//
-// (C) Copyright Ion Gaztanaga 2005-2013. Distributed under the Boost
-// 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.
-//
-//////////////////////////////////////////////////////////////////////////////
-#ifndef BOOST_CONTAINER_CONTAINER_DETAIL_CONFIG_INCLUDED
-#define BOOST_CONTAINER_CONTAINER_DETAIL_CONFIG_INCLUDED
-#ifndef BOOST_CONFIG_HPP
-#include <boost/config.hpp>
-#endif
-
-#endif   //BOOST_CONTAINER_CONTAINER_DETAIL_CONFIG_INCLUDED
-
-#ifdef BOOST_MSVC
-   #pragma warning (push)
-   #pragma warning (disable : 4619) // there is no warning number 'XXXX'
-   #pragma warning (disable : 4127) // conditional expression is constant
-   #pragma warning (disable : 4146) // unary minus operator applied to unsigned type, result still unsigned
-   #pragma warning (disable : 4197) // top-level volatile in cast is ignored
-   #pragma warning (disable : 4251) // "identifier" : class "type" needs to have dll-interface to be used by clients of class "type2"
-   #pragma warning (disable : 4275) // non DLL-interface classkey "identifier" used as base for DLL-interface classkey "identifier"
-   #pragma warning (disable : 4284) // odd return type for operator->
-   #pragma warning (disable : 4290) // C++ exception specification ignored except to indicate a function is not __declspec(nothrow)
-   #pragma warning (disable : 4324) // structure was padded due to __declspec(align(
-   #pragma warning (disable : 4345) // behavior change: an object of POD type constructed with an initializer of the form () will be default-initialized
-   #pragma warning (disable : 4355) // "this" : used in base member initializer list
-   #pragma warning (disable : 4503) // "identifier" : decorated name length exceeded, name was truncated
-   #pragma warning (disable : 4510) //  default constructor could not be generated
-   #pragma warning (disable : 4511) // copy constructor could not be generated
-   #pragma warning (disable : 4512) // assignment operator could not be generated
-   #pragma warning (disable : 4514) // unreferenced inline removed
-   #pragma warning (disable : 4521) // Disable "multiple copy constructors specified"
-   #pragma warning (disable : 4522) // "class" : multiple assignment operators specified
-   #pragma warning (disable : 4541) // 'typeid' used on polymorphic type '' with /GR-; unpredictable behavior may result
-   #pragma warning (disable : 4584) //  X is already a base-class of Y
-   #pragma warning (disable : 4610) //  struct can never be instantiated - user defined constructor required
-   #pragma warning (disable : 4671) //  the copy constructor is inaccessible
-   #pragma warning (disable : 4673) //  throwing '' the following types will not be considered at the catch site
-   #pragma warning (disable : 4675) // "method" should be declared "static" and have exactly one parameter
-   #pragma warning (disable : 4706) // assignment within conditional expression
-   #pragma warning (disable : 4710) // function not inlined
-   #pragma warning (disable : 4714) // "function": marked as __forceinline not inlined
-   #pragma warning (disable : 4711) // function selected for automatic inline expansion
-   #pragma warning (disable : 4786) // identifier truncated in debug info
-   #pragma warning (disable : 4996) // "function": was declared deprecated
- 
-#endif   //BOOST_MSVC
-
-
-#if defined(BOOST_GCC) && (BOOST_GCC >= 40600)
-#pragma GCC diagnostic push
-//Sign conversion warnings broken before GCC 9.3
-//(https://gcc.gnu.org/bugzilla/show_bug.cgi?id=87519)
-#if BOOST_GCC < 90300
-#pragma GCC diagnostic ignored "-Wsign-conversion"
-#endif
-#endif
diff --git a/src/boost/container/detail/config_end.hpp b/src/boost/container/detail/config_end.hpp
deleted file mode 100644
index 65643ea1..00000000
--- a/src/boost/container/detail/config_end.hpp
+++ /dev/null
@@ -1,16 +0,0 @@
-//////////////////////////////////////////////////////////////////////////////
-//
-// (C) Copyright Ion Gaztanaga 2005-2013. Distributed under the Boost
-// 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.
-//
-//////////////////////////////////////////////////////////////////////////////
-#if defined BOOST_MSVC
-   #pragma warning (pop)
-#endif
-
-#if defined(BOOST_GCC) && (BOOST_GCC >= 40600)
-#pragma GCC diagnostic pop
-#endif
diff --git a/src/boost/container/detail/construct_in_place.hpp b/src/boost/container/detail/construct_in_place.hpp
deleted file mode 100644
index d824d814..00000000
--- a/src/boost/container/detail/construct_in_place.hpp
+++ /dev/null
@@ -1,98 +0,0 @@
-//////////////////////////////////////////////////////////////////////////////
-//
-// (C) Copyright Ion Gaztanaga 2014-2014.
-//
-// Distributed under the Boost 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.
-//
-//////////////////////////////////////////////////////////////////////////////
-
-#ifndef BOOST_CONTAINER_DETAIL_CONSTRUCT_IN_PLACE_HPP
-#define BOOST_CONTAINER_DETAIL_CONSTRUCT_IN_PLACE_HPP
-
-#ifndef BOOST_CONFIG_HPP
-#  include <boost/config.hpp>
-#endif
-
-#if defined(BOOST_HAS_PRAGMA_ONCE)
-#  pragma once
-#endif
-
-#include <boost/container/allocator_traits.hpp>
-#include <boost/container/detail/iterators.hpp>
-#include <boost/container/detail/value_init.hpp>
-
-namespace boost {
-namespace container {
-
-//In place construction
-
-struct iterator_arg_t{};
-
-template<class Allocator, class T, class InpIt>
-BOOST_CONTAINER_FORCEINLINE void construct_in_place(Allocator &a, T* dest, InpIt source)
-{     boost::container::allocator_traits<Allocator>::construct(a, dest, *source);  }
-
-template<class Allocator, class T, class U>
-BOOST_CONTAINER_FORCEINLINE void construct_in_place(Allocator &a, T *dest, value_init_construct_iterator<U>)
-{
-   boost::container::allocator_traits<Allocator>::construct(a, dest);
-}
-
-template <class T>
-class default_init_construct_iterator;
-
-template<class Allocator, class T, class U>
-BOOST_CONTAINER_FORCEINLINE void construct_in_place(Allocator &a, T *dest, default_init_construct_iterator<U>)
-{
-   boost::container::allocator_traits<Allocator>::construct(a, dest, default_init);
-}
-
-template <class T, class EmplaceFunctor>
-class emplace_iterator;
-
-template<class Allocator, class T, class U, class EF>
-BOOST_CONTAINER_FORCEINLINE void construct_in_place(Allocator &a, T *dest, emplace_iterator<U, EF> ei)
-{
-   ei.construct_in_place(a, dest);
-}
-
-//Assignment
-
-template<class DstIt, class InpIt>
-BOOST_CONTAINER_FORCEINLINE void assign_in_place(DstIt dest, InpIt source)
-{  *dest = *source;  }
-
-template<class DstIt, class U>
-BOOST_CONTAINER_FORCEINLINE void assign_in_place(DstIt dest, value_init_construct_iterator<U>)
-{
-   dtl::value_init<U> val;
-   *dest = boost::move(val.get());
-}
-
-template <class DstIt>
-class default_init_construct_iterator;
-
-template<class DstIt, class U, class D>
-BOOST_CONTAINER_FORCEINLINE void assign_in_place(DstIt dest, default_init_construct_iterator<U>)
-{
-   U u;
-   *dest = boost::move(u);
-}
-
-template <class T, class EmplaceFunctor>
-class emplace_iterator;
-
-template<class DstIt, class U, class EF>
-BOOST_CONTAINER_FORCEINLINE void assign_in_place(DstIt dest, emplace_iterator<U, EF> ei)
-{
-   ei.assign_in_place(dest);
-}
-
-}  //namespace container {
-}  //namespace boost {
-
-#endif   //#ifndef BOOST_CONTAINER_DETAIL_CONSTRUCT_IN_PLACE_HPP
diff --git a/src/boost/container/detail/container_or_allocator_rebind.hpp b/src/boost/container/detail/container_or_allocator_rebind.hpp
deleted file mode 100644
index 1525e41d..00000000
--- a/src/boost/container/detail/container_or_allocator_rebind.hpp
+++ /dev/null
@@ -1,53 +0,0 @@
-//////////////////////////////////////////////////////////////////////////////
-//
-// (C) Copyright Ion Gaztanaga 2017-2017. Distributed under the Boost
-// 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.
-//
-//////////////////////////////////////////////////////////////////////////////
-#ifndef BOOST_CONTAINER_DETAIL_CONTAINER_OR_ALLOCATOR_REBIND_HPP
-#define BOOST_CONTAINER_DETAIL_CONTAINER_OR_ALLOCATOR_REBIND_HPP
-
-#ifndef BOOST_CONFIG_HPP
-#  include <boost/config.hpp>
-#endif
-
-#if defined(BOOST_HAS_PRAGMA_ONCE)
-#  pragma once
-#endif
-
-#include <boost/container/allocator_traits.hpp>
-#include <boost/container/detail/container_rebind.hpp>
-#include <boost/container/detail/is_container.hpp>
-
-namespace boost {
-namespace container {
-namespace dtl {
-
-template<class AllocatorOrContainer, class ToType, bool = is_container<AllocatorOrContainer>::value>
-struct container_or_allocator_rebind_impl
-   : container_rebind<AllocatorOrContainer, ToType>
-{};
-
-template<class AllocatorOrContainer, class ToType>
-struct container_or_allocator_rebind_impl<AllocatorOrContainer, ToType, false>
-   : allocator_traits<AllocatorOrContainer>::template portable_rebind_alloc<ToType>
-{};
-
-template<class ToType>
-struct container_or_allocator_rebind_impl<void, ToType, false>
-   : real_allocator<ToType, void>
-{};
-
-template<class AllocatorOrContainer, class ToType>
-struct container_or_allocator_rebind
-   : container_or_allocator_rebind_impl<AllocatorOrContainer, ToType>
-{};
-
-}  //namespace dtl {
-}  //namespace container {
-}  //namespace boost {
-
-#endif   //#ifndef BOOST_CONTAINER_DETAIL_CONTAINER_OR_ALLOCATOR_REBIND_HPP
diff --git a/src/boost/container/detail/container_rebind.hpp b/src/boost/container/detail/container_rebind.hpp
deleted file mode 100644
index 854291ae..00000000
--- a/src/boost/container/detail/container_rebind.hpp
+++ /dev/null
@@ -1,163 +0,0 @@
-//////////////////////////////////////////////////////////////////////////////
-//
-// (C) Copyright Ion Gaztanaga 2017-2017. Distributed under the Boost
-// 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.
-//
-//////////////////////////////////////////////////////////////////////////////
-#ifndef BOOST_CONTAINER_DETAIL_CONTAINER_REBIND_HPP
-#define BOOST_CONTAINER_DETAIL_CONTAINER_REBIND_HPP
-
-#ifndef BOOST_CONFIG_HPP
-#  include <boost/config.hpp>
-#endif
-
-#if defined(BOOST_HAS_PRAGMA_ONCE)
-#  pragma once
-#endif
-
-#include <boost/container/allocator_traits.hpp>
-#include <boost/container/container_fwd.hpp>
-
-
-namespace boost {
-namespace container {
-namespace dtl {
-
-   template <class Cont, class U>
-   struct container_rebind;
-
-#if !defined(BOOST_NO_CXX11_VARIADIC_TEMPLATES)
-
-   template <template <class, class, class...> class Cont, typename V, typename A, class... An, class U>
-   struct container_rebind<Cont<V, A, An...>, U>
-   {
-      typedef Cont<U, typename allocator_traits<typename real_allocator<V, A>::type>::template portable_rebind_alloc<U>::type, An...> type;
-   };
-
-   //Needed for non-conforming compilers like GCC 4.3
-   template <template <class, class> class Cont, typename V, typename A, class U>
-   struct container_rebind<Cont<V, A>, U>
-   {
-      typedef Cont<U, typename allocator_traits<typename real_allocator<V, A>::type>::template portable_rebind_alloc<U>::type> type;
-   };
-
-   template <template <class> class Cont, typename V, class U>
-   struct container_rebind<Cont<V>, U>
-   {
-      typedef Cont<U> type;
-   };
-
-#else //C++03 compilers
-
-   template <template <class> class Cont  //0arg
-      , typename V
-      , class U>
-      struct container_rebind<Cont<V>, U>
-   {
-      typedef Cont<U> type;
-   };
-
-   template <template <class, class> class Cont  //0arg
-      , typename V, typename A
-      , class U>
-      struct container_rebind<Cont<V, A>, U>
-   {
-      typedef Cont<U, typename allocator_traits<typename real_allocator<V, A>::type>::template portable_rebind_alloc<U>::type> type;
-   };
-
-   template <template <class, class, class> class Cont  //1arg
-      , typename V, typename A, class P0
-      , class U>
-      struct container_rebind<Cont<V, A, P0>, U>
-   {
-      typedef Cont<U, typename allocator_traits<typename real_allocator<V, A>::type>::template portable_rebind_alloc<U>::type, P0> type;
-   };
-
-   template <template <class, class, class, class> class Cont  //2arg
-      , typename V, typename A, class P0, class P1
-      , class U>
-      struct container_rebind<Cont<V, A, P0, P1>, U>
-   {
-      typedef Cont<U, typename allocator_traits<typename real_allocator<V, A>::type>::template portable_rebind_alloc<U>::type, P0, P1> type;
-   };
-
-   template <template <class, class, class, class, class> class Cont  //3arg
-      , typename V, typename A, class P0, class P1, class P2
-      , class U>
-      struct container_rebind<Cont<V, A, P0, P1, P2>, U>
-   {
-      typedef Cont<U, typename allocator_traits<typename real_allocator<V, A>::type>::template portable_rebind_alloc<U>::type, P0, P1, P2> type;
-   };
-
-   template <template <class, class, class, class, class, class> class Cont  //4arg
-      , typename V, typename A, class P0, class P1, class P2, class P3
-      , class U>
-      struct container_rebind<Cont<V, A, P0, P1, P2, P3>, U>
-   {
-      typedef Cont<U, typename allocator_traits<typename real_allocator<V, A>::type>::template portable_rebind_alloc<U>::type, P0, P1, P2, P3> type;
-   };
-
-   template <template <class, class, class, class, class, class, class> class Cont  //5arg
-      , typename V, typename A, class P0, class P1, class P2, class P3, class P4
-      , class U>
-      struct container_rebind<Cont<V, A, P0, P1, P2, P3, P4>, U>
-   {
-      typedef Cont<U, typename allocator_traits<typename real_allocator<V, A>::type>::template portable_rebind_alloc<U>::type, P0, P1, P2, P3, P4> type;
-   };
-
-   template <template <class, class, class, class, class, class, class, class> class Cont  //6arg
-      , typename V, typename A, class P0, class P1, class P2, class P3, class P4, class P5
-      , class U>
-      struct container_rebind<Cont<V, A, P0, P1, P2, P3, P4, P5>, U>
-   {
-      typedef Cont<U, typename allocator_traits<typename real_allocator<V, A>::type>::template portable_rebind_alloc<U>::type, P0, P1, P2, P3, P4, P5> type;
-   };
-
-   template <template <class, class, class, class, class, class, class, class, class> class Cont  //7arg
-      , typename V, typename A, class P0, class P1, class P2, class P3, class P4, class P5, class P6
-      , class U>
-      struct container_rebind<Cont<V, A, P0, P1, P2, P3, P4, P5, P6>, U>
-   {
-      typedef Cont<U, typename allocator_traits<typename real_allocator<V, A>::type>::template portable_rebind_alloc<U>::type, P0, P1, P2, P3, P4, P5, P6> type;
-   };
-
-   template <template <class, class, class, class, class, class, class, class, class, class> class Cont  //8arg
-      , typename V, typename A, class P0, class P1, class P2, class P3, class P4, class P5, class P6, class P7
-      , class U>
-      struct container_rebind<Cont<V, A, P0, P1, P2, P3, P4, P5, P6, P7>, U>
-   {
-      typedef Cont<U, typename allocator_traits<typename real_allocator<V, A>::type>::template portable_rebind_alloc<U>::type, P0, P1, P2, P3, P4, P5, P6, P7> type;
-   };
-
-   template <template <class, class, class, class, class, class, class, class, class, class, class> class Cont  //9arg
-      , typename V, typename A, class P0, class P1, class P2, class P3, class P4, class P5, class P6, class P7, class P8
-      , class U>
-      struct container_rebind<Cont<V, A, P0, P1, P2, P3, P4, P5, P6, P7, P8>, U>
-   {
-      typedef Cont<U, typename allocator_traits<typename real_allocator<V, A>::type>::template portable_rebind_alloc<U>::type, P0, P1, P2, P3, P4, P5, P6, P7, P8> type;
-   };
-
-#endif   //!defined(BOOST_NO_CXX11_VARIADIC_TEMPLATES)
-
-   //for small_vector,static_vector
-
-   template <typename V, std::size_t N, typename A, typename O, class U>
-   struct container_rebind<small_vector<V, N, A, O>, U>
-   {
-      typedef small_vector<U, N, typename allocator_traits<typename real_allocator<V, A>::type>::template portable_rebind_alloc<U>::type, O> type;
-   };
-
-   template <typename V, std::size_t N, typename O, class U>
-   struct container_rebind<static_vector<V, N, O>, U>
-   {
-      typedef static_vector<U, N, O> type;
-   };
-
-}  //namespace dtl {
-}  //namespace container {
-}  //namespace boost {
-
-#endif   //#ifndef BOOST_CONTAINER_DETAIL_CONTAINER_REBIND_HPP
diff --git a/src/boost/container/detail/copy_move_algo.hpp b/src/boost/container/detail/copy_move_algo.hpp
deleted file mode 100644
index 8729b307..00000000
--- a/src/boost/container/detail/copy_move_algo.hpp
+++ /dev/null
@@ -1,1982 +0,0 @@
-//////////////////////////////////////////////////////////////////////////////
-//
-// (C) Copyright Ion Gaztanaga 2005-2013. Distributed under the Boost
-// 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.
-//
-//////////////////////////////////////////////////////////////////////////////
-#ifndef BOOST_CONTAINER_DETAIL_COPY_MOVE_ALGO_HPP
-#define BOOST_CONTAINER_DETAIL_COPY_MOVE_ALGO_HPP
-
-#ifndef BOOST_CONFIG_HPP
-#  include <boost/config.hpp>
-#endif
-
-#if defined(BOOST_HAS_PRAGMA_ONCE)
-#  pragma once
-#endif
-
-// container
-#include <boost/container/allocator_traits.hpp>
-// container/detail
-#include <boost/container/detail/iterator.hpp>
-#include <boost/move/detail/iterator_to_raw_pointer.hpp>
-#include <boost/container/detail/mpl.hpp>
-#include <boost/container/detail/type_traits.hpp>
-#include <boost/container/detail/construct_in_place.hpp>
-#include <boost/container/detail/destroyers.hpp>
-
-// move
-#include <boost/move/adl_move_swap.hpp>
-#include <boost/move/iterator.hpp>
-#include <boost/move/utility_core.hpp>
-#include <boost/move/traits.hpp>
-// other
-#include <boost/assert.hpp>
-// std
-#include <cstring> //for memmove/memcpy
-
-#if defined(BOOST_GCC) && (BOOST_GCC >= 40600)
-#pragma GCC diagnostic push
-//pair memcpy optimizations rightfully detected by GCC
-#  if defined(BOOST_GCC) && (BOOST_GCC >= 80000)
-#     pragma GCC diagnostic ignored "-Wclass-memaccess"
-#  endif
-//GCC 8 seems a bit confused about array access error with static_vector
-//when out of bound exceptions are being thrown.
-#  if defined(BOOST_GCC) && (BOOST_GCC >= 80000) && (BOOST_GCC < 80200)
-#     pragma GCC diagnostic ignored "-Wstringop-overflow"
-#  endif
-#  pragma GCC diagnostic ignored "-Warray-bounds"
-#endif
-
-namespace boost {
-namespace container {
-namespace dtl {
-
-template<class I>
-struct are_elements_contiguous
-{
-   static const bool value = false;
-};
-
-/////////////////////////
-//    raw pointers
-/////////////////////////
-
-template<class T>
-struct are_elements_contiguous<T*>
-{
-   static const bool value = true;
-};
-
-/////////////////////////
-//    move iterators
-/////////////////////////
-
-template<class It>
-struct are_elements_contiguous< ::boost::move_iterator<It> >
-   : are_elements_contiguous<It>
-{};
-
-}  //namespace dtl {
-
-/////////////////////////
-//    predeclarations
-/////////////////////////
-
-template <class Pointer, bool IsConst>
-class vec_iterator;
-
-}  //namespace container {
-
-namespace interprocess {
-
-template <class PointedType, class DifferenceType, class OffsetType, std::size_t OffsetAlignment>
-class offset_ptr;
-
-}  //namespace interprocess {
-
-namespace container {
-
-namespace dtl {
-
-/////////////////////////
-//vector_[const_]iterator
-/////////////////////////
-
-template <class Pointer, bool IsConst>
-struct are_elements_contiguous<boost::container::vec_iterator<Pointer, IsConst> >
-{
-   static const bool value = true;
-};
-
-
-/////////////////////////
-//    offset_ptr
-/////////////////////////
-
-template <class PointedType, class DifferenceType, class OffsetType, std::size_t OffsetAlignment>
-struct are_elements_contiguous< ::boost::interprocess::offset_ptr<PointedType, DifferenceType, OffsetType, OffsetAlignment> >
-{
-   static const bool value = true;
-};
-
-template <typename I, typename O>
-struct are_contiguous_and_same
-   : boost::move_detail::and_
-      < are_elements_contiguous<I>
-      , are_elements_contiguous<O>
-      , is_same< typename remove_const< typename ::boost::container::iter_value<I>::type >::type
-               , typename ::boost::container::iterator_traits<O>::value_type
-               >
-      >
-{};
-
-template <typename I, typename O>
-struct is_memtransfer_copy_assignable
-   : boost::move_detail::and_
-      < are_contiguous_and_same<I, O>
-      , dtl::is_trivially_copy_assignable< typename ::boost::container::iter_value<I>::type >
-      >
-{};
-
-template <typename I, typename O>
-struct is_memtransfer_copy_constructible
-   : boost::move_detail::and_
-      < are_contiguous_and_same<I, O>
-      , dtl::is_trivially_copy_constructible< typename ::boost::container::iter_value<I>::type >
-      >
-{};
-
-template <typename I, typename O, typename R>
-struct enable_if_memtransfer_copy_constructible
-   : enable_if<dtl::is_memtransfer_copy_constructible<I, O>, R>
-{};
-
-template <typename I, typename O, typename R>
-struct disable_if_memtransfer_copy_constructible
-   : disable_if<dtl::is_memtransfer_copy_constructible<I, O>, R>
-{};
-
-template <typename I, typename O, typename R>
-struct enable_if_memtransfer_copy_assignable
-   : enable_if<dtl::is_memtransfer_copy_assignable<I, O>, R>
-{};
-
-template <typename I, typename O, typename R>
-struct disable_if_memtransfer_copy_assignable
-   : disable_if<dtl::is_memtransfer_copy_assignable<I, O>, R>
-{};
-
-template <class T>
-struct has_single_value
-{
-private:
-   struct two { char array_[2]; };
-   template<bool Arg> struct wrapper;
-   template <class U> static two test(int, ...);
-   template <class U> static char test(int, const wrapper<U::single_value>*);
-public:
-   static const bool value = sizeof(test<T>(0, 0)) == 1;
-   void dummy() {}
-};
-
-template<class InsertionProxy, bool = has_single_value<InsertionProxy>::value>
-struct is_single_value_proxy_impl
-{
-   static const bool value = InsertionProxy::single_value;
-};
-
-template<class InsertionProxy>
-struct is_single_value_proxy_impl<InsertionProxy, false>
-{
-   static const bool value = false;
-};
-
-template<class InsertionProxy>
-struct is_single_value_proxy
-   : is_single_value_proxy_impl<InsertionProxy>
-{};
-
-template <typename P, typename R = void>
-struct enable_if_single_value_proxy
-   : enable_if<is_single_value_proxy<P>, R>
-{};
-
-template <typename P, typename R = void>
-struct disable_if_single_value_proxy
-   : disable_if<is_single_value_proxy<P>, R>
-{};
-
-template
-   <typename I, // I models InputIterator
-    typename F> // F models ForwardIterator
-BOOST_CONTAINER_FORCEINLINE F memmove(I f, I l, F r) BOOST_NOEXCEPT_OR_NOTHROW
-{
-   typedef typename boost::container::iter_value<I>::type      value_type;
-   typedef typename boost::container::iterator_traits<F>::difference_type r_difference_type;
-   value_type *const dest_raw = boost::movelib::iterator_to_raw_pointer(r);
-   const value_type *const beg_raw = boost::movelib::iterator_to_raw_pointer(f);
-   const value_type *const end_raw = boost::movelib::iterator_to_raw_pointer(l);
-   if(BOOST_LIKELY(beg_raw != end_raw && dest_raw && beg_raw)){
-      const std::size_t n = std::size_t(end_raw - beg_raw)   ;
-      std::memmove(dest_raw, beg_raw, sizeof(value_type)*n);
-      r += static_cast<r_difference_type>(n);
-   }
-   return r;
-}
-
-template
-   <typename I, // I models InputIterator
-    typename F> // F models ForwardIterator
-BOOST_CONTAINER_FORCEINLINE F memmove_n(I f, std::size_t n, F r) BOOST_NOEXCEPT_OR_NOTHROW
-{
-   typedef typename boost::container::iter_value<I>::type value_type;
-   typedef typename boost::container::iterator_traits<F>::difference_type r_difference_type;
-   if(BOOST_LIKELY(n != 0)){
-      void *dst = boost::movelib::iterator_to_raw_pointer(r);
-      const void *src = boost::movelib::iterator_to_raw_pointer(f);
-      if (dst && src)
-         std::memmove(dst, src, sizeof(value_type)*n);
-      r += static_cast<r_difference_type>(n);
-   }
-
-   return r;
-}
-
-template
-   <typename I, // I models InputIterator
-    typename F> // F models ForwardIterator
-BOOST_CONTAINER_FORCEINLINE I memmove_n_source(I f, std::size_t n, F r) BOOST_NOEXCEPT_OR_NOTHROW
-{
-   if(BOOST_LIKELY(n != 0)){
-      typedef typename boost::container::iter_value<I>::type value_type;
-      typedef typename boost::container::iterator_traits<I>::difference_type i_difference_type;
-      void *dst = boost::movelib::iterator_to_raw_pointer(r);
-      const void *src = boost::movelib::iterator_to_raw_pointer(f);
-      if (dst && src)
-         std::memmove(dst, src, sizeof(value_type)*n);
-      f += static_cast<i_difference_type>(n);
-   }
-   return f;
-}
-
-template
-   <typename I, // I models InputIterator
-    typename F> // F models ForwardIterator
-BOOST_CONTAINER_FORCEINLINE I memmove_n_source_dest(I f, std::size_t n, F &r) BOOST_NOEXCEPT_OR_NOTHROW
-{
-   typedef typename boost::container::iter_value<I>::type value_type;
-   typedef typename boost::container::iterator_traits<F>::difference_type i_difference_type;
-   typedef typename boost::container::iterator_traits<F>::difference_type f_difference_type;
-
-   if(BOOST_LIKELY(n != 0)){
-      void *dst = boost::movelib::iterator_to_raw_pointer(r);
-      const void *src = boost::movelib::iterator_to_raw_pointer(f);
-      if (dst && src)
-         std::memmove(dst, src, sizeof(value_type)*n);
-      f += i_difference_type(n);
-      r += f_difference_type(n);
-   }
-   return f;
-}
-
-template <typename O>
-struct is_memzero_initializable
-{
-   typedef typename ::boost::container::iterator_traits<O>::value_type value_type;
-   static const bool value = are_elements_contiguous<O>::value &&
-      (  dtl::is_integral<value_type>::value || dtl::is_enum<value_type>::value
-      #if defined(BOOST_CONTAINER_MEMZEROED_POINTER_IS_NULL)
-      || dtl::is_pointer<value_type>::value
-      #endif
-      #if defined(BOOST_CONTAINER_MEMZEROED_FLOATING_POINT_IS_ZERO)
-      || dtl::is_floating_point<value_type>::value
-      #endif
-      );
-};
-
-template <typename O, typename R>
-struct enable_if_memzero_initializable
-   : enable_if_c<dtl::is_memzero_initializable<O>::value, R>
-{};
-
-template <typename O, typename R>
-struct disable_if_memzero_initializable
-   : enable_if_c<!dtl::is_memzero_initializable<O>::value, R>
-{};
-
-template <typename I, typename R>
-struct enable_if_trivially_destructible
-   : enable_if_c < dtl::is_trivially_destructible
-                  <typename boost::container::iter_value<I>::type>::value
-               , R>
-{};
-
-template <typename I, typename R>
-struct disable_if_trivially_destructible
-   : enable_if_c <!dtl::is_trivially_destructible
-                  <typename boost::container::iter_value<I>::type>::value
-               , R>
-{};
-
-}  //namespace dtl {
-
-//////////////////////////////////////////////////////////////////////////////
-//
-//                               uninitialized_move_alloc
-//
-//////////////////////////////////////////////////////////////////////////////
-
-
-//! <b>Effects</b>:
-//!   \code
-//!   for (; f != l; ++r, ++f)
-//!      allocator_traits::construct(a, &*r, boost::move(*f));
-//!   \endcode
-//!
-//! <b>Returns</b>: r
-template
-   <typename Allocator,
-    typename I, // I models InputIterator
-    typename F> // F models ForwardIterator
-inline typename dtl::disable_if_memtransfer_copy_constructible<I, F, F>::type
-   uninitialized_move_alloc(Allocator &a, I f, I l, F r)
-{
-   F back = r;
-   BOOST_CONTAINER_TRY{
-      while (f != l) {
-         allocator_traits<Allocator>::construct(a, boost::movelib::iterator_to_raw_pointer(r), boost::move(*f));
-         ++f; ++r;
-      }
-   }
-   BOOST_CONTAINER_CATCH(...){
-      for (; back != r; ++back){
-         allocator_traits<Allocator>::destroy(a, boost::movelib::iterator_to_raw_pointer(back));
-      }
-      BOOST_CONTAINER_RETHROW;
-   }
-   BOOST_CONTAINER_CATCH_END
-   return r;
-}
-
-template
-   <typename Allocator,
-    typename I, // I models InputIterator
-    typename F> // F models ForwardIterator
-BOOST_CONTAINER_FORCEINLINE typename dtl::enable_if_memtransfer_copy_constructible<I, F, F>::type
-   uninitialized_move_alloc(Allocator &, I f, I l, F r) BOOST_NOEXCEPT_OR_NOTHROW
-{  return dtl::memmove(f, l, r); }
-
-//////////////////////////////////////////////////////////////////////////////
-//
-//                               uninitialized_move_alloc_n
-//
-//////////////////////////////////////////////////////////////////////////////
-
-//! <b>Effects</b>:
-//!   \code
-//!   for (; n--; ++r, ++f)
-//!      allocator_traits::construct(a, &*r, boost::move(*f));
-//!   \endcode
-//!
-//! <b>Returns</b>: r
-template
-   <typename Allocator,
-    typename I, // I models InputIterator
-    typename F> // F models ForwardIterator
-inline typename dtl::disable_if_memtransfer_copy_constructible<I, F, F>::type
-   uninitialized_move_alloc_n(Allocator &a, I f, std::size_t n, F r)
-{
-   F back = r;
-   BOOST_CONTAINER_TRY{
-      while (n) {
-         --n;
-         allocator_traits<Allocator>::construct(a, boost::movelib::iterator_to_raw_pointer(r), boost::move(*f));
-         ++f; ++r;
-      }
-   }
-   BOOST_CONTAINER_CATCH(...){
-      for (; back != r; ++back){
-         allocator_traits<Allocator>::destroy(a, boost::movelib::iterator_to_raw_pointer(back));
-      }
-      BOOST_CONTAINER_RETHROW;
-   }
-   BOOST_CONTAINER_CATCH_END
-   return r;
-}
-
-template
-   <typename Allocator,
-    typename I, // I models InputIterator
-    typename F> // F models ForwardIterator
-BOOST_CONTAINER_FORCEINLINE typename dtl::enable_if_memtransfer_copy_constructible<I, F, F>::type
-   uninitialized_move_alloc_n(Allocator &, I f, std::size_t n, F r) BOOST_NOEXCEPT_OR_NOTHROW
-{  return dtl::memmove_n(f, n, r); }
-
-//////////////////////////////////////////////////////////////////////////////
-//
-//                               uninitialized_move_alloc_n_source
-//
-//////////////////////////////////////////////////////////////////////////////
-
-//! <b>Effects</b>:
-//!   \code
-//!   for (; n--; ++r, ++f)
-//!      allocator_traits::construct(a, &*r, boost::move(*f));
-//!   \endcode
-//!
-//! <b>Returns</b>: f (after incremented)
-template
-   <typename Allocator,
-    typename I, // I models InputIterator
-    typename F> // F models ForwardIterator
-inline typename dtl::disable_if_memtransfer_copy_constructible<I, F, I>::type
-   uninitialized_move_alloc_n_source(Allocator &a, I f, std::size_t n, F r)
-{
-   F back = r;
-   BOOST_CONTAINER_TRY{
-      while (n) {
-         --n;
-         allocator_traits<Allocator>::construct(a, boost::movelib::iterator_to_raw_pointer(r), boost::move(*f));
-         ++f; ++r;
-      }
-   }
-   BOOST_CONTAINER_CATCH(...){
-      for (; back != r; ++back){
-         allocator_traits<Allocator>::destroy(a, boost::movelib::iterator_to_raw_pointer(back));
-      }
-      BOOST_CONTAINER_RETHROW;
-   }
-   BOOST_CONTAINER_CATCH_END
-   return f;
-}
-
-template
-   <typename Allocator,
-    typename I, // I models InputIterator
-    typename F> // F models ForwardIterator
-BOOST_CONTAINER_FORCEINLINE typename dtl::enable_if_memtransfer_copy_constructible<I, F, I>::type
-   uninitialized_move_alloc_n_source(Allocator &, I f, std::size_t n, F r) BOOST_NOEXCEPT_OR_NOTHROW
-{  return dtl::memmove_n_source(f, n, r); }
-
-//////////////////////////////////////////////////////////////////////////////
-//
-//                               uninitialized_copy_alloc
-//
-//////////////////////////////////////////////////////////////////////////////
-
-//! <b>Effects</b>:
-//!   \code
-//!   for (; f != l; ++r, ++f)
-//!      allocator_traits::construct(a, &*r, *f);
-//!   \endcode
-//!
-//! <b>Returns</b>: r
-template
-   <typename Allocator,
-    typename I, // I models InputIterator
-    typename F> // F models ForwardIterator
-inline typename dtl::disable_if_memtransfer_copy_constructible<I, F, F>::type
-   uninitialized_copy_alloc(Allocator &a, I f, I l, F r)
-{
-   F back = r;
-   BOOST_CONTAINER_TRY{
-      while (f != l) {
-         allocator_traits<Allocator>::construct(a, boost::movelib::iterator_to_raw_pointer(r), *f);
-         ++f; ++r;
-      }
-   }
-   BOOST_CONTAINER_CATCH(...){
-      for (; back != r; ++back){
-         allocator_traits<Allocator>::destroy(a, boost::movelib::iterator_to_raw_pointer(back));
-      }
-      BOOST_CONTAINER_RETHROW;
-   }
-   BOOST_CONTAINER_CATCH_END
-   return r;
-}
-
-template
-   <typename Allocator,
-    typename I, // I models InputIterator
-    typename F> // F models ForwardIterator
-BOOST_CONTAINER_FORCEINLINE typename dtl::enable_if_memtransfer_copy_constructible<I, F, F>::type
-   uninitialized_copy_alloc(Allocator &, I f, I l, F r) BOOST_NOEXCEPT_OR_NOTHROW
-{  return dtl::memmove(f, l, r); }
-
-//////////////////////////////////////////////////////////////////////////////
-//
-//                               uninitialized_copy_alloc_n
-//
-//////////////////////////////////////////////////////////////////////////////
-
-//! <b>Effects</b>:
-//!   \code
-//!   for (; n--; ++r, ++f)
-//!      allocator_traits::construct(a, &*r, *f);
-//!   \endcode
-//!
-//! <b>Returns</b>: r
-template
-   <typename Allocator,
-    typename I, // I models InputIterator
-    typename F> // F models ForwardIterator
-inline typename dtl::disable_if_memtransfer_copy_constructible<I, F, F>::type
-   uninitialized_copy_alloc_n(Allocator &a, I f, std::size_t n, F r)
-{
-   F back = r;
-   BOOST_CONTAINER_TRY{
-      while (n) {
-         --n;
-         allocator_traits<Allocator>::construct(a, boost::movelib::iterator_to_raw_pointer(r), *f);
-         ++f; ++r;
-      }
-   }
-   BOOST_CONTAINER_CATCH(...){
-      for (; back != r; ++back){
-         allocator_traits<Allocator>::destroy(a, boost::movelib::iterator_to_raw_pointer(back));
-      }
-      BOOST_CONTAINER_RETHROW;
-   }
-   BOOST_CONTAINER_CATCH_END
-   return r;
-}
-
-template
-   <typename Allocator,
-    typename I, // I models InputIterator
-    typename F> // F models ForwardIterator
-BOOST_CONTAINER_FORCEINLINE typename dtl::enable_if_memtransfer_copy_constructible<I, F, F>::type
-   uninitialized_copy_alloc_n(Allocator &, I f, std::size_t n, F r) BOOST_NOEXCEPT_OR_NOTHROW
-{  return dtl::memmove_n(f, n, r); }
-
-//////////////////////////////////////////////////////////////////////////////
-//
-//                               uninitialized_copy_alloc_n_source
-//
-//////////////////////////////////////////////////////////////////////////////
-
-//! <b>Effects</b>:
-//!   \code
-//!   for (; n--; ++r, ++f)
-//!      allocator_traits::construct(a, &*r, *f);
-//!   \endcode
-//!
-//! <b>Returns</b>: f (after incremented)
-template
-   <typename Allocator,
-    typename I, // I models InputIterator
-    typename F> // F models ForwardIterator
-inline typename dtl::disable_if_memtransfer_copy_constructible<I, F, I>::type
-   uninitialized_copy_alloc_n_source(Allocator &a, I f, std::size_t n, F r)
-{
-   F back = r;
-   BOOST_CONTAINER_TRY{
-      while (n) {
-         boost::container::construct_in_place(a, boost::movelib::iterator_to_raw_pointer(r), f);
-         ++f; ++r; --n;
-      }
-   }
-   BOOST_CONTAINER_CATCH(...){
-      for (; back != r; ++back){
-         allocator_traits<Allocator>::destroy(a, boost::movelib::iterator_to_raw_pointer(back));
-      }
-      BOOST_CONTAINER_RETHROW;
-   }
-   BOOST_CONTAINER_CATCH_END
-   return f;
-}
-
-template
-   <typename Allocator,
-    typename I, // I models InputIterator
-    typename F> // F models ForwardIterator
-BOOST_CONTAINER_FORCEINLINE typename dtl::enable_if_memtransfer_copy_constructible<I, F, I>::type
-   uninitialized_copy_alloc_n_source(Allocator &, I f, std::size_t n, F r) BOOST_NOEXCEPT_OR_NOTHROW
-{  return dtl::memmove_n_source(f, n, r); }
-
-//////////////////////////////////////////////////////////////////////////////
-//
-//                               uninitialized_value_init_alloc_n
-//
-//////////////////////////////////////////////////////////////////////////////
-
-//! <b>Effects</b>:
-//!   \code
-//!   for (; n--; ++r, ++f)
-//!      allocator_traits::construct(a, &*r);
-//!   \endcode
-//!
-//! <b>Returns</b>: r
-template
-   <typename Allocator,
-    typename F> // F models ForwardIterator
-inline typename dtl::disable_if_memzero_initializable<F, F>::type
-   uninitialized_value_init_alloc_n(Allocator &a, std::size_t n, F r)
-{
-   F back = r;
-   BOOST_CONTAINER_TRY{
-      while (n) {
-         --n;
-         allocator_traits<Allocator>::construct(a, boost::movelib::iterator_to_raw_pointer(r));
-         ++r;
-      }
-   }
-   BOOST_CONTAINER_CATCH(...){
-      for (; back != r; ++back){
-         allocator_traits<Allocator>::destroy(a, boost::movelib::iterator_to_raw_pointer(back));
-      }
-      BOOST_CONTAINER_RETHROW;
-   }
-   BOOST_CONTAINER_CATCH_END
-   return r;
-}
-
-template
-   <typename Allocator,
-    typename F> // F models ForwardIterator
-BOOST_CONTAINER_FORCEINLINE typename dtl::enable_if_memzero_initializable<F, F>::type
-   uninitialized_value_init_alloc_n(Allocator &, std::size_t n, F r)
-{
-   typedef typename boost::container::iterator_traits<F>::value_type value_type;
-   typedef typename boost::container::iterator_traits<F>::difference_type r_difference_type;
-
-   if (BOOST_LIKELY(n != 0)){
-      std::memset((void*)boost::movelib::iterator_to_raw_pointer(r), 0, sizeof(value_type)*n);
-      r += static_cast<r_difference_type>(n);
-   }
-   return r;
-}
-
-//////////////////////////////////////////////////////////////////////////////
-//
-//                               uninitialized_default_init_alloc_n
-//
-//////////////////////////////////////////////////////////////////////////////
-
-//! <b>Effects</b>:
-//!   \code
-//!   for (; n--; ++r, ++f)
-//!      allocator_traits::construct(a, &*r);
-//!   \endcode
-//!
-//! <b>Returns</b>: r
-template
-   <typename Allocator,
-    typename F> // F models ForwardIterator
-inline F uninitialized_default_init_alloc_n(Allocator &a, std::size_t n, F r)
-{
-   F back = r;
-   BOOST_CONTAINER_TRY{
-      while (n) {
-         --n;
-         allocator_traits<Allocator>::construct(a, boost::movelib::iterator_to_raw_pointer(r), default_init);
-         ++r;
-      }
-   }
-   BOOST_CONTAINER_CATCH(...){
-      for (; back != r; ++back){
-         allocator_traits<Allocator>::destroy(a, boost::movelib::iterator_to_raw_pointer(back));
-      }
-      BOOST_CONTAINER_RETHROW;
-   }
-   BOOST_CONTAINER_CATCH_END
-   return r;
-}
-
-//////////////////////////////////////////////////////////////////////////////
-//
-//                               uninitialized_fill_alloc
-//
-//////////////////////////////////////////////////////////////////////////////
-
-//! <b>Effects</b>:
-//!   \code
-//!   for (; f != l; ++r, ++f)
-//!      allocator_traits::construct(a, &*r, *f);
-//!   \endcode
-//!
-//! <b>Returns</b>: r
-template
-   <typename Allocator,
-    typename F, // F models ForwardIterator
-    typename T>
-inline void uninitialized_fill_alloc(Allocator &a, F f, F l, const T &t)
-{
-   F back = f;
-   BOOST_CONTAINER_TRY{
-      while (f != l) {
-         allocator_traits<Allocator>::construct(a, boost::movelib::iterator_to_raw_pointer(f), t);
-         ++f;
-      }
-   }
-   BOOST_CONTAINER_CATCH(...){
-      for (; back != l; ++back){
-         allocator_traits<Allocator>::destroy(a, boost::movelib::iterator_to_raw_pointer(back));
-      }
-      BOOST_CONTAINER_RETHROW;
-   }
-   BOOST_CONTAINER_CATCH_END
-}
-
-
-//////////////////////////////////////////////////////////////////////////////
-//
-//                               uninitialized_fill_alloc_n
-//
-//////////////////////////////////////////////////////////////////////////////
-
-//! <b>Effects</b>:
-//!   \code
-//!   for (; n--; ++r, ++f)
-//!      allocator_traits::construct(a, &*r, v);
-//!   \endcode
-//!
-//! <b>Returns</b>: r
-template
-   <typename Allocator,
-    typename T,
-    typename F> // F models ForwardIterator
-inline F uninitialized_fill_alloc_n(Allocator &a, const T &v, std::size_t n, F r)
-{
-   F back = r;
-   BOOST_CONTAINER_TRY{
-      while (n) {
-         --n;
-         allocator_traits<Allocator>::construct(a, boost::movelib::iterator_to_raw_pointer(r), v);
-         ++r;
-      }
-   }
-   BOOST_CONTAINER_CATCH(...){
-      for (; back != r; ++back){
-         allocator_traits<Allocator>::destroy(a, boost::movelib::iterator_to_raw_pointer(back));
-      }
-      BOOST_CONTAINER_RETHROW;
-   }
-   BOOST_CONTAINER_CATCH_END
-   return r;
-}
-
-//////////////////////////////////////////////////////////////////////////////
-//
-//                               copy
-//
-//////////////////////////////////////////////////////////////////////////////
-
-template
-<typename I,   // I models InputIterator
-typename F>    // F models ForwardIterator
-inline typename dtl::disable_if_memtransfer_copy_assignable<I, F, F>::type
-   copy(I f, I l, F r)
-{
-   while (f != l) {
-      *r = *f;
-      ++f; ++r;
-   }
-   return r;
-}
-
-template
-<typename I,   // I models InputIterator
-typename F>    // F models ForwardIterator
-inline typename dtl::enable_if_memtransfer_copy_assignable<I, F, F>::type
-   copy(I f, I l, F r) BOOST_NOEXCEPT_OR_NOTHROW
-{  return dtl::memmove(f, l, r); }
-
-//////////////////////////////////////////////////////////////////////////////
-//
-//                               copy_n
-//
-//////////////////////////////////////////////////////////////////////////////
-
-template
-<typename I,   // I models InputIterator
-typename U,   // U models unsigned integral constant
-typename F>   // F models ForwardIterator
-inline typename dtl::disable_if_memtransfer_copy_assignable<I, F, F>::type
-   copy_n(I f, U n, F r)
-{
-   while (n) {
-      --n;
-      *r = *f;
-      ++f; ++r;
-   }
-   return r;
-}
-
-template
-<typename I,   // I models InputIterator
-typename U,   // U models unsigned integral constant
-typename F>   // F models ForwardIterator
-BOOST_CONTAINER_FORCEINLINE typename dtl::enable_if_memtransfer_copy_assignable<I, F, F>::type
-   copy_n(I f, U n, F r) BOOST_NOEXCEPT_OR_NOTHROW
-{  return dtl::memmove_n(f, n, r); }
-
-//////////////////////////////////////////////////////////////////////////////
-//
-//                            copy_n_source
-//
-//////////////////////////////////////////////////////////////////////////////
-
-template
-<typename I,   // I models InputIterator
-typename U,   // U models unsigned integral constant
-typename F>   // F models ForwardIterator
-inline typename dtl::disable_if_memtransfer_copy_assignable<I, F, I>::type
-   copy_n_source(I f, U n, F r)
-{
-   while (n) {
-      --n;
-      boost::container::assign_in_place(r, f);
-      ++f; ++r;
-   }
-   return f;
-}
-
-template
-<typename I,   // I models InputIterator
-typename F>   // F models ForwardIterator
-BOOST_CONTAINER_FORCEINLINE typename dtl::enable_if_memtransfer_copy_assignable<I, F, I>::type
-   copy_n_source(I f, std::size_t n, F r) BOOST_NOEXCEPT_OR_NOTHROW
-{  return dtl::memmove_n_source(f, n, r); }
-
-//////////////////////////////////////////////////////////////////////////////
-//
-//                            copy_n_source_dest
-//
-//////////////////////////////////////////////////////////////////////////////
-
-template
-<typename I,   // I models InputIterator
-typename F>   // F models ForwardIterator
-inline typename dtl::disable_if_memtransfer_copy_assignable<I, F, I>::type
-   copy_n_source_dest(I f, std::size_t n, F &r)
-{
-   while (n) {
-      --n;
-      *r = *f;
-      ++f; ++r;
-   }
-   return f;
-}
-
-template
-<typename I,   // I models InputIterator
-typename F>   // F models ForwardIterator
-BOOST_CONTAINER_FORCEINLINE typename dtl::enable_if_memtransfer_copy_assignable<I, F, I>::type
-   copy_n_source_dest(I f, std::size_t n, F &r) BOOST_NOEXCEPT_OR_NOTHROW
-{  return dtl::memmove_n_source_dest(f, n, r);  }
-
-//////////////////////////////////////////////////////////////////////////////
-//
-//                         move
-//
-//////////////////////////////////////////////////////////////////////////////
-
-template
-<typename I,   // I models InputIterator
-typename F>   // F models ForwardIterator
-inline typename dtl::disable_if_memtransfer_copy_assignable<I, F, F>::type
-   move(I f, I l, F r)
-{
-   while (f != l) {
-      *r = ::boost::move(*f);
-      ++f; ++r;
-   }
-   return r;
-}
-
-template
-<typename I,   // I models InputIterator
-typename F>   // F models ForwardIterator
-inline typename dtl::enable_if_memtransfer_copy_assignable<I, F, F>::type
-   move(I f, I l, F r) BOOST_NOEXCEPT_OR_NOTHROW
-{  return dtl::memmove(f, l, r); }
-
-//////////////////////////////////////////////////////////////////////////////
-//
-//                         move_n
-//
-//////////////////////////////////////////////////////////////////////////////
-
-template
-<typename I,   // I models InputIterator
-typename U,   // U models unsigned integral constant
-typename F>   // F models ForwardIterator
-inline typename dtl::disable_if_memtransfer_copy_assignable<I, F, F>::type
-   move_n(I f, U n, F r)
-{
-   while (n) {
-      --n;
-      *r = ::boost::move(*f);
-      ++f; ++r;
-   }
-   return r;
-}
-
-template
-<typename I,   // I models InputIterator
-typename U,   // U models unsigned integral constant
-typename F>   // F models ForwardIterator
-BOOST_CONTAINER_FORCEINLINE typename dtl::enable_if_memtransfer_copy_assignable<I, F, F>::type
-   move_n(I f, U n, F r) BOOST_NOEXCEPT_OR_NOTHROW
-{  return dtl::memmove_n(f, n, r); }
-
-
-//////////////////////////////////////////////////////////////////////////////
-//
-//                         move_backward
-//
-//////////////////////////////////////////////////////////////////////////////
-
-template
-<typename I,   // I models BidirectionalIterator
-typename F>    // F models ForwardIterator
-inline typename dtl::disable_if_memtransfer_copy_assignable<I, F, F>::type
-   move_backward(I f, I l, F r)
-{
-   while (f != l) {
-      --l; --r;
-      *r = ::boost::move(*l);
-   }
-   return r;
-}
-
-template
-<typename I,   // I models InputIterator
-typename F>   // F models ForwardIterator
-BOOST_CONTAINER_FORCEINLINE typename dtl::enable_if_memtransfer_copy_assignable<I, F, F>::type
-   move_backward(I f, I l, F r) BOOST_NOEXCEPT_OR_NOTHROW
-{
-   typedef typename boost::container::iter_value<I>::type value_type;
-   const std::size_t n = boost::container::iterator_udistance(f, l);
-   if (BOOST_LIKELY(n != 0)){
-      r -= n;
-      std::memmove((boost::movelib::iterator_to_raw_pointer)(r), (boost::movelib::iterator_to_raw_pointer)(f), sizeof(value_type)*n);
-   }
-   return r;
-}
-
-//////////////////////////////////////////////////////////////////////////////
-//
-//                         move_n_source_dest
-//
-//////////////////////////////////////////////////////////////////////////////
-
-template
-<typename I    // I models InputIterator
-,typename U    // U models unsigned integral constant
-,typename F>   // F models ForwardIterator
-inline typename dtl::disable_if_memtransfer_copy_assignable<I, F, I>::type
-   move_n_source_dest(I f, U n, F &r)
-{
-   while (n) {
-      --n;
-      *r = ::boost::move(*f);
-      ++f; ++r;
-   }
-   return f;
-}
-
-template
-<typename I    // I models InputIterator
-,typename F>   // F models ForwardIterator
-BOOST_CONTAINER_FORCEINLINE typename dtl::enable_if_memtransfer_copy_assignable<I, F, I>::type
-   move_n_source_dest(I f, std::size_t n, F &r) BOOST_NOEXCEPT_OR_NOTHROW
-{  return dtl::memmove_n_source_dest(f, n, r); }
-
-//////////////////////////////////////////////////////////////////////////////
-//
-//                         move_n_source
-//
-//////////////////////////////////////////////////////////////////////////////
-
-template
-<typename I    // I models InputIterator
-,typename U    // U models unsigned integral constant
-,typename F>   // F models ForwardIterator
-inline typename dtl::disable_if_memtransfer_copy_assignable<I, F, I>::type
-   move_n_source(I f, U n, F r)
-{
-   while (n) {
-      --n;
-      *r = ::boost::move(*f);
-      ++f; ++r;
-   }
-   return f;
-}
-
-template
-<typename I    // I models InputIterator
-,typename F>   // F models ForwardIterator
-BOOST_CONTAINER_FORCEINLINE typename dtl::enable_if_memtransfer_copy_assignable<I, F, I>::type
-   move_n_source(I f, std::size_t n, F r) BOOST_NOEXCEPT_OR_NOTHROW
-{  return dtl::memmove_n_source(f, n, r); }
-
-template<typename F>   // F models ForwardIterator
-BOOST_CONTAINER_FORCEINLINE F move_forward_overlapping(F f, F l, F r)
-{
-   return (f != r) ? (move)(f, l, r) : l;
-}
-
-template<typename B>   // B models BidirIterator
-BOOST_CONTAINER_FORCEINLINE B move_backward_overlapping(B f, B l, B rl)
-{
-   return (l != rl) ? (move_backward)(f, l, rl) : f;
-}
-
-
-//////////////////////////////////////////////////////////////////////////////
-//
-//                               destroy_alloc_n
-//
-//////////////////////////////////////////////////////////////////////////////
-
-template
-   <typename Allocator
-   ,typename I   // I models InputIterator
-   ,typename U>  // U models unsigned integral constant
-inline typename dtl::disable_if_trivially_destructible<I, void>::type
-   destroy_alloc_n(Allocator &a, I f, U n)
-{
-   while(n){
-      --n;
-      allocator_traits<Allocator>::destroy(a, boost::movelib::iterator_to_raw_pointer(f));
-      ++f;
-   }
-}
-
-template
-   <typename Allocator
-   ,typename I   // I models InputIterator
-   ,typename U>  // U models unsigned integral constant
-BOOST_CONTAINER_FORCEINLINE typename dtl::enable_if_trivially_destructible<I, void>::type
-   destroy_alloc_n(Allocator &, I, U)
-{}
-
-//////////////////////////////////////////////////////////////////////////////
-//
-//                               destroy_alloc
-//
-//////////////////////////////////////////////////////////////////////////////
-
-template
-   <typename Allocator
-   ,typename I>   // I models InputIterator
-inline typename dtl::disable_if_trivially_destructible<I, void>::type
-   destroy_alloc(Allocator &a, I f, I l)
-{
-   while(f != l){
-      allocator_traits<Allocator>::destroy(a, boost::movelib::iterator_to_raw_pointer(f));
-      ++f;
-   }
-}
-
-template
-   <typename Allocator
-   ,typename I >  // I models InputIterator
-BOOST_CONTAINER_FORCEINLINE typename dtl::enable_if_trivially_destructible<I, void>::type
-   destroy_alloc(Allocator &, I, I)
-{}
-
-//////////////////////////////////////////////////////////////////////////////
-//
-//                         deep_swap_alloc_n
-//
-//////////////////////////////////////////////////////////////////////////////
-
-template
-   <std::size_t MaxTmpBytes
-   ,typename Allocator
-   ,typename F // F models ForwardIterator
-   ,typename G // G models ForwardIterator
-   >
-inline typename dtl::disable_if_memtransfer_copy_assignable<F, G, void>::type
-   deep_swap_alloc_n( Allocator &a, F short_range_f, std::size_t  n_i, G large_range_f, std::size_t n_j)
-{
-   std::size_t n = 0;
-   for (; n != n_i ; ++short_range_f, ++large_range_f, ++n){
-      boost::adl_move_swap(*short_range_f, *large_range_f);
-   }
-   boost::container::uninitialized_move_alloc_n(a, large_range_f, std::size_t(n_j - n_i), short_range_f);  // may throw
-   boost::container::destroy_alloc_n(a, large_range_f, std::size_t(n_j - n_i));
-}
-
-static const std::size_t DeepSwapAllocNMaxStorage = std::size_t(1) << std::size_t(11); //2K bytes
-
-template
-   <std::size_t MaxTmpBytes
-   ,typename Allocator
-   ,typename F // F models ForwardIterator
-   ,typename G // G models ForwardIterator
-   >
-inline typename dtl::enable_if_c
-   < dtl::is_memtransfer_copy_assignable<F, G>::value && (MaxTmpBytes <= DeepSwapAllocNMaxStorage) && false
-   , void>::type
-   deep_swap_alloc_n( Allocator &a, F short_range_f, std::size_t n_i, G large_range_f, std::size_t n_j)
-{
-   typedef typename allocator_traits<Allocator>::value_type value_type;
-   typedef typename dtl::aligned_storage
-      <MaxTmpBytes, dtl::alignment_of<value_type>::value>::type storage_type;
-   storage_type storage;
-
-   const std::size_t n_i_bytes = sizeof(value_type)*n_i;
-   void *const large_ptr = static_cast<void*>(boost::movelib::iterator_to_raw_pointer(large_range_f));
-   void *const short_ptr = static_cast<void*>(boost::movelib::iterator_to_raw_pointer(short_range_f));
-   void *const stora_ptr = static_cast<void*>(boost::movelib::iterator_to_raw_pointer(storage.data));
-   std::memcpy(stora_ptr, large_ptr, n_i_bytes);
-   std::memcpy(large_ptr, short_ptr, n_i_bytes);
-   std::memcpy(short_ptr, stora_ptr, n_i_bytes);
-   boost::container::iterator_uadvance(large_range_f, n_i);
-   boost::container::iterator_uadvance(short_range_f, n_i);
-   boost::container::uninitialized_move_alloc_n(a, large_range_f, std::size_t(n_j - n_i), short_range_f);  // may throw
-   boost::container::destroy_alloc_n(a, large_range_f, std::size_t(n_j - n_i));
-}
-
-template
-   <std::size_t MaxTmpBytes
-   ,typename Allocator
-   ,typename F // F models ForwardIterator
-   ,typename G // G models ForwardIterator
-   >
-inline typename dtl::enable_if_c
-   < dtl::is_memtransfer_copy_assignable<F, G>::value && true//(MaxTmpBytes > DeepSwapAllocNMaxStorage)
-   , void>::type
-   deep_swap_alloc_n( Allocator &a, F short_range_f, std::size_t n_i, G large_range_f, std::size_t n_j)
-{
-   typedef typename allocator_traits<Allocator>::value_type value_type;
-   typedef typename dtl::aligned_storage
-      <DeepSwapAllocNMaxStorage, dtl::alignment_of<value_type>::value>::type storage_type;
-   storage_type storage;
-   const std::size_t sizeof_storage = sizeof(storage);
-
-   std::size_t n_i_bytes = sizeof(value_type)*n_i;
-   char *large_ptr = static_cast<char*>(static_cast<void*>(boost::movelib::iterator_to_raw_pointer(large_range_f)));
-   char *short_ptr = static_cast<char*>(static_cast<void*>(boost::movelib::iterator_to_raw_pointer(short_range_f)));
-   char *stora_ptr = static_cast<char*>(static_cast<void*>(storage.data));
-
-   std::size_t szt_times = n_i_bytes/sizeof_storage;
-   const std::size_t szt_rem = n_i_bytes%sizeof_storage;
-
-   //Loop unrolling using Duff's device, as it seems it helps on some architectures
-   const std::size_t Unroll = 4;
-   std::size_t n = (szt_times + (Unroll-1))/Unroll;
-   const std::size_t branch_number = (szt_times == 0)*Unroll + (szt_times % Unroll);
-   switch(branch_number){
-      case 4:
-         break;
-      case 0: do{
-         std::memcpy(stora_ptr, large_ptr, sizeof_storage);
-         std::memcpy(large_ptr, short_ptr, sizeof_storage);
-         std::memcpy(short_ptr, stora_ptr, sizeof_storage);
-         large_ptr += sizeof_storage;
-         short_ptr += sizeof_storage;
-         BOOST_FALLTHROUGH;
-      case 3:
-         std::memcpy(stora_ptr, large_ptr, sizeof_storage);
-         std::memcpy(large_ptr, short_ptr, sizeof_storage);
-         std::memcpy(short_ptr, stora_ptr, sizeof_storage);
-         large_ptr += sizeof_storage;
-         short_ptr += sizeof_storage;
-         BOOST_FALLTHROUGH;
-      case 2:
-         std::memcpy(stora_ptr, large_ptr, sizeof_storage);
-         std::memcpy(large_ptr, short_ptr, sizeof_storage);
-         std::memcpy(short_ptr, stora_ptr, sizeof_storage);
-         large_ptr += sizeof_storage;
-         short_ptr += sizeof_storage;
-         BOOST_FALLTHROUGH;
-      case 1:
-         std::memcpy(stora_ptr, large_ptr, sizeof_storage);
-         std::memcpy(large_ptr, short_ptr, sizeof_storage);
-         std::memcpy(short_ptr, stora_ptr, sizeof_storage);
-         large_ptr += sizeof_storage;
-         short_ptr += sizeof_storage;
-         } while(--n);
-   }
-   std::memcpy(stora_ptr, large_ptr, szt_rem);
-   std::memcpy(large_ptr, short_ptr, szt_rem);
-   std::memcpy(short_ptr, stora_ptr, szt_rem);
-   boost::container::iterator_uadvance(large_range_f, n_i);
-   boost::container::iterator_uadvance(short_range_f, n_i);
-   boost::container::uninitialized_move_alloc_n(a, large_range_f, std::size_t(n_j - n_i), short_range_f);  // may throw
-   boost::container::destroy_alloc_n(a, large_range_f, std::size_t(n_j - n_i));
-}
-
-
-//////////////////////////////////////////////////////////////////////////////
-//
-//                         copy_assign_range_alloc_n
-//
-//////////////////////////////////////////////////////////////////////////////
-
-template
-   <typename Allocator
-   ,typename I // F models InputIterator
-   ,typename O // G models OutputIterator
-   >
-void copy_assign_range_alloc_n( Allocator &a, I inp_start, std::size_t n_i, O out_start, std::size_t n_o )
-{
-   if (n_o < n_i){
-      inp_start = boost::container::copy_n_source_dest(inp_start, n_o, out_start);     // may throw
-      boost::container::uninitialized_copy_alloc_n(a, inp_start, std::size_t(n_i - n_o), out_start);// may throw
-   }
-   else{
-      out_start = boost::container::copy_n(inp_start, n_i, out_start);  // may throw
-      boost::container::destroy_alloc_n(a, out_start, std::size_t(n_o - n_i));
-   }
-}
-
-//////////////////////////////////////////////////////////////////////////////
-//
-//                         move_assign_range_alloc_n
-//
-//////////////////////////////////////////////////////////////////////////////
-
-template
-   <typename Allocator
-   ,typename I // F models InputIterator
-   ,typename O // G models OutputIterator
-   >
-void move_assign_range_alloc_n( Allocator &a, I inp_start, std::size_t n_i, O out_start, std::size_t n_o )
-{
-   if (n_o < n_i){
-      inp_start = boost::container::move_n_source_dest(inp_start, n_o, out_start);  // may throw
-      boost::container::uninitialized_move_alloc_n(a, inp_start, std::size_t(n_i - n_o), out_start);  // may throw
-   }
-   else{
-      out_start = boost::container::move_n(inp_start, n_i, out_start);  // may throw
-      boost::container::destroy_alloc_n(a, out_start, std::size_t(n_o - n_i));
-   }
-}
-
-template<class Allocator>
-struct array_destructor
-{
-   typedef typename ::boost::container::allocator_traits<Allocator>::value_type value_type;
-   typedef typename dtl::if_c
-      <dtl::is_trivially_destructible<value_type>::value
-      ,dtl::null_scoped_destructor_range<Allocator>
-      ,dtl::scoped_destructor_range<Allocator>
-      >::type type;
-};
-
-template<class Allocator>
-struct value_destructor
-{
-   typedef typename ::boost::container::allocator_traits<Allocator>::value_type value_type;
-   typedef typename dtl::if_c
-      <dtl::is_trivially_destructible<value_type>::value
-      , dtl::null_scoped_destructor<Allocator>
-      , dtl::scoped_destructor<Allocator>
-      >::type type;
-};
-
-template
-   <typename Allocator
-   ,typename F // F models ForwardIterator
-   ,typename O // G models OutputIterator
-   ,typename InsertionProxy
-   >
-void uninitialized_move_and_insert_alloc
-   ( Allocator &a
-   , F first
-   , F pos
-   , F last
-   , O d_first
-   , std::size_t n
-   , InsertionProxy insertion_proxy)
-{
-   typedef typename array_destructor<Allocator>::type array_destructor_t;
-
-   //Anti-exception rollbacks
-   array_destructor_t new_values_destroyer(d_first, d_first, a);
-
-   //Initialize with [begin(), pos) old buffer
-   //the start of the new buffer
-   O d_last = ::boost::container::uninitialized_move_alloc(a, first, pos, d_first);
-   new_values_destroyer.set_end(d_last);
-   //Initialize new objects, starting from previous point
-   insertion_proxy.uninitialized_copy_n_and_update(a, d_last, n);
-   d_last += n;
-   new_values_destroyer.set_end(d_last);
-   //Initialize from the rest of the old buffer,
-   //starting from previous point
-   (void) ::boost::container::uninitialized_move_alloc(a, pos, last, d_last);
-   //All construction successful, disable rollbacks
-   new_values_destroyer.release();
-}
-
-
-
-
-template
-   <typename Allocator
-   ,typename F // F models ForwardIterator
-   ,typename InsertionProxy
-   >
-typename dtl::enable_if_c<dtl::is_single_value_proxy<InsertionProxy>::value, void>::type
-   expand_backward_and_insert_nonempty_middle_alloc
-   ( Allocator &a
-   , F const first
-   , F const pos
-   , std::size_t const
-   , InsertionProxy insertion_proxy)
-{
-   BOOST_ASSERT(first != pos);
- 
-   typedef typename value_destructor<Allocator>::type value_destructor_t;
-   F aux = first;   --aux;
-   allocator_traits<Allocator>::construct(a, boost::movelib::iterator_to_raw_pointer(aux), boost::move(*first));
-   value_destructor_t on_exception(a, boost::movelib::iterator_to_raw_pointer(aux));
-   //Copy previous to last objects to the initialized end
-   aux = first; ++aux;
-   aux = boost::container::move(aux, pos, first);
-   //Insert new objects in the pos
-   insertion_proxy.copy_n_and_update(a, aux, 1u);
-   on_exception.release();
-}
-
-template
-   <typename Allocator
-   ,typename F // F models ForwardIterator
-   ,typename InsertionProxy
-   >
-typename dtl::disable_if_c<dtl::is_single_value_proxy<InsertionProxy>::value, void>::type
-   expand_backward_and_insert_nonempty_middle_alloc
-   ( Allocator &a
-   , F first
-   , F pos
-   , std::size_t const n
-   , InsertionProxy insertion_proxy)
-{
-   BOOST_ASSERT(first != pos);
-   BOOST_ASSERT(n != 0);
-
-   typedef typename array_destructor<Allocator>::type array_destructor_t;
-   const std::size_t elems_before = iterator_udistance(first, pos);
-   if(elems_before >= n){
-      //New elements can be just copied.
-      //Move to uninitialized memory last objects
-      F const first_less_n = first - n;
-      F nxt = ::boost::container::uninitialized_move_alloc_n_source(a, first, n, first_less_n);
-      array_destructor_t on_exception(first_less_n, first, a);
-      //Copy previous to last objects to the initialized end
-      nxt = boost::container::move(nxt, pos, first);
-      //Insert new objects in the pos
-      insertion_proxy.copy_n_and_update(a, nxt, n);
-      on_exception.release();
-   }
-   else {
-      //The new elements don't fit in the [pos, end()) range.
-      //Copy old [pos, end()) elements to the uninitialized memory (a gap is created)
-      F aux = ::boost::container::uninitialized_move_alloc(a, first, pos, first - n);
-      array_destructor_t on_exception(first -n, aux, a);
-      //Copy to the beginning of the unallocated zone the last new elements (the gap is closed).
-      insertion_proxy.uninitialized_copy_n_and_update(a, aux, std::size_t(n - elems_before));
-      insertion_proxy.copy_n_and_update(a, first, elems_before);
-      on_exception.release();
-   }
-}
-
-
-template
-   <typename Allocator
-   ,typename F // F models ForwardIterator
-   ,typename InsertionProxy
-   >
-typename dtl::enable_if_c<dtl::is_single_value_proxy<InsertionProxy>::value, void>::type
-   expand_forward_and_insert_nonempty_middle_alloc
-   ( Allocator &a
-   , F pos
-   , F last
-   , std::size_t const
-   , InsertionProxy insertion_proxy)
-{
-   BOOST_ASSERT(last != pos);
- 
-   typedef typename value_destructor<Allocator>::type value_destructor_t;
-   F last_m_n = last;   --last_m_n;
-   allocator_traits<Allocator>::construct(a, boost::movelib::iterator_to_raw_pointer(last), boost::move(*last_m_n));
-   value_destructor_t on_exception(a, boost::movelib::iterator_to_raw_pointer(last));
-   //Copy previous to last objects to the initialized end
-   boost::container::move_backward(pos, last_m_n, last);
-   //Insert new objects in the pos
-   insertion_proxy.copy_n_and_update(a, pos, 1);
-   on_exception.release();
-}
-
-template
-   <typename Allocator
-   ,typename F // F models ForwardIterator
-   ,typename InsertionProxy
-   >
-typename dtl::disable_if_c<dtl::is_single_value_proxy<InsertionProxy>::value, void>::type
-   expand_forward_and_insert_nonempty_middle_alloc
-   ( Allocator &a
-   , F pos
-   , F last
-   , std::size_t const n
-   , InsertionProxy insertion_proxy)
-{
-   BOOST_ASSERT(last != pos);
-   BOOST_ASSERT(n != 0);
-
-   typedef typename array_destructor<Allocator>::type array_destructor_t;
-   const std::size_t elems_after = iterator_udistance(pos, last);
-   if(elems_after >= n){
-      //New elements can be just copied.
-      //Move to uninitialized memory last objects
-      F const last_m_n = last - n;
-      F const nxt = ::boost::container::uninitialized_move_alloc_n(a, last_m_n, n, last);
-      array_destructor_t on_exception(last, nxt, a);
-      //Copy previous to last objects to the initialized end
-      boost::container::move_backward(pos, last_m_n, last);
-      //Insert new objects in the pos
-      insertion_proxy.copy_n_and_update(a, pos, n);
-      on_exception.release();
-   }
-   else {
-      //The new elements don't fit in the [pos, end()) range.
-      //Copy old [pos, end()) elements to the uninitialized memory (a gap is created)
-      F new_last = ::boost::container::uninitialized_move_alloc(a, pos, last, pos + n);
-      array_destructor_t on_exception(pos + n, new_last, a);
-      //Copy first new elements in pos (gap is still there)
-      insertion_proxy.copy_n_and_update(a, pos, elems_after);
-      //Copy to the beginning of the unallocated zone the last new elements (the gap is closed).
-      insertion_proxy.uninitialized_copy_n_and_update(a, last, std::size_t(n - elems_after));
-      on_exception.release();
-   }
-}
-
-template
-<typename Allocator
-   , typename F // F models ForwardIterator
-   , typename InsertionProxy
->
-BOOST_CONTAINER_FORCEINLINE void expand_forward_and_insert_alloc
-   ( Allocator& a
-   , F pos
-   , F last
-   , std::size_t const n
-   , InsertionProxy insertion_proxy)
-{
-   if (last == pos) {
-      insertion_proxy.uninitialized_copy_n_and_update(a, last, n);
-   }
-   else{
-      const bool single_value = dtl::is_single_value_proxy<InsertionProxy>::value;
-      BOOST_IF_CONSTEXPR(!single_value){
-         if (BOOST_UNLIKELY(!n)) {
-            return;
-         }
-      }
-      expand_forward_and_insert_nonempty_middle_alloc(a, pos, last, n, insertion_proxy);
-   }
-}
-
-template <class B, class InsertionProxy, class Allocator>
-void expand_backward_forward_and_insert_alloc_move_backward
-( B const old_start
-, std::size_t const old_size
-, B const new_start
-, B const pos
-, std::size_t const n
-, InsertionProxy insertion_proxy
-, Allocator& a)
-{
-   typedef std::size_t size_type;
-   typedef typename allocator_traits<Allocator>::value_type value_type;
-   static const bool trivial_dctr_after_move = has_trivial_destructor_after_move<value_type>::value;
-   static const bool trivial_dctr = dtl::is_trivially_destructible<value_type>::value;
-
-   typedef typename dtl::if_c
-      <trivial_dctr
-      , dtl::null_scoped_destructor_n<Allocator, B>
-      , dtl::scoped_destructor_n<Allocator, B>
-      >::type   array_destructor_t;
-
-   //n can be zero to just expand capacity
-   B old_finish = make_iterator_uadvance(old_start, old_size);
-
-   //We can have 8 possibilities:
-   const size_type elemsbefore = static_cast<size_type>(iterator_udistance(old_start, pos));
-   const size_type raw_before  = static_cast<size_type>(iterator_udistance(new_start, old_start));
-   const size_type before_plus_new = size_type(elemsbefore + n);
-
-   //Check if raw_before is big enough to hold the beginning of old data + new data
-   if (raw_before >= before_plus_new) {
-      //If anything goes wrong, this object will destroy
-      //all the old objects to fulfill previous vector state
-      array_destructor_t old_values_destroyer(old_start, a, old_size);
-      // _________________________________________________________
-      //|            raw_mem                | old_begin | old_end |  //Old situation
-      //| __________________________________|___________|_________|
-      // _________________________________________________________
-      //| old_begin |    new   |  raw_mem   | old_begin | old_end |  //First step
-      //|___________|__________|____________|___________|_________|
-
-      //Copy first old values before pos, after that the new objects
-      B const new_elem_pos = ::boost::container::uninitialized_move_alloc(a, old_start, pos, new_start);
-      array_destructor_t new_values_destroyer(new_start, a, elemsbefore);
-      insertion_proxy.uninitialized_copy_n_and_update(a, new_elem_pos, n);
-      new_values_destroyer.set_size(before_plus_new);
-      const size_type new_size = size_type(old_size + n);
-      //Check if raw_before is so big that even copying the old data + new data
-      //there is a gap between the new data and the old data
-      if (raw_before >= new_size) {
-         // _______________________________________________________
-         //|            raw_mem              | old_begin | old_end | //Old situation
-         //|_________________________________|___________|_________|
-         // _______________________________________________________
-         //| old_begin |   new  |  raw_mem   | old_begin | old_end | //First step
-         //|___________|________|____________|___________|_________|
-         // _______________________________________________________
-         //| old_begin |   new  | old_end |       raw_mem          | //New situation
-         //|___________|________|_________|________________________|
-         //
-         //Now initialize the rest of memory with the last old values
-         if (before_plus_new != new_size) { //Special case to avoid operations in back insertion
-            B new_start_end(make_iterator_uadvance(new_start, before_plus_new));
-            ::boost::container::uninitialized_move_alloc(a, pos, old_finish, new_start_end);
-         }
-         //All new elements correctly constructed, avoid new element destruction
-         new_values_destroyer.release();
-         //Old values destroyed automatically with "old_values_destroyer"
-         //when "old_values_destroyer" goes out of scope unless the have trivial
-         //destructor after move.
-         if(trivial_dctr_after_move)
-            old_values_destroyer.release();
-      }
-      //raw_before is so big that divides old_end
-      else {
-         // _________________________________________________
-         //|               raw           | old_beg | old_end | //Old situation
-         //|_____________________________|_________|_________|
-         // _________________________________________________
-         //| old_begin |    new   |  raw | old_beg | old_end | //First step
-         //|___________|__________|______|_________|_________|
-         // _________________________________________________
-         //| old_begin |    new   | old_end |  raw_mem       | //New situation
-         //|___________|__________|_________|________________|
-
-         //Now initialize the rest of memory with the last old values
-         //All new elements correctly constructed, avoid new element destruction
-         BOOST_IF_CONSTEXPR(!trivial_dctr) {
-            //Now initialize the rest of raw_before memory with the
-            //first of elements after new values
-            const size_type raw_gap = raw_before - before_plus_new;
-            B new_start_plus(make_iterator_uadvance(new_start, before_plus_new));
-            ::boost::container::uninitialized_move_alloc_n(a, pos, raw_gap, new_start_plus);
-            new_values_destroyer.release();
-            old_values_destroyer.increment_size_backwards(raw_before);
-            //Now move remaining last objects in the old buffer begin
-            B remaining_pos(make_iterator_uadvance(pos, raw_gap));
-            remaining_pos = ::boost::container::move_forward_overlapping(remaining_pos, old_finish, old_start);
-            (void)remaining_pos;
-            //Once moved, avoid calling the destructors if trivial after move
-            if(!trivial_dctr_after_move) {
-               boost::container::destroy_alloc(a, remaining_pos, old_finish);
-            }
-         }
-         else { //If trivial destructor, we can uninitialized copy + copy in a single uninitialized copy
-            ::boost::container::uninitialized_move_alloc_n
-               (a, pos, static_cast<size_type>(old_finish - pos), make_iterator_uadvance(new_start, before_plus_new));
-         }
-         old_values_destroyer.release();
-      }
-   }
-   else {
-      //If anything goes wrong, this object will destroy
-      //all the old objects to fulfill previous vector state
-      array_destructor_t old_values_destroyer(old_start, a, old_size);
-
-      //Check if we have to do the insertion in two phases
-      //since maybe raw_before is not big enough and
-      //the buffer was expanded both sides
-      // _________________________________________________
-      //| raw_mem | old_begin + old_end |  raw_mem        | //Old situation
-      //|_________|_____________________|_________________|
-      // _________________________________________________
-      //|     old_begin + new + old_end     |  raw_mem    | //New situation with do_after
-      //|___________________________________|_____________|
-      // _________________________________________________
-      //| old_begin + new + old_end  |  raw_mem           | //New without do_after
-      //|____________________________|____________________|
-      //
-      const bool do_after = n > raw_before;
-
-      //Now we can have two situations: the raw_mem of the
-      //beginning divides the old_begin, or the new elements:
-      if (raw_before <= elemsbefore) {
-         //The raw memory divides the old_begin group:
-         //
-         //If we need two phase construction (do_after)
-         //new group is divided in new = new_beg + new_end groups
-         //In this phase only new_beg will be inserted
-         //
-         // _________________________________________________
-         //| raw_mem | old_begin | old_end |  raw_mem        | //Old situation
-         //|_________|___________|_________|_________________|
-         // _________________________________________________
-         //| old_begin | new_beg | old_end |  raw_mem        | //New situation with do_after(1),
-         //|___________|_________|_________|_________________| //not definitive, pending operations
-         // _________________________________________________
-         //| old_begin | new | old_end |  raw_mem            | //New situation without do_after,
-         //|___________|_____|_________|_____________________| //definitive.
-         //
-         //Copy the first part of old_begin to raw_mem
-         ::boost::container::uninitialized_move_alloc_n(a, old_start, raw_before, new_start);
-         //The buffer is all constructed until old_end,
-         //so program trailing destruction and assign final size
-         //if !do_after, raw_before+n otherwise.
-         size_type new_1st_range;
-         old_values_destroyer.increment_size_backwards(raw_before);
-         new_1st_range = do_after ? raw_before : n;
-
-         //Now copy the second part of old_begin overwriting itself
-         B const old_next(make_iterator_uadvance(old_start, raw_before));
-         B const next = ::boost::container::move(old_next, pos, old_start);
-         //Now copy the new_beg elements
-         insertion_proxy.copy_n_and_update(a, next, new_1st_range);
-
-         //If there is no after work and the last old part needs to be moved to front, do it
-         if (!do_after) {
-            //Now displace old_end elements and destroy trailing
-            B const new_first(make_iterator_uadvance(next, new_1st_range));
-            B const p = ::boost::container::move_forward_overlapping(pos, old_finish, new_first);
-            (void)p;
-            if(!trivial_dctr_after_move)
-               boost::container::destroy_alloc(a, p, old_finish);
-         }
-      }
-      else {
-         //If we have to expand both sides,
-         //we will play if the first new values so
-         //calculate the upper bound of new values
-
-         //The raw memory divides the new elements
-         //
-         //If we need two phase construction (do_after)
-         //new group is divided in new = new_beg + new_end groups
-         //In this phase only new_beg will be inserted
-         //
-         // ____________________________________________________
-         //|   raw_mem     | old_begin | old_end |  raw_mem     | //Old situation
-         //|_______________|___________|_________|______________|
-         // ____________________________________________________
-         //| old_begin |    new_beg    | old_end |  raw_mem     | //New situation with do_after(),
-         //|___________|_______________|_________|______________| //not definitive, pending operations
-         // ____________________________________________________
-         //| old_begin | new | old_end |  raw_mem               | //New situation without do_after,
-         //|___________|_____|_________|________________________| //definitive
-         //
-         //First copy whole old_begin and part of new to raw_mem
-         B const new_pos = ::boost::container::uninitialized_move_alloc(a, old_start, pos, new_start);
-         array_destructor_t new_values_destroyer(new_start, a, elemsbefore);
-         const size_type mid_n = size_type(raw_before - elemsbefore);
-         insertion_proxy.uninitialized_copy_n_and_update(a, new_pos, mid_n);
-         new_values_destroyer.release();
-         //The buffer is all constructed until old_end
-         old_values_destroyer.increment_size_backwards(raw_before);
-
-         if (do_after) {
-            //Copy new_beg part
-            insertion_proxy.copy_n_and_update(a, old_start, elemsbefore);
-         }
-         else {
-            //Copy all new elements
-            const size_type rest_new = size_type(n - mid_n);
-            insertion_proxy.copy_n_and_update(a, old_start, rest_new);
-
-            B move_start(make_iterator_uadvance(old_start, rest_new));
-
-            //Displace old_end, but make sure data has to be moved
-            B const move_end = ::boost::container::move_forward_overlapping(pos, old_finish, move_start);
-            (void)move_end;   //To avoid warnings of unused initialization for move_end in case
-                              //trivial_dctr_after_move is true
-            //Destroy remaining moved elements from old_end except if they
-            //have trivial destructor after being moved
-            if(!trivial_dctr_after_move) {
-               boost::container::destroy_alloc(a, move_end, old_finish);
-            }
-         }
-      }
-
-      //This is only executed if two phase construction is needed
-      if (do_after) {
-         //The raw memory divides the new elements
-         // ______________________________________________________
-         //|   raw_mem    | old_begin |  old_end   |  raw_mem     |  //Old situation
-         //|______________|___________|____________|______________|
-         // _______________________________________________________
-         //| old_begin   +   new_beg  | new_end |old_end | rawmem |  //New situation with do_after(1)
-         //|__________________________|_________|________|________|
-         // ______________________________________________________
-         //| old_begin      +       new            | old_end |raw |  //New situation with do_after(2)
-         //|_______________________________________|_________|____|
-         const size_type n_after = size_type(n - raw_before);
-         const size_type elemsafter = size_type(old_size - elemsbefore);
-
-         //We can have two situations:
-         if (elemsafter >= n_after) {
-            //The raw_mem from end will divide displaced old_end
-            //
-            //Old situation:
-            // ______________________________________________________
-            //|   raw_mem    | old_begin |  old_end   |  raw_mem     |
-            //|______________|___________|____________|______________|
-            //
-            //New situation with do_after(1):
-            // _______________________________________________________
-            //| old_begin   +   new_beg  | new_end |old_end | raw_mem |
-            //|__________________________|_________|________|_________|
-            //
-            //First copy the part of old_end raw_mem
-            B finish_n = make_iterator_advance(old_finish, -std::ptrdiff_t(n_after));
-            ::boost::container::uninitialized_move_alloc(a, finish_n, old_finish, old_finish);
-            old_values_destroyer.increment_size(n_after);
-            //Displace the rest of old_end to the new position
-            boost::container::move_backward_overlapping(pos, finish_n, old_finish);
-            //Now overwrite with new_end
-            //The new_end part is [first + (n - n_after), last)
-            insertion_proxy.copy_n_and_update(a, pos, n_after);
-         }
-         else {
-            //The raw_mem from end will divide new_end part
-            // _____________________________________________________________
-            //|   raw_mem    | old_begin |  old_end   |  raw_mem            | //Old situation
-            //|______________|___________|____________|_____________________|
-            // _____________________________________________________________
-            //| old_begin   +   new_beg  |     new_end   |old_end | raw_mem | //New situation with do_after(2)
-            //|__________________________|_______________|________|_________|
-
-            //First initialize data in raw memory
-            const size_type mid_last_dist = size_type(n_after - elemsafter);
-
-            //Copy to the old_end part to the uninitialized zone leaving a gap.
-            B const mid_last(make_iterator_uadvance(old_finish, mid_last_dist));
-            ::boost::container::uninitialized_move_alloc(a, pos, old_finish, mid_last);
-
-            array_destructor_t old_end_destroyer(mid_last, a, iterator_udistance(pos, old_finish));
-
-            //Copy the first part to the already constructed old_end zone
-            insertion_proxy.copy_n_and_update(a, pos, elemsafter);
-            //Copy the rest to the uninitialized zone filling the gap
-            insertion_proxy.uninitialized_copy_n_and_update(a, old_finish, mid_last_dist);
-            old_end_destroyer.release();
-         }
-      }
-      old_values_destroyer.release();
-   }
-}
-
-template
-<typename Allocator
-   , typename B // B models BidirIterator
-   , typename InsertionProxy
->
-BOOST_CONTAINER_FORCEINLINE void expand_backward_forward_and_insert_alloc_move_forward
-   ( B const old_start
-   , std::size_t const old_size
-   , B const new_start
-   , B const pos
-   , std::size_t const n
-   , InsertionProxy insertion_proxy
-   , Allocator& a)
-{
-   typedef std::size_t size_type;
-   typedef typename allocator_traits<Allocator>::value_type value_type;
-   static const bool trivial_dctr_after_move = has_trivial_destructor_after_move<value_type>::value;
-   static const bool trivial_dctr = dtl::is_trivially_destructible<value_type>::value;
-
-   typedef typename dtl::if_c
-      <trivial_dctr
-      , dtl::null_scoped_destructor_n<Allocator, B>
-      , dtl::scoped_destructor_n<Allocator, B>
-      >::type   array_destructor_t;
-
-   //n can be zero to just expand capacity
-
-   B const old_finish = make_iterator_uadvance(old_start, old_size);
-   const size_type new_size = size_type(old_size + n);
-   B const new_finish = make_iterator_uadvance(new_start, new_size);
-
-   //We can have 8 possibilities:
-
-   const size_type elemsafter = static_cast<size_type>(iterator_udistance(pos, old_finish));
-   const size_type raw_after = static_cast<size_type>(iterator_udistance(old_finish, new_finish));
-
-   const size_type after_plus_new = size_type(elemsafter + n);
-
-   //Check if raw_before is big enough to hold the new data + the end of old data
-   if (raw_after >= after_plus_new) {
-      //If anything goes wrong, this object will destroy
-      //all the old objects to fulfill previous vector state
-      array_destructor_t old_values_destroyer(old_start, a, old_size);
-      //______________________ __________________________________
-      //| old_begin | old_end |            raw_mem                  //Old situation
-      //|___________|_________|__________________________________
-      // _____________________ _________________________________
-      //| old_begin | old_end |  raw_mem |    new   |  old_end  |  //First step
-      //|___________|_________|__________|__________|___________|
-
-      //Copy first new objects, after that old values after pos
-      B new_elem_pos = new_finish - after_plus_new;
-      insertion_proxy.uninitialized_copy_n_and_update(a, new_elem_pos, n);
-      array_destructor_t new_values_destroyer(new_elem_pos, a, n);
-      ::boost::container::uninitialized_move_alloc(a, pos, old_finish, new_elem_pos+n);
-      new_values_destroyer.set_size(after_plus_new);
-
-      //Check if raw_before is so big that even copying the old data + new data
-      //there is a gap between the new data and the old data
-      if (raw_after >= new_size) {
-         //______________________ __________________________________
-         //| old_begin | old_end |            raw_mem                  //Old situation
-         //|___________|_________|__________________________________
-         // _____________________ _________________________________
-         //| old_begin | old_end |    raw_mem   |   new  | old_end |  //First step
-         //|___________|_________|______________|________|_________|
-         // _____________________V_________________________________
-         //|       raw_mem          | old_begin |   new  | old_end | //New situation
-         //|________________________|___________|________|_________|
-         //
-         //Now initialize the rest of memory with the last old values
-         ::boost::container::uninitialized_move_alloc(a, old_start, pos, new_start);
-         //All new elements correctly constructed, avoid new element destruction
-         new_values_destroyer.release();
-         //Old values destroyed automatically with "old_values_destroyer"
-         //when "old_values_destroyer" goes out of scope unless the have trivial
-         //destructor after move.
-         if(trivial_dctr_after_move)
-            old_values_destroyer.release();
-      }
-      //raw_before is so big that divides old_end
-      else {
-         //______________________ ____________________________
-         //| old_begin | old_end |          raw_mem             //Old situation
-         //|___________|_________|____________________________
-         // _____________________ ____________________________
-         //| old_begin | old_end | raw_mem |   new  | old_end | //First step
-         //|___________|_________|_________|________|_________|
-         // _________________________________________________
-         //|       raw_mem     | old_begin |   new  | old_end | //New situation
-         //|___________________|___________|________|_________|
-
-         //Now initialize the rest of raw_before memory with the
-         //last elements before new values
-         const size_type raw_gap = raw_after - after_plus_new;
-         B const pre_pos_raw = pos - raw_gap;
-         ::boost::container::uninitialized_move_alloc_n(a, pre_pos_raw, raw_gap, old_finish);
-         new_values_destroyer.release();
-         old_values_destroyer.increment_size(raw_after);
-         //Now move remaining last objects in the old buffer begin
-         BOOST_ASSERT(old_start != old_finish);
-         boost::container::move_backward_overlapping(old_start, pre_pos_raw, old_finish);
-         old_values_destroyer.release();
-         if (!trivial_dctr_after_move) {
-            boost::container::destroy_alloc(a, old_start, new_start);
-         }
-      }
-   }
-   else{
-      //If anything goes wrong, this object will destroy
-      //all the old objects to fulfill previous vector state
-      array_destructor_t old_values_destroyer(old_start, a, old_size);
-
-      //Now we can have two situations: the raw_mem of the
-      //end divides the new elements or the old_end
-      if (raw_after > elemsafter) {
-         //The raw memory divides the new elements
-         //__________________________________
-         //| old_begin | old_end |    raw    |  //Old situation
-         //|___________|_________|___________|
-         // _____ ___________________________
-         //| raw | old_begin | new | old_end |  //New situation
-         //|_____|___________|_____|_________|
-
-         //First copy whole old_end and part of new to raw_mem
-         B p = new_finish - elemsafter;
-         ::boost::container::uninitialized_move_alloc(a, pos, old_finish, p);
-         array_destructor_t new_values_destroyer(p, a, elemsafter);
-         //Copy all new elements
-         const size_type mid_n = size_type(raw_after - elemsafter);
-         const size_type rest_new = size_type(n - mid_n);
-         B new_rng_start = old_finish - rest_new;
-         insertion_proxy.copy_n_and_update(a, new_rng_start, rest_new);
-         insertion_proxy.uninitialized_copy_n_and_update(a, old_finish, mid_n);
-         new_values_destroyer.release();
-         old_values_destroyer.increment_size_backwards(raw_after);
-         //Displace old_end, but make sure data has to be moved
-         p = ::boost::container::move_backward_overlapping(old_start, pos, new_rng_start);
-
-         //Destroy remaining moved elements from old_begin except if they
-         //have trivial destructor after being moved
-         old_values_destroyer.release();
-         if (!trivial_dctr_after_move) {
-            boost::container::destroy_alloc(a, old_start, p);
-         }
-      }
-      else {
-         //The raw memory divides the old_end group:
-         //________________________________________
-         //| old_begin |    old_end    |      raw  |  //Old situation
-         //|___________|_______________|___________|
-         // _____ __________________________________
-         //| raw | old_begin | new |    old_end    |  //New situation
-         //|_____|___________|_____|_______________|
-         //
-         //Copy the last part of old_end to raw_mem
-         const B old_end_pivot = old_finish - raw_after;
-         ::boost::container::uninitialized_move_alloc_n(a, old_end_pivot, raw_after, old_finish);
-         //The buffer is all constructed
-         old_values_destroyer.increment_size_backwards(raw_after);
-
-         //Now copy the first part of old_end overwriting itself
-         B const new_end_pos = ::boost::container::move_backward_overlapping(pos, old_end_pivot, old_finish);
-         B const new_beg_pos = new_end_pos - n;
-
-         //Now copy the new_beg elements
-         insertion_proxy.copy_n_and_update(a, new_beg_pos, n);
-         B const p = ::boost::container::move_backward_overlapping(old_start, pos, new_beg_pos);
-         old_values_destroyer.release();
-
-         if (!trivial_dctr_after_move) {
-            (void)p;
-            boost::container::destroy_alloc(a, old_start, p);
-         }
-      }
-   }
-}
-
-template <class R, class InsertionProxy, class Allocator>
-void expand_backward_forward_and_insert_alloc
-   ( R const old_start
-   , std::size_t const old_size
-   , R const new_start
-   , R const pos
-   , std::size_t const n
-   , InsertionProxy insertion_proxy
-   , Allocator& a)
-{
-   if(new_start < old_start){
-      expand_backward_forward_and_insert_alloc_move_backward(old_start, old_size, new_start, pos, n, insertion_proxy, a);
-   }
-   else{
-      expand_backward_forward_and_insert_alloc_move_forward(old_start, old_size, new_start, pos, n, insertion_proxy, a);
-   }
-}
-
-}  //namespace container {
-}  //namespace boost {
-
-//#pragma GCC diagnostic ignored "-Wclass-memaccess"
-#if defined(BOOST_GCC) && (BOOST_GCC >= 40600)
-#pragma GCC diagnostic pop
-#endif
-
-#endif   //#ifndef BOOST_CONTAINER_DETAIL_COPY_MOVE_ALGO_HPP
diff --git a/src/boost/container/detail/destroyers.hpp b/src/boost/container/detail/destroyers.hpp
deleted file mode 100644
index f00ac6d6..00000000
--- a/src/boost/container/detail/destroyers.hpp
+++ /dev/null
@@ -1,502 +0,0 @@
-//////////////////////////////////////////////////////////////////////////////
-//
-// (C) Copyright Ion Gaztanaga 2005-2013.
-//
-// Distributed under the Boost 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.
-//
-//////////////////////////////////////////////////////////////////////////////
-
-#ifndef BOOST_CONTAINER_DESTROYERS_HPP
-#define BOOST_CONTAINER_DESTROYERS_HPP
-
-#ifndef BOOST_CONFIG_HPP
-#  include <boost/config.hpp>
-#endif
-
-#if defined(BOOST_HAS_PRAGMA_ONCE)
-#  pragma once
-#endif
-
-#include <boost/container/detail/config_begin.hpp>
-#include <boost/container/detail/workaround.hpp>
-
-#include <boost/container/allocator_traits.hpp>
-#include <boost/move/detail/to_raw_pointer.hpp>
-#include <boost/container/detail/version_type.hpp>
-#include <boost/move/detail/iterator_to_raw_pointer.hpp>
-
-namespace boost {
-namespace container {
-namespace dtl {
-
-//!A deleter for scoped_ptr that deallocates the memory
-//!allocated for an object using a STL allocator.
-template <class Allocator>
-struct scoped_deallocator
-{
-   typedef allocator_traits<Allocator> allocator_traits_type;
-   typedef typename allocator_traits_type::pointer pointer;
-   typedef dtl::integral_constant<unsigned,
-      boost::container::dtl::
-         version<Allocator>::value>                   alloc_version;
-
-   private:
-   void priv_deallocate(version_1)
-   {  m_alloc.deallocate(m_ptr, 1); }
-
-   void priv_deallocate(version_2)
-   {  m_alloc.deallocate_one(m_ptr); }
-
-   BOOST_MOVABLE_BUT_NOT_COPYABLE(scoped_deallocator)
-
-   public:
-
-   pointer     m_ptr;
-   Allocator&  m_alloc;
-
-   scoped_deallocator(pointer p, Allocator& a)
-      : m_ptr(p), m_alloc(a)
-   {}
-
-   ~scoped_deallocator()
-   {  if (m_ptr)priv_deallocate(alloc_version());  }
-
-   scoped_deallocator(BOOST_RV_REF(scoped_deallocator) o)
-      :  m_ptr(o.m_ptr), m_alloc(o.m_alloc)
-   {  o.release();  }
-
-   pointer get() const
-   {  return m_ptr;  }
-
-   void set(const pointer &p)
-   {  m_ptr = p;  }
-
-   void release()
-   {  m_ptr = 0; }
-};
-
-template <class Allocator>
-struct null_scoped_deallocator
-{
-   typedef boost::container::allocator_traits<Allocator> AllocTraits;
-   typedef typename AllocTraits::pointer    pointer;
-
-   null_scoped_deallocator(pointer, Allocator&, std::size_t)
-   {}
-
-   void release()
-   {}
-
-   pointer get() const
-   {  return pointer();  }
-
-   void set(const pointer &)
-   {}
-};
-
-//!A deleter for scoped_ptr that deallocates the memory
-//!allocated for an array of objects using a STL allocator.
-template <class Allocator>
-struct scoped_array_deallocator
-{
-   typedef boost::container::allocator_traits<Allocator> AllocTraits;
-   typedef typename AllocTraits::pointer    pointer;
-   typedef typename AllocTraits::size_type  size_type;
-
-   scoped_array_deallocator(pointer p, Allocator& a, std::size_t length)
-      : m_ptr(p), m_alloc(a), m_length(length) {}
-
-   ~scoped_array_deallocator()
-   {  if (m_ptr) m_alloc.deallocate(m_ptr, size_type(m_length));  }
-
-   void release()
-   {  m_ptr = 0; }
-
-   private:
-   pointer     m_ptr;
-   Allocator&  m_alloc;
-   std::size_t m_length;
-};
-
-template <class Allocator>
-struct null_scoped_array_deallocator
-{
-   typedef boost::container::allocator_traits<Allocator> AllocTraits;
-   typedef typename AllocTraits::pointer    pointer;
-
-   null_scoped_array_deallocator(pointer, Allocator&, std::size_t)
-   {}
-
-   void release()
-   {}
-};
-
-template <class Allocator>
-struct scoped_node_destroy_deallocator
-{
-   typedef boost::container::allocator_traits<Allocator> AllocTraits;
-   typedef typename AllocTraits::pointer    pointer;
-   typedef dtl::integral_constant<unsigned,
-      boost::container::dtl::
-         version<Allocator>::value>                          alloc_version;
-
-   scoped_node_destroy_deallocator(pointer p, Allocator& a)
-      : m_ptr(p), m_alloc(a) {}
-
-   ~scoped_node_destroy_deallocator()
-   {
-      if(m_ptr){
-         boost::movelib::to_raw_pointer(m_ptr)->destructor(m_alloc);
-         priv_deallocate(m_ptr, alloc_version());
-      }
-   }
-
-   void release()
-   {  m_ptr = 0; }
-
-   private:
-
-   void priv_deallocate(const pointer &p, version_1)
-   {  AllocTraits::deallocate(m_alloc, p, 1); }
-
-   void priv_deallocate(const pointer &p, version_2)
-   {  m_alloc.deallocate_one(p); }
-
-   pointer     m_ptr;
-   Allocator&  m_alloc;
-};
-
-
-//!A deleter for scoped_ptr that destroys
-//!an object using a STL allocator.
-template <class Allocator, class Ptr = typename allocator_traits<Allocator>::pointer>
-struct scoped_destructor_n
-{
-   typedef boost::container::allocator_traits<Allocator> AllocTraits;
-   typedef Ptr    pointer;
-   typedef typename AllocTraits::value_type value_type;
-
-   BOOST_CONTAINER_FORCEINLINE scoped_destructor_n(Ptr p, Allocator& a, std::size_t n)
-      : m_p(p), m_n(n), m_a(a)
-   {}
-
-   BOOST_CONTAINER_FORCEINLINE void release()
-   {  m_p = Ptr(); m_n = 0; }
-
-   BOOST_CONTAINER_FORCEINLINE void increment_size(std::size_t inc)
-   {  m_n += inc;   }
-
-   BOOST_CONTAINER_FORCEINLINE void increment_size_backwards(std::size_t inc)
-   {  m_n += inc;   m_p -= std::ptrdiff_t(inc);  }
-
-   BOOST_CONTAINER_FORCEINLINE void shrink_forward(std::size_t inc)
-   {  m_n -= inc;   m_p += std::ptrdiff_t(inc);  }
-
-   BOOST_CONTAINER_FORCEINLINE void set_size(std::size_t sz)
-   {  m_n = sz;   }
-
-   ~scoped_destructor_n()
-   {
-      if(m_n){
-         value_type *raw_ptr = boost::movelib::iterator_to_raw_pointer(m_p);
-         do {
-            --m_n;
-            AllocTraits::destroy(m_a, raw_ptr);
-            ++raw_ptr;
-         } while(m_n);
-      }
-   }
-
-   private:
-   pointer     m_p;
-   std::size_t m_n;
-   Allocator& m_a;
-};
-
-//!A deleter for scoped_ptr that destroys
-//!an object using a STL allocator.
-template <class Allocator, class Ptr = typename allocator_traits<Allocator>::pointer>
-struct null_scoped_destructor_n
-{
-   typedef boost::container::allocator_traits<Allocator> AllocTraits;
-   typedef Ptr pointer;
-
-   BOOST_CONTAINER_FORCEINLINE null_scoped_destructor_n(Ptr, Allocator&, std::size_t)
-   {}
-
-   BOOST_CONTAINER_FORCEINLINE void increment_size(std::size_t)
-   {}
-
-   BOOST_CONTAINER_FORCEINLINE void increment_size_backwards(std::size_t)
-   {}
-
-   BOOST_CONTAINER_FORCEINLINE void set_size(std::size_t )
-   {}
-
-   BOOST_CONTAINER_FORCEINLINE void shrink_forward(std::size_t)
-   {}
-
-   BOOST_CONTAINER_FORCEINLINE void release()
-   {}
-};
-
-
-//!A deleter for scoped_ptr that destroys
-//!an object using a STL allocator.
-template <class Allocator>
-struct scoped_destructor_range
-{
-   typedef boost::container::allocator_traits<Allocator> AllocTraits;
-   typedef typename AllocTraits::pointer    pointer;
-   typedef typename AllocTraits::value_type value_type;
-   
-   BOOST_CONTAINER_FORCEINLINE scoped_destructor_range(pointer p, pointer e, Allocator& a)
-      : m_p(p), m_e(e), m_a(a)
-   {}
-
-   BOOST_CONTAINER_FORCEINLINE void release()
-   {  m_p = pointer(); m_e = pointer(); }
-
-   BOOST_CONTAINER_FORCEINLINE void set_end(pointer e)
-   {  m_e = e;   }
-
-   BOOST_CONTAINER_FORCEINLINE void set_begin(pointer b)
-   {  m_p = b;  }
-
-   BOOST_CONTAINER_FORCEINLINE void set_range(pointer b, pointer e)
-   {  m_p = b; m_e = e;   }
-
-   ~scoped_destructor_range()
-   {
-      while(m_p != m_e){
-         value_type *raw_ptr = boost::movelib::to_raw_pointer(m_p);
-         AllocTraits::destroy(m_a, raw_ptr);
-         ++m_p;
-      }
-   }
-
-   private:
-   pointer     m_p;
-   pointer     m_e;
-   Allocator & m_a;
-};
-
-//!A deleter for scoped_ptr that destroys
-//!an object using a STL allocator.
-template <class Allocator>
-struct null_scoped_destructor_range
-{
-   typedef boost::container::allocator_traits<Allocator> AllocTraits;
-   typedef typename AllocTraits::pointer pointer;
-
-   BOOST_CONTAINER_FORCEINLINE null_scoped_destructor_range(pointer, pointer, Allocator&)
-   {}
-
-   BOOST_CONTAINER_FORCEINLINE void release()
-   {}
-
-   BOOST_CONTAINER_FORCEINLINE void set_end(pointer)
-   {}
-
-   BOOST_CONTAINER_FORCEINLINE void set_begin(pointer)
-   {}
-
-   BOOST_CONTAINER_FORCEINLINE void set_range(pointer, pointer)
-   {}
-};
-
-
-template<class Allocator>
-class scoped_destructor
-{
-   typedef boost::container::allocator_traits<Allocator> AllocTraits;
-   public:
-   typedef typename Allocator::value_type value_type;
-   BOOST_CONTAINER_FORCEINLINE scoped_destructor(Allocator &a, value_type *pv)
-      : pv_(pv), a_(a)
-   {}
-
-   BOOST_CONTAINER_FORCEINLINE ~scoped_destructor()
-   {
-      if(pv_){
-         AllocTraits::destroy(a_, pv_);
-      }
-   }
-
-   BOOST_CONTAINER_FORCEINLINE void release()
-   {  pv_ = 0; }
-
-
-   BOOST_CONTAINER_FORCEINLINE void set(value_type *ptr) { pv_ = ptr; }
-
-   BOOST_CONTAINER_FORCEINLINE value_type *get() const { return pv_; }
-
-   private:
-   value_type *pv_;
-   Allocator &a_;
-};
-
-template<class Allocator>
-class null_scoped_destructor
-{
-   typedef boost::container::allocator_traits<Allocator> AllocTraits;
-   public:
-   typedef typename Allocator::value_type value_type;
-   BOOST_CONTAINER_FORCEINLINE null_scoped_destructor(Allocator &, value_type *)
-   {}
-
-   BOOST_CONTAINER_FORCEINLINE ~null_scoped_destructor()
-   {}
-
-   BOOST_CONTAINER_FORCEINLINE void release()
-   {}
-
-   BOOST_CONTAINER_FORCEINLINE void set(value_type *) { }
-
-   BOOST_CONTAINER_FORCEINLINE value_type *get() const { return 0; }
-};
-
-
-
-template<class Allocator, class Value = typename Allocator::value_type>
-class value_destructor
-{
-   typedef boost::container::allocator_traits<Allocator> AllocTraits;
-   public:
-   typedef Value value_type;
-   BOOST_CONTAINER_FORCEINLINE value_destructor(Allocator &a, value_type &rv)
-      : rv_(rv), a_(a)
-   {}
-
-   BOOST_CONTAINER_FORCEINLINE ~value_destructor()
-   {
-      AllocTraits::destroy(a_, &rv_);
-   }
-
-   private:
-   value_type &rv_;
-   Allocator &a_;
-};
-
-template <class Allocator>
-class allocator_node_destroyer
-{
-   typedef boost::container::allocator_traits<Allocator> AllocTraits;
-   typedef typename AllocTraits::value_type value_type;
-   typedef typename AllocTraits::pointer    pointer;
-   typedef dtl::integral_constant<unsigned,
-      boost::container::dtl::
-         version<Allocator>::value>                           alloc_version;
-
-   private:
-   Allocator & a_;
-
-   private:
-   BOOST_CONTAINER_FORCEINLINE void priv_deallocate(const pointer &p, version_1)
-   {  AllocTraits::deallocate(a_,p, 1); }
-
-   BOOST_CONTAINER_FORCEINLINE void priv_deallocate(const pointer &p, version_2)
-   {  a_.deallocate_one(p); }
-
-   public:
-   BOOST_CONTAINER_FORCEINLINE explicit allocator_node_destroyer(Allocator &a)
-      : a_(a)
-   {}
-
-   BOOST_CONTAINER_FORCEINLINE void operator()(const pointer &p)
-   {
-      boost::movelib::to_raw_pointer(p)->destructor(a_);
-      this->priv_deallocate(p, alloc_version());
-   }
-};
-
-template<class Allocator>
-class scoped_node_destructor
-{
-   typedef boost::container::allocator_traits<Allocator> AllocTraits;
-   public:
-   typedef typename Allocator::value_type value_type;
-   BOOST_CONTAINER_FORCEINLINE scoped_node_destructor(Allocator &a, value_type *pv)
-      : pv_(pv), a_(a)
-   {}
-
-   BOOST_CONTAINER_FORCEINLINE ~scoped_node_destructor()
-   {
-      if(pv_){
-         pv_->destructor(a_);
-      }
-   }
-
-   BOOST_CONTAINER_FORCEINLINE void release()
-   {  pv_ = 0; }
-
-
-   BOOST_CONTAINER_FORCEINLINE void set(value_type *ptr) { pv_ = ptr; }
-
-   BOOST_CONTAINER_FORCEINLINE value_type *get() const { return pv_; }
-
-   private:
-   value_type *pv_;
-   Allocator &a_;
-};
-
-
-
-template <class Allocator>
-class allocator_node_destroyer_and_chain_builder
-{
-   typedef allocator_traits<Allocator> allocator_traits_type;
-   typedef typename allocator_traits_type::value_type value_type;
-   typedef typename Allocator::multiallocation_chain    multiallocation_chain;
-
-   Allocator & a_;
-   multiallocation_chain &c_;
-
-   public:
-   BOOST_CONTAINER_FORCEINLINE allocator_node_destroyer_and_chain_builder(Allocator &a, multiallocation_chain &c)
-      :  a_(a), c_(c)
-   {}
-
-   BOOST_CONTAINER_FORCEINLINE void operator()(const typename Allocator::pointer &p)
-   {
-      boost::movelib::to_raw_pointer(p)->destructor(a_);
-      c_.push_back(p);
-   }
-};
-
-template <class Allocator>
-class allocator_multialloc_chain_node_deallocator
-{
-   typedef allocator_traits<Allocator> allocator_traits_type;
-   typedef typename allocator_traits_type::value_type value_type;
-   typedef typename Allocator::multiallocation_chain    multiallocation_chain;
-   typedef allocator_node_destroyer_and_chain_builder<Allocator> chain_builder;
-
-   Allocator & a_;
-   multiallocation_chain c_;
-
-   public:
-   BOOST_CONTAINER_FORCEINLINE allocator_multialloc_chain_node_deallocator(Allocator &a)
-      :  a_(a), c_()
-   {}
-
-   BOOST_CONTAINER_FORCEINLINE chain_builder get_chain_builder()
-   {  return chain_builder(a_, c_);  }
-
-   BOOST_CONTAINER_FORCEINLINE ~allocator_multialloc_chain_node_deallocator()
-   {
-      a_.deallocate_individual(c_);
-   }
-};
-
-}  //namespace dtl {
-}  //namespace container {
-}  //namespace boost {
-
-#include <boost/container/detail/config_end.hpp>
-
-#endif   //#ifndef BOOST_CONTAINER_DESTROYERS_HPP
diff --git a/src/boost/container/detail/flat_tree.hpp b/src/boost/container/detail/flat_tree.hpp
deleted file mode 100644
index 91b11bcb..00000000
--- a/src/boost/container/detail/flat_tree.hpp
+++ /dev/null
@@ -1,1711 +0,0 @@
-////////////////////////////////////////////////////////////////////////////////
-//
-// (C) Copyright Ion Gaztanaga 2005-2015. Distributed under the Boost
-// 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.
-//
-////////////////////////////////////////////////////////////////////////////////
-
-#ifndef BOOST_CONTAINER_FLAT_TREE_HPP
-#define BOOST_CONTAINER_FLAT_TREE_HPP
-
-#ifndef BOOST_CONFIG_HPP
-#  include <boost/config.hpp>
-#endif
-
-#if defined(BOOST_HAS_PRAGMA_ONCE)
-#  pragma once
-#endif
-
-#include <boost/container/detail/config_begin.hpp>
-#include <boost/container/detail/workaround.hpp>
-
-#include <boost/container/container_fwd.hpp>
-
-#include <boost/move/utility_core.hpp>
-
-#include <boost/container/detail/pair.hpp>
-#include <boost/container/vector.hpp>
-#include <boost/container/allocator_traits.hpp>
-
-#include <boost/container/detail/value_init.hpp>
-#include <boost/container/detail/destroyers.hpp>
-#include <boost/container/detail/algorithm.hpp> //algo_equal(), algo_lexicographical_compare
-#include <boost/container/detail/iterator.hpp>
-#include <boost/container/detail/is_sorted.hpp>
-#include <boost/container/detail/type_traits.hpp>
-#include <boost/container/detail/iterators.hpp>
-#include <boost/container/detail/mpl.hpp>
-#include <boost/container/detail/is_contiguous_container.hpp>
-#include <boost/container/detail/is_container.hpp>
-
-#include <boost/intrusive/detail/minimal_pair_header.hpp>      //pair
-
-#include <boost/move/make_unique.hpp>
-#include <boost/move/iterator.hpp>
-#include <boost/move/adl_move_swap.hpp>
-#include <boost/move/detail/iterator_to_raw_pointer.hpp>
-#include <boost/move/detail/force_ptr.hpp>
-#include <boost/move/algo/adaptive_sort.hpp>
-#include <boost/move/algo/detail/pdqsort.hpp>
-
-#if defined(BOOST_NO_CXX11_VARIADIC_TEMPLATES)
-#include <boost/move/detail/fwd_macros.hpp>
-#endif
-
-#ifndef BOOST_CONTAINER_DOXYGEN_INVOKED
-
-#if defined(BOOST_GCC) && (BOOST_GCC >= 40600)
-#pragma GCC diagnostic push
-#pragma GCC diagnostic ignored "-Wunused-result"
-#endif
-
-//merge_unique
-#define BOOST_INTRUSIVE_HAS_MEMBER_FUNCTION_CALLABLE_WITH_FUNCNAME merge_unique
-#define BOOST_INTRUSIVE_HAS_MEMBER_FUNCTION_CALLABLE_WITH_NS_BEG namespace boost { namespace container { namespace dtl {
-#define BOOST_INTRUSIVE_HAS_MEMBER_FUNCTION_CALLABLE_WITH_NS_END   }}}
-#define BOOST_INTRUSIVE_HAS_MEMBER_FUNCTION_CALLABLE_WITH_MIN 3
-#define BOOST_INTRUSIVE_HAS_MEMBER_FUNCTION_CALLABLE_WITH_MAX 3
-#include <boost/intrusive/detail/has_member_function_callable_with.hpp>
-
-//merge_equal
-#define BOOST_INTRUSIVE_HAS_MEMBER_FUNCTION_CALLABLE_WITH_FUNCNAME merge
-#define BOOST_INTRUSIVE_HAS_MEMBER_FUNCTION_CALLABLE_WITH_NS_BEG namespace boost { namespace container { namespace dtl {
-#define BOOST_INTRUSIVE_HAS_MEMBER_FUNCTION_CALLABLE_WITH_NS_END   }}}
-#define BOOST_INTRUSIVE_HAS_MEMBER_FUNCTION_CALLABLE_WITH_MIN 3
-#define BOOST_INTRUSIVE_HAS_MEMBER_FUNCTION_CALLABLE_WITH_MAX 3
-#include <boost/intrusive/detail/has_member_function_callable_with.hpp>
-
-//index_of
-#define BOOST_INTRUSIVE_HAS_MEMBER_FUNCTION_CALLABLE_WITH_FUNCNAME index_of
-#define BOOST_INTRUSIVE_HAS_MEMBER_FUNCTION_CALLABLE_WITH_NS_BEG namespace boost { namespace container { namespace dtl {
-#define BOOST_INTRUSIVE_HAS_MEMBER_FUNCTION_CALLABLE_WITH_NS_END   }}}
-#define BOOST_INTRUSIVE_HAS_MEMBER_FUNCTION_CALLABLE_WITH_MIN 1
-#define BOOST_INTRUSIVE_HAS_MEMBER_FUNCTION_CALLABLE_WITH_MAX 1
-#include <boost/intrusive/detail/has_member_function_callable_with.hpp>
-
-//nth
-#define BOOST_INTRUSIVE_HAS_MEMBER_FUNCTION_CALLABLE_WITH_FUNCNAME nth
-#define BOOST_INTRUSIVE_HAS_MEMBER_FUNCTION_CALLABLE_WITH_NS_BEG namespace boost { namespace container { namespace dtl {
-#define BOOST_INTRUSIVE_HAS_MEMBER_FUNCTION_CALLABLE_WITH_NS_END   }}}
-#define BOOST_INTRUSIVE_HAS_MEMBER_FUNCTION_CALLABLE_WITH_MIN 1
-#define BOOST_INTRUSIVE_HAS_MEMBER_FUNCTION_CALLABLE_WITH_MAX 1
-#include <boost/intrusive/detail/has_member_function_callable_with.hpp>
-
-//reserve
-#define BOOST_INTRUSIVE_HAS_MEMBER_FUNCTION_CALLABLE_WITH_FUNCNAME reserve
-#define BOOST_INTRUSIVE_HAS_MEMBER_FUNCTION_CALLABLE_WITH_NS_BEG namespace boost { namespace container { namespace dtl {
-#define BOOST_INTRUSIVE_HAS_MEMBER_FUNCTION_CALLABLE_WITH_NS_END   }}}
-#define BOOST_INTRUSIVE_HAS_MEMBER_FUNCTION_CALLABLE_WITH_MIN 1
-#define BOOST_INTRUSIVE_HAS_MEMBER_FUNCTION_CALLABLE_WITH_MAX 1
-#include <boost/intrusive/detail/has_member_function_callable_with.hpp>
-
-//capacity
-#define BOOST_INTRUSIVE_HAS_MEMBER_FUNCTION_CALLABLE_WITH_FUNCNAME capacity
-#define BOOST_INTRUSIVE_HAS_MEMBER_FUNCTION_CALLABLE_WITH_NS_BEG namespace boost { namespace container { namespace dtl {
-#define BOOST_INTRUSIVE_HAS_MEMBER_FUNCTION_CALLABLE_WITH_NS_END   }}}
-#define BOOST_INTRUSIVE_HAS_MEMBER_FUNCTION_CALLABLE_WITH_MIN 0
-#define BOOST_INTRUSIVE_HAS_MEMBER_FUNCTION_CALLABLE_WITH_MAX 0
-#include <boost/intrusive/detail/has_member_function_callable_with.hpp>
-
-#if defined(BOOST_GCC) && (BOOST_GCC >= 40600)
-#pragma GCC diagnostic pop
-#endif
-
-
-#endif   //#ifndef BOOST_CONTAINER_DOXYGEN_INVOKED
-
-namespace boost {
-namespace container {
-namespace dtl {
-
-///////////////////////////////////////
-//
-// Helper functions to merge elements
-//
-///////////////////////////////////////
-
-BOOST_INTRUSIVE_INSTANTIATE_DEFAULT_TYPE_TMPLT(stored_allocator_type)
-
-///////////////////////////////////////
-//
-//  flat_tree_container_inplace_merge
-//
-///////////////////////////////////////
-template<class SequenceContainer, class Compare>
-BOOST_CONTAINER_FORCEINLINE void flat_tree_container_inplace_merge //is_contiguous_container == true
-   (SequenceContainer& dest, typename SequenceContainer::iterator it, Compare comp , dtl::true_)
-{
-   typedef typename SequenceContainer::value_type  value_type;
-   value_type *const braw = boost::movelib::to_raw_pointer(dest.data());
-   value_type *const iraw = boost::movelib::iterator_to_raw_pointer(it);
-   //Don't use iterator_to_raw_pointer for end as debug iterators can assert when
-   //"operator ->" is used with the end iterator
-   value_type *const eraw = braw + dest.size();
-   boost::movelib::adaptive_merge
-      (braw, iraw, eraw, comp, eraw, back_free_capacity<SequenceContainer>::get(dest));
-}
-
-template<class SequenceContainer, class Compare>
-BOOST_CONTAINER_FORCEINLINE void flat_tree_container_inplace_merge //is_contiguous_container == false
-   (SequenceContainer& dest, typename SequenceContainer::iterator it, Compare comp, dtl::false_)
-{
-   boost::movelib::adaptive_merge(dest.begin(), it, dest.end(), comp);
-}
-
-///////////////////////////////////////
-//
-//  flat_tree_container_inplace_sort_ending
-//
-///////////////////////////////////////
-template<class SequenceContainer, class Compare>
-BOOST_CONTAINER_FORCEINLINE void flat_tree_container_inplace_sort_ending //is_contiguous_container == true
-   (SequenceContainer& dest, typename SequenceContainer::iterator it, Compare comp, dtl::true_)
-{
-   typedef typename SequenceContainer::value_type  value_type;
-   value_type *const iraw = boost::movelib::iterator_to_raw_pointer(it);
-   //Don't use iterator_to_raw_pointer for end as debug iterators can assert when
-   //"operator ->" is used with the end iterator
-   value_type* const eraw = boost::movelib::to_raw_pointer(dest.data()) + dest.size();
-
-
-   boost::movelib::adaptive_sort
-      (iraw, eraw, comp, eraw, back_free_capacity<SequenceContainer>::get(dest));
-}
-
-template<class SequenceContainer, class Compare>
-BOOST_CONTAINER_FORCEINLINE void flat_tree_container_inplace_sort_ending //is_contiguous_container == false
-   (SequenceContainer& dest, typename SequenceContainer::iterator it, Compare comp , dtl::false_)
-{
-   boost::movelib::adaptive_sort(it, dest.end(), comp);
-}
-
-///////////////////////////////////////
-//
-//          flat_tree_merge
-//
-///////////////////////////////////////
-template<class SequenceContainer, class Iterator, class Compare>
-BOOST_CONTAINER_FORCEINLINE void flat_tree_merge_equal
-   (SequenceContainer& dest, Iterator first, Iterator last, Compare comp, dtl::true_)
-{
-   dest.merge(first, last, comp);
-}
-
-template<class SequenceContainer, class Iterator, class Compare>
-BOOST_CONTAINER_FORCEINLINE void flat_tree_merge_equal   //has_merge_unique == false
-   (SequenceContainer& dest, Iterator first, Iterator last, Compare comp, dtl::false_)
-{
-   if(first != last) {
-      typedef typename SequenceContainer::iterator    iterator;
-      iterator const it = dest.insert( dest.end(), first, last );
-      dtl::bool_<is_contiguous_container<SequenceContainer>::value> contiguous_tag;
-      (flat_tree_container_inplace_merge)(dest, it, comp, contiguous_tag);
-   }
-}
-
-///////////////////////////////////////
-//
-//       flat_tree_merge_unique
-//
-///////////////////////////////////////
-template<class SequenceContainer, class Iterator, class Compare>
-BOOST_CONTAINER_FORCEINLINE void flat_tree_merge_unique  //has_merge_unique == true
-   (SequenceContainer& dest, Iterator first, Iterator last, Compare comp, dtl::true_)
-{
-   dest.merge_unique(first, last, comp);
-}
-
-template<class SequenceContainer, class Iterator, class Compare>
-BOOST_CONTAINER_FORCEINLINE void flat_tree_merge_unique  //has_merge_unique == false
-   (SequenceContainer& dest, Iterator first, Iterator last, Compare comp, dtl::false_)
-{
-   if (first != last) {
-      typedef typename SequenceContainer::iterator          iterator;
-      typedef typename SequenceContainer::size_type         size_type;
-      typedef typename SequenceContainer::difference_type   difference_type;
-
-      size_type const old_sz = dest.size();
-      iterator const first_new = dest.insert(dest.cend(), first, last );
-      iterator e = boost::movelib::inplace_set_unique_difference(first_new, dest.end(), dest.begin(), first_new, comp);
-      dest.erase(e, dest.end());
-      dtl::bool_<is_contiguous_container<SequenceContainer>::value> contiguous_tag;
-      (flat_tree_container_inplace_merge)(dest, dest.begin() + difference_type(old_sz), comp, contiguous_tag);
-   }
-}
-
-///////////////////////////////////////
-//
-//         flat_tree_index_of
-//
-///////////////////////////////////////
-template<class SequenceContainer, class Iterator>
-BOOST_CONTAINER_FORCEINLINE typename SequenceContainer::size_type
-   flat_tree_index_of   // has_index_of == true
-      (SequenceContainer& cont, Iterator p, dtl::true_)
-{
-   return cont.index_of(p);
-}
-
-template<class SequenceContainer, class Iterator>
-BOOST_CONTAINER_FORCEINLINE typename SequenceContainer::size_type
-   flat_tree_index_of   // has_index_of == false
-      (SequenceContainer& cont, Iterator p, dtl::false_)
-{
-   typedef typename SequenceContainer::size_type size_type;
-   return static_cast<size_type>(p - cont.begin());
-}
-
-///////////////////////////////////////
-//
-//         flat_tree_nth
-//
-///////////////////////////////////////
-template<class Iterator, class SequenceContainer>
-BOOST_CONTAINER_FORCEINLINE Iterator
-   flat_tree_nth  // has_nth == true
-      (SequenceContainer& cont, typename SequenceContainer::size_type n, dtl::true_)
-{
-   return cont.nth(n);
-}
-
-template<class Iterator, class SequenceContainer>
-BOOST_CONTAINER_FORCEINLINE Iterator
-   flat_tree_nth  // has_nth == false
-      (SequenceContainer& cont, typename SequenceContainer::size_type n, dtl::false_)
-{
-   return cont.begin()+ typename SequenceContainer::difference_type(n);
-}
-
-///////////////////////////////////////
-//
-//    flat_tree_get_stored_allocator
-//
-///////////////////////////////////////
-template<class SequenceContainer>
-BOOST_CONTAINER_FORCEINLINE typename SequenceContainer::stored_allocator_type &
-   flat_tree_get_stored_allocator   // has_get_stored_allocator == true
-      (SequenceContainer& cont, dtl::true_)
-{
-   return cont.get_stored_allocator();
-}
-
-template<class SequenceContainer>
-BOOST_CONTAINER_FORCEINLINE const typename SequenceContainer::stored_allocator_type &
-   flat_tree_get_stored_allocator   // has_get_stored_allocator == true
-      (const SequenceContainer& cont, dtl::true_)
-{
-   return cont.get_stored_allocator();
-}
-
-template<class SequenceContainer>
-BOOST_CONTAINER_FORCEINLINE typename SequenceContainer::allocator_type
-   flat_tree_get_stored_allocator   // has_get_stored_allocator == false
-      (SequenceContainer& cont, dtl::false_)
-{
-   return cont.get_allocator();
-}
-
-///////////////////////////////////////
-//
-//    flat_tree_adopt_sequence_equal
-//
-///////////////////////////////////////
-template<class SequenceContainer, class Compare>
-void flat_tree_sort_contiguous_to_adopt // is_contiguous_container == true
-   (SequenceContainer &tseq, BOOST_RV_REF(SequenceContainer) seq, Compare comp)
-{
-   if(tseq.capacity() >= (seq.capacity() - seq.size())) {
-      tseq.clear();
-      boost::movelib::adaptive_sort
-      (boost::movelib::iterator_to_raw_pointer(seq.begin())
-         , boost::movelib::iterator_to_raw_pointer(seq.end())
-         , comp
-         , boost::movelib::iterator_to_raw_pointer(tseq.begin())
-         , tseq.capacity());
-   }
-   else{
-      boost::movelib::adaptive_sort
-      (boost::movelib::iterator_to_raw_pointer(seq.begin())
-         , boost::movelib::iterator_to_raw_pointer(seq.end())
-         , comp
-         , boost::movelib::iterator_to_raw_pointer(seq.end())
-         , seq.capacity() - seq.size());
-   }
-}
-
-template<class SequenceContainer, class Compare>
-BOOST_CONTAINER_FORCEINLINE void flat_tree_adopt_sequence_equal // is_contiguous_container == true
-   (SequenceContainer &tseq, BOOST_RV_REF(SequenceContainer) seq, Compare comp, dtl::true_)
-{
-   flat_tree_sort_contiguous_to_adopt(tseq, boost::move(seq), comp);
-   tseq = boost::move(seq);
-}
-
-template<class SequenceContainer, class Compare>
-BOOST_CONTAINER_FORCEINLINE void flat_tree_adopt_sequence_equal // is_contiguous_container == false
-   (SequenceContainer &tseq, BOOST_RV_REF(SequenceContainer) seq, Compare comp, dtl::false_)
-{
-   boost::movelib::adaptive_sort(seq.begin(), seq.end(), comp);
-   tseq = boost::move(seq);
-}
-
-///////////////////////////////////////
-//
-//    flat_tree_adopt_sequence_unique
-//
-///////////////////////////////////////
-template<class SequenceContainer, class Compare>
-void flat_tree_adopt_sequence_unique// is_contiguous_container == true
-   (SequenceContainer &tseq, BOOST_RV_REF(SequenceContainer) seq, Compare comp, dtl::true_)
-{
-   boost::movelib::pdqsort
-      ( boost::movelib::iterator_to_raw_pointer(seq.begin())
-      , boost::movelib::iterator_to_raw_pointer(seq.end())
-      , comp);
-   seq.erase(boost::movelib::unique
-      (seq.begin(), seq.end(), boost::movelib::negate<Compare>(comp)), seq.cend());
-   tseq = boost::move(seq);
-}
-
-template<class SequenceContainer, class Compare>
-void flat_tree_adopt_sequence_unique// is_contiguous_container == false
-   (SequenceContainer &tseq, BOOST_RV_REF(SequenceContainer) seq, Compare comp, dtl::false_)
-{
-   boost::movelib::pdqsort(seq.begin(), seq.end(), comp);
-   seq.erase(boost::movelib::unique
-      (seq.begin(), seq.end(), boost::movelib::negate<Compare>(comp)), seq.cend());
-   tseq = boost::move(seq);
-}
-
-///////////////////////////////////////
-//
-//       flat_tree_reserve
-//
-///////////////////////////////////////
-template<class SequenceContainer>
-BOOST_CONTAINER_FORCEINLINE void // has_reserve == true
-   flat_tree_reserve(SequenceContainer &tseq, typename SequenceContainer::size_type cap, dtl::true_)
-{
-   tseq.reserve(cap);
-}
-
-template<class SequenceContainer>
-BOOST_CONTAINER_FORCEINLINE void // has_reserve == false
-   flat_tree_reserve(SequenceContainer &, typename SequenceContainer::size_type, dtl::false_)
-{
-}
-
-///////////////////////////////////////
-//
-//       flat_tree_capacity
-//
-///////////////////////////////////////
-template<class SequenceContainer>   // has_capacity == true
-BOOST_CONTAINER_FORCEINLINE typename SequenceContainer::size_type
-   flat_tree_capacity(const SequenceContainer &tseq, dtl::true_)
-{
-   return tseq.capacity();
-}
-
-template<class SequenceContainer>   // has_capacity == false
-BOOST_CONTAINER_FORCEINLINE typename SequenceContainer::size_type
-   flat_tree_capacity(const SequenceContainer &tseq, dtl::false_)
-{
-   return tseq.size();
-}
-
-///////////////////////////////////////
-//
-//       flat_tree_value_compare
-//
-///////////////////////////////////////
-
-template<class Compare, class Value, class KeyOfValue>
-class flat_tree_value_compare
-   : private Compare
-{
-   typedef Value              first_argument_type;
-   typedef Value              second_argument_type;
-   typedef bool               return_type;
-   public:
-   BOOST_CONTAINER_FORCEINLINE flat_tree_value_compare()
-      : Compare()
-   {}
-
-   BOOST_CONTAINER_FORCEINLINE flat_tree_value_compare(const Compare &pred)
-      : Compare(pred)
-   {}
-
-   BOOST_CONTAINER_FORCEINLINE bool operator()(const Value& lhs, const Value& rhs) const
-   {
-      KeyOfValue key_extract;
-      return Compare::operator()(key_extract(lhs), key_extract(rhs));
-   }
-
-   BOOST_CONTAINER_FORCEINLINE const Compare &get_comp() const
-      {  return *this;  }
-
-   BOOST_CONTAINER_FORCEINLINE Compare &get_comp()
-      {  return *this;  }
-};
-
-
-///////////////////////////////////////
-//
-//       select_container_type
-//
-///////////////////////////////////////
-template < class Value, class AllocatorOrContainer
-         , bool = boost::container::dtl::is_container<AllocatorOrContainer>::value
-         >
-struct select_container_type
-{
-   typedef AllocatorOrContainer type;
-};
-
-template <class Value, class AllocatorOrContainer>
-struct select_container_type<Value, AllocatorOrContainer, false>
-{
-   typedef boost::container::vector<Value, typename real_allocator<Value, AllocatorOrContainer>::type> type;
-};
-
-
-///////////////////////////////////////
-//
-//          flat_tree
-//
-///////////////////////////////////////
-template <class Value, class KeyOfValue,
-          class Compare, class AllocatorOrContainer>
-class flat_tree
-{
-   public:
-   typedef typename select_container_type<Value, AllocatorOrContainer>::type container_type;
-   typedef container_type sequence_type;  //For backwards compatibility
-
-   private:
-   typedef typename container_type::allocator_type        allocator_t;
-   typedef allocator_traits<allocator_t>                 allocator_traits_type;
-
-   public:
-   typedef flat_tree_value_compare<Compare, Value, KeyOfValue> value_compare;
-
-   private:
-   
-   struct Data
-      //Inherit from value_compare to do EBO
-      : public value_compare
-   {
-      BOOST_COPYABLE_AND_MOVABLE(Data)
-
-      public:
-      BOOST_CONTAINER_FORCEINLINE Data()
-         : value_compare(), m_seq()
-      {}
-
-      BOOST_CONTAINER_FORCEINLINE explicit Data(const allocator_t &alloc)
-         : value_compare(), m_seq(alloc)
-      {}
-
-      BOOST_CONTAINER_FORCEINLINE explicit Data(const Compare &comp)
-         : value_compare(comp), m_seq()
-      {}
-
-      BOOST_CONTAINER_FORCEINLINE Data(const Compare &comp, const allocator_t &alloc)
-         : value_compare(comp), m_seq(alloc)
-      {}
-
-      BOOST_CONTAINER_FORCEINLINE explicit Data(const Data &d)
-         : value_compare(static_cast<const value_compare&>(d)), m_seq(d.m_seq)
-      {}
-
-      BOOST_CONTAINER_FORCEINLINE Data(BOOST_RV_REF(Data) d)
-         : value_compare(boost::move(static_cast<value_compare&>(d))), m_seq(boost::move(d.m_seq))
-      {}
-
-      BOOST_CONTAINER_FORCEINLINE Data(const Data &d, const allocator_t &a)
-         : value_compare(static_cast<const value_compare&>(d)), m_seq(d.m_seq, a)
-      {}
-
-      BOOST_CONTAINER_FORCEINLINE Data(BOOST_RV_REF(Data) d, const allocator_t &a)
-         : value_compare(boost::move(static_cast<value_compare&>(d))), m_seq(boost::move(d.m_seq), a)
-      {}
-
-      Data& operator=(BOOST_COPY_ASSIGN_REF(Data) d)
-      {
-         this->value_compare::operator=(d);
-         m_seq = d.m_seq;
-         return *this;
-      }
-
-      Data& operator=(BOOST_RV_REF(Data) d)
-      {
-         this->value_compare::operator=(boost::move(static_cast<value_compare &>(d)));
-         m_seq = boost::move(d.m_seq);
-         return *this;
-      }
-
-      void swap(Data &d)
-      {
-         value_compare& mycomp    = *this, & othercomp = d;
-         boost::adl_move_swap(mycomp, othercomp);
-         this->m_seq.swap(d.m_seq);
-      }
-
-      container_type m_seq;
-   };
-
-   Data m_data;
-   BOOST_COPYABLE_AND_MOVABLE(flat_tree)
-
-   public:
-
-   typedef typename container_type::value_type               value_type;
-   typedef typename container_type::pointer                  pointer;
-   typedef typename container_type::const_pointer            const_pointer;
-   typedef typename container_type::reference                reference;
-   typedef typename container_type::const_reference          const_reference;
-   typedef typename KeyOfValue::type                        key_type;
-   typedef Compare                                          key_compare;
-   typedef typename container_type::allocator_type           allocator_type;
-   typedef typename container_type::size_type                size_type;
-   typedef typename container_type::difference_type          difference_type;
-   typedef typename container_type::iterator                 iterator;
-   typedef typename container_type::const_iterator           const_iterator;
-   typedef typename container_type::reverse_iterator         reverse_iterator;
-   typedef typename container_type::const_reverse_iterator   const_reverse_iterator;
-
-   //!Standard extension
-   typedef BOOST_INTRUSIVE_OBTAIN_TYPE_WITH_DEFAULT
-      (boost::container::dtl::, container_type
-      ,stored_allocator_type, allocator_type)               stored_allocator_type;
-
-   static const bool has_stored_allocator_type =
-      BOOST_INTRUSIVE_HAS_TYPE(boost::container::dtl::, container_type, stored_allocator_type);
-
-   private:
-   typedef allocator_traits<stored_allocator_type> stored_allocator_traits;
-
-   public:
-   typedef typename dtl::if_c
-      <has_stored_allocator_type, const stored_allocator_type &, allocator_type>::type get_stored_allocator_const_return_t;
-
-   typedef typename dtl::if_c
-      <has_stored_allocator_type, stored_allocator_type &, allocator_type>::type get_stored_allocator_noconst_return_t;
-
-   BOOST_CONTAINER_FORCEINLINE flat_tree()
-      : m_data()
-   { }
-
-   BOOST_CONTAINER_FORCEINLINE explicit flat_tree(const Compare& comp)
-      : m_data(comp)
-   { }
-
-   BOOST_CONTAINER_FORCEINLINE explicit flat_tree(const allocator_type& a)
-      : m_data(a)
-   { }
-
-   BOOST_CONTAINER_FORCEINLINE flat_tree(const Compare& comp, const allocator_type& a)
-      : m_data(comp, a)
-   { }
-
-   BOOST_CONTAINER_FORCEINLINE flat_tree(const flat_tree& x)
-      :  m_data(x.m_data)
-   { }
-
-   BOOST_CONTAINER_FORCEINLINE flat_tree(BOOST_RV_REF(flat_tree) x)
-      BOOST_NOEXCEPT_IF(boost::container::dtl::is_nothrow_move_constructible<Compare>::value)
-      :  m_data(boost::move(x.m_data))
-   { }
-
-   BOOST_CONTAINER_FORCEINLINE flat_tree(const flat_tree& x, const allocator_type &a)
-      :  m_data(x.m_data, a)
-   { }
-
-   BOOST_CONTAINER_FORCEINLINE flat_tree(BOOST_RV_REF(flat_tree) x, const allocator_type &a)
-      :  m_data(boost::move(x.m_data), a)
-   { }
-
-   template <class InputIterator>
-   BOOST_CONTAINER_FORCEINLINE
-   flat_tree( ordered_range_t, InputIterator first, InputIterator last)
-      : m_data()
-   {
-      this->m_data.m_seq.insert(this->m_data.m_seq.end(), first, last);
-      BOOST_ASSERT((is_sorted)(this->m_data.m_seq.cbegin(), this->m_data.m_seq.cend(), this->priv_value_comp()));
-   }
-
-   template <class InputIterator>
-   BOOST_CONTAINER_FORCEINLINE
-   flat_tree( ordered_range_t, InputIterator first, InputIterator last, const Compare& comp)
-      : m_data(comp)
-   {
-      this->m_data.m_seq.insert(this->m_data.m_seq.end(), first, last);
-      BOOST_ASSERT((is_sorted)(this->m_data.m_seq.cbegin(), this->m_data.m_seq.cend(), this->priv_value_comp()));
-   }
-
-   template <class InputIterator>
-   BOOST_CONTAINER_FORCEINLINE
-   flat_tree( ordered_range_t, InputIterator first, InputIterator last, const Compare& comp, const allocator_type& a)
-      : m_data(comp, a)
-   {
-      this->m_data.m_seq.insert(this->m_data.m_seq.end(), first, last);
-      BOOST_ASSERT((is_sorted)(this->m_data.m_seq.cbegin(), this->m_data.m_seq.cend(), this->priv_value_comp()));
-   }
-
-   template <class InputIterator>
-   BOOST_CONTAINER_FORCEINLINE
-   flat_tree( ordered_unique_range_t, InputIterator first, InputIterator last)
-      : m_data()
-   {
-      this->m_data.m_seq.insert(this->m_data.m_seq.end(), first, last);
-      BOOST_ASSERT((is_sorted_and_unique)(this->m_data.m_seq.cbegin(), this->m_data.m_seq.cend(), this->priv_value_comp()));
-   }
-
-   template <class InputIterator>
-   BOOST_CONTAINER_FORCEINLINE
-   flat_tree( ordered_unique_range_t, InputIterator first, InputIterator last, const Compare& comp)
-      : m_data(comp)
-   {
-      this->m_data.m_seq.insert(this->m_data.m_seq.end(), first, last);
-      BOOST_ASSERT((is_sorted_and_unique)(this->m_data.m_seq.cbegin(), this->m_data.m_seq.cend(), this->priv_value_comp()));
-   }
-
-   template <class InputIterator>
-   BOOST_CONTAINER_FORCEINLINE
-   flat_tree( ordered_unique_range_t, InputIterator first, InputIterator last, const Compare& comp, const allocator_type& a)
-      : m_data(comp, a)
-   {
-      this->m_data.m_seq.insert(this->m_data.m_seq.end(), first, last);
-      BOOST_ASSERT((is_sorted_and_unique)(this->m_data.m_seq.cbegin(), this->m_data.m_seq.cend(), this->priv_value_comp()));
-   }
-
-   template <class InputIterator>
-   BOOST_CONTAINER_FORCEINLINE
-   flat_tree( bool unique_insertion, InputIterator first, InputIterator last)
-      : m_data()
-   {
-      this->priv_range_insertion_construct(unique_insertion, first, last);
-   }
-
-   template <class InputIterator>
-   BOOST_CONTAINER_FORCEINLINE
-   flat_tree( bool unique_insertion, InputIterator first, InputIterator last
-            , const Compare& comp)
-      : m_data(comp)
-   {
-      this->priv_range_insertion_construct(unique_insertion, first, last);
-   }
-
-   template <class InputIterator>
-   BOOST_CONTAINER_FORCEINLINE
-   flat_tree( bool unique_insertion, InputIterator first, InputIterator last
-            , const allocator_type& a)
-      : m_data(a)
-   {
-      this->priv_range_insertion_construct(unique_insertion, first, last);
-   }
-
-   template <class InputIterator>
-   BOOST_CONTAINER_FORCEINLINE
-   flat_tree( bool unique_insertion, InputIterator first, InputIterator last
-            , const Compare& comp, const allocator_type& a)
-      : m_data(comp, a)
-   {
-      this->priv_range_insertion_construct(unique_insertion, first, last);
-   }
-
-   BOOST_CONTAINER_FORCEINLINE ~flat_tree()
-   {}
-
-   BOOST_CONTAINER_FORCEINLINE flat_tree&  operator=(BOOST_COPY_ASSIGN_REF(flat_tree) x)
-   {  m_data = x.m_data;   return *this;  }
-
-   BOOST_CONTAINER_FORCEINLINE flat_tree&  operator=(BOOST_RV_REF(flat_tree) x)
-      BOOST_NOEXCEPT_IF( (allocator_traits_type::propagate_on_container_move_assignment::value ||
-                          allocator_traits_type::is_always_equal::value) &&
-                           boost::container::dtl::is_nothrow_move_assignable<Compare>::value)
-   {  m_data = boost::move(x.m_data); return *this;  }
-
-   BOOST_CONTAINER_FORCEINLINE const value_compare &priv_value_comp() const
-   { return static_cast<const value_compare &>(this->m_data); }
-
-   BOOST_CONTAINER_FORCEINLINE value_compare &priv_value_comp()
-   { return static_cast<value_compare &>(this->m_data); }
-
-   BOOST_CONTAINER_FORCEINLINE const key_compare &priv_key_comp() const
-   { return this->priv_value_comp().get_comp(); }
-
-   BOOST_CONTAINER_FORCEINLINE key_compare &priv_key_comp()
-   { return this->priv_value_comp().get_comp(); }
-
-   struct insert_commit_data
-   {
-      const_iterator position;
-   };
-
-   public:
-   // accessors:
-   BOOST_CONTAINER_ATTRIBUTE_NODISCARD BOOST_CONTAINER_FORCEINLINE
-      Compare key_comp() const
-   { return this->m_data.get_comp(); }
-
-   BOOST_CONTAINER_ATTRIBUTE_NODISCARD BOOST_CONTAINER_FORCEINLINE
-      value_compare value_comp() const
-   { return this->m_data; }
-
-   BOOST_CONTAINER_ATTRIBUTE_NODISCARD BOOST_CONTAINER_FORCEINLINE
-      allocator_type get_allocator() const
-   { return this->m_data.m_seq.get_allocator(); }
-
-   BOOST_CONTAINER_ATTRIBUTE_NODISCARD BOOST_CONTAINER_FORCEINLINE
-      get_stored_allocator_const_return_t get_stored_allocator() const
-   {
-      return flat_tree_get_stored_allocator(this->m_data.m_seq, dtl::bool_<has_stored_allocator_type>());
-   }
-
-   BOOST_CONTAINER_ATTRIBUTE_NODISCARD BOOST_CONTAINER_FORCEINLINE
-      get_stored_allocator_noconst_return_t get_stored_allocator()
-   {
-      return flat_tree_get_stored_allocator(this->m_data.m_seq, dtl::bool_<has_stored_allocator_type>());
-   }
-
-   BOOST_CONTAINER_ATTRIBUTE_NODISCARD BOOST_CONTAINER_FORCEINLINE
-      iterator begin()
-   { return this->m_data.m_seq.begin(); }
-
-   BOOST_CONTAINER_ATTRIBUTE_NODISCARD BOOST_CONTAINER_FORCEINLINE
-      const_iterator begin() const
-   { return this->cbegin(); }
-
-   BOOST_CONTAINER_ATTRIBUTE_NODISCARD BOOST_CONTAINER_FORCEINLINE
-      const_iterator cbegin() const
-   { return this->m_data.m_seq.begin(); }
-
-   BOOST_CONTAINER_ATTRIBUTE_NODISCARD BOOST_CONTAINER_FORCEINLINE
-      iterator end()
-   { return this->m_data.m_seq.end(); }
-
-   BOOST_CONTAINER_ATTRIBUTE_NODISCARD BOOST_CONTAINER_FORCEINLINE
-      const_iterator end() const
-   { return this->cend(); }
-
-   BOOST_CONTAINER_ATTRIBUTE_NODISCARD BOOST_CONTAINER_FORCEINLINE
-      const_iterator cend() const
-   { return this->m_data.m_seq.end(); }
-
-   BOOST_CONTAINER_ATTRIBUTE_NODISCARD BOOST_CONTAINER_FORCEINLINE
-      reverse_iterator rbegin()
-   { return reverse_iterator(this->end()); }
-
-   BOOST_CONTAINER_ATTRIBUTE_NODISCARD BOOST_CONTAINER_FORCEINLINE
-      const_reverse_iterator rbegin() const
-   {  return this->crbegin();  }
-
-   BOOST_CONTAINER_ATTRIBUTE_NODISCARD BOOST_CONTAINER_FORCEINLINE
-      const_reverse_iterator crbegin() const
-   {  return const_reverse_iterator(this->cend());  }
-
-   BOOST_CONTAINER_ATTRIBUTE_NODISCARD BOOST_CONTAINER_FORCEINLINE
-      reverse_iterator rend()
-   { return reverse_iterator(this->begin()); }
-
-   BOOST_CONTAINER_ATTRIBUTE_NODISCARD BOOST_CONTAINER_FORCEINLINE
-      const_reverse_iterator rend() const
-   { return this->crend(); }
-
-   BOOST_CONTAINER_ATTRIBUTE_NODISCARD BOOST_CONTAINER_FORCEINLINE
-      const_reverse_iterator crend() const
-   { return const_reverse_iterator(this->cbegin()); }
-
-   BOOST_CONTAINER_ATTRIBUTE_NODISCARD BOOST_CONTAINER_FORCEINLINE
-      bool empty() const
-   { return this->m_data.m_seq.empty(); }
-
-   BOOST_CONTAINER_ATTRIBUTE_NODISCARD BOOST_CONTAINER_FORCEINLINE
-      size_type size() const
-   { return this->m_data.m_seq.size(); }
-
-   BOOST_CONTAINER_ATTRIBUTE_NODISCARD BOOST_CONTAINER_FORCEINLINE
-      size_type max_size() const
-   { return this->m_data.m_seq.max_size(); }
-
-   BOOST_CONTAINER_FORCEINLINE void swap(flat_tree& other)
-      BOOST_NOEXCEPT_IF(  allocator_traits_type::is_always_equal::value
-                                 && boost::container::dtl::is_nothrow_swappable<Compare>::value )
-   {  this->m_data.swap(other.m_data);  }
-
-   public:
-   // insert/erase
-   std::pair<iterator,bool> insert_unique(const value_type& val)
-   {
-      std::pair<iterator,bool> ret;
-      insert_commit_data data;
-      ret.second = this->priv_insert_unique_prepare(KeyOfValue()(val), data);
-      ret.first = ret.second ? this->priv_insert_commit(data, val)
-                             : this->begin() + (data.position - this->cbegin());
-                             //: iterator(vector_iterator_get_ptr(data.position));
-      return ret;
-   }
-
-   std::pair<iterator,bool> insert_unique(BOOST_RV_REF(value_type) val)
-   {
-      std::pair<iterator,bool> ret;
-      insert_commit_data data;
-      ret.second = this->priv_insert_unique_prepare(KeyOfValue()(val), data);
-      ret.first = ret.second ? this->priv_insert_commit(data, boost::move(val))
-                             : this->begin() + (data.position - this->cbegin());
-                             //: iterator(vector_iterator_get_ptr(data.position));
-      return ret;
-   }
-
-   iterator insert_equal(const value_type& val)
-   {
-      iterator i = this->upper_bound(KeyOfValue()(val));
-      i = this->m_data.m_seq.insert(i, val);
-      return i;
-   }
-
-   iterator insert_equal(BOOST_RV_REF(value_type) mval)
-   {
-      iterator i = this->upper_bound(KeyOfValue()(mval));
-      i = this->m_data.m_seq.insert(i, boost::move(mval));
-      return i;
-   }
-
-   iterator insert_unique(const_iterator hint, const value_type& val)
-   {
-      BOOST_ASSERT(this->priv_in_range_or_end(hint));
-      insert_commit_data data;
-      return this->priv_insert_unique_prepare(hint, KeyOfValue()(val), data)
-            ? this->priv_insert_commit(data, val)
-            : this->begin() + (data.position - this->cbegin());
-            //: iterator(vector_iterator_get_ptr(data.position));
-   }
-
-   iterator insert_unique(const_iterator hint, BOOST_RV_REF(value_type) val)
-   {
-      BOOST_ASSERT(this->priv_in_range_or_end(hint));
-      insert_commit_data data;
-      return this->priv_insert_unique_prepare(hint, KeyOfValue()(val), data)
-         ? this->priv_insert_commit(data, boost::move(val))
-         : this->begin() + (data.position - this->cbegin());
-         //: iterator(vector_iterator_get_ptr(data.position));
-   }
-
-   iterator insert_equal(const_iterator hint, const value_type& val)
-   {
-      BOOST_ASSERT(this->priv_in_range_or_end(hint));
-      insert_commit_data data;
-      this->priv_insert_equal_prepare(hint, val, data);
-      return this->priv_insert_commit(data, val);
-   }
-
-   iterator insert_equal(const_iterator hint, BOOST_RV_REF(value_type) mval)
-   {
-      BOOST_ASSERT(this->priv_in_range_or_end(hint));
-      insert_commit_data data;
-      this->priv_insert_equal_prepare(hint, mval, data);
-      return this->priv_insert_commit(data, boost::move(mval));
-   }
-
-   template <class InIt>
-   void insert_unique(InIt first, InIt last)
-   {
-      dtl::bool_<is_contiguous_container<container_type>::value> contiguous_tag;
-      container_type &seq = this->m_data.m_seq;
-      value_compare &val_cmp = this->priv_value_comp();
-
-      //Step 1: put new elements in the back
-      typename container_type::iterator const it = seq.insert(seq.cend(), first, last);
-
-      //Step 2: sort them
-      boost::movelib::pdqsort(it, seq.end(), val_cmp);
-
-      //Step 3: only left unique values from the back not already present in the original range
-      typename container_type::iterator const e = boost::movelib::inplace_set_unique_difference
-         (it, seq.end(), seq.begin(), it, val_cmp);
-
-      seq.erase(e, seq.cend());
-      //it might be invalidated by erasing [e, seq.end) if e == it
-      if (it != e)
-      {
-         //Step 4: merge both ranges
-         (flat_tree_container_inplace_merge)(seq, it, this->priv_value_comp(), contiguous_tag);
-      }
-   }
-
-   template <class InIt>
-   void insert_equal(InIt first, InIt last)
-   {
-      if (first != last) {
-         dtl::bool_<is_contiguous_container<container_type>::value> contiguous_tag;
-         container_type &seq = this->m_data.m_seq;
-         typename container_type::iterator const it = seq.insert(seq.cend(), first, last);
-         (flat_tree_container_inplace_sort_ending)(seq, it, this->priv_value_comp(), contiguous_tag);
-         (flat_tree_container_inplace_merge)      (seq, it, this->priv_value_comp(), contiguous_tag);
-      }
-   }
-
-   //Ordered
-
-   template <class InIt>
-   void insert_equal(ordered_range_t, InIt first, InIt last)
-   {
-      const bool value = boost::container::dtl::
-         has_member_function_callable_with_merge_unique<container_type, InIt, InIt, value_compare>::value;
-      (flat_tree_merge_equal)(this->m_data.m_seq, first, last, this->priv_value_comp(), dtl::bool_<value>());
-   }
-
-   template <class InIt>
-   void insert_unique(ordered_unique_range_t, InIt first, InIt last)
-   {
-      const bool value = boost::container::dtl::
-         has_member_function_callable_with_merge_unique<container_type, InIt, InIt, value_compare>::value;
-      (flat_tree_merge_unique)(this->m_data.m_seq, first, last, this->priv_value_comp(), dtl::bool_<value>());
-   }
-
-   #if !defined(BOOST_NO_CXX11_VARIADIC_TEMPLATES)
-
-   template <class... Args>
-   std::pair<iterator, bool> emplace_unique(BOOST_FWD_REF(Args)... args)
-   {
-      typename dtl::aligned_storage<sizeof(value_type), dtl::alignment_of<value_type>::value>::type v;
-      get_stored_allocator_noconst_return_t a = this->get_stored_allocator();
-      stored_allocator_traits::construct(a, move_detail::force_ptr<value_type *>(&v), ::boost::forward<Args>(args)... );
-      value_type *pval = move_detail::force_ptr<value_type *>(&v);
-      value_destructor<stored_allocator_type, value_type> d(a, *pval);
-      return this->insert_unique(::boost::move(*pval));
-   }
-
-   template <class... Args>
-   iterator emplace_hint_unique(const_iterator hint, BOOST_FWD_REF(Args)... args)
-   {
-      //hint checked in insert_unique
-      typename dtl::aligned_storage<sizeof(value_type), dtl::alignment_of<value_type>::value>::type v;
-      get_stored_allocator_noconst_return_t a = this->get_stored_allocator();
-      stored_allocator_traits::construct(a, move_detail::force_ptr<value_type *>(&v), ::boost::forward<Args>(args)... );
-      value_type *pval = move_detail::force_ptr<value_type *>(&v);
-      value_destructor<stored_allocator_type, value_type> d(a, *pval);
-      return this->insert_unique(hint, ::boost::move(*pval));
-   }
-
-   template <class... Args>
-   iterator emplace_equal(BOOST_FWD_REF(Args)... args)
-   {
-      typename dtl::aligned_storage<sizeof(value_type), dtl::alignment_of<value_type>::value>::type v;
-      get_stored_allocator_noconst_return_t a = this->get_stored_allocator();
-      stored_allocator_traits::construct(a, move_detail::force_ptr<value_type *>(&v), ::boost::forward<Args>(args)... );
-      value_type *pval = move_detail::force_ptr<value_type *>(&v);
-      value_destructor<stored_allocator_type, value_type> d(a, *pval);
-      return this->insert_equal(::boost::move(*pval));
-   }
-
-   template <class... Args>
-   iterator emplace_hint_equal(const_iterator hint, BOOST_FWD_REF(Args)... args)
-   {
-      //hint checked in insert_equal
-      typename dtl::aligned_storage<sizeof(value_type), dtl::alignment_of<value_type>::value>::type v;
-      get_stored_allocator_noconst_return_t a = this->get_stored_allocator();
-      stored_allocator_traits::construct(a, move_detail::force_ptr<value_type *>(&v), ::boost::forward<Args>(args)... );
-      value_type *pval = move_detail::force_ptr<value_type *>(&v);
-      value_destructor<stored_allocator_type, value_type> d(a, *pval);
-      return this->insert_equal(hint, ::boost::move(*pval));
-   }
-
-   template <class KeyType, class... Args>
-   BOOST_CONTAINER_FORCEINLINE std::pair<iterator, bool> try_emplace
-      (const_iterator hint, BOOST_FWD_REF(KeyType) key, BOOST_FWD_REF(Args)... args)
-   {
-      std::pair<iterator,bool> ret;
-      insert_commit_data data;
-      const key_type & k = key;
-      ret.second = hint == const_iterator()
-         ? this->priv_insert_unique_prepare(k, data)
-         : this->priv_insert_unique_prepare(hint, k, data);
-
-      if(!ret.second){
-         ret.first  = this->nth(size_type(data.position - this->cbegin()));
-      }
-      else{
-         ret.first = this->m_data.m_seq.emplace(data.position, try_emplace_t(), ::boost::forward<KeyType>(key), ::boost::forward<Args>(args)...);
-      }
-      return ret;
-   }
-
-   #else // !defined(BOOST_NO_CXX11_VARIADIC_TEMPLATES)
-
-   #define BOOST_CONTAINER_FLAT_TREE_EMPLACE_CODE(N) \
-   BOOST_MOVE_TMPL_LT##N BOOST_MOVE_CLASS##N BOOST_MOVE_GT##N \
-   std::pair<iterator, bool> emplace_unique(BOOST_MOVE_UREF##N)\
-   {\
-      typename dtl::aligned_storage<sizeof(value_type), dtl::alignment_of<value_type>::value>::type v;\
-      get_stored_allocator_noconst_return_t a = this->get_stored_allocator();\
-      stored_allocator_traits::construct(a, move_detail::force_ptr<value_type *>(&v) BOOST_MOVE_I##N BOOST_MOVE_FWD##N);\
-      value_type *pval = move_detail::force_ptr<value_type *>(&v);\
-      value_destructor<stored_allocator_type, value_type> d(a, *pval);\
-      return this->insert_unique(::boost::move(*pval));\
-   }\
-   \
-   BOOST_MOVE_TMPL_LT##N BOOST_MOVE_CLASS##N BOOST_MOVE_GT##N \
-   iterator emplace_hint_unique(const_iterator hint BOOST_MOVE_I##N BOOST_MOVE_UREF##N)\
-   {\
-      typename dtl::aligned_storage<sizeof(value_type), dtl::alignment_of<value_type>::value>::type v;\
-      get_stored_allocator_noconst_return_t a = this->get_stored_allocator();\
-      stored_allocator_traits::construct(a, move_detail::force_ptr<value_type *>(&v) BOOST_MOVE_I##N BOOST_MOVE_FWD##N);\
-      value_type *pval = move_detail::force_ptr<value_type *>(&v);\
-      value_destructor<stored_allocator_type, value_type> d(a, *pval);\
-      return this->insert_unique(hint, ::boost::move(*pval));\
-   }\
-   \
-   BOOST_MOVE_TMPL_LT##N BOOST_MOVE_CLASS##N BOOST_MOVE_GT##N \
-   iterator emplace_equal(BOOST_MOVE_UREF##N)\
-   {\
-      typename dtl::aligned_storage<sizeof(value_type), dtl::alignment_of<value_type>::value>::type v;\
-      get_stored_allocator_noconst_return_t a = this->get_stored_allocator();\
-      stored_allocator_traits::construct(a, move_detail::force_ptr<value_type *>(&v) BOOST_MOVE_I##N BOOST_MOVE_FWD##N);\
-      value_type *pval = move_detail::force_ptr<value_type *>(&v);\
-      value_destructor<stored_allocator_type, value_type> d(a, *pval);\
-      return this->insert_equal(::boost::move(*pval));\
-   }\
-   \
-   BOOST_MOVE_TMPL_LT##N BOOST_MOVE_CLASS##N BOOST_MOVE_GT##N \
-   iterator emplace_hint_equal(const_iterator hint BOOST_MOVE_I##N BOOST_MOVE_UREF##N)\
-   {\
-      typename dtl::aligned_storage <sizeof(value_type), dtl::alignment_of<value_type>::value>::type v;\
-      get_stored_allocator_noconst_return_t a = this->get_stored_allocator();\
-      stored_allocator_traits::construct(a, move_detail::force_ptr<value_type *>(&v) BOOST_MOVE_I##N BOOST_MOVE_FWD##N);\
-      value_type *pval = move_detail::force_ptr<value_type *>(&v);\
-      value_destructor<stored_allocator_type, value_type> d(a, *pval);\
-      return this->insert_equal(hint, ::boost::move(*pval));\
-   }\
-   template <class KeyType BOOST_MOVE_I##N BOOST_MOVE_CLASS##N>\
-   BOOST_CONTAINER_FORCEINLINE std::pair<iterator, bool>\
-      try_emplace(const_iterator hint, BOOST_FWD_REF(KeyType) key BOOST_MOVE_I##N BOOST_MOVE_UREF##N)\
-   {\
-      std::pair<iterator,bool> ret;\
-      insert_commit_data data;\
-      const key_type & k = key;\
-      ret.second = hint == const_iterator()\
-         ? this->priv_insert_unique_prepare(k, data)\
-         : this->priv_insert_unique_prepare(hint, k, data);\
-      \
-      if(!ret.second){\
-         ret.first  = this->nth(size_type(data.position - this->cbegin()));\
-      }\
-      else{\
-         ret.first = this->m_data.m_seq.emplace(data.position, try_emplace_t(), ::boost::forward<KeyType>(key) BOOST_MOVE_I##N BOOST_MOVE_FWD##N);\
-      }\
-      return ret;\
-   }\
-   //
-   BOOST_MOVE_ITERATE_0TO7(BOOST_CONTAINER_FLAT_TREE_EMPLACE_CODE)
-   #undef BOOST_CONTAINER_FLAT_TREE_EMPLACE_CODE
-
-   #endif   // !defined(BOOST_NO_CXX11_VARIADIC_TEMPLATES)
-
-   template<class KeyType, class M>
-   std::pair<iterator, bool> insert_or_assign(const_iterator hint, BOOST_FWD_REF(KeyType) key, BOOST_FWD_REF(M) obj)
-   {
-      const key_type& k = key;
-      std::pair<iterator,bool> ret;
-      insert_commit_data data;
-      ret.second = hint == const_iterator()
-         ? this->priv_insert_unique_prepare(k, data)
-         : this->priv_insert_unique_prepare(hint, k, data);
-      if(!ret.second){
-         ret.first  = this->nth(size_type(data.position - this->cbegin()));
-         ret.first->second = boost::forward<M>(obj);
-      }
-      else{
-         ret.first = this->m_data.m_seq.emplace(data.position, boost::forward<KeyType>(key), boost::forward<M>(obj));
-      }
-      return ret;
-   }
-
-   BOOST_CONTAINER_FORCEINLINE iterator erase(const_iterator position)
-   {  return this->m_data.m_seq.erase(position);  }
-
-   size_type erase(const key_type& k)
-   {
-      std::pair<iterator,iterator > itp = this->equal_range(k);
-      size_type ret = static_cast<size_type>(itp.second-itp.first);
-      if (ret){
-         this->m_data.m_seq.erase(itp.first, itp.second);
-      }
-      return ret;
-   }
-
-   size_type erase_unique(const key_type& k)
-   {
-      const_iterator i = static_cast<const flat_tree &>(*this).find(k);
-      size_type ret = static_cast<size_type>(i != this->cend());
-      if (ret)
-         this->erase(i);
-      return ret;
-   }
-
-   BOOST_CONTAINER_FORCEINLINE iterator erase(const_iterator first, const_iterator last)
-   {  return this->m_data.m_seq.erase(first, last);  }
-
-   BOOST_CONTAINER_FORCEINLINE void clear()
-   {  this->m_data.m_seq.clear();  }
-
-   //! <b>Effects</b>: Tries to deallocate the excess of memory created
-   //    with previous allocations. The size of the vector is unchanged
-   //!
-   //! <b>Throws</b>: If memory allocation throws, or T's copy constructor throws.
-   //!
-   //! <b>Complexity</b>: Linear to size().
-   BOOST_CONTAINER_FORCEINLINE void shrink_to_fit()
-   {  this->m_data.m_seq.shrink_to_fit();  }
-
-   BOOST_CONTAINER_FORCEINLINE iterator nth(size_type n) BOOST_NOEXCEPT_OR_NOTHROW
-   {
-      const bool value = boost::container::dtl::
-         has_member_function_callable_with_nth<container_type, size_type>::value;
-      return flat_tree_nth<iterator>(this->m_data.m_seq, n, dtl::bool_<value>());
-   }
-
-   BOOST_CONTAINER_ATTRIBUTE_NODISCARD BOOST_CONTAINER_FORCEINLINE
-      const_iterator nth(size_type n) const BOOST_NOEXCEPT_OR_NOTHROW
-   {
-      const bool value = boost::container::dtl::
-         has_member_function_callable_with_nth<container_type, size_type>::value;
-      return flat_tree_nth<const_iterator>(this->m_data.m_seq, n, dtl::bool_<value>());
-   }
-
-   BOOST_CONTAINER_ATTRIBUTE_NODISCARD BOOST_CONTAINER_FORCEINLINE
-      size_type index_of(iterator p) BOOST_NOEXCEPT_OR_NOTHROW
-   {
-      const bool value = boost::container::dtl::
-         has_member_function_callable_with_index_of<container_type, iterator>::value;
-      return flat_tree_index_of(this->m_data.m_seq, p, dtl::bool_<value>());
-   }
-
-   BOOST_CONTAINER_ATTRIBUTE_NODISCARD BOOST_CONTAINER_FORCEINLINE
-      size_type index_of(const_iterator p) const BOOST_NOEXCEPT_OR_NOTHROW
-   {
-      const bool value = boost::container::dtl::
-         has_member_function_callable_with_index_of<container_type, const_iterator>::value;
-      return flat_tree_index_of(this->m_data.m_seq, p, dtl::bool_<value>());
-   }
-
-   // set operations:
-   BOOST_CONTAINER_ATTRIBUTE_NODISCARD
-      iterator find(const key_type& k)
-   {
-      iterator i = this->lower_bound(k);
-      iterator end_it = this->end();
-      if (i != end_it && this->m_data.get_comp()(k, KeyOfValue()(*i))){
-         i = end_it;
-      }
-      return i;
-   }
-
-   BOOST_CONTAINER_ATTRIBUTE_NODISCARD
-   const_iterator find(const key_type& k) const
-   {
-      const_iterator i = this->lower_bound(k);
-
-      const_iterator end_it = this->cend();
-      if (i != end_it && this->m_data.get_comp()(k, KeyOfValue()(*i))){
-         i = end_it;
-      }
-      return i;
-   }
-
-   template<class K>
-   BOOST_CONTAINER_ATTRIBUTE_NODISCARD
-      typename dtl::enable_if_transparent<key_compare, K, iterator>::type
-      find(const K& k)
-   {
-      iterator i = this->lower_bound(k);
-      iterator end_it = this->end();
-      if (i != end_it && this->m_data.get_comp()(k, KeyOfValue()(*i))){
-         i = end_it;
-      }
-      return i;
-   }
-
-   template<class K>
-   BOOST_CONTAINER_ATTRIBUTE_NODISCARD
-      typename dtl::enable_if_transparent<key_compare, K, const_iterator>::type
-      find(const K& k) const
-   {
-      const_iterator i = this->lower_bound(k);
-
-      const_iterator end_it = this->cend();
-      if (i != end_it && this->m_data.get_comp()(k, KeyOfValue()(*i))){
-         i = end_it;
-      }
-      return i;
-   }
-
-   BOOST_CONTAINER_ATTRIBUTE_NODISCARD
-      size_type count(const key_type& k) const
-   {
-      std::pair<const_iterator, const_iterator> p = this->equal_range(k);
-      size_type n = size_type(p.second - p.first);
-      return n;
-   }
-
-   template<class K>
-   BOOST_CONTAINER_ATTRIBUTE_NODISCARD
-      typename dtl::enable_if_transparent<key_compare, K, size_type>::type
-      count(const K& k) const
-   {
-      std::pair<const_iterator, const_iterator> p = this->equal_range(k);
-      size_type n = size_type(p.second - p.first);
-      return n;
-   }
-
-   BOOST_CONTAINER_ATTRIBUTE_NODISCARD BOOST_CONTAINER_FORCEINLINE bool contains(const key_type& x) const
-   {  return this->find(x) != this->cend();  }
-
-   template<typename K>
-   BOOST_CONTAINER_ATTRIBUTE_NODISCARD BOOST_CONTAINER_FORCEINLINE
-      typename dtl::enable_if_transparent<key_compare, K, bool>::type
-         contains(const K& x) const
-   {  return this->find(x) != this->cend();  }
-
-   template<class C2>
-   BOOST_CONTAINER_FORCEINLINE void merge_unique(flat_tree<Value, KeyOfValue, C2, AllocatorOrContainer>& source)
-   {
-      this->insert_unique( boost::make_move_iterator(source.begin())
-                         , boost::make_move_iterator(source.end()));
-   }
-
-   template<class C2>
-   BOOST_CONTAINER_FORCEINLINE void merge_equal(flat_tree<Value, KeyOfValue, C2, AllocatorOrContainer>& source)
-   {
-      this->insert_equal( boost::make_move_iterator(source.begin())
-                        , boost::make_move_iterator(source.end()));
-   }
-
-   BOOST_CONTAINER_FORCEINLINE void merge_unique(flat_tree& source)
-   {
-      const bool value = boost::container::dtl::
-         has_member_function_callable_with_merge_unique<container_type, iterator, iterator, value_compare>::value;
-      (flat_tree_merge_unique)
-         ( this->m_data.m_seq
-         , boost::make_move_iterator(source.m_data.m_seq.begin())
-         , boost::make_move_iterator(source.m_data.m_seq.end())
-         , this->priv_value_comp()
-         , dtl::bool_<value>());
-   }
-
-   BOOST_CONTAINER_FORCEINLINE void merge_equal(flat_tree& source)
-   {
-      const bool value = boost::container::dtl::
-         has_member_function_callable_with_merge<container_type, iterator, iterator, value_compare>::value;
-      (flat_tree_merge_equal)
-         ( this->m_data.m_seq
-         , boost::make_move_iterator(source.m_data.m_seq.begin())
-         , boost::make_move_iterator(source.m_data.m_seq.end())
-         , this->priv_value_comp()
-         , dtl::bool_<value>());
-   }
-
-   BOOST_CONTAINER_ATTRIBUTE_NODISCARD BOOST_CONTAINER_FORCEINLINE
-      iterator lower_bound(const key_type& k)
-   {  return this->priv_lower_bound(this->begin(), this->end(), k);  }
-
-   BOOST_CONTAINER_ATTRIBUTE_NODISCARD BOOST_CONTAINER_FORCEINLINE
-      const_iterator lower_bound(const key_type& k) const
-   {  return this->priv_lower_bound(this->cbegin(), this->cend(), k);  }
-
-   template<class K>
-   BOOST_CONTAINER_ATTRIBUTE_NODISCARD BOOST_CONTAINER_FORCEINLINE 
-      typename dtl::enable_if_transparent<key_compare, K, iterator>::type
-         lower_bound(const K& k)
-   {  return this->priv_lower_bound(this->begin(), this->end(), k);  }
-
-   template<class K>
-   BOOST_CONTAINER_ATTRIBUTE_NODISCARD BOOST_CONTAINER_FORCEINLINE 
-      typename dtl::enable_if_transparent<key_compare, K, const_iterator>::type
-         lower_bound(const K& k) const
-   {  return this->priv_lower_bound(this->cbegin(), this->cend(), k);  }
-
-   BOOST_CONTAINER_ATTRIBUTE_NODISCARD BOOST_CONTAINER_FORCEINLINE
-      iterator upper_bound(const key_type& k)
-   {  return this->priv_upper_bound(this->begin(), this->end(), k);  }
-
-   BOOST_CONTAINER_ATTRIBUTE_NODISCARD BOOST_CONTAINER_FORCEINLINE 
-      const_iterator upper_bound(const key_type& k) const
-   {  return this->priv_upper_bound(this->cbegin(), this->cend(), k);  }
-
-   template<class K>
-   BOOST_CONTAINER_ATTRIBUTE_NODISCARD BOOST_CONTAINER_FORCEINLINE
-      typename dtl::enable_if_transparent<key_compare, K,iterator>::type
-   upper_bound(const K& k)
-   {  return this->priv_upper_bound(this->begin(), this->end(), k);  }
-
-   template<class K>
-   BOOST_CONTAINER_ATTRIBUTE_NODISCARD BOOST_CONTAINER_FORCEINLINE
-      typename dtl::enable_if_transparent<key_compare, K,const_iterator>::type
-         upper_bound(const K& k) const
-   {  return this->priv_upper_bound(this->cbegin(), this->cend(), k);  }
-
-   BOOST_CONTAINER_ATTRIBUTE_NODISCARD BOOST_CONTAINER_FORCEINLINE
-      std::pair<iterator,iterator> equal_range(const key_type& k)
-   {  return this->priv_equal_range(this->begin(), this->end(), k);  }
-
-   BOOST_CONTAINER_ATTRIBUTE_NODISCARD BOOST_CONTAINER_FORCEINLINE
-      std::pair<const_iterator, const_iterator> equal_range(const key_type& k) const
-   {  return this->priv_equal_range(this->cbegin(), this->cend(), k);  }
-
-   template<class K>
-   BOOST_CONTAINER_ATTRIBUTE_NODISCARD BOOST_CONTAINER_FORCEINLINE
-      typename dtl::enable_if_transparent<key_compare, K, std::pair<iterator,iterator> >::type
-         equal_range(const K& k)
-   {  return this->priv_equal_range(this->begin(), this->end(), k);  }
-
-   template<class K>
-   BOOST_CONTAINER_ATTRIBUTE_NODISCARD BOOST_CONTAINER_FORCEINLINE
-      typename dtl::enable_if_transparent<key_compare, K,std::pair<const_iterator,const_iterator> >::type
-         equal_range(const K& k) const
-   {  return this->priv_equal_range(this->cbegin(), this->cend(), k);  }
-
-
-   BOOST_CONTAINER_ATTRIBUTE_NODISCARD BOOST_CONTAINER_FORCEINLINE
-      std::pair<iterator, iterator> lower_bound_range(const key_type& k)
-   {  return this->priv_lower_bound_range(this->begin(), this->end(), k);  }
-
-   BOOST_CONTAINER_ATTRIBUTE_NODISCARD BOOST_CONTAINER_FORCEINLINE
-      std::pair<const_iterator, const_iterator> lower_bound_range(const key_type& k) const
-   {  return this->priv_lower_bound_range(this->cbegin(), this->cend(), k);  }
-
-   template<class K>
-   BOOST_CONTAINER_ATTRIBUTE_NODISCARD BOOST_CONTAINER_FORCEINLINE
-      typename dtl::enable_if_transparent<key_compare, K,std::pair<iterator,iterator> >::type
-         lower_bound_range(const K& k)
-   {  return this->priv_lower_bound_range(this->begin(), this->end(), k);  }
-
-   template<class K>
-   BOOST_CONTAINER_ATTRIBUTE_NODISCARD BOOST_CONTAINER_FORCEINLINE
-      typename dtl::enable_if_transparent<key_compare, K,std::pair<const_iterator,const_iterator> >::type
-         lower_bound_range(const K& k) const
-   {  return this->priv_lower_bound_range(this->cbegin(), this->cend(), k);  }
-
-   BOOST_CONTAINER_ATTRIBUTE_NODISCARD BOOST_CONTAINER_FORCEINLINE
-      size_type capacity() const
-   {
-      const bool value = boost::container::dtl::
-         has_member_function_callable_with_capacity<container_type>::value;
-      return (flat_tree_capacity)(this->m_data.m_seq, dtl::bool_<value>());
-   }
-
-   BOOST_CONTAINER_FORCEINLINE
-      void reserve(size_type cnt)
-   {
-      const bool value = boost::container::dtl::
-         has_member_function_callable_with_reserve<container_type, size_type>::value;
-      (flat_tree_reserve)(this->m_data.m_seq, cnt, dtl::bool_<value>());
-   }
-
-   BOOST_CONTAINER_ATTRIBUTE_NODISCARD BOOST_CONTAINER_FORCEINLINE
-      container_type extract_sequence()
-   {  return boost::move(m_data.m_seq);   }
-
-   BOOST_CONTAINER_ATTRIBUTE_NODISCARD BOOST_CONTAINER_FORCEINLINE
-      container_type &get_sequence_ref()
-   {  return m_data.m_seq; }
-
-   BOOST_CONTAINER_ATTRIBUTE_NODISCARD BOOST_CONTAINER_FORCEINLINE
-      const container_type &get_sequence_cref() const
-   {  return m_data.m_seq; }
-
-   BOOST_CONTAINER_FORCEINLINE void adopt_sequence_equal(BOOST_RV_REF(container_type) seq)
-   {
-      (flat_tree_adopt_sequence_equal)( m_data.m_seq, boost::move(seq), this->priv_value_comp()
-         , dtl::bool_<is_contiguous_container<container_type>::value>());
-   }
-
-   BOOST_CONTAINER_FORCEINLINE void adopt_sequence_unique(BOOST_RV_REF(container_type) seq)
-   {
-      (flat_tree_adopt_sequence_unique)(m_data.m_seq, boost::move(seq), this->priv_value_comp()
-         , dtl::bool_<is_contiguous_container<container_type>::value>());
-   }
-
-   void adopt_sequence_equal(ordered_range_t, BOOST_RV_REF(container_type) seq)
-   {
-      BOOST_ASSERT((is_sorted)(seq.cbegin(), seq.cend(), this->priv_value_comp()));
-      m_data.m_seq = boost::move(seq);
-   }
-
-   void adopt_sequence_unique(ordered_unique_range_t, BOOST_RV_REF(container_type) seq)
-   {
-      BOOST_ASSERT((is_sorted_and_unique)(seq.cbegin(), seq.cend(), this->priv_value_comp()));
-      m_data.m_seq = boost::move(seq);
-   }
-
-   BOOST_CONTAINER_ATTRIBUTE_NODISCARD BOOST_CONTAINER_FORCEINLINE
-      friend bool operator==(const flat_tree& x, const flat_tree& y)
-   {
-      return x.size() == y.size() && ::boost::container::algo_equal(x.begin(), x.end(), y.begin());
-   }
-
-   BOOST_CONTAINER_ATTRIBUTE_NODISCARD BOOST_CONTAINER_FORCEINLINE
-      friend bool operator<(const flat_tree& x, const flat_tree& y)
-   {
-      return ::boost::container::algo_lexicographical_compare(x.begin(), x.end(), y.begin(), y.end());
-   }
-
-   BOOST_CONTAINER_ATTRIBUTE_NODISCARD BOOST_CONTAINER_FORCEINLINE
-      friend bool operator!=(const flat_tree& x, const flat_tree& y)
-      {  return !(x == y); }
-
-   BOOST_CONTAINER_ATTRIBUTE_NODISCARD BOOST_CONTAINER_FORCEINLINE
-      friend bool operator>(const flat_tree& x, const flat_tree& y)
-      {  return y < x;  }
-
-   BOOST_CONTAINER_ATTRIBUTE_NODISCARD BOOST_CONTAINER_FORCEINLINE
-      friend bool operator<=(const flat_tree& x, const flat_tree& y)
-      {  return !(y < x);  }
-
-   BOOST_CONTAINER_ATTRIBUTE_NODISCARD BOOST_CONTAINER_FORCEINLINE
-      friend bool operator>=(const flat_tree& x, const flat_tree& y)
-      {  return !(x < y);  }
-
-   BOOST_CONTAINER_FORCEINLINE friend void swap(flat_tree& x, flat_tree& y)
-          BOOST_NOEXCEPT_IF(BOOST_NOEXCEPT(x.swap(y)))
-      {  x.swap(y);  }
-
-   private:
-
-   template <class InputIterator>
-   void priv_range_insertion_construct( bool unique_insertion, InputIterator first, InputIterator last)
-   {
-      //Use cend() as hint to achieve linear time for
-      //ordered ranges as required by the standard
-      //for the constructor
-      //Call end() every iteration as reallocation might have invalidated iterators
-      if(unique_insertion){
-         this->insert_unique(first, last);
-      }
-      else{
-         this->insert_equal (first, last);
-      }
-   }
-
-   BOOST_CONTAINER_FORCEINLINE bool priv_in_range_or_end(const_iterator pos) const
-   {
-      return (this->begin() <= pos) && (pos <= this->end());
-   }
-
-   // insert/erase
-   void priv_insert_equal_prepare
-      (const_iterator pos, const value_type& val, insert_commit_data &data)
-   {
-      // N1780
-      //   To insert val at pos:
-      //   if pos == end || val <= *pos
-      //      if pos == begin || val >= *(pos-1)
-      //         insert val before pos
-      //      else
-      //         insert val before upper_bound(val)
-      //   else
-      //      insert val before lower_bound(val)
-      const value_compare &val_cmp = this->m_data;
-
-      if(pos == this->cend() || !val_cmp(*pos, val)){
-         if (pos == this->cbegin() || !val_cmp(val, pos[-1])){
-            data.position = pos;
-         }
-         else{
-            data.position =
-               this->priv_upper_bound(this->cbegin(), pos, KeyOfValue()(val));
-         }
-      }
-      else{
-         data.position =
-            this->priv_lower_bound(pos, this->cend(), KeyOfValue()(val));
-      }
-   }
-
-   bool priv_insert_unique_prepare
-      (const_iterator b, const_iterator e, const key_type& k, insert_commit_data &commit_data)
-   {
-      const key_compare &key_cmp  = this->priv_key_comp();
-      commit_data.position = this->priv_lower_bound(b, e, k);
-      return commit_data.position == e || key_cmp(k, KeyOfValue()(*commit_data.position));
-   }
-
-   BOOST_CONTAINER_FORCEINLINE bool priv_insert_unique_prepare
-      (const key_type& k, insert_commit_data &commit_data)
-   {  return this->priv_insert_unique_prepare(this->cbegin(), this->cend(), k, commit_data);   }
-
-   bool priv_insert_unique_prepare
-      (const_iterator pos, const key_type& k, insert_commit_data &commit_data)
-   {
-      //N1780. Props to Howard Hinnant!
-      //To insert k at pos:
-      //if pos == end || k <= *pos
-      //   if pos == begin || k >= *(pos-1)
-      //      insert k before pos
-      //   else
-      //      insert k before upper_bound(k)
-      //else if pos+1 == end || k <= *(pos+1)
-      //   insert k after pos
-      //else
-      //   insert k before lower_bound(k)
-      const key_compare &key_cmp = this->priv_key_comp();
-      const const_iterator cend_it = this->cend();
-      if(pos == cend_it || key_cmp(k, KeyOfValue()(*pos))){ //Check if k should go before end
-         const const_iterator cbeg = this->cbegin();
-         commit_data.position = pos;
-         if(pos == cbeg){  //If container is empty then insert it in the beginning
-            return true;
-         }
-         const_iterator prev(pos);
-         --prev;
-         if(key_cmp(KeyOfValue()(*prev), k)){   //If previous element was less, then it should go between prev and pos
-            return true;
-         }
-         else if(!key_cmp(k, KeyOfValue()(*prev))){   //If previous was equal then insertion should fail
-            commit_data.position = prev;
-            return false;
-         }
-         else{ //Previous was bigger so insertion hint was pointless, dispatch to hintless insertion
-               //but reduce the search between beg and prev as prev is bigger than k
-            return this->priv_insert_unique_prepare(cbeg, prev, k, commit_data);
-         }
-      }
-      else{
-         //The hint is before the insertion position, so insert it
-         //in the remaining range [pos, end)
-         return this->priv_insert_unique_prepare(pos, cend_it, k, commit_data);
-      }
-   }
-
-   template<class Convertible>
-   BOOST_CONTAINER_FORCEINLINE iterator priv_insert_commit
-      (insert_commit_data &commit_data, BOOST_FWD_REF(Convertible) convertible)
-   {
-      return this->m_data.m_seq.insert
-         ( commit_data.position
-         , boost::forward<Convertible>(convertible));
-   }
-
-   template <class RanIt, class K>
-   RanIt priv_lower_bound(RanIt first, const RanIt last,
-                          const K & key) const
-   {
-      const Compare &key_cmp = this->m_data.get_comp();
-      KeyOfValue key_extract;
-      size_type len = static_cast<size_type>(last - first);
-      RanIt middle;
-
-      while (len) {
-         size_type step = len >> 1;
-         middle = first;
-         middle += difference_type(step);
-
-         if (key_cmp(key_extract(*middle), key)) {
-            first = ++middle;
-            len -= step + 1;
-         }
-         else{
-            len = step;
-         }
-      }
-      return first;
-   }
-
-   template <class RanIt, class K>
-   RanIt priv_upper_bound
-      (RanIt first, const RanIt last,const K & key) const
-   {
-      const Compare &key_cmp = this->m_data.get_comp();
-      KeyOfValue key_extract;
-      size_type len = static_cast<size_type>(last - first);
-      RanIt middle;
-
-      while (len) {
-         size_type step = len >> 1;
-         middle = first;
-         middle += difference_type(step);
-
-         if (key_cmp(key, key_extract(*middle))) {
-            len = step;
-         }
-         else{
-            first = ++middle;
-            len -= step + 1;
-         }
-      }
-      return first;
-   }
-
-   template <class RanIt, class K>
-   std::pair<RanIt, RanIt>
-      priv_equal_range(RanIt first, RanIt last, const K& key) const
-   {
-      const Compare &key_cmp = this->m_data.get_comp();
-      KeyOfValue key_extract;
-      size_type len = static_cast<size_type>(last - first);
-      RanIt middle;
-
-      while (len) {
-         size_type step = len >> 1;
-         middle = first;
-         middle += difference_type(step);
-
-         if (key_cmp(key_extract(*middle), key)){
-            first = ++middle;
-            len -= step + 1;
-         }
-         else if (key_cmp(key, key_extract(*middle))){
-            len = step;
-         }
-         else {
-            //Middle is equal to key
-            last = first;
-            last += difference_type(len);
-            RanIt const first_ret = this->priv_lower_bound(first, middle, key);
-            return std::pair<RanIt, RanIt>
-               ( first_ret, this->priv_upper_bound(++middle, last, key));
-         }
-      }
-      return std::pair<RanIt, RanIt>(first, first);
-   }
-
-   template<class RanIt, class K>
-   std::pair<RanIt, RanIt> priv_lower_bound_range(RanIt first, RanIt last, const K& k) const
-   {
-      const Compare &key_cmp = this->m_data.get_comp();
-      KeyOfValue key_extract;
-      RanIt lb(this->priv_lower_bound(first, last, k)), ub(lb);
-      if(lb != last && !key_cmp(k, key_extract(*lb))){
-         ++ub;
-      }
-      return std::pair<RanIt, RanIt>(lb, ub);
-   }
-};
-
-}  //namespace dtl {
-
-}  //namespace container {
-
-//!has_trivial_destructor_after_move<> == true_type
-//!specialization for optimizations
-template <class T, class KeyOfValue,
-class Compare, class AllocatorOrContainer>
-struct has_trivial_destructor_after_move<boost::container::dtl::flat_tree<T, KeyOfValue, Compare, AllocatorOrContainer> >
-{
-   typedef boost::container::dtl::flat_tree<T, KeyOfValue, Compare, AllocatorOrContainer> flat_tree;
-   typedef typename flat_tree::container_type container_type;
-   typedef typename flat_tree::key_compare key_compare;
-   static const bool value = ::boost::has_trivial_destructor_after_move<container_type>::value &&
-                             ::boost::has_trivial_destructor_after_move<key_compare>::value;
-};
-
-}  //namespace boost {
-
-#include <boost/container/detail/config_end.hpp>
-
-#endif // BOOST_CONTAINER_FLAT_TREE_HPP
diff --git a/src/boost/container/detail/is_container.hpp b/src/boost/container/detail/is_container.hpp
deleted file mode 100644
index 8ef0274d..00000000
--- a/src/boost/container/detail/is_container.hpp
+++ /dev/null
@@ -1,72 +0,0 @@
-//////////////////////////////////////////////////////////////////////////////
-//
-// (C) Copyright Ion Gaztanaga 2017-2017. Distributed under the Boost
-// 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.
-//
-//////////////////////////////////////////////////////////////////////////////
-#ifndef BOOST_CONTAINER_DETAIL_IS_CONTAINER_HPP
-#define BOOST_CONTAINER_DETAIL_IS_CONTAINER_HPP
-
-#ifndef BOOST_CONFIG_HPP
-#  include <boost/config.hpp>
-#endif
-
-#if defined(BOOST_HAS_PRAGMA_ONCE)
-#  pragma once
-#endif
-
-#if defined(BOOST_GCC) && (BOOST_GCC >= 40600)
-#pragma GCC diagnostic push
-#pragma GCC diagnostic ignored "-Wunused-result"
-#endif
-
-//empty
-#define BOOST_INTRUSIVE_HAS_MEMBER_FUNCTION_CALLABLE_WITH_FUNCNAME empty
-#define BOOST_INTRUSIVE_HAS_MEMBER_FUNCTION_CALLABLE_WITH_NS_BEG namespace boost { namespace container { namespace is_container_detail {
-#define BOOST_INTRUSIVE_HAS_MEMBER_FUNCTION_CALLABLE_WITH_NS_END   }}}
-#define BOOST_INTRUSIVE_HAS_MEMBER_FUNCTION_CALLABLE_WITH_MIN 0
-#define BOOST_INTRUSIVE_HAS_MEMBER_FUNCTION_CALLABLE_WITH_MAX 0
-#include <boost/intrusive/detail/has_member_function_callable_with.hpp>
-
-//size
-#define BOOST_INTRUSIVE_HAS_MEMBER_FUNCTION_CALLABLE_WITH_FUNCNAME size
-#define BOOST_INTRUSIVE_HAS_MEMBER_FUNCTION_CALLABLE_WITH_NS_BEG namespace boost { namespace container { namespace is_container_detail {
-#define BOOST_INTRUSIVE_HAS_MEMBER_FUNCTION_CALLABLE_WITH_NS_END   }}}
-#define BOOST_INTRUSIVE_HAS_MEMBER_FUNCTION_CALLABLE_WITH_MIN 0
-#define BOOST_INTRUSIVE_HAS_MEMBER_FUNCTION_CALLABLE_WITH_MAX 0
-#include <boost/intrusive/detail/has_member_function_callable_with.hpp>
-
-//#pragma GCC diagnostic ignored "-Wunused-result"
-#if defined(BOOST_GCC) && (BOOST_GCC >= 40600)
-#pragma GCC diagnostic pop
-#endif
-
-namespace boost {
-namespace container {
-namespace dtl {
-
-template <class Container>
-struct is_container
-{
-   static const bool value =
-      boost::container::is_container_detail::
-         has_member_function_callable_with_size <const Container>::value &&
-      boost::container::is_container_detail::
-         has_member_function_callable_with_empty<const Container>::value;
-};
-
-template <>
-struct is_container<void>
-{
-   static const bool value = false;
-};
-
-
-}  //namespace dtl {
-}  //namespace container {
-}  //namespace boost {
-
-#endif   //#ifndef BOOST_CONTAINER_DETAIL_IS_CONTAINER_HPP
diff --git a/src/boost/container/detail/is_contiguous_container.hpp b/src/boost/container/detail/is_contiguous_container.hpp
deleted file mode 100644
index 045de843..00000000
--- a/src/boost/container/detail/is_contiguous_container.hpp
+++ /dev/null
@@ -1,82 +0,0 @@
-//////////////////////////////////////////////////////////////////////////////
-//
-// (C) Copyright Ion Gaztanaga 2017-2017. Distributed under the Boost
-// 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.
-//
-//////////////////////////////////////////////////////////////////////////////
-#ifndef BOOST_CONTAINER_DETAIL_IS_CONTIGUOUS_CONTAINER_HPP
-#define BOOST_CONTAINER_DETAIL_IS_CONTIGUOUS_CONTAINER_HPP
-
-#ifndef BOOST_CONFIG_HPP
-#  include <boost/config.hpp>
-#endif
-
-#if defined(BOOST_HAS_PRAGMA_ONCE)
-#  pragma once
-#endif
-
-#if defined(BOOST_GCC) && (BOOST_GCC >= 40600)
-#pragma GCC diagnostic push
-#pragma GCC diagnostic ignored "-Wunused-result"
-#endif
-
-//data
-#define BOOST_INTRUSIVE_HAS_MEMBER_FUNCTION_CALLABLE_WITH_FUNCNAME data
-#define BOOST_INTRUSIVE_HAS_MEMBER_FUNCTION_CALLABLE_WITH_NS_BEG namespace boost { namespace container { namespace is_contiguous_container_detail {
-#define BOOST_INTRUSIVE_HAS_MEMBER_FUNCTION_CALLABLE_WITH_NS_END   }}}
-#define BOOST_INTRUSIVE_HAS_MEMBER_FUNCTION_CALLABLE_WITH_MIN 0
-#define BOOST_INTRUSIVE_HAS_MEMBER_FUNCTION_CALLABLE_WITH_MAX 0
-#include <boost/intrusive/detail/has_member_function_callable_with.hpp>
-
-//back_free_capacity
-#define BOOST_INTRUSIVE_HAS_MEMBER_FUNCTION_CALLABLE_WITH_FUNCNAME back_free_capacity
-#define BOOST_INTRUSIVE_HAS_MEMBER_FUNCTION_CALLABLE_WITH_NS_BEG namespace boost { namespace container { namespace back_free_capacity_detail {
-#define BOOST_INTRUSIVE_HAS_MEMBER_FUNCTION_CALLABLE_WITH_NS_END   }}}
-#define BOOST_INTRUSIVE_HAS_MEMBER_FUNCTION_CALLABLE_WITH_MIN 0
-#define BOOST_INTRUSIVE_HAS_MEMBER_FUNCTION_CALLABLE_WITH_MAX 0
-#include <boost/intrusive/detail/has_member_function_callable_with.hpp>
-
-//#pragma GCC diagnostic ignored "-Wunused-result"
-#if defined(BOOST_GCC) && (BOOST_GCC >= 40600)
-#pragma GCC diagnostic pop
-#endif
-
-namespace boost {
-namespace container {
-namespace dtl {
-
-template <class Container>
-struct is_contiguous_container
-{
-   static const bool value =
-      boost::container::is_contiguous_container_detail::
-         has_member_function_callable_with_data<Container>::value && 
-      boost::container::is_contiguous_container_detail::
-         has_member_function_callable_with_data<const Container>::value;
-};
-
-
-template < class Container
-         , bool = boost::container::back_free_capacity_detail::
-                     has_member_function_callable_with_back_free_capacity<const Container>::value>
-struct back_free_capacity
-{
-   static typename Container::size_type get(const Container &c)
-   {  return c.back_free_capacity();  }
-};
-
-template < class Container>
-struct back_free_capacity<Container, false>
-{
-   static typename Container::size_type get(const Container &c)
-   {  return c.capacity() - c.size();  }
-};
-
-}  //namespace dtl {
-}  //namespace container {
-}  //namespace boost {
-
-#endif   //#ifndef BOOST_CONTAINER_DETAIL_IS_CONTIGUOUS_CONTAINER_HPP
diff --git a/src/boost/container/detail/is_pair.hpp b/src/boost/container/detail/is_pair.hpp
deleted file mode 100644
index 239e36e1..00000000
--- a/src/boost/container/detail/is_pair.hpp
+++ /dev/null
@@ -1,91 +0,0 @@
-//////////////////////////////////////////////////////////////////////////////
-//
-// (C) Copyright Ion Gaztanaga 2005-2013.
-//
-// Distributed under the Boost 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.
-//
-//////////////////////////////////////////////////////////////////////////////
-
-#ifndef BOOST_CONTAINER_CONTAINER_DETAIL_IS_PAIR_HPP
-#define BOOST_CONTAINER_CONTAINER_DETAIL_IS_PAIR_HPP
-
-#ifndef BOOST_CONFIG_HPP
-#  include <boost/config.hpp>
-#endif
-
-#if defined(BOOST_HAS_PRAGMA_ONCE)
-#  pragma once
-#endif
-
-#include <boost/container/detail/config_begin.hpp>
-#include <boost/container/detail/workaround.hpp>
-#include <boost/container/detail/std_fwd.hpp>
-
-#if defined(BOOST_MSVC) && (_CPPLIB_VER == 520)
-//MSVC 2010 tuple marker
-namespace std { namespace tr1 { struct _Nil; }}
-#elif defined(BOOST_MSVC) && (_CPPLIB_VER == 540)
-//MSVC 2012 tuple marker
-namespace std { struct _Nil; }
-#endif
-
-namespace boost {
-namespace tuples {
-
-struct null_type;
-
-template <
-  class T0, class T1, class T2,
-  class T3, class T4, class T5,
-  class T6, class T7, class T8,
-  class T9>
-class tuple;
-
-}  //namespace tuples {
-}  //namespace boost {
-
-namespace boost {
-namespace container {
-
-struct try_emplace_t{};
-
-namespace dtl {
-
-template <class T1, class T2>
-struct pair;
-
-template <class T>
-struct is_pair
-{
-   static const bool value = false;
-};
-
-template <class T1, class T2>
-struct is_pair< pair<T1, T2> >
-{
-   static const bool value = true;
-};
-
-template <class T1, class T2>
-struct is_pair< std::pair<T1, T2> >
-{
-   static const bool value = true;
-};
-
-template <class T>
-struct is_not_pair
-{
-   static const bool value = !is_pair<T>::value;
-};
-
-}  //namespace dtl {
-}  //namespace container {
-}  //namespace boost {
-
-#include <boost/container/detail/config_end.hpp>
-
-#endif   //#ifndef BOOST_CONTAINER_CONTAINER_DETAIL_IS_PAIR_HPP
diff --git a/src/boost/container/detail/is_sorted.hpp b/src/boost/container/detail/is_sorted.hpp
deleted file mode 100644
index 315bab54..00000000
--- a/src/boost/container/detail/is_sorted.hpp
+++ /dev/null
@@ -1,57 +0,0 @@
-//////////////////////////////////////////////////////////////////////////////
-//
-// (C) Copyright Ion Gaztanaga 2016-2016. Distributed under the Boost
-// 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.
-//
-//////////////////////////////////////////////////////////////////////////////
-#ifndef BOOST_CONTAINER_DETAIL_IS_SORTED_HPP
-#define BOOST_CONTAINER_DETAIL_IS_SORTED_HPP
-
-#ifndef BOOST_CONFIG_HPP
-#  include <boost/config.hpp>
-#endif
-
-#if defined(BOOST_HAS_PRAGMA_ONCE)
-#  pragma once
-#endif
-
-namespace boost {
-namespace container {
-namespace dtl {
-
-template <class ForwardIterator, class Pred>
-bool is_sorted (ForwardIterator first, ForwardIterator last, Pred pred)
-{
-   if(first != last){
-      ForwardIterator next = first;
-      while (++next != last){
-         if(pred(*next, *first))
-            return false;
-         ++first;
-      }
-   }
-   return true;
-}
-
-template <class ForwardIterator, class Pred>
-bool is_sorted_and_unique (ForwardIterator first, ForwardIterator last, Pred pred)
-{
-   if(first != last){
-      ForwardIterator next = first;
-      while (++next != last){
-         if(!pred(*first, *next))
-            return false;
-         ++first;
-      }
-   }
-   return true;
-}
-
-}  //namespace dtl {
-}  //namespace container {
-}  //namespace boost {
-
-#endif   //#ifndef BOOST_CONTAINER_DETAIL_IS_SORTED_HPP
diff --git a/src/boost/container/detail/iterator.hpp b/src/boost/container/detail/iterator.hpp
deleted file mode 100644
index 9d2e1c8f..00000000
--- a/src/boost/container/detail/iterator.hpp
+++ /dev/null
@@ -1,94 +0,0 @@
-//////////////////////////////////////////////////////////////////////////////
-//
-// (C) Copyright Ion Gaztanaga 2014-2014.
-//
-// Distributed under the Boost 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.
-//
-//////////////////////////////////////////////////////////////////////////////
-
-#ifndef BOOST_CONTAINER_DETAIL_ITERATOR_HPP
-#define BOOST_CONTAINER_DETAIL_ITERATOR_HPP
-
-#ifndef BOOST_CONFIG_HPP
-#  include <boost/config.hpp>
-#endif
-
-#if defined(BOOST_HAS_PRAGMA_ONCE)
-#  pragma once
-#endif
-
-#include <boost/intrusive/detail/iterator.hpp>
-#include <boost/move/utility_core.hpp>
-#include <boost/container/detail/mpl.hpp>
-
-namespace boost {
-namespace container {
-
-using ::boost::intrusive::iterator_traits;
-using ::boost::intrusive::iter_difference;
-using ::boost::intrusive::iter_category;
-using ::boost::intrusive::iter_value;
-using ::boost::intrusive::iter_size;
-using ::boost::intrusive::iterator_distance;
-using ::boost::intrusive::iterator_udistance;
-using ::boost::intrusive::iterator_advance;
-using ::boost::intrusive::iterator_uadvance;
-using ::boost::intrusive::make_iterator_advance;
-using ::boost::intrusive::make_iterator_uadvance;
-using ::boost::intrusive::iterator;
-using ::boost::intrusive::iterator_enable_if_tag;
-using ::boost::intrusive::iterator_disable_if_tag;
-using ::boost::intrusive::iterator_arrow_result;
-
-template <class Container>
-class back_emplacer
-{
-   private:
-   Container& container;
-
-   public:
-   typedef std::output_iterator_tag iterator_category;
-   typedef void                     value_type;
-   typedef void                     difference_type;
-   typedef void                     pointer;
-   typedef void                     reference;
-
-   back_emplacer(Container& x)
-      : container(x)
-   {}
-
-   template<class U>
-   back_emplacer& operator=(BOOST_FWD_REF(U) value)
-   {
-      container.emplace_back(boost::forward<U>(value));
-      return *this;
-   }
-   back_emplacer& operator*()    { return *this; }
-   back_emplacer& operator++()   { return *this; }
-   back_emplacer& operator++(int){ return *this; }
-};
-
-#ifndef BOOST_CONTAINER_NO_CXX17_CTAD
-
-template<class InputIterator>
-using it_based_non_const_first_type_t = typename dtl::remove_const<typename iterator_traits<InputIterator>::value_type::first_type>::type;
-
-template<class InputIterator>
-using it_based_const_first_type_t = const typename dtl::remove_const<typename iterator_traits<InputIterator>::value_type::first_type>::type;
-
-template<class InputIterator>
-using it_based_second_type_t = typename iterator_traits<InputIterator>::value_type::second_type;
-
-template<class InputIterator>
-using it_based_value_type_t = typename iterator_traits<InputIterator>::value_type;
-
-#endif
-
-}  //namespace container {
-}  //namespace boost {
-
-#endif   //#ifndef BOOST_CONTAINER_DETAIL_ITERATORS_HPP
diff --git a/src/boost/container/detail/iterators.hpp b/src/boost/container/detail/iterators.hpp
deleted file mode 100644
index c503916a..00000000
--- a/src/boost/container/detail/iterators.hpp
+++ /dev/null
@@ -1,910 +0,0 @@
-//////////////////////////////////////////////////////////////////////////////
-//
-// (C) Copyright Ion Gaztanaga 2005-2013.
-// (C) Copyright Gennaro Prota 2003 - 2004.
-//
-// Distributed under the Boost 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.
-//
-//////////////////////////////////////////////////////////////////////////////
-
-#ifndef BOOST_CONTAINER_DETAIL_ITERATORS_HPP
-#define BOOST_CONTAINER_DETAIL_ITERATORS_HPP
-
-#ifndef BOOST_CONFIG_HPP
-#  include <boost/config.hpp>
-#endif
-
-#if defined(BOOST_HAS_PRAGMA_ONCE)
-#  pragma once
-#endif
-
-#include <boost/container/detail/config_begin.hpp>
-#include <boost/container/detail/workaround.hpp>
-#include <boost/container/allocator_traits.hpp>
-#include <boost/container/detail/type_traits.hpp>
-#include <boost/container/detail/value_init.hpp>
-#include <boost/static_assert.hpp>
-#include <boost/move/utility_core.hpp>
-#include <boost/intrusive/detail/reverse_iterator.hpp>
-
-#if defined(BOOST_NO_CXX11_VARIADIC_TEMPLATES)
-#include <boost/move/detail/fwd_macros.hpp>
-#else
-#include <boost/container/detail/variadic_templates_tools.hpp>
-#endif
-#include <boost/container/detail/iterator.hpp>
-
-namespace boost {
-namespace container {
-
-template <class T>
-class constant_iterator
-  : public ::boost::container::iterator
-      <std::random_access_iterator_tag, T, std::ptrdiff_t, const T*, const T &>
-{
-   typedef  constant_iterator<T> this_type;
-
-   public:
-   BOOST_CONTAINER_FORCEINLINE explicit constant_iterator(const T &ref, std::size_t range_size)
-      :  m_ptr(&ref), m_num(range_size){}
-
-   //Constructors
-   BOOST_CONTAINER_FORCEINLINE constant_iterator()
-      :  m_ptr(0), m_num(0){}
-
-   BOOST_CONTAINER_FORCEINLINE constant_iterator& operator++()
-   { increment();   return *this;   }
-
-   BOOST_CONTAINER_FORCEINLINE constant_iterator operator++(int)
-   {
-      constant_iterator result (*this);
-      increment();
-      return result;
-   }
-
-   BOOST_CONTAINER_FORCEINLINE constant_iterator& operator--()
-   { decrement();   return *this;   }
-
-   BOOST_CONTAINER_FORCEINLINE constant_iterator operator--(int)
-   {
-      constant_iterator result (*this);
-      decrement();
-      return result;
-   }
-
-   BOOST_CONTAINER_FORCEINLINE friend bool operator== (const constant_iterator& i, const constant_iterator& i2)
-   { return i.equal(i2); }
-
-   BOOST_CONTAINER_FORCEINLINE friend bool operator!= (const constant_iterator& i, const constant_iterator& i2)
-   { return !(i == i2); }
-
-   BOOST_CONTAINER_FORCEINLINE friend bool operator< (const constant_iterator& i, const constant_iterator& i2)
-   { return i.less(i2); }
-
-   BOOST_CONTAINER_FORCEINLINE friend bool operator> (const constant_iterator& i, const constant_iterator& i2)
-   { return i2 < i; }
-
-   BOOST_CONTAINER_FORCEINLINE friend bool operator<= (const constant_iterator& i, const constant_iterator& i2)
-   { return !(i > i2); }
-
-   BOOST_CONTAINER_FORCEINLINE friend bool operator>= (const constant_iterator& i, const constant_iterator& i2)
-   { return !(i < i2); }
-
-   BOOST_CONTAINER_FORCEINLINE friend std::ptrdiff_t operator- (const constant_iterator& i, const constant_iterator& i2)
-   { return i2.distance_to(i); }
-
-   //Arithmetic signed
-   BOOST_CONTAINER_FORCEINLINE constant_iterator& operator+=(std::ptrdiff_t off)
-   {  this->advance(off); return *this;   }
-
-   BOOST_CONTAINER_FORCEINLINE constant_iterator operator+(std::ptrdiff_t off) const
-   {
-      constant_iterator other(*this);
-      other.advance(off);
-      return other;
-   }
-
-   BOOST_CONTAINER_FORCEINLINE friend constant_iterator operator+(std::ptrdiff_t off, const constant_iterator& right)
-   {  return right + off; }
-
-   BOOST_CONTAINER_FORCEINLINE constant_iterator& operator-=(std::ptrdiff_t off)
-   {  this->advance(-off); return *this;   }
-
-   BOOST_CONTAINER_FORCEINLINE constant_iterator operator-(std::ptrdiff_t off) const
-   {  return *this + (-off);  }
-
-   BOOST_CONTAINER_FORCEINLINE const T& operator[] (std::ptrdiff_t ) const
-   { return dereference(); }
-
-   BOOST_CONTAINER_FORCEINLINE const T& operator*() const
-   { return dereference(); }
-
-   BOOST_CONTAINER_FORCEINLINE const T* operator->() const
-   { return &(dereference()); }
-
-   //Arithmetic unsigned
-   BOOST_CONTAINER_FORCEINLINE constant_iterator& operator+=(std::size_t off)
-   {  return *this += std::ptrdiff_t(off);  }
-
-   BOOST_CONTAINER_FORCEINLINE constant_iterator operator+(std::size_t off) const
-   {  return *this + std::ptrdiff_t(off);  }
-
-   BOOST_CONTAINER_FORCEINLINE friend constant_iterator operator+(std::size_t off, const constant_iterator& right)
-   {  return std::ptrdiff_t(off) + right;  }
-
-   BOOST_CONTAINER_FORCEINLINE constant_iterator& operator-=(std::size_t off)
-   {  return *this -= std::ptrdiff_t(off);  }
-
-   BOOST_CONTAINER_FORCEINLINE constant_iterator operator-(std::size_t off) const
-   {  return *this - std::ptrdiff_t(off);  }
-
-   BOOST_CONTAINER_FORCEINLINE const T& operator[] (std::size_t off) const
-   { return (*this)[std::ptrdiff_t(off)]; }
-
-   private:
-   const T *   m_ptr;
-   std::size_t m_num;
-
-   BOOST_CONTAINER_FORCEINLINE void increment()
-   { --m_num; }
-
-   BOOST_CONTAINER_FORCEINLINE void decrement()
-   { ++m_num; }
-
-   BOOST_CONTAINER_FORCEINLINE bool equal(const this_type &other) const
-   {  return m_num == other.m_num;   }
-
-   BOOST_CONTAINER_FORCEINLINE bool less(const this_type &other) const
-   {  return other.m_num < m_num;   }
-
-   BOOST_CONTAINER_FORCEINLINE const T & dereference() const
-   { return *m_ptr; }
-
-   BOOST_CONTAINER_FORCEINLINE void advance(std::ptrdiff_t n)
-   {  m_num = std::size_t(std::ptrdiff_t(m_num) - n); }
-
-   BOOST_CONTAINER_FORCEINLINE std::ptrdiff_t distance_to(const this_type &other)const
-   {  return std::ptrdiff_t(m_num - other.m_num);   }
-};
-
-template <class T>
-class value_init_construct_iterator
-  : public ::boost::container::iterator
-      <std::random_access_iterator_tag, T, std::ptrdiff_t, const T*, const T &>
-{
-   typedef  value_init_construct_iterator<T> this_type;
-
-   public:
-   BOOST_CONTAINER_FORCEINLINE explicit value_init_construct_iterator(std::size_t range_size)
-      :  m_num(range_size){}
-
-   //Constructors
-   BOOST_CONTAINER_FORCEINLINE value_init_construct_iterator()
-      :  m_num(0){}
-
-   BOOST_CONTAINER_FORCEINLINE value_init_construct_iterator& operator++()
-   { increment();   return *this;   }
-
-   BOOST_CONTAINER_FORCEINLINE value_init_construct_iterator operator++(int)
-   {
-      value_init_construct_iterator result (*this);
-      increment();
-      return result;
-   }
-
-   BOOST_CONTAINER_FORCEINLINE value_init_construct_iterator& operator--()
-   { decrement();   return *this;   }
-
-   BOOST_CONTAINER_FORCEINLINE value_init_construct_iterator operator--(int)
-   {
-      value_init_construct_iterator result (*this);
-      decrement();
-      return result;
-   }
-
-   BOOST_CONTAINER_FORCEINLINE friend bool operator== (const value_init_construct_iterator& i, const value_init_construct_iterator& i2)
-   { return i.equal(i2); }
-
-   BOOST_CONTAINER_FORCEINLINE friend bool operator!= (const value_init_construct_iterator& i, const value_init_construct_iterator& i2)
-   { return !(i == i2); }
-
-   BOOST_CONTAINER_FORCEINLINE friend bool operator< (const value_init_construct_iterator& i, const value_init_construct_iterator& i2)
-   { return i.less(i2); }
-
-   BOOST_CONTAINER_FORCEINLINE friend bool operator> (const value_init_construct_iterator& i, const value_init_construct_iterator& i2)
-   { return i2 < i; }
-
-   BOOST_CONTAINER_FORCEINLINE friend bool operator<= (const value_init_construct_iterator& i, const value_init_construct_iterator& i2)
-   { return !(i > i2); }
-
-   BOOST_CONTAINER_FORCEINLINE friend bool operator>= (const value_init_construct_iterator& i, const value_init_construct_iterator& i2)
-   { return !(i < i2); }
-
-   BOOST_CONTAINER_FORCEINLINE friend std::ptrdiff_t operator- (const value_init_construct_iterator& i, const value_init_construct_iterator& i2)
-   { return i2.distance_to(i); }
-
-   //Arithmetic
-   BOOST_CONTAINER_FORCEINLINE value_init_construct_iterator& operator+=(std::ptrdiff_t off)
-   {  this->advance(off); return *this;   }
-
-   BOOST_CONTAINER_FORCEINLINE value_init_construct_iterator operator+(std::ptrdiff_t off) const
-   {
-      value_init_construct_iterator other(*this);
-      other.advance(off);
-      return other;
-   }
-
-   BOOST_CONTAINER_FORCEINLINE friend value_init_construct_iterator operator+(std::ptrdiff_t off, const value_init_construct_iterator& right)
-   {  return right + off; }
-
-   BOOST_CONTAINER_FORCEINLINE value_init_construct_iterator& operator-=(std::ptrdiff_t off)
-   {  this->advance(-off); return *this;   }
-
-   BOOST_CONTAINER_FORCEINLINE value_init_construct_iterator operator-(std::ptrdiff_t off) const
-   {  return *this + (-off);  }
-
-   //This pseudo-iterator's dereference operations have no sense since value is not
-   //constructed until ::boost::container::construct_in_place is called.
-   //So comment them to catch bad uses
-   //const T& operator*() const;
-   //const T& operator[](difference_type) const;
-   //const T* operator->() const;
-
-   private:
-   std::size_t  m_num;
-
-   BOOST_CONTAINER_FORCEINLINE void increment()
-   { --m_num; }
-
-   BOOST_CONTAINER_FORCEINLINE void decrement()
-   { ++m_num; }
-
-   BOOST_CONTAINER_FORCEINLINE bool equal(const this_type &other) const
-   {  return m_num == other.m_num;   }
-
-   BOOST_CONTAINER_FORCEINLINE bool less(const this_type &other) const
-   {  return other.m_num < m_num;   }
-
-   BOOST_CONTAINER_FORCEINLINE const T & dereference() const
-   {
-      static T dummy;
-      return dummy;
-   }
-
-   BOOST_CONTAINER_FORCEINLINE void advance(std::ptrdiff_t n)
-   {  m_num = std::size_t(std::ptrdiff_t(m_num) - n); }
-
-   BOOST_CONTAINER_FORCEINLINE std::ptrdiff_t distance_to(const this_type &other)const
-   {  return std::ptrdiff_t(m_num - other.m_num);   }
-};
-
-template <class T>
-class default_init_construct_iterator
-  : public ::boost::container::iterator
-      <std::random_access_iterator_tag, T, std::ptrdiff_t, const T*, const T &>
-{
-   typedef  default_init_construct_iterator<T> this_type;
-
-   public:
-   BOOST_CONTAINER_FORCEINLINE explicit default_init_construct_iterator(std::size_t range_size)
-      :  m_num(range_size){}
-
-   //Constructors
-   BOOST_CONTAINER_FORCEINLINE default_init_construct_iterator()
-      :  m_num(0){}
-
-   BOOST_CONTAINER_FORCEINLINE default_init_construct_iterator& operator++()
-   { increment();   return *this;   }
-
-   BOOST_CONTAINER_FORCEINLINE default_init_construct_iterator operator++(int)
-   {
-      default_init_construct_iterator result (*this);
-      increment();
-      return result;
-   }
-
-   BOOST_CONTAINER_FORCEINLINE default_init_construct_iterator& operator--()
-   { decrement();   return *this;   }
-
-   BOOST_CONTAINER_FORCEINLINE default_init_construct_iterator operator--(int)
-   {
-      default_init_construct_iterator result (*this);
-      decrement();
-      return result;
-   }
-
-   BOOST_CONTAINER_FORCEINLINE friend bool operator== (const default_init_construct_iterator& i, const default_init_construct_iterator& i2)
-   { return i.equal(i2); }
-
-   BOOST_CONTAINER_FORCEINLINE friend bool operator!= (const default_init_construct_iterator& i, const default_init_construct_iterator& i2)
-   { return !(i == i2); }
-
-   BOOST_CONTAINER_FORCEINLINE friend bool operator< (const default_init_construct_iterator& i, const default_init_construct_iterator& i2)
-   { return i.less(i2); }
-
-   BOOST_CONTAINER_FORCEINLINE friend bool operator> (const default_init_construct_iterator& i, const default_init_construct_iterator& i2)
-   { return i2 < i; }
-
-   BOOST_CONTAINER_FORCEINLINE friend bool operator<= (const default_init_construct_iterator& i, const default_init_construct_iterator& i2)
-   { return !(i > i2); }
-
-   BOOST_CONTAINER_FORCEINLINE friend bool operator>= (const default_init_construct_iterator& i, const default_init_construct_iterator& i2)
-   { return !(i < i2); }
-
-   BOOST_CONTAINER_FORCEINLINE friend std::ptrdiff_t operator- (const default_init_construct_iterator& i, const default_init_construct_iterator& i2)
-   { return i2.distance_to(i); }
-
-   //Arithmetic
-   BOOST_CONTAINER_FORCEINLINE default_init_construct_iterator& operator+=(std::ptrdiff_t off)
-   {  this->advance(off); return *this;   }
-
-   BOOST_CONTAINER_FORCEINLINE default_init_construct_iterator operator+(std::ptrdiff_t off) const
-   {
-      default_init_construct_iterator other(*this);
-      other.advance(off);
-      return other;
-   }
-
-   BOOST_CONTAINER_FORCEINLINE friend default_init_construct_iterator operator+(std::ptrdiff_t off, const default_init_construct_iterator& right)
-   {  return right + off; }
-
-   BOOST_CONTAINER_FORCEINLINE default_init_construct_iterator& operator-=(std::ptrdiff_t off)
-   {  this->advance(-off); return *this;   }
-
-   BOOST_CONTAINER_FORCEINLINE default_init_construct_iterator operator-(std::ptrdiff_t off) const
-   {  return *this + (-off);  }
-
-   //This pseudo-iterator's dereference operations have no sense since value is not
-   //constructed until ::boost::container::construct_in_place is called.
-   //So comment them to catch bad uses
-   //const T& operator*() const;
-   //const T& operator[](difference_type) const;
-   //const T* operator->() const;
-
-   private:
-   std::size_t  m_num;
-
-   BOOST_CONTAINER_FORCEINLINE void increment()
-   { --m_num; }
-
-   BOOST_CONTAINER_FORCEINLINE void decrement()
-   { ++m_num; }
-
-   BOOST_CONTAINER_FORCEINLINE bool equal(const this_type &other) const
-   {  return m_num == other.m_num;   }
-
-   BOOST_CONTAINER_FORCEINLINE bool less(const this_type &other) const
-   {  return other.m_num < m_num;   }
-
-   BOOST_CONTAINER_FORCEINLINE const T & dereference() const
-   {
-      static T dummy;
-      return dummy;
-   }
-
-   BOOST_CONTAINER_FORCEINLINE void advance(std::ptrdiff_t n)
-   {  m_num = std::size_t(std::ptrdiff_t(m_num) - n); }
-
-   BOOST_CONTAINER_FORCEINLINE std::ptrdiff_t distance_to(const this_type &other) const
-   {  return std::ptrdiff_t(m_num - other.m_num);   }
-};
-
-
-template <class T>
-class repeat_iterator
-  : public ::boost::container::iterator
-      <std::random_access_iterator_tag, T, std::ptrdiff_t, T*, T&>
-{
-   typedef repeat_iterator<T> this_type;
-   public:
-   BOOST_CONTAINER_FORCEINLINE explicit repeat_iterator(T &ref, std::size_t range_size)
-      :  m_ptr(&ref), m_num(range_size){}
-
-   //Constructors
-   BOOST_CONTAINER_FORCEINLINE repeat_iterator()
-      :  m_ptr(0), m_num(0){}
-
-   BOOST_CONTAINER_FORCEINLINE this_type& operator++()
-   { increment();   return *this;   }
-
-   BOOST_CONTAINER_FORCEINLINE this_type operator++(int)
-   {
-      this_type result (*this);
-      increment();
-      return result;
-   }
-
-   BOOST_CONTAINER_FORCEINLINE this_type& operator--()
-   { increment();   return *this;   }
-
-   BOOST_CONTAINER_FORCEINLINE this_type operator--(int)
-   {
-      this_type result (*this);
-      increment();
-      return result;
-   }
-
-   BOOST_CONTAINER_FORCEINLINE friend bool operator== (const this_type& i, const this_type& i2)
-   { return i.equal(i2); }
-
-   BOOST_CONTAINER_FORCEINLINE friend bool operator!= (const this_type& i, const this_type& i2)
-   { return !(i == i2); }
-
-   BOOST_CONTAINER_FORCEINLINE friend bool operator< (const this_type& i, const this_type& i2)
-   { return i.less(i2); }
-
-   BOOST_CONTAINER_FORCEINLINE friend bool operator> (const this_type& i, const this_type& i2)
-   { return i2 < i; }
-
-   BOOST_CONTAINER_FORCEINLINE friend bool operator<= (const this_type& i, const this_type& i2)
-   { return !(i > i2); }
-
-   BOOST_CONTAINER_FORCEINLINE friend bool operator>= (const this_type& i, const this_type& i2)
-   { return !(i < i2); }
-
-   BOOST_CONTAINER_FORCEINLINE friend std::ptrdiff_t operator- (const this_type& i, const this_type& i2)
-   { return i2.distance_to(i); }
-
-   //Arithmetic
-   BOOST_CONTAINER_FORCEINLINE this_type& operator+=(std::ptrdiff_t off)
-   {  this->advance(off); return *this;   }
-
-   BOOST_CONTAINER_FORCEINLINE this_type operator+(std::ptrdiff_t off) const
-   {
-      this_type other(*this);
-      other.advance(off);
-      return other;
-   }
-
-   BOOST_CONTAINER_FORCEINLINE friend this_type operator+(std::ptrdiff_t off, const this_type& right)
-   {  return right + off; }
-
-   BOOST_CONTAINER_FORCEINLINE this_type& operator-=(std::ptrdiff_t off)
-   {  this->advance(-off); return *this;   }
-
-   BOOST_CONTAINER_FORCEINLINE this_type operator-(std::ptrdiff_t off) const
-   {  return *this + (-off);  }
-
-   BOOST_CONTAINER_FORCEINLINE T& operator*() const
-   { return dereference(); }
-
-   BOOST_CONTAINER_FORCEINLINE T& operator[] (std::ptrdiff_t ) const
-   { return dereference(); }
-
-   BOOST_CONTAINER_FORCEINLINE T *operator->() const
-   { return &(dereference()); }
-
-   private:
-   T *         m_ptr;
-   std::size_t m_num;
-
-   BOOST_CONTAINER_FORCEINLINE void increment()
-   { --m_num; }
-
-   BOOST_CONTAINER_FORCEINLINE void decrement()
-   { ++m_num; }
-
-   BOOST_CONTAINER_FORCEINLINE bool equal(const this_type &other) const
-   {  return m_num == other.m_num;   }
-
-   BOOST_CONTAINER_FORCEINLINE bool less(const this_type &other) const
-   {  return other.m_num < m_num;   }
-
-   BOOST_CONTAINER_FORCEINLINE T & dereference() const
-   { return *m_ptr; }
-
-   BOOST_CONTAINER_FORCEINLINE void advance(std::ptrdiff_t n)
-   {  m_num = std::size_t(std::ptrdiff_t(m_num - n)); }
-
-   BOOST_CONTAINER_FORCEINLINE std::ptrdiff_t distance_to(const this_type &other)const
-   {  return std::ptrdiff_t(m_num - other.m_num);   }
-};
-
-template <class T, class EmplaceFunctor>
-class emplace_iterator
-  : public ::boost::container::iterator
-      <std::random_access_iterator_tag, T, std::ptrdiff_t, const T*, const T &>
-{
-   typedef emplace_iterator this_type;
-
-   public:
-   typedef std::ptrdiff_t difference_type;
-   BOOST_CONTAINER_FORCEINLINE explicit emplace_iterator(EmplaceFunctor&e)
-      :  m_num(1), m_pe(&e){}
-
-   BOOST_CONTAINER_FORCEINLINE emplace_iterator()
-      :  m_num(0), m_pe(0){}
-
-   BOOST_CONTAINER_FORCEINLINE this_type& operator++()
-   { increment();   return *this;   }
-
-   BOOST_CONTAINER_FORCEINLINE this_type operator++(int)
-   {
-      this_type result (*this);
-      increment();
-      return result;
-   }
-
-   BOOST_CONTAINER_FORCEINLINE this_type& operator--()
-   { decrement();   return *this;   }
-
-   BOOST_CONTAINER_FORCEINLINE this_type operator--(int)
-   {
-      this_type result (*this);
-      decrement();
-      return result;
-   }
-
-   BOOST_CONTAINER_FORCEINLINE friend bool operator== (const this_type& i, const this_type& i2)
-   { return i.equal(i2); }
-
-   BOOST_CONTAINER_FORCEINLINE friend bool operator!= (const this_type& i, const this_type& i2)
-   { return !(i == i2); }
-
-   BOOST_CONTAINER_FORCEINLINE friend bool operator< (const this_type& i, const this_type& i2)
-   { return i.less(i2); }
-
-   BOOST_CONTAINER_FORCEINLINE friend bool operator> (const this_type& i, const this_type& i2)
-   { return i2 < i; }
-
-   BOOST_CONTAINER_FORCEINLINE friend bool operator<= (const this_type& i, const this_type& i2)
-   { return !(i > i2); }
-
-   BOOST_CONTAINER_FORCEINLINE friend bool operator>= (const this_type& i, const this_type& i2)
-   { return !(i < i2); }
-
-   BOOST_CONTAINER_FORCEINLINE friend difference_type operator- (const this_type& i, const this_type& i2)
-   { return i2.distance_to(i); }
-
-   //Arithmetic
-   BOOST_CONTAINER_FORCEINLINE this_type& operator+=(difference_type off)
-   {  this->advance(off); return *this;   }
-
-   BOOST_CONTAINER_FORCEINLINE this_type operator+(difference_type off) const
-   {
-      this_type other(*this);
-      other.advance(off);
-      return other;
-   }
-
-   BOOST_CONTAINER_FORCEINLINE friend this_type operator+(difference_type off, const this_type& right)
-   {  return right + off; }
-
-   BOOST_CONTAINER_FORCEINLINE this_type& operator-=(difference_type off)
-   {  this->advance(-off); return *this;   }
-
-   BOOST_CONTAINER_FORCEINLINE this_type operator-(difference_type off) const
-   {  return *this + (-off);  }
-
-   private:
-   //This pseudo-iterator's dereference operations have no sense since value is not
-   //constructed until ::boost::container::construct_in_place is called.
-   //So comment them to catch bad uses
-   const T& operator*() const;
-   const T& operator[](difference_type) const;
-   const T* operator->() const;
-
-   public:
-   template<class Allocator>
-   BOOST_CONTAINER_FORCEINLINE void construct_in_place(Allocator &a, T* ptr)
-   {  (*m_pe)(a, ptr);  }
-
-   template<class DestIt>
-   BOOST_CONTAINER_FORCEINLINE void assign_in_place(DestIt dest)
-   {  (*m_pe)(dest);  }
-
-   private:
-   std::size_t m_num;
-   EmplaceFunctor *            m_pe;
-
-   BOOST_CONTAINER_FORCEINLINE void increment()
-   { --m_num; }
-
-   BOOST_CONTAINER_FORCEINLINE void decrement()
-   { ++m_num; }
-
-   BOOST_CONTAINER_FORCEINLINE bool equal(const this_type &other) const
-   {  return m_num == other.m_num;   }
-
-   BOOST_CONTAINER_FORCEINLINE bool less(const this_type &other) const
-   {  return other.m_num < m_num;   }
-
-   BOOST_CONTAINER_FORCEINLINE const T & dereference() const
-   {
-      static T dummy;
-      return dummy;
-   }
-
-   BOOST_CONTAINER_FORCEINLINE void advance(difference_type n)
-   {  m_num -= n; }
-
-   BOOST_CONTAINER_FORCEINLINE difference_type distance_to(const this_type &other)const
-   {  return difference_type(m_num - other.m_num);   }
-};
-
-#if !defined(BOOST_NO_CXX11_VARIADIC_TEMPLATES)
-
-template<class ...Args>
-struct emplace_functor
-{
-   typedef typename dtl::build_number_seq<sizeof...(Args)>::type index_tuple_t;
-
-   BOOST_CONTAINER_FORCEINLINE emplace_functor(BOOST_FWD_REF(Args)... args)
-      : args_(args...)
-   {}
-
-   template<class Allocator, class T>
-   BOOST_CONTAINER_FORCEINLINE void operator()(Allocator &a, T *ptr)
-   {  emplace_functor::inplace_impl(a, ptr, index_tuple_t());  }
-
-   template<class DestIt>
-   BOOST_CONTAINER_FORCEINLINE void operator()(DestIt dest)
-   {  emplace_functor::inplace_impl(dest, index_tuple_t());  }
-
-   private:
-   template<class Allocator, class T, std::size_t ...IdxPack>
-   BOOST_CONTAINER_FORCEINLINE void inplace_impl(Allocator &a, T* ptr, const dtl::index_tuple<IdxPack...>&)
-   {
-      allocator_traits<Allocator>::construct
-         (a, ptr, ::boost::forward<Args>(dtl::get<IdxPack>(args_))...);
-   }
-
-   template<class DestIt, std::size_t ...IdxPack>
-   BOOST_CONTAINER_FORCEINLINE void inplace_impl(DestIt dest, const dtl::index_tuple<IdxPack...>&)
-   {
-      typedef typename boost::container::iterator_traits<DestIt>::value_type value_type;
-      value_type && tmp= value_type(::boost::forward<Args>(dtl::get<IdxPack>(args_))...);
-      *dest = ::boost::move(tmp);
-   }
-
-   dtl::tuple<Args&...> args_;
-};
-
-template<class ...Args>
-struct emplace_functor_type
-{
-   typedef emplace_functor<Args...> type;
-};
-
-#else // !defined(BOOST_NO_CXX11_VARIADIC_TEMPLATES)
-
-//Partial specializations cannot match argument list for primary template, so add an extra argument
-template <BOOST_MOVE_CLASSDFLT9, class Dummy = void>
-struct emplace_functor_type;
-
-#define BOOST_MOVE_ITERATOR_EMPLACE_FUNCTOR_CODE(N) \
-BOOST_MOVE_TMPL_LT##N BOOST_MOVE_CLASS##N BOOST_MOVE_GT##N \
-struct emplace_functor##N\
-{\
-   BOOST_CONTAINER_FORCEINLINE explicit emplace_functor##N( BOOST_MOVE_UREF##N )\
-      BOOST_MOVE_COLON##N BOOST_MOVE_FWD_INIT##N{}\
-   \
-   template<class Allocator, class T>\
-   BOOST_CONTAINER_FORCEINLINE void operator()(Allocator &a, T *ptr)\
-   {  allocator_traits<Allocator>::construct(a, ptr BOOST_MOVE_I##N BOOST_MOVE_MFWD##N);  }\
-   \
-   template<class DestIt>\
-   BOOST_CONTAINER_FORCEINLINE void operator()(DestIt dest)\
-   {\
-      typedef typename boost::container::iterator_traits<DestIt>::value_type value_type;\
-      BOOST_MOVE_IF(N, value_type tmp(BOOST_MOVE_MFWD##N), dtl::value_init<value_type> tmp) ;\
-      *dest = ::boost::move(const_cast<value_type &>(BOOST_MOVE_IF(N, tmp, tmp.get())));\
-   }\
-   \
-   BOOST_MOVE_MREF##N\
-};\
-\
-template <BOOST_MOVE_CLASS##N>\
-struct emplace_functor_type<BOOST_MOVE_TARG##N>\
-{\
-   typedef emplace_functor##N BOOST_MOVE_LT##N BOOST_MOVE_TARG##N BOOST_MOVE_GT##N type;\
-};\
-//
-
-BOOST_MOVE_ITERATE_0TO9(BOOST_MOVE_ITERATOR_EMPLACE_FUNCTOR_CODE)
-
-#undef BOOST_MOVE_ITERATOR_EMPLACE_FUNCTOR_CODE
-
-#endif
-
-namespace dtl {
-
-template<class T>
-struct has_iterator_category
-{
-   struct two { char _[2]; };
-
-   template <typename X>
-   static char test(int, typename X::iterator_category*);
-
-   template <typename X>
-   static two test(int, ...);
-
-   static const bool value = (1 == sizeof(test<T>(0, 0)));
-};
-
-
-template<class T, bool = has_iterator_category<T>::value >
-struct is_input_iterator
-{
-   static const bool value = is_same<typename T::iterator_category, std::input_iterator_tag>::value;
-};
-
-template<class T>
-struct is_input_iterator<T, false>
-{
-   static const bool value = false;
-};
-
-template<class T>
-struct is_not_input_iterator
-{
-   static const bool value = !is_input_iterator<T>::value;
-};
-
-template<class T, bool = has_iterator_category<T>::value >
-struct is_forward_iterator
-{
-   static const bool value = is_same<typename T::iterator_category, std::forward_iterator_tag>::value;
-};
-
-template<class T>
-struct is_forward_iterator<T, false>
-{
-   static const bool value = false;
-};
-
-template<class T, bool = has_iterator_category<T>::value >
-struct is_bidirectional_iterator
-{
-   static const bool value = is_same<typename T::iterator_category, std::bidirectional_iterator_tag>::value;
-};
-
-template<class T>
-struct is_bidirectional_iterator<T, false>
-{
-   static const bool value = false;
-};
-
-template<class IINodeType>
-struct iiterator_node_value_type {
-  typedef typename IINodeType::value_type type;
-};
-
-template<class IIterator>
-struct iiterator_types
-{
-   typedef typename IIterator::value_type                            it_value_type;
-   typedef typename iiterator_node_value_type<it_value_type>::type   value_type;
-   typedef typename boost::container::iterator_traits<IIterator>::pointer         it_pointer;
-   typedef typename boost::container::iterator_traits<IIterator>::difference_type difference_type;
-   typedef typename ::boost::intrusive::pointer_traits<it_pointer>::
-      template rebind_pointer<value_type>::type                      pointer;
-   typedef typename ::boost::intrusive::pointer_traits<it_pointer>::
-      template rebind_pointer<const value_type>::type                const_pointer;
-   typedef typename ::boost::intrusive::
-      pointer_traits<pointer>::reference                             reference;
-   typedef typename ::boost::intrusive::
-      pointer_traits<const_pointer>::reference                       const_reference;
-   typedef typename IIterator::iterator_category                     iterator_category;
-};
-
-template<class IIterator, bool IsConst>
-struct iterator_types
-{
-   typedef typename ::boost::container::iterator
-      < typename iiterator_types<IIterator>::iterator_category
-      , typename iiterator_types<IIterator>::value_type
-      , typename iiterator_types<IIterator>::difference_type
-      , typename iiterator_types<IIterator>::const_pointer
-      , typename iiterator_types<IIterator>::const_reference> type;
-};
-
-template<class IIterator>
-struct iterator_types<IIterator, false>
-{
-   typedef typename ::boost::container::iterator
-      < typename iiterator_types<IIterator>::iterator_category
-      , typename iiterator_types<IIterator>::value_type
-      , typename iiterator_types<IIterator>::difference_type
-      , typename iiterator_types<IIterator>::pointer
-      , typename iiterator_types<IIterator>::reference> type;
-};
-
-template<class IIterator, bool IsConst>
-class iterator_from_iiterator
-{
-   typedef typename iterator_types<IIterator, IsConst>::type   types_t;
-   class nat
-   {
-      public:
-      IIterator get() const
-      {  return IIterator(); }
-   };
-   typedef typename dtl::if_c< IsConst
-                             , iterator_from_iiterator<IIterator, false>
-                             , nat>::type                      nonconst_iterator;
-
-   public:
-   typedef typename types_t::pointer             pointer;
-   typedef typename types_t::reference           reference;
-   typedef typename types_t::difference_type     difference_type;
-   typedef typename types_t::iterator_category   iterator_category;
-   typedef typename types_t::value_type          value_type;
-
-   BOOST_CONTAINER_FORCEINLINE iterator_from_iiterator()
-      : m_iit()
-   {}
-
-   BOOST_CONTAINER_FORCEINLINE explicit iterator_from_iiterator(IIterator iit) BOOST_NOEXCEPT_OR_NOTHROW
-      : m_iit(iit)
-   {}
-
-   BOOST_CONTAINER_FORCEINLINE iterator_from_iiterator(const iterator_from_iiterator& other) BOOST_NOEXCEPT_OR_NOTHROW
-      :  m_iit(other.get())
-   {}
-
-   BOOST_CONTAINER_FORCEINLINE iterator_from_iiterator(const nonconst_iterator& other) BOOST_NOEXCEPT_OR_NOTHROW
-      :  m_iit(other.get())
-   {}
-
-   BOOST_CONTAINER_FORCEINLINE iterator_from_iiterator& operator=(const iterator_from_iiterator& other) BOOST_NOEXCEPT_OR_NOTHROW
-   {  m_iit = other.get(); return *this;  }
-
-   BOOST_CONTAINER_FORCEINLINE iterator_from_iiterator& operator++() BOOST_NOEXCEPT_OR_NOTHROW
-   {  ++this->m_iit;   return *this;  }
-
-   BOOST_CONTAINER_FORCEINLINE iterator_from_iiterator operator++(int) BOOST_NOEXCEPT_OR_NOTHROW
-   {
-      iterator_from_iiterator result (*this);
-      ++this->m_iit;
-      return result;
-   }
-
-   BOOST_CONTAINER_FORCEINLINE iterator_from_iiterator& operator--() BOOST_NOEXCEPT_OR_NOTHROW
-   {
-      //If the iterator_from_iiterator is not a bidirectional iterator, operator-- should not exist
-      BOOST_STATIC_ASSERT((is_bidirectional_iterator<iterator_from_iiterator>::value));
-      --this->m_iit;   return *this;
-   }
-
-   BOOST_CONTAINER_FORCEINLINE iterator_from_iiterator operator--(int) BOOST_NOEXCEPT_OR_NOTHROW
-   {
-      iterator_from_iiterator result (*this);
-      --this->m_iit;
-      return result;
-   }
-
-   BOOST_CONTAINER_FORCEINLINE friend bool operator== (const iterator_from_iiterator& l, const iterator_from_iiterator& r) BOOST_NOEXCEPT_OR_NOTHROW
-   {  return l.m_iit == r.m_iit;   }
-
-   BOOST_CONTAINER_FORCEINLINE friend bool operator!= (const iterator_from_iiterator& l, const iterator_from_iiterator& r) BOOST_NOEXCEPT_OR_NOTHROW
-   {  return l.m_iit != r.m_iit;   }
-
-   BOOST_CONTAINER_FORCEINLINE reference operator*()  const BOOST_NOEXCEPT_OR_NOTHROW
-   {  return this->m_iit->get_data();  }
-
-   BOOST_CONTAINER_FORCEINLINE pointer   operator->() const BOOST_NOEXCEPT_OR_NOTHROW
-   {  return ::boost::intrusive::pointer_traits<pointer>::pointer_to(this->operator*());  }
-
-   BOOST_CONTAINER_FORCEINLINE const IIterator &get() const BOOST_NOEXCEPT_OR_NOTHROW
-   {  return this->m_iit;   }
-
-   private:
-   IIterator m_iit;
-};
-
-}  //namespace dtl {
-
-using ::boost::intrusive::reverse_iterator;
-
-}  //namespace container {
-}  //namespace boost {
-
-#include <boost/container/detail/config_end.hpp>
-
-#endif   //#ifndef BOOST_CONTAINER_DETAIL_ITERATORS_HPP
diff --git a/src/boost/container/detail/min_max.hpp b/src/boost/container/detail/min_max.hpp
deleted file mode 100644
index 35cf0661..00000000
--- a/src/boost/container/detail/min_max.hpp
+++ /dev/null
@@ -1,37 +0,0 @@
-//////////////////////////////////////////////////////////////////////////////
-//
-// (C) Copyright Ion Gaztanaga 2005-2013. Distributed under the Boost
-// 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.
-//
-//////////////////////////////////////////////////////////////////////////////
-#ifndef BOOST_CONTAINER_DETAIL_MIN_MAX_HPP
-#define BOOST_CONTAINER_DETAIL_MIN_MAX_HPP
-
-#ifndef BOOST_CONFIG_HPP
-#  include <boost/config.hpp>
-#endif
-
-#if defined(BOOST_HAS_PRAGMA_ONCE)
-#  pragma once
-#endif
-
-namespace boost {
-namespace container {
-namespace dtl {
-
-template<class T>
-const T &max_value(const T &a, const T &b)
-{  return a > b ? a : b;   }
-
-template<class T>
-const T &min_value(const T &a, const T &b)
-{  return a < b ? a : b;   }
-
-}  //namespace dtl {
-}  //namespace container {
-}  //namespace boost {
-
-#endif   //#ifndef BOOST_CONTAINER_DETAIL_MIN_MAX_HPP
diff --git a/src/boost/container/detail/minimal_char_traits_header.hpp b/src/boost/container/detail/minimal_char_traits_header.hpp
deleted file mode 100644
index a92a31a2..00000000
--- a/src/boost/container/detail/minimal_char_traits_header.hpp
+++ /dev/null
@@ -1,32 +0,0 @@
-/////////////////////////////////////////////////////////////////////////////
-//
-// (C) Copyright Ion Gaztanaga  2014-2015
-//
-// Distributed under the Boost 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.
-//
-/////////////////////////////////////////////////////////////////////////////
-#ifndef BOOST_CONTAINER_DETAIL_MINIMAL_CHAR_TRAITS_HEADER_HPP
-#define BOOST_CONTAINER_DETAIL_MINIMAL_CHAR_TRAITS_HEADER_HPP
-#
-#ifndef BOOST_CONFIG_HPP
-#  include <boost/config.hpp>
-#endif
-#
-#if defined(BOOST_HAS_PRAGMA_ONCE)
-#  pragma once
-#endif
-#
-#//Try to avoid including <string>, as it's quite big
-#if defined(_MSC_VER) && defined(BOOST_DINKUMWARE_STDLIB)
-   #include <iosfwd>   //Dinkum libraries for MSVC define std::char_traits there
-#elif defined(BOOST_GNU_STDLIB)
-   #include <bits/char_traits.h>
-#else
-   #include <string>  //Fallback
-#endif
-
-#endif //BOOST_CONTAINER_DETAIL_MINIMAL_CHAR_TRAITS_HEADER_HPP
diff --git a/src/boost/container/detail/mpl.hpp b/src/boost/container/detail/mpl.hpp
deleted file mode 100644
index ffae180c..00000000
--- a/src/boost/container/detail/mpl.hpp
+++ /dev/null
@@ -1,144 +0,0 @@
-//////////////////////////////////////////////////////////////////////////////
-//
-// (C) Copyright Ion Gaztanaga 2005-2013.
-//
-// Distributed under the Boost 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.
-//
-//////////////////////////////////////////////////////////////////////////////
-
-#ifndef BOOST_CONTAINER_CONTAINER_DETAIL_MPL_HPP
-#define BOOST_CONTAINER_CONTAINER_DETAIL_MPL_HPP
-
-#ifndef BOOST_CONFIG_HPP
-#  include <boost/config.hpp>
-#endif
-
-#if defined(BOOST_HAS_PRAGMA_ONCE)
-#  pragma once
-#endif
-
-#include <boost/container/detail/config_begin.hpp>
-#include <boost/container/detail/workaround.hpp>
-#include <boost/move/detail/type_traits.hpp>
-#include <boost/intrusive/detail/mpl.hpp>
-
-#include <cstddef>
-
-namespace boost {
-namespace container {
-namespace dtl {
-
-using boost::move_detail::integral_constant;
-using boost::move_detail::true_type;
-using boost::move_detail::false_type;
-using boost::move_detail::enable_if_c;
-using boost::move_detail::enable_if;
-using boost::move_detail::enable_if_convertible;
-using boost::move_detail::disable_if_c;
-using boost::move_detail::disable_if;
-using boost::move_detail::disable_if_convertible;
-using boost::move_detail::is_convertible;
-using boost::move_detail::if_c;
-using boost::move_detail::if_;
-using boost::move_detail::identity;
-using boost::move_detail::bool_;
-using boost::move_detail::true_;
-using boost::move_detail::false_;
-using boost::move_detail::yes_type;
-using boost::move_detail::no_type;
-using boost::move_detail::bool_;
-using boost::move_detail::true_;
-using boost::move_detail::false_;
-using boost::move_detail::unvoid_ref;
-using boost::move_detail::and_;
-using boost::move_detail::or_;
-using boost::move_detail::not_;
-using boost::move_detail::enable_if_and;
-using boost::move_detail::disable_if_and;
-using boost::move_detail::enable_if_or;
-using boost::move_detail::disable_if_or;
-using boost::move_detail::remove_const;
-
-template <class FirstType>
-struct select1st
-{
-   typedef FirstType type;
-
-   template<class T>
-   BOOST_CONTAINER_FORCEINLINE const type& operator()(const T& x) const
-   {  return x.first;   }
-
-   template<class T>
-   BOOST_CONTAINER_FORCEINLINE type& operator()(T& x)
-   {  return const_cast<type&>(x.first);   }
-};
-
-
-template<typename T>
-struct void_t { typedef void type; };
-
-template <class T, class=void>
-struct is_transparent_base
-{
-   static const bool value = false;
-};
-
-template <class T>
-struct is_transparent_base<T, typename void_t<typename T::is_transparent>::type>
-{
-   static const bool value = true;
-};
-
-template <class T>
-struct is_transparent
-   : is_transparent_base<T>
-{};
-
-template <typename C, class /*Dummy*/, typename R>
-struct enable_if_transparent
-   : boost::move_detail::enable_if_c<dtl::is_transparent<C>::value, R>
-{};
-
-#ifndef BOOST_CONTAINER_NO_CXX17_CTAD
-
-// void_t (void_t for C++11)
-template<typename...> using variadic_void_t = void;
-
-// Trait to detect Allocator-like types.
-template<typename Allocator, typename = void>
-struct is_allocator
-{
-   static const bool value = false;
-};
-
-template <typename T>
-T&& ctad_declval();
-
-template<typename Allocator>
-struct is_allocator < Allocator,
-   variadic_void_t< typename Allocator::value_type
-                  , decltype(ctad_declval<Allocator&>().allocate(size_t{})) >>
-{
-   static const bool value = true;
-};
-
-template<class T>
-using require_allocator_t = typename enable_if_c<is_allocator<T>::value, T>::type;
-
-template<class T>
-using require_nonallocator_t = typename enable_if_c<!is_allocator<T>::value, T>::type;
-
-#endif
-
-}  //namespace dtl {
-}  //namespace container {
-}  //namespace boost {
-
-#include <boost/container/detail/config_end.hpp>
-
-#endif   //#ifndef BOOST_CONTAINER_CONTAINER_DETAIL_MPL_HPP
-
diff --git a/src/boost/container/detail/multiallocation_chain.hpp b/src/boost/container/detail/multiallocation_chain.hpp
deleted file mode 100644
index 749ef5a0..00000000
--- a/src/boost/container/detail/multiallocation_chain.hpp
+++ /dev/null
@@ -1,307 +0,0 @@
-//////////////////////////////////////////////////////////////////////////////
-//
-// (C) Copyright Ion Gaztanaga 2005-2013. Distributed under the Boost
-// 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.
-//
-//////////////////////////////////////////////////////////////////////////////
-
-#ifndef BOOST_CONTAINER_DETAIL_MULTIALLOCATION_CHAIN_HPP
-#define BOOST_CONTAINER_DETAIL_MULTIALLOCATION_CHAIN_HPP
-
-#ifndef BOOST_CONFIG_HPP
-#  include <boost/config.hpp>
-#endif
-
-#if defined(BOOST_HAS_PRAGMA_ONCE)
-#  pragma once
-#endif
-
-#include <boost/container/detail/config_begin.hpp>
-#include <boost/container/detail/workaround.hpp>
-// container
-#include <boost/container/container_fwd.hpp>
-// container/detail
-#include <boost/move/detail/to_raw_pointer.hpp>
-#include <boost/container/detail/transform_iterator.hpp>
-#include <boost/container/detail/type_traits.hpp>
-#include <boost/container/detail/placement_new.hpp>
-// intrusive
-#include <boost/intrusive/slist.hpp>
-#include <boost/intrusive/pointer_traits.hpp>
-#include <boost/intrusive/detail/twin.hpp>
-// move
-#include <boost/move/utility_core.hpp>
-
-namespace boost {
-namespace container {
-namespace dtl {
-
-template<class VoidPointer>
-class basic_multiallocation_chain
-{
-   private:
-   typedef bi::slist_base_hook<bi::void_pointer<VoidPointer>
-                        ,bi::link_mode<bi::normal_link>
-                        > node;
-
-   typedef typename boost::intrusive::pointer_traits
-      <VoidPointer>::template rebind_pointer<char>::type    char_ptr;
-   typedef typename boost::intrusive::
-      pointer_traits<char_ptr>::difference_type             difference_type;
-
-   typedef bi::slist< node
-                    , bi::linear<true>
-                    , bi::cache_last<true>
-                    , bi::size_type<typename boost::container::dtl::make_unsigned<difference_type>::type>
-                    > slist_impl_t;
-   slist_impl_t slist_impl_;
-
-   typedef typename boost::intrusive::pointer_traits
-      <VoidPointer>::template rebind_pointer<node>::type    node_ptr;
-   typedef typename boost::intrusive::
-      pointer_traits<node_ptr>                              node_ptr_traits;
-
-   static node & to_node(const VoidPointer &p)
-   {  return *static_cast<node*>(static_cast<void*>(boost::movelib::to_raw_pointer(p)));  }
-
-   static VoidPointer from_node(node &n)
-   {  return node_ptr_traits::pointer_to(n);  }
-
-   static node_ptr to_node_ptr(const VoidPointer &p)
-   {  return node_ptr_traits::static_cast_from(p);   }
-
-   BOOST_MOVABLE_BUT_NOT_COPYABLE(basic_multiallocation_chain)
-
-   public:
-
-   typedef VoidPointer                       void_pointer;
-   typedef typename slist_impl_t::iterator   iterator;
-   typedef typename slist_impl_t::size_type  size_type;
-   typedef boost::intrusive::twin<void_pointer> pointer_pair;
-
-   basic_multiallocation_chain()
-      :  slist_impl_()
-   {}
-
-   basic_multiallocation_chain(const void_pointer &b, const void_pointer &before_e, size_type n)
-      :  slist_impl_(to_node_ptr(b), to_node_ptr(before_e), n)
-   {}
-
-   basic_multiallocation_chain(BOOST_RV_REF(basic_multiallocation_chain) other)
-      :  slist_impl_(::boost::move(other.slist_impl_))
-   {}
-
-   basic_multiallocation_chain& operator=(BOOST_RV_REF(basic_multiallocation_chain) other)
-   {
-      slist_impl_ = ::boost::move(other.slist_impl_);
-      return *this;
-   }
-
-   bool empty() const
-   {  return slist_impl_.empty(); }
-
-   size_type size() const
-   {  return slist_impl_.size();  }
-
-   iterator before_begin()
-   {  return slist_impl_.before_begin(); }
-
-   iterator begin()
-   {  return slist_impl_.begin(); }
-
-   iterator end()
-   {  return slist_impl_.end(); }
-
-   iterator last()
-   {  return slist_impl_.last(); }
-
-   void clear()
-   {  slist_impl_.clear(); }
-
-   iterator insert_after(iterator it, void_pointer m)
-   {  return slist_impl_.insert_after(it, to_node(m));   }
-
-   void push_front(const void_pointer &m)
-   {  return slist_impl_.push_front(to_node(m));  }
-
-   void push_back(const void_pointer &m)
-   {  return slist_impl_.push_back(to_node(m));   }
-
-   void_pointer pop_front()
-   {
-      node & n = slist_impl_.front();
-      void_pointer ret = from_node(n);
-      slist_impl_.pop_front();
-      return ret;
-   }
-
-   void splice_after(iterator after_this, basic_multiallocation_chain &x, iterator before_b, iterator before_e, size_type n)
-   {  slist_impl_.splice_after(after_this, x.slist_impl_, before_b, before_e, n);   }
-
-   void splice_after(iterator after_this, basic_multiallocation_chain &x)
-   {  slist_impl_.splice_after(after_this, x.slist_impl_);   }
-
-   void erase_after(iterator before_b, iterator e, size_type n)
-   {  slist_impl_.erase_after(before_b, e, n);   }
-
-   void_pointer incorporate_after(iterator after_this, const void_pointer &b, size_type unit_bytes, size_type num_units)
-   {
-      typedef typename boost::intrusive::pointer_traits<char_ptr> char_pointer_traits;
-      char_ptr elem = char_pointer_traits::static_cast_from(b);
-      if(num_units){
-         char_ptr prev_elem = elem;
-         elem += difference_type(unit_bytes);
-         for(size_type i = 0; i != num_units-1u; ++i, elem += difference_type(unit_bytes)){
-            ::new (boost::movelib::to_raw_pointer(prev_elem), boost_container_new_t()) void_pointer(elem);
-            prev_elem = elem;
-         }
-         slist_impl_.incorporate_after(after_this, to_node_ptr(b), to_node_ptr(prev_elem), num_units);
-      }
-      return elem;
-   }
-
-   void incorporate_after(iterator after_this, void_pointer b, void_pointer before_e, size_type n)
-   {  slist_impl_.incorporate_after(after_this, to_node_ptr(b), to_node_ptr(before_e), n);   }
-
-   void swap(basic_multiallocation_chain &x)
-   {  slist_impl_.swap(x.slist_impl_);   }
-
-   static iterator iterator_to(const void_pointer &p)
-   {  return slist_impl_t::s_iterator_to(to_node(p));   }
-
-   pointer_pair extract_data()
-   {
-      if(BOOST_LIKELY(!slist_impl_.empty())){
-         pointer_pair ret
-            (slist_impl_.begin().operator->()
-            ,slist_impl_.last().operator->());
-         slist_impl_.clear();
-         return ret;
-      }
-      else {
-         return pointer_pair();
-      }
-   }
-};
-
-template<class T>
-struct cast_functor
-{
-   typedef typename dtl::add_reference<T>::type result_type;
-   template<class U>
-   result_type operator()(U &ptr) const
-   {  return *static_cast<T*>(static_cast<void*>(&ptr));  }
-};
-
-template<class MultiallocationChain, class T>
-class transform_multiallocation_chain
-   : public MultiallocationChain
-{
-   private:
-   BOOST_MOVABLE_BUT_NOT_COPYABLE(transform_multiallocation_chain)
-   //transform_multiallocation_chain(const transform_multiallocation_chain &);
-   //transform_multiallocation_chain & operator=(const transform_multiallocation_chain &);
-
-   typedef typename MultiallocationChain::void_pointer   void_pointer;
-   typedef typename boost::intrusive::pointer_traits
-      <void_pointer>                                     void_pointer_traits;
-   typedef typename void_pointer_traits::template
-      rebind_pointer<T>::type                            pointer;
-   typedef typename boost::intrusive::pointer_traits
-      <pointer>                                          pointer_traits;
-
-   static pointer cast(const void_pointer &p)
-   {  return pointer_traits::static_cast_from(p);  }
-
-   public:
-   typedef transform_iterator
-      < typename MultiallocationChain::iterator
-      , dtl::cast_functor <T> >                          iterator;
-   typedef typename MultiallocationChain::size_type      size_type;
-   typedef boost::intrusive::twin<pointer>               pointer_pair;
-
-   transform_multiallocation_chain()
-      : MultiallocationChain()
-   {}
-
-   transform_multiallocation_chain(BOOST_RV_REF(transform_multiallocation_chain) other)
-      : MultiallocationChain(::boost::move(static_cast<MultiallocationChain&>(other)))
-   {}
-
-   transform_multiallocation_chain(BOOST_RV_REF(MultiallocationChain) other)
-      : MultiallocationChain(::boost::move(static_cast<MultiallocationChain&>(other)))
-   {}
-
-   transform_multiallocation_chain& operator=(BOOST_RV_REF(transform_multiallocation_chain) other)
-   {
-      return static_cast<MultiallocationChain&>
-         (this->MultiallocationChain::operator=(::boost::move(static_cast<MultiallocationChain&>(other))));
-   }
-
-   void push_front(const pointer &mem)
-   {   this->MultiallocationChain::push_front(mem);  }
-
-   void push_back(const pointer &mem)
-   {  return this->MultiallocationChain::push_back(mem);   }
-
-   void swap(transform_multiallocation_chain &other_chain)
-   {  this->MultiallocationChain::swap(other_chain); }
-
-   void splice_after(iterator after_this, transform_multiallocation_chain &x, iterator before_b, iterator before_e, size_type n)
-   {  this->MultiallocationChain::splice_after(after_this.base(), x, before_b.base(), before_e.base(), n);  }
-
-   void incorporate_after(iterator after_this, pointer b, pointer before_e, size_type n)
-   {  this->MultiallocationChain::incorporate_after(after_this.base(), b, before_e, n);  }
-
-   pointer pop_front()
-   {  return cast(this->MultiallocationChain::pop_front());  }
-
-   bool empty() const
-   {  return this->MultiallocationChain::empty(); }
-
-   iterator before_begin()
-   {  return iterator(this->MultiallocationChain::before_begin());   }
-
-   iterator begin()
-   {  return iterator(this->MultiallocationChain::begin());   }
-
-   iterator last()
-   {  return iterator(this->MultiallocationChain::last());  }
-
-   iterator end()
-   {  return iterator(this->MultiallocationChain::end());   }
-
-   size_type size() const
-   {  return this->MultiallocationChain::size();  }
-
-   void clear()
-   {  this->MultiallocationChain::clear(); }
-
-   iterator insert_after(iterator it, pointer m)
-   {  return iterator(this->MultiallocationChain::insert_after(it.base(), m)); }
-
-   static iterator iterator_to(const pointer &p)
-   {  return iterator(MultiallocationChain::iterator_to(p));  }
-
-   pointer_pair extract_data()
-   {
-      typename MultiallocationChain::pointer_pair data(this->MultiallocationChain::extract_data());
-      return pointer_pair(cast(data.first), cast(data.second));
-   }
-/*
-   MultiallocationChain &extract_multiallocation_chain()
-   {  return holder_;  }*/
-};
-
-}}}
-
-// namespace dtl {
-// namespace container {
-// namespace boost {
-
-#include <boost/container/detail/config_end.hpp>
-
-#endif   //BOOST_CONTAINER_DETAIL_MULTIALLOCATION_CHAIN_HPP
diff --git a/src/boost/container/detail/next_capacity.hpp b/src/boost/container/detail/next_capacity.hpp
deleted file mode 100644
index 9777b147..00000000
--- a/src/boost/container/detail/next_capacity.hpp
+++ /dev/null
@@ -1,98 +0,0 @@
-//////////////////////////////////////////////////////////////////////////////
-//
-// (C) Copyright Ion Gaztanaga 2014-2015. Distributed under the Boost
-// 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.
-//
-//////////////////////////////////////////////////////////////////////////////
-#ifndef BOOST_CONTAINER_DETAIL_NEXT_CAPACITY_HPP
-#define BOOST_CONTAINER_DETAIL_NEXT_CAPACITY_HPP
-
-#ifndef BOOST_CONFIG_HPP
-#  include <boost/config.hpp>
-#endif
-
-#if defined(BOOST_HAS_PRAGMA_ONCE)
-#  pragma once
-#endif
-
-#include <boost/container/detail/config_begin.hpp>
-#include <boost/container/detail/workaround.hpp>
-
-// container
-#include <boost/container/throw_exception.hpp>
-// container/detail
-#include <boost/container/detail/min_max.hpp>
-
-#include <boost/static_assert.hpp>
-
-namespace boost {
-namespace container {
-namespace dtl {
-
-template<unsigned Minimum, unsigned Numerator, unsigned Denominator>
-struct grow_factor_ratio
-{
-   BOOST_STATIC_ASSERT(Numerator > Denominator);
-   BOOST_STATIC_ASSERT(Numerator   < 100);
-   BOOST_STATIC_ASSERT(Denominator < 100);
-   BOOST_STATIC_ASSERT(Denominator == 1 || (0 != Numerator % Denominator));
-
-   template<class SizeType>
-   SizeType operator()(const SizeType cur_cap, const SizeType add_min_cap, const SizeType max_cap) const
-   {
-      const SizeType overflow_limit  = ((SizeType)-1) / Numerator;
-
-      SizeType new_cap = 0;
-
-      if(cur_cap <= overflow_limit){
-         new_cap = SizeType(cur_cap * Numerator / Denominator);
-      }
-      else if(Denominator == 1 || (SizeType(new_cap = cur_cap) / Denominator) > overflow_limit){
-         new_cap = (SizeType)-1;
-      }
-      else{
-         new_cap = SizeType(new_cap*Numerator);
-      }
-      return max_value<SizeType>
-               ( SizeType(Minimum)
-               , max_value<SizeType>
-                  ( SizeType(cur_cap+add_min_cap)
-                  , min_value<SizeType>(max_cap, new_cap))
-               );
-   }
-};
-
-}  //namespace dtl {
-
-struct growth_factor_50
-   : dtl::grow_factor_ratio<0, 3, 2>
-{};
-
-struct growth_factor_60
-   : dtl::grow_factor_ratio<0, 8, 5>
-{};
-
-struct growth_factor_100
-   : dtl::grow_factor_ratio<0, 2, 1>
-{};
-
-template<class SizeType>
-BOOST_CONTAINER_FORCEINLINE void clamp_by_stored_size_type(SizeType &, SizeType)
-{}
-
-template<class SizeType, class SomeStoredSizeType>
-BOOST_CONTAINER_FORCEINLINE void clamp_by_stored_size_type(SizeType &s, SomeStoredSizeType)
-{
-   if (s >= SomeStoredSizeType(-1) ) 
-      s = SomeStoredSizeType(-1);
-}
-
-}  //namespace container {
-}  //namespace boost {
-
-#include <boost/container/detail/config_end.hpp>
-
-#endif   //#ifndef BOOST_CONTAINER_DETAIL_NEXT_CAPACITY_HPP
diff --git a/src/boost/container/detail/node_alloc_holder.hpp b/src/boost/container/detail/node_alloc_holder.hpp
deleted file mode 100644
index 8db384e4..00000000
--- a/src/boost/container/detail/node_alloc_holder.hpp
+++ /dev/null
@@ -1,604 +0,0 @@
-//////////////////////////////////////////////////////////////////////////////
-//
-// (C) Copyright Ion Gaztanaga 2005-2013. Distributed under the Boost
-// 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.
-//
-//////////////////////////////////////////////////////////////////////////////
-
-#ifndef BOOST_CONTAINER_DETAIL_NODE_ALLOC_HPP_
-#define BOOST_CONTAINER_DETAIL_NODE_ALLOC_HPP_
-
-#ifndef BOOST_CONFIG_HPP
-#  include <boost/config.hpp>
-#endif
-
-#if defined(BOOST_HAS_PRAGMA_ONCE)
-#  pragma once
-#endif
-
-#include <boost/container/detail/config_begin.hpp>
-#include <boost/container/detail/workaround.hpp>
-
-// container
-#include <boost/container/allocator_traits.hpp>
-// container/detail
-#include <boost/container/detail/addressof.hpp>
-#include <boost/container/detail/alloc_helpers.hpp>
-#include <boost/container/detail/allocator_version_traits.hpp>
-#include <boost/container/detail/construct_in_place.hpp>
-#include <boost/container/detail/destroyers.hpp>
-#include <boost/move/detail/iterator_to_raw_pointer.hpp>
-#include <boost/container/detail/mpl.hpp>
-#include <boost/container/detail/placement_new.hpp>
-#include <boost/move/detail/to_raw_pointer.hpp>
-#include <boost/container/detail/type_traits.hpp>
-#include <boost/container/detail/version_type.hpp>
-#include <boost/container/detail/is_pair.hpp>
-// intrusive
-#include <boost/intrusive/detail/mpl.hpp>
-#include <boost/intrusive/options.hpp>
-// move
-#include <boost/move/utility_core.hpp>
-#if defined(BOOST_NO_CXX11_VARIADIC_TEMPLATES)
-#include <boost/move/detail/fwd_macros.hpp>
-#endif
-
-
-namespace boost {
-namespace container {
-
-//This trait is used to type-pun std::pair because in C++03
-//compilers std::pair is useless for C++11 features
-template<class T, bool>
-struct node_internal_data_type
-{
-   typedef T type;
-};
-
-template<class T>
-struct node_internal_data_type< T, true>
-{
-   typedef dtl::pair< typename dtl::remove_const<typename T::first_type>::type
-                     , typename T::second_type>
-                     type;
-};
-
-template <class T, class HookDefiner, bool PairBased = false>
-struct base_node
-   :  public HookDefiner::type
-{
-   public:
-   typedef T value_type;
-   typedef typename node_internal_data_type<T, PairBased && dtl::is_pair<T>::value>::type internal_type;
-   typedef typename HookDefiner::type hook_type;
-
-   typedef typename dtl::aligned_storage<sizeof(T), dtl::alignment_of<T>::value>::type storage_t;
-   storage_t m_storage;
-
-   #if defined(BOOST_GCC) && (BOOST_GCC >= 40600) && (BOOST_GCC < 80000)
-      #pragma GCC diagnostic push
-      #pragma GCC diagnostic ignored "-Wstrict-aliasing"
-      #define BOOST_CONTAINER_DISABLE_ALIASING_WARNING
-   #  endif
-   public:
-
-   #if !defined(BOOST_NO_CXX11_VARIADIC_TEMPLATES)
-
-   template<class Alloc, class ...Args>
-   explicit base_node(Alloc &a, Args &&...args)
-      : hook_type()
-   {
-      ::boost::container::allocator_traits<Alloc>::construct
-         (a, &this->get_real_data(), ::boost::forward<Args>(args)...);
-   }
-
-   #else //defined(BOOST_NO_CXX11_VARIADIC_TEMPLATES)
-
-   #define BOOST_CONTAINER_BASE_NODE_CONSTRUCT_IMPL(N) \
-   template< class Alloc BOOST_MOVE_I##N BOOST_MOVE_CLASS##N > \
-   explicit base_node(Alloc &a BOOST_MOVE_I##N BOOST_MOVE_UREF##N)\
-      : hook_type()\
-   {\
-      ::boost::container::allocator_traits<Alloc>::construct\
-         (a, &this->get_real_data() BOOST_MOVE_I##N BOOST_MOVE_FWD##N);\
-   }\
-   //
-   BOOST_MOVE_ITERATE_0TO9(BOOST_CONTAINER_BASE_NODE_CONSTRUCT_IMPL)
-   #undef BOOST_CONTAINER_BASE_NODE_CONSTRUCT_IMPL
-
-   #endif   // !defined(BOOST_NO_CXX11_VARIADIC_TEMPLATES)
-
-   template<class Alloc, class It>
-   explicit base_node(iterator_arg_t, Alloc &a, It it)
-      : hook_type()
-   {
-      ::boost::container::construct_in_place(a, &this->get_real_data(), it);
-   }
-
-   BOOST_CONTAINER_FORCEINLINE T &get_data()
-   {  return *move_detail::force_ptr<T*>(this->m_storage.data);   }
-
-   BOOST_CONTAINER_FORCEINLINE const T &get_data() const
-   {  return *move_detail::force_ptr<const T*>(this->m_storage.data);  }
-
-   BOOST_CONTAINER_FORCEINLINE internal_type &get_real_data()
-   {  return *move_detail::force_ptr<internal_type*>(this->m_storage.data);   }
-
-   BOOST_CONTAINER_FORCEINLINE const internal_type &get_real_data() const
-   {  return *move_detail::force_ptr<const internal_type*>(this->m_storage.data);  }
-
-   #if defined(BOOST_CONTAINER_DISABLE_ALIASING_WARNING)
-      #pragma GCC diagnostic pop
-      #undef BOOST_CONTAINER_DISABLE_ALIASING_WARNING
-   #  endif
-
-   template<class Alloc>
-   BOOST_CONTAINER_FORCEINLINE void destructor(Alloc &a) BOOST_NOEXCEPT
-   {
-      allocator_traits<Alloc>::destroy
-         (a, &this->get_real_data());
-      this->~base_node();
-   }
-
-   template<class Pair>
-   BOOST_CONTAINER_FORCEINLINE
-   typename dtl::enable_if< dtl::is_pair<Pair>, void >::type
-      do_assign(const Pair &p)
-   {
-      typedef typename Pair::first_type first_type;
-      const_cast<typename dtl::remove_const<first_type>::type &>(this->get_real_data().first) = p.first;
-      this->get_real_data().second  = p.second;
-   }
-
-   template<class V>
-   BOOST_CONTAINER_FORCEINLINE 
-   typename dtl::disable_if< dtl::is_pair<V>, void >::type
-      do_assign(const V &v)
-   {  this->get_real_data() = v; }
-
-   template<class Pair>
-   BOOST_CONTAINER_FORCEINLINE 
-   typename dtl::enable_if< dtl::is_pair<Pair>, void >::type
-      do_move_assign(Pair &p)
-   {
-      typedef typename Pair::first_type first_type;
-      const_cast<first_type&>(this->get_real_data().first) = ::boost::move(p.first);
-      this->get_real_data().second = ::boost::move(p.second);
-   }
-
-   template<class V>
-   BOOST_CONTAINER_FORCEINLINE 
-   typename dtl::disable_if< dtl::is_pair<V>, void >::type
-      do_move_assign(V &v)
-   {  this->get_real_data() = ::boost::move(v); }
-
-   private:
-   base_node();
-
-   BOOST_CONTAINER_FORCEINLINE ~base_node()
-   { }
-};
-
-
-namespace dtl {
-
-BOOST_INTRUSIVE_INSTANTIATE_DEFAULT_TYPE_TMPLT(key_compare)
-BOOST_INTRUSIVE_INSTANTIATE_DEFAULT_TYPE_TMPLT(key_equal)
-BOOST_INTRUSIVE_INSTANTIATE_DEFAULT_TYPE_TMPLT(hasher)
-BOOST_INTRUSIVE_INSTANTIATE_DEFAULT_TYPE_TMPLT(predicate_type)
-BOOST_INTRUSIVE_INSTANTIATE_DEFAULT_TYPE_TMPLT(bucket_traits)
-BOOST_INTRUSIVE_INSTANTIATE_DEFAULT_TYPE_TMPLT(bucket_type)
-
-template<class Allocator, class ICont>
-struct node_alloc_holder
-   : public allocator_traits<Allocator>::template
-            portable_rebind_alloc<typename ICont::value_type>::type   //NodeAlloc
-{
-   //If the intrusive container is an associative container, obtain the predicate, which will
-   //be of type node_compare<>. If not an associative container val_compare will be a "nat" type.
-   typedef BOOST_INTRUSIVE_OBTAIN_TYPE_WITH_DEFAULT
-      ( boost::container::dtl::
-      , ICont, key_compare, dtl::nat)                 intrusive_key_compare;
-
-   //If the intrusive container is a hash container, obtain the predicate, which will
-   //be of type node_compare<>. If not an associative container val_equal will be a "nat" type.
-   typedef BOOST_INTRUSIVE_OBTAIN_TYPE_WITH_DEFAULT
-      (boost::container::dtl::
-         , ICont, key_equal, dtl::nat2)              intrusive_val_equal;
-   typedef BOOST_INTRUSIVE_OBTAIN_TYPE_WITH_DEFAULT
-   (boost::container::dtl::
-      , ICont, hasher, dtl::nat3)                    intrusive_val_hasher;
-   typedef BOOST_INTRUSIVE_OBTAIN_TYPE_WITH_DEFAULT
-   (boost::container::dtl::
-      , ICont, bucket_traits, dtl::natN<0>)           intrusive_bucket_traits;
-   typedef BOOST_INTRUSIVE_OBTAIN_TYPE_WITH_DEFAULT
-   (boost::container::dtl::
-      , ICont, bucket_type, dtl::natN<1>)            intrusive_bucket_type;
-   //In that case obtain the value predicate from the node predicate via predicate_type
-   //if intrusive_key_compare is node_compare<>, nat otherwise
-   typedef BOOST_INTRUSIVE_OBTAIN_TYPE_WITH_DEFAULT
-   (boost::container::dtl::
-      , intrusive_val_equal
-      , predicate_type, dtl::nat2)                    val_equal;
-   typedef BOOST_INTRUSIVE_OBTAIN_TYPE_WITH_DEFAULT
-   (boost::container::dtl::
-      , intrusive_val_hasher
-      , predicate_type, dtl::nat3)                    val_hasher;
-
-   typedef allocator_traits<Allocator>                            allocator_traits_type;
-   typedef typename allocator_traits_type::value_type             val_type;
-   typedef ICont                                                  intrusive_container;
-   typedef typename ICont::value_type                             Node;
-   typedef typename allocator_traits_type::template
-      portable_rebind_alloc<Node>::type                           NodeAlloc;
-   typedef allocator_traits<NodeAlloc>                            node_allocator_traits_type;
-   typedef dtl::allocator_version_traits<NodeAlloc>  node_allocator_version_traits_type;
-   typedef Allocator                                              ValAlloc;
-   typedef typename node_allocator_traits_type::pointer           NodePtr;
-   typedef dtl::scoped_deallocator<NodeAlloc>        Deallocator;
-   typedef typename node_allocator_traits_type::size_type         size_type;
-   typedef typename node_allocator_traits_type::difference_type   difference_type;
-   typedef dtl::integral_constant<unsigned,
-      boost::container::dtl::
-         version<NodeAlloc>::value>                               alloc_version;
-   typedef typename ICont::iterator                               icont_iterator;
-   typedef typename ICont::const_iterator                         icont_citerator;
-   typedef allocator_node_destroyer<NodeAlloc>                         Destroyer;
-   typedef allocator_traits<NodeAlloc>                            NodeAllocTraits;
-   typedef allocator_version_traits<NodeAlloc>                    AllocVersionTraits;
-
-   private:
-   BOOST_COPYABLE_AND_MOVABLE(node_alloc_holder)
-
-   public:
-
-   //Constructors for sequence containers
-   BOOST_CONTAINER_FORCEINLINE node_alloc_holder()
-   {}
-
-   explicit node_alloc_holder(const intrusive_bucket_traits& bt)
-      : m_icont(bt)
-   {}
-
-   explicit node_alloc_holder(const ValAlloc &a)
-      : NodeAlloc(a)
-   {}
-
-   node_alloc_holder(const intrusive_bucket_traits& bt, const ValAlloc& a)
-      : NodeAlloc(a)
-      , m_icont(bt)
-   {}
-
-   //Constructors for associative containers
-   node_alloc_holder(const intrusive_key_compare &c, const ValAlloc &a)
-      : NodeAlloc(a), m_icont(c)
-   {}
-
-   node_alloc_holder(const intrusive_bucket_traits & bt, const val_hasher &hf, const val_equal &eql, const ValAlloc &a)
-      : NodeAlloc(a)
-      , m_icont(bt
-         , typename ICont::hasher(hf)
-         , typename ICont::key_equal(eql))
-   {}
-
-   node_alloc_holder(const intrusive_bucket_traits& bt, const val_hasher &hf, const ValAlloc &a)
-      : NodeAlloc(a)
-      , m_icont(bt
-         , typename ICont::hasher(hf)
-         , typename ICont::key_equal())
-   {}
-
-   node_alloc_holder(const intrusive_bucket_traits& bt, const val_hasher &hf)
-      : m_icont(bt
-         , typename ICont::hasher(hf)
-         , typename ICont::key_equal())
-   {}
-
-   explicit node_alloc_holder(const node_alloc_holder &x)
-      : NodeAlloc(NodeAllocTraits::select_on_container_copy_construction(x.node_alloc()))
-   {}
-
-   node_alloc_holder(const node_alloc_holder &x, const intrusive_key_compare &c)
-      : NodeAlloc(NodeAllocTraits::select_on_container_copy_construction(x.node_alloc()))
-      , m_icont(c)
-   {}
-
-   node_alloc_holder(const node_alloc_holder &x, const intrusive_bucket_traits& bt, const val_hasher &hf, const val_equal &eql)
-      : NodeAlloc(NodeAllocTraits::select_on_container_copy_construction(x.node_alloc()))
-      , m_icont( bt
-               , typename ICont::hasher(hf)
-               , typename ICont::key_equal(eql))
-   {}
-
-   node_alloc_holder(const val_hasher &hf, const intrusive_bucket_traits& bt, const val_equal &eql)
-      : m_icont(bt
-         , typename ICont::hasher(hf)
-         , typename ICont::key_equal(eql))
-   {}
-
-   explicit node_alloc_holder(BOOST_RV_REF(node_alloc_holder) x)
-      : NodeAlloc(boost::move(BOOST_MOVE_TO_LV(x).node_alloc()))
-   {  this->icont().swap(x.icont());  }
-
-   explicit node_alloc_holder(const intrusive_key_compare &c)
-      : m_icont(c)
-   {}
-
-   //helpers for move assignments
-   explicit node_alloc_holder(BOOST_RV_REF(node_alloc_holder) x, const intrusive_key_compare &c)
-      : NodeAlloc(boost::move(BOOST_MOVE_TO_LV(x).node_alloc())), m_icont(c)
-   {  this->icont().swap(x.icont());  }
-
-   explicit node_alloc_holder(BOOST_RV_REF(node_alloc_holder) x, const intrusive_bucket_traits& bt, const val_hasher &hf, const val_equal &eql)
-      : NodeAlloc(boost::move(BOOST_MOVE_TO_LV(x).node_alloc()))
-      , m_icont( bt
-               , typename ICont::hasher(hf)
-               , typename ICont::key_equal(eql))
-   {  this->icont().swap(BOOST_MOVE_TO_LV(x).icont());   }
-
-   BOOST_CONTAINER_FORCEINLINE void copy_assign_alloc(const node_alloc_holder &x)
-   {
-      dtl::bool_<allocator_traits_type::propagate_on_container_copy_assignment::value> flag;
-      dtl::assign_alloc( static_cast<NodeAlloc &>(*this)
-                       , static_cast<const NodeAlloc &>(x), flag);
-   }
-
-   BOOST_CONTAINER_FORCEINLINE void move_assign_alloc( node_alloc_holder &x)
-   {
-      dtl::bool_<allocator_traits_type::propagate_on_container_move_assignment::value> flag;
-      dtl::move_alloc( static_cast<NodeAlloc &>(*this)
-                     , static_cast<NodeAlloc &>(x), flag);
-   }
-
-   BOOST_CONTAINER_FORCEINLINE ~node_alloc_holder()
-   {  this->clear(alloc_version()); }
-
-   BOOST_CONTAINER_FORCEINLINE size_type max_size() const
-   {  return allocator_traits_type::max_size(this->node_alloc());  }
-
-   BOOST_CONTAINER_FORCEINLINE NodePtr allocate_one()
-   {  return AllocVersionTraits::allocate_one(this->node_alloc());   }
-
-   BOOST_CONTAINER_FORCEINLINE void deallocate_one(const NodePtr &p)
-   {  AllocVersionTraits::deallocate_one(this->node_alloc(), p);  }
-
-   #if !defined(BOOST_NO_CXX11_VARIADIC_TEMPLATES)
-
-   template<class ...Args>
-   NodePtr create_node(Args &&...args)
-   {
-      NodePtr p = this->allocate_one();
-      NodeAlloc &nalloc = this->node_alloc();
-      Deallocator node_deallocator(p, nalloc);
-      ::new(boost::movelib::iterator_to_raw_pointer(p), boost_container_new_t())
-         Node(nalloc, boost::forward<Args>(args)...);
-      node_deallocator.release();
-      return (p);
-   }
-
-   #else //defined(BOOST_NO_CXX11_VARIADIC_TEMPLATES)
-
-   #define BOOST_CONTAINER_NODE_ALLOC_HOLDER_CONSTRUCT_IMPL(N) \
-   BOOST_MOVE_TMPL_LT##N BOOST_MOVE_CLASS##N BOOST_MOVE_GT##N \
-   NodePtr create_node(BOOST_MOVE_UREF##N)\
-   {\
-      NodePtr p = this->allocate_one();\
-      NodeAlloc &nalloc = this->node_alloc();\
-      Deallocator node_deallocator(p, nalloc);\
-      ::new(boost::movelib::iterator_to_raw_pointer(p), boost_container_new_t())\
-         Node(nalloc BOOST_MOVE_I##N BOOST_MOVE_FWD##N);\
-      node_deallocator.release();\
-      return (p);\
-   }\
-   //
-   BOOST_MOVE_ITERATE_0TO9(BOOST_CONTAINER_NODE_ALLOC_HOLDER_CONSTRUCT_IMPL)
-   #undef BOOST_CONTAINER_NODE_ALLOC_HOLDER_CONSTRUCT_IMPL
-
-   #endif   // !defined(BOOST_NO_CXX11_VARIADIC_TEMPLATES)
-
-   template<class It>
-   NodePtr create_node_from_it(const It &it)
-   {
-      NodePtr p = this->allocate_one();
-      NodeAlloc &nalloc = this->node_alloc();
-      Deallocator node_deallocator(p, nalloc);
-      ::new(boost::movelib::iterator_to_raw_pointer(p), boost_container_new_t())
-         Node(iterator_arg_t(), nalloc, it);
-      node_deallocator.release();
-      return (p);
-   }
-
-   template<class KeyConvertible>
-   NodePtr create_node_from_key(BOOST_FWD_REF(KeyConvertible) key)
-   {
-      NodePtr p = this->allocate_one();
-      BOOST_CONTAINER_TRY{
-         ::new(boost::movelib::iterator_to_raw_pointer(p), boost_container_new_t()) Node;
-         NodeAlloc &na = this->node_alloc();
-         node_allocator_traits_type::construct
-            (na, dtl::addressof(p->get_real_data().first), boost::forward<KeyConvertible>(key));
-         BOOST_CONTAINER_TRY{
-            node_allocator_traits_type::construct(na, dtl::addressof(p->get_real_data().second));
-         }
-         BOOST_CONTAINER_CATCH(...){
-            node_allocator_traits_type::destroy(na, dtl::addressof(p->get_real_data().first));
-            BOOST_CONTAINER_RETHROW;
-         }
-         BOOST_CONTAINER_CATCH_END
-      }
-      BOOST_CONTAINER_CATCH(...) {
-         p->destroy_header();
-         this->node_alloc().deallocate(p, 1);
-         BOOST_CONTAINER_RETHROW
-      }
-      BOOST_CONTAINER_CATCH_END
-      return (p);
-   }
-
-   void destroy_node(const NodePtr &nodep)
-   {
-      boost::movelib::to_raw_pointer(nodep)->destructor(this->node_alloc());
-      this->deallocate_one(nodep);
-   }
-
-   void swap(node_alloc_holder &x)
-   {
-      this->icont().swap(x.icont());
-      dtl::bool_<allocator_traits_type::propagate_on_container_swap::value> flag;
-      dtl::swap_alloc(this->node_alloc(), x.node_alloc(), flag);
-   }
-
-   template<class FwdIterator, class Inserter>
-   void allocate_many_and_construct
-      (FwdIterator beg, size_type n, Inserter inserter)
-   {
-      if(n){
-         typedef typename node_allocator_version_traits_type::multiallocation_chain multiallocation_chain_t;
-
-         //Try to allocate memory in a single block
-         typedef typename multiallocation_chain_t::iterator multialloc_iterator_t;
-         multiallocation_chain_t chain;
-         NodeAlloc &nalloc = this->node_alloc();
-         node_allocator_version_traits_type::allocate_individual(nalloc, n, chain);
-         multialloc_iterator_t itbeg  = chain.begin();
-         multialloc_iterator_t itlast = chain.last();
-         chain.clear();
-
-         Node *p = 0;
-            BOOST_CONTAINER_TRY{
-            Deallocator node_deallocator(NodePtr(), nalloc);
-            dtl::scoped_node_destructor<NodeAlloc> sdestructor(nalloc, 0);
-            while(n){
-               --n;
-               p = boost::movelib::iterator_to_raw_pointer(itbeg);
-               ++itbeg; //Increment iterator before overwriting pointed memory
-               //This does not throw
-               ::new(boost::movelib::iterator_to_raw_pointer(p), boost_container_new_t())
-                  Node(iterator_arg_t(), nalloc, beg);
-               sdestructor.set(p);
-               ++beg;
-               //This can throw in some containers (predicate might throw).
-               //(sdestructor will destruct the node and node_deallocator will deallocate it in case of exception)
-               inserter(*p);
-               sdestructor.release();
-            }
-            sdestructor.release();
-            node_deallocator.release();
-         }
-         BOOST_CONTAINER_CATCH(...){
-            chain.incorporate_after(chain.last(), &*itbeg, &*itlast, n);
-            node_allocator_version_traits_type::deallocate_individual(this->node_alloc(), chain);
-            BOOST_CONTAINER_RETHROW
-         }
-         BOOST_CONTAINER_CATCH_END
-      }
-   }
-
-   BOOST_CONTAINER_FORCEINLINE void clear(version_1)
-   {  this->icont().clear_and_dispose(Destroyer(this->node_alloc()));   }
-
-   void clear(version_2)
-   {
-      typename NodeAlloc::multiallocation_chain chain;
-      allocator_node_destroyer_and_chain_builder<NodeAlloc> builder(this->node_alloc(), chain);
-      this->icont().clear_and_dispose(builder);
-      //BOOST_STATIC_ASSERT((::boost::has_move_emulation_enabled<typename NodeAlloc::multiallocation_chain>::value == true));
-      if(!chain.empty())
-         this->node_alloc().deallocate_individual(chain);
-   }
-
-   icont_iterator erase_range(const icont_iterator &first, const icont_iterator &last, version_1)
-   {  return this->icont().erase_and_dispose(first, last, Destroyer(this->node_alloc())); }
-
-   icont_iterator erase_range(const icont_iterator &first, const icont_iterator &last, version_2)
-   {
-      NodeAlloc & nalloc = this->node_alloc();
-      typename NodeAlloc::multiallocation_chain chain;
-      allocator_node_destroyer_and_chain_builder<NodeAlloc> chain_builder(nalloc, chain);
-      icont_iterator ret_it = this->icont().erase_and_dispose(first, last, chain_builder);
-      nalloc.deallocate_individual(chain);
-      return ret_it;
-   }
-
-   template<class Key>
-   BOOST_CONTAINER_FORCEINLINE size_type erase_key(const Key& k, version_1)
-   {  return this->icont().erase_and_dispose(k, Destroyer(this->node_alloc())); }
-
-   template<class Key>
-   BOOST_CONTAINER_FORCEINLINE size_type erase_key(const Key& k, version_2)
-   {
-      allocator_multialloc_chain_node_deallocator<NodeAlloc> chain_holder(this->node_alloc());
-      return this->icont().erase_and_dispose(k, chain_holder.get_chain_builder());
-   }
-
-   protected:
-   struct cloner
-   {
-      BOOST_CONTAINER_FORCEINLINE explicit cloner(node_alloc_holder &holder)
-         :  m_holder(holder)
-      {}
-
-      BOOST_CONTAINER_FORCEINLINE NodePtr operator()(const Node &other) const
-      {  return m_holder.create_node(other.get_real_data());  }
-
-      node_alloc_holder &m_holder;
-   };
-
-   struct move_cloner
-   {
-      BOOST_CONTAINER_FORCEINLINE move_cloner(node_alloc_holder &holder)
-         :  m_holder(holder)
-      {}
-
-      BOOST_CONTAINER_FORCEINLINE NodePtr operator()(Node &other)
-      {  //Use get_real_data() instead of get_real_data to allow moving const key in [multi]map
-         return m_holder.create_node(::boost::move(other.get_real_data()));
-      }
-
-      node_alloc_holder &m_holder;
-   };
-
-   BOOST_CONTAINER_FORCEINLINE ICont &non_const_icont() const
-   {  return const_cast<ICont&>(this->m_icont);   }
-
-   BOOST_CONTAINER_FORCEINLINE NodeAlloc &node_alloc()
-   {  return static_cast<NodeAlloc &>(*this);   }
-
-   BOOST_CONTAINER_FORCEINLINE const NodeAlloc &node_alloc() const
-   {  return static_cast<const NodeAlloc &>(*this);   }
-
-   public:
-   BOOST_CONTAINER_FORCEINLINE ICont &icont()
-   {  return this->m_icont;   }
-
-   BOOST_CONTAINER_FORCEINLINE const ICont &icont() const
-   {  return this->m_icont;   }
-
-   protected:
-   //The intrusive container
-   ICont m_icont;
-};
-
-template<class Node, class KeyOfValue>
-struct key_of_node : KeyOfValue
-{
-   typedef typename KeyOfValue::type type;
-
-   BOOST_CONTAINER_FORCEINLINE key_of_node()
-   {}
-
-   BOOST_CONTAINER_FORCEINLINE const type& operator()(const Node& x) const
-   {  return this->KeyOfValue::operator()(x.get_data());  }
-};
-
-
-}  //namespace dtl {
-}  //namespace container {
-}  //namespace boost {
-
-#include <boost/container/detail/config_end.hpp>
-
-#endif // BOOST_CONTAINER_DETAIL_NODE_ALLOC_HPP_
diff --git a/src/boost/container/detail/pair.hpp b/src/boost/container/detail/pair.hpp
deleted file mode 100644
index 56b2fb83..00000000
--- a/src/boost/container/detail/pair.hpp
+++ /dev/null
@@ -1,607 +0,0 @@
-//////////////////////////////////////////////////////////////////////////////
-//
-// (C) Copyright Ion Gaztanaga 2005-2013.
-//
-// Distributed under the Boost 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.
-//
-//////////////////////////////////////////////////////////////////////////////
-
-#ifndef BOOST_CONTAINER_CONTAINER_DETAIL_PAIR_HPP
-#define BOOST_CONTAINER_CONTAINER_DETAIL_PAIR_HPP
-
-#ifndef BOOST_CONFIG_HPP
-#  include <boost/config.hpp>
-#endif
-
-#if defined(BOOST_HAS_PRAGMA_ONCE)
-#  pragma once
-#endif
-
-#include <boost/container/detail/config_begin.hpp>
-#include <boost/container/container_fwd.hpp>
-#include <boost/container/detail/workaround.hpp>
-
-#include <boost/static_assert.hpp>
-#include <boost/container/detail/mpl.hpp>
-#include <boost/container/detail/type_traits.hpp>
-#include <boost/container/detail/mpl.hpp>
-#include <boost/container/detail/std_fwd.hpp>
-#include <boost/container/detail/is_pair.hpp>
-#if !defined(BOOST_NO_CXX11_VARIADIC_TEMPLATES)
-#  include <boost/container/detail/variadic_templates_tools.hpp>
-#endif
-#include <boost/move/adl_move_swap.hpp> //swap
-
-#include <boost/intrusive/detail/minimal_pair_header.hpp>      //pair
-#include <boost/move/utility_core.hpp>
-#include <boost/move/detail/fwd_macros.hpp>
-
-namespace boost {
-namespace container {
-namespace pair_impl {
-
-template <class TupleClass>
-struct is_boost_tuple
-{
-   static const bool value = false;
-};
-
-template <
-  class T0, class T1, class T2,
-  class T3, class T4, class T5,
-  class T6, class T7, class T8,
-  class T9>
-struct is_boost_tuple< boost::tuples::tuple<T0, T1, T2, T3, T4, T5, T6, T7, T8, T9> >
-{
-   static const bool value = true;
-};
-
-template<class Tuple>
-struct disable_if_boost_tuple
-   : boost::container::dtl::disable_if< is_boost_tuple<Tuple> >
-{};
-
-template<class T>
-struct is_tuple_null
-{
-   static const bool value = false;
-};
-
-template<>
-struct is_tuple_null<boost::tuples::null_type>
-{
-   static const bool value = true;
-};
-
-}  //namespace detail {
-
-#ifndef BOOST_CONTAINER_DOXYGEN_INVOKED
-
-   template <int Dummy = 0>
-   struct std_piecewise_construct_holder
-   {
-      static ::std::piecewise_construct_t *dummy;
-   };
-
-   template <int Dummy>
-   ::std::piecewise_construct_t *std_piecewise_construct_holder<Dummy>::dummy =
-      reinterpret_cast< ::std::piecewise_construct_t *>(0x01234);  //Avoid sanitizer errors on references to null pointers
-
-#else
-
-//! The piecewise_construct_t struct is an empty structure type used as a unique type to
-//! disambiguate used to disambiguate between different functions that take two tuple arguments.
-typedef unspecified piecewise_construct_t;
-
-#endif   //#ifndef BOOST_CONTAINER_DOXYGEN_INVOKED
-
-//! A instance of type
-//! piecewise_construct_t
-static piecewise_construct_t piecewise_construct = BOOST_CONTAINER_DOC1ST(unspecified, *std_piecewise_construct_holder<>::dummy);
-
-///@cond
-
-namespace dtl {
-
-struct piecewise_construct_use
-{
-   //Avoid warnings of unused "piecewise_construct"
-   piecewise_construct_use()
-   {  (void)&::boost::container::piecewise_construct;   }
-};
-
-struct pair_nat;
-
-template<typename T, typename U, typename V>
-void get(T); //to enable ADL
-
-///@endcond
-
-#ifdef  _LIBCPP_DEPRECATED_ABI_DISABLE_PAIR_TRIVIAL_COPY_CTOR
-//Libc++, in some versions, has an ABI breakage that needs some
-//padding in dtl::pair, as "std::pair::first" is not at offset zero.
-//See: https://reviews.llvm.org/D56357 for more information.
-//
-template <class T1, class T2, std::size_t N>
-struct pair_padding
-{
-   char padding[N];
-};
-
-template <class T1, class T2>
-struct pair_padding<T1, T2, 0>
-{
-};
-
-template <class T1, class T2>
-struct simple_pair
-{
-   T1 first;
-   T2 second;
-};
-
-#endif
-
-template <class T1, class T2>
-struct pair
-#ifdef  _LIBCPP_DEPRECATED_ABI_DISABLE_PAIR_TRIVIAL_COPY_CTOR
-   : pair_padding<T1, T2, sizeof(std::pair<T1, T2>) - sizeof(simple_pair<T1, T2>)>
-#endif
-{
-   private:
-   BOOST_COPYABLE_AND_MOVABLE(pair)
-
-   public:
-   typedef T1 first_type;
-   typedef T2 second_type;
-
-   T1 first;
-   T2 second;
-
-   //Default constructor
-   pair()
-      : first(), second()
-   {
-      BOOST_STATIC_ASSERT((sizeof(std::pair<T1, T2>) == sizeof(pair<T1, T2>)));
-   }
-
-   //pair copy assignment
-   pair(const pair& x)
-      : first(x.first), second(x.second)
-   {
-      BOOST_STATIC_ASSERT((sizeof(std::pair<T1, T2>) == sizeof(pair<T1, T2>)));
-   }
-
-   //pair move constructor
-   pair(BOOST_RV_REF(pair) p)
-      : first(::boost::move(BOOST_MOVE_TO_LV(p).first)), second(::boost::move(BOOST_MOVE_TO_LV(p).second))
-   {
-      BOOST_STATIC_ASSERT((sizeof(std::pair<T1, T2>) == sizeof(pair<T1, T2>)));
-   }
-
-   template <class D, class S>
-   pair(const pair<D, S> &p)
-      : first(p.first), second(p.second)
-   {
-      BOOST_STATIC_ASSERT((sizeof(std::pair<T1, T2>) == sizeof(pair<T1, T2>)));
-   }
-
-   template <class D, class S>
-   pair(BOOST_RV_REF_BEG pair<D, S> BOOST_RV_REF_END p)
-      : first(::boost::move(BOOST_MOVE_TO_LV(p).first)), second(::boost::move(BOOST_MOVE_TO_LV(p).second))
-   {
-      BOOST_STATIC_ASSERT((sizeof(std::pair<T1, T2>) == sizeof(pair<T1, T2>)));
-   }
-
-   //pair from two values
-   pair(const T1 &t1, const T2 &t2)
-      : first(t1)
-      , second(t2)
-   {
-      BOOST_STATIC_ASSERT((sizeof(std::pair<T1, T2>) == sizeof(pair<T1, T2>)));
-   }
-
-   template<class U, class V>
-   pair(BOOST_FWD_REF(U) u, BOOST_FWD_REF(V) v)
-      : first(::boost::forward<U>(u))
-      , second(::boost::forward<V>(v))
-   {
-      BOOST_STATIC_ASSERT((sizeof(std::pair<T1, T2>) == sizeof(pair<T1, T2>)));
-   }
-
-   //And now compatibility with std::pair
-   pair(const std::pair<T1, T2>& x)
-      : first(x.first), second(x.second)
-   {
-      BOOST_STATIC_ASSERT((sizeof(std::pair<T1, T2>) == sizeof(pair<T1, T2>)));
-   }
-
-   template <class D, class S>
-   pair(const std::pair<D, S>& p)
-      : first(p.first), second(p.second)
-   {
-      BOOST_STATIC_ASSERT((sizeof(std::pair<T1, T2>) == sizeof(pair<T1, T2>)));
-   }
-
-   pair(BOOST_RV_REF_BEG std::pair<T1, T2> BOOST_RV_REF_END p)
-      : first(::boost::move(BOOST_MOVE_TO_LV(p).first)), second(::boost::move(BOOST_MOVE_TO_LV(p).second))
-   {
-      BOOST_STATIC_ASSERT((sizeof(std::pair<T1, T2>) == sizeof(pair<T1, T2>)));
-   }
-
-   template <class D, class S>
-   pair(BOOST_RV_REF_BEG std::pair<D, S> BOOST_RV_REF_END p)
-      : first(::boost::move(BOOST_MOVE_TO_LV(p).first)), second(::boost::move(BOOST_MOVE_TO_LV(p).second))
-   {
-      BOOST_STATIC_ASSERT((sizeof(std::pair<T1, T2>) == sizeof(pair<T1, T2>)));
-   }
-
-   #if !defined(BOOST_NO_CXX11_VARIADIC_TEMPLATES)
-   template< class KeyType, class ...Args>
-   pair(try_emplace_t, BOOST_FWD_REF(KeyType) k, Args && ...args)
-      : first(boost::forward<KeyType>(k)), second(::boost::forward<Args>(args)...)\
-   {
-      BOOST_STATIC_ASSERT((sizeof(std::pair<T1, T2>) == sizeof(pair<T1, T2>)));
-   }
-   #else
-
-   //piecewise construction from boost::tuple
-   #define BOOST_PAIR_TRY_EMPLACE_CONSTRUCT_CODE(N)\
-   template< class KeyType BOOST_MOVE_I##N BOOST_MOVE_CLASS##N > \
-   pair( try_emplace_t, BOOST_FWD_REF(KeyType) k BOOST_MOVE_I##N BOOST_MOVE_UREF##N )\
-      : first(boost::forward<KeyType>(k)), second(BOOST_MOVE_FWD##N)\
-   {\
-      BOOST_STATIC_ASSERT((sizeof(std::pair<T1, T2>) == sizeof(pair<T1, T2>)));\
-   }\
-   //
-   BOOST_MOVE_ITERATE_0TO9(BOOST_PAIR_TRY_EMPLACE_CONSTRUCT_CODE)
-   #undef BOOST_PAIR_TRY_EMPLACE_CONSTRUCT_CODE
-
-   #endif   //BOOST_NO_CXX11_VARIADIC_TEMPLATES
-
-   //piecewise construction from boost::tuple
-   #define BOOST_PAIR_PIECEWISE_CONSTRUCT_BOOST_TUPLE_CODE(N,M)\
-   template< template<class, class, class, class, class, class, class, class, class, class> class BoostTuple \
-            BOOST_MOVE_I_IF(BOOST_MOVE_OR(N,M)) BOOST_MOVE_CLASS##N BOOST_MOVE_I_IF(BOOST_MOVE_AND(N,M)) BOOST_MOVE_CLASSQ##M > \
-   pair( piecewise_construct_t\
-       , BoostTuple<BOOST_MOVE_TARG##N  BOOST_MOVE_I##N BOOST_MOVE_REPEAT(BOOST_MOVE_SUB(10,N),::boost::tuples::null_type)> p\
-       , BoostTuple<BOOST_MOVE_TARGQ##M BOOST_MOVE_I##M BOOST_MOVE_REPEAT(BOOST_MOVE_SUB(10,M),::boost::tuples::null_type)> q\
-       , typename dtl::enable_if_c\
-         < pair_impl::is_boost_tuple< BoostTuple<BOOST_MOVE_TARG##N  BOOST_MOVE_I##N BOOST_MOVE_REPEAT(BOOST_MOVE_SUB(10,N),::boost::tuples::null_type)> >::value &&\
-           !(pair_impl::is_tuple_null<BOOST_MOVE_LAST_TARG##N>::value || pair_impl::is_tuple_null<BOOST_MOVE_LAST_TARGQ##M>::value) \
-         >::type* = 0\
-       )\
-      : first(BOOST_MOVE_TMPL_GET##N), second(BOOST_MOVE_TMPL_GETQ##M)\
-   { (void)p; (void)q;\
-      BOOST_STATIC_ASSERT((sizeof(std::pair<T1, T2>) == sizeof(pair<T1, T2>)));\
-   }\
-   //
-   BOOST_MOVE_ITER2D_0TOMAX(9, BOOST_PAIR_PIECEWISE_CONSTRUCT_BOOST_TUPLE_CODE)
-   #undef BOOST_PAIR_PIECEWISE_CONSTRUCT_BOOST_TUPLE_CODE
-
-   //piecewise construction from variadic tuple (with delegating constructors)
-   #if !defined(BOOST_NO_CXX11_VARIADIC_TEMPLATES)
-   #  if !defined(BOOST_CONTAINER_NO_CXX11_DELEGATING_CONSTRUCTORS)
-      private:
-      template<template<class ...> class Tuple, class... Args1, class... Args2, size_t... Indexes1, size_t... Indexes2>
-      pair(Tuple<Args1...>& t1, Tuple<Args2...>& t2, index_tuple<Indexes1...>, index_tuple<Indexes2...>)
-         : first (::boost::forward<Args1>(get<Indexes1>(t1))...)
-         , second(::boost::forward<Args2>(get<Indexes2>(t2))...)
-      {  (void) t1; (void)t2; }
-
-      public:
-      template< template<class ...> class Tuple, class... Args1, class... Args2
-              , class = typename pair_impl::disable_if_boost_tuple< Tuple<Args1...> >::type>
-      pair(piecewise_construct_t, Tuple<Args1...> t1, Tuple<Args2...> t2)
-         : pair(t1, t2, typename build_number_seq<sizeof...(Args1)>::type(), typename build_number_seq<sizeof...(Args2)>::type())
-      {
-         BOOST_STATIC_ASSERT((sizeof(std::pair<T1, T2>) == sizeof(pair<T1, T2>)));
-      }
-   #  else
-      //piecewise construction from variadic tuple (suboptimal, without delegating constructors)
-      private:
-      template<typename T, template<class ...> class Tuple, typename... Args>
-      static T build_from_args(Tuple<Args...>&& t)
-      {  return do_build_from_args<T>(::boost::move(t), typename build_number_seq<sizeof...(Args)>::type());   }
-
-      template<typename T, template<class ...> class Tuple, typename... Args, std::size_t... Indexes>
-      static T do_build_from_args(Tuple<Args...> && t, const index_tuple<Indexes...>&)
-      {  (void)t; return T(::boost::forward<Args>(get<Indexes>(t))...);  }
-
-      public:
-      template< template<class ...> class Tuple, class... Args1, class... Args2
-              , class = typename pair_impl::disable_if_boost_tuple< Tuple<Args1...> >::type>
-      pair(piecewise_construct_t, Tuple<Args1...> t1, Tuple<Args2...> t2)
-         : first  (build_from_args<first_type> (::boost::move(t1)))
-         , second (build_from_args<second_type>(::boost::move(t2)))
-      {
-         BOOST_STATIC_ASSERT((sizeof(std::pair<T1, T2>) == sizeof(pair<T1, T2>)));
-      }
-   #  endif   //BOOST_NO_CXX11_VARIADIC_TEMPLATES
-   #elif defined(BOOST_MSVC) && (_CPPLIB_VER == 520)
-      //MSVC 2010 tuple implementation
-      #define BOOST_PAIR_PIECEWISE_CONSTRUCT_MSVC2010_TUPLE_CODE(N,M)\
-      template< template<class, class, class, class, class, class, class, class, class, class> class StdTuple \
-               BOOST_MOVE_I_IF(BOOST_MOVE_OR(N,M)) BOOST_MOVE_CLASS##N BOOST_MOVE_I_IF(BOOST_MOVE_AND(N,M)) BOOST_MOVE_CLASSQ##M > \
-      pair( piecewise_construct_t\
-          , StdTuple<BOOST_MOVE_TARG##N  BOOST_MOVE_I##N BOOST_MOVE_REPEAT(BOOST_MOVE_SUB(10,N),::std::tr1::_Nil)> p\
-          , StdTuple<BOOST_MOVE_TARGQ##M BOOST_MOVE_I##M BOOST_MOVE_REPEAT(BOOST_MOVE_SUB(10,M),::std::tr1::_Nil)> q)\
-         : first(BOOST_MOVE_GET_IDX##N), second(BOOST_MOVE_GET_IDXQ##M)\
-      { (void)p; (void)q;\
-         BOOST_STATIC_ASSERT((sizeof(std::pair<T1, T2>) == sizeof(pair<T1, T2>)));\
-      }\
-      //
-      BOOST_MOVE_ITER2D_0TOMAX(9, BOOST_PAIR_PIECEWISE_CONSTRUCT_MSVC2010_TUPLE_CODE)
-      #undef BOOST_PAIR_PIECEWISE_CONSTRUCT_MSVC2010_TUPLE_CODE
-   #elif defined(BOOST_MSVC) && (_CPPLIB_VER == 540)
-      #if _VARIADIC_MAX >= 9
-      #define BOOST_PAIR_PIECEWISE_CONSTRUCT_MSVC2012_TUPLE_MAX_IT 9
-      #else
-      #define BOOST_PAIR_PIECEWISE_CONSTRUCT_MSVC2012_TUPLE_MAX_IT BOOST_MOVE_ADD(_VARIADIC_MAX, 1)
-      #endif
-
-      //MSVC 2012 tuple implementation
-      #define BOOST_PAIR_PIECEWISE_CONSTRUCT_MSVC2012_TUPLE_CODE(N,M)\
-      template< template<BOOST_MOVE_REPEAT(_VARIADIC_MAX, class), class, class, class> class StdTuple \
-               BOOST_MOVE_I_IF(BOOST_MOVE_OR(N,M)) BOOST_MOVE_CLASS##N BOOST_MOVE_I_IF(BOOST_MOVE_AND(N,M)) BOOST_MOVE_CLASSQ##M > \
-      pair( piecewise_construct_t\
-          , StdTuple<BOOST_MOVE_TARG##N  BOOST_MOVE_I##N BOOST_MOVE_REPEAT(BOOST_MOVE_SUB(BOOST_MOVE_ADD(_VARIADIC_MAX, 3),N),::std::_Nil) > p\
-          , StdTuple<BOOST_MOVE_TARGQ##M BOOST_MOVE_I##M BOOST_MOVE_REPEAT(BOOST_MOVE_SUB(BOOST_MOVE_ADD(_VARIADIC_MAX, 3),M),::std::_Nil) > q)\
-         : first(BOOST_MOVE_GET_IDX##N), second(BOOST_MOVE_GET_IDXQ##M)\
-      { (void)p; (void)q;\
-         BOOST_STATIC_ASSERT((sizeof(std::pair<T1, T2>) == sizeof(pair<T1, T2>)));\
-      }\
-      //
-      BOOST_MOVE_ITER2D_0TOMAX(BOOST_PAIR_PIECEWISE_CONSTRUCT_MSVC2012_TUPLE_MAX_IT, BOOST_PAIR_PIECEWISE_CONSTRUCT_MSVC2012_TUPLE_CODE)
-      #undef BOOST_PAIR_PIECEWISE_CONSTRUCT_MSVC2010_TUPLE_CODE
-      #undef BOOST_PAIR_PIECEWISE_CONSTRUCT_MSVC2012_TUPLE_MAX_IT
-   #endif
-
-   //pair copy assignment
-   pair& operator=(BOOST_COPY_ASSIGN_REF(pair) p)
-   {
-      first  = p.first;
-      second = p.second;
-      return *this;
-   }
-
-   //pair move assignment
-   pair& operator=(BOOST_RV_REF(pair) p)
-   {
-      first  = ::boost::move(BOOST_MOVE_TO_LV(p).first);
-      second = ::boost::move(BOOST_MOVE_TO_LV(p).second);
-      return *this;
-   }
-
-   template <class D, class S>
-   typename ::boost::container::dtl::disable_if_or
-      < pair &
-      , ::boost::container::dtl::is_same<T1, D>
-      , ::boost::container::dtl::is_same<T2, S>
-      >::type
-      operator=(const pair<D, S>&p)
-   {
-      first  = p.first;
-      second = p.second;
-      return *this;
-   }
-
-   template <class D, class S>
-   typename ::boost::container::dtl::disable_if_or
-      < pair &
-      , ::boost::container::dtl::is_same<T1, D>
-      , ::boost::container::dtl::is_same<T2, S>
-      >::type
-      operator=(BOOST_RV_REF_BEG pair<D, S> BOOST_RV_REF_END p)
-   {
-      first  = ::boost::move(BOOST_MOVE_TO_LV(p).first);
-      second = ::boost::move(BOOST_MOVE_TO_LV(p).second);
-      return *this;
-   }
-//std::pair copy assignment
-   pair& operator=(const std::pair<T1, T2> &p)
-   {
-      first  = p.first;
-      second = p.second;
-      return *this;
-   }
-
-   template <class D, class S>
-   pair& operator=(const std::pair<D, S> &p)
-   {
-      first  = ::boost::move(p.first);
-      second = ::boost::move(p.second);
-      return *this;
-   }
-
-   //std::pair move assignment
-   pair& operator=(BOOST_RV_REF_BEG std::pair<T1, T2> BOOST_RV_REF_END p)
-   {
-      first  = ::boost::move(BOOST_MOVE_TO_LV(p).first);
-      second = ::boost::move(BOOST_MOVE_TO_LV(p).second);
-      return *this;
-   }
-
-   template <class D, class S>
-   pair& operator=(BOOST_RV_REF_BEG std::pair<D, S> BOOST_RV_REF_END p)
-   {
-      first  = ::boost::move(BOOST_MOVE_TO_LV(p).first);
-      second = ::boost::move(BOOST_MOVE_TO_LV(p).second);
-      return *this;
-   }
-
-   //swap
-   void swap(pair& p)
-   {
-      ::boost::adl_move_swap(this->first, p.first);
-      ::boost::adl_move_swap(this->second, p.second);
-   }
-};
-
-template <class T1, class T2>
-inline bool operator==(const pair<T1,T2>& x, const pair<T1,T2>& y)
-{  return static_cast<bool>(x.first == y.first && x.second == y.second);  }
-
-template <class T1, class T2>
-inline bool operator< (const pair<T1,T2>& x, const pair<T1,T2>& y)
-{  return static_cast<bool>(x.first < y.first ||
-                         (!(y.first < x.first) && x.second < y.second)); }
-
-template <class T1, class T2>
-inline bool operator!=(const pair<T1,T2>& x, const pair<T1,T2>& y)
-{  return static_cast<bool>(!(x == y));  }
-
-template <class T1, class T2>
-inline bool operator> (const pair<T1,T2>& x, const pair<T1,T2>& y)
-{  return y < x;  }
-
-template <class T1, class T2>
-inline bool operator>=(const pair<T1,T2>& x, const pair<T1,T2>& y)
-{  return static_cast<bool>(!(x < y)); }
-
-template <class T1, class T2>
-inline bool operator<=(const pair<T1,T2>& x, const pair<T1,T2>& y)
-{  return static_cast<bool>(!(y < x)); }
-
-template <class T1, class T2>
-inline pair<T1, T2> make_pair(T1 x, T2 y)
-{  return pair<T1, T2>(x, y); }
-
-template <class T1, class T2>
-inline void swap(pair<T1, T2>& x, pair<T1, T2>& y)
-{  x.swap(y);  }
-
-}  //namespace dtl {
-}  //namespace container {
-
-#ifdef BOOST_NO_CXX11_RVALUE_REFERENCES
-
-template<class T1, class T2>
-struct has_move_emulation_enabled< ::boost::container::dtl::pair<T1, T2> >
-{
-   static const bool value = true;
-};
-
-#endif
-
-namespace move_detail{
-
-template<class T>
-struct is_class_or_union;
-
-template <class T1, class T2>
-struct is_class_or_union< ::boost::container::dtl::pair<T1, T2> >
-//This specialization is needed to avoid instantiation of pair in
-//is_class, and allow recursive maps.
-{
-   static const bool value = true;
-};
-
-template <class T1, class T2>
-struct is_class_or_union< std::pair<T1, T2> >
-//This specialization is needed to avoid instantiation of pair in
-//is_class, and allow recursive maps.
-{
-   static const bool value = true;
-};
-
-template<class T>
-struct is_union;
-
-template <class T1, class T2>
-struct is_union< ::boost::container::dtl::pair<T1, T2> >
-//This specialization is needed to avoid instantiation of pair in
-//is_class, and allow recursive maps.
-{
-   static const bool value = false;
-};
-
-template <class T1, class T2>
-struct is_union< std::pair<T1, T2> >
-//This specialization is needed to avoid instantiation of pair in
-//is_class, and allow recursive maps.
-{
-   static const bool value = false;
-};
-
-template<class T>
-struct is_class;
-
-template <class T1, class T2>
-struct is_class< ::boost::container::dtl::pair<T1, T2> >
-//This specialization is needed to avoid instantiation of pair in
-//is_class, and allow recursive maps.
-{
-   static const bool value = true;
-};
-
-template <class T1, class T2>
-struct is_class< std::pair<T1, T2> >
-//This specialization is needed to avoid instantiation of pair in
-//is_class, and allow recursive maps.
-{
-   static const bool value = true;
-};
-
-
-//Triviality of pair
-template<class T>
-struct is_trivially_copy_constructible;
-
-template<class A, class B>
-struct is_trivially_copy_assignable
-   <boost::container::dtl::pair<A,B> >
-{
-   static const bool value = false ;
-};
-
-template<class T>
-struct is_trivially_move_constructible;
-
-template<class A, class B>
-struct is_trivially_move_assignable
-   <boost::container::dtl::pair<A,B> >
-{
-   static const bool value = false;
-};
-
-template<class T>
-struct is_trivially_copy_assignable;
-
-template<class A, class B>
-struct is_trivially_copy_constructible<boost::container::dtl::pair<A,B> >
-{
-   static const bool value = false;
-};
-
-template<class T>
-struct is_trivially_move_assignable;
-
-template<class A, class B>
-struct is_trivially_move_constructible<boost::container::dtl::pair<A,B> >
-{
-   static const bool value = false;
-};
-
-template<class T>
-struct is_trivially_destructible;
-
-template<class A, class B>
-struct is_trivially_destructible<boost::container::dtl::pair<A,B> >
-{
-   static const bool value = boost::move_detail::is_trivially_destructible<A>::value &&
-                             boost::move_detail::is_trivially_destructible<B>::value ;
-};
-
-
-}  //namespace move_detail{
-
-}  //namespace boost {
-
-#include <boost/container/detail/config_end.hpp>
-
-#endif   //#ifndef BOOST_CONTAINER_DETAIL_PAIR_HPP
diff --git a/src/boost/container/detail/pair_key_mapped_of_value.hpp b/src/boost/container/detail/pair_key_mapped_of_value.hpp
deleted file mode 100644
index 6112b878..00000000
--- a/src/boost/container/detail/pair_key_mapped_of_value.hpp
+++ /dev/null
@@ -1,55 +0,0 @@
-//////////////////////////////////////////////////////////////////////////////
-//
-// (C) Copyright Ion Gaztanaga 2005-2013. Distributed under the Boost
-// 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.
-//
-//////////////////////////////////////////////////////////////////////////////
-#ifndef BOOST_CONTAINER_PAIR_KEY_MAPPED_OF_VALUE_HPP
-#define BOOST_CONTAINER_PAIR_KEY_MAPPED_OF_VALUE_HPP
-
-#ifndef BOOST_CONFIG_HPP
-#  include <boost/config.hpp>
-#endif
-
-#if defined(BOOST_HAS_PRAGMA_ONCE)
-#  pragma once
-#endif
-
-#include <boost/container/detail/config_begin.hpp>
-#include <boost/container/detail/workaround.hpp>
-
-namespace boost {
-namespace container {
-
-template<class Key, class Mapped>
-struct pair_key_mapped_of_value
-{
-   typedef Key    key_type;
-   typedef Mapped mapped_type;
-
-   template<class Pair>
-   const key_type & key_of_value(const Pair &p) const
-   {  return p.first;  }
-
-   template<class Pair>
-   const mapped_type & mapped_of_value(const Pair &p) const
-   {  return p.second;  }
-
-   template<class Pair>
-   key_type & key_of_value(Pair &p) const
-   {  return const_cast<key_type&>(p.first);  }
-
-   template<class Pair>
-   mapped_type & mapped_of_value(Pair &p) const
-   {  return p.second;  }
-
-};
-
-}}
-
-#include <boost/container/detail/config_end.hpp>
-
-#endif   // BOOST_CONTAINER_PAIR_KEY_MAPPED_OF_VALUE_HPP
diff --git a/src/boost/container/detail/placement_new.hpp b/src/boost/container/detail/placement_new.hpp
deleted file mode 100644
index 6d7ead88..00000000
--- a/src/boost/container/detail/placement_new.hpp
+++ /dev/null
@@ -1,24 +0,0 @@
-#ifndef BOOST_CONTAINER_DETAIL_PLACEMENT_NEW_HPP
-#define BOOST_CONTAINER_DETAIL_PLACEMENT_NEW_HPP
-///////////////////////////////////////////////////////////////////////////////
-//
-// (C) Copyright Ion Gaztanaga 2014-2015. Distributed under the Boost
-// 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.
-//
-///////////////////////////////////////////////////////////////////////////////
-
-#include <cstddef>
-
-struct boost_container_new_t{};
-
-//avoid including <new>
-inline void *operator new(std::size_t, void *p, boost_container_new_t)
-{  return p;  }
-
-inline void operator delete(void *, void *, boost_container_new_t)
-{}
-
-#endif   //BOOST_CONTAINER_DETAIL_PLACEMENT_NEW_HPP
diff --git a/src/boost/container/detail/std_fwd.hpp b/src/boost/container/detail/std_fwd.hpp
deleted file mode 100644
index d67f6692..00000000
--- a/src/boost/container/detail/std_fwd.hpp
+++ /dev/null
@@ -1,62 +0,0 @@
-//////////////////////////////////////////////////////////////////////////////
-//
-// (C) Copyright Ion Gaztanaga 2014-2014. Distributed under the Boost
-// 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.
-//
-//////////////////////////////////////////////////////////////////////////////
-
-#ifndef BOOST_CONTAINER_DETAIL_STD_FWD_HPP
-#define BOOST_CONTAINER_DETAIL_STD_FWD_HPP
-
-#ifndef BOOST_CONFIG_HPP
-#  include <boost/config.hpp>
-#endif
-
-#if defined(BOOST_HAS_PRAGMA_ONCE)
-#  pragma once
-#endif
-
-//////////////////////////////////////////////////////////////////////////////
-//                        Standard predeclarations
-//////////////////////////////////////////////////////////////////////////////
-
-#include <boost/move/detail/std_ns_begin.hpp>
-BOOST_MOVE_STD_NS_BEG
-
-template<class T>
-class allocator;
-
-template<class T>
-struct less;
-
-template<class T>
-struct equal_to;
-
-template<class T1, class T2>
-struct pair;
-
-template<class T>
-struct char_traits;
-
-struct input_iterator_tag;
-struct forward_iterator_tag;
-struct bidirectional_iterator_tag;
-struct random_access_iterator_tag;
-
-template<class Container>
-class insert_iterator;
-
-struct allocator_arg_t;
-
-struct piecewise_construct_t;
-
-template <class Ptr>
-struct pointer_traits;
-
-BOOST_MOVE_STD_NS_END
-#include <boost/move/detail/std_ns_end.hpp>
-
-#endif //#ifndef BOOST_CONTAINER_DETAIL_STD_FWD_HPP
diff --git a/src/boost/container/detail/transform_iterator.hpp b/src/boost/container/detail/transform_iterator.hpp
deleted file mode 100644
index 5c7bbf2d..00000000
--- a/src/boost/container/detail/transform_iterator.hpp
+++ /dev/null
@@ -1,180 +0,0 @@
-//////////////////////////////////////////////////////////////////////////////
-//
-// (C) Copyright Ion Gaztanaga 2005-2013.
-// (C) Copyright Gennaro Prota 2003 - 2004.
-//
-// Distributed under the Boost 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.
-//
-//////////////////////////////////////////////////////////////////////////////
-
-#ifndef BOOST_CONTAINER_DETAIL_TRANSFORM_ITERATORS_HPP
-#define BOOST_CONTAINER_DETAIL_TRANSFORM_ITERATORS_HPP
-
-#ifndef BOOST_CONFIG_HPP
-#  include <boost/config.hpp>
-#endif
-
-#if defined(BOOST_HAS_PRAGMA_ONCE)
-#  pragma once
-#endif
-
-#include <boost/container/detail/config_begin.hpp>
-#include <boost/container/detail/workaround.hpp>
-#include <boost/container/detail/type_traits.hpp>
-#include <boost/container/detail/iterator.hpp>
-
-namespace boost {
-namespace container {
-
-template <class PseudoReference>
-struct operator_arrow_proxy
-{
-   BOOST_CONTAINER_FORCEINLINE operator_arrow_proxy(const PseudoReference &px)
-      :  m_value(px)
-   {}
-
-   typedef PseudoReference element_type;
-
-   BOOST_CONTAINER_FORCEINLINE PseudoReference* operator->() const { return &m_value; }
-
-   mutable PseudoReference m_value;
-};
-
-template <class T>
-struct operator_arrow_proxy<T&>
-{
-   BOOST_CONTAINER_FORCEINLINE operator_arrow_proxy(T &px)
-      :  m_value(px)
-   {}
-
-   typedef T element_type;
-
-   BOOST_CONTAINER_FORCEINLINE T* operator->() const { return const_cast<T*>(&m_value); }
-
-   T &m_value;
-};
-
-template <class Iterator, class UnaryFunction>
-class transform_iterator
-   : public UnaryFunction
-   , public boost::container::iterator
-      < typename Iterator::iterator_category
-      , typename dtl::remove_reference<typename UnaryFunction::result_type>::type
-      , typename Iterator::difference_type
-      , operator_arrow_proxy<typename UnaryFunction::result_type>
-      , typename UnaryFunction::result_type>
-{
-   public:
-   BOOST_CONTAINER_FORCEINLINE explicit transform_iterator(const Iterator &it, const UnaryFunction &f = UnaryFunction())
-      :  UnaryFunction(f), m_it(it)
-   {}
-
-   BOOST_CONTAINER_FORCEINLINE explicit transform_iterator()
-      :  UnaryFunction(), m_it()
-   {}
-
-   //Constructors
-   BOOST_CONTAINER_FORCEINLINE transform_iterator& operator++()
-   { increment();   return *this;   }
-
-      BOOST_CONTAINER_FORCEINLINE transform_iterator operator++(int)
-   {
-      transform_iterator result (*this);
-      increment();
-      return result;
-   }
-
-   BOOST_CONTAINER_FORCEINLINE friend bool operator== (const transform_iterator& i, const transform_iterator& i2)
-   { return i.equal(i2); }
-
-   BOOST_CONTAINER_FORCEINLINE friend bool operator!= (const transform_iterator& i, const transform_iterator& i2)
-   { return !(i == i2); }
-
-/*
-   friend bool operator> (const transform_iterator& i, const transform_iterator& i2)
-   { return i2 < i; }
-
-   friend bool operator<= (const transform_iterator& i, const transform_iterator& i2)
-   { return !(i > i2); }
-
-   friend bool operator>= (const transform_iterator& i, const transform_iterator& i2)
-   { return !(i < i2); }
-*/
-   BOOST_CONTAINER_FORCEINLINE friend typename Iterator::difference_type operator- (const transform_iterator& i, const transform_iterator& i2)
-   { return i2.distance_to(i); }
-
-   //Arithmetic
-   BOOST_CONTAINER_FORCEINLINE transform_iterator& operator+=(typename Iterator::difference_type off)
-   {  this->advance(off); return *this;   }
-
-   BOOST_CONTAINER_FORCEINLINE transform_iterator operator+(typename Iterator::difference_type off) const
-   {
-      transform_iterator other(*this);
-      other.advance(off);
-      return other;
-   }
-
-   BOOST_CONTAINER_FORCEINLINE friend transform_iterator operator+(typename Iterator::difference_type off, const transform_iterator& right)
-   {  return right + off; }
-
-   BOOST_CONTAINER_FORCEINLINE transform_iterator& operator-=(typename Iterator::difference_type off)
-   {  this->advance(-off); return *this;   }
-
-   BOOST_CONTAINER_FORCEINLINE transform_iterator operator-(typename Iterator::difference_type off) const
-   {  return *this + (-off);  }
-
-   BOOST_CONTAINER_FORCEINLINE typename UnaryFunction::result_type operator*() const
-   { return dereference(); }
-
-   BOOST_CONTAINER_FORCEINLINE operator_arrow_proxy<typename UnaryFunction::result_type>
-      operator->() const
-   { return operator_arrow_proxy<typename UnaryFunction::result_type>(dereference());  }
-
-   BOOST_CONTAINER_FORCEINLINE Iterator & base()
-   {  return m_it;   }
-
-   BOOST_CONTAINER_FORCEINLINE const Iterator & base() const
-   {  return m_it;   }
-
-   private:
-   Iterator m_it;
-
-   BOOST_CONTAINER_FORCEINLINE void increment()
-   { ++m_it; }
-
-   BOOST_CONTAINER_FORCEINLINE void decrement()
-   { --m_it; }
-
-   BOOST_CONTAINER_FORCEINLINE bool equal(const transform_iterator &other) const
-   {  return m_it == other.m_it;   }
-
-   BOOST_CONTAINER_FORCEINLINE bool less(const transform_iterator &other) const
-   {  return other.m_it < m_it;   }
-
-   BOOST_CONTAINER_FORCEINLINE typename UnaryFunction::result_type dereference() const
-   { return UnaryFunction::operator()(*m_it); }
-
-   BOOST_CONTAINER_FORCEINLINE void advance(typename Iterator::difference_type n)
-   {  boost::container::iterator_advance(m_it, n); }
-
-   BOOST_CONTAINER_FORCEINLINE typename Iterator::difference_type distance_to(const transform_iterator &other)const
-   {  return boost::container::iterator_distance(other.m_it, m_it); }
-};
-
-template <class Iterator, class UnaryFunc>
-BOOST_CONTAINER_FORCEINLINE transform_iterator<Iterator, UnaryFunc>
-make_transform_iterator(Iterator it, UnaryFunc fun)
-{
-   return transform_iterator<Iterator, UnaryFunc>(it, fun);
-}
-
-}  //namespace container {
-}  //namespace boost {
-
-#include <boost/container/detail/config_end.hpp>
-
-#endif   //#ifndef BOOST_CONTAINER_DETAIL_TRANSFORM_ITERATORS_HPP
diff --git a/src/boost/container/detail/tree.hpp b/src/boost/container/detail/tree.hpp
deleted file mode 100644
index 843ad3cb..00000000
--- a/src/boost/container/detail/tree.hpp
+++ /dev/null
@@ -1,1437 +0,0 @@
-//////////////////////////////////////////////////////////////////////////////
-//
-// (C) Copyright Ion Gaztanaga 2005-2015. Distributed under the Boost
-// 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.
-//
-//////////////////////////////////////////////////////////////////////////////
-
-#ifndef BOOST_CONTAINER_TREE_HPP
-#define BOOST_CONTAINER_TREE_HPP
-
-#ifndef BOOST_CONFIG_HPP
-#  include <boost/config.hpp>
-#endif
-
-#if defined(BOOST_HAS_PRAGMA_ONCE)
-#  pragma once
-#endif
-
-#include <boost/container/detail/config_begin.hpp>
-#include <boost/container/detail/workaround.hpp>
-// container
-#include <boost/container/allocator_traits.hpp>
-#include <boost/container/container_fwd.hpp>
-#include <boost/container/options.hpp>
-#include <boost/container/node_handle.hpp>
-
-// container/detail
-#include <boost/container/detail/algorithm.hpp> //algo_equal(), algo_lexicographical_compare
-#include <boost/container/detail/compare_functors.hpp>
-#include <boost/container/detail/destroyers.hpp>
-#include <boost/container/detail/iterator.hpp>
-#include <boost/container/detail/iterators.hpp>
-#include <boost/container/detail/node_alloc_holder.hpp>
-#include <boost/container/detail/pair.hpp>
-#include <boost/container/detail/type_traits.hpp>
-// intrusive
-#include <boost/intrusive/pointer_traits.hpp>
-#include <boost/intrusive/rbtree.hpp>
-#include <boost/intrusive/avltree.hpp>
-#include <boost/intrusive/splaytree.hpp>
-#include <boost/intrusive/sgtree.hpp>
-// intrusive/detail
-#include <boost/intrusive/detail/minimal_pair_header.hpp>   //pair
-#include <boost/intrusive/detail/tree_value_compare.hpp>    //tree_value_compare
-// move
-#include <boost/move/utility_core.hpp>
-// move/detail
-#if !defined(BOOST_NO_CXX11_VARIADIC_TEMPLATES)
-#include <boost/move/detail/fwd_macros.hpp>
-#endif
-#include <boost/move/detail/move_helpers.hpp>
-#include <boost/move/detail/force_ptr.hpp>
-
-
-
-#include <boost/container/detail/std_fwd.hpp>
-
-namespace boost {
-namespace container {
-namespace dtl {
-
-using boost::intrusive::tree_value_compare;
-
-template<class VoidPointer, boost::container::tree_type_enum tree_type_value, bool OptimizeSize>
-struct intrusive_tree_hook;
-
-template<class VoidPointer, bool OptimizeSize>
-struct intrusive_tree_hook<VoidPointer, boost::container::red_black_tree, OptimizeSize>
-{
-   typedef typename dtl::bi::make_set_base_hook
-      < dtl::bi::void_pointer<VoidPointer>
-      , dtl::bi::link_mode<dtl::bi::normal_link>
-      , dtl::bi::optimize_size<OptimizeSize>
-      >::type  type;
-};
-
-template<class VoidPointer, bool OptimizeSize>
-struct intrusive_tree_hook<VoidPointer, boost::container::avl_tree, OptimizeSize>
-{
-   typedef typename dtl::bi::make_avl_set_base_hook
-      < dtl::bi::void_pointer<VoidPointer>
-      , dtl::bi::link_mode<dtl::bi::normal_link>
-      , dtl::bi::optimize_size<OptimizeSize>
-      >::type  type;
-};
-
-template<class VoidPointer, bool OptimizeSize>
-struct intrusive_tree_hook<VoidPointer, boost::container::scapegoat_tree, OptimizeSize>
-{
-   typedef typename dtl::bi::make_bs_set_base_hook
-      < dtl::bi::void_pointer<VoidPointer>
-      , dtl::bi::link_mode<dtl::bi::normal_link>
-      >::type  type;
-};
-
-template<class VoidPointer, bool OptimizeSize>
-struct intrusive_tree_hook<VoidPointer, boost::container::splay_tree, OptimizeSize>
-{
-   typedef typename dtl::bi::make_bs_set_base_hook
-      < dtl::bi::void_pointer<VoidPointer>
-      , dtl::bi::link_mode<dtl::bi::normal_link>
-      >::type  type;
-};
-
-//This trait is used to type-pun std::pair because in C++03
-//compilers std::pair is useless for C++11 features
-template<class T>
-struct tree_internal_data_type
-{
-   typedef T type;
-};
-
-template<class T1, class T2>
-struct tree_internal_data_type< std::pair<T1, T2> >
-{
-   typedef pair<typename boost::move_detail::remove_const<T1>::type, T2> type;
-};
-
-template <class T, class VoidPointer, boost::container::tree_type_enum tree_type_value, bool OptimizeSize>
-struct iiterator_node_value_type< base_node<T, intrusive_tree_hook<VoidPointer, tree_type_value, OptimizeSize>, true > >
-{
-  typedef T type;
-};
-
-template<class Node, class Icont>
-class insert_equal_end_hint_functor
-{
-   Icont &icont_;
-
-   public:
-   BOOST_CONTAINER_FORCEINLINE insert_equal_end_hint_functor(Icont &icont)
-      :  icont_(icont)
-   {}
-
-   BOOST_CONTAINER_FORCEINLINE void operator()(Node &n)
-   {  this->icont_.insert_equal(this->icont_.cend(), n); }
-};
-
-template<class Node, class Icont>
-class push_back_functor
-{
-   Icont &icont_;
-
-   public:
-   BOOST_CONTAINER_FORCEINLINE push_back_functor(Icont &icont)
-      :  icont_(icont)
-   {}
-
-   BOOST_CONTAINER_FORCEINLINE void operator()(Node &n)
-   {  this->icont_.push_back(n); }
-};
-
-}//namespace dtl {
-
-namespace dtl {
-
-template< class NodeType
-        , class KeyOfNode
-        , class KeyCompare
-        , class HookType
-        , boost::container::tree_type_enum tree_type_value>
-struct intrusive_tree_dispatch;
-
-template<class NodeType, class KeyOfNode, class KeyCompare, class HookType>
-struct intrusive_tree_dispatch
-   <NodeType, KeyOfNode, KeyCompare, HookType, boost::container::red_black_tree>
-{
-   typedef typename dtl::bi::make_rbtree
-      <NodeType
-      ,dtl::bi::key_of_value<KeyOfNode>
-      ,dtl::bi::compare<KeyCompare>
-      ,dtl::bi::base_hook<HookType>
-      ,dtl::bi::constant_time_size<true>
-      >::type  type;
-};
-
-template<class NodeType, class KeyOfNode, class KeyCompare, class HookType>
-struct intrusive_tree_dispatch
-   <NodeType, KeyOfNode, KeyCompare, HookType, boost::container::avl_tree>
-{
-   typedef typename dtl::bi::make_avltree
-      <NodeType
-      ,dtl::bi::key_of_value<KeyOfNode>
-      ,dtl::bi::compare<KeyCompare>
-      ,dtl::bi::base_hook<HookType>
-      ,dtl::bi::constant_time_size<true>
-      >::type  type;
-};
-
-template<class NodeType, class KeyOfNode, class KeyCompare, class HookType>
-struct intrusive_tree_dispatch
-   <NodeType, KeyOfNode, KeyCompare, HookType, boost::container::scapegoat_tree>
-{
-   typedef typename dtl::bi::make_sgtree
-      <NodeType
-      ,dtl::bi::key_of_value<KeyOfNode>
-      ,dtl::bi::compare<KeyCompare>
-      ,dtl::bi::base_hook<HookType>
-      ,dtl::bi::floating_point<true>
-      >::type  type;
-};
-
-template<class NodeType, class KeyOfNode, class KeyCompare, class HookType>
-struct intrusive_tree_dispatch
-   <NodeType, KeyOfNode, KeyCompare, HookType, boost::container::splay_tree>
-{
-   typedef typename dtl::bi::make_splaytree
-      <NodeType
-      ,dtl::bi::key_of_value<KeyOfNode>
-      ,dtl::bi::compare<KeyCompare>
-      ,dtl::bi::base_hook<HookType>
-      ,dtl::bi::constant_time_size<true>
-      >::type  type;
-};
-
-template < class Allocator
-         , class KeyOfValue
-         , class KeyCompare
-         , boost::container::tree_type_enum tree_type_value
-         , bool OptimizeSize>
-struct intrusive_tree_type
-{
-   private:
-   typedef typename boost::container::
-      allocator_traits<Allocator>::value_type               value_type;
-   typedef typename boost::container::
-      allocator_traits<Allocator>::void_pointer             void_pointer;
-   typedef base_node<value_type, intrusive_tree_hook
-      <void_pointer, tree_type_value, OptimizeSize>, true > node_t;
-   //Deducing the hook type from node_t (e.g. node_t::hook_type) would
-   //provoke an early instantiation of node_t that could ruin recursive
-   //tree definitions, so retype the complete type to avoid any problem.
-   typedef typename intrusive_tree_hook
-      <void_pointer, tree_type_value
-      , OptimizeSize>::type                                 hook_type;
-
-   typedef key_of_node
-      <node_t, KeyOfValue>                                  key_of_node_t;
-
-   public:
-   typedef typename intrusive_tree_dispatch
-      < node_t
-      , key_of_node_t
-      , KeyCompare
-      , hook_type
-      , tree_type_value>::type                     type;
-};
-
-//Trait to detect manually rebalanceable tree types
-template<boost::container::tree_type_enum tree_type_value>
-struct is_manually_balanceable
-{  static const bool value = true;  };
-
-template<>  struct is_manually_balanceable<red_black_tree>
-{  static const bool value = false; };
-
-template<>  struct is_manually_balanceable<avl_tree>
-{  static const bool value = false; };
-
-//Proxy traits to implement different operations depending on the
-//is_manually_balanceable<>::value
-template< boost::container::tree_type_enum tree_type_value
-        , bool IsManuallyRebalanceable = is_manually_balanceable<tree_type_value>::value>
-struct intrusive_tree_proxy
-{
-   template<class Icont>
-   BOOST_CONTAINER_FORCEINLINE static void rebalance(Icont &)   {}
-};
-
-template<boost::container::tree_type_enum tree_type_value>
-struct intrusive_tree_proxy<tree_type_value, true>
-{
-   template<class Icont>
-   BOOST_CONTAINER_FORCEINLINE static void rebalance(Icont &c)
-   {  c.rebalance(); }
-};
-
-}  //namespace dtl {
-
-namespace dtl {
-
-//This functor will be used with Intrusive clone functions to obtain
-//already allocated nodes from a intrusive container instead of
-//allocating new ones. When the intrusive container runs out of nodes
-//the node holder is used instead.
-template<class AllocHolder, bool DoMove>
-class RecyclingCloner
-{
-   typedef typename AllocHolder::intrusive_container  intrusive_container;
-   typedef typename AllocHolder::Node                 node_t;
-   typedef typename AllocHolder::NodePtr              node_ptr_type;
-
-   public:
-   RecyclingCloner(AllocHolder &holder, intrusive_container &itree)
-      :  m_holder(holder), m_icont(itree)
-   {}
-
-   BOOST_CONTAINER_FORCEINLINE static void do_assign(node_ptr_type p, node_t &other, bool_<true>)
-   {  p->do_move_assign(other.get_real_data());   }
-
-   BOOST_CONTAINER_FORCEINLINE static void do_assign(node_ptr_type p, const node_t &other, bool_<false>)
-   {  p->do_assign(other.get_real_data());   }
-
-   node_ptr_type operator()
-      (typename dtl::if_c<DoMove, node_t &, const node_t&>::type other) const
-   {
-      if(node_ptr_type p = m_icont.unlink_leftmost_without_rebalance()){
-         //First recycle a node (this can't throw)
-         BOOST_CONTAINER_TRY{
-            //This can throw
-            this->do_assign(p, other, bool_<DoMove>());
-            return p;
-         }
-         BOOST_CONTAINER_CATCH(...){
-            //If there is an exception destroy the whole source
-            m_holder.destroy_node(p);
-            while((p = m_icont.unlink_leftmost_without_rebalance())){
-               m_holder.destroy_node(p);
-            }
-            BOOST_CONTAINER_RETHROW
-         }
-         BOOST_CONTAINER_CATCH_END
-      }
-      else{
-         return m_holder.create_node(boost::move(other.get_real_data()));
-      }
-   }
-
-   AllocHolder &m_holder;
-   intrusive_container &m_icont;
-};
-
-template<class Options>
-struct get_tree_opt
-{
-   typedef Options type;
-};
-
-template<>
-struct get_tree_opt<void>
-{
-   typedef tree_assoc_defaults type;
-};
-
-template<class, class KeyOfValue>
-struct tree_key_of_value
-{
-   typedef KeyOfValue type;
-};
-
-template<class T>
-struct tree_key_of_value<T, void>
-{
-   typedef dtl::identity<T> type;
-};
-
-template<class T1, class T2>
-struct tree_key_of_value<std::pair<T1, T2>, int>
-{
-   typedef dtl::select1st<T1> type;
-};
-
-template<class T1, class T2>
-struct tree_key_of_value<boost::container::dtl::pair<T1, T2>, int>
-{
-   typedef dtl::select1st<T1> type;
-};
-
-
-template <class T, class KeyOfValue, class Compare, class Allocator, class Options>
-struct make_intrusive_tree_type
-   : dtl::intrusive_tree_type
-         < typename real_allocator<T, Allocator>::type
-         , typename tree_key_of_value<T, KeyOfValue>::type
-         , Compare
-         , get_tree_opt<Options>::type::tree_type
-         , get_tree_opt<Options>::type::optimize_size
-         >
-{};
-
-
-template <class T, class KeyOfValue, class Compare, class Allocator, class Options>
-class tree
-   : public dtl::node_alloc_holder
-      < typename real_allocator<T, Allocator>::type
-      , typename make_intrusive_tree_type<T, KeyOfValue, Compare, Allocator, Options>::type
-      >
-{
-   typedef tree < T, KeyOfValue
-                , Compare, Allocator, Options>              ThisType;
-   public:
-   typedef typename real_allocator<T, Allocator>::type      allocator_type;
-
-   private:
-   typedef allocator_traits<allocator_type>                 allocator_traits_t;
-   typedef typename tree_key_of_value<T, KeyOfValue>::type  key_of_value_t;
-   typedef tree_value_compare
-      < typename allocator_traits_t::pointer
-      , Compare
-      , key_of_value_t>                                     ValComp;
-   typedef typename get_tree_opt<Options>::type             options_type;
-   typedef typename make_intrusive_tree_type
-      <T, KeyOfValue, Compare, Allocator, Options>::type    Icont;
-   typedef dtl::node_alloc_holder
-      <allocator_type, Icont>                               AllocHolder;
-   typedef typename AllocHolder::NodePtr                    NodePtr;
-
-   typedef typename AllocHolder::NodeAlloc                  NodeAlloc;
-   typedef boost::container::
-      allocator_traits<NodeAlloc>                           allocator_traits_type;
-   typedef typename AllocHolder::ValAlloc                   ValAlloc;
-   typedef typename AllocHolder::Node                       Node;
-   typedef typename Icont::iterator                         iiterator;
-   typedef typename Icont::const_iterator                   iconst_iterator;
-   typedef dtl::allocator_node_destroyer<NodeAlloc> Destroyer;
-   typedef typename AllocHolder::alloc_version              alloc_version;
-   typedef intrusive_tree_proxy<options_type::tree_type>    intrusive_tree_proxy_t;
-
-   BOOST_COPYABLE_AND_MOVABLE(tree)
-
-   public:
-
-   typedef typename dtl::remove_const
-      <typename key_of_value_t::type>::type                 key_type;
-   typedef T                                                value_type;
-   typedef Compare                                          key_compare;
-   typedef ValComp                                          value_compare;
-   typedef typename boost::container::
-      allocator_traits<allocator_type>::pointer             pointer;
-   typedef typename boost::container::
-      allocator_traits<allocator_type>::const_pointer       const_pointer;
-   typedef typename boost::container::
-      allocator_traits<allocator_type>::reference           reference;
-   typedef typename boost::container::
-      allocator_traits<allocator_type>::const_reference     const_reference;
-   typedef typename boost::container::
-      allocator_traits<allocator_type>::size_type           size_type;
-   typedef typename boost::container::
-      allocator_traits<allocator_type>::difference_type     difference_type;
-   typedef dtl::iterator_from_iiterator
-      <iiterator, false>                                    iterator;
-   typedef dtl::iterator_from_iiterator
-      <iiterator, true >                                    const_iterator;
-   typedef boost::container::reverse_iterator
-      <iterator>                                            reverse_iterator;
-   typedef boost::container::reverse_iterator
-      <const_iterator>                                      const_reverse_iterator;
-   typedef node_handle
-      < NodeAlloc, void>                                    node_type;
-   typedef insert_return_type_base
-      <iterator, node_type>                                 insert_return_type;
-
-   typedef NodeAlloc                                        stored_allocator_type;
-
-   private:
-
-   typedef key_node_pred<key_compare, key_of_value_t, Node>  KeyNodeCompare;
-
-   public:
-
-   BOOST_CONTAINER_FORCEINLINE tree()
-      : AllocHolder()
-   {}
-
-   BOOST_CONTAINER_FORCEINLINE explicit tree(const key_compare& comp)
-      : AllocHolder(ValComp(comp))
-   {}
-
-   BOOST_CONTAINER_FORCEINLINE explicit tree(const key_compare& comp, const allocator_type& a)
-      : AllocHolder(ValComp(comp), a)
-   {}
-
-   BOOST_CONTAINER_FORCEINLINE explicit tree(const allocator_type& a)
-      : AllocHolder(a)
-   {}
-
-   template <class InputIterator>
-   tree(bool unique_insertion, InputIterator first, InputIterator last)
-      : AllocHolder(value_compare(key_compare()))
-   {
-      this->tree_construct(unique_insertion, first, last);
-      //AllocHolder clears in case of exception
-   }
-
-   template <class InputIterator>
-   tree(bool unique_insertion, InputIterator first, InputIterator last, const key_compare& comp)
-      : AllocHolder(value_compare(comp))
-   {
-      this->tree_construct(unique_insertion, first, last);
-      //AllocHolder clears in case of exception
-   }
-
-   template <class InputIterator>
-   tree(bool unique_insertion, InputIterator first, InputIterator last, const key_compare& comp, const allocator_type& a)
-      : AllocHolder(value_compare(comp), a)
-   {
-      this->tree_construct(unique_insertion, first, last);
-      //AllocHolder clears in case of exception
-   }
-
-   //construct with ordered range
-   template <class InputIterator>
-   tree( ordered_range_t, InputIterator first, InputIterator last)
-      : AllocHolder(value_compare(key_compare()))
-   {
-      this->tree_construct(ordered_range_t(), first, last);
-   }
-
-   template <class InputIterator>
-   tree( ordered_range_t, InputIterator first, InputIterator last, const key_compare& comp)
-      : AllocHolder(value_compare(comp))
-   {
-      this->tree_construct(ordered_range_t(), first, last);
-   }
-
-   template <class InputIterator>
-   tree( ordered_range_t, InputIterator first, InputIterator last
-         , const key_compare& comp, const allocator_type& a)
-      : AllocHolder(value_compare(comp), a)
-   {
-      this->tree_construct(ordered_range_t(), first, last);
-   }
-
-   private:
-
-   template <class InputIterator>
-   void tree_construct(bool unique_insertion, InputIterator first, InputIterator last)
-   {
-      //Use cend() as hint to achieve linear time for
-      //ordered ranges as required by the standard
-      //for the constructor
-      if(unique_insertion){
-         const const_iterator end_it(this->cend());
-         for ( ; first != last; ++first){
-            this->insert_unique_hint_convertible(end_it, *first);
-         }
-      }
-      else{
-         this->tree_construct_non_unique(first, last);
-      }
-   }
-
-   template <class InputIterator>
-   void tree_construct_non_unique(InputIterator first, InputIterator last
-      #if !defined(BOOST_CONTAINER_DOXYGEN_INVOKED)
-      , typename dtl::enable_if_or
-         < void
-         , dtl::is_same<alloc_version, version_1>
-         , dtl::is_input_iterator<InputIterator>
-         >::type * = 0
-      #endif
-         )
-   {
-      //Use cend() as hint to achieve linear time for
-      //ordered ranges as required by the standard
-      //for the constructor
-      const const_iterator end_it(this->cend());
-      for ( ; first != last; ++first){
-         this->insert_equal_hint_convertible(end_it, *first);
-      }
-   }
-
-   template <class InputIterator>
-   void tree_construct_non_unique(InputIterator first, InputIterator last
-      #if !defined(BOOST_CONTAINER_DOXYGEN_INVOKED)
-      , typename dtl::disable_if_or
-         < void
-         , dtl::is_same<alloc_version, version_1>
-         , dtl::is_input_iterator<InputIterator>
-         >::type * = 0
-      #endif
-         )
-   {
-      //Optimized allocation and construction
-      this->allocate_many_and_construct
-         ( first, boost::container::iterator_udistance(first, last)
-         , insert_equal_end_hint_functor<Node, Icont>(this->icont()));
-   }
-
-   template <class InputIterator>
-   void tree_construct( ordered_range_t, InputIterator first, InputIterator last
-         #if !defined(BOOST_CONTAINER_DOXYGEN_INVOKED)
-      , typename dtl::disable_if_or
-         < void
-         , dtl::is_same<alloc_version, version_1>
-         , dtl::is_input_iterator<InputIterator>
-         >::type * = 0
-         #endif
-         )
-   {
-      //Optimized allocation and construction
-      this->allocate_many_and_construct
-         ( first, boost::container::iterator_udistance(first, last)
-         , dtl::push_back_functor<Node, Icont>(this->icont()));
-      //AllocHolder clears in case of exception
-   }
-
-   template <class InputIterator>
-   void tree_construct( ordered_range_t, InputIterator first, InputIterator last
-         #if !defined(BOOST_CONTAINER_DOXYGEN_INVOKED)
-      , typename dtl::enable_if_or
-         < void
-         , dtl::is_same<alloc_version, version_1>
-         , dtl::is_input_iterator<InputIterator>
-         >::type * = 0
-         #endif
-         )
-   {
-      for ( ; first != last; ++first){
-         this->push_back_impl(*first);
-      }
-   }
-
-   public:
-
-   BOOST_CONTAINER_FORCEINLINE tree(const tree& x)
-      :  AllocHolder(x, x.value_comp())
-   {
-      this->icont().clone_from
-         (x.icont(), typename AllocHolder::cloner(*this), Destroyer(this->node_alloc()));
-   }
-
-   BOOST_CONTAINER_FORCEINLINE tree(BOOST_RV_REF(tree) x)
-      BOOST_NOEXCEPT_IF(boost::container::dtl::is_nothrow_move_constructible<Compare>::value)
-      :  AllocHolder(BOOST_MOVE_BASE(AllocHolder, x), x.value_comp())
-   {}
-
-   BOOST_CONTAINER_FORCEINLINE tree(const tree& x, const allocator_type &a)
-      :  AllocHolder(x.value_comp(), a)
-   {
-      this->icont().clone_from
-         (x.icont(), typename AllocHolder::cloner(*this), Destroyer(this->node_alloc()));
-      //AllocHolder clears in case of exception
-   }
-
-   tree(BOOST_RV_REF(tree) x, const allocator_type &a)
-      :  AllocHolder(x.value_comp(), a)
-   {
-      if(this->node_alloc() == x.node_alloc()){
-         this->icont().swap(x.icont());
-      }
-      else{
-         this->icont().clone_from
-            (boost::move(x.icont()), typename AllocHolder::move_cloner(*this), Destroyer(this->node_alloc()));
-      }
-      //AllocHolder clears in case of exception
-   }
-
-   BOOST_CONTAINER_FORCEINLINE ~tree()
-   {} //AllocHolder clears the tree
-
-   tree& operator=(BOOST_COPY_ASSIGN_REF(tree) x)
-   {
-      if (BOOST_LIKELY(this != &x)) {
-         NodeAlloc &this_alloc     = this->get_stored_allocator();
-         const NodeAlloc &x_alloc  = x.get_stored_allocator();
-         dtl::bool_<allocator_traits<NodeAlloc>::
-            propagate_on_container_copy_assignment::value> flag;
-         if(flag && this_alloc != x_alloc){
-            this->clear();
-         }
-         this->AllocHolder::copy_assign_alloc(x);
-         //Transfer all the nodes to a temporary tree
-         //If anything goes wrong, all the nodes will be destroyed
-         //automatically
-         Icont other_tree(::boost::move(this->icont()));
-
-         //Now recreate the source tree reusing nodes stored by other_tree
-         this->icont().clone_from
-            (x.icont()
-            , RecyclingCloner<AllocHolder, false>(*this, other_tree)
-            , Destroyer(this->node_alloc()));
-
-         //If there are remaining nodes, destroy them
-         NodePtr p;
-         while((p = other_tree.unlink_leftmost_without_rebalance())){
-            AllocHolder::destroy_node(p);
-         }
-      }
-      return *this;
-   }
-
-   tree& operator=(BOOST_RV_REF(tree) x)
-      BOOST_NOEXCEPT_IF( (allocator_traits_type::propagate_on_container_move_assignment::value ||
-                          allocator_traits_type::is_always_equal::value) &&
-                           boost::container::dtl::is_nothrow_move_assignable<Compare>::value)
-   {
-      if (BOOST_LIKELY(this != &x)) {
-         NodeAlloc &this_alloc = this->node_alloc();
-         NodeAlloc &x_alloc    = x.node_alloc();
-         const bool propagate_alloc = allocator_traits<NodeAlloc>::
-               propagate_on_container_move_assignment::value;
-         const bool allocators_equal = this_alloc == x_alloc; (void)allocators_equal;
-         //Resources can be transferred if both allocators are
-         //going to be equal after this function (either propagated or already equal)
-         if(propagate_alloc || allocators_equal){
-            //Destroy
-            this->clear();
-            //Move allocator if needed
-            this->AllocHolder::move_assign_alloc(x);
-            //Obtain resources
-            this->icont() = boost::move(x.icont());
-         }
-         //Else do a one by one move
-         else{
-            //Transfer all the nodes to a temporary tree
-            //If anything goes wrong, all the nodes will be destroyed
-            //automatically
-            Icont other_tree(::boost::move(this->icont()));
-
-            //Now recreate the source tree reusing nodes stored by other_tree
-            this->icont().clone_from
-               (::boost::move(x.icont())
-               , RecyclingCloner<AllocHolder, true>(*this, other_tree)
-               , Destroyer(this->node_alloc()));
-
-            //If there are remaining nodes, destroy them
-            NodePtr p;
-            while((p = other_tree.unlink_leftmost_without_rebalance())){
-               AllocHolder::destroy_node(p);
-            }
-         }
-      }
-      return *this;
-   }
-
-   public:
-   // accessors:
-   BOOST_CONTAINER_ATTRIBUTE_NODISCARD BOOST_CONTAINER_FORCEINLINE
-      value_compare value_comp() const
-   {  return value_compare(this->key_comp()); }
-
-   BOOST_CONTAINER_ATTRIBUTE_NODISCARD BOOST_CONTAINER_FORCEINLINE
-      key_compare key_comp() const
-   {  return this->icont().key_comp(); }
-
-   BOOST_CONTAINER_ATTRIBUTE_NODISCARD BOOST_CONTAINER_FORCEINLINE
-      allocator_type get_allocator() const
-   {  return allocator_type(this->node_alloc()); }
-
-   BOOST_CONTAINER_ATTRIBUTE_NODISCARD BOOST_CONTAINER_FORCEINLINE
-      const stored_allocator_type &get_stored_allocator() const
-   {  return this->node_alloc(); }
-
-   BOOST_CONTAINER_ATTRIBUTE_NODISCARD BOOST_CONTAINER_FORCEINLINE
-      stored_allocator_type &get_stored_allocator()
-   {  return this->node_alloc(); }
-
-   BOOST_CONTAINER_ATTRIBUTE_NODISCARD BOOST_CONTAINER_FORCEINLINE
-      iterator begin()
-   { return iterator(this->icont().begin()); }
-
-   BOOST_CONTAINER_ATTRIBUTE_NODISCARD BOOST_CONTAINER_FORCEINLINE
-      const_iterator begin() const
-   {  return this->cbegin();  }
-
-   BOOST_CONTAINER_ATTRIBUTE_NODISCARD BOOST_CONTAINER_FORCEINLINE
-      iterator end()
-   {  return iterator(this->icont().end());  }
-
-   BOOST_CONTAINER_ATTRIBUTE_NODISCARD BOOST_CONTAINER_FORCEINLINE
-      const_iterator end() const
-   {  return this->cend();  }
-
-   BOOST_CONTAINER_ATTRIBUTE_NODISCARD BOOST_CONTAINER_FORCEINLINE
-      reverse_iterator rbegin()
-   {  return reverse_iterator(end());  }
-
-   
-   BOOST_CONTAINER_ATTRIBUTE_NODISCARD BOOST_CONTAINER_FORCEINLINE
-      const_reverse_iterator rbegin() const
-   {  return this->crbegin();  }
-
-   BOOST_CONTAINER_ATTRIBUTE_NODISCARD BOOST_CONTAINER_FORCEINLINE
-      reverse_iterator rend()
-   {  return reverse_iterator(begin());   }
-
-   BOOST_CONTAINER_ATTRIBUTE_NODISCARD BOOST_CONTAINER_FORCEINLINE
-      const_reverse_iterator rend() const
-   {  return this->crend();   }
-
-   //! <b>Effects</b>: Returns a const_iterator to the first element contained in the container.
-   //!
-   //! <b>Throws</b>: Nothing.
-   //!
-   //! <b>Complexity</b>: Constant.
-   BOOST_CONTAINER_ATTRIBUTE_NODISCARD BOOST_CONTAINER_FORCEINLINE
-      const_iterator cbegin() const
-   { return const_iterator(this->non_const_icont().begin()); }
-
-   //! <b>Effects</b>: Returns a const_iterator to the end of the container.
-   //!
-   //! <b>Throws</b>: Nothing.
-   //!
-   //! <b>Complexity</b>: Constant.
-   BOOST_CONTAINER_ATTRIBUTE_NODISCARD BOOST_CONTAINER_FORCEINLINE
-      const_iterator cend() const
-   { return const_iterator(this->non_const_icont().end()); }
-
-   //! <b>Effects</b>: Returns a const_reverse_iterator pointing to the beginning
-   //! of the reversed container.
-   //!
-   //! <b>Throws</b>: Nothing.
-   //!
-   //! <b>Complexity</b>: Constant.
-   BOOST_CONTAINER_ATTRIBUTE_NODISCARD BOOST_CONTAINER_FORCEINLINE
-      const_reverse_iterator crbegin() const
-   { return const_reverse_iterator(cend()); }
-
-   //! <b>Effects</b>: Returns a const_reverse_iterator pointing to the end
-   //! of the reversed container.
-   //!
-   //! <b>Throws</b>: Nothing.
-   //!
-   //! <b>Complexity</b>: Constant.
-   BOOST_CONTAINER_ATTRIBUTE_NODISCARD BOOST_CONTAINER_FORCEINLINE
-      const_reverse_iterator crend() const
-   { return const_reverse_iterator(cbegin()); }
-
-   BOOST_CONTAINER_ATTRIBUTE_NODISCARD BOOST_CONTAINER_FORCEINLINE
-      bool empty() const
-   {  return !this->size();  }
-
-   BOOST_CONTAINER_ATTRIBUTE_NODISCARD BOOST_CONTAINER_FORCEINLINE
-      size_type size() const
-   {  return this->icont().size();   }
-
-   BOOST_CONTAINER_ATTRIBUTE_NODISCARD BOOST_CONTAINER_FORCEINLINE
-      size_type max_size() const
-   {  return AllocHolder::max_size();  }
-
-   BOOST_CONTAINER_FORCEINLINE void swap(ThisType& x)
-      BOOST_NOEXCEPT_IF(  allocator_traits_type::is_always_equal::value
-                                 && boost::container::dtl::is_nothrow_swappable<Compare>::value )
-   {  AllocHolder::swap(x);   }
-
-   public:
-
-   typedef typename Icont::insert_commit_data insert_commit_data;
-
-   // insert/erase
-   std::pair<iterator,bool> insert_unique_check
-      (const key_type& key, insert_commit_data &data)
-   {
-      std::pair<iiterator, bool> ret =
-         this->icont().insert_unique_check(key, data);
-      return std::pair<iterator, bool>(iterator(ret.first), ret.second);
-   }
-
-   std::pair<iterator,bool> insert_unique_check
-      (const_iterator hint, const key_type& key, insert_commit_data &data)
-   {
-      BOOST_ASSERT((priv_is_linked)(hint));
-      std::pair<iiterator, bool> ret =
-         this->icont().insert_unique_check(hint.get(), key, data);
-      return std::pair<iterator, bool>(iterator(ret.first), ret.second);
-   }
-
-   template<class MovableConvertible>
-   iterator insert_unique_commit
-      (BOOST_FWD_REF(MovableConvertible) v, insert_commit_data &data)
-   {
-      NodePtr tmp = AllocHolder::create_node(boost::forward<MovableConvertible>(v));
-      scoped_node_destroy_deallocator<NodeAlloc> destroy_deallocator(tmp, this->node_alloc());
-      iterator ret(this->icont().insert_unique_commit(*tmp, data));
-      destroy_deallocator.release();
-      return ret;
-   }
-
-   template<class MovableConvertible>
-   std::pair<iterator,bool> insert_unique_convertible(BOOST_FWD_REF(MovableConvertible) v)
-   {
-      insert_commit_data data;
-      std::pair<iterator,bool> ret =
-         this->insert_unique_check(key_of_value_t()(v), data);
-      if(ret.second){
-         ret.first = this->insert_unique_commit(boost::forward<MovableConvertible>(v), data);
-      }
-      return ret;
-   }
-
-   template<class MovableConvertible>
-   iterator insert_unique_hint_convertible(const_iterator hint, BOOST_FWD_REF(MovableConvertible) v)
-   {
-      BOOST_ASSERT((priv_is_linked)(hint));
-      insert_commit_data data;
-      std::pair<iterator,bool> ret =
-         this->insert_unique_check(hint, key_of_value_t()(v), data);
-      if(!ret.second)
-         return ret.first;
-      return this->insert_unique_commit(boost::forward<MovableConvertible>(v), data);
-   }
-
-
-   private:
-
-   template<class KeyConvertible, class M>
-   iiterator priv_insert_or_assign_commit
-      (BOOST_FWD_REF(KeyConvertible) key, BOOST_FWD_REF(M) obj, insert_commit_data &data)
-   {
-      NodePtr tmp = AllocHolder::create_node(boost::forward<KeyConvertible>(key), boost::forward<M>(obj));
-      scoped_node_destroy_deallocator<NodeAlloc> destroy_deallocator(tmp, this->node_alloc());
-      iiterator ret(this->icont().insert_unique_commit(*tmp, data));
-      destroy_deallocator.release();
-      return ret;
-   }
-
-   bool priv_is_linked(const_iterator const position) const
-   {
-      iiterator const cur(position.get());
-      return   cur == this->icont().end() ||
-               cur == this->icont().root() ||
-               iiterator(cur).go_parent().go_left()  == cur ||
-               iiterator(cur).go_parent().go_right() == cur;
-   }
-
-   template<class MovableConvertible>
-   void push_back_impl(BOOST_FWD_REF(MovableConvertible) v)
-   {
-      NodePtr tmp(AllocHolder::create_node(boost::forward<MovableConvertible>(v)));
-      //push_back has no-throw guarantee so avoid any deallocator/destroyer
-      this->icont().push_back(*tmp);
-   }
-
-   std::pair<iterator, bool> emplace_unique_node(NodePtr p)
-   {
-      value_type &v = p->get_data();
-      insert_commit_data data;
-      scoped_node_destroy_deallocator<NodeAlloc> destroy_deallocator(p, this->node_alloc());
-      std::pair<iterator,bool> ret =
-         this->insert_unique_check(key_of_value_t()(v), data);
-      if(!ret.second){
-         return ret;
-      }
-      //No throw insertion part, release rollback
-      destroy_deallocator.release();
-      return std::pair<iterator,bool>
-         ( iterator(this->icont().insert_unique_commit(*p, data))
-         , true );
-   }
-
-   iterator emplace_hint_unique_node(const_iterator hint, NodePtr p)
-   {
-      BOOST_ASSERT((priv_is_linked)(hint));
-      value_type &v = p->get_data();
-      insert_commit_data data;
-      std::pair<iterator,bool> ret =
-         this->insert_unique_check(hint, key_of_value_t()(v), data);
-      if(!ret.second){
-         //Destroy unneeded node
-         Destroyer(this->node_alloc())(p);
-         return ret.first;
-      }
-      return iterator(this->icont().insert_unique_commit(*p, data));
-   }
-
-   public:
-
-   #if !defined(BOOST_NO_CXX11_VARIADIC_TEMPLATES)
-
-   template <class... Args>
-   BOOST_CONTAINER_FORCEINLINE std::pair<iterator, bool> emplace_unique(BOOST_FWD_REF(Args)... args)
-   {  return this->emplace_unique_node(AllocHolder::create_node(boost::forward<Args>(args)...));   }
-
-   template <class... Args>
-   BOOST_CONTAINER_FORCEINLINE iterator emplace_hint_unique(const_iterator hint, BOOST_FWD_REF(Args)... args)
-   {  return this->emplace_hint_unique_node(hint, AllocHolder::create_node(boost::forward<Args>(args)...));   }
-
-   template <class... Args>
-   iterator emplace_equal(BOOST_FWD_REF(Args)... args)
-   {
-      NodePtr tmp(AllocHolder::create_node(boost::forward<Args>(args)...));
-      scoped_node_destroy_deallocator<NodeAlloc> destroy_deallocator(tmp, this->node_alloc());
-      iterator ret(this->icont().insert_equal(this->icont().end(), *tmp));
-      destroy_deallocator.release();
-      return ret;
-   }
-
-   template <class... Args>
-   iterator emplace_hint_equal(const_iterator hint, BOOST_FWD_REF(Args)... args)
-   {
-      BOOST_ASSERT((priv_is_linked)(hint));
-      NodePtr tmp(AllocHolder::create_node(boost::forward<Args>(args)...));
-      scoped_node_destroy_deallocator<NodeAlloc> destroy_deallocator(tmp, this->node_alloc());
-      iterator ret(this->icont().insert_equal(hint.get(), *tmp));
-      destroy_deallocator.release();
-      return ret;
-   }
-
-   template <class KeyType, class... Args>
-   BOOST_CONTAINER_FORCEINLINE std::pair<iterator, bool> try_emplace
-      (const_iterator hint, BOOST_FWD_REF(KeyType) key, BOOST_FWD_REF(Args)... args)
-   {
-      insert_commit_data data;
-      const key_type & k = key;  //Support emulated rvalue references
-      std::pair<iiterator, bool> ret =
-         hint == const_iterator() ? this->icont().insert_unique_check(            k, data)
-                                  : this->icont().insert_unique_check(hint.get(), k, data);
-      if(ret.second){
-         ret.first = this->icont().insert_unique_commit
-            (*AllocHolder::create_node(try_emplace_t(), boost::forward<KeyType>(key), boost::forward<Args>(args)...), data);
-      }
-      return std::pair<iterator, bool>(iterator(ret.first), ret.second);
-   }
-
-   #else // !defined(BOOST_NO_CXX11_VARIADIC_TEMPLATES)
-
-   #define BOOST_CONTAINER_TREE_EMPLACE_CODE(N) \
-   BOOST_MOVE_TMPL_LT##N BOOST_MOVE_CLASS##N BOOST_MOVE_GT##N \
-   std::pair<iterator, bool> emplace_unique(BOOST_MOVE_UREF##N)\
-   {  return this->emplace_unique_node(AllocHolder::create_node(BOOST_MOVE_FWD##N));  }\
-   \
-   BOOST_MOVE_TMPL_LT##N BOOST_MOVE_CLASS##N BOOST_MOVE_GT##N \
-   iterator emplace_hint_unique(const_iterator hint BOOST_MOVE_I##N BOOST_MOVE_UREF##N)\
-   {  return this->emplace_hint_unique_node(hint, AllocHolder::create_node(BOOST_MOVE_FWD##N)); }\
-   \
-   BOOST_MOVE_TMPL_LT##N BOOST_MOVE_CLASS##N BOOST_MOVE_GT##N \
-   iterator emplace_equal(BOOST_MOVE_UREF##N)\
-   {\
-      NodePtr tmp(AllocHolder::create_node(BOOST_MOVE_FWD##N));\
-      scoped_node_destroy_deallocator<NodeAlloc> destroy_deallocator(tmp, this->node_alloc());\
-      iterator ret(this->icont().insert_equal(this->icont().end(), *tmp));\
-      destroy_deallocator.release();\
-      return ret;\
-   }\
-   \
-   BOOST_MOVE_TMPL_LT##N BOOST_MOVE_CLASS##N BOOST_MOVE_GT##N \
-   iterator emplace_hint_equal(const_iterator hint BOOST_MOVE_I##N BOOST_MOVE_UREF##N)\
-   {\
-      BOOST_ASSERT((priv_is_linked)(hint));\
-      NodePtr tmp(AllocHolder::create_node(BOOST_MOVE_FWD##N));\
-      scoped_node_destroy_deallocator<NodeAlloc> destroy_deallocator(tmp, this->node_alloc());\
-      iterator ret(this->icont().insert_equal(hint.get(), *tmp));\
-      destroy_deallocator.release();\
-      return ret;\
-   }\
-   \
-   template <class KeyType BOOST_MOVE_I##N BOOST_MOVE_CLASS##N>\
-   BOOST_CONTAINER_FORCEINLINE std::pair<iterator, bool>\
-      try_emplace(const_iterator hint, BOOST_FWD_REF(KeyType) key BOOST_MOVE_I##N BOOST_MOVE_UREF##N)\
-   {\
-      insert_commit_data data;\
-      const key_type & k = key;\
-      std::pair<iiterator, bool> ret =\
-         hint == const_iterator() ? this->icont().insert_unique_check(            k, data)\
-                                  : this->icont().insert_unique_check(hint.get(), k, data);\
-      if(ret.second){\
-         ret.first = this->icont().insert_unique_commit\
-            (*AllocHolder::create_node(try_emplace_t(), boost::forward<KeyType>(key) BOOST_MOVE_I##N BOOST_MOVE_FWD##N), data);\
-      }\
-      return std::pair<iterator, bool>(iterator(ret.first), ret.second);\
-   }\
-   //
-   BOOST_MOVE_ITERATE_0TO9(BOOST_CONTAINER_TREE_EMPLACE_CODE)
-   #undef BOOST_CONTAINER_TREE_EMPLACE_CODE
-
-   #endif   // !defined(BOOST_NO_CXX11_VARIADIC_TEMPLATES)
-
-   //BOOST_MOVE_CONVERSION_AWARE_CATCH_1ARG(insert_unique, value_type, iterator, this->insert_unique_hint_convertible, const_iterator, const_iterator)
-
-   template <class InputIterator>
-   void insert_unique_range(InputIterator first, InputIterator last)
-   {
-      for( ; first != last; ++first)
-         this->insert_unique_convertible(*first);
-   }
-
-   template<class MovableConvertible>
-   iterator insert_equal_convertible(BOOST_FWD_REF(MovableConvertible) v)
-   {
-      NodePtr tmp(AllocHolder::create_node(boost::forward<MovableConvertible>(v)));
-      scoped_node_destroy_deallocator<NodeAlloc> destroy_deallocator(tmp, this->node_alloc());
-      iterator ret(this->icont().insert_equal(this->icont().end(), *tmp));
-      destroy_deallocator.release();
-      return ret;
-   }
-
-   template<class MovableConvertible>
-   iterator insert_equal_hint_convertible(const_iterator hint, BOOST_FWD_REF(MovableConvertible) v)
-   {
-      BOOST_ASSERT((priv_is_linked)(hint));
-      NodePtr tmp(AllocHolder::create_node(boost::forward<MovableConvertible>(v)));
-      scoped_node_destroy_deallocator<NodeAlloc> destroy_deallocator(tmp, this->node_alloc());
-      iterator ret(this->icont().insert_equal(hint.get(), *tmp));
-      destroy_deallocator.release();
-      return ret;
-   }
-
-   BOOST_MOVE_CONVERSION_AWARE_CATCH_1ARG
-      (insert_equal, value_type, iterator, this->insert_equal_hint_convertible, const_iterator, const_iterator)
-
-   template <class InputIterator>
-   void insert_equal_range(InputIterator first, InputIterator last)
-   {
-      for( ; first != last; ++first)
-         this->insert_equal_convertible(*first);
-   }
-
-   template<class KeyType, class M>
-   std::pair<iterator, bool> insert_or_assign(const_iterator hint, BOOST_FWD_REF(KeyType) key, BOOST_FWD_REF(M) obj)
-   {
-      insert_commit_data data;
-      const key_type & k = key;  //Support emulated rvalue references
-      std::pair<iiterator, bool> ret =
-         hint == const_iterator() ? this->icont().insert_unique_check(k, data)
-                                  : this->icont().insert_unique_check(hint.get(), k, data);
-      if(ret.second){
-         ret.first = this->priv_insert_or_assign_commit(boost::forward<KeyType>(key), boost::forward<M>(obj), data);
-      }
-      else{
-         ret.first->get_data().second = boost::forward<M>(obj);
-      }
-      return std::pair<iterator, bool>(iterator(ret.first), ret.second);
-   }
-
-   iterator erase(const_iterator position)
-   {
-      BOOST_ASSERT(position != this->cend() && (priv_is_linked)(position));
-      return iterator(this->icont().erase_and_dispose(position.get(), Destroyer(this->node_alloc())));
-   }
-
-   BOOST_CONTAINER_FORCEINLINE size_type erase(const key_type& k)
-   {  return AllocHolder::erase_key(k, alloc_version()); }
-
-   size_type erase_unique(const key_type& k)
-   {
-      iterator i = this->find(k);
-      size_type ret = static_cast<size_type>(i != this->end());
-      if (ret)
-         this->erase(i);
-      return ret;
-   }
-
-   iterator erase(const_iterator first, const_iterator last)
-   {
-      BOOST_ASSERT(first == last || (first != this->cend() && (priv_is_linked)(first)));
-      BOOST_ASSERT(first == last || (priv_is_linked)(last));
-      return iterator(AllocHolder::erase_range(first.get(), last.get(), alloc_version()));
-   }
-
-   node_type extract(const key_type& k)
-   {
-      iterator const it = this->find(k);
-      if(this->end() != it){
-         return this->extract(it);
-      }
-      return node_type();
-   }
-
-   node_type extract(const_iterator position)
-   {
-      BOOST_ASSERT(position != this->cend() && (priv_is_linked)(position));
-      iiterator const iit(position.get());
-      this->icont().erase(iit);
-      return node_type(iit.operator->(), this->node_alloc());
-   }
-
-   insert_return_type insert_unique_node(BOOST_RV_REF_BEG_IF_CXX11 node_type BOOST_RV_REF_END_IF_CXX11 nh)
-   {
-      return this->insert_unique_node(this->end(), boost::move(nh));
-   }
-
-   insert_return_type insert_unique_node(const_iterator hint, BOOST_RV_REF_BEG_IF_CXX11 node_type BOOST_RV_REF_END_IF_CXX11 nh)
-   {
-      insert_return_type irt; //inserted == false, node.empty()
-      if(!nh.empty()){
-         insert_commit_data data;
-         std::pair<iterator,bool> ret =
-            this->insert_unique_check(hint, key_of_value_t()(nh.value()), data);
-         if(ret.second){
-            irt.inserted = true;
-            irt.position = iterator(this->icont().insert_unique_commit(*nh.get(), data));
-            nh.release();
-         }
-         else{
-            irt.position = ret.first;
-            irt.node = boost::move(nh);
-         }
-      }
-      else{
-         irt.position = this->end();
-      }
-      return BOOST_MOVE_RET(insert_return_type, irt);
-   }
-
-   iterator insert_equal_node(BOOST_RV_REF_BEG_IF_CXX11 node_type BOOST_RV_REF_END_IF_CXX11 nh)
-   {
-      if(nh.empty()){
-         return this->end();
-      }
-      else{
-         NodePtr const p(nh.release());
-         return iterator(this->icont().insert_equal(*p));
-      }
-   }
-
-   iterator insert_equal_node(const_iterator hint, BOOST_RV_REF_BEG_IF_CXX11 node_type BOOST_RV_REF_END_IF_CXX11 nh)
-   {
-      if(nh.empty()){
-         return this->end();
-      }
-      else{
-         NodePtr const p(nh.release());
-         return iterator(this->icont().insert_equal(hint.get(), *p));
-      }
-   }
-
-   template<class C2>
-   BOOST_CONTAINER_FORCEINLINE void merge_unique(tree<T, KeyOfValue, C2, Allocator, Options>& source)
-   {  return this->icont().merge_unique(source.icont()); }
-
-   template<class C2>
-   BOOST_CONTAINER_FORCEINLINE void merge_equal(tree<T, KeyOfValue, C2, Allocator, Options>& source)
-   {  return this->icont().merge_equal(source.icont());  }
-   BOOST_CONTAINER_FORCEINLINE void clear()
-   {  AllocHolder::clear(alloc_version());  }
-
-   // search operations. Const and non-const overloads even if no iterator is returned
-   // so splay implementations can to their rebalancing when searching in non-const versions
-   BOOST_CONTAINER_ATTRIBUTE_NODISCARD BOOST_CONTAINER_FORCEINLINE
-      iterator find(const key_type& k)
-   {  return iterator(this->icont().find(k));  }
-
-   BOOST_CONTAINER_ATTRIBUTE_NODISCARD BOOST_CONTAINER_FORCEINLINE
-      const_iterator find(const key_type& k) const
-   {  return const_iterator(this->non_const_icont().find(k));  }
-
-   template <class K>
-   BOOST_CONTAINER_ATTRIBUTE_NODISCARD BOOST_CONTAINER_FORCEINLINE
-      typename dtl::enable_if_transparent<key_compare, K, iterator>::type
-         find(const K& k)
-   {  return iterator(this->icont().find(k, KeyNodeCompare()));  }
-
-   template <class K>
-   BOOST_CONTAINER_ATTRIBUTE_NODISCARD BOOST_CONTAINER_FORCEINLINE
-      typename dtl::enable_if_transparent<key_compare, K, const_iterator>::type
-         find(const K& k) const
-   {  return const_iterator(this->non_const_icont().find(k, KeyNodeCompare()));  }
-
-   BOOST_CONTAINER_ATTRIBUTE_NODISCARD BOOST_CONTAINER_FORCEINLINE
-      size_type count(const key_type& k) const
-   {  return size_type(this->icont().count(k)); }
-
-   template <class K>
-   BOOST_CONTAINER_ATTRIBUTE_NODISCARD BOOST_CONTAINER_FORCEINLINE
-      typename dtl::enable_if_transparent<key_compare, K, size_type>::type
-         count(const K& k) const
-   {  return size_type(this->icont().count(k, KeyNodeCompare())); }
-
-   BOOST_CONTAINER_ATTRIBUTE_NODISCARD BOOST_CONTAINER_FORCEINLINE
-      bool contains(const key_type& x) const
-   {  return this->find(x) != this->cend();  }
-
-   template<typename K>
-   BOOST_CONTAINER_ATTRIBUTE_NODISCARD BOOST_CONTAINER_FORCEINLINE
-      typename dtl::enable_if_transparent<key_compare, K, bool>::type
-         contains(const K& x) const
-   {  return this->find(x) != this->cend();  }
-
-   BOOST_CONTAINER_ATTRIBUTE_NODISCARD BOOST_CONTAINER_FORCEINLINE
-      iterator lower_bound(const key_type& k)
-   {  return iterator(this->icont().lower_bound(k));  }
-
-   BOOST_CONTAINER_ATTRIBUTE_NODISCARD BOOST_CONTAINER_FORCEINLINE
-      const_iterator lower_bound(const key_type& k) const
-   {  return const_iterator(this->non_const_icont().lower_bound(k));  }
-
-   template <class K>
-   BOOST_CONTAINER_ATTRIBUTE_NODISCARD BOOST_CONTAINER_FORCEINLINE
-      typename dtl::enable_if_transparent<key_compare, K, iterator>::type
-         lower_bound(const K& k)
-   {  return iterator(this->icont().lower_bound(k, KeyNodeCompare()));  }
-
-   template <class K>
-   BOOST_CONTAINER_ATTRIBUTE_NODISCARD BOOST_CONTAINER_FORCEINLINE
-      typename dtl::enable_if_transparent<key_compare, K, const_iterator>::type
-         lower_bound(const K& k) const
-   {  return const_iterator(this->non_const_icont().lower_bound(k, KeyNodeCompare()));  }
-
-   BOOST_CONTAINER_ATTRIBUTE_NODISCARD BOOST_CONTAINER_FORCEINLINE
-      iterator upper_bound(const key_type& k)
-   {  return iterator(this->icont().upper_bound(k));   }
-
-   BOOST_CONTAINER_ATTRIBUTE_NODISCARD BOOST_CONTAINER_FORCEINLINE
-      const_iterator upper_bound(const key_type& k) const
-   {  return const_iterator(this->non_const_icont().upper_bound(k));  }
-
-   template <class K>
-   BOOST_CONTAINER_ATTRIBUTE_NODISCARD BOOST_CONTAINER_FORCEINLINE
-      typename dtl::enable_if_transparent<key_compare, K, iterator>::type
-         upper_bound(const K& k)
-   {  return iterator(this->icont().upper_bound(k, KeyNodeCompare()));   }
-
-   template <class K>
-   BOOST_CONTAINER_ATTRIBUTE_NODISCARD BOOST_CONTAINER_FORCEINLINE
-      typename dtl::enable_if_transparent<key_compare, K, const_iterator>::type
-         upper_bound(const K& k) const
-   {  return const_iterator(this->non_const_icont().upper_bound(k, KeyNodeCompare()));  }
-
-   BOOST_CONTAINER_ATTRIBUTE_NODISCARD BOOST_CONTAINER_FORCEINLINE
-      std::pair<iterator,iterator> equal_range(const key_type& k)
-   {
-      std::pair<iiterator, iiterator> ret = this->icont().equal_range(k);
-      return std::pair<iterator,iterator>(iterator(ret.first), iterator(ret.second));
-   }
-
-   BOOST_CONTAINER_ATTRIBUTE_NODISCARD BOOST_CONTAINER_FORCEINLINE
-      std::pair<const_iterator, const_iterator> equal_range(const key_type& k) const
-   {
-      std::pair<iiterator, iiterator> ret =
-         this->non_const_icont().equal_range(k);
-      return std::pair<const_iterator,const_iterator>
-         (const_iterator(ret.first), const_iterator(ret.second));
-   }
-
-   template <class K>
-   BOOST_CONTAINER_ATTRIBUTE_NODISCARD BOOST_CONTAINER_FORCEINLINE
-      typename dtl::enable_if_transparent<key_compare, K, std::pair<iterator,iterator> >::type
-         equal_range(const K& k)
-   {
-      std::pair<iiterator, iiterator> ret =
-         this->icont().equal_range(k, KeyNodeCompare());
-      return std::pair<iterator,iterator>(iterator(ret.first), iterator(ret.second));
-   }
-
-   template <class K>
-   BOOST_CONTAINER_ATTRIBUTE_NODISCARD BOOST_CONTAINER_FORCEINLINE
-      typename dtl::enable_if_transparent<key_compare, K, std::pair<const_iterator, const_iterator> >::type
-         equal_range(const K& k) const
-   {
-      std::pair<iiterator, iiterator> ret =
-         this->non_const_icont().equal_range(k, KeyNodeCompare());
-      return std::pair<const_iterator,const_iterator>
-         (const_iterator(ret.first), const_iterator(ret.second));
-   }
-
-   BOOST_CONTAINER_ATTRIBUTE_NODISCARD BOOST_CONTAINER_FORCEINLINE
-      std::pair<iterator,iterator> lower_bound_range(const key_type& k)
-   {
-      std::pair<iiterator, iiterator> ret =
-         this->icont().lower_bound_range(k);
-      return std::pair<iterator,iterator>(iterator(ret.first), iterator(ret.second));
-   }
-
-   BOOST_CONTAINER_ATTRIBUTE_NODISCARD BOOST_CONTAINER_FORCEINLINE
-      std::pair<const_iterator, const_iterator> lower_bound_range(const key_type& k) const
-   {
-      std::pair<iiterator, iiterator> ret =
-         this->non_const_icont().lower_bound_range(k);
-      return std::pair<const_iterator,const_iterator>
-         (const_iterator(ret.first), const_iterator(ret.second));
-   }
-
-   template <class K>
-   BOOST_CONTAINER_ATTRIBUTE_NODISCARD BOOST_CONTAINER_FORCEINLINE
-      typename dtl::enable_if_transparent<key_compare, K, std::pair<iterator,iterator> >::type
-         lower_bound_range(const K& k)
-   {
-      std::pair<iiterator, iiterator> ret =
-         this->icont().lower_bound_range(k, KeyNodeCompare());
-      return std::pair<iterator,iterator>(iterator(ret.first), iterator(ret.second));
-   }
-
-   template <class K>
-   BOOST_CONTAINER_ATTRIBUTE_NODISCARD BOOST_CONTAINER_FORCEINLINE
-      typename dtl::enable_if_transparent<key_compare, K, std::pair<const_iterator, const_iterator> >::type
-         lower_bound_range(const K& k) const
-   {
-      std::pair<iiterator, iiterator> ret =
-         this->non_const_icont().lower_bound_range(k, KeyNodeCompare());
-      return std::pair<const_iterator,const_iterator>
-         (const_iterator(ret.first), const_iterator(ret.second));
-   }
-
-   BOOST_CONTAINER_FORCEINLINE void rebalance()
-   {  intrusive_tree_proxy_t::rebalance(this->icont());   }
-
-   BOOST_CONTAINER_ATTRIBUTE_NODISCARD BOOST_CONTAINER_FORCEINLINE
-      friend bool operator==(const tree& x, const tree& y)
-   {  return x.size() == y.size() && ::boost::container::algo_equal(x.begin(), x.end(), y.begin());  }
-
-   BOOST_CONTAINER_ATTRIBUTE_NODISCARD BOOST_CONTAINER_FORCEINLINE
-      friend bool operator<(const tree& x, const tree& y)
-   {  return ::boost::container::algo_lexicographical_compare(x.begin(), x.end(), y.begin(), y.end());  }
-
-   BOOST_CONTAINER_ATTRIBUTE_NODISCARD BOOST_CONTAINER_FORCEINLINE
-      friend bool operator!=(const tree& x, const tree& y)
-   {  return !(x == y);  }
-
-   BOOST_CONTAINER_ATTRIBUTE_NODISCARD BOOST_CONTAINER_FORCEINLINE
-      friend bool operator>(const tree& x, const tree& y)
-   {  return y < x;  }
-
-   BOOST_CONTAINER_ATTRIBUTE_NODISCARD BOOST_CONTAINER_FORCEINLINE
-      friend bool operator<=(const tree& x, const tree& y)
-   {  return !(y < x);  }
-
-   BOOST_CONTAINER_ATTRIBUTE_NODISCARD BOOST_CONTAINER_FORCEINLINE
-      friend bool operator>=(const tree& x, const tree& y)
-   {  return !(x < y);  }
-
-   BOOST_CONTAINER_FORCEINLINE friend void swap(tree& x, tree& y)
-      BOOST_NOEXCEPT_IF(  allocator_traits_type::is_always_equal::value
-                                 && boost::container::dtl::is_nothrow_swappable<Compare>::value )
-   {  x.swap(y);  }
-};
-
-} //namespace dtl {
-} //namespace container {
-
-template <class T>
-struct has_trivial_destructor_after_move;
-
-//!has_trivial_destructor_after_move<> == true_type
-//!specialization for optimizations
-template <class T, class KeyOfValue, class Compare, class Allocator, class Options>
-struct has_trivial_destructor_after_move
-   < 
-      ::boost::container::dtl::tree
-         <T, KeyOfValue, Compare, Allocator, Options>
-   >
-{
-   typedef typename ::boost::container::dtl::tree<T, KeyOfValue, Compare, Allocator, Options>::allocator_type allocator_type;
-   typedef typename ::boost::container::allocator_traits<allocator_type>::pointer pointer;
-   static const bool value = ::boost::has_trivial_destructor_after_move<allocator_type>::value &&
-                             ::boost::has_trivial_destructor_after_move<pointer>::value &&
-                             ::boost::has_trivial_destructor_after_move<Compare>::value;
-};
-
-} //namespace boost  {
-
-#include <boost/container/detail/config_end.hpp>
-
-#endif //BOOST_CONTAINER_TREE_HPP
diff --git a/src/boost/container/detail/type_traits.hpp b/src/boost/container/detail/type_traits.hpp
deleted file mode 100644
index ffa061b5..00000000
--- a/src/boost/container/detail/type_traits.hpp
+++ /dev/null
@@ -1,75 +0,0 @@
-//////////////////////////////////////////////////////////////////////////////
-// (C) Copyright John Maddock 2000.
-// (C) Copyright Ion Gaztanaga 2005-2015.
-//
-// Distributed under the Boost 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.
-//
-// The alignment and Type traits implementation comes from
-// John Maddock's TypeTraits library.
-//
-// Some other tricks come from Howard Hinnant's papers and StackOverflow replies
-//////////////////////////////////////////////////////////////////////////////
-#ifndef BOOST_CONTAINER_CONTAINER_DETAIL_TYPE_TRAITS_HPP
-#define BOOST_CONTAINER_CONTAINER_DETAIL_TYPE_TRAITS_HPP
-
-#ifndef BOOST_CONFIG_HPP
-#  include <boost/config.hpp>
-#endif
-
-#if defined(BOOST_HAS_PRAGMA_ONCE)
-#  pragma once
-#endif
-
-#include <boost/move/detail/type_traits.hpp>
-
-namespace boost {
-namespace container {
-namespace dtl {
-
-using ::boost::move_detail::enable_if;
-using ::boost::move_detail::enable_if_and;
-using ::boost::move_detail::is_same;
-using ::boost::move_detail::is_different;
-using ::boost::move_detail::is_pointer;
-using ::boost::move_detail::add_reference;
-using ::boost::move_detail::add_const;
-using ::boost::move_detail::add_const_reference;
-using ::boost::move_detail::remove_const;
-using ::boost::move_detail::remove_reference;
-using ::boost::move_detail::remove_cvref;
-using ::boost::move_detail::make_unsigned;
-using ::boost::move_detail::is_floating_point;
-using ::boost::move_detail::is_integral;
-using ::boost::move_detail::is_enum;
-using ::boost::move_detail::is_pod;
-using ::boost::move_detail::is_empty;
-using ::boost::move_detail::is_trivially_destructible;
-using ::boost::move_detail::is_trivially_default_constructible;
-using ::boost::move_detail::is_trivially_copy_constructible;
-using ::boost::move_detail::is_trivially_move_constructible;
-using ::boost::move_detail::is_trivially_copy_assignable;
-using ::boost::move_detail::is_trivially_move_assignable;
-using ::boost::move_detail::is_nothrow_default_constructible;
-using ::boost::move_detail::is_nothrow_copy_constructible;
-using ::boost::move_detail::is_nothrow_move_constructible;
-using ::boost::move_detail::is_nothrow_copy_assignable;
-using ::boost::move_detail::is_nothrow_move_assignable;
-using ::boost::move_detail::is_nothrow_swappable;
-using ::boost::move_detail::alignment_of;
-using ::boost::move_detail::aligned_storage;
-using ::boost::move_detail::nat;
-using ::boost::move_detail::nat2;
-using ::boost::move_detail::nat3;
-using ::boost::move_detail::natN;
-using ::boost::move_detail::max_align_t;
-using ::boost::move_detail::is_convertible;
-
-}  //namespace dtl {
-}  //namespace container {
-}  //namespace boost {
-
-#endif   //#ifndef BOOST_CONTAINER_CONTAINER_DETAIL_TYPE_TRAITS_HPP
diff --git a/src/boost/container/detail/value_functors.hpp b/src/boost/container/detail/value_functors.hpp
deleted file mode 100644
index 39fb37c3..00000000
--- a/src/boost/container/detail/value_functors.hpp
+++ /dev/null
@@ -1,32 +0,0 @@
-#ifndef BOOST_CONTAINER_DETAIL_VALUE_FUNCTORS_HPP
-#define BOOST_CONTAINER_DETAIL_VALUE_FUNCTORS_HPP
-///////////////////////////////////////////////////////////////////////////////
-//
-// (C) Copyright Ion Gaztanaga 2017-2017. Distributed under the Boost
-// 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.
-//
-///////////////////////////////////////////////////////////////////////////////
-
-#ifndef BOOST_CONFIG_HPP
-#  include <boost/config.hpp>
-#endif
-
-#if defined(BOOST_HAS_PRAGMA_ONCE)
-#  pragma once
-#endif
-
-#include <boost/intrusive/detail/value_functors.hpp>
-
-namespace boost {
-namespace container {
-
-using ::boost::intrusive::value_less;
-using ::boost::intrusive::value_equal;
-
-}  //namespace container {
-}  //namespace boost {
-
-#endif   //BOOST_CONTAINER_DETAIL_VALUE_FUNCTORS_HPP
diff --git a/src/boost/container/detail/value_init.hpp b/src/boost/container/detail/value_init.hpp
deleted file mode 100644
index 35b0aa11..00000000
--- a/src/boost/container/detail/value_init.hpp
+++ /dev/null
@@ -1,51 +0,0 @@
-//////////////////////////////////////////////////////////////////////////////
-//
-// (C) Copyright Ion Gaztanaga 2005-2013.
-//
-// Distributed under the Boost 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.
-//
-//////////////////////////////////////////////////////////////////////////////
-
-#ifndef BOOST_CONTAINER_DETAIL_VALUE_INIT_HPP
-#define BOOST_CONTAINER_DETAIL_VALUE_INIT_HPP
-
-#ifndef BOOST_CONFIG_HPP
-#  include <boost/config.hpp>
-#endif
-
-#if defined(BOOST_HAS_PRAGMA_ONCE)
-#  pragma once
-#endif
-
-#include <boost/container/detail/config_begin.hpp>
-#include <boost/container/detail/workaround.hpp>
-
-namespace boost {
-namespace container {
-namespace dtl {
-
-template<class T>
-struct value_init
-{
-   value_init()
-      : m_t()
-   {}
-
-   operator T &() { return m_t; }
-
-   T &get() { return m_t; }
-
-   T m_t;
-};
-
-}  //namespace dtl {
-}  //namespace container {
-}  //namespace boost {
-
-#include <boost/container/detail/config_end.hpp>
-
-#endif   //#ifndef BOOST_CONTAINER_DETAIL_VALUE_INIT_HPP
diff --git a/src/boost/container/detail/variadic_templates_tools.hpp b/src/boost/container/detail/variadic_templates_tools.hpp
deleted file mode 100644
index 4f16fb04..00000000
--- a/src/boost/container/detail/variadic_templates_tools.hpp
+++ /dev/null
@@ -1,163 +0,0 @@
-//////////////////////////////////////////////////////////////////////////////
-//
-// (C) Copyright Ion Gaztanaga 2008-2013. Distributed under the Boost
-// 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.
-//
-//////////////////////////////////////////////////////////////////////////////
-
-#ifndef BOOST_CONTAINER_DETAIL_VARIADIC_TEMPLATES_TOOLS_HPP
-#define BOOST_CONTAINER_DETAIL_VARIADIC_TEMPLATES_TOOLS_HPP
-
-#ifndef BOOST_CONFIG_HPP
-#  include <boost/config.hpp>
-#endif
-
-#if defined(BOOST_HAS_PRAGMA_ONCE)
-#  pragma once
-#endif
-
-#include <boost/container/detail/config_begin.hpp>
-#include <boost/container/detail/workaround.hpp>
-#include <boost/move/utility_core.hpp>
-
-#include <boost/container/detail/type_traits.hpp>
-#include <cstddef>   //std::size_t
-
-namespace boost {
-namespace container {
-namespace dtl {
-
-template<typename... Values>
-class tuple;
-
-template<> class tuple<>
-{};
-
-template<typename Head, typename... Tail>
-class tuple<Head, Tail...>
-   : private tuple<Tail...>
-{
-   typedef tuple<Tail...> inherited;
-
-   public:
-   tuple()
-      : inherited(), m_head()
-   {}
-
-   template<class U, class ...Args>
-   tuple(U &&u, Args && ...args)
-      : inherited(::boost::forward<Args>(args)...), m_head(::boost::forward<U>(u))
-   {}
-
-   // Construct tuple from another tuple.
-   template<typename... VValues>
-   tuple(const tuple<VValues...>& other)
-      : inherited(other.tail()), m_head(other.head())
-   {}
-
-   template<typename... VValues>
-   tuple& operator=(const tuple<VValues...>& other)
-   {
-      m_head = other.head();
-      tail() = other.tail();
-      return this;
-   }
-
-   typename add_reference<Head>::type head()             {  return m_head; }
-   typename add_reference<const Head>::type head() const {  return m_head; }
-
-   inherited& tail()             { return *this; }
-   const inherited& tail() const { return *this; }
-
-   protected:
-   Head m_head;
-};
-
-
-template<typename... Values>
-tuple<Values&&...> forward_as_tuple_impl(Values&&... values)
-{ return tuple<Values&&...>(::boost::forward<Values>(values)...); }
-
-template<int I, typename Tuple>
-struct tuple_element;
-
-template<int I, typename Head, typename... Tail>
-struct tuple_element<I, tuple<Head, Tail...> >
-{
-   typedef typename tuple_element<I-1, tuple<Tail...> >::type type;
-};
-
-template<typename Head, typename... Tail>
-struct tuple_element<0, tuple<Head, Tail...> >
-{
-   typedef Head type;
-};
-
-template<int I, typename Tuple>
-class get_impl;
-
-template<int I, typename Head, typename... Values>
-class get_impl<I, tuple<Head, Values...> >
-{
-   typedef typename tuple_element<I-1, tuple<Values...> >::type   Element;
-   typedef get_impl<I-1, tuple<Values...> >                       Next;
-
-   public:
-   typedef typename add_reference<Element>::type                  type;
-   typedef typename add_const_reference<Element>::type            const_type;
-   static type get(tuple<Head, Values...>& t)              { return Next::get(t.tail()); }
-   static const_type get(const tuple<Head, Values...>& t)  { return Next::get(t.tail()); }
-};
-
-template<typename Head, typename... Values>
-class get_impl<0, tuple<Head, Values...> >
-{
-   public:
-   typedef typename add_reference<Head>::type         type;
-   typedef typename add_const_reference<Head>::type   const_type;
-   static type       get(tuple<Head, Values...>& t)      { return t.head(); }
-   static const_type get(const tuple<Head, Values...>& t){ return t.head(); }
-};
-
-template<int I, typename... Values>
-typename get_impl<I, tuple<Values...> >::type get(tuple<Values...>& t)
-{  return get_impl<I, tuple<Values...> >::get(t);  }
-
-template<int I, typename... Values>
-typename get_impl<I, tuple<Values...> >::const_type get(const tuple<Values...>& t)
-{  return get_impl<I, tuple<Values...> >::get(t);  }
-
-////////////////////////////////////////////////////
-// Builds an index_tuple<0, 1, 2, ..., Num-1>, that will
-// be used to "unpack" into comma-separated values
-// in a function call.
-////////////////////////////////////////////////////
-
-template<std::size_t...> struct index_tuple{ typedef index_tuple type; };
-
-template<class S1, class S2> struct concat_index_tuple;
-
-template<std::size_t... I1, std::size_t... I2>
-struct concat_index_tuple<index_tuple<I1...>, index_tuple<I2...>>
-  : index_tuple<I1..., (sizeof...(I1)+I2)...>{};
-
-template<std::size_t N> struct build_number_seq;
-
-template<std::size_t N> 
-struct build_number_seq
-   : concat_index_tuple<typename build_number_seq<N/2>::type
-                       ,typename build_number_seq<N - N/2 >::type
-   >::type
-{};
-
-template<> struct build_number_seq<0> : index_tuple<>{};
-template<> struct build_number_seq<1> : index_tuple<0>{};
-
-}}}   //namespace boost { namespace container { namespace dtl {
-
-#include <boost/container/detail/config_end.hpp>
-
-#endif   //#ifndef BOOST_CONTAINER_DETAIL_VARIADIC_TEMPLATES_TOOLS_HPP
diff --git a/src/boost/container/detail/version_type.hpp b/src/boost/container/detail/version_type.hpp
deleted file mode 100644
index 389606a5..00000000
--- a/src/boost/container/detail/version_type.hpp
+++ /dev/null
@@ -1,101 +0,0 @@
-//////////////////////////////////////////////////////////////////////////////
-//
-// (C) Copyright Ion Gaztanaga 2005-2013. Distributed under the Boost
-// 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.
-//
-//////////////////////////////////////////////////////////////////////////////
-//
-//       This code comes from N1953 document by Howard E. Hinnant
-//
-//////////////////////////////////////////////////////////////////////////////
-
-
-#ifndef BOOST_CONTAINER_DETAIL_VERSION_TYPE_HPP
-#define BOOST_CONTAINER_DETAIL_VERSION_TYPE_HPP
-
-#ifndef BOOST_CONFIG_HPP
-#  include <boost/config.hpp>
-#endif
-
-#if defined(BOOST_HAS_PRAGMA_ONCE)
-#  pragma once
-#endif
-
-#include <boost/container/detail/config_begin.hpp>
-#include <boost/container/detail/workaround.hpp>
-
-#include <boost/container/detail/mpl.hpp>
-#include <boost/container/detail/type_traits.hpp>
-
-namespace boost{
-namespace container {
-namespace dtl {
-
-template <class T, unsigned V>
-struct version_type
-    : public dtl::integral_constant<unsigned, V>
-{
-    typedef T type;
-};
-
-namespace impl{
-
-template <class T>
-struct extract_version
-{
-   typedef typename T::version type;
-};
-
-template <class T>
-struct has_version
-{
-   private:
-   struct two {char _[2];};
-   template <class U> static two test(...);
-   template <class U> static char test(const typename U::version*);
-   public:
-   static const bool value = sizeof(test<T>(0)) == 1;
-   void dummy(){}
-};
-
-template <class T, bool = has_version<T>::value>
-struct version
-{
-   static const unsigned value = 1;
-};
-
-template <class T>
-struct version<T, true>
-{
-   static const unsigned value = extract_version<T>::type::value;
-};
-
-}  //namespace impl
-
-template <class T>
-struct version
-   : public dtl::integral_constant<unsigned, impl::version<T>::value>
-{};
-
-template<class T, unsigned N>
-struct is_version
-{
-   static const bool value =
-      is_same< typename version<T>::type, integral_constant<unsigned, N> >::value;
-};
-
-}  //namespace dtl {
-
-typedef dtl::integral_constant<unsigned, 0> version_0;
-typedef dtl::integral_constant<unsigned, 1> version_1;
-typedef dtl::integral_constant<unsigned, 2> version_2;
-
-}  //namespace container {
-}  //namespace boost{
-
-#include <boost/container/detail/config_end.hpp>
-
-#endif   //#define BOOST_CONTAINER_DETAIL_VERSION_TYPE_HPP
diff --git a/src/boost/container/detail/workaround.hpp b/src/boost/container/detail/workaround.hpp
deleted file mode 100644
index 64daa0c1..00000000
--- a/src/boost/container/detail/workaround.hpp
+++ /dev/null
@@ -1,190 +0,0 @@
-//////////////////////////////////////////////////////////////////////////////
-//
-// (C) Copyright Ion Gaztanaga 2005-2013. Distributed under the Boost
-// 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.
-//
-//////////////////////////////////////////////////////////////////////////////
-
-#ifndef BOOST_CONTAINER_DETAIL_WORKAROUND_HPP
-#define BOOST_CONTAINER_DETAIL_WORKAROUND_HPP
-
-#ifndef BOOST_CONFIG_HPP
-#  include <boost/config.hpp>
-#endif
-
-#if defined(BOOST_HAS_PRAGMA_ONCE)
-#  pragma once
-#endif
-
-#if    !defined(BOOST_NO_CXX11_RVALUE_REFERENCES) && !defined(BOOST_NO_CXX11_VARIADIC_TEMPLATES)\
-    && !defined(BOOST_INTERPROCESS_DISABLE_VARIADIC_TMPL)
-   #define BOOST_CONTAINER_PERFECT_FORWARDING
-#endif
-
-#if !defined(BOOST_NO_CXX11_VARIADIC_TEMPLATES) && defined(__GXX_EXPERIMENTAL_CXX0X__)\
-    && (__GNUC__*10000 + __GNUC_MINOR__*100 + __GNUC_PATCHLEVEL__ < 40700)
-   #define BOOST_CONTAINER_UNIMPLEMENTED_PACK_EXPANSION_TO_FIXED_LIST
-#endif
-
-#if defined(BOOST_GCC_VERSION)
-#  if (BOOST_GCC_VERSION < 40700) || !defined(BOOST_GCC_CXX11)
-#     define BOOST_CONTAINER_NO_CXX11_DELEGATING_CONSTRUCTORS
-#  endif
-#elif defined(BOOST_MSVC)
-#  if _MSC_FULL_VER < 180020827
-#     define BOOST_CONTAINER_NO_CXX11_DELEGATING_CONSTRUCTORS
-#  endif
-#elif defined(BOOST_CLANG)
-#  if !__has_feature(cxx_delegating_constructors)
-#     define BOOST_CONTAINER_NO_CXX11_DELEGATING_CONSTRUCTORS
-#  endif
-#endif
-
-#if defined(BOOST_MSVC) && (_MSC_VER < 1400)
-   #define BOOST_CONTAINER_TEMPLATED_CONVERSION_OPERATOR_BROKEN
-#endif
-
-#if !defined(BOOST_NO_CXX11_HDR_TUPLE) || (defined(BOOST_MSVC) && (BOOST_MSVC == 1700 || BOOST_MSVC == 1600))
-#define BOOST_CONTAINER_PAIR_TEST_HAS_HEADER_TUPLE
-#endif
-
-//Macros for documentation purposes. For code, expands to the argument
-#define BOOST_CONTAINER_IMPDEF(TYPE) TYPE
-#define BOOST_CONTAINER_SEEDOC(TYPE) TYPE
-
-//Macros for memset optimization. In most platforms
-//memsetting pointers and floatings is safe and faster.
-//
-//If your platform does not offer these guarantees
-//define these to value zero.
-#ifndef BOOST_CONTAINER_MEMZEROED_FLOATING_POINT_IS_NOT_ZERO
-#define BOOST_CONTAINER_MEMZEROED_FLOATING_POINT_IS_ZERO 1
-#endif
-
-#ifndef BOOST_CONTAINER_MEMZEROED_POINTER_IS_NOT_NULL
-#define BOOST_CONTAINER_MEMZEROED_POINTER_IS_NULL
-#endif
-
-#define BOOST_CONTAINER_DOC1ST(TYPE1, TYPE2) TYPE2
-#define BOOST_CONTAINER_I ,
-#define BOOST_CONTAINER_DOCIGN(T) T
-#define BOOST_CONTAINER_DOCONLY(T)
-
-/*
-   we need to import/export our code only if the user has specifically
-   asked for it by defining either BOOST_ALL_DYN_LINK if they want all boost
-   libraries to be dynamically linked, or BOOST_CONTAINER_DYN_LINK
-   if they want just this one to be dynamically liked:
-*/
-#if defined(BOOST_ALL_DYN_LINK) || defined(BOOST_CONTAINER_DYN_LINK)
-
-   /* export if this is our own source, otherwise import: */
-   #ifdef BOOST_CONTAINER_SOURCE
-   #  define BOOST_CONTAINER_DECL BOOST_SYMBOL_EXPORT
-   #else
-   #  define BOOST_CONTAINER_DECL BOOST_SYMBOL_IMPORT
-   
-   #endif  /* BOOST_CONTAINER_SOURCE */
-#else
-   #define BOOST_CONTAINER_DECL
-#endif  /* DYN_LINK */
-
-//#define BOOST_CONTAINER_DISABLE_FORCEINLINE
-
-#if defined(BOOST_CONTAINER_DISABLE_FORCEINLINE)
-   #define BOOST_CONTAINER_FORCEINLINE inline
-#elif defined(BOOST_CONTAINER_FORCEINLINE_IS_BOOST_FORCELINE)
-   #define BOOST_CONTAINER_FORCEINLINE BOOST_FORCEINLINE
-#elif defined(BOOST_MSVC) && (_MSC_VER <= 1900 || defined(_DEBUG))
-   //"__forceinline" and MSVC seems to have some bugs in old versions and in debug mode
-   #define BOOST_CONTAINER_FORCEINLINE inline
-#elif defined(BOOST_GCC) && ((__GNUC__ <= 5) || defined(__MINGW32__))
-   //Older GCCs and MinGw have problems with forceinline
-   #define BOOST_CONTAINER_FORCEINLINE inline
-#else
-   #define BOOST_CONTAINER_FORCEINLINE BOOST_FORCEINLINE
-#endif
-
-//#define BOOST_CONTAINER_DISABLE_NOINLINE
-
-#if defined(BOOST_CONTAINER_DISABLE_NOINLINE)
-   #define BOOST_CONTAINER_NOINLINE
-#else
-   #define BOOST_CONTAINER_NOINLINE BOOST_NOINLINE
-#endif
-
-
-#if !defined(__has_feature)
-#define BOOST_CONTAINER_HAS_FEATURE(feature) 0
-#else
-#define BOOST_CONTAINER_HAS_FEATURE(feature) __has_feature(feature)
-#endif
-
-//Detect address sanitizer
-#if defined(__SANITIZE_ADDRESS__) || BOOST_CONTAINER_HAS_FEATURE(address_sanitizer)
-#define BOOST_CONTAINER_ASAN
-#endif
-
-
-#if (BOOST_CXX_VERSION < 201703L) || !defined(__cpp_deduction_guides)
-   #define BOOST_CONTAINER_NO_CXX17_CTAD
-#endif
-
-#if defined(BOOST_CONTAINER_DISABLE_ATTRIBUTE_NODISCARD)
-   #define BOOST_CONTAINER_ATTRIBUTE_NODISCARD
-#else
-   #if   defined(BOOST_GCC) && ((BOOST_GCC < 100000) || (__cplusplus < 201703L))
-      //Avoid using it in C++ < 17 and GCC < 10 because it warns in SFINAE contexts
-      //(see https://gcc.gnu.org/bugzilla/show_bug.cgi?id=89070)
-      #define BOOST_CONTAINER_ATTRIBUTE_NODISCARD
-   #else
-      #define BOOST_CONTAINER_ATTRIBUTE_NODISCARD BOOST_ATTRIBUTE_NODISCARD
-   #endif
-#endif
-
-
-//Configuration options:
-
-//Define this to use std exception types instead of boost::container's own exception types
-//#define BOOST_CONTAINER_USE_STD_EXCEPTIONS
-
-
-namespace boost {
-namespace container {
-
-template <typename T1>
-BOOST_FORCEINLINE BOOST_CXX14_CONSTEXPR void ignore(T1 const&)
-{}
-
-}} //namespace boost::container {
-
-#if !(defined BOOST_NO_EXCEPTIONS)
-#    define BOOST_CONTAINER_TRY { try
-#    define BOOST_CONTAINER_CATCH(x) catch(x)
-#    define BOOST_CONTAINER_RETHROW throw;
-#    define BOOST_CONTAINER_CATCH_END }
-#else
-#    if !defined(BOOST_MSVC) || BOOST_MSVC >= 1900
-#        define BOOST_CONTAINER_TRY { if (true)
-#        define BOOST_CONTAINER_CATCH(x) else if (false)
-#    else
-// warning C4127: conditional expression is constant
-#        define BOOST_CONTAINER_TRY { \
-             __pragma(warning(push)) \
-             __pragma(warning(disable: 4127)) \
-             if (true) \
-             __pragma(warning(pop))
-#        define BOOST_CONTAINER_CATCH(x) else \
-             __pragma(warning(push)) \
-             __pragma(warning(disable: 4127)) \
-             if (false) \
-             __pragma(warning(pop))
-#    endif
-#    define BOOST_CONTAINER_RETHROW
-#    define BOOST_CONTAINER_CATCH_END }
-#endif
-
-#endif   //#ifndef BOOST_CONTAINER_DETAIL_WORKAROUND_HPP
diff --git a/src/boost/container/flat_map.hpp b/src/boost/container/flat_map.hpp
deleted file mode 100644
index cd86255f..00000000
--- a/src/boost/container/flat_map.hpp
+++ /dev/null
@@ -1,3067 +0,0 @@
-//////////////////////////////////////////////////////////////////////////////
-//
-// (C) Copyright Ion Gaztanaga 2005-2013. Distributed under the Boost
-// 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.
-//
-//////////////////////////////////////////////////////////////////////////////
-#ifndef BOOST_CONTAINER_FLAT_MAP_HPP
-#define BOOST_CONTAINER_FLAT_MAP_HPP
-
-#ifndef BOOST_CONFIG_HPP
-#  include <boost/config.hpp>
-#endif
-
-#if defined(BOOST_HAS_PRAGMA_ONCE)
-#  pragma once
-#endif
-
-#include <boost/container/detail/config_begin.hpp>
-#include <boost/container/detail/workaround.hpp>
-// container
-#include <boost/container/allocator_traits.hpp>
-#include <boost/container/container_fwd.hpp>
-#include <boost/container/new_allocator.hpp> //new_allocator
-#include <boost/container/throw_exception.hpp>
-// container/detail
-#include <boost/container/detail/flat_tree.hpp>
-#include <boost/container/detail/type_traits.hpp>
-#include <boost/container/detail/mpl.hpp>
-#include <boost/container/detail/algorithm.hpp> //equal()
-#include <boost/container/detail/container_or_allocator_rebind.hpp>
-// move
-#include <boost/move/utility_core.hpp>
-#include <boost/move/traits.hpp>
-// move/detail
-#if defined(BOOST_NO_CXX11_VARIADIC_TEMPLATES)
-#include <boost/move/detail/fwd_macros.hpp>
-#endif
-#include <boost/move/detail/move_helpers.hpp>
-#include <boost/move/detail/force_ptr.hpp>
-// intrusive
-#include <boost/intrusive/detail/minimal_pair_header.hpp>      //pair
-#include <boost/intrusive/detail/minimal_less_equal_header.hpp>//less, equal
-
-#if !defined(BOOST_NO_CXX11_HDR_INITIALIZER_LIST)
-#include <initializer_list>
-#endif
-
-namespace boost {
-namespace container {
-
-#ifndef BOOST_CONTAINER_DOXYGEN_INVOKED
-
-template <class Key, class T, class Compare, class AllocatorOrContainer>
-class flat_multimap;
-
-namespace dtl{
-
-template<class D, class S>
-BOOST_CONTAINER_FORCEINLINE static D &force(S &s)
-{  return *move_detail::force_ptr<D*>(&s); }
-
-template<class D, class S>
-BOOST_CONTAINER_FORCEINLINE static const D &force(const S &s)
-{  return *move_detail::force_ptr<const D*>(&s); }
-
-template<class D, class S>
-BOOST_CONTAINER_FORCEINLINE static D force_copy(const S &s)
-{
-   const D *const vp = move_detail::force_ptr<const D *>(&s);
-   D ret_val(*vp);
-   return ret_val;
-}
-
-}  //namespace dtl{
-
-#endif   //#ifndef BOOST_CONTAINER_DOXYGEN_INVOKED
-
-//! A flat_map is a kind of associative container that supports unique keys (contains at
-//! most one of each key value) and provides for fast retrieval of values of another
-//! type T based on the keys.
-//!
-//! A flat_map satisfies all of the requirements of a container, a reversible
-//! container and an associative container. A flat_map also provides
-//! most operations described for unique keys. For a
-//! flat_map<Key,T> the key_type is Key and the value_type is std::pair<Key,T>
-//! (unlike std::map<Key, T> which value_type is std::pair<<b>const</b> Key, T>).
-//!
-//! flat_map is similar to std::map but it's implemented by as an ordered sequence container.
-//! The underlying sequence container is by default <i>vector</i> but it can also work
-//! user-provided vector-like SequenceContainers (like <i>static_vector</i> or <i>small_vector</i>).
-//!
-//! Using vector-like sequence containers means that inserting a new element into a flat_map might invalidate
-//! previous iterators and references (unless that sequence container is <i>stable_vector</i> or a similar
-//! container that offers stable pointers and references). Similarly, erasing an element might invalidate
-//! iterators and references pointing to elements that come after (their keys are bigger) the erased element.
-//!
-//! This container provides random-access iterators.
-//!
-//! \tparam Key is the key_type of the map
-//! \tparam Value is the <code>mapped_type</code>
-//! \tparam Compare is the ordering function for Keys (e.g. <i>std::less<Key></i>).
-//! \tparam AllocatorOrContainer is either:
-//!   - The allocator to allocate <code>value_type</code>s (e.g. <i>allocator< std::pair<Key, T> > </i>).
-//!     (in this case <i>sequence_type</i> will be vector<value_type, AllocatorOrContainer>)
-//!   - The SequenceContainer to be used as the underlying <i>sequence_type</i>. It must be a vector-like
-//!     sequence container with random-access iterators.
-#ifdef BOOST_CONTAINER_DOXYGEN_INVOKED
-template <class Key, class T, class Compare = std::less<Key>, class AllocatorOrContainer = new_allocator< std::pair< Key, T> > >
-#else
-template <class Key, class T, class Compare, class AllocatorOrContainer>
-#endif
-class flat_map
-{
-   #ifndef BOOST_CONTAINER_DOXYGEN_INVOKED
-   private:
-   BOOST_COPYABLE_AND_MOVABLE(flat_map)
-   //This is the tree that we should store if pair was movable
-   typedef dtl::flat_tree<
-                           std::pair<Key, T>,
-                           dtl::select1st<Key>,
-                           Compare,
-                           AllocatorOrContainer> tree_t;
-
-   //This is the real tree stored here. It's based on a movable pair
-   typedef dtl::flat_tree<
-                           dtl::pair<Key, T>,
-                           dtl::select1st<Key>,
-                           Compare,
-                           typename dtl::container_or_allocator_rebind<AllocatorOrContainer, dtl::pair<Key, T> >::type
-                           > impl_tree_t;
-   impl_tree_t m_flat_tree;  // flat tree representing flat_map
-
-   typedef typename impl_tree_t::value_type              impl_value_type;
-   typedef typename impl_tree_t::const_iterator          impl_const_iterator;
-   typedef typename impl_tree_t::iterator                impl_iterator;
-   typedef typename impl_tree_t::allocator_type          impl_allocator_type;
-   #if !defined(BOOST_NO_CXX11_HDR_INITIALIZER_LIST)
-   typedef std::initializer_list<impl_value_type>        impl_initializer_list;
-   #endif
-
-   typedef dtl::flat_tree_value_compare
-      < Compare
-      , dtl::select1st<Key>
-      , std::pair<Key, T> >                              value_compare_t;
-   typedef typename tree_t::iterator                     iterator_t;
-   typedef typename tree_t::const_iterator               const_iterator_t;
-   typedef typename tree_t::reverse_iterator             reverse_iterator_t;
-   typedef typename tree_t::const_reverse_iterator       const_reverse_iterator_t;
-
-   public:
-   typedef typename impl_tree_t::stored_allocator_type   impl_stored_allocator_type;
-   typedef typename impl_tree_t::sequence_type           impl_sequence_type;
-
-   BOOST_CONTAINER_FORCEINLINE impl_tree_t &tree()
-   {  return m_flat_tree;  }
-
-   BOOST_CONTAINER_FORCEINLINE const impl_tree_t &tree() const
-   {  return m_flat_tree;  }
-
-   private:
-   typedef typename tree_t::get_stored_allocator_const_return_t         get_stored_allocator_const_return_t;
-   typedef typename tree_t::get_stored_allocator_noconst_return_t       get_stored_allocator_noconst_return_t;
-   typedef typename impl_tree_t::get_stored_allocator_const_return_t    impl_get_stored_allocator_const_return_t;
-   typedef typename impl_tree_t::get_stored_allocator_noconst_return_t  impl_get_stored_allocator_noconst_return_t;
-
-   #endif   //#ifndef BOOST_CONTAINER_DOXYGEN_INVOKED
-
-   public:
-
-   //////////////////////////////////////////////
-   //
-   //                    types
-   //
-   //////////////////////////////////////////////
-   typedef Key                                                                      key_type;
-   typedef T                                                                        mapped_type;
-   typedef Compare                                                                  key_compare;
-   typedef std::pair<Key, T>                                                        value_type;
-   typedef typename BOOST_CONTAINER_IMPDEF(tree_t::sequence_type)                   sequence_type;
-   typedef typename sequence_type::allocator_type                                   allocator_type;
-   typedef ::boost::container::allocator_traits<allocator_type>                     allocator_traits_type;
-   typedef typename sequence_type::pointer                                          pointer;
-   typedef typename sequence_type::const_pointer                                    const_pointer;
-   typedef typename sequence_type::reference                                        reference;
-   typedef typename sequence_type::const_reference                                  const_reference;
-   typedef typename sequence_type::size_type                                        size_type;
-   typedef typename sequence_type::difference_type                                  difference_type;
-   typedef typename BOOST_CONTAINER_IMPDEF(tree_t::stored_allocator_type)           stored_allocator_type;
-   typedef typename BOOST_CONTAINER_IMPDEF(tree_t::value_compare)                   value_compare;
-
-   typedef typename sequence_type::iterator                                         iterator;
-   typedef typename sequence_type::const_iterator                                   const_iterator;
-   typedef typename sequence_type::reverse_iterator                                 reverse_iterator;
-   typedef typename sequence_type::const_reverse_iterator                           const_reverse_iterator;
-   typedef BOOST_CONTAINER_IMPDEF(impl_value_type)                                  movable_value_type;
-
-   //AllocatorOrContainer::value_type must be std::pair<Key, T>
-   BOOST_STATIC_ASSERT((dtl::is_same<std::pair<Key, T>, value_type>::value));
-
-   //////////////////////////////////////////////
-   //
-   //          construct/copy/destroy
-   //
-   //////////////////////////////////////////////
-
-   //! <b>Effects</b>: Default constructs an empty flat_map.
-   //!
-   //! <b>Complexity</b>: Constant.
-   BOOST_CONTAINER_FORCEINLINE flat_map() BOOST_NOEXCEPT_IF(dtl::is_nothrow_default_constructible<AllocatorOrContainer>::value &&
-                                                            dtl::is_nothrow_default_constructible<Compare>::value)
-      : m_flat_tree()
-   {}
-
-   //! <b>Effects</b>: Constructs an empty flat_map using the specified allocator.
-   //!
-   //! <b>Complexity</b>: Constant.
-   BOOST_CONTAINER_FORCEINLINE explicit flat_map(const allocator_type& a)
-      : m_flat_tree(dtl::force<const impl_allocator_type>(a))
-   {}
-
-   //! <b>Effects</b>: Constructs an empty flat_map using the specified
-   //! comparison object.
-   //!
-   //! <b>Complexity</b>: Constant.
-   BOOST_CONTAINER_FORCEINLINE explicit flat_map(const Compare& comp)
-      : m_flat_tree(comp)
-   {}
-
-   //! <b>Effects</b>: Constructs an empty flat_map using the specified
-   //! comparison object and allocator.
-   //!
-   //! <b>Complexity</b>: Constant.
-   BOOST_CONTAINER_FORCEINLINE flat_map(const Compare& comp, const allocator_type& a)
-      : m_flat_tree(comp, dtl::force<const impl_allocator_type>(a))
-   {}
-
-   //! <b>Effects</b>: Constructs an empty flat_map and
-   //! and inserts elements from the range [first ,last ).
-   //!
-   //! <b>Complexity</b>: Linear in N if the range [first ,last ) is already sorted using
-   //! the predicate and otherwise N logN, where N is last - first.
-   template <class InputIterator>
-   BOOST_CONTAINER_FORCEINLINE flat_map(InputIterator first, InputIterator last)
-      : m_flat_tree(true, first, last)
-   {}
-
-   //! <b>Effects</b>: Constructs an empty flat_map using the specified
-   //! allocator, and inserts elements from the range [first ,last ).
-   //!
-   //! <b>Complexity</b>: Linear in N if the range [first ,last ) is already sorted using
-   //! the predicate and otherwise N logN, where N is last - first.
-   template <class InputIterator>
-   BOOST_CONTAINER_FORCEINLINE flat_map(InputIterator first, InputIterator last, const allocator_type& a)
-      : m_flat_tree(true, first, last, dtl::force<const impl_allocator_type>(a))
-   {}
-
-   //! <b>Effects</b>: Constructs an empty flat_map using the specified comparison object and
-   //! and inserts elements from the range [first ,last ).
-   //!
-   //! <b>Complexity</b>: Linear in N if the range [first ,last ) is already sorted using
-   //! the predicate and otherwise N logN, where N is last - first.
-   template <class InputIterator>
-   BOOST_CONTAINER_FORCEINLINE flat_map(InputIterator first, InputIterator last, const Compare& comp)
-      : m_flat_tree(true, first, last, comp)
-   {}
-
-   //! <b>Effects</b>: Constructs an empty flat_map using the specified comparison object and
-   //! allocator, and inserts elements from the range [first ,last ).
-   //!
-   //! <b>Complexity</b>: Linear in N if the range [first ,last ) is already sorted using
-   //! the predicate and otherwise N logN, where N is last - first.
-   template <class InputIterator>
-   BOOST_CONTAINER_FORCEINLINE flat_map(InputIterator first, InputIterator last, const Compare& comp, const allocator_type& a)
-      : m_flat_tree(true, first, last, comp, dtl::force<const impl_allocator_type>(a))
-   {}
-
-   //! <b>Effects</b>: Constructs an empty flat_map
-   //! and inserts elements from the ordered range [first ,last). This function
-   //! is more efficient than the normal range creation for ordered ranges.
-   //!
-   //! <b>Requires</b>: [first ,last) must be ordered according to the predicate.
-   //!
-   //! <b>Complexity</b>: Linear in N.
-   //!
-   //! <b>Note</b>: Non-standard extension.
-   template <class InputIterator>
-   BOOST_CONTAINER_FORCEINLINE
-   flat_map(ordered_unique_range_t, InputIterator first, InputIterator last)
-      : m_flat_tree(ordered_range, first, last)
-   {}
-
-   //! <b>Effects</b>: Constructs an empty flat_map using the specified comparison object and
-   //! inserts elements from the ordered range [first ,last). This function
-   //! is more efficient than the normal range creation for ordered ranges.
-   //!
-   //! <b>Requires</b>: [first ,last) must be ordered according to the predicate.
-   //!
-   //! <b>Complexity</b>: Linear in N.
-   //!
-   //! <b>Note</b>: Non-standard extension.
-   template <class InputIterator>
-   BOOST_CONTAINER_FORCEINLINE
-   flat_map(ordered_unique_range_t, InputIterator first, InputIterator last, const Compare& comp)
-      : m_flat_tree(ordered_range, first, last, comp)
-   {}
-
-   //! <b>Effects</b>: Constructs an empty flat_map using the specified comparison object and
-   //! allocator, and inserts elements from the ordered range [first ,last). This function
-   //! is more efficient than the normal range creation for ordered ranges.
-   //!
-   //! <b>Requires</b>: [first ,last) must be ordered according to the predicate.
-   //!
-   //! <b>Complexity</b>: Linear in N.
-   //!
-   //! <b>Note</b>: Non-standard extension.
-   template <class InputIterator>
-   BOOST_CONTAINER_FORCEINLINE
-   flat_map(ordered_unique_range_t, InputIterator first, InputIterator last, const Compare& comp, const allocator_type& a)
-      : m_flat_tree(ordered_range, first, last, comp, dtl::force<const impl_allocator_type>(a))
-   {}
-
-   //! <b>Effects</b>: Constructs an empty flat_map using the specified allocator and
-   //! inserts elements from the ordered range [first ,last). This function
-   //! is more efficient than the normal range creation for ordered ranges.
-   //!
-   //! <b>Requires</b>: [first ,last) must be ordered according to the predicate.
-   //!
-   //! <b>Complexity</b>: Linear in N.
-   //!
-   //! <b>Note</b>: Non-standard extension.
-   template <class InputIterator>
-   BOOST_CONTAINER_FORCEINLINE
-      flat_map(ordered_unique_range_t, InputIterator first, InputIterator last, const allocator_type& a)
-      : m_flat_tree(ordered_range, first, last, Compare(), a)
-   {}
-
-#if !defined(BOOST_NO_CXX11_HDR_INITIALIZER_LIST)
-   //! <b>Effects</b>: Constructs an empty flat_map and
-   //! inserts elements from the range [il.begin() ,il.end()).
-   //!
-   //! <b>Complexity</b>: Linear in N if the range [il.begin(), il.end()) is already sorted using
-   //! the predicate and otherwise N logN, where N is last - first.
-   BOOST_CONTAINER_FORCEINLINE flat_map(std::initializer_list<value_type> il)
-     : m_flat_tree( true
-                  , dtl::force<impl_initializer_list>(il).begin()
-                  , dtl::force<impl_initializer_list>(il).end())
-   {}
-
-   //! <b>Effects</b>: Constructs an empty flat_map using the specified
-   //! allocator, and inserts elements from the range [il.begin() ,il.end()).
-   //!
-   //! <b>Complexity</b>: Linear in N if the range [il.begin(), il.end()) is already sorted using
-   //! the predicate and otherwise N logN, where N is last - first.
-   BOOST_CONTAINER_FORCEINLINE flat_map(std::initializer_list<value_type> il, const allocator_type& a)
-     : m_flat_tree( true
-                  , dtl::force<impl_initializer_list>(il).begin()
-                  , dtl::force<impl_initializer_list>(il).end()
-                  , dtl::force<const impl_allocator_type>(a))
-   {}
-
-   //! <b>Effects</b>: Constructs an empty flat_map using the specified comparison object and
-   //! inserts elements from the range [il.begin() ,il.end()).
-   //!
-   //! <b>Complexity</b>: Linear in N if the range [il.begin(), il.end()) is already sorted using
-   //! the predicate and otherwise N logN, where N is last - first.
-   BOOST_CONTAINER_FORCEINLINE flat_map(std::initializer_list<value_type> il, const Compare& comp)
-     : m_flat_tree(true
-                  , dtl::force<impl_initializer_list>(il).begin()
-                  , dtl::force<impl_initializer_list>(il).end()
-                  , comp)
-   {}
-
-   //! <b>Effects</b>: Constructs an empty flat_map using the specified comparison object and
-   //! allocator, and inserts elements from the range [il.begin() ,il.end()).
-   //!
-   //! <b>Complexity</b>: Linear in N if the range [il.begin(), il.end()) is already sorted using
-   //! the predicate and otherwise N logN, where N is last - first.
-   BOOST_CONTAINER_FORCEINLINE flat_map(std::initializer_list<value_type> il, const Compare& comp, const allocator_type& a)
-     : m_flat_tree(true
-                  , dtl::force<impl_initializer_list>(il).begin()
-                  , dtl::force<impl_initializer_list>(il).end()
-                  , comp
-                  , dtl::force<const impl_allocator_type>(a))
-   {}
-
-   //! <b>Effects</b>: Constructs an empty flat_map using and
-   //! inserts elements from the ordered unique range [il.begin(), il.end()). This function
-   //! is more efficient than the normal range creation for ordered ranges.
-   //!
-   //! <b>Requires</b>: [il.begin(), il.end()) must be ordered according to the predicate and must be
-   //! unique values.
-   //!
-   //! <b>Complexity</b>: Linear in N.
-   //!
-   //! <b>Note</b>: Non-standard extension.
-   BOOST_CONTAINER_FORCEINLINE flat_map(ordered_unique_range_t, std::initializer_list<value_type> il)
-     : m_flat_tree(ordered_unique_range
-                  , dtl::force<impl_initializer_list>(il).begin()
-                  , dtl::force<impl_initializer_list>(il).end())
-   {}
-
-   //! <b>Effects</b>: Constructs an empty flat_map using the specified comparison object and
-   //! inserts elements from the ordered unique range [il.begin(), il.end()). This function
-   //! is more efficient than the normal range creation for ordered ranges.
-   //!
-   //! <b>Requires</b>: [il.begin(), il.end()) must be ordered according to the predicate and must be
-   //! unique values.
-   //!
-   //! <b>Complexity</b>: Linear in N.
-   //!
-   //! <b>Note</b>: Non-standard extension.
-   BOOST_CONTAINER_FORCEINLINE flat_map(ordered_unique_range_t, std::initializer_list<value_type> il, const Compare& comp)
-     : m_flat_tree(ordered_unique_range
-                  , dtl::force<impl_initializer_list>(il).begin()
-                  , dtl::force<impl_initializer_list>(il).end()
-                  , comp)
-   {}
-
-   //! <b>Effects</b>: Constructs an empty flat_map using the specified comparison object and
-   //! allocator, and inserts elements from the ordered unique range [il.begin(), il.end()). This function
-   //! is more efficient than the normal range creation for ordered ranges.
-   //!
-   //! <b>Requires</b>: [il.begin(), il.end()) must be ordered according to the predicate and must be
-   //! unique values.
-   //!
-   //! <b>Complexity</b>: Linear in N.
-   //!
-   //! <b>Note</b>: Non-standard extension.
-   BOOST_CONTAINER_FORCEINLINE flat_map(ordered_unique_range_t, std::initializer_list<value_type> il, const Compare& comp, const allocator_type& a)
-     : m_flat_tree( ordered_unique_range
-                  , dtl::force<impl_initializer_list>(il).begin()
-                  , dtl::force<impl_initializer_list>(il).end()
-                  , comp
-                  , dtl::force<const impl_allocator_type>(a))
-   {}
-#endif
-
-   //! <b>Effects</b>: Copy constructs a flat_map.
-   //!
-   //! <b>Complexity</b>: Linear in x.size().
-   BOOST_CONTAINER_FORCEINLINE flat_map(const flat_map& x)
-      : m_flat_tree(x.m_flat_tree)
-   {}
-
-   //! <b>Effects</b>: Move constructs a flat_map.
-   //!   Constructs *this using x's resources.
-   //!
-   //! <b>Complexity</b>: Constant.
-   //!
-   //! <b>Postcondition</b>: x is emptied.
-   BOOST_CONTAINER_FORCEINLINE flat_map(BOOST_RV_REF(flat_map) x)
-      BOOST_NOEXCEPT_IF(boost::container::dtl::is_nothrow_move_constructible<Compare>::value)
-      : m_flat_tree(boost::move(x.m_flat_tree))
-   {}
-
-   //! <b>Effects</b>: Copy constructs a flat_map using the specified allocator.
-   //!
-   //! <b>Complexity</b>: Linear in x.size().
-   BOOST_CONTAINER_FORCEINLINE flat_map(const flat_map& x, const allocator_type &a)
-      : m_flat_tree(x.m_flat_tree, dtl::force<const impl_allocator_type>(a))
-   {}
-
-   //! <b>Effects</b>: Move constructs a flat_map using the specified allocator.
-   //!   Constructs *this using x's resources.
-   //!
-   //! <b>Complexity</b>: Constant if x.get_allocator() == a, linear otherwise.
-   BOOST_CONTAINER_FORCEINLINE flat_map(BOOST_RV_REF(flat_map) x, const allocator_type &a)
-      : m_flat_tree(boost::move(x.m_flat_tree), dtl::force<const impl_allocator_type>(a))
-   {}
-
-   //! <b>Effects</b>: Makes *this a copy of x.
-   //!
-   //! <b>Complexity</b>: Linear in x.size().
-   BOOST_CONTAINER_FORCEINLINE flat_map& operator=(BOOST_COPY_ASSIGN_REF(flat_map) x)
-   {  m_flat_tree = x.m_flat_tree;   return *this;  }
-
-   //! <b>Effects</b>: Move constructs a flat_map.
-   //!   Constructs *this using x's resources.
-   //!
-   //! <b>Throws</b>: If allocator_traits_type::propagate_on_container_move_assignment
-   //!   is false and (allocation throws or value_type's move constructor throws)
-   //!
-   //! <b>Complexity</b>: Constant if allocator_traits_type::
-   //!   propagate_on_container_move_assignment is true or
-   //!   this->get>allocator() == x.get_allocator(). Linear otherwise.
-   BOOST_CONTAINER_FORCEINLINE flat_map& operator=(BOOST_RV_REF(flat_map) x)
-      BOOST_NOEXCEPT_IF( (allocator_traits_type::propagate_on_container_move_assignment::value ||
-                          allocator_traits_type::is_always_equal::value) &&
-                           boost::container::dtl::is_nothrow_move_assignable<Compare>::value)
-   {  m_flat_tree = boost::move(x.m_flat_tree);   return *this;  }
-
-#if !defined(BOOST_NO_CXX11_HDR_INITIALIZER_LIST)
-   //! <b>Effects</b>: Assign elements from il to *this
-   flat_map& operator=(std::initializer_list<value_type> il)
-   {
-      this->clear();
-      this->insert(il.begin(), il.end());
-      return *this;
-   }
-#endif
-
-   //! <b>Effects</b>: Returns a copy of the allocator that
-   //!   was passed to the object's constructor.
-   //!
-   //! <b>Complexity</b>: Constant.
-   BOOST_CONTAINER_ATTRIBUTE_NODISCARD BOOST_CONTAINER_FORCEINLINE
-      allocator_type get_allocator() const BOOST_NOEXCEPT_OR_NOTHROW
-      { return dtl::force_copy<allocator_type>(m_flat_tree.get_allocator()); }
-
-   //! <b>Effects</b>: Returns a reference to the internal allocator.
-   //!
-   //! <b>Throws</b>: Nothing
-   //!
-   //! <b>Complexity</b>: Constant.
-   //!
-   //! <b>Note</b>: Non-standard extension.
-   BOOST_CONTAINER_ATTRIBUTE_NODISCARD BOOST_CONTAINER_FORCEINLINE
-      get_stored_allocator_noconst_return_t get_stored_allocator() BOOST_NOEXCEPT_OR_NOTHROW
-   {
-      impl_get_stored_allocator_noconst_return_t r = m_flat_tree.get_stored_allocator();
-      return dtl::force<stored_allocator_type>(r);
-   }
-
-   //! <b>Effects</b>: Returns a reference to the internal allocator.
-   //!
-   //! <b>Throws</b>: Nothing
-   //!
-   //! <b>Complexity</b>: Constant.
-   //!
-   //! <b>Note</b>: Non-standard extension.
-   BOOST_CONTAINER_ATTRIBUTE_NODISCARD BOOST_CONTAINER_FORCEINLINE
-      get_stored_allocator_const_return_t get_stored_allocator() const BOOST_NOEXCEPT_OR_NOTHROW
-   {
-      impl_get_stored_allocator_const_return_t r = m_flat_tree.get_stored_allocator();
-      return dtl::force<const stored_allocator_type>(r);
-   }
-
-   //////////////////////////////////////////////
-   //
-   //                iterators
-   //
-   //////////////////////////////////////////////
-
-   //! <b>Effects</b>: Returns an iterator to the first element contained in the container.
-   //!
-   //! <b>Throws</b>: Nothing.
-   //!
-   //! <b>Complexity</b>: Constant.
-   BOOST_CONTAINER_ATTRIBUTE_NODISCARD BOOST_CONTAINER_FORCEINLINE
-      iterator begin() BOOST_NOEXCEPT_OR_NOTHROW
-      { return dtl::force_copy<iterator>(m_flat_tree.begin()); }
-
-   //! <b>Effects</b>: Returns a const_iterator to the first element contained in the container.
-   //!
-   //! <b>Throws</b>: Nothing.
-   //!
-   //! <b>Complexity</b>: Constant.
-   BOOST_CONTAINER_ATTRIBUTE_NODISCARD BOOST_CONTAINER_FORCEINLINE
-      const_iterator begin() const BOOST_NOEXCEPT_OR_NOTHROW
-      { return dtl::force_copy<const_iterator>(m_flat_tree.begin()); }
-
-   //! <b>Effects</b>: Returns an iterator to the end of the container.
-   //!
-   //! <b>Throws</b>: Nothing.
-   //!
-   //! <b>Complexity</b>: Constant.
-   BOOST_CONTAINER_ATTRIBUTE_NODISCARD BOOST_CONTAINER_FORCEINLINE
-      iterator end() BOOST_NOEXCEPT_OR_NOTHROW
-      { return dtl::force_copy<iterator>(m_flat_tree.end()); }
-
-   //! <b>Effects</b>: Returns a const_iterator to the end of the container.
-   //!
-   //! <b>Throws</b>: Nothing.
-   //!
-   //! <b>Complexity</b>: Constant.
-   BOOST_CONTAINER_ATTRIBUTE_NODISCARD BOOST_CONTAINER_FORCEINLINE
-      const_iterator end() const BOOST_NOEXCEPT_OR_NOTHROW
-      { return dtl::force_copy<const_iterator>(m_flat_tree.end()); }
-
-   //! <b>Effects</b>: Returns a reverse_iterator pointing to the beginning
-   //! of the reversed container.
-   //!
-   //! <b>Throws</b>: Nothing.
-   //!
-   //! <b>Complexity</b>: Constant.
-   BOOST_CONTAINER_ATTRIBUTE_NODISCARD BOOST_CONTAINER_FORCEINLINE
-      reverse_iterator rbegin() BOOST_NOEXCEPT_OR_NOTHROW
-      { return dtl::force_copy<reverse_iterator>(m_flat_tree.rbegin()); }
-
-   //! <b>Effects</b>: Returns a const_reverse_iterator pointing to the beginning
-   //! of the reversed container.
-   //!
-   //! <b>Throws</b>: Nothing.
-   //!
-   //! <b>Complexity</b>: Constant.
-   BOOST_CONTAINER_ATTRIBUTE_NODISCARD BOOST_CONTAINER_FORCEINLINE
-      const_reverse_iterator rbegin() const BOOST_NOEXCEPT_OR_NOTHROW
-      { return dtl::force_copy<const_reverse_iterator>(m_flat_tree.rbegin()); }
-
-   //! <b>Effects</b>: Returns a reverse_iterator pointing to the end
-   //! of the reversed container.
-   //!
-   //! <b>Throws</b>: Nothing.
-   //!
-   //! <b>Complexity</b>: Constant.
-   BOOST_CONTAINER_ATTRIBUTE_NODISCARD BOOST_CONTAINER_FORCEINLINE
-      reverse_iterator rend() BOOST_NOEXCEPT_OR_NOTHROW
-      { return dtl::force_copy<reverse_iterator>(m_flat_tree.rend()); }
-
-   //! <b>Effects</b>: Returns a const_reverse_iterator pointing to the end
-   //! of the reversed container.
-   //!
-   //! <b>Throws</b>: Nothing.
-   //!
-   //! <b>Complexity</b>: Constant.
-   BOOST_CONTAINER_ATTRIBUTE_NODISCARD BOOST_CONTAINER_FORCEINLINE
-      const_reverse_iterator rend() const BOOST_NOEXCEPT_OR_NOTHROW
-      { return dtl::force_copy<const_reverse_iterator>(m_flat_tree.rend()); }
-
-   //! <b>Effects</b>: Returns a const_iterator to the first element contained in the container.
-   //!
-   //! <b>Throws</b>: Nothing.
-   //!
-   //! <b>Complexity</b>: Constant.
-   BOOST_CONTAINER_ATTRIBUTE_NODISCARD BOOST_CONTAINER_FORCEINLINE
-      const_iterator cbegin() const BOOST_NOEXCEPT_OR_NOTHROW
-      { return dtl::force_copy<const_iterator>(m_flat_tree.cbegin()); }
-
-   //! <b>Effects</b>: Returns a const_iterator to the end of the container.
-   //!
-   //! <b>Throws</b>: Nothing.
-   //!
-   //! <b>Complexity</b>: Constant.
-   BOOST_CONTAINER_ATTRIBUTE_NODISCARD BOOST_CONTAINER_FORCEINLINE
-      const_iterator cend() const BOOST_NOEXCEPT_OR_NOTHROW
-      { return dtl::force_copy<const_iterator>(m_flat_tree.cend()); }
-
-   //! <b>Effects</b>: Returns a const_reverse_iterator pointing to the beginning
-   //! of the reversed container.
-   //!
-   //! <b>Throws</b>: Nothing.
-   //!
-   //! <b>Complexity</b>: Constant.
-   BOOST_CONTAINER_ATTRIBUTE_NODISCARD BOOST_CONTAINER_FORCEINLINE
-      const_reverse_iterator crbegin() const BOOST_NOEXCEPT_OR_NOTHROW
-      { return dtl::force_copy<const_reverse_iterator>(m_flat_tree.crbegin()); }
-
-   //! <b>Effects</b>: Returns a const_reverse_iterator pointing to the end
-   //! of the reversed container.
-   //!
-   //! <b>Throws</b>: Nothing.
-   //!
-   //! <b>Complexity</b>: Constant.
-   BOOST_CONTAINER_ATTRIBUTE_NODISCARD BOOST_CONTAINER_FORCEINLINE
-      const_reverse_iterator crend() const BOOST_NOEXCEPT_OR_NOTHROW
-      { return dtl::force_copy<const_reverse_iterator>(m_flat_tree.crend()); }
-
-   //////////////////////////////////////////////
-   //
-   //                capacity
-   //
-   //////////////////////////////////////////////
-
-   //! <b>Effects</b>: Returns true if the container contains no elements.
-   //!
-   //! <b>Throws</b>: Nothing.
-   //!
-   //! <b>Complexity</b>: Constant.
-   BOOST_CONTAINER_ATTRIBUTE_NODISCARD BOOST_CONTAINER_FORCEINLINE
-      bool empty() const BOOST_NOEXCEPT_OR_NOTHROW
-      { return m_flat_tree.empty(); }
-
-   //! <b>Effects</b>: Returns the number of the elements contained in the container.
-   //!
-   //! <b>Throws</b>: Nothing.
-   //!
-   //! <b>Complexity</b>: Constant.
-   BOOST_CONTAINER_ATTRIBUTE_NODISCARD BOOST_CONTAINER_FORCEINLINE
-      size_type size() const BOOST_NOEXCEPT_OR_NOTHROW
-      { return m_flat_tree.size(); }
-
-   //! <b>Effects</b>: Returns the largest possible size of the container.
-   //!
-   //! <b>Throws</b>: Nothing.
-   //!
-   //! <b>Complexity</b>: Constant.
-   BOOST_CONTAINER_ATTRIBUTE_NODISCARD BOOST_CONTAINER_FORCEINLINE
-      size_type max_size() const BOOST_NOEXCEPT_OR_NOTHROW
-      { return m_flat_tree.max_size(); }
-
-   //! <b>Effects</b>: Number of elements for which memory has been allocated.
-   //!   capacity() is always greater than or equal to size().
-   //!
-   //! <b>Throws</b>: Nothing.
-   //!
-   //! <b>Complexity</b>: Constant.
-   BOOST_CONTAINER_ATTRIBUTE_NODISCARD BOOST_CONTAINER_FORCEINLINE
-      size_type capacity() const BOOST_NOEXCEPT_OR_NOTHROW
-      { return m_flat_tree.capacity(); }
-
-   //! <b>Effects</b>: If n is less than or equal to capacity(), or the
-   //!   underlying container has no `reserve` member, this call has no
-   //!   effect. Otherwise, it is a request for allocation of additional memory.
-   //!   If the request is successful, then capacity() is greater than or equal to
-   //!   n; otherwise, capacity() is unchanged. In either case, size() is unchanged.
-   //!
-   //! <b>Throws</b>: If memory allocation allocation throws or T's copy constructor throws.
-   //!
-   //! <b>Note</b>: If capacity() is less than "cnt", iterators and references to
-   //!   to values might be invalidated.
-   BOOST_CONTAINER_FORCEINLINE void reserve(size_type cnt)
-      { m_flat_tree.reserve(cnt);   }
-
-   //! <b>Effects</b>: Tries to deallocate the excess of memory created
-   //    with previous allocations. The size of the vector is unchanged
-   //!
-   //! <b>Throws</b>: If memory allocation throws, or T's copy constructor throws.
-   //!
-   //! <b>Complexity</b>: Linear to size().
-   BOOST_CONTAINER_FORCEINLINE void shrink_to_fit()
-      { m_flat_tree.shrink_to_fit(); }
-
-   //////////////////////////////////////////////
-   //
-   //               element access
-   //
-   //////////////////////////////////////////////
-
-   #if defined(BOOST_CONTAINER_DOXYGEN_INVOKED)
-   //! Effects: If there is no key equivalent to x in the flat_map, inserts
-   //!   value_type(x, T()) into the flat_map.
-   //!
-   //! Returns: A reference to the mapped_type corresponding to x in *this.
-   //!
-   //! Complexity: Logarithmic search time plus linear insertion time in case no equivalent key is present.
-   mapped_type &operator[](const key_type& k);
-
-   //! Effects: If there is no key equivalent to x in the flat_map, inserts
-   //! value_type(move(x), T()) into the flat_map (the key is move-constructed)
-   //!
-   //! Returns: A reference to the mapped_type corresponding to x in *this.
-   //!
-   //! Complexity: Logarithmic search time plus linear insertion time in case no equivalent key is present.
-   mapped_type &operator[](key_type &&k);
-   #elif defined(BOOST_MOVE_HELPERS_RETURN_SFINAE_BROKEN)
-      //in compilers like GCC 3.4, we can't catch temporaries
-      BOOST_CONTAINER_FORCEINLINE mapped_type& operator[](const key_type &k)         {  return this->priv_subscript(k);  }
-      BOOST_CONTAINER_FORCEINLINE mapped_type& operator[](BOOST_RV_REF(key_type) k)  {  return this->priv_subscript(::boost::move(k));  }
-   #else
-      BOOST_MOVE_CONVERSION_AWARE_CATCH( operator[] , key_type, mapped_type&, this->priv_subscript)
-   #endif
-
-   //! Effects: If a key equivalent to k already exists in the container, assigns forward<M>(obj)
-   //! to the mapped_type corresponding to the key k. If the key does not exist, inserts the new value
-   //! as if by insert, constructing it from value_type(k, forward<M>(obj)).
-   //! 
-   //! No iterators or references are invalidated. If the insertion is successful, pointers and references
-   //! to the element obtained while it is held in the node handle are invalidated, and pointers and
-   //! references obtained to that element before it was extracted become valid.
-   //!
-   //! Returns: The bool component is true if the insertion took place and false if the assignment
-   //!   took place. The iterator component is pointing at the element that was inserted or updated.
-   //!
-   //! Complexity: Logarithmic search time plus linear insertion time in case no equivalent key is present.
-   template <class M>
-   BOOST_CONTAINER_FORCEINLINE std::pair<iterator, bool> insert_or_assign(const key_type& k, BOOST_FWD_REF(M) obj)
-   {
-      return dtl::force_copy< std::pair<iterator, bool> >
-         (this->m_flat_tree.insert_or_assign
-            ( impl_const_iterator(), k, ::boost::forward<M>(obj))
-         );
-   }
-
-   //! Effects: If a key equivalent to k already exists in the container, assigns forward<M>(obj)
-   //! to the mapped_type corresponding to the key k. If the key does not exist, inserts the new value
-   //! as if by insert, constructing it from value_type(k, move(obj)).
-   //! 
-   //! No iterators or references are invalidated. If the insertion is successful, pointers and references
-   //! to the element obtained while it is held in the node handle are invalidated, and pointers and
-   //! references obtained to that element before it was extracted become valid.
-   //!
-   //! Returns: The bool component is true if the insertion took place and false if the assignment
-   //!   took place. The iterator component is pointing at the element that was inserted or updated.
-   //!
-   //! Complexity: Logarithmic in the size of the container.
-   template <class M>
-   BOOST_CONTAINER_FORCEINLINE std::pair<iterator, bool> insert_or_assign(BOOST_RV_REF(key_type) k, BOOST_FWD_REF(M) obj)
-   {
-      return dtl::force_copy< std::pair<iterator, bool> >
-         (this->m_flat_tree.insert_or_assign
-            ( impl_const_iterator(), ::boost::move(k), ::boost::forward<M>(obj))
-         );
-   }
-
-   //! Effects: If a key equivalent to k already exists in the container, assigns forward<M>(obj)
-   //! to the mapped_type corresponding to the key k. If the key does not exist, inserts the new value
-   //! as if by insert, constructing it from value_type(k, forward<M>(obj)) and the new element
-   //! to the container as close as possible to the position just before hint.
-   //! 
-   //! No iterators or references are invalidated. If the insertion is successful, pointers and references
-   //! to the element obtained while it is held in the node handle are invalidated, and pointers and
-   //! references obtained to that element before it was extracted become valid.
-   //!
-   //! Returns: The bool component is true if the insertion took place and false if the assignment
-   //!   took place. The iterator component is pointing at the element that was inserted or updated.
-   //!
-   //! Complexity: Logarithmic in the size of the container in general, but amortized constant if
-   //! the new element is inserted just before hint.
-   template <class M>
-   BOOST_CONTAINER_FORCEINLINE iterator insert_or_assign(const_iterator hint, const key_type& k, BOOST_FWD_REF(M) obj)
-   {
-      return dtl::force_copy<iterator>
-         (this->m_flat_tree.insert_or_assign
-            ( dtl::force_copy<impl_const_iterator>(hint)
-            , k, ::boost::forward<M>(obj)).first
-         );
-   }
-
-   //! Effects: If a key equivalent to k already exists in the container, assigns forward<M>(obj)
-   //! to the mapped_type corresponding to the key k. If the key does not exist, inserts the new value
-   //! as if by insert, constructing it from value_type(k, move(obj)) and the new element
-   //! to the container as close as possible to the position just before hint.
-   //! 
-   //! No iterators or references are invalidated. If the insertion is successful, pointers and references
-   //! to the element obtained while it is held in the node handle are invalidated, and pointers and
-   //! references obtained to that element before it was extracted become valid.
-   //!
-   //! Returns: The bool component is true if the insertion took place and false if the assignment
-   //!   took place. The iterator component is pointing at the element that was inserted or updated.
-   //!
-   //! Complexity: Logarithmic in the size of the container in general, but amortized constant if
-   //! the new element is inserted just before hint.
-   template <class M>
-   BOOST_CONTAINER_FORCEINLINE iterator insert_or_assign(const_iterator hint, BOOST_RV_REF(key_type) k, BOOST_FWD_REF(M) obj)
-   {
-      return dtl::force_copy<iterator>
-         (this->m_flat_tree.insert_or_assign
-            ( dtl::force_copy<impl_const_iterator>(hint)
-            , ::boost::move(k), ::boost::forward<M>(obj)).first
-         );
-   }
-
-   //! @copydoc ::boost::container::flat_set::nth(size_type)
-   BOOST_CONTAINER_ATTRIBUTE_NODISCARD BOOST_CONTAINER_FORCEINLINE
-      iterator nth(size_type n) BOOST_NOEXCEPT_OR_NOTHROW
-   {  return dtl::force_copy<iterator>(m_flat_tree.nth(n));  }
-
-   //! @copydoc ::boost::container::flat_set::nth(size_type) const
-   BOOST_CONTAINER_ATTRIBUTE_NODISCARD BOOST_CONTAINER_FORCEINLINE
-      const_iterator nth(size_type n) const BOOST_NOEXCEPT_OR_NOTHROW
-   {  return dtl::force_copy<iterator>(m_flat_tree.nth(n));  }
-
-   //! @copydoc ::boost::container::flat_set::index_of(iterator)
-   BOOST_CONTAINER_ATTRIBUTE_NODISCARD BOOST_CONTAINER_FORCEINLINE
-      size_type index_of(iterator p) BOOST_NOEXCEPT_OR_NOTHROW
-   {  return m_flat_tree.index_of(dtl::force_copy<impl_iterator>(p));  }
-
-   //! @copydoc ::boost::container::flat_set::index_of(const_iterator) const
-   BOOST_CONTAINER_ATTRIBUTE_NODISCARD BOOST_CONTAINER_FORCEINLINE
-      size_type index_of(const_iterator p) const BOOST_NOEXCEPT_OR_NOTHROW
-   {  return m_flat_tree.index_of(dtl::force_copy<impl_const_iterator>(p));  }
-
-   //! Returns: A reference to the element whose key is equivalent to x.
-   //!
-   //! Throws: An exception object of type out_of_range if no such element is present.
-   //!
-   //! Complexity: logarithmic.
-   BOOST_CONTAINER_ATTRIBUTE_NODISCARD T& at(const key_type& k)
-   {
-      iterator i = this->find(k);
-      if(i == this->end()){
-         throw_out_of_range("flat_map::at key not found");
-      }
-      return i->second;
-   }
-
-   //! Returns: A reference to the element whose key is equivalent to x.
-   //!
-   //! Throws: An exception object of type out_of_range if no such element is present.
-   //!
-   //! Complexity: logarithmic.
-   BOOST_CONTAINER_ATTRIBUTE_NODISCARD const T& at(const key_type& k) const
-   {
-      const_iterator i = this->find(k);
-      if(i == this->end()){
-         throw_out_of_range("flat_map::at key not found");
-      }
-      return i->second;
-   }
-
-   //////////////////////////////////////////////
-   //
-   //                modifiers
-   //
-   //////////////////////////////////////////////
-
-   #if !defined(BOOST_NO_CXX11_VARIADIC_TEMPLATES) || defined(BOOST_CONTAINER_DOXYGEN_INVOKED)
-
-   //! <b>Effects</b>: Inserts an object x of type T constructed with
-   //!   std::forward<Args>(args)... if and only if there is no element in the container
-   //!   with key equivalent to the key of x.
-   //!
-   //! <b>Returns</b>: The bool component of the returned pair is true if and only
-   //!   if the insertion takes place, and the iterator component of the pair
-   //!   points to the element with key equivalent to the key of x.
-   //!
-   //! <b>Complexity</b>: Logarithmic search time plus linear insertion
-   //!   to the elements with bigger keys than x.
-   //!
-   //! <b>Note</b>: If an element is inserted it might invalidate elements.
-   template <class... Args>
-   BOOST_CONTAINER_FORCEINLINE std::pair<iterator,bool> emplace(BOOST_FWD_REF(Args)... args)
-   {  return dtl::force_copy< std::pair<iterator, bool> >(m_flat_tree.emplace_unique(boost::forward<Args>(args)...)); }
-
-   //! <b>Effects</b>: Inserts an object of type T constructed with
-   //!   std::forward<Args>(args)... in the container if and only if there is
-   //!   no element in the container with key equivalent to the key of x.
-   //!   p is a hint pointing to where the insert should start to search.
-   //!
-   //! <b>Returns</b>: An iterator pointing to the element with key equivalent
-   //!   to the key of x.
-   //!
-   //! <b>Complexity</b>: Logarithmic search time (constant if x is inserted
-   //!   right before p) plus insertion linear to the elements with bigger keys than x.
-   //!
-   //! <b>Note</b>: If an element is inserted it might invalidate elements.
-   template <class... Args>
-   BOOST_CONTAINER_FORCEINLINE iterator emplace_hint(const_iterator hint, BOOST_FWD_REF(Args)... args)
-   {
-      return dtl::force_copy<iterator>
-         (m_flat_tree.emplace_hint_unique( dtl::force_copy<impl_const_iterator>(hint)
-                                         , boost::forward<Args>(args)...));
-   }
-
-   //! <b>Requires</b>: value_type shall be EmplaceConstructible into map from piecewise_construct, 
-   //! forward_as_tuple(k), forward_as_tuple(forward<Args>(args)...).
-   //! 
-   //! <b>Effects</b>: If the map already contains an element whose key is equivalent to k, there is no effect. Otherwise
-   //! inserts an object of type value_type constructed with piecewise_construct, forward_as_tuple(k),
-   //! forward_as_tuple(forward<Args>(args)...).
-   //! 
-   //! <b>Returns</b>: The bool component of the returned pair is true if and only if the
-   //! insertion took place. The returned iterator points to the map element whose key is equivalent to k.
-   //! 
-   //! <b>Complexity</b>: Logarithmic.
-   template <class... Args>
-   BOOST_CONTAINER_FORCEINLINE std::pair<iterator, bool> try_emplace(const key_type& k, BOOST_FWD_REF(Args)... args)
-   {
-      return dtl::force_copy< std::pair<iterator, bool> >(
-         m_flat_tree.try_emplace(impl_const_iterator(), k, boost::forward<Args>(args)...));
-   }
-
-   //! <b>Requires</b>: value_type shall be EmplaceConstructible into map from piecewise_construct, 
-   //! forward_as_tuple(k), forward_as_tuple(forward<Args>(args)...).
-   //! 
-   //! <b>Effects</b>: If the map already contains an element whose key is equivalent to k, there is no effect. Otherwise
-   //! inserts an object of type value_type constructed with piecewise_construct, forward_as_tuple(k),
-   //! forward_as_tuple(forward<Args>(args)...).
-   //! 
-   //! <b>Returns</b>: The returned iterator points to the map element whose key is equivalent to k.
-   //! 
-   //! <b>Complexity</b>: Logarithmic in general, but amortized constant if value
-   //!   is inserted right before p.
-   template <class... Args>
-   BOOST_CONTAINER_FORCEINLINE iterator try_emplace(const_iterator hint, const key_type &k, BOOST_FWD_REF(Args)... args)
-   {
-      return dtl::force_copy<iterator>(m_flat_tree.try_emplace
-         (dtl::force_copy<impl_const_iterator>(hint), k, boost::forward<Args>(args)...).first);
-   }
-
-   //! <b>Requires</b>: value_type shall be EmplaceConstructible into map from piecewise_construct, 
-   //! forward_as_tuple(move(k)), forward_as_tuple(forward<Args>(args)...).
-   //! 
-   //! <b>Effects</b>: If the map already contains an element whose key is equivalent to k, there is no effect. Otherwise
-   //! inserts an object of type value_type constructed with piecewise_construct, forward_as_tuple(move(k)),
-   //! forward_as_tuple(forward<Args>(args)...).
-   //! 
-   //! <b>Returns</b>: The bool component of the returned pair is true if and only if the
-   //! insertion took place. The returned iterator points to the map element whose key is equivalent to k.
-   //! 
-   //! <b>Complexity</b>: Logarithmic search time plus linear insertion time in case the key is not present.
-   template <class... Args>
-   BOOST_CONTAINER_FORCEINLINE std::pair<iterator, bool> try_emplace(BOOST_RV_REF(key_type) k, BOOST_FWD_REF(Args)... args)
-   {
-      return dtl::force_copy< std::pair<iterator, bool> >
-         (m_flat_tree.try_emplace(impl_const_iterator(), boost::move(k), boost::forward<Args>(args)...));
-   }
-
-   //! <b>Requires</b>: value_type shall be EmplaceConstructible into map from piecewise_construct, 
-   //! forward_as_tuple(move(k)), forward_as_tuple(forward<Args>(args)...).
-   //! 
-   //! <b>Effects</b>: If the map already contains an element whose key is equivalent to k, there is no effect. Otherwise
-   //! inserts an object of type value_type constructed with piecewise_construct, forward_as_tuple(move(k)),
-   //! forward_as_tuple(forward<Args>(args)...).
-   //! 
-   //! <b>Returns</b>: The returned iterator points to the map element whose key is equivalent to k.
-   //! 
-   //! <b>Complexity</b>: Logarithmic in general, but amortized constant if value
-   //!   is inserted right before p. Linear insertion time in case no equivalent key is present.
-   template <class... Args>
-   BOOST_CONTAINER_FORCEINLINE iterator try_emplace(const_iterator hint, BOOST_RV_REF(key_type) k, BOOST_FWD_REF(Args)... args)
-   {
-      return dtl::force_copy<iterator>
-         (m_flat_tree.try_emplace(dtl::force_copy
-            <impl_const_iterator>(hint), boost::move(k), boost::forward<Args>(args)...).first);
-   }
-
-   #else // !defined(BOOST_NO_CXX11_VARIADIC_TEMPLATES)
-
-   #define BOOST_CONTAINER_FLAT_MAP_EMPLACE_CODE(N) \
-   BOOST_MOVE_TMPL_LT##N BOOST_MOVE_CLASS##N BOOST_MOVE_GT##N \
-   BOOST_CONTAINER_FORCEINLINE std::pair<iterator,bool> emplace(BOOST_MOVE_UREF##N)\
-   {\
-      return dtl::force_copy< std::pair<iterator, bool> >\
-         (m_flat_tree.emplace_unique(BOOST_MOVE_FWD##N));\
-   }\
-   \
-   BOOST_MOVE_TMPL_LT##N BOOST_MOVE_CLASS##N BOOST_MOVE_GT##N \
-   BOOST_CONTAINER_FORCEINLINE iterator emplace_hint(const_iterator hint BOOST_MOVE_I##N BOOST_MOVE_UREF##N)\
-   {\
-      return dtl::force_copy<iterator>(m_flat_tree.emplace_hint_unique\
-         (dtl::force_copy<impl_const_iterator>(hint) BOOST_MOVE_I##N BOOST_MOVE_FWD##N));\
-   }\
-   BOOST_MOVE_TMPL_LT##N BOOST_MOVE_CLASS##N BOOST_MOVE_GT##N \
-   BOOST_CONTAINER_FORCEINLINE std::pair<iterator, bool> try_emplace(const key_type& k BOOST_MOVE_I##N BOOST_MOVE_UREF##N)\
-   {\
-      return dtl::force_copy< std::pair<iterator, bool> >\
-         (m_flat_tree.try_emplace(impl_const_iterator(), k BOOST_MOVE_I##N BOOST_MOVE_FWD##N));\
-   }\
-   \
-   BOOST_MOVE_TMPL_LT##N BOOST_MOVE_CLASS##N BOOST_MOVE_GT##N \
-   BOOST_CONTAINER_FORCEINLINE iterator try_emplace(const_iterator hint, const key_type &k BOOST_MOVE_I##N BOOST_MOVE_UREF##N)\
-   {  return dtl::force_copy<iterator>(m_flat_tree.try_emplace\
-         (dtl::force_copy<impl_const_iterator>(hint), k BOOST_MOVE_I##N BOOST_MOVE_FWD##N).first); }\
-   \
-   BOOST_MOVE_TMPL_LT##N BOOST_MOVE_CLASS##N BOOST_MOVE_GT##N \
-   BOOST_CONTAINER_FORCEINLINE std::pair<iterator, bool> try_emplace(BOOST_RV_REF(key_type) k BOOST_MOVE_I##N BOOST_MOVE_UREF##N)\
-   {\
-      return dtl::force_copy< std::pair<iterator, bool> >\
-         (m_flat_tree.try_emplace(impl_const_iterator(), boost::move(k) BOOST_MOVE_I##N BOOST_MOVE_FWD##N));\
-   }\
-   \
-   BOOST_MOVE_TMPL_LT##N BOOST_MOVE_CLASS##N BOOST_MOVE_GT##N \
-   BOOST_CONTAINER_FORCEINLINE iterator try_emplace(const_iterator hint, BOOST_RV_REF(key_type) k BOOST_MOVE_I##N BOOST_MOVE_UREF##N)\
-   {  return dtl::force_copy<iterator>(m_flat_tree.try_emplace\
-      (dtl::force_copy<impl_const_iterator>(hint), boost::move(k) BOOST_MOVE_I##N BOOST_MOVE_FWD##N).first); }\
-   //
-   BOOST_MOVE_ITERATE_0TO9(BOOST_CONTAINER_FLAT_MAP_EMPLACE_CODE)
-   #undef BOOST_CONTAINER_FLAT_MAP_EMPLACE_CODE
-
-   #endif   // !defined(BOOST_NO_CXX11_VARIADIC_TEMPLATES)
-
-   //! <b>Effects</b>: Inserts x if and only if there is no element in the container
-   //!   with key equivalent to the key of x.
-   //!
-   //! <b>Returns</b>: The bool component of the returned pair is true if and only
-   //!   if the insertion takes place, and the iterator component of the pair
-   //!   points to the element with key equivalent to the key of x.
-   //!
-   //! <b>Complexity</b>: Logarithmic search time plus linear insertion
-   //!   to the elements with bigger keys than x.
-   //!
-   //! <b>Note</b>: If an element is inserted it might invalidate elements.
-   BOOST_CONTAINER_FORCEINLINE std::pair<iterator,bool> insert(const value_type& x)
-   {  return dtl::force_copy<std::pair<iterator,bool> >(
-         m_flat_tree.insert_unique(dtl::force<const impl_value_type>(x))); }
-
-   //! <b>Effects</b>: Inserts a new value_type move constructed from the pair if and
-   //! only if there is no element in the container with key equivalent to the key of x.
-   //!
-   //! <b>Returns</b>: The bool component of the returned pair is true if and only
-   //!   if the insertion takes place, and the iterator component of the pair
-   //!   points to the element with key equivalent to the key of x.
-   //!
-   //! <b>Complexity</b>: Logarithmic search time plus linear insertion
-   //!   to the elements with bigger keys than x.
-   //!
-   //! <b>Note</b>: If an element is inserted it might invalidate elements.
-   BOOST_CONTAINER_FORCEINLINE std::pair<iterator,bool> insert(BOOST_RV_REF(value_type) x)
-   {
-      return dtl::force_copy<std::pair<iterator,bool> >(
-         m_flat_tree.insert_unique(boost::move(dtl::force<impl_value_type>(x))));
-   }
-
-   //! <b>Effects</b>: Inserts a new value_type constructed from the pair if and
-   //! only if there is no element in the container with key equivalent to the key of x.
-   //!
-   //! <b>Returns</b>: The bool component of the returned pair is true if and only
-   //!   if the insertion takes place, and the iterator component of the pair
-   //!   points to the element with key equivalent to the key of x.
-   //!
-   //! <b>Complexity</b>: Logarithmic search time plus linear insertion
-   //!   to the elements with bigger keys than x.
-   //!
-   //! <b>Note</b>: If an element is inserted it might invalidate elements.
-   template <class Pair>
-   BOOST_CONTAINER_FORCEINLINE BOOST_CONTAINER_DOC1ST
-         ( std::pair<iterator BOOST_MOVE_I bool>
-         , typename dtl::enable_if_c<dtl::is_convertible<Pair BOOST_MOVE_I impl_value_type>::value
-            BOOST_MOVE_I std::pair<iterator BOOST_MOVE_I bool> >::type)
-      insert(BOOST_FWD_REF(Pair) x)
-   {
-      return dtl::force_copy<std::pair<iterator,bool> >
-         (m_flat_tree.emplace_unique(boost::forward<Pair>(x)));
-   }
-
-   //! <b>Effects</b>: Inserts a copy of x in the container if and only if there is
-   //!   no element in the container with key equivalent to the key of x.
-   //!   p is a hint pointing to where the insert should start to search.
-   //!
-   //! <b>Returns</b>: An iterator pointing to the element with key equivalent
-   //!   to the key of x.
-   //!
-   //! <b>Complexity</b>: Logarithmic search time (constant if x is inserted
-   //!   right before p) plus insertion linear to the elements with bigger keys than x.
-   //!
-   //! <b>Note</b>: If an element is inserted it might invalidate elements.
-   BOOST_CONTAINER_FORCEINLINE iterator insert(const_iterator p, const value_type& x)
-   {
-      return dtl::force_copy<iterator>(
-         m_flat_tree.insert_unique( dtl::force_copy<impl_const_iterator>(p)
-                                  , dtl::force<const impl_value_type>(x)));
-   }
-
-   //! <b>Effects</b>: Inserts an element move constructed from x in the container.
-   //!   p is a hint pointing to where the insert should start to search.
-   //!
-   //! <b>Returns</b>: An iterator pointing to the element with key equivalent to the key of x.
-   //!
-   //! <b>Complexity</b>: Logarithmic search time (constant if x is inserted
-   //!   right before p) plus insertion linear to the elements with bigger keys than x.
-   //!
-   //! <b>Note</b>: If an element is inserted it might invalidate elements.
-   BOOST_CONTAINER_FORCEINLINE iterator insert(const_iterator p, BOOST_RV_REF(value_type) x)
-   {
-      return dtl::force_copy<iterator>
-         (m_flat_tree.insert_unique( dtl::force_copy<impl_const_iterator>(p)
-                                   , boost::move(dtl::force<impl_value_type>(x))));
-   }
-
-   //! <b>Effects</b>: Inserts an element constructed from x in the container.
-   //!   p is a hint pointing to where the insert should start to search.
-   //!
-   //! <b>Returns</b>: An iterator pointing to the element with key equivalent to the key of x.
-   //!
-   //! <b>Complexity</b>: Logarithmic search time (constant if x is inserted
-   //!   right before p) plus insertion linear to the elements with bigger keys than x.
-   //!
-   //! <b>Note</b>: If an element is inserted it might invalidate elements.
-   template <class Pair>
-   BOOST_CONTAINER_FORCEINLINE BOOST_CONTAINER_DOC1ST
-         ( iterator
-         , typename dtl::enable_if_c<dtl::is_convertible<Pair BOOST_MOVE_I impl_value_type>::value
-            BOOST_MOVE_I iterator>::type)
-      insert(const_iterator p, BOOST_FWD_REF(Pair) x)
-   {
-      return dtl::force_copy<iterator>(
-         m_flat_tree.emplace_hint_unique(dtl::force_copy<impl_const_iterator>(p), boost::forward<Pair>(x)));
-   }
-
-   //! <b>Requires</b>: first, last are not iterators into *this.
-   //!
-   //! <b>Effects</b>: inserts each element from the range [first,last) if and only
-   //!   if there is no element with key equivalent to the key of that element.
-   //!
-   //! <b>Complexity</b>: N log(size()+N).
-   //!
-   //! <b>Note</b>: If an element is inserted it might invalidate elements.
-   template <class InputIterator>
-   BOOST_CONTAINER_FORCEINLINE void insert(InputIterator first, InputIterator last)
-   {  m_flat_tree.insert_unique(first, last);  }
-
-   //! <b>Requires</b>: first, last are not iterators into *this.
-   //!
-   //! <b>Requires</b>: [first ,last) must be ordered according to the predicate and must be
-   //! unique values.
-   //!
-   //! <b>Effects</b>: inserts each element from the range [first,last) if and only
-   //!   if there is no element with key equivalent to the key of that element. This
-   //!   function is more efficient than the normal range creation for ordered ranges.
-   //!
-   //! <b>Complexity</b>: Linear.
-   //!
-   //! <b>Note</b>: If an element is inserted it might invalidate elements.
-   //!
-   //! <b>Note</b>: Non-standard extension.
-   template <class InputIterator>
-   BOOST_CONTAINER_FORCEINLINE void insert(ordered_unique_range_t, InputIterator first, InputIterator last)
-      {  m_flat_tree.insert_unique(ordered_unique_range, first, last); }
-
-#if !defined(BOOST_NO_CXX11_HDR_INITIALIZER_LIST)
-   //! <b>Effects</b>: inserts each element from the range [il.begin(), il.end()) if and only
-   //!   if there is no element with key equivalent to the key of that element.
-   //!
-   //! <b>Complexity</b>: N log(N).
-   //!
-   //! <b>Note</b>: If an element is inserted it might invalidate elements.
-   BOOST_CONTAINER_FORCEINLINE void insert(std::initializer_list<value_type> il)
-   {
-      m_flat_tree.insert_unique( dtl::force<impl_initializer_list>(il).begin()
-                               , dtl::force<impl_initializer_list>(il).end());
-   }
-
-   //! <b>Requires</b>: [il.begin(), il.end()) must be ordered according to the predicate and must be
-   //! unique values.
-   //!
-   //! <b>Effects</b>: inserts each element from the range [il.begin(), il.end()) if and only
-   //!   if there is no element with key equivalent to the key of that element. This
-   //!   function is more efficient than the normal range creation for ordered ranges.
-   //!
-   //! <b>Complexity</b>: Linear.
-   //!
-   //! <b>Note</b>: If an element is inserted it might invalidate elements.
-   //!
-   //! <b>Note</b>: Non-standard extension.
-   BOOST_CONTAINER_FORCEINLINE void insert(ordered_unique_range_t, std::initializer_list<value_type> il)
-   {
-      m_flat_tree.insert_unique(ordered_unique_range
-                               , dtl::force<impl_initializer_list>(il).begin()
-                               , dtl::force<impl_initializer_list>(il).end());
-   }
-#endif
-
-   //! <b>Requires</b>: this->get_allocator() == source.get_allocator().
-   //!
-   //! <b>Effects</b>: Move-inserts each element from source into *this a using
-   //!   the comparison object of *this. If there is an element in a with key equivalent to the
-   //!   key of an element from source, then that element is not moved from source.
-   //!
-   //! <b>Complexity</b>: Linear in this->size() + source.size().
-   //!
-   //! <b>Note</b>: Invalidates all iterators and references.
-   template<class C2>
-   BOOST_CONTAINER_FORCEINLINE void merge(flat_map<Key, T, C2, AllocatorOrContainer>& source)
-   {  m_flat_tree.merge_unique(source.tree());   }
-
-   //! @copydoc ::boost::container::flat_map::merge(flat_map<Key, T, C2, AllocatorOrContainer>&)
-   template<class C2>
-   BOOST_CONTAINER_FORCEINLINE void merge(BOOST_RV_REF_BEG flat_map<Key, T, C2, AllocatorOrContainer> BOOST_RV_REF_END source)
-   {  return this->merge(static_cast<flat_map<Key, T, C2, AllocatorOrContainer>&>(source)); }
-
-   //! @copydoc ::boost::container::flat_map::merge(flat_map<Key, T, C2, AllocatorOrContainer>&)
-   template<class C2>
-   BOOST_CONTAINER_FORCEINLINE void merge(flat_multimap<Key, T, C2, AllocatorOrContainer>& source)
-   {  m_flat_tree.merge_unique(source.tree());   }
-
-   //! @copydoc ::boost::container::flat_map::merge(flat_map<Key, T, C2, AllocatorOrContainer>&)
-   template<class C2>
-   BOOST_CONTAINER_FORCEINLINE void merge(BOOST_RV_REF_BEG flat_multimap<Key, T, C2, AllocatorOrContainer> BOOST_RV_REF_END source)
-   {  return this->merge(static_cast<flat_multimap<Key, T, C2, AllocatorOrContainer>&>(source));  }
-
-   //! <b>Effects</b>: Erases the element pointed to by p.
-   //!
-   //! <b>Returns</b>: Returns an iterator pointing to the element immediately
-   //!   following q prior to the element being erased. If no such element exists,
-   //!   returns end().
-   //!
-   //! <b>Complexity</b>: Linear to the elements with keys bigger than p
-   //!
-   //! <b>Note</b>: Invalidates elements with keys
-   //!   not less than the erased element.
-   BOOST_CONTAINER_FORCEINLINE iterator erase(const_iterator p)
-   {
-      return dtl::force_copy<iterator>
-         (m_flat_tree.erase(dtl::force_copy<impl_const_iterator>(p)));
-   }
-
-   //! <b>Effects</b>: If present, erases the element in the container with key equivalent to x.
-   //!
-   //! <b>Returns</b>: Returns the number of erased elements (0/1).
-   //!
-   //! <b>Complexity</b>: Logarithmic search time plus erasure time
-   //!   linear to the elements with bigger keys.
-   BOOST_CONTAINER_FORCEINLINE size_type erase(const key_type& x)
-      { return m_flat_tree.erase_unique(x); }
-
-   //! <b>Effects</b>: Erases all the elements in the range [first, last).
-   //!
-   //! <b>Returns</b>: Returns last.
-   //!
-   //! <b>Complexity</b>: size()*N where N is the distance from first to last.
-   //!
-   //! <b>Complexity</b>: Logarithmic search time plus erasure time
-   //!   linear to the elements with bigger keys.
-   BOOST_CONTAINER_FORCEINLINE iterator erase(const_iterator first, const_iterator last)
-   {
-      return dtl::force_copy<iterator>(
-         m_flat_tree.erase( dtl::force_copy<impl_const_iterator>(first)
-                          , dtl::force_copy<impl_const_iterator>(last)));
-   }
-
-   //! <b>Effects</b>: Swaps the contents of *this and x.
-   //!
-   //! <b>Throws</b>: Nothing.
-   //!
-   //! <b>Complexity</b>: Constant.
-   BOOST_CONTAINER_FORCEINLINE void swap(flat_map& x)
-      BOOST_NOEXCEPT_IF(  allocator_traits_type::is_always_equal::value
-                                 && boost::container::dtl::is_nothrow_swappable<Compare>::value )
-   { m_flat_tree.swap(x.m_flat_tree); }
-
-   //! <b>Effects</b>: erase(begin(),end()).
-   //!
-   //! <b>Postcondition</b>: size() == 0.
-   //!
-   //! <b>Complexity</b>: linear in size().
-   BOOST_CONTAINER_FORCEINLINE void clear() BOOST_NOEXCEPT_OR_NOTHROW
-      { m_flat_tree.clear(); }
-
-   //////////////////////////////////////////////
-   //
-   //                observers
-   //
-   //////////////////////////////////////////////
-
-   //! <b>Effects</b>: Returns the comparison object out
-   //!   of which a was constructed.
-   //!
-   //! <b>Complexity</b>: Constant.
-   BOOST_CONTAINER_ATTRIBUTE_NODISCARD BOOST_CONTAINER_FORCEINLINE
-      key_compare key_comp() const
-      { return dtl::force_copy<key_compare>(m_flat_tree.key_comp()); }
-
-   //! <b>Effects</b>: Returns an object of value_compare constructed out
-   //!   of the comparison object.
-   //!
-   //! <b>Complexity</b>: Constant.
-   BOOST_CONTAINER_ATTRIBUTE_NODISCARD BOOST_CONTAINER_FORCEINLINE
-      value_compare value_comp() const
-      { return value_compare(dtl::force_copy<key_compare>(m_flat_tree.key_comp())); }
-
-   //////////////////////////////////////////////
-   //
-   //              map operations
-   //
-   //////////////////////////////////////////////
-
-   //! <b>Returns</b>: An iterator pointing to an element with the key
-   //!   equivalent to x, or end() if such an element is not found.
-   //!
-   //! <b>Complexity</b>: Logarithmic.
-   BOOST_CONTAINER_ATTRIBUTE_NODISCARD BOOST_CONTAINER_FORCEINLINE
-      iterator find(const key_type& x)
-      { return dtl::force_copy<iterator>(m_flat_tree.find(x)); }
-
-   //! <b>Returns</b>: A const_iterator pointing to an element with the key
-   //!   equivalent to x, or end() if such an element is not found.
-   //!
-   //! <b>Complexity</b>: Logarithmic.
-   BOOST_CONTAINER_ATTRIBUTE_NODISCARD BOOST_CONTAINER_FORCEINLINE
-      const_iterator find(const key_type& x) const
-      { return dtl::force_copy<const_iterator>(m_flat_tree.find(x)); }
-
-   //! <b>Requires</b>: This overload is available only if
-   //! key_compare::is_transparent exists.
-   //!
-   //! <b>Returns</b>: An iterator pointing to an element with the key
-   //!   equivalent to x, or end() if such an element is not found.
-   //!
-   //! <b>Complexity</b>: Logarithmic.
-   template<class K>
-   BOOST_CONTAINER_ATTRIBUTE_NODISCARD BOOST_CONTAINER_FORCEINLINE
-      iterator find(const K& x)
-      { return dtl::force_copy<iterator>(m_flat_tree.find(x)); }
-
-   //! <b>Requires</b>: This overload is available only if
-   //! key_compare::is_transparent exists.
-   //!
-   //! <b>Returns</b>: A const_iterator pointing to an element with the key
-   //!   equivalent to x, or end() if such an element is not found.
-   //!
-   //! <b>Complexity</b>: Logarithmic.
-   template<class K>
-   BOOST_CONTAINER_ATTRIBUTE_NODISCARD BOOST_CONTAINER_FORCEINLINE
-      const_iterator find(const K& x) const
-      { return dtl::force_copy<const_iterator>(m_flat_tree.find(x)); }
-
-   //! <b>Returns</b>: The number of elements with key equivalent to x.
-   //!
-   //! <b>Complexity</b>: log(size())+count(k)
-   BOOST_CONTAINER_ATTRIBUTE_NODISCARD BOOST_CONTAINER_FORCEINLINE
-      size_type count(const key_type& x) const
-      {  return static_cast<size_type>(m_flat_tree.find(x) != m_flat_tree.end());  }
-
-   //! <b>Requires</b>: This overload is available only if
-   //! key_compare::is_transparent exists.
-   //!
-   //! <b>Returns</b>: The number of elements with key equivalent to x.
-   //!
-   //! <b>Complexity</b>: log(size())+count(k)
-   template<class K>
-   BOOST_CONTAINER_ATTRIBUTE_NODISCARD BOOST_CONTAINER_FORCEINLINE
-      size_type count(const K& x) const
-      //Don't use find() != end optimization here as transparent comparators with key K might
-      //return a different range than key_type (which can only return a single element range)
-      {  return m_flat_tree.count(x);  }
-
-   //! <b>Returns</b>: Returns true if there is an element with key
-   //!   equivalent to key in the container, otherwise false.
-   //!
-   //! <b>Complexity</b>: log(size()).
-   BOOST_CONTAINER_ATTRIBUTE_NODISCARD BOOST_CONTAINER_FORCEINLINE
-      bool contains(const key_type& x) const
-      {  return m_flat_tree.find(x) != m_flat_tree.end();  }
-
-   //! <b>Requires</b>: This overload is available only if
-   //! key_compare::is_transparent exists.
-   //!
-   //! <b>Returns</b>: Returns true if there is an element with key
-   //!   equivalent to key in the container, otherwise false.
-   //!
-   //! <b>Complexity</b>: log(size()).
-   template<typename K>
-   BOOST_CONTAINER_ATTRIBUTE_NODISCARD BOOST_CONTAINER_FORCEINLINE
-      bool contains(const K& x) const
-      {  return m_flat_tree.find(x) != m_flat_tree.end();  }
-
-   //! <b>Returns</b>: An iterator pointing to the first element with key not less
-   //!   than x, or end() if such an element is not found.
-   //!
-   //! <b>Complexity</b>: Logarithmic.
-   BOOST_CONTAINER_ATTRIBUTE_NODISCARD BOOST_CONTAINER_FORCEINLINE
-      iterator lower_bound(const key_type& x)
-      {  return dtl::force_copy<iterator>(m_flat_tree.lower_bound(x)); }
-
-   //! <b>Returns</b>: A const iterator pointing to the first element with key not
-   //!   less than x, or end() if such an element is not found.
-   //!
-   //! <b>Complexity</b>: Logarithmic.
-   BOOST_CONTAINER_ATTRIBUTE_NODISCARD BOOST_CONTAINER_FORCEINLINE
-      const_iterator lower_bound(const key_type& x) const
-      {  return dtl::force_copy<const_iterator>(m_flat_tree.lower_bound(x)); }
-
-   //! <b>Requires</b>: This overload is available only if
-   //! key_compare::is_transparent exists.
-   //!
-   //! <b>Returns</b>: An iterator pointing to the first element with key not less
-   //!   than x, or end() if such an element is not found.
-   //!
-   //! <b>Complexity</b>: Logarithmic.
-   template<class K>
-   BOOST_CONTAINER_ATTRIBUTE_NODISCARD BOOST_CONTAINER_FORCEINLINE
-      iterator lower_bound(const K& x)
-      {  return dtl::force_copy<iterator>(m_flat_tree.lower_bound(x)); }
-
-   //! <b>Requires</b>: This overload is available only if
-   //! key_compare::is_transparent exists.
-   //!
-   //! <b>Returns</b>: A const iterator pointing to the first element with key not
-   //!   less than x, or end() if such an element is not found.
-   //!
-   //! <b>Complexity</b>: Logarithmic.
-   template<class K>
-   BOOST_CONTAINER_ATTRIBUTE_NODISCARD BOOST_CONTAINER_FORCEINLINE
-      const_iterator lower_bound(const K& x) const
-      {  return dtl::force_copy<const_iterator>(m_flat_tree.lower_bound(x)); }
-
-   //! <b>Returns</b>: An iterator pointing to the first element with key greater
-   //!   than x, or end() if such an element is not found.
-   //!
-   //! <b>Complexity</b>: Logarithmic.
-   BOOST_CONTAINER_ATTRIBUTE_NODISCARD BOOST_CONTAINER_FORCEINLINE
-      iterator upper_bound(const key_type& x)
-      {  return dtl::force_copy<iterator>(m_flat_tree.upper_bound(x)); }
-
-   //! <b>Returns</b>: A const iterator pointing to the first element with key
-   //!   greater than x, or end() if such an element is not found.
-   //!
-   //! <b>Complexity</b>: Logarithmic.
-   BOOST_CONTAINER_ATTRIBUTE_NODISCARD BOOST_CONTAINER_FORCEINLINE
-      const_iterator upper_bound(const key_type& x) const
-      {  return dtl::force_copy<const_iterator>(m_flat_tree.upper_bound(x)); }
-
-   //! <b>Requires</b>: This overload is available only if
-   //! key_compare::is_transparent exists.
-   //!
-   //! <b>Returns</b>: An iterator pointing to the first element with key greater
-   //!   than x, or end() if such an element is not found.
-   //!
-   //! <b>Complexity</b>: Logarithmic.
-   template<class K>
-   BOOST_CONTAINER_ATTRIBUTE_NODISCARD BOOST_CONTAINER_FORCEINLINE
-      iterator upper_bound(const K& x)
-      {  return dtl::force_copy<iterator>(m_flat_tree.upper_bound(x)); }
-
-   //! <b>Requires</b>: This overload is available only if
-   //! key_compare::is_transparent exists.
-   //!
-   //! <b>Returns</b>: A const iterator pointing to the first element with key
-   //!   greater than x, or end() if such an element is not found.
-   //!
-   //! <b>Complexity</b>: Logarithmic.
-   template<class K>
-   BOOST_CONTAINER_ATTRIBUTE_NODISCARD BOOST_CONTAINER_FORCEINLINE
-      const_iterator upper_bound(const K& x) const
-      {  return dtl::force_copy<const_iterator>(m_flat_tree.upper_bound(x)); }
-
-   //! <b>Effects</b>: Equivalent to std::make_pair(this->lower_bound(k), this->upper_bound(k)).
-   //!
-   //! <b>Complexity</b>: Logarithmic.
-   BOOST_CONTAINER_ATTRIBUTE_NODISCARD BOOST_CONTAINER_FORCEINLINE
-      std::pair<iterator,iterator> equal_range(const key_type& x)
-      {  return dtl::force_copy<std::pair<iterator,iterator> >(m_flat_tree.lower_bound_range(x)); }
-
-   //! <b>Effects</b>: Equivalent to std::make_pair(this->lower_bound(k), this->upper_bound(k)).
-   //!
-   //! <b>Complexity</b>: Logarithmic.
-   BOOST_CONTAINER_ATTRIBUTE_NODISCARD BOOST_CONTAINER_FORCEINLINE
-      std::pair<const_iterator, const_iterator> equal_range(const key_type& x) const
-      {  return dtl::force_copy<std::pair<const_iterator,const_iterator> >(m_flat_tree.lower_bound_range(x)); }
-
-   //! <b>Requires</b>: This overload is available only if
-   //! key_compare::is_transparent exists.
-   //!
-   //! <b>Effects</b>: Equivalent to std::make_pair(this->lower_bound(k), this->upper_bound(k)).
-   //!
-   //! <b>Complexity</b>: Logarithmic.
-   template<class K>
-   BOOST_CONTAINER_ATTRIBUTE_NODISCARD BOOST_CONTAINER_FORCEINLINE
-      std::pair<iterator,iterator> equal_range(const K& x)
-      //Don't use lower_bound_range optimization here as transparent comparators with key K might
-      //return a different range than key_type (which can only return a single element range)
-      {  return dtl::force_copy<std::pair<iterator,iterator> >(m_flat_tree.equal_range(x)); }
-
-   //! <b>Requires</b>: This overload is available only if
-   //! key_compare::is_transparent exists.
-   //!
-   //! <b>Effects</b>: Equivalent to std::make_pair(this->lower_bound(k), this->upper_bound(k)).
-   //!
-   //! <b>Complexity</b>: Logarithmic.
-   template<class K>
-   BOOST_CONTAINER_ATTRIBUTE_NODISCARD BOOST_CONTAINER_FORCEINLINE
-      std::pair<const_iterator, const_iterator> equal_range(const K& x) const
-      //Don't use lower_bound_range optimization here as transparent comparators with key K might
-      //return a different range than key_type (which can only return a single element range)
-      {  return dtl::force_copy<std::pair<const_iterator,const_iterator> >(m_flat_tree.equal_range(x)); }
-
-   //! <b>Effects</b>: Extracts the internal sequence container.
-   //!
-   //! <b>Complexity</b>: Same as the move constructor of sequence_type, usually constant.
-   //!
-   //! <b>Postcondition</b>: this->empty()
-   //!
-   //! <b>Throws</b>: If secuence_type's move constructor throws 
-   BOOST_CONTAINER_ATTRIBUTE_NODISCARD BOOST_CONTAINER_FORCEINLINE sequence_type extract_sequence()
-   {
-      return boost::move(dtl::force<sequence_type>(m_flat_tree.get_sequence_ref()));
-   }
-
-   //! <b>Effects</b>: Discards the internally hold sequence container and adopts the
-   //!   one passed externally using the move assignment. Erases non-unique elements.
-   //!
-   //! <b>Complexity</b>: Assuming O(1) move assignment, O(NlogN) with N = seq.size()
-   //!
-   //! <b>Throws</b>: If the comparison or the move constructor throws
-   BOOST_CONTAINER_FORCEINLINE void adopt_sequence(BOOST_RV_REF(sequence_type) seq)
-   {  this->m_flat_tree.adopt_sequence_unique(boost::move(dtl::force<impl_sequence_type>(seq)));  }
-
-   //! <b>Requires</b>: seq shall be ordered according to this->compare()
-   //!   and shall contain unique elements.
-   //!
-   //! <b>Effects</b>: Discards the internally hold sequence container and adopts the
-   //!   one passed externally using the move assignment.
-   //!
-   //! <b>Complexity</b>: Assuming O(1) move assignment, O(1)
-   //!
-   //! <b>Throws</b>: If the move assignment throws
-   BOOST_CONTAINER_FORCEINLINE void adopt_sequence(ordered_unique_range_t, BOOST_RV_REF(sequence_type) seq)
-   {  this->m_flat_tree.adopt_sequence_unique(ordered_unique_range_t(), boost::move(dtl::force<impl_sequence_type>(seq)));  }
-
-   //! <b>Effects</b>: Returns a const view of the underlying sequence.
-   //!
-   //! <b>Complexity</b>: Constant
-   //!
-   //! <b>Throws</b>: Nothing
-   BOOST_CONTAINER_FORCEINLINE const sequence_type & sequence() const BOOST_NOEXCEPT
-   {  return dtl::force<sequence_type>(m_flat_tree.get_sequence_cref());  }
-
-   //! <b>Effects</b>: Returns true if x and y are equal
-   //!
-   //! <b>Complexity</b>: Linear to the number of elements in the container.
-   BOOST_CONTAINER_ATTRIBUTE_NODISCARD BOOST_CONTAINER_FORCEINLINE
-      friend bool operator==(const flat_map& x, const flat_map& y)
-   {  return x.size() == y.size() && ::boost::container::algo_equal(x.begin(), x.end(), y.begin());  }
-
-   //! <b>Effects</b>: Returns true if x and y are unequal
-   //!
-   //! <b>Complexity</b>: Linear to the number of elements in the container.
-   BOOST_CONTAINER_ATTRIBUTE_NODISCARD BOOST_CONTAINER_FORCEINLINE
-      friend bool operator!=(const flat_map& x, const flat_map& y)
-   {  return !(x == y); }
-
-   //! <b>Effects</b>: Returns true if x is less than y
-   //!
-   //! <b>Complexity</b>: Linear to the number of elements in the container.
-   BOOST_CONTAINER_ATTRIBUTE_NODISCARD BOOST_CONTAINER_FORCEINLINE
-      friend bool operator<(const flat_map& x, const flat_map& y)
-   {  return ::boost::container::algo_lexicographical_compare(x.begin(), x.end(), y.begin(), y.end());  }
-
-   //! <b>Effects</b>: Returns true if x is greater than y
-   //!
-   //! <b>Complexity</b>: Linear to the number of elements in the container.
-   BOOST_CONTAINER_ATTRIBUTE_NODISCARD BOOST_CONTAINER_FORCEINLINE
-      friend bool operator>(const flat_map& x, const flat_map& y)
-   {  return y < x;  }
-
-   //! <b>Effects</b>: Returns true if x is equal or less than y
-   //!
-   //! <b>Complexity</b>: Linear to the number of elements in the container.
-   BOOST_CONTAINER_ATTRIBUTE_NODISCARD BOOST_CONTAINER_FORCEINLINE
-      friend bool operator<=(const flat_map& x, const flat_map& y)
-   {  return !(y < x);  }
-
-   //! <b>Effects</b>: Returns true if x is equal or greater than y
-   //!
-   //! <b>Complexity</b>: Linear to the number of elements in the container.
-   BOOST_CONTAINER_ATTRIBUTE_NODISCARD BOOST_CONTAINER_FORCEINLINE
-      friend bool operator>=(const flat_map& x, const flat_map& y)
-   {  return !(x < y);  }
-
-   //! <b>Effects</b>: x.swap(y)
-   //!
-   //! <b>Complexity</b>: Constant.
-   BOOST_CONTAINER_FORCEINLINE friend void swap(flat_map& x, flat_map& y)
-       BOOST_NOEXCEPT_IF(BOOST_NOEXCEPT(x.swap(y)))
-   {  x.swap(y);  }
-
-   #ifndef BOOST_CONTAINER_DOXYGEN_INVOKED
-   private:
-   mapped_type &priv_subscript(const key_type& k)
-   {
-      iterator i = this->lower_bound(k);
-      // i->first is greater than or equivalent to k.
-      if (i == end() || key_comp()(k, (*i).first)){
-         dtl::value_init<mapped_type> m;
-         impl_value_type v(k, ::boost::move(m.m_t));
-         i = this->insert(i, ::boost::move(v));
-      }
-      return (*i).second;
-   }
-   mapped_type &priv_subscript(BOOST_RV_REF(key_type) mk)
-   {
-      key_type &k = mk;
-      iterator i = this->lower_bound(k);
-      // i->first is greater than or equivalent to k.
-      if (i == end() || key_comp()(k, (*i).first)){
-         dtl::value_init<mapped_type> m;
-         impl_value_type v(::boost::move(k), ::boost::move(m.m_t));
-         i = this->insert(i, ::boost::move(v));
-      }
-      return (*i).second;
-   }
-   #endif   //#ifndef BOOST_CONTAINER_DOXYGEN_INVOKED
-};
-
-#ifndef BOOST_CONTAINER_NO_CXX17_CTAD
-
-template <typename InputIterator>
-flat_map(InputIterator, InputIterator) ->
-   flat_map< it_based_non_const_first_type_t<InputIterator>
-           , it_based_second_type_t<InputIterator>>;
-
-template < typename InputIterator, typename AllocatorOrCompare>
-    flat_map(InputIterator, InputIterator, AllocatorOrCompare const&) ->
-    flat_map< it_based_non_const_first_type_t<InputIterator>
-            , it_based_second_type_t<InputIterator>
-            , typename dtl::if_c< // Compare
-                dtl::is_allocator<AllocatorOrCompare>::value
-                , std::less<it_based_non_const_first_type_t<InputIterator>>
-                , AllocatorOrCompare
-            >::type
-            , typename dtl::if_c< // Allocator
-                dtl::is_allocator<AllocatorOrCompare>::value
-                , AllocatorOrCompare
-                , new_allocator<std::pair<it_based_non_const_first_type_t<InputIterator>, it_based_second_type_t<InputIterator>>>
-                >::type
-            >;
-
-template < typename InputIterator, typename Compare, typename Allocator
-         , typename = dtl::require_nonallocator_t<Compare>
-         , typename = dtl::require_allocator_t<Allocator>>
-flat_map(InputIterator, InputIterator, Compare const&, Allocator const&) ->
-   flat_map< it_based_non_const_first_type_t<InputIterator>
-           , it_based_second_type_t<InputIterator>
-           , Compare
-           , Allocator>;
-
-template <typename InputIterator>
-flat_map(ordered_unique_range_t, InputIterator, InputIterator) ->
-   flat_map< it_based_non_const_first_type_t<InputIterator>
-           , it_based_second_type_t<InputIterator>>;
-
-template < typename InputIterator, typename AllocatorOrCompare>
-flat_map(ordered_unique_range_t, InputIterator, InputIterator, AllocatorOrCompare const&) ->
-   flat_map< it_based_non_const_first_type_t<InputIterator>
-           , it_based_second_type_t<InputIterator>
-           , typename dtl::if_c<   // Compare
-               dtl::is_allocator<AllocatorOrCompare>::value
-               , std::less<it_based_non_const_first_type_t<InputIterator>>
-               , AllocatorOrCompare
-               >::type
-           , typename dtl::if_c<   // Allocator
-               dtl::is_allocator<AllocatorOrCompare>::value
-               , AllocatorOrCompare
-               , new_allocator<std::pair<it_based_non_const_first_type_t<InputIterator>, it_based_second_type_t<InputIterator>>>
-               >::type
-           >;
-
-template < typename InputIterator, typename Compare, typename Allocator
-         , typename = dtl::require_nonallocator_t<Compare>
-         , typename = dtl::require_allocator_t<Allocator>>
-flat_map(ordered_unique_range_t, InputIterator, InputIterator, Compare const&, Allocator const&) ->
-   flat_map< it_based_non_const_first_type_t<InputIterator>
-           , it_based_second_type_t<InputIterator>
-           , Compare
-           , Allocator>;
-
-#endif
-
-#ifndef BOOST_CONTAINER_DOXYGEN_INVOKED
-
-}  //namespace container {
-
-//!has_trivial_destructor_after_move<> == true_type
-//!specialization for optimizations
-template <class Key, class T, class Compare, class AllocatorOrContainer>
-struct has_trivial_destructor_after_move<boost::container::flat_map<Key, T, Compare, AllocatorOrContainer> >
-{
-   typedef ::boost::container::dtl::pair<Key, T> value_t;
-   typedef typename ::boost::container::dtl::container_or_allocator_rebind<AllocatorOrContainer, value_t>::type alloc_or_cont_t;
-   typedef ::boost::container::dtl::flat_tree<value_t,::boost::container::dtl::select1st<Key>, Compare, alloc_or_cont_t> tree;
-   static const bool value = ::boost::has_trivial_destructor_after_move<tree>::value;
-};
-
-namespace container {
-
-#endif   //#ifndef BOOST_CONTAINER_DOXYGEN_INVOKED
-
-//! A flat_multimap is a kind of associative container that supports equivalent keys
-//! (possibly containing multiple copies of the same key value) and provides for
-//! fast retrieval of values of another type T based on the keys. 
-//!
-//! A flat_multimap satisfies all of the requirements of a container and of a reversible
-//! container and of an associative container. For a
-//! flat_multimap<Key,T> the key_type is Key and the value_type is std::pair<Key,T>
-//! (unlike std::multimap<Key, T> which value_type is std::pair<<b>const</b> Key, T>).
-//!
-//! flat_multimap is similar to std::multimap but it's implemented by as an ordered sequence container.
-//! The underlying sequence container is by default <i>vector</i> but it can also work
-//! user-provided vector-like SequenceContainers (like <i>static_vector</i> or <i>small_vector</i>).
-//!
-//! Using vector-like sequence containers means that inserting a new element into a flat_multimap might invalidate
-//! previous iterators and references (unless that sequence container is <i>stable_vector</i> or a similar
-//! container that offers stable pointers and references). Similarly, erasing an element might invalidate
-//! iterators and references pointing to elements that come after (their keys are bigger) the erased element.
-//!
-//! This container provides random-access iterators.
-//!
-//! \tparam Key is the key_type of the map
-//! \tparam Value is the <code>mapped_type</code>
-//! \tparam Compare is the ordering function for Keys (e.g. <i>std::less<Key></i>).
-//! \tparam AllocatorOrContainer is either:
-//!   - The allocator to allocate <code>value_type</code>s (e.g. <i>allocator< std::pair<Key, T> > </i>).
-//!     (in this case <i>sequence_type</i> will be vector<value_type, AllocatorOrContainer>)
-//!   - The SequenceContainer to be used as the underlying <i>sequence_type</i>. It must be a vector-like
-//!     sequence container with random-access iterators.
-#ifdef BOOST_CONTAINER_DOXYGEN_INVOKED
-template <class Key, class T, class Compare = std::less<Key>, class AllocatorOrContainer = new_allocator< std::pair< Key, T> > >
-#else
-template <class Key, class T, class Compare, class AllocatorOrContainer>
-#endif
-class flat_multimap
-{
-   #ifndef BOOST_CONTAINER_DOXYGEN_INVOKED
-   private:
-   BOOST_COPYABLE_AND_MOVABLE(flat_multimap)
-   typedef dtl::flat_tree<
-                           std::pair<Key, T>,
-                           dtl::select1st<Key>,
-                           Compare,
-                           AllocatorOrContainer> tree_t;
-   //This is the real tree stored here. It's based on a movable pair
-   typedef dtl::flat_tree<
-                           dtl::pair<Key, T>,
-                           dtl::select1st<Key>,
-                           Compare,
-                           typename dtl::container_or_allocator_rebind<AllocatorOrContainer, dtl::pair<Key, T> >::type
-                           > impl_tree_t;
-   impl_tree_t m_flat_tree;  // flat tree representing flat_map
-
-   typedef typename impl_tree_t::value_type              impl_value_type;
-   typedef typename impl_tree_t::const_iterator          impl_const_iterator;
-   typedef typename impl_tree_t::iterator                impl_iterator;
-   typedef typename impl_tree_t::allocator_type          impl_allocator_type;
-   #if !defined(BOOST_NO_CXX11_HDR_INITIALIZER_LIST)
-   typedef std::initializer_list<impl_value_type>        impl_initializer_list;
-   #endif
-
-   typedef dtl::flat_tree_value_compare
-      < Compare
-      , dtl::select1st<Key>
-      , std::pair<Key, T> >                                 value_compare_t;
-   typedef typename tree_t::iterator                        iterator_t;
-   typedef typename tree_t::const_iterator                  const_iterator_t;
-   typedef typename tree_t::reverse_iterator                reverse_iterator_t;
-   typedef typename tree_t::const_reverse_iterator          const_reverse_iterator_t;
-
-   public:
-   typedef typename impl_tree_t::stored_allocator_type      impl_stored_allocator_type;
-   typedef typename impl_tree_t::sequence_type              impl_sequence_type;
-
-   BOOST_CONTAINER_FORCEINLINE impl_tree_t &tree()
-   {  return m_flat_tree;  }
-
-   BOOST_CONTAINER_FORCEINLINE const impl_tree_t &tree() const
-   {  return m_flat_tree;  }
-
-   private:
-   #endif   //#ifndef BOOST_CONTAINER_DOXYGEN_INVOKED
-
-   public:
-
-   //////////////////////////////////////////////
-   //
-   //                    types
-   //
-   //////////////////////////////////////////////
-   typedef Key                                                                      key_type;
-   typedef T                                                                        mapped_type;
-   typedef Compare                                                                  key_compare;
-   typedef std::pair<Key, T>                                                        value_type;
-   typedef typename BOOST_CONTAINER_IMPDEF(tree_t::sequence_type)                   sequence_type;
-   typedef typename sequence_type::allocator_type                                   allocator_type;
-   typedef ::boost::container::allocator_traits<allocator_type>                     allocator_traits_type;
-   typedef typename sequence_type::pointer                                          pointer;
-   typedef typename sequence_type::const_pointer                                    const_pointer;
-   typedef typename sequence_type::reference                                        reference;
-   typedef typename sequence_type::const_reference                                  const_reference;
-   typedef typename sequence_type::size_type                                        size_type;
-   typedef typename sequence_type::difference_type                                  difference_type;
-   typedef typename BOOST_CONTAINER_IMPDEF(tree_t::stored_allocator_type)           stored_allocator_type;
-   typedef typename BOOST_CONTAINER_IMPDEF(tree_t::value_compare)                   value_compare;
-
-   typedef typename sequence_type::iterator                                         iterator;
-   typedef typename sequence_type::const_iterator                                   const_iterator;
-   typedef typename sequence_type::reverse_iterator                                 reverse_iterator;
-   typedef typename sequence_type::const_reverse_iterator                           const_reverse_iterator;
-   typedef BOOST_CONTAINER_IMPDEF(impl_value_type)                                  movable_value_type;
-
-   //AllocatorOrContainer::value_type must be std::pair<Key, T>
-   BOOST_STATIC_ASSERT((dtl::is_same<std::pair<Key, T>, value_type>::value));
-
-   //////////////////////////////////////////////
-   //
-   //          construct/copy/destroy
-   //
-   //////////////////////////////////////////////
-
-   //! <b>Effects</b>: Default constructs an empty flat_map.
-   //!
-   //! <b>Complexity</b>: Constant.
-   BOOST_CONTAINER_FORCEINLINE flat_multimap()
-      BOOST_NOEXCEPT_IF(dtl::is_nothrow_default_constructible<AllocatorOrContainer>::value &&
-                        dtl::is_nothrow_default_constructible<Compare>::value)
-      : m_flat_tree()
-   {}
-
-   //! <b>Effects</b>: Constructs an empty flat_multimap using the specified allocator.
-   //!
-   //! <b>Complexity</b>: Constant.
-   BOOST_CONTAINER_FORCEINLINE explicit flat_multimap(const allocator_type& a)
-      : m_flat_tree(dtl::force<const impl_allocator_type>(a))
-   {}
-
-   //! <b>Effects</b>: Constructs an empty flat_multimap using the specified comparison
-   //!   object .
-   //!
-   //! <b>Complexity</b>: Constant.
-   BOOST_CONTAINER_FORCEINLINE explicit flat_multimap(const Compare& comp)
-      : m_flat_tree(comp)
-   {}
-
-   //! <b>Effects</b>: Constructs an empty flat_multimap using the specified comparison
-   //!   object and allocator.
-   //!
-   //! <b>Complexity</b>: Constant.
-   BOOST_CONTAINER_FORCEINLINE
-   flat_multimap(const Compare& comp, const allocator_type& a)
-      : m_flat_tree(comp, dtl::force<const impl_allocator_type>(a))
-   {}
-
-   //! <b>Effects</b>: Constructs an empty flat_multimap
-   //!   and inserts elements from the range [first ,last ).
-   //!
-   //! <b>Complexity</b>: Linear in N if the range [first ,last ) is already sorted using
-   //! the predicate and otherwise N logN, where N is last - first.
-   template <class InputIterator>
-   BOOST_CONTAINER_FORCEINLINE
-   flat_multimap(InputIterator first, InputIterator last)
-      : m_flat_tree(false, first, last)
-   {}
-
-   //! <b>Effects</b>: Constructs an empty flat_multimap using the specified
-   //!   allocator, and inserts elements from the range [first ,last ).
-   //!
-   //! <b>Complexity</b>: Linear in N if the range [first ,last ) is already sorted using
-   //! the predicate and otherwise N logN, where N is last - first.
-   template <class InputIterator>
-   BOOST_CONTAINER_FORCEINLINE
-   flat_multimap(InputIterator first, InputIterator last, const allocator_type& a)
-      : m_flat_tree(false, first, last, dtl::force<const impl_allocator_type>(a))
-   {}
-
-   //! <b>Effects</b>: Constructs an empty flat_multimap using the specified comparison object
-   //!   and inserts elements from the range [first ,last ).
-   //!
-   //! <b>Complexity</b>: Linear in N if the range [first ,last ) is already sorted using
-   //! the predicate and otherwise N logN, where N is last - first.
-   template <class InputIterator>
-   BOOST_CONTAINER_FORCEINLINE
-   flat_multimap(InputIterator first, InputIterator last, const Compare& comp)
-      : m_flat_tree(false, first, last, comp)
-   {}
-
-   //! <b>Effects</b>: Constructs an empty flat_multimap using the specified comparison object
-   //!   and allocator, and inserts elements from the range [first ,last ).
-   //!
-   //! <b>Complexity</b>: Linear in N if the range [first ,last ) is already sorted using
-   //! the predicate and otherwise N logN, where N is last - first.
-   template <class InputIterator>
-   BOOST_CONTAINER_FORCEINLINE
-   flat_multimap(InputIterator first, InputIterator last, const Compare& comp, const allocator_type& a)
-      : m_flat_tree(false, first, last, comp, dtl::force<const impl_allocator_type>(a))
-   {}
-
-   //! <b>Effects</b>: Constructs an empty flat_multimap
-   //! and inserts elements from the ordered range [first ,last). This function
-   //! is more efficient than the normal range creation for ordered ranges.
-   //!
-   //! <b>Requires</b>: [first ,last) must be ordered according to the predicate.
-   //!
-   //! <b>Complexity</b>: Linear in N.
-   //!
-   //! <b>Note</b>: Non-standard extension.
-   template <class InputIterator>
-   BOOST_CONTAINER_FORCEINLINE
-   flat_multimap(ordered_range_t, InputIterator first, InputIterator last)
-      : m_flat_tree(ordered_range, first, last)
-   {}
-
-   //! <b>Effects</b>: Constructs an empty flat_multimap using the specified comparison object and
-   //! inserts elements from the ordered range [first ,last). This function
-   //! is more efficient than the normal range creation for ordered ranges.
-   //!
-   //! <b>Requires</b>: [first ,last) must be ordered according to the predicate.
-   //!
-   //! <b>Complexity</b>: Linear in N.
-   //!
-   //! <b>Note</b>: Non-standard extension.
-   template <class InputIterator>
-   BOOST_CONTAINER_FORCEINLINE
-   flat_multimap(ordered_range_t, InputIterator first, InputIterator last, const Compare& comp)
-      : m_flat_tree(ordered_range, first, last, comp)
-   {}
-
-   //! <b>Effects</b>: Constructs an empty flat_multimap using the specified comparison object and
-   //! allocator, and inserts elements from the ordered range [first ,last). This function
-   //! is more efficient than the normal range creation for ordered ranges.
-   //!
-   //! <b>Requires</b>: [first ,last) must be ordered according to the predicate.
-   //!
-   //! <b>Complexity</b>: Linear in N.
-   //!
-   //! <b>Note</b>: Non-standard extension.
-   template <class InputIterator>
-   BOOST_CONTAINER_FORCEINLINE
-   flat_multimap(ordered_range_t, InputIterator first, InputIterator last, const Compare& comp, const allocator_type& a)
-      : m_flat_tree(ordered_range, first, last, comp, a)
-   {}
-
-   //! <b>Effects</b>: Constructs an empty flat_multimap using the specified comparison object and
-   //! inserts elements from the ordered range [first ,last). This function
-   //! is more efficient than the normal range creation for ordered ranges.
-   //!
-   //! <b>Requires</b>: [first ,last) must be ordered according to the predicate.
-   //!
-   //! <b>Complexity</b>: Linear in N.
-   //!
-   //! <b>Note</b>: Non-standard extension.
-   template <class InputIterator>
-   BOOST_CONTAINER_FORCEINLINE
-      flat_multimap(ordered_range_t, InputIterator first, InputIterator last, const allocator_type &a)
-      : m_flat_tree(ordered_range, first, last, Compare(), a)
-   {}
-
-#if !defined(BOOST_NO_CXX11_HDR_INITIALIZER_LIST)
-   //! <b>Effects</b>: Constructs an empty flat_map and
-   //! inserts elements from the range [il.begin(), il.end()).
-   //!
-   //! <b>Complexity</b>: Linear in N if the range [il.begin(), il.end()) is already sorted using
-   //! the predicate and otherwise N logN, where N is last - first.
-   BOOST_CONTAINER_FORCEINLINE
-   flat_multimap(std::initializer_list<value_type> il)
-      : m_flat_tree( false
-                   , dtl::force<impl_initializer_list>(il).begin()
-                   , dtl::force<impl_initializer_list>(il).end())
-   {}
-
-   //! <b>Effects</b>: Constructs an empty flat_map using the specified
-   //! allocator, and inserts elements from the range [il.begin(), il.end()).
-   //!
-   //! <b>Complexity</b>: Linear in N if the range [il.begin(), il.end()) is already sorted using
-   //! the predicate and otherwise N logN, where N is last - first.
-   BOOST_CONTAINER_FORCEINLINE
-   flat_multimap(std::initializer_list<value_type> il, const allocator_type& a)
-      : m_flat_tree(false
-                   , dtl::force<impl_initializer_list>(il).begin()
-                   , dtl::force<impl_initializer_list>(il).end()
-                   , dtl::force<const impl_allocator_type>(a))
-   {}
-
-   //! <b>Effects</b>: Constructs an empty flat_map using the specified comparison object and
-   //! inserts elements from the range [il.begin(), il.end()).
-   //!
-   //! <b>Complexity</b>: Linear in N if the range [il.begin(), il.end()) is already sorted using
-   //! the predicate and otherwise N logN, where N is last - first.
-   BOOST_CONTAINER_FORCEINLINE
-   flat_multimap(std::initializer_list<value_type> il, const Compare& comp)
-      : m_flat_tree(false
-                   , dtl::force<impl_initializer_list>(il).begin()
-                   , dtl::force<impl_initializer_list>(il).end(), comp)
-   {}
-
-   //! <b>Effects</b>: Constructs an empty flat_map using the specified comparison object and
-   //! allocator, and inserts elements from the range [il.begin(), il.end()).
-   //!
-   //! <b>Complexity</b>: Linear in N if the range [il.begin(), il.end()) is already sorted using
-   //! the predicate and otherwise N logN, where N is last - first.
-   BOOST_CONTAINER_FORCEINLINE
-   flat_multimap(std::initializer_list<value_type> il, const Compare& comp, const allocator_type& a)
-      : m_flat_tree( false
-                   , dtl::force<impl_initializer_list>(il).begin()
-                   , dtl::force<impl_initializer_list>(il).end()
-                   , comp, dtl::force<const impl_allocator_type>(a))
-   {}
-
-   //! <b>Effects</b>: Constructs an empty flat_multimap and
-   //! inserts elements from the ordered range [il.begin(), il.end()). This function
-   //! is more efficient than the normal range creation for ordered ranges.
-   //!
-   //! <b>Requires</b>: [il.begin(), il.end()) must be ordered according to the predicate.
-   //!
-   //! <b>Complexity</b>: Linear in N.
-   //!
-   //! <b>Note</b>: Non-standard extension.
-   BOOST_CONTAINER_FORCEINLINE
-   flat_multimap(ordered_range_t, std::initializer_list<value_type> il)
-      : m_flat_tree( ordered_range
-                   , dtl::force<impl_initializer_list>(il).begin()
-                   , dtl::force<impl_initializer_list>(il).end())
-   {}
-
-   //! <b>Effects</b>: Constructs an empty flat_multimap using the specified comparison object and
-   //! inserts elements from the ordered range [il.begin(), il.end()). This function
-   //! is more efficient than the normal range creation for ordered ranges.
-   //!
-   //! <b>Requires</b>: [il.begin(), il.end()) must be ordered according to the predicate.
-   //!
-   //! <b>Complexity</b>: Linear in N.
-   //!
-   //! <b>Note</b>: Non-standard extension.
-   BOOST_CONTAINER_FORCEINLINE
-   flat_multimap(ordered_range_t, std::initializer_list<value_type> il, const Compare& comp)
-      : m_flat_tree( ordered_range
-                   , dtl::force<impl_initializer_list>(il).begin()
-                   , dtl::force<impl_initializer_list>(il).end(), comp)
-   {}
-
-   //! <b>Effects</b>: Constructs an empty flat_multimap using the specified comparison object and
-   //! allocator, and inserts elements from the ordered range [il.begin(), il.end()). This function
-   //! is more efficient than the normal range creation for ordered ranges.
-   //!
-   //! <b>Requires</b>: [il.begin(), il.end()) must be ordered according to the predicate.
-   //!
-   //! <b>Complexity</b>: Linear in N.
-   //!
-   //! <b>Note</b>: Non-standard extension.
-   BOOST_CONTAINER_FORCEINLINE
-   flat_multimap(ordered_range_t, std::initializer_list<value_type> il, const Compare& comp, const allocator_type& a)
-      : m_flat_tree( ordered_range
-                   , dtl::force<impl_initializer_list>(il).begin()
-                   , dtl::force<impl_initializer_list>(il).end()
-                   , comp, dtl::force<const impl_allocator_type>(a))
-   {}
-#endif
-
-   //! <b>Effects</b>: Copy constructs a flat_multimap.
-   //!
-   //! <b>Complexity</b>: Linear in x.size().
-   BOOST_CONTAINER_FORCEINLINE
-   flat_multimap(const flat_multimap& x)
-      : m_flat_tree(x.m_flat_tree)
-   {}
-
-   //! <b>Effects</b>: Move constructs a flat_multimap. Constructs *this using x's resources.
-   //!
-   //! <b>Complexity</b>: Constant.
-   //!
-   //! <b>Postcondition</b>: x is emptied.
-   BOOST_CONTAINER_FORCEINLINE
-   flat_multimap(BOOST_RV_REF(flat_multimap) x)
-      BOOST_NOEXCEPT_IF(boost::container::dtl::is_nothrow_move_constructible<Compare>::value)
-      : m_flat_tree(boost::move(x.m_flat_tree))
-   {}
-
-   //! <b>Effects</b>: Copy constructs a flat_multimap using the specified allocator.
-   //!
-   //! <b>Complexity</b>: Linear in x.size().
-   BOOST_CONTAINER_FORCEINLINE
-   flat_multimap(const flat_multimap& x, const allocator_type &a)
-      : m_flat_tree(x.m_flat_tree, dtl::force<const impl_allocator_type>(a))
-   {}
-
-   //! <b>Effects</b>: Move constructs a flat_multimap using the specified allocator.
-   //!                 Constructs *this using x's resources.
-   //!
-   //! <b>Complexity</b>: Constant if a == x.get_allocator(), linear otherwise.
-   BOOST_CONTAINER_FORCEINLINE
-   flat_multimap(BOOST_RV_REF(flat_multimap) x, const allocator_type &a)
-      : m_flat_tree(boost::move(x.m_flat_tree), dtl::force<const impl_allocator_type>(a))
-   {}
-
-   //! <b>Effects</b>: Makes *this a copy of x.
-   //!
-   //! <b>Complexity</b>: Linear in x.size().
-   BOOST_CONTAINER_FORCEINLINE
-   flat_multimap& operator=(BOOST_COPY_ASSIGN_REF(flat_multimap) x)
-      {  m_flat_tree = x.m_flat_tree;   return *this;  }
-
-   //! <b>Effects</b>: this->swap(x.get()).
-   //!
-   //! <b>Complexity</b>: Constant.
-   BOOST_CONTAINER_FORCEINLINE
-   flat_multimap& operator=(BOOST_RV_REF(flat_multimap) x)
-      BOOST_NOEXCEPT_IF( (allocator_traits_type::propagate_on_container_move_assignment::value ||
-                          allocator_traits_type::is_always_equal::value) &&
-                           boost::container::dtl::is_nothrow_move_assignable<Compare>::value)
-      {  m_flat_tree = boost::move(x.m_flat_tree);   return *this;  }
-
-#if !defined(BOOST_NO_CXX11_HDR_INITIALIZER_LIST)
-   //! <b>Effects</b>: Assign content of il to *this
-   //!
-   //! <b>Complexity</b>: Linear in il.size().
-   BOOST_CONTAINER_FORCEINLINE
-   flat_multimap& operator=(std::initializer_list<value_type> il)
-   {
-      this->clear();
-      this->insert(il.begin(), il.end());
-      return *this;
-   }
-#endif
-
-   //! <b>Effects</b>: Returns a copy of the allocator that
-   //!   was passed to the object's constructor.
-   //!
-   //! <b>Complexity</b>: Constant.
-   BOOST_CONTAINER_ATTRIBUTE_NODISCARD BOOST_CONTAINER_FORCEINLINE
-   allocator_type get_allocator() const BOOST_NOEXCEPT_OR_NOTHROW
-      { return dtl::force_copy<allocator_type>(m_flat_tree.get_allocator()); }
-
-   //! <b>Effects</b>: Returns a reference to the internal allocator.
-   //!
-   //! <b>Throws</b>: Nothing
-   //!
-   //! <b>Complexity</b>: Constant.
-   //!
-   //! <b>Note</b>: Non-standard extension.
-   BOOST_CONTAINER_ATTRIBUTE_NODISCARD BOOST_CONTAINER_FORCEINLINE
-   stored_allocator_type &get_stored_allocator() BOOST_NOEXCEPT_OR_NOTHROW
-      { return dtl::force<stored_allocator_type>(m_flat_tree.get_stored_allocator()); }
-
-   //! <b>Effects</b>: Returns a reference to the internal allocator.
-   //!
-   //! <b>Throws</b>: Nothing
-   //!
-   //! <b>Complexity</b>: Constant.
-   //!
-   //! <b>Note</b>: Non-standard extension.
-   BOOST_CONTAINER_ATTRIBUTE_NODISCARD BOOST_CONTAINER_FORCEINLINE
-   const stored_allocator_type &get_stored_allocator() const BOOST_NOEXCEPT_OR_NOTHROW
-      { return dtl::force<const stored_allocator_type>(m_flat_tree.get_stored_allocator()); }
-
-   //////////////////////////////////////////////
-   //
-   //                iterators
-   //
-   //////////////////////////////////////////////
-
-   //! <b>Effects</b>: Returns an iterator to the first element contained in the container.
-   //!
-   //! <b>Throws</b>: Nothing.
-   //!
-   //! <b>Complexity</b>: Constant.
-   BOOST_CONTAINER_ATTRIBUTE_NODISCARD BOOST_CONTAINER_FORCEINLINE
-   iterator begin() BOOST_NOEXCEPT_OR_NOTHROW
-      { return dtl::force_copy<iterator>(m_flat_tree.begin()); }
-
-   //! <b>Effects</b>: Returns a const_iterator to the first element contained in the container.
-   //!
-   //! <b>Throws</b>: Nothing.
-   //!
-   //! <b>Complexity</b>: Constant.
-   BOOST_CONTAINER_ATTRIBUTE_NODISCARD BOOST_CONTAINER_FORCEINLINE
-   const_iterator begin() const BOOST_NOEXCEPT_OR_NOTHROW
-      { return dtl::force_copy<const_iterator>(m_flat_tree.begin()); }
-
-   //! <b>Effects</b>: Returns an iterator to the end of the container.
-   //!
-   //! <b>Throws</b>: Nothing.
-   //!
-   //! <b>Complexity</b>: Constant.
-   BOOST_CONTAINER_ATTRIBUTE_NODISCARD BOOST_CONTAINER_FORCEINLINE
-   iterator end() BOOST_NOEXCEPT_OR_NOTHROW
-      { return dtl::force_copy<iterator>(m_flat_tree.end()); }
-
-   //! <b>Effects</b>: Returns a const_iterator to the end of the container.
-   //!
-   //! <b>Throws</b>: Nothing.
-   //!
-   //! <b>Complexity</b>: Constant.
-   BOOST_CONTAINER_ATTRIBUTE_NODISCARD BOOST_CONTAINER_FORCEINLINE
-   const_iterator end() const BOOST_NOEXCEPT_OR_NOTHROW
-      { return dtl::force_copy<const_iterator>(m_flat_tree.end()); }
-
-   //! <b>Effects</b>: Returns a reverse_iterator pointing to the beginning
-   //! of the reversed container.
-   //!
-   //! <b>Throws</b>: Nothing.
-   //!
-   //! <b>Complexity</b>: Constant.
-   BOOST_CONTAINER_ATTRIBUTE_NODISCARD BOOST_CONTAINER_FORCEINLINE
-   reverse_iterator rbegin() BOOST_NOEXCEPT_OR_NOTHROW
-      { return dtl::force_copy<reverse_iterator>(m_flat_tree.rbegin()); }
-
-   //! <b>Effects</b>: Returns a const_reverse_iterator pointing to the beginning
-   //! of the reversed container.
-   //!
-   //! <b>Throws</b>: Nothing.
-   //!
-   //! <b>Complexity</b>: Constant.
-   BOOST_CONTAINER_ATTRIBUTE_NODISCARD BOOST_CONTAINER_FORCEINLINE
-   const_reverse_iterator rbegin() const BOOST_NOEXCEPT_OR_NOTHROW
-      { return dtl::force_copy<const_reverse_iterator>(m_flat_tree.rbegin()); }
-
-   //! <b>Effects</b>: Returns a reverse_iterator pointing to the end
-   //! of the reversed container.
-   //!
-   //! <b>Throws</b>: Nothing.
-   //!
-   //! <b>Complexity</b>: Constant.
-   BOOST_CONTAINER_ATTRIBUTE_NODISCARD BOOST_CONTAINER_FORCEINLINE
-   reverse_iterator rend() BOOST_NOEXCEPT_OR_NOTHROW
-      { return dtl::force_copy<reverse_iterator>(m_flat_tree.rend()); }
-
-   //! <b>Effects</b>: Returns a const_reverse_iterator pointing to the end
-   //! of the reversed container.
-   //!
-   //! <b>Throws</b>: Nothing.
-   //!
-   //! <b>Complexity</b>: Constant.
-   BOOST_CONTAINER_ATTRIBUTE_NODISCARD BOOST_CONTAINER_FORCEINLINE
-   const_reverse_iterator rend() const BOOST_NOEXCEPT_OR_NOTHROW
-      { return dtl::force_copy<const_reverse_iterator>(m_flat_tree.rend()); }
-
-   //! <b>Effects</b>: Returns a const_iterator to the first element contained in the container.
-   //!
-   //! <b>Throws</b>: Nothing.
-   //!
-   //! <b>Complexity</b>: Constant.
-   BOOST_CONTAINER_ATTRIBUTE_NODISCARD BOOST_CONTAINER_FORCEINLINE
-   const_iterator cbegin() const BOOST_NOEXCEPT_OR_NOTHROW
-      { return dtl::force_copy<const_iterator>(m_flat_tree.cbegin()); }
-
-   //! <b>Effects</b>: Returns a const_iterator to the end of the container.
-   //!
-   //! <b>Throws</b>: Nothing.
-   //!
-   //! <b>Complexity</b>: Constant.
-   BOOST_CONTAINER_ATTRIBUTE_NODISCARD BOOST_CONTAINER_FORCEINLINE
-   const_iterator cend() const BOOST_NOEXCEPT_OR_NOTHROW
-      { return dtl::force_copy<const_iterator>(m_flat_tree.cend()); }
-
-   //! <b>Effects</b>: Returns a const_reverse_iterator pointing to the beginning
-   //! of the reversed container.
-   //!
-   //! <b>Throws</b>: Nothing.
-   //!
-   //! <b>Complexity</b>: Constant.
-   BOOST_CONTAINER_ATTRIBUTE_NODISCARD BOOST_CONTAINER_FORCEINLINE
-   const_reverse_iterator crbegin() const BOOST_NOEXCEPT_OR_NOTHROW
-      { return dtl::force_copy<const_reverse_iterator>(m_flat_tree.crbegin()); }
-
-   //! <b>Effects</b>: Returns a const_reverse_iterator pointing to the end
-   //! of the reversed container.
-   //!
-   //! <b>Throws</b>: Nothing.
-   //!
-   //! <b>Complexity</b>: Constant.
-   BOOST_CONTAINER_ATTRIBUTE_NODISCARD BOOST_CONTAINER_FORCEINLINE
-   const_reverse_iterator crend() const BOOST_NOEXCEPT_OR_NOTHROW
-      { return dtl::force_copy<const_reverse_iterator>(m_flat_tree.crend()); }
-
-   //////////////////////////////////////////////
-   //
-   //                capacity
-   //
-   //////////////////////////////////////////////
-
-   //! <b>Effects</b>: Returns true if the container contains no elements.
-   //!
-   //! <b>Throws</b>: Nothing.
-   //!
-   //! <b>Complexity</b>: Constant.
-   BOOST_CONTAINER_ATTRIBUTE_NODISCARD BOOST_CONTAINER_FORCEINLINE
-   bool empty() const BOOST_NOEXCEPT_OR_NOTHROW
-      { return m_flat_tree.empty(); }
-
-   //! <b>Effects</b>: Returns the number of the elements contained in the container.
-   //!
-   //! <b>Throws</b>: Nothing.
-   //!
-   //! <b>Complexity</b>: Constant.
-   BOOST_CONTAINER_ATTRIBUTE_NODISCARD BOOST_CONTAINER_FORCEINLINE
-   size_type size() const BOOST_NOEXCEPT_OR_NOTHROW
-      { return m_flat_tree.size(); }
-
-   //! <b>Effects</b>: Returns the largest possible size of the container.
-   //!
-   //! <b>Throws</b>: Nothing.
-   //!
-   //! <b>Complexity</b>: Constant.
-   BOOST_CONTAINER_ATTRIBUTE_NODISCARD BOOST_CONTAINER_FORCEINLINE
-   size_type max_size() const BOOST_NOEXCEPT_OR_NOTHROW
-      { return m_flat_tree.max_size(); }
-
-   //! <b>Effects</b>: Number of elements for which memory has been allocated.
-   //!   capacity() is always greater than or equal to size().
-   //!
-   //! <b>Throws</b>: Nothing.
-   //!
-   //! <b>Complexity</b>: Constant.
-   BOOST_CONTAINER_ATTRIBUTE_NODISCARD BOOST_CONTAINER_FORCEINLINE
-   size_type capacity() const BOOST_NOEXCEPT_OR_NOTHROW
-      { return m_flat_tree.capacity(); }
-
-   //! <b>Effects</b>: If n is less than or equal to capacity(), or the
-   //!   underlying container has no `reserve` member, this call has no
-   //!   effect. Otherwise, it is a request for allocation of additional memory.
-   //!   If the request is successful, then capacity() is greater than or equal to
-   //!   n; otherwise, capacity() is unchanged. In either case, size() is unchanged.
-   //!
-   //! <b>Throws</b>: If memory allocation allocation throws or T's copy constructor throws.
-   //!
-   //! <b>Note</b>: If capacity() is less than "cnt", iterators and references to
-   //!   to values might be invalidated.
-   BOOST_CONTAINER_FORCEINLINE
-   void reserve(size_type cnt)
-      { m_flat_tree.reserve(cnt);   }
-
-   //! <b>Effects</b>: Tries to deallocate the excess of memory created
-   //    with previous allocations. The size of the vector is unchanged
-   //!
-   //! <b>Throws</b>: If memory allocation throws, or T's copy constructor throws.
-   //!
-   //! <b>Complexity</b>: Linear to size().
-   BOOST_CONTAINER_FORCEINLINE
-   void shrink_to_fit()
-      { m_flat_tree.shrink_to_fit(); }
-
-   //! @copydoc ::boost::container::flat_set::nth(size_type)
-   BOOST_CONTAINER_ATTRIBUTE_NODISCARD BOOST_CONTAINER_FORCEINLINE
-   iterator nth(size_type n) BOOST_NOEXCEPT_OR_NOTHROW
-   {  return dtl::force_copy<iterator>(m_flat_tree.nth(n));  }
-
-   //! @copydoc ::boost::container::flat_set::nth(size_type) const
-   BOOST_CONTAINER_ATTRIBUTE_NODISCARD BOOST_CONTAINER_FORCEINLINE
-   const_iterator nth(size_type n) const BOOST_NOEXCEPT_OR_NOTHROW
-   {  return dtl::force_copy<iterator>(m_flat_tree.nth(n));  }
-
-   //! @copydoc ::boost::container::flat_set::index_of(iterator)
-   BOOST_CONTAINER_ATTRIBUTE_NODISCARD BOOST_CONTAINER_FORCEINLINE
-   size_type index_of(iterator p) BOOST_NOEXCEPT_OR_NOTHROW
-   {  return m_flat_tree.index_of(dtl::force_copy<impl_iterator>(p));  }
-
-   //! @copydoc ::boost::container::flat_set::index_of(const_iterator) const
-   BOOST_CONTAINER_ATTRIBUTE_NODISCARD BOOST_CONTAINER_FORCEINLINE
-   size_type index_of(const_iterator p) const BOOST_NOEXCEPT_OR_NOTHROW
-   {  return m_flat_tree.index_of(dtl::force_copy<impl_const_iterator>(p));  }
-
-   #if !defined(BOOST_NO_CXX11_VARIADIC_TEMPLATES) || defined(BOOST_CONTAINER_DOXYGEN_INVOKED)
-
-   //! <b>Effects</b>: Inserts an object of type T constructed with
-   //!   std::forward<Args>(args)... and returns the iterator pointing to the
-   //!   newly inserted element.
-   //!
-   //! <b>Complexity</b>: Logarithmic search time plus linear insertion
-   //!   to the elements with bigger keys than x.
-   //!
-   //! <b>Note</b>: If an element is inserted it might invalidate elements.
-   template <class... Args>
-   BOOST_CONTAINER_FORCEINLINE
-   iterator emplace(BOOST_FWD_REF(Args)... args)
-   {  return dtl::force_copy<iterator>(m_flat_tree.emplace_equal(boost::forward<Args>(args)...)); }
-
-   //! <b>Effects</b>: Inserts an object of type T constructed with
-   //!   std::forward<Args>(args)... in the container.
-   //!   p is a hint pointing to where the insert should start to search.
-   //!
-   //! <b>Returns</b>: An iterator pointing to the element with key equivalent
-   //!   to the key of x.
-   //!
-   //! <b>Complexity</b>: Logarithmic search time (constant time if the value
-   //!   is to be inserted before p) plus linear insertion
-   //!   to the elements with bigger keys than x.
-   //!
-   //! <b>Note</b>: If an element is inserted it might invalidate elements.
-   template <class... Args>
-   BOOST_CONTAINER_FORCEINLINE
-   iterator emplace_hint(const_iterator hint, BOOST_FWD_REF(Args)... args)
-   {
-      return dtl::force_copy<iterator>(m_flat_tree.emplace_hint_equal
-         (dtl::force_copy<impl_const_iterator>(hint), boost::forward<Args>(args)...));
-   }
-
-   #else // !defined(BOOST_NO_CXX11_VARIADIC_TEMPLATES)
-
-   #define BOOST_CONTAINER_FLAT_MULTIMAP_EMPLACE_CODE(N) \
-   BOOST_MOVE_TMPL_LT##N BOOST_MOVE_CLASS##N BOOST_MOVE_GT##N \
-   BOOST_CONTAINER_FORCEINLINE iterator emplace(BOOST_MOVE_UREF##N)\
-   {  return dtl::force_copy<iterator>(m_flat_tree.emplace_equal(BOOST_MOVE_FWD##N));  }\
-   \
-   BOOST_MOVE_TMPL_LT##N BOOST_MOVE_CLASS##N BOOST_MOVE_GT##N \
-   BOOST_CONTAINER_FORCEINLINE iterator emplace_hint(const_iterator hint BOOST_MOVE_I##N BOOST_MOVE_UREF##N)\
-   {\
-      return dtl::force_copy<iterator>(m_flat_tree.emplace_hint_equal\
-         (dtl::force_copy<impl_const_iterator>(hint) BOOST_MOVE_I##N BOOST_MOVE_FWD##N));\
-   }\
-   //
-   BOOST_MOVE_ITERATE_0TO9(BOOST_CONTAINER_FLAT_MULTIMAP_EMPLACE_CODE)
-   #undef BOOST_CONTAINER_FLAT_MULTIMAP_EMPLACE_CODE
-
-   #endif   // !defined(BOOST_NO_CXX11_VARIADIC_TEMPLATES)
-
-   //! <b>Effects</b>: Inserts x and returns the iterator pointing to the
-   //!   newly inserted element.
-   //!
-   //! <b>Complexity</b>: Logarithmic search time plus linear insertion
-   //!   to the elements with bigger keys than x.
-   //!
-   //! <b>Note</b>: If an element is inserted it might invalidate elements.
-   BOOST_CONTAINER_FORCEINLINE iterator insert(const value_type& x)
-   {
-      return dtl::force_copy<iterator>(
-         m_flat_tree.insert_equal(dtl::force<const impl_value_type>(x)));
-   }
-
-   //! <b>Effects</b>: Inserts a new value constructed from x and returns
-   //!   the iterator pointing to the newly inserted element.
-   //!
-   //! <b>Complexity</b>: Logarithmic search time plus linear insertion
-   //!   to the elements with bigger keys than x.
-   //!
-   //! <b>Note</b>: If an element is inserted it might invalidate elements.
-   template<class Pair>
-   BOOST_CONTAINER_FORCEINLINE BOOST_CONTAINER_DOC1ST
-         ( iterator
-         , typename dtl::enable_if_c<dtl::is_convertible<Pair BOOST_MOVE_I impl_value_type>::value
-            BOOST_MOVE_I iterator >::type)
-      insert(BOOST_FWD_REF(Pair) x)
-   { return dtl::force_copy<iterator>(m_flat_tree.emplace_equal(boost::forward<Pair>(x))); }
-
-   //! <b>Effects</b>: Inserts a copy of x in the container.
-   //!   p is a hint pointing to where the insert should start to search.
-   //!
-   //! <b>Returns</b>: An iterator pointing to the element with key equivalent
-   //!   to the key of x.
-   //!
-   //! <b>Complexity</b>: Logarithmic search time (constant time if the value
-   //!   is to be inserted before p) plus linear insertion
-   //!   to the elements with bigger keys than x.
-   //!
-   //! <b>Note</b>: If an element is inserted it might invalidate elements.
-   BOOST_CONTAINER_FORCEINLINE iterator insert(const_iterator p, const value_type& x)
-   {
-      return dtl::force_copy<iterator>
-         (m_flat_tree.insert_equal( dtl::force_copy<impl_const_iterator>(p)
-                                  , dtl::force<const impl_value_type>(x)));
-   }
-
-   //! <b>Effects</b>: Inserts a value constructed from x in the container.
-   //!   p is a hint pointing to where the insert should start to search.
-   //!
-   //! <b>Returns</b>: An iterator pointing to the element with key equivalent
-   //!   to the key of x.
-   //!
-   //! <b>Complexity</b>: Logarithmic search time (constant time if the value
-   //!   is to be inserted before p) plus linear insertion
-   //!   to the elements with bigger keys than x.
-   //!
-   //! <b>Note</b>: If an element is inserted it might invalidate elements.
-   template<class Pair>
-   BOOST_CONTAINER_FORCEINLINE BOOST_CONTAINER_DOC1ST
-         ( iterator
-         , typename dtl::enable_if_c<dtl::is_convertible<Pair BOOST_MOVE_I impl_value_type>::value
-            BOOST_MOVE_I iterator>::type)
-      insert(const_iterator p, BOOST_FWD_REF(Pair) x)
-   {
-      return dtl::force_copy<iterator>(
-         m_flat_tree.emplace_hint_equal(dtl::force_copy<impl_const_iterator>(p), boost::forward<Pair>(x)));
-   }
-
-   //! <b>Requires</b>: first, last are not iterators into *this.
-   //!
-   //! <b>Effects</b>: inserts each element from the range [first,last) .
-   //!
-   //! <b>Complexity</b>: N log(N).
-   //!
-   //! <b>Note</b>: If an element is inserted it might invalidate elements.
-   template <class InputIterator>
-   BOOST_CONTAINER_FORCEINLINE void insert(InputIterator first, InputIterator last)
-      {  m_flat_tree.insert_equal(first, last); }
-
-   //! <b>Requires</b>: first, last are not iterators into *this.
-   //!
-   //! <b>Requires</b>: [first ,last) must be ordered according to the predicate.
-   //!
-   //! <b>Effects</b>: inserts each element from the range [first,last) if and only
-   //!   if there is no element with key equivalent to the key of that element. This
-   //!   function is more efficient than the normal range creation for ordered ranges.
-   //!
-   //! <b>Complexity</b>: Linear.
-   //!
-   //! <b>Note</b>: If an element is inserted it might invalidate elements.
-   //!
-   //! <b>Note</b>: Non-standard extension.
-   template <class InputIterator>
-   BOOST_CONTAINER_FORCEINLINE void insert(ordered_range_t, InputIterator first, InputIterator last)
-      {  m_flat_tree.insert_equal(ordered_range, first, last); }
-
-#if !defined(BOOST_NO_CXX11_HDR_INITIALIZER_LIST)
-   //! <b>Effects</b>: inserts each element from the range [il.begin(), il.end()) .
-   //!
-   //! <b>Complexity</b>: N log(N).
-   //!
-   //! <b>Note</b>: If an element is inserted it might invalidate elements.
-   BOOST_CONTAINER_FORCEINLINE void insert(std::initializer_list<value_type> il)
-   {
-      m_flat_tree.insert_equal( dtl::force<impl_initializer_list>(il).begin()
-                              , dtl::force<impl_initializer_list>(il).end());
-   }
-
-   //! <b>Requires</b>: [il.begin(), il.end()) must be ordered according to the predicate.
-   //!
-   //! <b>Effects</b>: inserts each element from the range [il.begin(), il.end()) if and only
-   //!   if there is no element with key equivalent to the key of that element. This
-   //!   function is more efficient than the normal range creation for ordered ranges.
-   //!
-   //! <b>Complexity</b>: Linear.
-   //!
-   //! <b>Note</b>: If an element is inserted it might invalidate elements.
-   //!
-   //! <b>Note</b>: Non-standard extension.
-   BOOST_CONTAINER_FORCEINLINE void insert(ordered_range_t, std::initializer_list<value_type> il)
-   {
-      m_flat_tree.insert_equal( ordered_range
-                              , dtl::force<impl_initializer_list>(il).begin()
-                              , dtl::force<impl_initializer_list>(il).end());
-   }
-#endif
-
-   //! <b>Requires</b>: this->get_allocator() == source.get_allocator().
-   //!
-   //! <b>Effects</b>: Move-inserts each element from source into *this a using
-   //!   the comparison object of *this.
-   //!
-   //! <b>Complexity</b>: Linear in this->size() + source.size().
-   //!
-   //! <b>Note</b>: Invalidates all iterators and references.
-   template<class C2>
-   BOOST_CONTAINER_FORCEINLINE void merge(flat_multimap<Key, T, C2, AllocatorOrContainer>& source)
-   {  m_flat_tree.merge_equal(source.tree());   }
-
-   //! @copydoc ::boost::container::flat_multimap::merge(flat_multimap<Key, T, C2, AllocatorOrContainer>&)
-   template<class C2>
-   BOOST_CONTAINER_FORCEINLINE void merge(BOOST_RV_REF_BEG flat_multimap<Key, T, C2, AllocatorOrContainer> BOOST_RV_REF_END source)
-   {  return this->merge(static_cast<flat_multimap<Key, T, C2, AllocatorOrContainer>&>(source)); }
-
-   //! @copydoc ::boost::container::flat_multimap::merge(flat_multimap<Key, T, C2, AllocatorOrContainer>&)
-   template<class C2>
-   BOOST_CONTAINER_FORCEINLINE void merge(flat_map<Key, T, C2, AllocatorOrContainer>& source)
-   {  m_flat_tree.merge_equal(source.tree());   }
-
-   //! @copydoc ::boost::container::flat_multimap::merge(flat_map<Key, T, C2, AllocatorOrContainer>&)
-   template<class C2>
-   BOOST_CONTAINER_FORCEINLINE void merge(BOOST_RV_REF_BEG flat_map<Key, T, C2, AllocatorOrContainer> BOOST_RV_REF_END source)
-   {  return this->merge(static_cast<flat_map<Key, T, C2, AllocatorOrContainer>&>(source)); }
-
-   //! <b>Effects</b>: Erases the element pointed to by p.
-   //!
-   //! <b>Returns</b>: Returns an iterator pointing to the element immediately
-   //!   following q prior to the element being erased. If no such element exists,
-   //!   returns end().
-   //!
-   //! <b>Complexity</b>: Linear to the elements with keys bigger than p
-   //!
-   //! <b>Note</b>: Invalidates elements with keys
-   //!   not less than the erased element.
-   BOOST_CONTAINER_FORCEINLINE iterator erase(const_iterator p)
-   {
-      return dtl::force_copy<iterator>(
-         m_flat_tree.erase(dtl::force_copy<impl_const_iterator>(p)));
-   }
-
-   //! <b>Effects</b>: Erases all elements in the container with key equivalent to x.
-   //!
-   //! <b>Returns</b>: Returns the number of erased elements.
-   //!
-   //! <b>Complexity</b>: Logarithmic search time plus erasure time
-   //!   linear to the elements with bigger keys.
-   BOOST_CONTAINER_FORCEINLINE size_type erase(const key_type& x)
-      { return m_flat_tree.erase(x); }
-
-   //! <b>Effects</b>: Erases all the elements in the range [first, last).
-   //!
-   //! <b>Returns</b>: Returns last.
-   //!
-   //! <b>Complexity</b>: size()*N where N is the distance from first to last.
-   //!
-   //! <b>Complexity</b>: Logarithmic search time plus erasure time
-   //!   linear to the elements with bigger keys.
-   BOOST_CONTAINER_FORCEINLINE iterator erase(const_iterator first, const_iterator last)
-   {
-      return dtl::force_copy<iterator>
-         (m_flat_tree.erase( dtl::force_copy<impl_const_iterator>(first)
-                           , dtl::force_copy<impl_const_iterator>(last)));
-   }
-
-   //! <b>Effects</b>: Swaps the contents of *this and x.
-   //!
-   //! <b>Throws</b>: Nothing.
-   //!
-   //! <b>Complexity</b>: Constant.
-   BOOST_CONTAINER_FORCEINLINE void swap(flat_multimap& x)
-      BOOST_NOEXCEPT_IF(  allocator_traits_type::is_always_equal::value
-                                 && boost::container::dtl::is_nothrow_swappable<Compare>::value )
-   { m_flat_tree.swap(x.m_flat_tree); }
-
-   //! <b>Effects</b>: erase(begin(),end()).
-   //!
-   //! <b>Postcondition</b>: size() == 0.
-   //!
-   //! <b>Complexity</b>: linear in size().
-   BOOST_CONTAINER_FORCEINLINE void clear() BOOST_NOEXCEPT_OR_NOTHROW
-      { m_flat_tree.clear(); }
-
-   //////////////////////////////////////////////
-   //
-   //                observers
-   //
-   //////////////////////////////////////////////
-
-   //! <b>Effects</b>: Returns the comparison object out
-   //!   of which a was constructed.
-   //!
-   //! <b>Complexity</b>: Constant.
-   BOOST_CONTAINER_ATTRIBUTE_NODISCARD BOOST_CONTAINER_FORCEINLINE
-      key_compare key_comp() const
-      { return dtl::force_copy<key_compare>(m_flat_tree.key_comp()); }
-
-   //! <b>Effects</b>: Returns an object of value_compare constructed out
-   //!   of the comparison object.
-   //!
-   //! <b>Complexity</b>: Constant.
-   BOOST_CONTAINER_ATTRIBUTE_NODISCARD BOOST_CONTAINER_FORCEINLINE
-      value_compare value_comp() const
-      { return value_compare(dtl::force_copy<key_compare>(m_flat_tree.key_comp())); }
-
-   //////////////////////////////////////////////
-   //
-   //              map operations
-   //
-   //////////////////////////////////////////////
-
-   //! <b>Returns</b>: An iterator pointing to an element with the key
-   //!   equivalent to x, or end() if such an element is not found.
-   //!
-   //! <b>Complexity</b>: Logarithmic.
-   BOOST_CONTAINER_ATTRIBUTE_NODISCARD BOOST_CONTAINER_FORCEINLINE
-      iterator find(const key_type& x)
-      { return dtl::force_copy<iterator>(m_flat_tree.find(x)); }
-
-   //! <b>Returns</b>: An const_iterator pointing to an element with the key
-   //!   equivalent to x, or end() if such an element is not found.
-   //!
-   //! <b>Complexity</b>: Logarithmic.
-   BOOST_CONTAINER_ATTRIBUTE_NODISCARD BOOST_CONTAINER_FORCEINLINE
-      const_iterator find(const key_type& x) const
-      { return dtl::force_copy<const_iterator>(m_flat_tree.find(x)); }
-
-   //! <b>Requires</b>: This overload is available only if
-   //! key_compare::is_transparent exists.
-   //!
-   //! <b>Returns</b>: An iterator pointing to an element with the key
-   //!   equivalent to x, or end() if such an element is not found.
-   //!
-   //! <b>Complexity</b>: Logarithmic.
-   template<class K>
-   BOOST_CONTAINER_ATTRIBUTE_NODISCARD BOOST_CONTAINER_FORCEINLINE
-      iterator find(const K& x)
-      { return dtl::force_copy<iterator>(m_flat_tree.find(x)); }
-
-   //! <b>Requires</b>: This overload is available only if
-   //! key_compare::is_transparent exists.
-   //!
-   //! <b>Returns</b>: An const_iterator pointing to an element with the key
-   //!   equivalent to x, or end() if such an element is not found.
-   //!
-   //! <b>Complexity</b>: Logarithmic.
-   template<class K>
-   BOOST_CONTAINER_ATTRIBUTE_NODISCARD BOOST_CONTAINER_FORCEINLINE
-      const_iterator find(const K& x) const
-      { return dtl::force_copy<const_iterator>(m_flat_tree.find(x)); }
-
-   //! <b>Returns</b>: The number of elements with key equivalent to x.
-   //!
-   //! <b>Complexity</b>: log(size())+count(k)
-   BOOST_CONTAINER_ATTRIBUTE_NODISCARD BOOST_CONTAINER_FORCEINLINE
-      size_type count(const key_type& x) const
-      { return m_flat_tree.count(x); }
-
-   //! <b>Requires</b>: This overload is available only if
-   //! key_compare::is_transparent exists.
-   //!
-   //! <b>Returns</b>: The number of elements with key equivalent to x.
-   //!
-   //! <b>Complexity</b>: log(size())+count(k)
-   template<class K>
-   BOOST_CONTAINER_ATTRIBUTE_NODISCARD BOOST_CONTAINER_FORCEINLINE
-      size_type count(const K& x) const
-      { return m_flat_tree.count(x); }
-
-   //! <b>Returns</b>: Returns true if there is an element with key
-   //!   equivalent to key in the container, otherwise false.
-   //!
-   //! <b>Complexity</b>: log(size()).
-   BOOST_CONTAINER_ATTRIBUTE_NODISCARD  BOOST_CONTAINER_FORCEINLINE
-      bool contains(const key_type& x) const
-      {  return m_flat_tree.find(x) != m_flat_tree.end();  }
-
-   //! <b>Requires</b>: This overload is available only if
-   //! key_compare::is_transparent exists.
-   //!
-   //! <b>Returns</b>: Returns true if there is an element with key
-   //!   equivalent to key in the container, otherwise false.
-   //!
-   //! <b>Complexity</b>: log(size()).
-   template<typename K>
-   BOOST_CONTAINER_ATTRIBUTE_NODISCARD BOOST_CONTAINER_FORCEINLINE
-      bool contains(const K& x) const
-      {  return m_flat_tree.find(x) != m_flat_tree.end();  }
-
-   //! <b>Returns</b>: An iterator pointing to the first element with key not less
-   //!   than x, or end() if such an element is not found.
-   //!
-   //! <b>Complexity</b>: Logarithmic
-   BOOST_CONTAINER_ATTRIBUTE_NODISCARD BOOST_CONTAINER_FORCEINLINE
-      iterator lower_bound(const key_type& x)
-      {  return dtl::force_copy<iterator>(m_flat_tree.lower_bound(x)); }
-
-   //! <b>Returns</b>: An iterator pointing to the first element with key not less
-   //!   than x, or end() if such an element is not found.
-   //!
-   //! <b>Complexity</b>: Logarithmic
-   BOOST_CONTAINER_ATTRIBUTE_NODISCARD BOOST_CONTAINER_FORCEINLINE
-      const_iterator lower_bound(const key_type& x) const
-      {  return dtl::force_copy<const_iterator>(m_flat_tree.lower_bound(x)); }
-
-   //! <b>Requires</b>: This overload is available only if
-   //! key_compare::is_transparent exists.
-   //!
-   //! <b>Returns</b>: An iterator pointing to the first element with key not less
-   //!   than x, or end() if such an element is not found.
-   //!
-   //! <b>Complexity</b>: Logarithmic
-   template<class K>
-   BOOST_CONTAINER_ATTRIBUTE_NODISCARD BOOST_CONTAINER_FORCEINLINE
-      iterator lower_bound(const K& x)
-      {  return dtl::force_copy<iterator>(m_flat_tree.lower_bound(x)); }
-
-   //! <b>Requires</b>: This overload is available only if
-   //! key_compare::is_transparent exists.
-   //!
-   //! <b>Returns</b>: An iterator pointing to the first element with key not less
-   //!   than x, or end() if such an element is not found.
-   //!
-   //! <b>Complexity</b>: Logarithmic
-   template<class K>
-   BOOST_CONTAINER_ATTRIBUTE_NODISCARD BOOST_CONTAINER_FORCEINLINE
-      const_iterator lower_bound(const K& x) const
-      {  return dtl::force_copy<const_iterator>(m_flat_tree.lower_bound(x)); }
-
-   //! <b>Returns</b>: An iterator pointing to the first element with key greater
-   //!   than x, or end() if such an element is not found.
-   //!
-   //! <b>Complexity</b>: Logarithmic
-   BOOST_CONTAINER_ATTRIBUTE_NODISCARD BOOST_CONTAINER_FORCEINLINE
-      iterator upper_bound(const key_type& x)
-      {return dtl::force_copy<iterator>(m_flat_tree.upper_bound(x)); }
-
-   //! <b>Returns</b>: A const iterator pointing to the first element with key
-   //!   greater than x, or end() if such an element is not found.
-   //!
-   //! <b>Complexity</b>: Logarithmic
-   BOOST_CONTAINER_ATTRIBUTE_NODISCARD BOOST_CONTAINER_FORCEINLINE
-      const_iterator upper_bound(const key_type& x) const
-      {  return dtl::force_copy<const_iterator>(m_flat_tree.upper_bound(x)); }
-
-   //! <b>Requires</b>: This overload is available only if
-   //! key_compare::is_transparent exists.
-   //!
-   //! <b>Returns</b>: An iterator pointing to the first element with key greater
-   //!   than x, or end() if such an element is not found.
-   //!
-   //! <b>Complexity</b>: Logarithmic
-   template<class K>
-   BOOST_CONTAINER_ATTRIBUTE_NODISCARD BOOST_CONTAINER_FORCEINLINE
-      iterator upper_bound(const K& x)
-      {return dtl::force_copy<iterator>(m_flat_tree.upper_bound(x)); }
-
-   //! <b>Requires</b>: This overload is available only if
-   //! key_compare::is_transparent exists.
-   //!
-   //! <b>Returns</b>: A const iterator pointing to the first element with key
-   //!   greater than x, or end() if such an element is not found.
-   //!
-   //! <b>Complexity</b>: Logarithmic
-   template<class K>
-   BOOST_CONTAINER_ATTRIBUTE_NODISCARD BOOST_CONTAINER_FORCEINLINE
-      const_iterator upper_bound(const K& x) const
-      {  return dtl::force_copy<const_iterator>(m_flat_tree.upper_bound(x)); }
-
-   //! <b>Effects</b>: Equivalent to std::make_pair(this->lower_bound(k), this->upper_bound(k)).
-   //!
-   //! <b>Complexity</b>: Logarithmic
-   BOOST_CONTAINER_ATTRIBUTE_NODISCARD BOOST_CONTAINER_FORCEINLINE
-      std::pair<iterator,iterator> equal_range(const key_type& x)
-      {  return dtl::force_copy<std::pair<iterator,iterator> >(m_flat_tree.equal_range(x));   }
-
-   //! <b>Effects</b>: Equivalent to std::make_pair(this->lower_bound(k), this->upper_bound(k)).
-   //!
-   //! <b>Complexity</b>: Logarithmic
-   BOOST_CONTAINER_ATTRIBUTE_NODISCARD BOOST_CONTAINER_FORCEINLINE
-      std::pair<const_iterator, const_iterator> equal_range(const key_type& x) const
-      {  return dtl::force_copy<std::pair<const_iterator,const_iterator> >(m_flat_tree.equal_range(x));   }
-
-   //! <b>Requires</b>: This overload is available only if
-   //! key_compare::is_transparent exists.
-   //!
-   //! <b>Effects</b>: Equivalent to std::make_pair(this->lower_bound(k), this->upper_bound(k)).
-   //!
-   //! <b>Complexity</b>: Logarithmic
-   template<class K>
-   BOOST_CONTAINER_ATTRIBUTE_NODISCARD BOOST_CONTAINER_FORCEINLINE
-      std::pair<iterator,iterator> equal_range(const K& x)
-      {  return dtl::force_copy<std::pair<iterator,iterator> >(m_flat_tree.equal_range(x));   }
-
-   //! <b>Requires</b>: This overload is available only if
-   //! key_compare::is_transparent exists.
-   //!
-   //! <b>Effects</b>: Equivalent to std::make_pair(this->lower_bound(k), this->upper_bound(k)).
-   //!
-   //! <b>Complexity</b>: Logarithmic
-   template<class K>
-   BOOST_CONTAINER_ATTRIBUTE_NODISCARD BOOST_CONTAINER_FORCEINLINE
-      std::pair<const_iterator, const_iterator> equal_range(const K& x) const
-      {  return dtl::force_copy<std::pair<const_iterator,const_iterator> >(m_flat_tree.equal_range(x));   }
-
-   //! <b>Effects</b>: Extracts the internal sequence container.
-   //!
-   //! <b>Complexity</b>: Same as the move constructor of sequence_type, usually constant.
-   //!
-   //! <b>Postcondition</b>: this->empty()
-   //!
-   //! <b>Throws</b>: If secuence_type's move constructor throws 
-   BOOST_CONTAINER_ATTRIBUTE_NODISCARD BOOST_CONTAINER_FORCEINLINE
-      sequence_type extract_sequence()
-   {  return boost::move(dtl::force<sequence_type>(m_flat_tree.get_sequence_ref()));   }
-
-   //! <b>Effects</b>: Discards the internally hold sequence container and adopts the
-   //!   one passed externally using the move assignment.
-   //!
-   //! <b>Complexity</b>: Assuming O(1) move assignment, O(NlogN) with N = seq.size()
-   //!
-   //! <b>Throws</b>: If the comparison or the move constructor throws
-   BOOST_CONTAINER_FORCEINLINE void adopt_sequence(BOOST_RV_REF(sequence_type) seq)
-   {  this->m_flat_tree.adopt_sequence_equal(boost::move(dtl::force<impl_sequence_type>(seq)));  }
-
-   //! <b>Requires</b>: seq shall be ordered according to this->compare().
-   //!
-   //! <b>Effects</b>: Discards the internally hold sequence container and adopts the
-   //!   one passed externally using the move assignment.
-   //!
-   //! <b>Complexity</b>: Assuming O(1) move assignment, O(1)
-   //!
-   //! <b>Throws</b>: If the move assignment throws
-   BOOST_CONTAINER_FORCEINLINE void adopt_sequence(ordered_range_t, BOOST_RV_REF(sequence_type) seq)
-   {  this->m_flat_tree.adopt_sequence_equal(ordered_range_t(), boost::move(dtl::force<impl_sequence_type>(seq)));  }
-
-   //! <b>Effects</b>: Returns a const view of the underlying sequence.
-   //!
-   //! <b>Complexity</b>: Constant
-   //!
-   //! <b>Throws</b>: Nothing
-   BOOST_CONTAINER_FORCEINLINE const sequence_type & sequence() const BOOST_NOEXCEPT
-   {  return dtl::force<sequence_type>(m_flat_tree.get_sequence_cref());  }
-
-   //! <b>Effects</b>: Returns true if x and y are equal
-   //!
-   //! <b>Complexity</b>: Linear to the number of elements in the container.
-   BOOST_CONTAINER_ATTRIBUTE_NODISCARD BOOST_CONTAINER_FORCEINLINE
-      friend bool operator==(const flat_multimap& x, const flat_multimap& y)
-   {  return x.size() == y.size() && ::boost::container::algo_equal(x.begin(), x.end(), y.begin());  }
-
-   //! <b>Effects</b>: Returns true if x and y are unequal
-   //!
-   //! <b>Complexity</b>: Linear to the number of elements in the container.
-   BOOST_CONTAINER_ATTRIBUTE_NODISCARD BOOST_CONTAINER_FORCEINLINE
-      friend bool operator!=(const flat_multimap& x, const flat_multimap& y)
-   {  return !(x == y); }
-
-   //! <b>Effects</b>: Returns true if x is less than y
-   //!
-   //! <b>Complexity</b>: Linear to the number of elements in the container.
-   BOOST_CONTAINER_ATTRIBUTE_NODISCARD BOOST_CONTAINER_FORCEINLINE
-      friend bool operator<(const flat_multimap& x, const flat_multimap& y)
-   {  return ::boost::container::algo_lexicographical_compare(x.begin(), x.end(), y.begin(), y.end());  }
-
-   //! <b>Effects</b>: Returns true if x is greater than y
-   //!
-   //! <b>Complexity</b>: Linear to the number of elements in the container.
-   BOOST_CONTAINER_ATTRIBUTE_NODISCARD BOOST_CONTAINER_FORCEINLINE
-      friend bool operator>(const flat_multimap& x, const flat_multimap& y)
-   {  return y < x;  }
-
-   //! <b>Effects</b>: Returns true if x is equal or less than y
-   //!
-   //! <b>Complexity</b>: Linear to the number of elements in the container.
-   BOOST_CONTAINER_ATTRIBUTE_NODISCARD BOOST_CONTAINER_FORCEINLINE
-      friend bool operator<=(const flat_multimap& x, const flat_multimap& y)
-   {  return !(y < x);  }
-
-   //! <b>Effects</b>: Returns true if x is equal or greater than y
-   //!
-   //! <b>Complexity</b>: Linear to the number of elements in the container.
-   BOOST_CONTAINER_ATTRIBUTE_NODISCARD BOOST_CONTAINER_FORCEINLINE
-      friend bool operator>=(const flat_multimap& x, const flat_multimap& y)
-   {  return !(x < y);  }
-
-   //! <b>Effects</b>: x.swap(y)
-   //!
-   //! <b>Complexity</b>: Constant.
-   BOOST_CONTAINER_FORCEINLINE friend void swap(flat_multimap& x, flat_multimap& y)
-       BOOST_NOEXCEPT_IF(BOOST_NOEXCEPT(x.swap(y)))
-   {  x.swap(y);  }
-};
-
-#ifndef BOOST_CONTAINER_NO_CXX17_CTAD
-
-template <typename InputIterator>
-flat_multimap(InputIterator, InputIterator) ->
-   flat_multimap< it_based_non_const_first_type_t<InputIterator>
-                , it_based_second_type_t<InputIterator>>;
-
-template < typename InputIterator, typename AllocatorOrCompare>
-flat_multimap(InputIterator, InputIterator, AllocatorOrCompare const&) ->
-   flat_multimap< it_based_non_const_first_type_t<InputIterator>
-                , it_based_second_type_t<InputIterator>
-                , typename dtl::if_c<   // Compare
-                    dtl::is_allocator<AllocatorOrCompare>::value
-                    , std::less<it_based_non_const_first_type_t<InputIterator>>
-                    , AllocatorOrCompare
-                    >::type
-                , typename dtl::if_c<   // Allocator
-                    dtl::is_allocator<AllocatorOrCompare>::value
-                    , AllocatorOrCompare
-                    , new_allocator<std::pair<it_based_non_const_first_type_t<InputIterator>, it_based_second_type_t<InputIterator>>>
-                    >::type
-                >;
-
-template < typename InputIterator, typename Compare, typename Allocator
-         , typename = dtl::require_nonallocator_t<Compare>
-         , typename = dtl::require_allocator_t<Allocator>>
-flat_multimap(InputIterator, InputIterator, Compare const&, Allocator const&) ->
-   flat_multimap< it_based_non_const_first_type_t<InputIterator>
-                , it_based_second_type_t<InputIterator>
-                , Compare
-                , Allocator>;
-
-template <typename InputIterator>
-flat_multimap(ordered_range_t, InputIterator, InputIterator) ->
-   flat_multimap< it_based_non_const_first_type_t<InputIterator>
-                , it_based_second_type_t<InputIterator>>;
-
-template < typename InputIterator, typename AllocatorOrCompare>
-flat_multimap(ordered_range_t, InputIterator, InputIterator, AllocatorOrCompare const&) ->
-   flat_multimap< it_based_non_const_first_type_t<InputIterator>
-                , it_based_second_type_t<InputIterator>
-                , typename dtl::if_c<   // Compare
-                    dtl::is_allocator<AllocatorOrCompare>::value
-                    , std::less<it_based_non_const_first_type_t<InputIterator>>
-                    , AllocatorOrCompare
-                    >::type
-                , typename dtl::if_c<   // Allocator
-                    dtl::is_allocator<AllocatorOrCompare>::value
-                    , AllocatorOrCompare
-                    , new_allocator<std::pair<it_based_non_const_first_type_t<InputIterator>, it_based_second_type_t<InputIterator>>>
-                    >::type
-                >;
-
-template < typename InputIterator, typename Compare, typename Allocator
-         , typename = dtl::require_nonallocator_t<Compare>
-         , typename = dtl::require_allocator_t<Allocator>>
-flat_multimap(ordered_range_t, InputIterator, InputIterator, Compare const&, Allocator const&) ->
-   flat_multimap< it_based_non_const_first_type_t<InputIterator>
-                , it_based_second_type_t<InputIterator>
-                , Compare
-                , Allocator>;
-
-#endif
-
-}}
-
-#ifndef BOOST_CONTAINER_DOXYGEN_INVOKED
-
-namespace boost {
-
-//!has_trivial_destructor_after_move<> == true_type
-//!specialization for optimizations
-template <class Key, class T, class Compare, class AllocatorOrContainer>
-struct has_trivial_destructor_after_move< boost::container::flat_multimap<Key, T, Compare, AllocatorOrContainer> >
-{
-   typedef ::boost::container::dtl::pair<Key, T> value_t;
-   typedef typename ::boost::container::dtl::container_or_allocator_rebind<AllocatorOrContainer, value_t>::type alloc_or_cont_t;
-   typedef ::boost::container::dtl::flat_tree<value_t,::boost::container::dtl::select1st<Key>, Compare, alloc_or_cont_t> tree;
-   static const bool value = ::boost::has_trivial_destructor_after_move<tree>::value;
-};
-
-}  //namespace boost {
-
-#endif   //#ifndef BOOST_CONTAINER_DOXYGEN_INVOKED
-
-#include <boost/container/detail/config_end.hpp>
-
-#endif   // BOOST_CONTAINER_FLAT_MAP_HPP
diff --git a/src/boost/container/map.hpp b/src/boost/container/map.hpp
deleted file mode 100644
index 4669b27b..00000000
--- a/src/boost/container/map.hpp
+++ /dev/null
@@ -1,2315 +0,0 @@
-//////////////////////////////////////////////////////////////////////////////
-//
-// (C) Copyright Ion Gaztanaga 2005-2013. Distributed under the Boost
-// 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.
-//
-//////////////////////////////////////////////////////////////////////////////
-#ifndef BOOST_CONTAINER_MAP_HPP
-#define BOOST_CONTAINER_MAP_HPP
-
-#ifndef BOOST_CONFIG_HPP
-#  include <boost/config.hpp>
-#endif
-
-#if defined(BOOST_HAS_PRAGMA_ONCE)
-#  pragma once
-#endif
-
-#include <boost/container/detail/config_begin.hpp>
-#include <boost/container/detail/workaround.hpp>
-
-// container
-#include <boost/container/container_fwd.hpp>
-#include <boost/container/new_allocator.hpp> //new_allocator
-#include <boost/container/throw_exception.hpp>
-// container/detail
-#include <boost/container/detail/mpl.hpp>
-#include <boost/container/detail/tree.hpp>
-#include <boost/container/detail/type_traits.hpp>
-#include <boost/container/detail/value_init.hpp>
-#include <boost/container/detail/pair.hpp>
-#include <boost/container/detail/pair_key_mapped_of_value.hpp>
-
-// move
-#include <boost/move/traits.hpp>
-#include <boost/move/utility_core.hpp>
-// move/detail
-#if defined(BOOST_NO_CXX11_VARIADIC_TEMPLATES)
-#include <boost/move/detail/fwd_macros.hpp>
-#endif
-#include <boost/move/detail/move_helpers.hpp>
-// intrusive/detail
-#include <boost/intrusive/detail/minimal_pair_header.hpp>      //pair
-#include <boost/intrusive/detail/minimal_less_equal_header.hpp>//less, equal
-// other
-#include <boost/static_assert.hpp>
-// std
-#if !defined(BOOST_NO_CXX11_HDR_INITIALIZER_LIST)
-#include <initializer_list>
-#endif
-
-namespace boost {
-namespace container {
-
-#ifdef BOOST_CONTAINER_DOXYGEN_INVOKED
-
-//! A map is a kind of associative container that supports unique keys (contains at
-//! most one of each key value) and provides for fast retrieval of values of another
-//! type T based on the keys. The map class supports bidirectional iterators.
-//!
-//! A map satisfies all of the requirements of a container and of a reversible
-//! container and of an associative container. The <code>value_type</code> stored
-//! by this container is the value_type is std::pair<const Key, T>.
-//!
-//! \tparam Key is the key_type of the map
-//! \tparam T is the <code>mapped_type</code>
-//! \tparam Compare is the ordering function for Keys (e.g. <i>std::less<Key></i>).
-//! \tparam Allocator is the allocator to allocate the <code>value_type</code>s
-//!   (e.g. <i>allocator< std::pair<const Key, T> > </i>).
-//! \tparam Options is an packed option type generated using using boost::container::tree_assoc_options.
-template < class Key, class T, class Compare = std::less<Key>
-         , class Allocator = void, class Options = tree_assoc_defaults >
-#else
-template <class Key, class T, class Compare, class Allocator, class Options>
-#endif
-class map
-   ///@cond
-   : public dtl::tree
-      < std::pair<const Key, T>
-      , int
-      , Compare, Allocator, Options>
-   ///@endcond
-{
-   #ifndef BOOST_CONTAINER_DOXYGEN_INVOKED
-   private:
-   BOOST_COPYABLE_AND_MOVABLE(map)
-
-   typedef int                                                             select_1st_t;
-   typedef std::pair<const Key, T>                                         value_type_impl;
-   typedef dtl::tree
-      <value_type_impl, select_1st_t, Compare, Allocator, Options>         base_t;
-   typedef dtl::pair <Key, T>                                              movable_value_type_impl;
-   typedef typename base_t::value_compare                                  value_compare_impl;
-   #endif   //#ifndef BOOST_CONTAINER_DOXYGEN_INVOKED
-
-   public:
-   //////////////////////////////////////////////
-   //
-   //                    types
-   //
-   //////////////////////////////////////////////
-
-   typedef Key                                                                            key_type;
-   typedef T                                                                              mapped_type;
-   typedef typename base_t::allocator_type                                                allocator_type;
-   typedef ::boost::container::allocator_traits<allocator_type>                           allocator_traits_type;
-   typedef typename boost::container::allocator_traits<allocator_type>::value_type        value_type;
-   typedef typename boost::container::allocator_traits<allocator_type>::pointer           pointer;
-   typedef typename boost::container::allocator_traits<allocator_type>::const_pointer     const_pointer;
-   typedef typename boost::container::allocator_traits<allocator_type>::reference         reference;
-   typedef typename boost::container::allocator_traits<allocator_type>::const_reference   const_reference;
-   typedef typename boost::container::allocator_traits<allocator_type>::size_type         size_type;
-   typedef typename boost::container::allocator_traits<allocator_type>::difference_type   difference_type;
-   typedef typename BOOST_CONTAINER_IMPDEF(base_t::stored_allocator_type)                 stored_allocator_type;
-   typedef BOOST_CONTAINER_IMPDEF(value_compare_impl)                                     value_compare;
-   typedef Compare                                                                        key_compare;
-   typedef typename BOOST_CONTAINER_IMPDEF(base_t::iterator)                              iterator;
-   typedef typename BOOST_CONTAINER_IMPDEF(base_t::const_iterator)                        const_iterator;
-   typedef typename BOOST_CONTAINER_IMPDEF(base_t::reverse_iterator)                      reverse_iterator;
-   typedef typename BOOST_CONTAINER_IMPDEF(base_t::const_reverse_iterator)                const_reverse_iterator;
-   //typedef std::pair<key_type, mapped_type>                                               nonconst_value_type;
-   typedef BOOST_CONTAINER_IMPDEF(movable_value_type_impl)                                movable_value_type;
-   typedef BOOST_CONTAINER_IMPDEF(node_handle<
-      typename base_t::stored_allocator_type
-      BOOST_MOVE_I pair_key_mapped_of_value
-         <key_type BOOST_MOVE_I mapped_type> >)                                     node_type;
-   typedef BOOST_CONTAINER_IMPDEF
-      (insert_return_type_base<iterator BOOST_MOVE_I node_type>)                    insert_return_type;
-
-   //allocator_type::value_type type must be std::pair<CONST Key, T>
-   BOOST_STATIC_ASSERT((dtl::is_same<typename allocator_type::value_type, std::pair<const Key, T> >::value));
-
-   //////////////////////////////////////////////
-   //
-   //          construct/copy/destroy
-   //
-   //////////////////////////////////////////////
-
-   //! <b>Effects</b>: Default constructs an empty map.
-   //!
-   //! <b>Complexity</b>: Constant.
-   BOOST_CONTAINER_FORCEINLINE 
-   map() BOOST_NOEXCEPT_IF(dtl::is_nothrow_default_constructible<allocator_type>::value &&
-                           dtl::is_nothrow_default_constructible<Compare>::value)
-      : base_t()
-   {}
-
-   //! <b>Effects</b>: Constructs an empty map using the specified comparison object
-   //! and allocator.
-   //!
-   //! <b>Complexity</b>: Constant.
-   BOOST_CONTAINER_FORCEINLINE map(const Compare& comp, const allocator_type& a)
-      : base_t(comp, a)
-   {}
-
-   //! <b>Effects</b>: Constructs an empty map using the specified comparison object.
-   //!
-   //! <b>Complexity</b>: Constant.
-   BOOST_CONTAINER_FORCEINLINE explicit map(const Compare& comp)
-      : base_t(comp)
-   {}
-
-   //! <b>Effects</b>: Constructs an empty map using the specified allocator.
-   //!
-   //! <b>Complexity</b>: Constant.
-   BOOST_CONTAINER_FORCEINLINE explicit map(const allocator_type& a)
-      : base_t(a)
-   {}
-
-   //! <b>Effects</b>: Constructs an empty map and
-   //! inserts elements from the range [first ,last ).
-   //!
-   //! <b>Complexity</b>: Linear in N if the range [first ,last ) is already sorted using
-   //! the predicate and otherwise N logN, where N is last - first.
-   template <class InputIterator>
-   BOOST_CONTAINER_FORCEINLINE map(InputIterator first, InputIterator last)
-      : base_t(true, first, last)
-   {}
-
-   //! <b>Effects</b>: Constructs an empty map using the specified 
-   //! allocator, and inserts elements from the range [first ,last ).
-   //!
-   //! <b>Complexity</b>: Linear in N if the range [first ,last ) is already sorted using
-   //! the predicate and otherwise N logN, where N is last - first.
-   template <class InputIterator>
-   BOOST_CONTAINER_FORCEINLINE map(InputIterator first, InputIterator last, const allocator_type& a)
-      : base_t(true, first, last, Compare(), a)
-   {}
-
-   //! <b>Effects</b>: Constructs an empty map using the specified comparison object and
-   //! inserts elements from the range [first ,last ).
-   //!
-   //! <b>Complexity</b>: Linear in N if the range [first ,last ) is already sorted using
-   //! the predicate and otherwise N logN, where N is last - first.
-   template <class InputIterator>
-   BOOST_CONTAINER_FORCEINLINE map(InputIterator first, InputIterator last, const Compare& comp)
-      : base_t(true, first, last, comp)
-   {}
-
-   //! <b>Effects</b>: Constructs an empty map using the specified comparison object and
-   //! allocator, and inserts elements from the range [first ,last ).
-   //!
-   //! <b>Complexity</b>: Linear in N if the range [first ,last ) is already sorted using
-   //! the predicate and otherwise N logN, where N is last - first.
-   template <class InputIterator>
-   BOOST_CONTAINER_FORCEINLINE map(InputIterator first, InputIterator last, const Compare& comp, const allocator_type& a)
-      : base_t(true, first, last, comp, a)
-   {}
-
-   //! <b>Effects</b>: Constructs an empty map and
-   //! inserts elements from the ordered unique range [first ,last). This function
-   //! is more efficient than the normal range creation for ordered ranges.
-   //!
-   //! <b>Requires</b>: [first ,last) must be ordered according to the predicate and must be
-   //! unique values.
-   //!
-   //! <b>Complexity</b>: Linear in N.
-   //!
-   //! <b>Note</b>: Non-standard extension.
-   template <class InputIterator>
-   BOOST_CONTAINER_FORCEINLINE map( ordered_unique_range_t, InputIterator first, InputIterator last)
-      : base_t(ordered_range, first, last)
-   {}
-
-   //! <b>Effects</b>: Constructs an empty map using the specified comparison object and
-   //! inserts elements from the ordered unique range [first ,last). This function
-   //! is more efficient than the normal range creation for ordered ranges.
-   //!
-   //! <b>Requires</b>: [first ,last) must be ordered according to the predicate and must be
-   //! unique values.
-   //!
-   //! <b>Complexity</b>: Linear in N.
-   //!
-   //! <b>Note</b>: Non-standard extension.
-   template <class InputIterator>
-   BOOST_CONTAINER_FORCEINLINE map( ordered_unique_range_t, InputIterator first, InputIterator last, const Compare& comp)
-      : base_t(ordered_range, first, last, comp)
-   {}
-
-   //! <b>Effects</b>: Constructs an empty map using the specified comparison object and
-   //! allocator, and inserts elements from the ordered unique range [first ,last). This function
-   //! is more efficient than the normal range creation for ordered ranges.
-   //!
-   //! <b>Requires</b>: [first ,last) must be ordered according to the predicate and must be
-   //! unique values.
-   //!
-   //! <b>Complexity</b>: Linear in N.
-   //!
-   //! <b>Note</b>: Non-standard extension.
-   template <class InputIterator>
-   BOOST_CONTAINER_FORCEINLINE map( ordered_unique_range_t, InputIterator first, InputIterator last
-      , const Compare& comp, const allocator_type& a)
-      : base_t(ordered_range, first, last, comp, a)
-   {}
-
-   //! <b>Effects</b>: Constructs an empty map using the specified allocator object and
-   //! inserts elements from the ordered unique range [first ,last). This function
-   //! is more efficient than the normal range creation for ordered ranges.
-   //!
-   //! <b>Requires</b>: [first ,last) must be ordered according to the predicate and must be
-   //! unique values.
-   //!
-   //! <b>Complexity</b>: Linear in N.
-   //!
-   //! <b>Note</b>: Non-standard extension.
-   template <class InputIterator>
-   BOOST_CONTAINER_FORCEINLINE map(ordered_unique_range_t, InputIterator first, InputIterator last, const allocator_type& a)
-      : base_t(ordered_range, first, last, Compare(), a)
-   {}
-
-
-#if !defined(BOOST_NO_CXX11_HDR_INITIALIZER_LIST)
-   //! <b>Effects</b>: Constructs an empty map and
-   //! inserts elements from the range [il.begin(), il.end()).
-   //!
-   //! <b>Complexity</b>: Linear in N if the range [first ,last ) is already sorted according
-   //! to the predicate and otherwise N logN, where N is il.first() - il.end().
-   BOOST_CONTAINER_FORCEINLINE map(std::initializer_list<value_type> il)
-      : base_t(true, il.begin(), il.end())
-   {}
-
-   //! <b>Effects</b>: Constructs an empty map using the specified comparison object and
-   //! inserts elements from the range [il.begin(), il.end()).
-   //!
-   //! <b>Complexity</b>: Linear in N if the range [first ,last ) is already sorted using
-   //! the predicate and otherwise N logN, where N is il.first() - il.end().
-   BOOST_CONTAINER_FORCEINLINE map(std::initializer_list<value_type> il, const Compare& comp)
-      : base_t(true, il.begin(), il.end(), comp)
-   {}
-
-   //! <b>Effects</b>: Constructs an empty map using the specified
-   //! allocator, and inserts elements from the range [il.begin(), il.end()).
-   //!
-   //! <b>Complexity</b>: Linear in N if the range [first ,last ) is already sorted using
-   //! the predicate and otherwise N logN, where N is il.first() - il.end().
-   BOOST_CONTAINER_FORCEINLINE map(std::initializer_list<value_type> il, const allocator_type& a)
-      : base_t(true, il.begin(), il.end(), Compare(), a)
-   {}
-
-   //! <b>Effects</b>: Constructs an empty map using the specified comparison object and
-   //! allocator, and inserts elements from the range [il.begin(), il.end()).
-   //!
-   //! <b>Complexity</b>: Linear in N if the range [first ,last ) is already sorted using
-   //! the predicate and otherwise N logN, where N is il.first() - il.end().
-   BOOST_CONTAINER_FORCEINLINE map(std::initializer_list<value_type> il, const Compare& comp, const allocator_type& a)
-      : base_t(true, il.begin(), il.end(), comp, a)
-   {}
-
-   //! <b>Effects</b>: Constructs an empty map and inserts elements from the ordered unique range [il.begin(), il.end()).
-   //! This function is more efficient than the normal range creation for ordered ranges.
-   //!
-   //! <b>Requires</b>: [il.begin(), il.end()) must be ordered according to the predicate and must be
-   //! unique values.
-   //!
-   //! <b>Complexity</b>: Linear in N.
-   //!
-   //! <b>Note</b>: Non-standard extension.
-   BOOST_CONTAINER_FORCEINLINE map(ordered_unique_range_t, std::initializer_list<value_type> il)
-      : base_t(ordered_range, il.begin(), il.end())
-   {}
-
-   //! <b>Effects</b>: Constructs an empty map using the specified comparison object,
-   //!  and inserts elements from the ordered unique range [il.begin(), il.end()). This function
-   //! is more efficient than the normal range creation for ordered ranges.
-   //!
-   //! <b>Requires</b>: [il.begin(), il.end()) must be ordered according to the predicate and must be
-   //! unique values.
-   //!
-   //! <b>Complexity</b>: Linear in N.
-   //!
-   //! <b>Note</b>: Non-standard extension.
-   BOOST_CONTAINER_FORCEINLINE map(ordered_unique_range_t, std::initializer_list<value_type> il, const Compare& comp)
-      : base_t(ordered_range, il.begin(), il.end(), comp)
-   {}
-
-   //! <b>Effects</b>: Constructs an empty map using the specified comparison object and
-   //! allocator, and inserts elements from the ordered unique range [il.begin(), il.end()). This function
-   //! is more efficient than the normal range creation for ordered ranges.
-   //!
-   //! <b>Requires</b>: [il.begin(), il.end()) must be ordered according to the predicate and must be
-   //! unique values.
-   //!
-   //! <b>Complexity</b>: Linear in N.
-   //!
-   //! <b>Note</b>: Non-standard extension.
-   BOOST_CONTAINER_FORCEINLINE map( ordered_unique_range_t, std::initializer_list<value_type> il
-                                  , const Compare& comp, const allocator_type& a)
-      : base_t(ordered_range, il.begin(), il.end(), comp, a)
-   {} 
-
-#endif
-
-   //! <b>Effects</b>: Copy constructs a map.
-   //!
-   //! <b>Complexity</b>: Linear in x.size().
-   BOOST_CONTAINER_FORCEINLINE map(const map& x)
-      : base_t(static_cast<const base_t&>(x))
-   {}
-
-   //! <b>Effects</b>: Move constructs a map. Constructs *this using x's resources.
-   //!
-   //! <b>Complexity</b>: Constant.
-   //!
-   //! <b>Postcondition</b>: x is emptied.
-   BOOST_CONTAINER_FORCEINLINE map(BOOST_RV_REF(map) x)
-      BOOST_NOEXCEPT_IF(boost::container::dtl::is_nothrow_move_constructible<Compare>::value)
-      : base_t(BOOST_MOVE_BASE(base_t, x))
-   {}
-
-   //! <b>Effects</b>: Copy constructs a map using the specified allocator.
-   //!
-   //! <b>Complexity</b>: Linear in x.size().
-   BOOST_CONTAINER_FORCEINLINE map(const map& x, const allocator_type &a)
-      : base_t(static_cast<const base_t&>(x), a)
-   {}
-
-   //! <b>Effects</b>: Move constructs a map using the specified allocator.
-   //!                 Constructs *this using x's resources.
-   //!
-   //! <b>Complexity</b>: Constant if x == x.get_allocator(), linear otherwise.
-   //!
-   //! <b>Postcondition</b>: x is emptied.
-   BOOST_CONTAINER_FORCEINLINE map(BOOST_RV_REF(map) x, const allocator_type &a)
-      : base_t(BOOST_MOVE_BASE(base_t, x), a)
-   {}
-
-   //! <b>Effects</b>: Makes *this a copy of x.
-   //!
-   //! <b>Complexity</b>: Linear in x.size().
-   BOOST_CONTAINER_FORCEINLINE map& operator=(BOOST_COPY_ASSIGN_REF(map) x)
-   {  return static_cast<map&>(this->base_t::operator=(static_cast<const base_t&>(x)));  }
-
-   //! <b>Effects</b>: this->swap(x.get()).
-   //!
-   //! <b>Throws</b>: If allocator_traits_type::propagate_on_container_move_assignment
-   //!   is false and (allocation throws or value_type's move constructor throws)
-   //!
-   //! <b>Complexity</b>: Constant if allocator_traits_type::
-   //!   propagate_on_container_move_assignment is true or
-   //!   this->get>allocator() == x.get_allocator(). Linear otherwise.
-   BOOST_CONTAINER_FORCEINLINE map& operator=(BOOST_RV_REF(map) x)
-      BOOST_NOEXCEPT_IF( (allocator_traits_type::propagate_on_container_move_assignment::value ||
-                          allocator_traits_type::is_always_equal::value) &&
-                           boost::container::dtl::is_nothrow_move_assignable<Compare>::value)
-   {  return static_cast<map&>(this->base_t::operator=(BOOST_MOVE_BASE(base_t, x)));  }
-
-#if !defined(BOOST_NO_CXX11_HDR_INITIALIZER_LIST)
-   //! <b>Effects</b>: Assign content of il to *this.
-   //!
-   BOOST_CONTAINER_FORCEINLINE map& operator=(std::initializer_list<value_type> il)
-   {
-       this->clear();
-       insert(il.begin(), il.end());
-       return *this;
-   }
-#endif
-
-   #if defined(BOOST_CONTAINER_DOXYGEN_INVOKED)
-
-   //! <b>Effects</b>: Returns a copy of the allocator that
-   //!   was passed to the object's constructor.
-   //!
-   //! <b>Complexity</b>: Constant.
-   allocator_type get_allocator() const;
-
-   //! <b>Effects</b>: Returns a reference to the internal allocator.
-   //!
-   //! <b>Throws</b>: Nothing
-   //!
-   //! <b>Complexity</b>: Constant.
-   //!
-   //! <b>Note</b>: Non-standard extension.
-   stored_allocator_type &get_stored_allocator() BOOST_NOEXCEPT_OR_NOTHROW;
-
-   //! <b>Effects</b>: Returns a reference to the internal allocator.
-   //!
-   //! <b>Throws</b>: Nothing
-   //!
-   //! <b>Complexity</b>: Constant.
-   //!
-   //! <b>Note</b>: Non-standard extension.
-   const stored_allocator_type &get_stored_allocator() const BOOST_NOEXCEPT_OR_NOTHROW;
-
-   //! <b>Effects</b>: Returns an iterator to the first element contained in the container.
-   //!
-   //! <b>Throws</b>: Nothing.
-   //!
-   //! <b>Complexity</b>: Constant.
-   iterator begin() BOOST_NOEXCEPT_OR_NOTHROW;
-
-   //! <b>Effects</b>: Returns a const_iterator to the first element contained in the container.
-   //!
-   //! <b>Throws</b>: Nothing.
-   //!
-   //! <b>Complexity</b>: Constant.
-   const_iterator begin() const BOOST_NOEXCEPT_OR_NOTHROW;
-
-   //! <b>Effects</b>: Returns a const_iterator to the first element contained in the container.
-   //!
-   //! <b>Throws</b>: Nothing.
-   //!
-   //! <b>Complexity</b>: Constant.
-   const_iterator cbegin() const BOOST_NOEXCEPT_OR_NOTHROW;
-
-   //! <b>Effects</b>: Returns an iterator to the end of the container.
-   //!
-   //! <b>Throws</b>: Nothing.
-   //!
-   //! <b>Complexity</b>: Constant.
-   iterator end() BOOST_NOEXCEPT_OR_NOTHROW;
-
-   //! <b>Effects</b>: Returns a const_iterator to the end of the container.
-   //!
-   //! <b>Throws</b>: Nothing.
-   //!
-   //! <b>Complexity</b>: Constant.
-   const_iterator end() const BOOST_NOEXCEPT_OR_NOTHROW;
-
-   //! <b>Effects</b>: Returns a const_iterator to the end of the container.
-   //!
-   //! <b>Throws</b>: Nothing.
-   //!
-   //! <b>Complexity</b>: Constant.
-   const_iterator cend() const BOOST_NOEXCEPT_OR_NOTHROW;
-
-   //! <b>Effects</b>: Returns a reverse_iterator pointing to the beginning
-   //! of the reversed container.
-   //!
-   //! <b>Throws</b>: Nothing.
-   //!
-   //! <b>Complexity</b>: Constant.
-   reverse_iterator rbegin() BOOST_NOEXCEPT_OR_NOTHROW;
-
-   //! <b>Effects</b>: Returns a const_reverse_iterator pointing to the beginning
-   //! of the reversed container.
-   //!
-   //! <b>Throws</b>: Nothing.
-   //!
-   //! <b>Complexity</b>: Constant.
-   const_reverse_iterator rbegin() const BOOST_NOEXCEPT_OR_NOTHROW;
-
-   //! <b>Effects</b>: Returns a const_reverse_iterator pointing to the beginning
-   //! of the reversed container.
-   //!
-   //! <b>Throws</b>: Nothing.
-   //!
-   //! <b>Complexity</b>: Constant.
-   const_reverse_iterator crbegin() const BOOST_NOEXCEPT_OR_NOTHROW;
-
-   //! <b>Effects</b>: Returns a reverse_iterator pointing to the end
-   //! of the reversed container.
-   //!
-   //! <b>Throws</b>: Nothing.
-   //!
-   //! <b>Complexity</b>: Constant.
-   reverse_iterator rend() BOOST_NOEXCEPT_OR_NOTHROW;
-
-   //! <b>Effects</b>: Returns a const_reverse_iterator pointing to the end
-   //! of the reversed container.
-   //!
-   //! <b>Throws</b>: Nothing.
-   //!
-   //! <b>Complexity</b>: Constant.
-   const_reverse_iterator rend() const BOOST_NOEXCEPT_OR_NOTHROW;
-
-   //! <b>Effects</b>: Returns a const_reverse_iterator pointing to the end
-   //! of the reversed container.
-   //!
-   //! <b>Throws</b>: Nothing.
-   //!
-   //! <b>Complexity</b>: Constant.
-   const_reverse_iterator crend() const BOOST_NOEXCEPT_OR_NOTHROW;
-
-   //! <b>Effects</b>: Returns true if the container contains no elements.
-   //!
-   //! <b>Throws</b>: Nothing.
-   //!
-   //! <b>Complexity</b>: Constant.
-   bool empty() const BOOST_NOEXCEPT_OR_NOTHROW;
-
-   //! <b>Effects</b>: Returns the number of the elements contained in the container.
-   //!
-   //! <b>Throws</b>: Nothing.
-   //!
-   //! <b>Complexity</b>: Constant.
-   size_type size() const BOOST_NOEXCEPT_OR_NOTHROW;
-
-   //! <b>Effects</b>: Returns the largest possible size of the container.
-   //!
-   //! <b>Throws</b>: Nothing.
-   //!
-   //! <b>Complexity</b>: Constant.
-   size_type max_size() const BOOST_NOEXCEPT_OR_NOTHROW;
-
-   #endif   //#if defined(BOOST_CONTAINER_DOXYGEN_INVOKED)
-
-   #if defined(BOOST_CONTAINER_DOXYGEN_INVOKED)
-   //! <b>Effects</b>: If there is no key equivalent to x in the map, inserts
-   //! value_type(x, T()) into the map.
-   //!
-   //! <b>Returns</b>: A reference to the mapped_type corresponding to x in *this.
-   //!
-   //! <b>Complexity</b>: Logarithmic.
-   mapped_type& operator[](const key_type &k);
-
-   //! <b>Effects</b>: If there is no key equivalent to x in the map, inserts
-   //! value_type(boost::move(x), T()) into the map (the key is move-constructed)
-   //!
-   //! <b>Returns</b>: A reference to the mapped_type corresponding to x in *this.
-   //!
-   //! <b>Complexity</b>: Logarithmic.
-   mapped_type& operator[](key_type &&k);
-   #elif defined(BOOST_MOVE_HELPERS_RETURN_SFINAE_BROKEN)
-      //in compilers like GCC 3.4, we can't catch temporaries
-      BOOST_CONTAINER_FORCEINLINE mapped_type& operator[](const key_type &k)         {  return this->priv_subscript(k);  }
-      BOOST_CONTAINER_FORCEINLINE mapped_type& operator[](BOOST_RV_REF(key_type) k)  {  return this->priv_subscript(::boost::move(k));  }
-   #else
-      BOOST_MOVE_CONVERSION_AWARE_CATCH( operator[] , key_type, mapped_type&, this->priv_subscript)
-   #endif
-
-   //! <b>Effects</b>: If a key equivalent to k already exists in the container, assigns forward<M>(obj)
-   //! to the mapped_type corresponding to the key k. If the key does not exist, inserts the new value
-   //! as if by insert, constructing it from value_type(k, forward<M>(obj)).
-   //! 
-   //! No iterators or references are invalidated. If the insertion is successful, pointers and references
-   //! to the element obtained while it is held in the node handle are invalidated, and pointers and
-   //! references obtained to that element before it was extracted become valid.
-   //!
-   //! <b>Returns</b>: The bool component is true if the insertion took place and false if the assignment
-   //!   took place. The iterator component is pointing at the element that was inserted or updated.
-   //!
-   //! <b>Complexity</b>: Logarithmic in the size of the container.
-   template <class M>
-   BOOST_CONTAINER_FORCEINLINE std::pair<iterator, bool> insert_or_assign(const key_type& k, BOOST_FWD_REF(M) obj)
-   {  return this->base_t::insert_or_assign(const_iterator(), k, ::boost::forward<M>(obj));  }
-
-   //! <b>Effects</b>: If a key equivalent to k already exists in the container, assigns forward<M>(obj)
-   //! to the mapped_type corresponding to the key k. If the key does not exist, inserts the new value
-   //! as if by insert, constructing it from value_type(k, move(obj)).
-   //! 
-   //! No iterators or references are invalidated. If the insertion is successful, pointers and references
-   //! to the element obtained while it is held in the node handle are invalidated, and pointers and
-   //! references obtained to that element before it was extracted become valid.
-   //!
-   //! <b>Returns</b>: The bool component is true if the insertion took place and false if the assignment
-   //!   took place. The iterator component is pointing at the element that was inserted or updated.
-   //!
-   //! <b>Complexity</b>: Logarithmic in the size of the container.
-   template <class M>
-   BOOST_CONTAINER_FORCEINLINE std::pair<iterator, bool> insert_or_assign(BOOST_RV_REF(key_type) k, BOOST_FWD_REF(M) obj)
-   {  return this->base_t::insert_or_assign(const_iterator(), ::boost::move(k), ::boost::forward<M>(obj));  }
-
-   //! <b>Effects</b>: If a key equivalent to k already exists in the container, assigns forward<M>(obj)
-   //! to the mapped_type corresponding to the key k. If the key does not exist, inserts the new value
-   //! as if by insert, constructing it from value_type(k, forward<M>(obj)) and the new element
-   //! to the container as close as possible to the position just before hint.
-   //! 
-   //! No iterators or references are invalidated. If the insertion is successful, pointers and references
-   //! to the element obtained while it is held in the node handle are invalidated, and pointers and
-   //! references obtained to that element before it was extracted become valid.
-   //!
-   //! <b>Returns</b>: The bool component is true if the insertion took place and false if the assignment
-   //!   took place. The iterator component is pointing at the element that was inserted or updated.
-   //!
-   //! <b>Complexity</b>: Logarithmic in the size of the container in general, but amortized constant if
-   //! the new element is inserted just before hint.
-   template <class M>
-   BOOST_CONTAINER_FORCEINLINE iterator insert_or_assign(const_iterator hint, const key_type& k, BOOST_FWD_REF(M) obj)
-   {  return this->base_t::insert_or_assign(hint, k, ::boost::forward<M>(obj)).first;  }
-
-   //! <b>Effects</b>: If a key equivalent to k already exists in the container, assigns forward<M>(obj)
-   //! to the mapped_type corresponding to the key k. If the key does not exist, inserts the new value
-   //! as if by insert, constructing it from value_type(k, move(obj)) and the new element
-   //! to the container as close as possible to the position just before hint.
-   //! 
-   //! No iterators or references are invalidated. If the insertion is successful, pointers and references
-   //! to the element obtained while it is held in the node handle are invalidated, and pointers and
-   //! references obtained to that element before it was extracted become valid.
-   //!
-   //! <b>Returns</b>: The bool component is true if the insertion took place and false if the assignment
-   //!   took place. The iterator component is pointing at the element that was inserted or updated.
-   //!
-   //! <b>Complexity</b>: Logarithmic in the size of the container in general, but amortized constant if
-   //! the new element is inserted just before hint.
-   template <class M>
-   BOOST_CONTAINER_FORCEINLINE iterator insert_or_assign(const_iterator hint, BOOST_RV_REF(key_type) k, BOOST_FWD_REF(M) obj)
-   {  return this->base_t::insert_or_assign(hint, ::boost::move(k), ::boost::forward<M>(obj)).first;  }
-
-   //! <b>Returns</b>: A reference to the element whose key is equivalent to x.
-   //! Throws: An exception object of type out_of_range if no such element is present.
-   //! <b>Complexity</b>: logarithmic.
-   T& at(const key_type& k)
-   {
-      iterator i = this->find(k);
-      if(i == this->end()){
-         throw_out_of_range("map::at key not found");
-      }
-      return i->second;
-   }
-
-   //! <b>Returns</b>: A reference to the element whose key is equivalent to x.
-   //! Throws: An exception object of type out_of_range if no such element is present.
-   //! <b>Complexity</b>: logarithmic.
-   BOOST_CONTAINER_ATTRIBUTE_NODISCARD const T& at(const key_type& k) const
-   {
-      const_iterator i = this->find(k);
-      if(i == this->end()){
-         throw_out_of_range("map::at key not found");
-      }
-      return i->second;
-   }
-
-   //////////////////////////////////////////////
-   //
-   //                modifiers
-   //
-   //////////////////////////////////////////////
-
-   //! <b>Effects</b>: Inserts x if and only if there is no element in the container
-   //!   with key equivalent to the key of x.
-   //!
-   //! <b>Returns</b>: The bool component of the returned pair is true if and only
-   //!   if the insertion takes place, and the iterator component of the pair
-   //!   points to the element with key equivalent to the key of x.
-   //!
-   //! <b>Complexity</b>: Logarithmic.
-   BOOST_CONTAINER_FORCEINLINE std::pair<iterator,bool> insert(const value_type& x)
-   { return this->base_t::insert_unique_convertible(x); }
-
-   //! <b>Effects</b>: Move constructs a new value from x if and only if there is
-   //!   no element in the container with key equivalent to the key of x.
-   //!
-   //! <b>Returns</b>: The bool component of the returned pair is true if and only
-   //!   if the insertion takes place, and the iterator component of the pair
-   //!   points to the element with key equivalent to the key of x.
-   //!
-   //! <b>Complexity</b>: Logarithmic.
-   BOOST_CONTAINER_FORCEINLINE std::pair<iterator,bool> insert(BOOST_RV_REF(value_type) x)
-   { return this->base_t::insert_unique_convertible(boost::move(x)); }
-
-   //! <b>Effects</b>: Inserts a new value_type created from the pair if and only if
-   //! there is no element in the container  with key equivalent to the key of x.
-   //!
-   //! <b>Returns</b>: The bool component of the returned pair is true if and only
-   //!   if the insertion takes place, and the iterator component of the pair
-   //!   points to the element with key equivalent to the key of x.
-   //!
-   //! <b>Complexity</b>: Logarithmic.
-   template <class Pair>
-   BOOST_CONTAINER_FORCEINLINE BOOST_CONTAINER_DOC1ST
-         ( std::pair<iterator BOOST_MOVE_I bool>
-         , typename dtl::enable_if_c<
-               dtl::is_convertible<Pair BOOST_MOVE_I value_type>::value ||
-               dtl::is_convertible<Pair BOOST_MOVE_I movable_value_type>::value
-            BOOST_MOVE_I std::pair<iterator BOOST_MOVE_I bool> >::type)
-      insert(BOOST_FWD_REF(Pair) x)
-   {  return this->base_t::emplace_unique(boost::forward<Pair>(x)); }
-
-   BOOST_CONTAINER_FORCEINLINE iterator insert(const_iterator p, const value_type& x)
-   { return this->base_t::insert_unique_hint_convertible(p, x); }
-
-   //! <b>Effects</b>: Inserts a copy of x in the container if and only if there is
-   //!   no element in the container with key equivalent to the key of x.
-   //!   p is a hint pointing to where the insert should start to search.
-   //!
-   //! <b>Returns</b>: An iterator pointing to the element with key equivalent
-   //!   to the key of x.
-   //!
-   //! <b>Complexity</b>: Logarithmic in general, but amortized constant if t
-   //!   is inserted right before p.
-   BOOST_CONTAINER_FORCEINLINE iterator insert(const_iterator p, BOOST_RV_REF(value_type) x)
-   { return this->base_t::insert_unique_hint_convertible(p, boost::move(x)); }
-
-   //! <b>Effects</b>: Inserts a copy of x in the container if and only if there is
-   //!   no element in the container with key equivalent to the key of x.
-   //!   p is a hint pointing to where the insert should start to search.
-   //!
-   //! <b>Returns</b>: An iterator pointing to the element with key equivalent
-   //!   to the key of x.
-   //!
-   //! <b>Complexity</b>: Logarithmic in general, but amortized constant if t
-   //!   is inserted right before p.
-   template <class Pair>
-   BOOST_CONTAINER_FORCEINLINE BOOST_CONTAINER_DOC1ST
-         ( iterator
-         , typename dtl::enable_if_c<
-            dtl::is_convertible<Pair BOOST_MOVE_I value_type>::value  ||
-            dtl::is_convertible<Pair BOOST_MOVE_I movable_value_type>::value
-            BOOST_MOVE_I iterator >::type)
-      insert(const_iterator p, BOOST_FWD_REF(Pair) x)
-   {  return this->base_t::emplace_hint_unique(p, boost::forward<Pair>(x));  }
-
-
-/*
-   //! <b>Effects</b>: Move constructs a new value from x if and only if there is
-   //!   no element in the container with key equivalent to the key of x.
-   //!   p is a hint pointing to where the insert should start to search.
-   //!
-   //! <b>Returns</b>: An iterator pointing to the element with key equivalent
-   //!   to the key of x.
-   //!
-   //! <b>Complexity</b>: Logarithmic in general, but amortized constant if t
-   //!   is inserted right before p.
-   BOOST_CONTAINER_FORCEINLINE iterator insert(const_iterator p, BOOST_RV_REF(nonconst_value_type) x)
-   { return this->try_emplace(p, boost::move(x.first), boost::move(x.second)); }
-
-   //! <b>Effects</b>: Move constructs a new value from x if and only if there is
-   //!   no element in the container with key equivalent to the key of x.
-   //!   p is a hint pointing to where the insert should start to search.
-   //!
-   //! <b>Returns</b>: An iterator pointing to the element with key equivalent
-   //!   to the key of x.
-   //!
-   //! <b>Complexity</b>: Logarithmic in general, but amortized constant if t
-   //!   is inserted right before p.
-   BOOST_CONTAINER_FORCEINLINE iterator insert(const_iterator p, BOOST_RV_REF(movable_value_type) x)
-   { return this->try_emplace(p, boost::move(x.first), boost::move(x.second)); }
-
-   //! <b>Effects</b>: Inserts a copy of x in the container.
-   //!   p is a hint pointing to where the insert should start to search.
-   //!
-   //! <b>Returns</b>: An iterator pointing to the element with key equivalent to the key of x.
-   //!
-   //! <b>Complexity</b>: Logarithmic.
-   BOOST_CONTAINER_FORCEINLINE iterator insert(const_iterator p, const nonconst_value_type& x)
-   { return this->try_emplace(p, x.first, x.second); }
-
-
-*/
-   //! <b>Requires</b>: first, last are not iterators into *this.
-   //!
-   //! <b>Effects</b>: inserts each element from the range [first,last) if and only
-   //!   if there is no element with key equivalent to the key of that element.
-   //!
-   //! <b>Complexity</b>: At most N log(size()+N) (N is the distance from first to last)
-   template <class InputIterator>
-   BOOST_CONTAINER_FORCEINLINE void insert(InputIterator first, InputIterator last)
-   {  this->base_t::insert_unique_range(first, last);  }
-
-#if !defined(BOOST_NO_CXX11_HDR_INITIALIZER_LIST)
-   //! <b>Effects</b>: inserts each element from the range [il.begin(), il.end()) if and only
-   //!   if there is no element with key equivalent to the key of that element.
-   //!
-   //! <b>Complexity</b>: At most N log(size()+N) (N is the distance from il.begin() to il.end())
-   BOOST_CONTAINER_FORCEINLINE void insert(std::initializer_list<value_type> il)
-   {  this->base_t::insert_unique_range(il.begin(), il.end()); }
-#endif
-
-   //! <b>Requires</b>: nh is empty or this->get_allocator() == nh.get_allocator().
-   //!
-   //! <b>Effects</b>: If nh is empty, has no effect. Otherwise, inserts the element owned
-   //!   by nh if and only if there is no element in the container with a key equivalent to nh.key().
-   //!
-   //! <b>Returns</b>: If nh is empty, insert_return_type.inserted is false, insert_return_type.position
-   //!   is end(), and insert_return_type.node is empty. Otherwise if the insertion took place,
-   //!   insert_return_type.inserted is true, insert_return_type.position points to the inserted element,
-   //!   and insert_return_type.node is empty; if the insertion failed, insert_return_type.inserted is
-   //!   false, insert_return_type.node has the previous value of nh, and insert_return_type.position
-   //!   points to an element with a key equivalent to nh.key().
-   //!
-   //! <b>Complexity</b>: Logarithmic
-   insert_return_type insert(BOOST_RV_REF_BEG_IF_CXX11 node_type BOOST_RV_REF_END_IF_CXX11 nh)
-   {
-      typename base_t::node_type  n(boost::move(nh));
-      typename base_t::insert_return_type base_ret(this->base_t::insert_unique_node(boost::move(n)));
-      return insert_return_type (base_ret.inserted, base_ret.position, boost::move(base_ret.node));
-   }
-
-   //! <b>Effects</b>: Same as `insert(node_type && nh)` but the element is inserted as close as possible
-   //!   to the position just prior to "hint".
-   //!
-   //! <b>Complexity</b>: logarithmic in general, but amortized constant if the element is inserted
-   //!   right before "hint".
-   insert_return_type insert(const_iterator hint, BOOST_RV_REF_BEG_IF_CXX11 node_type BOOST_RV_REF_END_IF_CXX11 nh)
-   {
-      typename base_t::node_type  n(boost::move(nh));
-      typename base_t::insert_return_type base_ret(this->base_t::insert_unique_node(hint, boost::move(n)));
-      return insert_return_type (base_ret.inserted, base_ret.position, boost::move(base_ret.node));
-   }
-
-   #if !defined(BOOST_NO_CXX11_VARIADIC_TEMPLATES) || defined(BOOST_CONTAINER_DOXYGEN_INVOKED)
-
-   //! <b>Effects</b>: Inserts an object x of type T constructed with
-   //!   std::forward<Args>(args)... in the container if and only if there is
-   //!   no element in the container with an equivalent key.
-   //!   p is a hint pointing to where the insert should start to search.
-   //!
-   //! <b>Returns</b>: The bool component of the returned pair is true if and only
-   //!   if the insertion takes place, and the iterator component of the pair
-   //!   points to the element with key equivalent to the key of x.
-   //!
-   //! <b>Complexity</b>: Logarithmic in general, but amortized constant if t
-   //!   is inserted right before p.
-   template <class... Args>
-   BOOST_CONTAINER_FORCEINLINE std::pair<iterator,bool> emplace(BOOST_FWD_REF(Args)... args)
-   {  return this->base_t::emplace_unique(boost::forward<Args>(args)...); }
-
-   //! <b>Effects</b>: Inserts an object of type T constructed with
-   //!   std::forward<Args>(args)... in the container if and only if there is
-   //!   no element in the container with an equivalent key.
-   //!   p is a hint pointing to where the insert should start to search.
-   //!
-   //! <b>Returns</b>: An iterator pointing to the element with key equivalent
-   //!   to the key of x.
-   //!
-   //! <b>Complexity</b>: Logarithmic in general, but amortized constant if t
-   //!   is inserted right before p.
-   template <class... Args>
-   BOOST_CONTAINER_FORCEINLINE iterator emplace_hint(const_iterator p, BOOST_FWD_REF(Args)... args)
-   {  return this->base_t::emplace_hint_unique(p, boost::forward<Args>(args)...); }
-
-   //! <b>Requires</b>: value_type shall be EmplaceConstructible into map from piecewise_construct, 
-   //! forward_as_tuple(k), forward_as_tuple(forward<Args>(args)...).
-   //! 
-   //! <b>Effects</b>: If the map already contains an element whose key is equivalent to k, there is no effect. Otherwise
-   //! inserts an object of type value_type constructed with piecewise_construct, forward_as_tuple(k),
-   //! forward_as_tuple(forward<Args>(args)...).
-   //! 
-   //! <b>Returns</b>: The bool component of the returned pair is true if and only if the
-   //! insertion took place. The returned iterator points to the map element whose key is equivalent to k.
-   //! 
-   //! <b>Complexity</b>: Logarithmic.
-   template <class... Args>
-   BOOST_CONTAINER_FORCEINLINE std::pair<iterator, bool> try_emplace(const key_type& k, BOOST_FWD_REF(Args)... args)
-   {  return this->base_t::try_emplace(const_iterator(), k, boost::forward<Args>(args)...); }
-
-   //! <b>Requires</b>: value_type shall be EmplaceConstructible into map from piecewise_construct, 
-   //! forward_as_tuple(k), forward_as_tuple(forward<Args>(args)...).
-   //! 
-   //! <b>Effects</b>: If the map already contains an element whose key is equivalent to k, there is no effect. Otherwise
-   //! inserts an object of type value_type constructed with piecewise_construct, forward_as_tuple(k),
-   //! forward_as_tuple(forward<Args>(args)...).
-   //! 
-   //! <b>Returns</b>: The returned iterator points to the map element whose key is equivalent to k.
-   //! 
-   //! <b>Complexity</b>: Logarithmic in general, but amortized constant if value
-   //!   is inserted right before p.
-   template <class... Args>
-   BOOST_CONTAINER_FORCEINLINE iterator try_emplace(const_iterator hint, const key_type &k, BOOST_FWD_REF(Args)... args)
-   {  return this->base_t::try_emplace(hint, k, boost::forward<Args>(args)...).first; }
-
-   //! <b>Requires</b>: value_type shall be EmplaceConstructible into map from piecewise_construct, 
-   //! forward_as_tuple(move(k)), forward_as_tuple(forward<Args>(args)...).
-   //! 
-   //! <b>Effects</b>: If the map already contains an element whose key is equivalent to k, there is no effect. Otherwise
-   //! inserts an object of type value_type constructed with piecewise_construct, forward_as_tuple(move(k)),
-   //! forward_as_tuple(forward<Args>(args)...).
-   //! 
-   //! <b>Returns</b>: The bool component of the returned pair is true if and only if the
-   //! insertion took place. The returned iterator points to the map element whose key is equivalent to k.
-   //! 
-   //! <b>Complexity</b>: Logarithmic.
-   template <class... Args>
-   BOOST_CONTAINER_FORCEINLINE std::pair<iterator, bool> try_emplace(BOOST_RV_REF(key_type) k, BOOST_FWD_REF(Args)... args)
-   {  return this->base_t::try_emplace(const_iterator(), boost::move(k), boost::forward<Args>(args)...); }
-
-   //! <b>Requires</b>: value_type shall be EmplaceConstructible into map from piecewise_construct, 
-   //! forward_as_tuple(move(k)), forward_as_tuple(forward<Args>(args)...).
-   //! 
-   //! <b>Effects</b>: If the map already contains an element whose key is equivalent to k, there is no effect. Otherwise
-   //! inserts an object of type value_type constructed with piecewise_construct, forward_as_tuple(move(k)),
-   //! forward_as_tuple(forward<Args>(args)...).
-   //! 
-   //! <b>Returns</b>: The returned iterator points to the map element whose key is equivalent to k.
-   //! 
-   //! <b>Complexity</b>: Logarithmic in general, but amortized constant if value
-   //!   is inserted right before p.
-   template <class... Args>
-   BOOST_CONTAINER_FORCEINLINE iterator try_emplace(const_iterator hint, BOOST_RV_REF(key_type) k, BOOST_FWD_REF(Args)... args)
-   {  return this->base_t::try_emplace(hint, boost::move(k), boost::forward<Args>(args)...).first; }
-
-   #else // !defined(BOOST_NO_CXX11_VARIADIC_TEMPLATES)
-
-   #define BOOST_CONTAINER_MAP_EMPLACE_CODE(N) \
-   BOOST_MOVE_TMPL_LT##N BOOST_MOVE_CLASS##N BOOST_MOVE_GT##N \
-   BOOST_CONTAINER_FORCEINLINE std::pair<iterator,bool> emplace(BOOST_MOVE_UREF##N)\
-   {  return this->base_t::emplace_unique(BOOST_MOVE_FWD##N);   }\
-   \
-   BOOST_MOVE_TMPL_LT##N BOOST_MOVE_CLASS##N BOOST_MOVE_GT##N \
-   BOOST_CONTAINER_FORCEINLINE iterator emplace_hint(const_iterator hint BOOST_MOVE_I##N BOOST_MOVE_UREF##N)\
-   {  return this->base_t::emplace_hint_unique(hint BOOST_MOVE_I##N BOOST_MOVE_FWD##N);  }\
-   \
-   BOOST_MOVE_TMPL_LT##N BOOST_MOVE_CLASS##N BOOST_MOVE_GT##N \
-   BOOST_CONTAINER_FORCEINLINE std::pair<iterator, bool> try_emplace(const key_type& k BOOST_MOVE_I##N BOOST_MOVE_UREF##N)\
-   {  return this->base_t::try_emplace(const_iterator(), k BOOST_MOVE_I##N BOOST_MOVE_FWD##N); }\
-   \
-   BOOST_MOVE_TMPL_LT##N BOOST_MOVE_CLASS##N BOOST_MOVE_GT##N \
-   BOOST_CONTAINER_FORCEINLINE iterator try_emplace(const_iterator hint, const key_type &k BOOST_MOVE_I##N BOOST_MOVE_UREF##N)\
-   {  return this->base_t::try_emplace(hint, k BOOST_MOVE_I##N BOOST_MOVE_FWD##N).first; }\
-   \
-   BOOST_MOVE_TMPL_LT##N BOOST_MOVE_CLASS##N BOOST_MOVE_GT##N \
-   BOOST_CONTAINER_FORCEINLINE std::pair<iterator, bool> try_emplace(BOOST_RV_REF(key_type) k BOOST_MOVE_I##N BOOST_MOVE_UREF##N)\
-   {  return this->base_t::try_emplace(const_iterator(), boost::move(k) BOOST_MOVE_I##N BOOST_MOVE_FWD##N); }\
-   \
-   BOOST_MOVE_TMPL_LT##N BOOST_MOVE_CLASS##N BOOST_MOVE_GT##N \
-   BOOST_CONTAINER_FORCEINLINE iterator try_emplace(const_iterator hint, BOOST_RV_REF(key_type) k BOOST_MOVE_I##N BOOST_MOVE_UREF##N)\
-   {  return this->base_t::try_emplace(hint, boost::move(k) BOOST_MOVE_I##N BOOST_MOVE_FWD##N).first; }\
-   //
-   BOOST_MOVE_ITERATE_0TO9(BOOST_CONTAINER_MAP_EMPLACE_CODE)
-   #undef BOOST_CONTAINER_MAP_EMPLACE_CODE
-
-   #endif   // !defined(BOOST_NO_CXX11_VARIADIC_TEMPLATES)
-
-   //! <b>Effects</b>: If present, erases the element in the container with key equivalent to x.
-   //!
-   //! <b>Returns</b>: Returns the number of erased elements (0/1).
-   //!
-   //! <b>Complexity</b>: log(size()) + count(k)
-   BOOST_CONTAINER_FORCEINLINE size_type erase(const key_type& x)
-      { return this->base_t::erase_unique(x); }
-
-   #if defined(BOOST_CONTAINER_DOXYGEN_INVOKED)
-
-   //! <b>Effects</b>: Erases the element pointed to by p.
-   //!
-   //! <b>Returns</b>: Returns an iterator pointing to the element immediately
-   //!   following q prior to the element being erased. If no such element exists,
-   //!   returns end().
-   //!
-   //! <b>Complexity</b>: Amortized constant time
-   iterator erase(const_iterator p) BOOST_NOEXCEPT_OR_NOTHROW;
-
-   //! <b>Effects</b>: Erases all the elements in the range [first, last).
-   //!
-   //! <b>Returns</b>: Returns last.
-   //!
-   //! <b>Complexity</b>: log(size())+N where N is the distance from first to last.
-   iterator erase(const_iterator first, const_iterator last) BOOST_NOEXCEPT_OR_NOTHROW;
-
-   #else
-   using base_t::erase;
-   #endif   //   #if defined(BOOST_CONTAINER_DOXYGEN_INVOKED)
-
-   //! <b>Effects</b>: Removes the first element in the container with key equivalent to k.
-   //!
-   //! <b>Returns</b>: A node_type owning the element if found, otherwise an empty node_type.
-   //!
-   //! <b>Complexity</b>: log(size()).
-   node_type extract(const key_type& k)
-   {
-      typename base_t::node_type base_nh(this->base_t::extract(k));
-      node_type nh(boost::move(base_nh));
-      return BOOST_MOVE_RET(node_type, nh);
-   }
-
-   //! <b>Effects</b>: Removes the element pointed to by "position".
-   //!
-   //! <b>Returns</b>: A node_type owning the element, otherwise an empty node_type.
-   //!
-   //! <b>Complexity</b>: Amortized constant.
-   node_type extract(const_iterator position)
-   {
-      typename base_t::node_type base_nh(this->base_t::extract(position));
-      node_type nh(boost::move(base_nh));
-      return BOOST_MOVE_RET(node_type, nh);
-   }
-
-   //! <b>Requires</b>: this->get_allocator() == source.get_allocator().
-   //!
-   //! <b>Effects</b>: Attempts to extract each element in source and insert it into a using
-   //!   the comparison object of *this. If there is an element in a with key equivalent to the
-   //!   key of an element from source, then that element is not extracted from source.
-   //! 
-   //! <b>Postcondition</b>: Pointers and references to the transferred elements of source refer
-   //!   to those same elements but as members of *this. Iterators referring to the transferred
-   //!   elements will continue to refer to their elements, but they now behave as iterators into *this,
-   //!   not into source.
-   //!
-   //! <b>Throws</b>: Nothing unless the comparison object throws.
-   //!
-   //! <b>Complexity</b>: N log(size() + N) (N has the value source.size())
-   template<class C2>
-   BOOST_CONTAINER_FORCEINLINE void merge(map<Key, T, C2, Allocator, Options>& source)
-   {
-      typedef dtl::tree
-         <value_type_impl, select_1st_t, C2, Allocator, Options> base2_t;
-      this->merge_unique(static_cast<base2_t&>(source));
-   }
-
-   //! @copydoc ::boost::container::map::merge(map<Key, T, C2, Allocator, Options>&)
-   template<class C2>
-   BOOST_CONTAINER_FORCEINLINE void merge(BOOST_RV_REF_BEG map<Key, T, C2, Allocator, Options> BOOST_RV_REF_END source)
-   {  return this->merge(static_cast<map<Key, T, C2, Allocator, Options>&>(source)); }
-
-   //! @copydoc ::boost::container::map::merge(map<Key, T, C2, Allocator, Options>&)
-   template<class C2>
-   BOOST_CONTAINER_FORCEINLINE void merge(multimap<Key, T, C2, Allocator, Options>& source)
-   {
-      typedef dtl::tree
-         <value_type_impl, select_1st_t, C2, Allocator, Options> base2_t;
-      this->base_t::merge_unique(static_cast<base2_t&>(source));
-   }
-
-   //! @copydoc ::boost::container::map::merge(map<Key, T, C2, Allocator, Options>&)
-   template<class C2>
-   BOOST_CONTAINER_FORCEINLINE void merge(BOOST_RV_REF_BEG multimap<Key, T, C2, Allocator, Options> BOOST_RV_REF_END source)
-   {  return this->merge(static_cast<multimap<Key, T, C2, Allocator, Options>&>(source)); }
-
-   #if defined(BOOST_CONTAINER_DOXYGEN_INVOKED)
-   //! <b>Effects</b>: Swaps the contents of *this and x.
-   //!
-   //! <b>Throws</b>: Nothing.
-   //!
-   //! <b>Complexity</b>: Constant.
-   void swap(map& x)
-      BOOST_NOEXCEPT_IF(  allocator_traits_type::is_always_equal::value
-                                 && boost::container::dtl::is_nothrow_swappable<Compare>::value );
-
-   //! <b>Effects</b>: erase(begin(),end()).
-   //!
-   //! <b>Postcondition</b>: size() == 0.
-   //!
-   //! <b>Complexity</b>: linear in size().
-   void clear() BOOST_NOEXCEPT_OR_NOTHROW;
-
-   //! <b>Effects</b>: Returns the comparison object out
-   //!   of which a was constructed.
-   //!
-   //! <b>Complexity</b>: Constant.
-   key_compare key_comp() const;
-
-   //! <b>Effects</b>: Returns an object of value_compare constructed out
-   //!   of the comparison object.
-   //!
-   //! <b>Complexity</b>: Constant.
-   value_compare value_comp() const;
-
-   //! <b>Returns</b>: An iterator pointing to an element with the key
-   //!   equivalent to x, or end() if such an element is not found.
-   //!
-   //! <b>Complexity</b>: Logarithmic.
-   iterator find(const key_type& x);
-
-   //! <b>Returns</b>: A const_iterator pointing to an element with the key
-   //!   equivalent to x, or end() if such an element is not found.
-   //!
-   //! <b>Complexity</b>: Logarithmic.
-   const_iterator find(const key_type& x) const;
-
-   //! <b>Requires</b>: This overload is available only if
-   //! key_compare::is_transparent exists.
-   //!
-   //! <b>Returns</b>: An iterator pointing to an element with the key
-   //!   equivalent to x, or end() if such an element is not found.
-   //!
-   //! <b>Complexity</b>: Logarithmic.
-   template<typename K>
-   iterator find(const K& x);
-
-   //! <b>Requires</b>: This overload is available only if
-   //! key_compare::is_transparent exists.
-   //!
-   //! <b>Returns</b>: A const_iterator pointing to an element with the key
-   //!   equivalent to x, or end() if such an element is not found.
-   //!
-   //! <b>Complexity</b>: Logarithmic.
-   template<typename K>
-   const_iterator find(const K& x) const;
-
-   #endif   //#if defined(BOOST_CONTAINER_DOXYGEN_INVOKED)
-
-   //! <b>Returns</b>: The number of elements with key equivalent to x.
-   //!
-   //! <b>Complexity</b>: log(size())+count(k)
-   BOOST_CONTAINER_ATTRIBUTE_NODISCARD BOOST_CONTAINER_FORCEINLINE
-      size_type count(const key_type& x) const
-   {  return static_cast<size_type>(this->find(x) != this->cend());  }
-
-   //! <b>Requires</b>: This overload is available only if
-   //! key_compare::is_transparent exists.
-   //!
-   //! <b>Returns</b>: The number of elements with key equivalent to x.
-   //!
-   //! <b>Complexity</b>: log(size())+count(k)
-   template<typename K>
-   BOOST_CONTAINER_ATTRIBUTE_NODISCARD BOOST_CONTAINER_FORCEINLINE
-      size_type count(const K& x) const
-   {  return static_cast<size_type>(this->find(x) != this->cend());  }
-
-   #if defined(BOOST_CONTAINER_DOXYGEN_INVOKED)
-
-   //! <b>Returns</b>: Returns true if there is an element with key
-   //!   equivalent to key in the container, otherwise false.
-   //!
-   //! <b>Complexity</b>: log(size()).
-   bool contains(const key_type& x) const;
-
-   //! <b>Requires</b>: This overload is available only if
-   //! key_compare::is_transparent exists.
-   //!
-   //! <b>Returns</b>: Returns true if there is an element with key
-   //!   equivalent to key in the container, otherwise false.
-   //!
-   //! <b>Complexity</b>: log(size()).
-   template<typename K>
-   bool contains(const K& x) const;
-
-   //! <b>Returns</b>: An iterator pointing to the first element with key not less
-   //!   than x, or end() if such an element is not found.
-   //!
-   //! <b>Complexity</b>: Logarithmic
-   iterator lower_bound(const key_type& x);
-
-   //! <b>Returns</b>: A const iterator pointing to the first element with key not
-   //!   less than x, or end() if such an element is not found.
-   //!
-   //! <b>Complexity</b>: Logarithmic
-   const_iterator lower_bound(const key_type& x) const;
-
-   //! <b>Requires</b>: This overload is available only if
-   //! key_compare::is_transparent exists.
-   //!
-   //! <b>Returns</b>: An iterator pointing to the first element with key not less
-   //!   than x, or end() if such an element is not found.
-   //!
-   //! <b>Complexity</b>: Logarithmic
-   template<typename K>
-   iterator lower_bound(const K& x);
-
-   //! <b>Requires</b>: This overload is available only if
-   //! key_compare::is_transparent exists.
-   //!
-   //! <b>Returns</b>: A const iterator pointing to the first element with key not
-   //!   less than x, or end() if such an element is not found.
-   //!
-   //! <b>Complexity</b>: Logarithmic
-   template<typename K>
-   const_iterator lower_bound(const K& x) const;
-
-   //! <b>Returns</b>: An iterator pointing to the first element with key greater
-   //!   than x, or end() if such an element is not found.
-   //!
-   //! <b>Complexity</b>: Logarithmic
-   iterator upper_bound(const key_type& x);
-
-   //! <b>Returns</b>: A const iterator pointing to the first element with key
-   //!   greater than x, or end() if such an element is not found.
-   //!
-   //! <b>Complexity</b>: Logarithmic
-   const_iterator upper_bound(const key_type& x) const;
-
-   //! <b>Requires</b>: This overload is available only if
-   //! key_compare::is_transparent exists.
-   //!
-   //! <b>Returns</b>: An iterator pointing to the first element with key greater
-   //!   than x, or end() if such an element is not found.
-   //!
-   //! <b>Complexity</b>: Logarithmic
-   template<typename K>
-   iterator upper_bound(const K& x);
-
-   //! <b>Requires</b>: This overload is available only if
-   //! key_compare::is_transparent exists.
-   //!
-   //! <b>Returns</b>: A const iterator pointing to the first element with key
-   //!   greater than x, or end() if such an element is not found.
-   //!
-   //! <b>Complexity</b>: Logarithmic
-   template<typename K>
-   const_iterator upper_bound(const K& x) const;
-
-   //! <b>Effects</b>: Equivalent to std::make_pair(this->lower_bound(k), this->upper_bound(k)).
-   //!
-   //! <b>Complexity</b>: Logarithmic
-   std::pair<iterator,iterator> equal_range(const key_type& x);
-
-   //! <b>Effects</b>: Equivalent to std::make_pair(this->lower_bound(k), this->upper_bound(k)).
-   //!
-   //! <b>Complexity</b>: Logarithmic
-   std::pair<const_iterator,const_iterator> equal_range(const key_type& x) const;
-
-   //! <b>Requires</b>: This overload is available only if
-   //! key_compare::is_transparent exists.
-   //!
-   //! <b>Effects</b>: Equivalent to std::make_pair(this->lower_bound(k), this->upper_bound(k)).
-   //!
-   //! <b>Complexity</b>: Logarithmic
-   template<typename K>
-   std::pair<iterator,iterator> equal_range(const K& x);
-
-   //! <b>Requires</b>: This overload is available only if
-   //! key_compare::is_transparent exists.
-   //!
-   //! <b>Effects</b>: Equivalent to std::make_pair(this->lower_bound(k), this->upper_bound(k)).
-   //!
-   //! <b>Complexity</b>: Logarithmic
-   template<typename K>
-   std::pair<const_iterator,const_iterator> equal_range(const K& x) const;
-
-   //! <b>Effects</b>: Rebalances the tree. It's a no-op for Red-Black and AVL trees.
-   //!
-   //! <b>Complexity</b>: Linear
-   void rebalance();
-
-   //! <b>Effects</b>: Returns true if x and y are equal
-   //!
-   //! <b>Complexity</b>: Linear to the number of elements in the container.
-   friend bool operator==(const map& x, const map& y);
-
-   //! <b>Effects</b>: Returns true if x and y are unequal
-   //!
-   //! <b>Complexity</b>: Linear to the number of elements in the container.
-   friend bool operator!=(const map& x, const map& y);
-
-   //! <b>Effects</b>: Returns true if x is less than y
-   //!
-   //! <b>Complexity</b>: Linear to the number of elements in the container.
-   friend bool operator<(const map& x, const map& y);
-
-   //! <b>Effects</b>: Returns true if x is greater than y
-   //!
-   //! <b>Complexity</b>: Linear to the number of elements in the container.
-   friend bool operator>(const map& x, const map& y);
-
-   //! <b>Effects</b>: Returns true if x is equal or less than y
-   //!
-   //! <b>Complexity</b>: Linear to the number of elements in the container.
-   friend bool operator<=(const map& x, const map& y);
-
-   //! <b>Effects</b>: Returns true if x is equal or greater than y
-   //!
-   //! <b>Complexity</b>: Linear to the number of elements in the container.
-   friend bool operator>=(const map& x, const map& y);
-
-   //! <b>Effects</b>: x.swap(y)
-   //!
-   //! <b>Complexity</b>: Constant.
-   friend void swap(map& x, map& y)
-      BOOST_NOEXCEPT_IF(  allocator_traits_type::is_always_equal::value
-                                 && boost::container::dtl::is_nothrow_swappable<Compare>::value );
-
-   #endif   //#if defined(BOOST_CONTAINER_DOXYGEN_INVOKED)
-
-   #ifndef BOOST_CONTAINER_DOXYGEN_INVOKED
-   private:
-   template<class KeyConvertible>
-   BOOST_CONTAINER_FORCEINLINE mapped_type& priv_subscript(BOOST_FWD_REF(KeyConvertible) k)
-   {
-      return this->try_emplace(boost::forward<KeyConvertible>(k)).first->second;
-   }
-   #endif   //#ifndef BOOST_CONTAINER_DOXYGEN_INVOKED
-};
-
-#ifndef BOOST_CONTAINER_NO_CXX17_CTAD
-
-template <typename InputIterator>
-map(InputIterator, InputIterator) ->
-   map< it_based_non_const_first_type_t<InputIterator>
-           , it_based_second_type_t<InputIterator>>;
-
-template < typename InputIterator, typename AllocatorOrCompare>
-    map(InputIterator, InputIterator, AllocatorOrCompare const&) ->
-    map< it_based_non_const_first_type_t<InputIterator>
-            , it_based_second_type_t<InputIterator>
-            , typename dtl::if_c< // Compare
-                dtl::is_allocator<AllocatorOrCompare>::value
-                , std::less<it_based_non_const_first_type_t<InputIterator>>
-                , AllocatorOrCompare
-            >::type
-            , typename dtl::if_c< // Allocator
-                dtl::is_allocator<AllocatorOrCompare>::value
-                , AllocatorOrCompare
-                , new_allocator<std::pair<it_based_const_first_type_t<InputIterator>, it_based_second_type_t<InputIterator>>>
-                >::type
-            >;
-
-template < typename InputIterator, typename Compare, typename Allocator
-         , typename = dtl::require_nonallocator_t<Compare>
-         , typename = dtl::require_allocator_t<Allocator>>
-map(InputIterator, InputIterator, Compare const&, Allocator const&) ->
-   map< it_based_non_const_first_type_t<InputIterator>
-           , it_based_second_type_t<InputIterator>
-           , Compare
-           , Allocator>;
-
-template <typename InputIterator>
-map(ordered_unique_range_t, InputIterator, InputIterator) ->
-   map< it_based_non_const_first_type_t<InputIterator>
-           , it_based_second_type_t<InputIterator>>;
-
-template < typename InputIterator, typename AllocatorOrCompare>
-map(ordered_unique_range_t, InputIterator, InputIterator, AllocatorOrCompare const&) ->
-   map< it_based_non_const_first_type_t<InputIterator>
-           , it_based_second_type_t<InputIterator>
-           , typename dtl::if_c<   // Compare
-               dtl::is_allocator<AllocatorOrCompare>::value
-               , std::less<it_based_non_const_first_type_t<InputIterator>>
-               , AllocatorOrCompare
-               >::type
-           , typename dtl::if_c<   // Allocator
-               dtl::is_allocator<AllocatorOrCompare>::value
-               , AllocatorOrCompare
-               , new_allocator<std::pair<it_based_const_first_type_t<InputIterator>, it_based_second_type_t<InputIterator>>>
-               >::type
-           >;
-
-template < typename InputIterator, typename Compare, typename Allocator
-         , typename = dtl::require_nonallocator_t<Compare>
-         , typename = dtl::require_allocator_t<Allocator>>
-map(ordered_unique_range_t, InputIterator, InputIterator, Compare const&, Allocator const&) ->
-   map< it_based_non_const_first_type_t<InputIterator>
-           , it_based_second_type_t<InputIterator>
-           , Compare
-           , Allocator>;
-
-#endif
-
-
-#ifndef BOOST_CONTAINER_DOXYGEN_INVOKED
-
-}  //namespace container {
-
-//!has_trivial_destructor_after_move<> == true_type
-//!specialization for optimizations
-template <class Key, class T, class Compare, class Allocator, class Options>
-struct has_trivial_destructor_after_move<boost::container::map<Key, T, Compare, Allocator, Options> >
-{
-   typedef ::boost::container::dtl::tree<std::pair<const Key, T>, int, Compare, Allocator, Options> tree;
-   static const bool value = ::boost::has_trivial_destructor_after_move<tree>::value;
-};
-
-namespace container {
-
-#endif   //#ifndef BOOST_CONTAINER_DOXYGEN_INVOKED
-
-#ifdef BOOST_CONTAINER_DOXYGEN_INVOKED
-
-//! A multimap is a kind of associative container that supports equivalent keys
-//! (possibly containing multiple copies of the same key value) and provides for
-//! fast retrieval of values of another type T based on the keys. The multimap class
-//! supports bidirectional iterators.
-//!
-//! A multimap satisfies all of the requirements of a container and of a reversible
-//! container and of an associative container. The <code>value_type</code> stored
-//! by this container is the value_type is std::pair<const Key, T>.
-//!
-//! \tparam Key is the key_type of the map
-//! \tparam Value is the <code>mapped_type</code>
-//! \tparam Compare is the ordering function for Keys (e.g. <i>std::less<Key></i>).
-//! \tparam Allocator is the allocator to allocate the <code>value_type</code>s
-//!   (e.g. <i>allocator< std::pair<const Key, T> > </i>).
-//! \tparam Options is an packed option type generated using using boost::container::tree_assoc_options.
-template < class Key, class T, class Compare = std::less<Key>
-         , class Allocator = new_allocator< std::pair< const Key, T> >, class Options = tree_assoc_defaults>
-#else
-template <class Key, class T, class Compare, class Allocator, class Options>
-#endif
-class multimap
-   ///@cond
-   : public dtl::tree
-      < std::pair<const Key, T>
-      , int
-      , Compare, Allocator, Options>
-   ///@endcond
-{
-   #ifndef BOOST_CONTAINER_DOXYGEN_INVOKED
-   private:
-   BOOST_COPYABLE_AND_MOVABLE(multimap)
-
-   typedef int                                                                   select_1st_t;
-   typedef std::pair<const Key, T>                                               value_type_impl;
-   typedef dtl::tree
-      <value_type_impl, select_1st_t, Compare, Allocator, Options>               base_t;
-   typedef dtl::pair <Key, T>                                       movable_value_type_impl;
-   typedef typename base_t::value_compare                                        value_compare_impl;
-   #endif   //#ifndef BOOST_CONTAINER_DOXYGEN_INVOKED
-
-   public:
-   //////////////////////////////////////////////
-   //
-   //                    types
-   //
-   //////////////////////////////////////////////
-
-   typedef Key                                                                            key_type;
-   typedef T                                                                              mapped_type;
-   typedef typename base_t::allocator_type                                                allocator_type;
-   typedef ::boost::container::allocator_traits<allocator_type>                           allocator_traits_type;
-   typedef typename boost::container::allocator_traits<allocator_type>::value_type        value_type;
-   typedef typename boost::container::allocator_traits<allocator_type>::pointer           pointer;
-   typedef typename boost::container::allocator_traits<allocator_type>::const_pointer     const_pointer;
-   typedef typename boost::container::allocator_traits<allocator_type>::reference         reference;
-   typedef typename boost::container::allocator_traits<allocator_type>::const_reference   const_reference;
-   typedef typename boost::container::allocator_traits<allocator_type>::size_type         size_type;
-   typedef typename boost::container::allocator_traits<allocator_type>::difference_type   difference_type;
-   typedef typename BOOST_CONTAINER_IMPDEF(base_t::stored_allocator_type)                 stored_allocator_type;
-   typedef BOOST_CONTAINER_IMPDEF(value_compare_impl)                                     value_compare;
-   typedef Compare                                                                        key_compare;
-   typedef typename BOOST_CONTAINER_IMPDEF(base_t::iterator)                              iterator;
-   typedef typename BOOST_CONTAINER_IMPDEF(base_t::const_iterator)                        const_iterator;
-   typedef typename BOOST_CONTAINER_IMPDEF(base_t::reverse_iterator)                      reverse_iterator;
-   typedef typename BOOST_CONTAINER_IMPDEF(base_t::const_reverse_iterator)                const_reverse_iterator;
-   //typedef std::pair<key_type, mapped_type>                                               nonconst_value_type;
-   typedef BOOST_CONTAINER_IMPDEF(movable_value_type_impl)                                movable_value_type;
-   typedef BOOST_CONTAINER_IMPDEF(node_handle<
-      typename base_t::stored_allocator_type
-      BOOST_MOVE_I pair_key_mapped_of_value
-         <key_type BOOST_MOVE_I mapped_type> >)                                     node_type;
-
-   //allocator_type::value_type type must be std::pair<CONST Key, T>
-   BOOST_STATIC_ASSERT((dtl::is_same<typename allocator_type::value_type, std::pair<const Key, T> >::value));
-
-   //////////////////////////////////////////////
-   //
-   //          construct/copy/destroy
-   //
-   //////////////////////////////////////////////
-
-   //! <b>Effects</b>: Default constructs an empty multimap.
-   //!
-   //! <b>Complexity</b>: Constant.
-   BOOST_CONTAINER_FORCEINLINE multimap()
-      BOOST_NOEXCEPT_IF(dtl::is_nothrow_default_constructible<allocator_type>::value &&
-                        dtl::is_nothrow_default_constructible<Compare>::value)
-      : base_t()
-   {}
-
-   //! <b>Effects</b>: Constructs an empty multimap using the specified allocator
-   //!   object and allocator.
-   //!
-   //! <b>Complexity</b>: Constant.
-   BOOST_CONTAINER_FORCEINLINE explicit multimap(const allocator_type& a)
-      : base_t(a)
-   {}
-
-   //! <b>Effects</b>: Constructs an empty multimap using the specified comparison.
-   //!
-   //! <b>Complexity</b>: Constant.
-   BOOST_CONTAINER_FORCEINLINE explicit multimap(const Compare& comp)
-      : base_t(comp)
-   {}
-
-   //! <b>Effects</b>: Constructs an empty multimap using the specified comparison and allocator.
-   //!
-   //! <b>Complexity</b>: Constant.
-   BOOST_CONTAINER_FORCEINLINE multimap(const Compare& comp, const allocator_type& a)
-      : base_t(comp, a)
-   {}
-
-   //! <b>Effects</b>: Constructs an empty multimap and
-   //! inserts elements from the range [first ,last ).
-   //!
-   //! <b>Complexity</b>: Linear in N if the range [first ,last ) is already sorted using
-   //! the predicate and otherwise N logN, where N is last - first.
-   template <class InputIterator>
-   BOOST_CONTAINER_FORCEINLINE multimap(InputIterator first, InputIterator last)
-      : base_t(false, first, last)
-   {}
-
-   //! <b>Effects</b>: Constructs an empty multimap using the specified 
-   //! allocator, and inserts elements from the range [first ,last ).
-   //!
-   //! <b>Complexity</b>: Linear in N if the range [first ,last ) is already sorted using
-   //! the predicate and otherwise N logN, where N is last - first.
-   template <class InputIterator>
-   BOOST_CONTAINER_FORCEINLINE multimap(InputIterator first, InputIterator last, const allocator_type& a)
-      : base_t(false, first, last, Compare(), a)
-   {}
-
-   //! <b>Effects</b>: Constructs an empty multimap using the specified comparison object and
-   //! inserts elements from the range [first ,last ).
-   //!
-   //! <b>Complexity</b>: Linear in N if the range [first ,last ) is already sorted using
-   //! the predicate and otherwise N logN, where N is last - first.
-   template <class InputIterator>
-   BOOST_CONTAINER_FORCEINLINE multimap(InputIterator first, InputIterator last, const Compare& comp)
-      : base_t(false, first, last, comp)
-   {}
-
-   //! <b>Effects</b>: Constructs an empty multimap using the specified comparison object
-   //!   and allocator, and inserts elements from the range [first ,last ).
-   //!
-   //! <b>Complexity</b>: Linear in N if the range [first ,last ) is already sorted using
-   //! the predicate and otherwise N logN, where N is last - first.
-   template <class InputIterator>
-   BOOST_CONTAINER_FORCEINLINE multimap(InputIterator first, InputIterator last,
-            const Compare& comp, const allocator_type& a)
-      : base_t(false, first, last, comp, a)
-   {}
-
-   //! <b>Effects</b>: Constructs an empty multimap and
-   //! inserts elements from the ordered range [first ,last). This function
-   //! is more efficient than the normal range creation for ordered ranges.
-   //!
-   //! <b>Requires</b>: [first ,last) must be ordered according to the predicate.
-   //!
-   //! <b>Complexity</b>: Linear in N.
-   //!
-   //! <b>Note</b>: Non-standard extension.
-   template <class InputIterator>
-   BOOST_CONTAINER_FORCEINLINE multimap(ordered_range_t, InputIterator first, InputIterator last)
-      : base_t(ordered_range, first, last)
-   {}
-
-   //! <b>Effects</b>: Constructs an empty multimap using the specified comparison object and
-   //! inserts elements from the ordered range [first ,last). This function
-   //! is more efficient than the normal range creation for ordered ranges.
-   //!
-   //! <b>Requires</b>: [first ,last) must be ordered according to the predicate.
-   //!
-   //! <b>Complexity</b>: Linear in N.
-   //!
-   //! <b>Note</b>: Non-standard extension.
-   template <class InputIterator>
-   BOOST_CONTAINER_FORCEINLINE multimap(ordered_range_t, InputIterator first, InputIterator last, const Compare& comp)
-      : base_t(ordered_range, first, last, comp)
-   {}
-
-   //! <b>Effects</b>: Constructs an empty multimap using the specified comparison object and
-   //! allocator, and inserts elements from the ordered range [first ,last). This function
-   //! is more efficient than the normal range creation for ordered ranges.
-   //!
-   //! <b>Requires</b>: [first ,last) must be ordered according to the predicate.
-   //!
-   //! <b>Complexity</b>: Linear in N.
-   //!
-   //! <b>Note</b>: Non-standard extension.
-   template <class InputIterator>
-   BOOST_CONTAINER_FORCEINLINE multimap(ordered_range_t, InputIterator first, InputIterator last, const Compare& comp,
-         const allocator_type& a)
-      : base_t(ordered_range, first, last, comp, a)
-   {}
-
-   //! <b>Effects</b>: Constructs an empty multimap using the specified allocator and
-   //! inserts elements from the ordered range [first ,last). This function
-   //! is more efficient than the normal range creation for ordered ranges.
-   //!
-   //! <b>Requires</b>: [first ,last) must be ordered according to the predicate.
-   //!
-   //! <b>Complexity</b>: Linear in N.
-   //!
-   //! <b>Note</b>: Non-standard extension.
-   template <class InputIterator>
-   BOOST_CONTAINER_FORCEINLINE multimap(ordered_range_t, InputIterator first, InputIterator last, const allocator_type& a)
-      : base_t(ordered_range, first, last, Compare(), a)
-   {}
-
-#if !defined(BOOST_NO_CXX11_HDR_INITIALIZER_LIST)
-   //! <b>Effects</b>: Constructs an empty multimap and
-   //! and inserts elements from the range [il.begin(), il.end()).
-   //!
-   //! <b>Complexity</b>: Linear in N if the range [first ,last ) is already sorted using
-   //! the predicate and otherwise N logN, where N is il.first() - il.end().
-   BOOST_CONTAINER_FORCEINLINE multimap(std::initializer_list<value_type> il)
-      : base_t(false, il.begin(), il.end())
-   {}
-
-   //! <b>Effects</b>: Constructs an empty multimap using the specified
-   //! allocator, and inserts elements from the range [il.begin(), il.end()).
-   //!
-   //! <b>Complexity</b>: Linear in N if the range [first ,last ) is already sorted using
-   //! the predicate and otherwise N logN, where N is il.first() - il.end().
-   BOOST_CONTAINER_FORCEINLINE multimap(std::initializer_list<value_type> il, const allocator_type& a)
-      : base_t(false, il.begin(), il.end(), Compare(), a)
-   {}
-
-   //! <b>Effects</b>: Constructs an empty multimap using the specified comparison object and
-   //! inserts elements from the range [il.begin(), il.end()).
-   //!
-   //! <b>Complexity</b>: Linear in N if the range [first ,last ) is already sorted using
-   //! the predicate and otherwise N logN, where N is il.first() - il.end().
-   BOOST_CONTAINER_FORCEINLINE multimap(std::initializer_list<value_type> il, const Compare& comp)
-      : base_t(false, il.begin(), il.end(), comp)
-   {}
-
-   //! <b>Effects</b>: Constructs an empty multimap using the specified comparison object and
-   //! allocator, and inserts elements from the range [il.begin(), il.end()).
-   //!
-   //! <b>Complexity</b>: Linear in N if the range [first ,last ) is already sorted using
-   //! the predicate and otherwise N logN, where N is il.first() - il.end().
-   BOOST_CONTAINER_FORCEINLINE multimap(std::initializer_list<value_type> il, const Compare& comp, const allocator_type& a)
-      : base_t(false, il.begin(), il.end(), comp, a)
-   {}
-
-
-   //! <b>Effects</b>: Constructs an empty map and
-   //! inserts elements from the ordered range [il.begin(), il.end()). This function
-   //! is more efficient than the normal range creation for ordered ranges.
-   //!
-   //! <b>Requires</b>: [il.begin(), il.end()) must be ordered according to the predicate.
-   //!
-   //! <b>Complexity</b>: Linear in N.
-   //!
-   //! <b>Note</b>: Non-standard extension.
-   BOOST_CONTAINER_FORCEINLINE multimap(ordered_range_t, std::initializer_list<value_type> il)
-      : base_t(ordered_range, il.begin(), il.end())
-   {}
-
-   //! <b>Effects</b>: Constructs an empty map using the specified comparison object and
-   //! inserts elements from the ordered range [il.begin(), il.end()). This function
-   //! is more efficient than the normal range creation for ordered ranges.
-   //!
-   //! <b>Requires</b>: [il.begin(), il.end()) must be ordered according to the predicate.
-   //!
-   //! <b>Complexity</b>: Linear in N.
-   //!
-   //! <b>Note</b>: Non-standard extension.
-   BOOST_CONTAINER_FORCEINLINE multimap(ordered_range_t, std::initializer_list<value_type> il, const Compare& comp)
-      : base_t(ordered_range, il.begin(), il.end(), comp)
-   {}
-
-   //! <b>Effects</b>: Constructs an empty map and
-   //! inserts elements from the ordered range [il.begin(), il.end()). This function
-   //! is more efficient than the normal range creation for ordered ranges.
-   //!
-   //! <b>Requires</b>: [il.begin(), il.end()) must be ordered according to the predicate.
-   //!
-   //! <b>Complexity</b>: Linear in N.
-   //!
-   //! <b>Note</b>: Non-standard extension.
-   BOOST_CONTAINER_FORCEINLINE multimap(ordered_range_t, std::initializer_list<value_type> il, const Compare& comp, const allocator_type& a)
-      : base_t(ordered_range, il.begin(), il.end(), comp, a)
-   {}
-
-#endif
-
-   //! <b>Effects</b>: Copy constructs a multimap.
-   //!
-   //! <b>Complexity</b>: Linear in x.size().
-   BOOST_CONTAINER_FORCEINLINE multimap(const multimap& x)
-      : base_t(static_cast<const base_t&>(x))
-   {}
-
-   //! <b>Effects</b>: Move constructs a multimap. Constructs *this using x's resources.
-   //!
-   //! <b>Complexity</b>: Constant.
-   //!
-   //! <b>Postcondition</b>: x is emptied.
-   BOOST_CONTAINER_FORCEINLINE multimap(BOOST_RV_REF(multimap) x)
-      BOOST_NOEXCEPT_IF(boost::container::dtl::is_nothrow_move_constructible<Compare>::value)
-      : base_t(BOOST_MOVE_BASE(base_t, x))
-   {}
-
-   //! <b>Effects</b>: Copy constructs a multimap.
-   //!
-   //! <b>Complexity</b>: Linear in x.size().
-   BOOST_CONTAINER_FORCEINLINE multimap(const multimap& x, const allocator_type &a)
-      : base_t(static_cast<const base_t&>(x), a)
-   {}
-
-   //! <b>Effects</b>: Move constructs a multimap using the specified allocator.
-   //!                 Constructs *this using x's resources.
-   //! <b>Complexity</b>: Constant if a == x.get_allocator(), linear otherwise.
-   //!
-   //! <b>Postcondition</b>: x is emptied.
-   BOOST_CONTAINER_FORCEINLINE multimap(BOOST_RV_REF(multimap) x, const allocator_type &a)
-      : base_t(BOOST_MOVE_BASE(base_t, x), a)
-   {}
-
-   //! <b>Effects</b>: Makes *this a copy of x.
-   //!
-   //! <b>Complexity</b>: Linear in x.size().
-   BOOST_CONTAINER_FORCEINLINE multimap& operator=(BOOST_COPY_ASSIGN_REF(multimap) x)
-   {  return static_cast<multimap&>(this->base_t::operator=(static_cast<const base_t&>(x)));  }
-
-   //! <b>Effects</b>: this->swap(x.get()).
-   //!
-   //! <b>Complexity</b>: Constant.
-   BOOST_CONTAINER_FORCEINLINE multimap& operator=(BOOST_RV_REF(multimap) x)
-      BOOST_NOEXCEPT_IF( (allocator_traits_type::propagate_on_container_move_assignment::value ||
-                          allocator_traits_type::is_always_equal::value) &&
-                           boost::container::dtl::is_nothrow_move_assignable<Compare>::value)
-   {  return static_cast<multimap&>(this->base_t::operator=(BOOST_MOVE_BASE(base_t, x)));  }
-
-#if !defined(BOOST_NO_CXX11_HDR_INITIALIZER_LIST)
-   //! <b>Effects</b>: Assign content of il to *this.
-   //!
-   BOOST_CONTAINER_FORCEINLINE multimap& operator=(std::initializer_list<value_type> il)
-   {
-       this->clear();
-       insert(il.begin(), il.end());
-       return *this;
-   }
-#endif
-
-   #if defined(BOOST_CONTAINER_DOXYGEN_INVOKED)
-
-   //! @copydoc ::boost::container::set::get_allocator()
-   allocator_type get_allocator() const;
-
-   //! @copydoc ::boost::container::set::get_stored_allocator()
-   stored_allocator_type &get_stored_allocator();
-
-   //! @copydoc ::boost::container::set::get_stored_allocator() const
-   const stored_allocator_type &get_stored_allocator() const;
-
-   //! @copydoc ::boost::container::set::begin()
-   iterator begin();
-
-   //! @copydoc ::boost::container::set::begin() const
-   const_iterator begin() const;
-
-   //! @copydoc ::boost::container::set::cbegin() const
-   const_iterator cbegin() const;
-
-   //! @copydoc ::boost::container::set::end()
-   iterator end() BOOST_NOEXCEPT_OR_NOTHROW;
-
-   //! @copydoc ::boost::container::set::end() const
-   const_iterator end() const BOOST_NOEXCEPT_OR_NOTHROW;
-
-   //! @copydoc ::boost::container::set::cend() const
-   const_iterator cend() const BOOST_NOEXCEPT_OR_NOTHROW;
-
-   //! @copydoc ::boost::container::set::rbegin()
-   reverse_iterator rbegin() BOOST_NOEXCEPT_OR_NOTHROW;
-
-   //! @copydoc ::boost::container::set::rbegin() const
-   const_reverse_iterator rbegin() const BOOST_NOEXCEPT_OR_NOTHROW;
-
-   //! @copydoc ::boost::container::set::crbegin() const
-   const_reverse_iterator crbegin() const BOOST_NOEXCEPT_OR_NOTHROW;
-
-   //! @copydoc ::boost::container::set::rend()
-   reverse_iterator rend() BOOST_NOEXCEPT_OR_NOTHROW;
-
-   //! @copydoc ::boost::container::set::rend() const
-   const_reverse_iterator rend() const BOOST_NOEXCEPT_OR_NOTHROW;
-
-   //! @copydoc ::boost::container::set::crend() const
-   const_reverse_iterator crend() const BOOST_NOEXCEPT_OR_NOTHROW;
-
-   //! @copydoc ::boost::container::set::empty() const
-   bool empty() const;
-
-   //! @copydoc ::boost::container::set::size() const
-   size_type size() const;
-
-   //! @copydoc ::boost::container::set::max_size() const
-   size_type max_size() const;
-
-   #endif   //#if defined(BOOST_CONTAINER_DOXYGEN_INVOKED)
-
-   #if !defined(BOOST_NO_CXX11_VARIADIC_TEMPLATES) || defined(BOOST_CONTAINER_DOXYGEN_INVOKED)
-
-   //! <b>Effects</b>: Inserts an object of type T constructed with
-   //!   std::forward<Args>(args)... in the container.
-   //!   p is a hint pointing to where the insert should start to search.
-   //!
-   //! <b>Returns</b>: An iterator pointing to the element with key equivalent
-   //!   to the key of x.
-   //!
-   //! <b>Complexity</b>: Logarithmic in general, but amortized constant if t
-   //!   is inserted right before p.
-   template <class... Args>
-   BOOST_CONTAINER_FORCEINLINE iterator emplace(BOOST_FWD_REF(Args)... args)
-   {  return this->base_t::emplace_equal(boost::forward<Args>(args)...); }
-
-   //! <b>Effects</b>: Inserts an object of type T constructed with
-   //!   std::forward<Args>(args)... in the container.
-   //!   p is a hint pointing to where the insert should start to search.
-   //!
-   //! <b>Returns</b>: An iterator pointing to the element with key equivalent
-   //!   to the key of x.
-   //!
-   //! <b>Complexity</b>: Logarithmic in general, but amortized constant if t
-   //!   is inserted right before p.
-   template <class... Args>
-   BOOST_CONTAINER_FORCEINLINE iterator emplace_hint(const_iterator p, BOOST_FWD_REF(Args)... args)
-   {  return this->base_t::emplace_hint_equal(p, boost::forward<Args>(args)...); }
-
-   #else // !defined(BOOST_NO_CXX11_VARIADIC_TEMPLATES)
-
-   #define BOOST_CONTAINER_MULTIMAP_EMPLACE_CODE(N) \
-   BOOST_MOVE_TMPL_LT##N BOOST_MOVE_CLASS##N BOOST_MOVE_GT##N \
-   BOOST_CONTAINER_FORCEINLINE iterator emplace(BOOST_MOVE_UREF##N)\
-   {  return this->base_t::emplace_equal(BOOST_MOVE_FWD##N);   }\
-   \
-   BOOST_MOVE_TMPL_LT##N BOOST_MOVE_CLASS##N BOOST_MOVE_GT##N \
-   BOOST_CONTAINER_FORCEINLINE iterator emplace_hint(const_iterator hint BOOST_MOVE_I##N BOOST_MOVE_UREF##N)\
-   {  return this->base_t::emplace_hint_equal(hint BOOST_MOVE_I##N BOOST_MOVE_FWD##N);  }\
-   //
-   BOOST_MOVE_ITERATE_0TO9(BOOST_CONTAINER_MULTIMAP_EMPLACE_CODE)
-   #undef BOOST_CONTAINER_MULTIMAP_EMPLACE_CODE
-
-   #endif   // !defined(BOOST_NO_CXX11_VARIADIC_TEMPLATES)
-
-   //! <b>Effects</b>: Inserts x and returns the iterator pointing to the
-   //!   newly inserted element.
-   //!
-   //! <b>Complexity</b>: Logarithmic.
-   BOOST_CONTAINER_FORCEINLINE iterator insert(const value_type& x)
-   { return this->base_t::insert_equal_convertible(x); }
-
-   //! <b>Effects</b>: Inserts a new value move-constructed from x and returns
-   //!   the iterator pointing to the newly inserted element.
-   //!
-   //! <b>Complexity</b>: Logarithmic.
-   BOOST_CONTAINER_FORCEINLINE iterator insert(BOOST_RV_REF(value_type) x)
-   { return this->base_t::insert_equal_convertible(boost::move(x)); }
-
-   //! <b>Effects</b>: Inserts a new value constructed from x and returns
-   //!   the iterator pointing to the newly inserted element.
-   //!
-   //! <b>Complexity</b>: Logarithmic.
-   template<class Pair>
-   BOOST_CONTAINER_FORCEINLINE BOOST_CONTAINER_DOC1ST
-         ( iterator
-         , typename dtl::enable_if_c<
-            dtl::is_convertible<Pair BOOST_MOVE_I value_type>::value  ||
-            dtl::is_convertible<Pair BOOST_MOVE_I movable_value_type>::value
-            BOOST_MOVE_I iterator >::type)
-      insert(BOOST_FWD_REF(Pair) x)
-   { return this->base_t::emplace_equal(boost::forward<Pair>(x)); }
-
-   //! <b>Effects</b>: Inserts a copy of x in the container.
-   //!   p is a hint pointing to where the insert should start to search.
-   //!
-   //! <b>Returns</b>: An iterator pointing to the element with key equivalent
-   //!   to the key of x.
-   //!
-   //! <b>Complexity</b>: Logarithmic in general, but amortized constant if t
-   //!   is inserted right before p.
-   BOOST_CONTAINER_FORCEINLINE iterator insert(const_iterator p, const value_type& x)
-   { return this->base_t::insert_equal_hint_convertible(p, x); }
-
-   //! <b>Effects</b>: Inserts a new value move constructed from x in the container.
-   //!   p is a hint pointing to where the insert should start to search.
-   //!
-   //! <b>Returns</b>: An iterator pointing to the element with key equivalent
-   //!   to the key of x.
-   //!
-   //! <b>Complexity</b>: Logarithmic in general, but amortized constant if t
-   //!   is inserted right before p.
-   BOOST_CONTAINER_FORCEINLINE iterator insert(const_iterator p, BOOST_RV_REF(movable_value_type) x)
-   { return this->base_t::insert_equal_hint_convertible(p, boost::move(x)); }
-
-   //! <b>Effects</b>: Inserts a new value constructed from x in the container.
-   //!   p is a hint pointing to where the insert should start to search.
-   //!
-   //! <b>Returns</b>: An iterator pointing to the element with key equivalent
-   //!   to the key of x.
-   //!
-   //! <b>Complexity</b>: Logarithmic in general, but amortized constant if t
-   //!   is inserted right before p.
-   template<class Pair>
-   BOOST_CONTAINER_FORCEINLINE BOOST_CONTAINER_DOC1ST
-         ( iterator
-         , typename dtl::enable_if_c<
-            dtl::is_convertible<Pair BOOST_MOVE_I value_type>::value  ||
-            dtl::is_convertible<Pair BOOST_MOVE_I movable_value_type>::value
-            BOOST_MOVE_I iterator>::type)
-      insert(const_iterator p, BOOST_FWD_REF(Pair) x)
-   { return this->base_t::emplace_hint_equal(p, boost::forward<Pair>(x)); }
-
-   //! <b>Requires</b>: first, last are not iterators into *this.
-   //!
-   //! <b>Effects</b>: inserts each element from the range [first,last) .
-   //!
-   //! <b>Complexity</b>: At most N log(size()+N) (N is the distance from first to last)
-   template <class InputIterator>
-   BOOST_CONTAINER_FORCEINLINE void insert(InputIterator first, InputIterator last)
-   {  this->base_t::insert_equal_range(first, last); }
-
-#if !defined(BOOST_NO_CXX11_HDR_INITIALIZER_LIST)
-   //! <b>Effects</b>: inserts each element from the range [il.begin(), il.end().
-   //!
-   //! <b>Complexity</b>: At most N log(size()+N) (N is the distance from il.begin() to il.end())
-   BOOST_CONTAINER_FORCEINLINE void insert(std::initializer_list<value_type> il)
-   {  this->base_t::insert_equal_range(il.begin(), il.end()); }
-#endif
-
-   //! <b>Requires</b>: nh is empty or this->get_allocator() == nh.get_allocator().
-   //!
-   //! <b>Effects/Returns</b>: If nh is empty, has no effect and returns end(). Otherwise, inserts 
-   //!   the element owned by nh and returns an iterator pointing to the newly inserted element.
-   //!   If a range containing elements with keys equivalent to nh.key() exists, 
-   //!   the element is inserted at the end of that range. nh is always emptied.
-   //!
-   //! <b>Complexity</b>: Logarithmic
-   iterator insert(BOOST_RV_REF_BEG_IF_CXX11 node_type BOOST_RV_REF_END_IF_CXX11 nh)
-   {
-      typename base_t::node_type n(boost::move(nh));
-      return this->base_t::insert_equal_node(boost::move(n));
-   }
-
-   //! <b>Effects</b>: Same as `insert(node_type && nh)` but the element is inserted as close as possible
-   //!   to the position just prior to "hint".
-   //!
-   //! <b>Complexity</b>: logarithmic in general, but amortized constant if the element is inserted
-   //!   right before "hint".
-   iterator insert(const_iterator hint, BOOST_RV_REF_BEG_IF_CXX11 node_type BOOST_RV_REF_END_IF_CXX11 nh)
-   {
-      typename base_t::node_type n(boost::move(nh));
-      return this->base_t::insert_equal_node(hint, boost::move(n));
-   }
-
-   #if defined(BOOST_CONTAINER_DOXYGEN_INVOKED)
-
-   //! @copydoc ::boost::container::set::erase(const_iterator)
-   iterator erase(const_iterator p);
-
-   //! @copydoc ::boost::container::set::erase(const key_type&)
-   size_type erase(const key_type& x);
-
-   //! @copydoc ::boost::container::set::erase(const_iterator,const_iterator)
-   iterator erase(const_iterator first, const_iterator last);
-   #endif
-
-   //! @copydoc ::boost::container::map::extract(const key_type&)
-   node_type extract(const key_type& k)
-   {
-      typename base_t::node_type base_nh(this->base_t::extract(k));
-      return node_type(boost::move(base_nh));
-   }
-
-   //! @copydoc ::boost::container::map::extract(const_iterator)
-   node_type extract(const_iterator position)
-   {
-      typename base_t::node_type base_nh(this->base_t::extract(position));
-      return node_type (boost::move(base_nh));
-   }
-
-   //! <b>Requires</b>: this->get_allocator() == source.get_allocator().
-   //!
-   //! <b>Effects</b>: Extracts each element in source and insert it into a using
-   //!   the comparison object of *this.
-   //! 
-   //! <b>Postcondition</b>: Pointers and references to the transferred elements of source refer
-   //!   to those same elements but as members of *this. Iterators referring to the transferred
-   //!   elements will continue to refer to their elements, but they now behave as iterators into *this,
-   //!   not into source.
-   //!
-   //! <b>Throws</b>: Nothing unless the comparison object throws.
-   //!
-   //! <b>Complexity</b>: N log(size() + N) (N has the value source.size())
-   template<class C2>
-   BOOST_CONTAINER_FORCEINLINE void merge(multimap<Key, T, C2, Allocator, Options>& source)
-   {
-      typedef dtl::tree
-         <value_type_impl, select_1st_t, C2, Allocator, Options> base2_t;
-      this->base_t::merge_equal(static_cast<base2_t&>(source));
-   }
-
-   //! @copydoc ::boost::container::multimap::merge(multimap<Key, T, C2, Allocator, Options>&)
-   template<class C2>
-   BOOST_CONTAINER_FORCEINLINE void merge(BOOST_RV_REF_BEG multimap<Key, T, C2, Allocator, Options> BOOST_RV_REF_END source)
-   {  return this->merge(static_cast<multimap<Key, T, C2, Allocator, Options>&>(source)); }
-
-   //! @copydoc ::boost::container::multimap::merge(multimap<Key, T, C2, Allocator, Options>&)
-   template<class C2>
-   BOOST_CONTAINER_FORCEINLINE void merge(map<Key, T, C2, Allocator, Options>& source)
-   {
-      typedef dtl::tree
-         <value_type_impl, select_1st_t, C2, Allocator, Options> base2_t;
-      this->base_t::merge_equal(static_cast<base2_t&>(source));
-   }
-
-   //! @copydoc ::boost::container::multimap::merge(multimap<Key, T, C2, Allocator, Options>&)
-   template<class C2>
-   BOOST_CONTAINER_FORCEINLINE void merge(BOOST_RV_REF_BEG map<Key, T, C2, Allocator, Options> BOOST_RV_REF_END source)
-   {  return this->merge(static_cast<map<Key, T, C2, Allocator, Options>&>(source)); }
-
-   #if defined(BOOST_CONTAINER_DOXYGEN_INVOKED)
-   //! @copydoc ::boost::container::set::swap
-   void swap(multiset& x)
-      BOOST_NOEXCEPT_IF(  allocator_traits_type::is_always_equal::value
-                                 && boost::container::dtl::is_nothrow_swappable<Compare>::value );
-
-   //! @copydoc ::boost::container::set::clear
-   void clear() BOOST_NOEXCEPT_OR_NOTHROW;
-
-   //! @copydoc ::boost::container::set::key_comp
-   key_compare key_comp() const;
-
-   //! @copydoc ::boost::container::set::value_comp
-   value_compare value_comp() const;
-
-   //! <b>Returns</b>: An iterator pointing to an element with the key
-   //!   equivalent to x, or end() if such an element is not found.
-   //!
-   //! <b>Complexity</b>: Logarithmic.
-   iterator find(const key_type& x);
-
-   //! <b>Returns</b>: A const iterator pointing to an element with the key
-   //!   equivalent to x, or end() if such an element is not found.
-   //!
-   //! <b>Complexity</b>: Logarithmic.
-   const_iterator find(const key_type& x) const;
-
-   //! <b>Requires</b>: This overload is available only if
-   //! key_compare::is_transparent exists.
-   //!
-   //! <b>Returns</b>: An iterator pointing to an element with the key
-   //!   equivalent to x, or end() if such an element is not found.
-   //!
-   //! <b>Complexity</b>: Logarithmic.
-   template<typename K>
-   iterator find(const K& x);
-
-   //! <b>Requires</b>: This overload is available only if
-   //! key_compare::is_transparent exists.
-   //!
-   //! <b>Returns</b>: A const_iterator pointing to an element with the key
-   //!   equivalent to x, or end() if such an element is not found.
-   //!
-   //! <b>Complexity</b>: Logarithmic.
-   template<typename K>
-   const_iterator find(const K& x) const;
-
-   //! <b>Returns</b>: The number of elements with key equivalent to x.
-   //!
-   //! <b>Complexity</b>: log(size())+count(k)
-   size_type count(const key_type& x) const;
-
-   //! <b>Requires</b>: This overload is available only if
-   //! key_compare::is_transparent exists.
-   //!
-   //! <b>Returns</b>: The number of elements with key equivalent to x.
-   //!
-   //! <b>Complexity</b>: log(size())+count(k)
-   template<typename K>
-   size_type count(const K& x) const;
-
-   //! <b>Returns</b>: Returns true if there is an element with key
-   //!   equivalent to key in the container, otherwise false.
-   //!
-   //! <b>Complexity</b>: log(size()).
-   bool contains(const key_type& x) const;
-
-   //! <b>Requires</b>: This overload is available only if
-   //! key_compare::is_transparent exists.
-   //!
-   //! <b>Returns</b>: Returns true if there is an element with key
-   //!   equivalent to key in the container, otherwise false.
-   //!
-   //! <b>Complexity</b>: log(size()).
-   template<typename K>
-   bool contains(const K& x) const;
-
-   //! <b>Returns</b>: An iterator pointing to the first element with key not less
-   //!   than x, or end() if such an element is not found.
-   //!
-   //! <b>Complexity</b>: Logarithmic
-   iterator lower_bound(const key_type& x);
-
-   //! <b>Returns</b>: A const iterator pointing to the first element with key not
-   //!   less than x, or end() if such an element is not found.
-   //!
-   //! <b>Complexity</b>: Logarithmic
-   const_iterator lower_bound(const key_type& x) const;
-
-   //! <b>Requires</b>: This overload is available only if
-   //! key_compare::is_transparent exists.
-   //!
-   //! <b>Returns</b>: An iterator pointing to the first element with key not less
-   //!   than x, or end() if such an element is not found.
-   //!
-   //! <b>Complexity</b>: Logarithmic
-   template<typename K>
-   iterator lower_bound(const K& x);
-
-   //! <b>Requires</b>: This overload is available only if
-   //! key_compare::is_transparent exists.
-   //!
-   //! <b>Returns</b>: A const iterator pointing to the first element with key not
-   //!   less than x, or end() if such an element is not found.
-   //!
-   //! <b>Complexity</b>: Logarithmic
-   template<typename K>
-   const_iterator lower_bound(const K& x) const;
-
-   //! <b>Returns</b>: An iterator pointing to the first element with key greater
-   //!   than x, or end() if such an element is not found.
-   //!
-   //! <b>Complexity</b>: Logarithmic
-   iterator upper_bound(const key_type& x);
-
-   //! <b>Returns</b>: A const iterator pointing to the first element with key
-   //!   greater than x, or end() if such an element is not found.
-   //!
-   //! <b>Complexity</b>: Logarithmic
-   const_iterator upper_bound(const key_type& x) const;
-
-   //! <b>Requires</b>: This overload is available only if
-   //! key_compare::is_transparent exists.
-   //!
-   //! <b>Returns</b>: An iterator pointing to the first element with key greater
-   //!   than x, or end() if such an element is not found.
-   //!
-   //! <b>Complexity</b>: Logarithmic
-   template<typename K>
-   iterator upper_bound(const K& x);
-
-   //! <b>Requires</b>: This overload is available only if
-   //! key_compare::is_transparent exists.
-   //!
-   //! <b>Returns</b>: A const iterator pointing to the first element with key
-   //!   greater than x, or end() if such an element is not found.
-   //!
-   //! <b>Complexity</b>: Logarithmic
-   template<typename K>
-   const_iterator upper_bound(const K& x) const;
-
-   //! <b>Effects</b>: Equivalent to std::make_pair(this->lower_bound(k), this->upper_bound(k)).
-   //!
-   //! <b>Complexity</b>: Logarithmic
-   std::pair<iterator,iterator> equal_range(const key_type& x);
-
-   //! <b>Effects</b>: Equivalent to std::make_pair(this->lower_bound(k), this->upper_bound(k)).
-   //!
-   //! <b>Complexity</b>: Logarithmic
-   std::pair<const_iterator,const_iterator> equal_range(const key_type& x) const;
-
-   //! <b>Requires</b>: This overload is available only if
-   //! key_compare::is_transparent exists.
-   //!
-   //! <b>Effects</b>: Equivalent to std::make_pair(this->lower_bound(k), this->upper_bound(k)).
-   //!
-   //! <b>Complexity</b>: Logarithmic
-   template<typename K>
-   std::pair<iterator,iterator> equal_range(const K& x);
-
-   //! <b>Requires</b>: This overload is available only if
-   //! key_compare::is_transparent exists.
-   //!
-   //! <b>Effects</b>: Equivalent to std::make_pair(this->lower_bound(k), this->upper_bound(k)).
-   //!
-   //! <b>Complexity</b>: Logarithmic
-   template<typename K>
-   std::pair<const_iterator,const_iterator> equal_range(const K& x) const;
-
-   //! <b>Effects</b>: Rebalances the tree. It's a no-op for Red-Black and AVL trees.
-   //!
-   //! <b>Complexity</b>: Linear
-   void rebalance();
-
-   //! <b>Effects</b>: Returns true if x and y are equal
-   //!
-   //! <b>Complexity</b>: Linear to the number of elements in the container.
-   friend bool operator==(const multimap& x, const multimap& y);
-
-   //! <b>Effects</b>: Returns true if x and y are unequal
-   //!
-   //! <b>Complexity</b>: Linear to the number of elements in the container.
-   friend bool operator!=(const multimap& x, const multimap& y);
-
-   //! <b>Effects</b>: Returns true if x is less than y
-   //!
-   //! <b>Complexity</b>: Linear to the number of elements in the container.
-   friend bool operator<(const multimap& x, const multimap& y);
-
-   //! <b>Effects</b>: Returns true if x is greater than y
-   //!
-   //! <b>Complexity</b>: Linear to the number of elements in the container.
-   friend bool operator>(const multimap& x, const multimap& y);
-
-   //! <b>Effects</b>: Returns true if x is equal or less than y
-   //!
-   //! <b>Complexity</b>: Linear to the number of elements in the container.
-   friend bool operator<=(const multimap& x, const multimap& y);
-
-   //! <b>Effects</b>: Returns true if x is equal or greater than y
-   //!
-   //! <b>Complexity</b>: Linear to the number of elements in the container.
-   friend bool operator>=(const multimap& x, const multimap& y);
-
-   //! <b>Effects</b>: x.swap(y)
-   //!
-   //! <b>Complexity</b>: Constant.
-   friend void swap(multimap& x, multimap& y)
-      BOOST_NOEXCEPT_IF(  allocator_traits_type::is_always_equal::value
-                                 && boost::container::dtl::is_nothrow_swappable<Compare>::value );
-
-   #endif   //#if defined(BOOST_CONTAINER_DOXYGEN_INVOKED)
-};
-
-#ifndef BOOST_CONTAINER_NO_CXX17_CTAD
-
-template <typename InputIterator>
-multimap(InputIterator, InputIterator) ->
-   multimap< it_based_non_const_first_type_t<InputIterator>
-           , it_based_second_type_t<InputIterator>>;
-
-template < typename InputIterator, typename AllocatorOrCompare>
-multimap(InputIterator, InputIterator, AllocatorOrCompare const&) ->
-   multimap< it_based_non_const_first_type_t<InputIterator>
-                , it_based_second_type_t<InputIterator>
-                , typename dtl::if_c<   // Compare
-                    dtl::is_allocator<AllocatorOrCompare>::value
-                    , std::less<it_based_non_const_first_type_t<InputIterator>>
-                    , AllocatorOrCompare
-                    >::type
-                , typename dtl::if_c<   // Allocator
-                    dtl::is_allocator<AllocatorOrCompare>::value
-                    , AllocatorOrCompare
-                    , new_allocator<std::pair<it_based_const_first_type_t<InputIterator>, it_based_second_type_t<InputIterator>>>
-                    >::type
-                >;
-
-template < typename InputIterator, typename Compare, typename Allocator
-         , typename = dtl::require_nonallocator_t<Compare>
-         , typename = dtl::require_allocator_t<Allocator>>
-multimap(InputIterator, InputIterator, Compare const&, Allocator const&) ->
-   multimap< it_based_non_const_first_type_t<InputIterator>
-           , it_based_second_type_t<InputIterator>
-           , Compare
-           , Allocator>;
-
-template <typename InputIterator>
-multimap(ordered_range_t, InputIterator, InputIterator) ->
-   multimap< it_based_non_const_first_type_t<InputIterator>
-           , it_based_second_type_t<InputIterator>>;
-
-template < typename InputIterator, typename AllocatorOrCompare>
-multimap(ordered_range_t, InputIterator, InputIterator, AllocatorOrCompare const&) ->
-   multimap< it_based_non_const_first_type_t<InputIterator>
-                , it_based_second_type_t<InputIterator>
-                , typename dtl::if_c<   // Compare
-                    dtl::is_allocator<AllocatorOrCompare>::value
-                    , std::less<it_based_const_first_type_t<InputIterator>>
-                    , AllocatorOrCompare
-                    >::type
-                , typename dtl::if_c<   // Allocator
-                    dtl::is_allocator<AllocatorOrCompare>::value
-                    , AllocatorOrCompare
-                    , new_allocator<std::pair<it_based_const_first_type_t<InputIterator>, it_based_second_type_t<InputIterator>>>
-                    >::type
-                >;
-
-template < typename InputIterator, typename Compare, typename Allocator
-         , typename = dtl::require_nonallocator_t<Compare>
-         , typename = dtl::require_allocator_t<Allocator>>
-multimap(ordered_range_t, InputIterator, InputIterator, Compare const&, Allocator const&) ->
-   multimap< it_based_non_const_first_type_t<InputIterator>
-           , it_based_second_type_t<InputIterator>
-           , Compare
-           , Allocator>;
-#endif
-
-#ifndef BOOST_CONTAINER_DOXYGEN_INVOKED
-
-}  //namespace container {
-
-//!has_trivial_destructor_after_move<> == true_type
-//!specialization for optimizations
-template <class Key, class T, class Compare, class Allocator, class Options>
-struct has_trivial_destructor_after_move<boost::container::multimap<Key, T, Compare, Allocator, Options> >
-{
-   typedef ::boost::container::dtl::tree<std::pair<const Key, T>, int, Compare, Allocator, Options> tree;
-   static const bool value = ::boost::has_trivial_destructor_after_move<tree>::value;
-};
-
-namespace container {
-
-#endif   //#ifndef BOOST_CONTAINER_DOXYGEN_INVOKED
-
-}}
-
-#include <boost/container/detail/config_end.hpp>
-
-#endif   // BOOST_CONTAINER_MAP_HPP
-
diff --git a/src/boost/container/new_allocator.hpp b/src/boost/container/new_allocator.hpp
deleted file mode 100644
index 82c42a95..00000000
--- a/src/boost/container/new_allocator.hpp
+++ /dev/null
@@ -1,201 +0,0 @@
-//////////////////////////////////////////////////////////////////////////////
-//
-// (C) Copyright Ion Gaztanaga 2014-2015. Distributed under the Boost
-// 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.
-//
-//////////////////////////////////////////////////////////////////////////////
-
-#ifndef BOOST_CONTAINER_NEW_ALLOCATOR_HPP
-#define BOOST_CONTAINER_NEW_ALLOCATOR_HPP
-
-#ifndef BOOST_CONFIG_HPP
-#  include <boost/config.hpp>
-#endif
-
-#if defined(BOOST_HAS_PRAGMA_ONCE)
-#  pragma once
-#endif
-
-#include <boost/container/detail/config_begin.hpp>
-#include <boost/container/detail/workaround.hpp>
-#include <boost/container/throw_exception.hpp>
-#include <cstddef>
-
-//!\file
-
-namespace boost {
-namespace container {
-
-/// @cond
-
-template<bool Value>
-struct new_allocator_bool
-{  static const bool value = Value;  };
-
-template<class T>
-class new_allocator;
-
-/// @endcond
-
-//! Specialization of new_allocator for void types
-template<>
-class new_allocator<void>
-{
-   public:
-   typedef void                                 value_type;
-   typedef void *                               pointer;
-   typedef const void*                          const_pointer;
-   //!A integral constant of type bool with value true
-   typedef BOOST_CONTAINER_IMPDEF(new_allocator_bool<true>) propagate_on_container_move_assignment;
-   //!A integral constant of type bool with value true
-   typedef BOOST_CONTAINER_IMPDEF(new_allocator_bool<true>) is_always_equal;
-   // reference-to-void members are impossible
-
-   //!Obtains an new_allocator that allocates
-   //!objects of type T2
-   template<class T2>
-   struct rebind
-   {
-      typedef new_allocator< T2> other;
-   };
-
-   //!Default constructor
-   //!Never throws
-   new_allocator() BOOST_NOEXCEPT_OR_NOTHROW
-   {}
-
-   //!Constructor from other new_allocator.
-   //!Never throws
-   new_allocator(const new_allocator &) BOOST_NOEXCEPT_OR_NOTHROW
-   {}
-
-   //!Copy assignment operator from other new_allocator.
-   //!Never throws
-   new_allocator& operator=(const new_allocator &) BOOST_NOEXCEPT_OR_NOTHROW
-   {
-       return *this;
-   }
-
-   //!Constructor from related new_allocator.
-   //!Never throws
-   template<class T2>
-   new_allocator(const new_allocator<T2> &) BOOST_NOEXCEPT_OR_NOTHROW
-   {}
-
-   //!Swaps two allocators, does nothing
-   //!because this new_allocator is stateless
-   friend void swap(new_allocator &, new_allocator &) BOOST_NOEXCEPT_OR_NOTHROW
-   {}
-
-   //!An new_allocator always compares to true, as memory allocated with one
-   //!instance can be deallocated by another instance
-   friend bool operator==(const new_allocator &, const new_allocator &) BOOST_NOEXCEPT_OR_NOTHROW
-   {  return true;   }
-
-   //!An new_allocator always compares to false, as memory allocated with one
-   //!instance can be deallocated by another instance
-   friend bool operator!=(const new_allocator &, const new_allocator &) BOOST_NOEXCEPT_OR_NOTHROW
-   {  return false;   }
-};
-
-
-//! This class is a reduced STL-compatible allocator that allocates memory using operator new
-template<class T>
-class new_allocator
-{
-   public:
-   typedef T                                    value_type;
-   typedef T *                                  pointer;
-   typedef const T *                            const_pointer;
-   typedef T &                                  reference;
-   typedef const T &                            const_reference;
-   typedef std::size_t                          size_type;
-   typedef std::ptrdiff_t                       difference_type;
-   //!A integral constant of type bool with value true
-   typedef BOOST_CONTAINER_IMPDEF(new_allocator_bool<true>) propagate_on_container_move_assignment;
-   //!A integral constant of type bool with value true
-   typedef BOOST_CONTAINER_IMPDEF(new_allocator_bool<true>) is_always_equal;
-
-   //!Obtains an new_allocator that allocates
-   //!objects of type T2
-   template<class T2>
-   struct rebind
-   {
-      typedef new_allocator<T2> other;
-   };
-
-   //!Default constructor
-   //!Never throws
-   new_allocator() BOOST_NOEXCEPT_OR_NOTHROW
-   {}
-
-   //!Constructor from other new_allocator.
-   //!Never throws
-   new_allocator(const new_allocator &) BOOST_NOEXCEPT_OR_NOTHROW
-   {}
-
-   //!Copy assignment operator from other new_allocator.
-   //!Never throws
-   new_allocator& operator=(const new_allocator &) BOOST_NOEXCEPT_OR_NOTHROW
-   {
-       return *this;
-   }
-
-   //!Constructor from related new_allocator.
-   //!Never throws
-   template<class T2>
-   new_allocator(const new_allocator<T2> &) BOOST_NOEXCEPT_OR_NOTHROW
-   {}
-
-   //!Allocates memory for an array of count elements.
-   //!Throws bad_alloc if there is no enough memory
-   pointer allocate(size_type count)
-   {
-      const std::size_t max_count = std::size_t(-1)/(2*sizeof(T));
-      if(BOOST_UNLIKELY(count > max_count))
-         throw_bad_alloc();
-      return static_cast<T*>(::operator new(count*sizeof(T)));
-   }
-
-   //!Deallocates previously allocated memory.
-   //!Never throws
-   void deallocate(pointer ptr, size_type n) BOOST_NOEXCEPT_OR_NOTHROW
-   {
-      (void)n;
-      # if __cpp_sized_deallocation
-      ::operator delete((void*)ptr, n * sizeof(T));
-      #else
-      ::operator delete((void*)ptr);
-      # endif
-   }
-
-   //!Returns the maximum number of elements that could be allocated.
-   //!Never throws
-   size_type max_size() const BOOST_NOEXCEPT_OR_NOTHROW
-   {  return std::size_t(-1)/(2*sizeof(T));   }
-
-   //!Swaps two allocators, does nothing
-   //!because this new_allocator is stateless
-   friend void swap(new_allocator &, new_allocator &) BOOST_NOEXCEPT_OR_NOTHROW
-   {}
-
-   //!An new_allocator always compares to true, as memory allocated with one
-   //!instance can be deallocated by another instance
-   friend bool operator==(const new_allocator &, const new_allocator &) BOOST_NOEXCEPT_OR_NOTHROW
-   {  return true;   }
-
-   //!An new_allocator always compares to false, as memory allocated with one
-   //!instance can be deallocated by another instance
-   friend bool operator!=(const new_allocator &, const new_allocator &) BOOST_NOEXCEPT_OR_NOTHROW
-   {  return false;   }
-};
-
-}  //namespace container {
-}  //namespace boost {
-
-#include <boost/container/detail/config_end.hpp>
-
-#endif   //BOOST_CONTAINER_NEW_ALLOCATOR_HPP
diff --git a/src/boost/container/node_handle.hpp b/src/boost/container/node_handle.hpp
deleted file mode 100644
index 323b79c3..00000000
--- a/src/boost/container/node_handle.hpp
+++ /dev/null
@@ -1,445 +0,0 @@
-//////////////////////////////////////////////////////////////////////////////
-//
-// (C) Copyright Ion Gaztanaga 2016-2016. Distributed under the Boost
-// 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.
-//
-//////////////////////////////////////////////////////////////////////////////
-
-#ifndef BOOST_CONTAINER_NODE_HANDLE_HPP
-#define BOOST_CONTAINER_NODE_HANDLE_HPP
-
-#ifndef BOOST_CONFIG_HPP
-#  include <boost/config.hpp>
-#endif
-
-#if defined(BOOST_HAS_PRAGMA_ONCE)
-#  pragma once
-#endif
-
-#include <boost/container/detail/config_begin.hpp>
-#include <boost/container/detail/workaround.hpp>
-#include <boost/static_assert.hpp>
-#include <boost/container/detail/placement_new.hpp>
-#include <boost/move/detail/to_raw_pointer.hpp>
-#include <boost/container/allocator_traits.hpp>
-#include <boost/container/detail/mpl.hpp>
-
-#include <boost/move/utility_core.hpp>
-#include <boost/move/adl_move_swap.hpp>
-
-#include <boost/container/detail/mpl.hpp>
-#include <boost/assert.hpp>
-
-
-//!\file
-
-namespace boost {
-namespace container {
-
-///@cond
-
-template<class Value, class KeyMapped>
-struct node_handle_keymapped_traits
-{
-   typedef typename KeyMapped::key_type      key_type;
-   typedef typename KeyMapped::mapped_type   mapped_type;
-};
-
-template<class Value>
-struct node_handle_keymapped_traits<Value, void>
-{
-   typedef Value key_type;
-   typedef Value mapped_type;
-};
-
-class node_handle_friend
-{
-   public:
-
-   template<class NH>
-   BOOST_CONTAINER_FORCEINLINE static void destroy_alloc(NH &nh) BOOST_NOEXCEPT
-   {  nh.destroy_alloc();  }
-
-   template<class NH>
-   BOOST_CONTAINER_FORCEINLINE static typename NH::node_pointer &get_node_pointer(NH &nh) BOOST_NOEXCEPT
-   {  return nh.get_node_pointer();  }
-};
-
-
-///@endcond
-
-//! A node_handle is an object that accepts ownership of a single element from an associative container.
-//! It may be used to transfer that ownership to another container with compatible nodes. Containers
-//! with compatible nodes have the same node handle type. Elements may be transferred in either direction
-//! between container types in the same row:.
-//!
-//! Container types with compatible nodes
-//!
-//! map<K, T, C1, A> <-> map<K, T, C2, A>
-//!
-//! map<K, T, C1, A> <-> multimap<K, T, C2, A>
-//! 
-//! set<K, C1, A> <-> set<K, C2, A>
-//! 
-//! set<K, C1, A> <-> multiset<K, C2, A>
-//! 
-//! If a node handle is not empty, then it contains an allocator that is equal to the allocator of the container
-//! when the element was extracted. If a node handle is empty, it contains no allocator.
-template <class NodeAllocator, class KeyMapped = void>
-class node_handle
-{
-   typedef NodeAllocator                                          nallocator_type;
-   typedef allocator_traits<NodeAllocator>                        nator_traits;
-   typedef typename nator_traits::value_type                      priv_node_t;
-   typedef typename priv_node_t::value_type                       priv_value_t;
-   typedef node_handle_keymapped_traits<priv_value_t, KeyMapped>  keymapped_t;
-
-   public:
-   typedef priv_value_t                                           value_type;
-   typedef typename keymapped_t::key_type                         key_type;
-   typedef typename keymapped_t::mapped_type                      mapped_type;
-   typedef typename nator_traits::template portable_rebind_alloc
-      <value_type>::type                                          allocator_type;
-
-   typedef priv_node_t                                            container_node_type;
-   friend class node_handle_friend;
-
-   ///@cond
-   private:
-   BOOST_MOVABLE_BUT_NOT_COPYABLE(node_handle)
-
-   typedef typename nator_traits::pointer                         node_pointer;
-   typedef typename dtl::aligned_storage
-      < sizeof(nallocator_type)
-      , dtl::alignment_of<nallocator_type>::value
-      >::type                                                     nalloc_storage_t;
-
-   node_pointer      m_ptr;
-   nalloc_storage_t  m_nalloc_storage;
-
-   void move_construct_alloc(nallocator_type &al)
-   {  ::new((void*)m_nalloc_storage.data, boost_container_new_t()) nallocator_type(::boost::move(al));   }
-
-   void destroy_deallocate_node()
-   {
-      boost::movelib::to_raw_pointer(m_ptr)->destructor(this->node_alloc());
-      nator_traits::deallocate(this->node_alloc(), m_ptr, 1u);
-   }
-
-   template<class OtherNodeHandle>
-   void move_construct_end(OtherNodeHandle &nh)
-   {
-      if(m_ptr){
-         ::new ((void*)m_nalloc_storage.data, boost_container_new_t()) nallocator_type(::boost::move(nh.node_alloc()));
-         node_handle_friend::destroy_alloc(nh);
-         node_handle_friend::get_node_pointer(nh) = node_pointer();
-      }
-      BOOST_ASSERT(nh.empty());
-   }
-
-   void destroy_alloc() BOOST_NOEXCEPT
-   {  static_cast<nallocator_type*>((void*)m_nalloc_storage.data)->~nallocator_type();  }
-
-   node_pointer &get_node_pointer() BOOST_NOEXCEPT
-   {  return m_ptr;  }
-
-   ///@endcond
-
-   public:
-   //! <b>Effects</b>: Initializes m_ptr to nullptr.
-   //!
-   //! <b>Postcondition</b>: this->empty()
-   BOOST_CXX14_CONSTEXPR node_handle() BOOST_NOEXCEPT
-      :  m_ptr()
-   { }
-
-   //! <b>Effects</b>: Constructs a node_handle object initializing internal pointer with p.
-   //!   If p != nullptr copy constructs internal allocator from al.
-   node_handle(node_pointer p, const nallocator_type &al) BOOST_NOEXCEPT
-      :  m_ptr(p)
-   {
-      if(m_ptr){
-         ::new ((void*)m_nalloc_storage.data, boost_container_new_t()) nallocator_type(al);
-      }
-   }
-
-   //! <b>Effects</b>: Constructs a node_handle object initializing internal pointer with a related nh's internal pointer
-   //!   and assigns nullptr to the later. If nh's internal pointer was not nullptr, move constructs internal
-   //!   allocator with nh's internal allocator and destroy nh's internal allocator.
-   //!
-   //! <b>Postcondition</b>: nh.empty()
-   //!
-   //! <b>Note</b>: Two node_handle's are related if only one of KeyMapped template parameter
-   //!   of a node handle is void.
-   template<class KeyMapped2>
-   node_handle( BOOST_RV_REF_BEG node_handle<NodeAllocator, KeyMapped2> BOOST_RV_REF_END nh
-               , typename dtl::enable_if_c
-                  < ((unsigned)dtl::is_same<KeyMapped,  void>::value +
-                     (unsigned)dtl::is_same<KeyMapped2, void>::value) == 1u
-                  >::type* = 0) BOOST_NOEXCEPT
-      :  m_ptr(nh.get())
-   {  this->move_construct_end(nh);  }
-
-   //! <b>Effects</b>: Constructs a node_handle object initializing internal pointer with nh's internal pointer
-   //!   and assigns nullptr to the later. If nh's internal pointer was not nullptr, move constructs internal
-   //!   allocator with nh's internal allocator and destroy nh's internal allocator.
-   //!
-   //! <b>Postcondition</b>: nh.empty()
-   node_handle (BOOST_RV_REF(node_handle) nh) BOOST_NOEXCEPT
-      : m_ptr(nh.m_ptr)
-   {  this->move_construct_end(nh);  }
-
-   //! <b>Effects</b>: If !this->empty(), destroys the value_type subobject in the container_node_type object
-   //!   pointed to by c by calling allocator_traits<impl_defined>::destroy, then deallocates m_ptr by calling
-   //!   nator_traits::rebind_traits<container_node_type>::deallocate.
-   ~node_handle() BOOST_NOEXCEPT
-   {
-      if(!this->empty()){
-         this->destroy_deallocate_node();
-         this->destroy_alloc();
-      }
-   }
-
-   //! <b>Requires</b>: Either this->empty(), or nator_traits::propagate_on_container_move_assignment is true, or
-   //!   node_alloc() == nh.node_alloc().
-   //!
-   //! <b>Effects</b>: If m_ptr != nullptr, destroys the value_type subobject in the container_node_type object
-   //!   pointed to by m_ptr by calling nator_traits::destroy, then deallocates m_ptr by calling
-   //!   nator_traits::deallocate. Assigns nh.m_ptr to m_ptr. If this->empty()
-   //!   or nator_traits::propagate_on_container_move_assignment is true, move assigns nh.node_alloc() to
-   //!   node_alloc(). Assigns nullptr to nh.m_ptr and assigns nullopt to nh.node_alloc().
-   //!
-   //! <b>Returns</b>: *this.
-   //!
-   //! <b>Throws</b>: Nothing.
-   node_handle & operator=(BOOST_RV_REF(node_handle) nh) BOOST_NOEXCEPT
-   {
-      BOOST_ASSERT(this->empty() || nator_traits::propagate_on_container_move_assignment::value 
-                   || nator_traits::equal(node_alloc(), nh.node_alloc()));
-
-      bool const was_this_non_null = !this->empty();
-      bool const was_nh_non_null   = !nh.empty();
-
-      if(was_nh_non_null){
-         if(was_this_non_null){
-            this->destroy_deallocate_node();
-            if(nator_traits::propagate_on_container_move_assignment::value){
-               this->node_alloc() = ::boost::move(nh.node_alloc());
-            }
-         }
-         else{
-            this->move_construct_alloc(nh.node_alloc());
-         }
-         m_ptr = nh.m_ptr;
-         nh.m_ptr = node_pointer();
-         nh.destroy_alloc();
-      }
-      else if(was_this_non_null){
-         this->destroy_deallocate_node();
-         this->destroy_alloc();
-         m_ptr = node_pointer();
-      }
-      return *this;
-   }
-
-   //! <b>Requires</b>: empty() == false.
-   //!
-   //! <b>Returns</b>: A reference to the value_type subobject in the container_node_type object pointed to by m_ptr
-   //!
-   //! <b>Throws</b>: Nothing.
-   value_type& value() const BOOST_NOEXCEPT
-   {
-      BOOST_STATIC_ASSERT((dtl::is_same<KeyMapped, void>::value));
-      BOOST_ASSERT(!empty());
-      return m_ptr->get_data();
-   }
-
-   //! <b>Requires</b>: empty() == false.
-   //!
-   //! <b>Returns</b>: A non-const reference to the key_type member of the value_type subobject in the 
-   //!   container_node_type object pointed to by m_ptr.
-   //!
-   //! <b>Throws</b>: Nothing.
-   //!
-   //! <b>Requires</b>: Modifying the key through the returned reference is permitted.
-   key_type& key() const BOOST_NOEXCEPT
-   {
-      BOOST_STATIC_ASSERT((!dtl::is_same<KeyMapped, void>::value));
-      BOOST_ASSERT(!empty());
-      return const_cast<key_type &>(KeyMapped().key_of_value(m_ptr->get_data()));
-   }
-
-   //! <b>Requires</b>: empty() == false.
-   //!
-   //! <b>Returns</b>: A reference to the mapped_type member of the value_type subobject
-   //!   in the container_node_type object pointed to by m_ptr
-   //!
-   //! <b>Throws</b>: Nothing.
-   mapped_type& mapped() const BOOST_NOEXCEPT
-   {
-      BOOST_STATIC_ASSERT((!dtl::is_same<KeyMapped, void>::value));
-      BOOST_ASSERT(!empty());
-      return KeyMapped().mapped_of_value(m_ptr->get_data());
-   }
-
-   //! <b>Requires</b>: empty() == false.
-   //!
-   //! <b>Returns</b>: A copy of the internally hold allocator.
-   //!
-   //! <b>Throws</b>: Nothing.
-   allocator_type get_allocator() const
-   {
-      BOOST_ASSERT(!empty());
-      return this->node_alloc();
-   }
-
-   //! <b>Returns</b>: m_ptr != nullptr.
-   //!
-   #ifdef BOOST_CONTAINER_DOXYGEN_INVOKED
-   BOOST_CONTAINER_FORCEINLINE explicit operator bool
-   #else
-   private: struct bool_conversion {int for_bool; int for_arg(); }; typedef int bool_conversion::* explicit_bool_arg;
-   public: BOOST_CONTAINER_FORCEINLINE operator explicit_bool_arg
-   #endif
-      ()const BOOST_NOEXCEPT
-   {  return m_ptr ? &bool_conversion::for_bool  : explicit_bool_arg(0);  }
-
-   //! <b>Returns</b>: m_ptr == nullptr.
-   //!
-   bool empty() const BOOST_NOEXCEPT
-   {
-      return !this->m_ptr;
-   }
-
-   //! <b>Requires</b>: this->empty(), or nh.empty(), or nator_traits::propagate_on_container_swap is true, or
-   //!   node_alloc() == nh.node_alloc().
-   //!
-   //! <b>Effects</b>: Calls swap(m_ptr, nh.m_ptr). If this->empty(), or nh.empty(), or nator_traits::propagate_on_-
-   //!   container_swap is true calls swap(node_alloc(), nh.node_alloc()).
-   void swap(node_handle &nh)
-      BOOST_NOEXCEPT_IF(nator_traits::propagate_on_container_swap::value || nator_traits::is_always_equal::value)
-   {
-      BOOST_ASSERT(this->empty() || nh.empty() || nator_traits::propagate_on_container_swap::value
-                   || nator_traits::equal(node_alloc(), nh.node_alloc()));
-
-      bool const was_this_non_null = !this->empty();
-      bool const was_nh_non_null   = !nh.empty();
-
-      if(was_nh_non_null){
-         if(was_this_non_null){
-            if(nator_traits::propagate_on_container_swap::value){
-               ::boost::adl_move_swap(this->node_alloc(), nh.node_alloc());
-            }
-         }
-         else{
-            this->move_construct_alloc(nh.node_alloc());
-            nh.destroy_alloc();
-         }
-      }
-      else if(was_this_non_null){
-         nh.move_construct_alloc(this->node_alloc());
-         this->destroy_alloc();
-      }
-      ::boost::adl_move_swap(m_ptr, nh.m_ptr);
-   }
-
-   //! <b>Effects</b>: If this->empty() returns nullptr, otherwise returns m_ptr
-   //!   resets m_ptr to nullptr and destroys the internal allocator.
-   //!
-   //! <b>Postcondition</b>: this->empty()
-   //!
-   //! <b>Note</b>: Non-standard extensions
-   node_pointer release() BOOST_NOEXCEPT
-   {
-      node_pointer p(m_ptr);
-      m_ptr = node_pointer();
-      if(p)
-         this->destroy_alloc();
-      return p;
-   }
-
-   //! <b>Effects</b>: Returns m_ptr.
-   //!
-   //! <b>Note</b>: Non-standard extensions
-   node_pointer get() const BOOST_NOEXCEPT
-   {
-      return m_ptr;
-   }
-
-   //! <b>Effects</b>: Returns a reference to the internal node allocator.
-   //!
-   //! <b>Note</b>: Non-standard extensions
-   nallocator_type &node_alloc() BOOST_NOEXCEPT
-   {
-      BOOST_ASSERT(!empty());
-      return *static_cast<nallocator_type*>((void*)m_nalloc_storage.data);
-   }
-
-
-   //! <b>Effects</b>: Returns a reference to the internal node allocator.
-   //!
-   //! <b>Note</b>: Non-standard extensions
-   const nallocator_type &node_alloc() const BOOST_NOEXCEPT
-   {
-      BOOST_ASSERT(!empty());
-      return *static_cast<const nallocator_type*>((const void*)m_nalloc_storage.data);
-   }
-
-   //! <b>Effects</b>: x.swap(y).
-   //!
-   friend void swap(node_handle & x, node_handle & y) BOOST_NOEXCEPT_IF(BOOST_NOEXCEPT(x.swap(y)))
-   {  x.swap(y);  }
-};
-
-//! A class template used to describe the results of inserting a
-//! Container::node_type in a Container with unique keys.
-//! Includes at least the following non-static public data members:
-//!
-//! <ul><li>bool inserted</li>;
-//! <li>Iterator position</li>;
-//! <li>NodeType node</li></ul>
-//!
-//! This type is MoveConstructible, MoveAssignable, DefaultConstructible,
-//! Destructible, and lvalues of that type are swappable
-template<class Iterator, class NodeType>
-struct insert_return_type_base
-{
-   private:
-   BOOST_MOVABLE_BUT_NOT_COPYABLE(insert_return_type_base)
-
-   public:
-   insert_return_type_base()
-      : inserted(false), position(), node()
-   {}
-
-   insert_return_type_base(BOOST_RV_REF(insert_return_type_base) other)
-      : inserted(other.inserted), position(other.position), node(boost::move(other.node))
-   {}
-
-   template<class RelatedIt, class RelatedNode>
-   insert_return_type_base(bool insert, RelatedIt it, BOOST_RV_REF(RelatedNode) n)
-      : inserted(insert), position(it), node(boost::move(n))
-   {}
-
-   insert_return_type_base & operator=(BOOST_RV_REF(insert_return_type_base) other)
-   {
-      inserted = other.inserted;
-      position = other.position;
-      node = boost::move(other.node);
-      return *this;
-   }
-
-   bool  inserted;
-   Iterator position;
-   NodeType node;
-};
-
-}  //namespace container {
-}  //namespace boost {
-
-#include <boost/container/detail/config_end.hpp>
-
-#endif   //BOOST_CONTAINER_NODE_HANDLE_HPP
diff --git a/src/boost/container/options.hpp b/src/boost/container/options.hpp
deleted file mode 100644
index c58ff82a..00000000
--- a/src/boost/container/options.hpp
+++ /dev/null
@@ -1,671 +0,0 @@
-/////////////////////////////////////////////////////////////////////////////
-//
-// (C) Copyright Ion Gaztanaga  2013-2013
-//
-// Distributed under the Boost 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.
-//
-/////////////////////////////////////////////////////////////////////////////
-
-#ifndef BOOST_CONTAINER_OPTIONS_HPP
-#define BOOST_CONTAINER_OPTIONS_HPP
-
-#ifndef BOOST_CONFIG_HPP
-#  include <boost/config.hpp>
-#endif
-
-#if defined(BOOST_HAS_PRAGMA_ONCE)
-#  pragma once
-#endif
-
-#include <boost/container/detail/config_begin.hpp>
-#include <boost/container/container_fwd.hpp>
-#include <boost/intrusive/pack_options.hpp>
-#include <boost/static_assert.hpp>
-
-namespace boost {
-namespace container {
-
-////////////////////////////////////////////////////////////////
-//
-//
-//       OPTIONS FOR ASSOCIATIVE TREE-BASED CONTAINERS
-//
-//
-////////////////////////////////////////////////////////////////
-
-//! Enumeration used to configure ordered associative containers
-//! with a concrete tree implementation.
-enum tree_type_enum
-{
-   red_black_tree,
-   avl_tree,
-   scapegoat_tree,
-   splay_tree
-};
-
-#if !defined(BOOST_CONTAINER_DOXYGEN_INVOKED)
-
-template<tree_type_enum TreeType, bool OptimizeSize>
-struct tree_opt
-{
-   static const boost::container::tree_type_enum tree_type = TreeType;
-   static const bool optimize_size = OptimizeSize;
-};
-
-typedef tree_opt<red_black_tree, true> tree_assoc_defaults;
-
-#endif   //!defined(BOOST_CONTAINER_DOXYGEN_INVOKED)
-
-//!This option setter specifies the underlying tree type
-//!(red-black, AVL, Scapegoat or Splay) for ordered associative containers
-BOOST_INTRUSIVE_OPTION_CONSTANT(tree_type, tree_type_enum, TreeType, tree_type)
-
-//!This option setter specifies if node size is optimized
-//!storing rebalancing data masked into pointers for ordered associative containers
-BOOST_INTRUSIVE_OPTION_CONSTANT(optimize_size, bool, Enabled, optimize_size)
-
-//! Helper metafunction to combine options into a single type to be used
-//! by \c boost::container::set, \c boost::container::multiset
-//! \c boost::container::map and \c boost::container::multimap.
-//! Supported options are: \c boost::container::optimize_size and \c boost::container::tree_type
-#if defined(BOOST_CONTAINER_DOXYGEN_INVOKED) || defined(BOOST_CONTAINER_VARIADIC_TEMPLATES)
-template<class ...Options>
-#else
-template<class O1 = void, class O2 = void, class O3 = void, class O4 = void>
-#endif
-struct tree_assoc_options
-{
-   /// @cond
-   typedef typename ::boost::intrusive::pack_options
-      < tree_assoc_defaults,
-      #if !defined(BOOST_CONTAINER_VARIADIC_TEMPLATES)
-      O1, O2, O3, O4
-      #else
-      Options...
-      #endif
-      >::type packed_options;
-   typedef tree_opt<packed_options::tree_type, packed_options::optimize_size> implementation_defined;
-   /// @endcond
-   typedef implementation_defined type;
-};
-
-#if !defined(BOOST_NO_CXX11_TEMPLATE_ALIASES)
-
-//! Helper alias metafunction to combine options into a single type to be used
-//! by tree-based associative containers
-template<class ...Options>
-using tree_assoc_options_t = typename boost::container::tree_assoc_options<Options...>::type;
-
-#endif
-
-
-////////////////////////////////////////////////////////////////
-//
-//
-//       OPTIONS FOR ASSOCIATIVE HASH-BASED CONTAINERS
-//
-//
-////////////////////////////////////////////////////////////////
-
-#if !defined(BOOST_CONTAINER_DOXYGEN_INVOKED)
-
-template<bool StoreHash, bool CacheBegin, bool LinearBuckets, bool FastmodBuckets>
-struct hash_opt
-{
-   static const bool store_hash  = StoreHash;
-   static const bool cache_begin = CacheBegin;
-   static const bool linear_buckets = LinearBuckets;
-   static const bool fastmod_buckets = FastmodBuckets;
-};
-
-typedef hash_opt<false, false, false, false> hash_assoc_defaults;
-
-#endif   //!defined(BOOST_CONTAINER_DOXYGEN_INVOKED)
-
-//!This option setter specifies if nodes also store the hash value
-//!so that search and rehashing for hash-expensive types is improved.
-//!This option might degrade performance for easy to hash types (like integers)
-BOOST_INTRUSIVE_OPTION_CONSTANT(store_hash, bool, Enabled, store_hash)
-
-//!This option setter specifies if the container will cache the first
-//!non-empty bucket so that begin() is O(1) instead of searching for the
-//!first non-empty bucket (which can be O(bucket_size()))
-BOOST_INTRUSIVE_OPTION_CONSTANT(cache_begin, bool, Enabled, cache_begin)
-
-BOOST_INTRUSIVE_OPTION_CONSTANT(linear_buckets, bool, Enabled, linear_buckets)
-
-BOOST_INTRUSIVE_OPTION_CONSTANT(fastmod_buckets, bool, Enabled, fastmod_buckets)
-
-//! Helper metafunction to combine options into a single type to be used
-//! by \c boost::container::hash_set, \c boost::container::hash_multiset
-//! \c boost::container::hash_map and \c boost::container::hash_multimap.
-//! Supported options are: \c boost::container::store_hash
-#if defined(BOOST_CONTAINER_DOXYGEN_INVOKED) || defined(BOOST_CONTAINER_VARIADIC_TEMPLATES)
-template<class ...Options>
-#else
-template<class O1 = void, class O2 = void, class O3 = void, class O4 = void>
-#endif
-struct hash_assoc_options
-{
-   /// @cond
-   typedef typename ::boost::intrusive::pack_options
-      < hash_assoc_defaults,
-      #if !defined(BOOST_CONTAINER_VARIADIC_TEMPLATES)
-      O1, O2, O3, O4
-      #else
-      Options...
-      #endif
-      >::type packed_options;
-   typedef hash_opt<packed_options::store_hash
-                   ,packed_options::cache_begin
-                   ,packed_options::linear_buckets
-                   ,packed_options::fastmod_buckets
-                   > implementation_defined;
-   /// @endcond
-   typedef implementation_defined type;
-};
-
-#if !defined(BOOST_NO_CXX11_TEMPLATE_ALIASES)
-
-//! Helper alias metafunction to combine options into a single type to be used
-//! by hash-based associative containers
-template<class ...Options>
-using hash_assoc_options_t = typename boost::container::hash_assoc_options<Options...>::type;
-
-#endif
-
-////////////////////////////////////////////////////////////////
-//
-//
-//          OPTIONS FOR VECTOR-BASED CONTAINERS
-//
-//
-////////////////////////////////////////////////////////////////
-
-#if !defined(BOOST_CONTAINER_DOXYGEN_INVOKED)
-
-template<class T, class Default>
-struct default_if_void
-{
-   typedef T type;
-};
-
-template<class Default>
-struct default_if_void<void, Default>
-{
-   typedef Default type;
-};
-
-template<std::size_t N, std::size_t DefaultN>
-struct default_if_zero
-{
-   static const std::size_t value = N;
-};
-
-template<std::size_t DefaultN>
-struct default_if_zero<0u, DefaultN>
-{
-   static const std::size_t value = DefaultN;
-};
-
-
-
-#endif
-
-#if !defined(BOOST_CONTAINER_DOXYGEN_INVOKED)
-
-template<class AllocTraits, class StoredSizeType>
-struct get_stored_size_type_with_alloctraits
-{
-   typedef StoredSizeType type;
-};
-
-template<class AllocTraits>
-struct get_stored_size_type_with_alloctraits<AllocTraits, void>
-{
-   typedef typename AllocTraits::size_type type;
-};
-
-template<class GrowthType, class StoredSizeType>
-struct vector_opt
-{
-   typedef GrowthType      growth_factor_type;
-   typedef StoredSizeType  stored_size_type;
-
-   template<class AllocTraits>
-   struct get_stored_size_type
-      : get_stored_size_type_with_alloctraits<AllocTraits, StoredSizeType>
-   {};
-};
-
-class default_next_capacity;
-
-typedef vector_opt<void, void> vector_null_opt;
-
-#else    //!defined(BOOST_CONTAINER_DOXYGEN_INVOKED)
-
-//!This growth factor argument specifies that the container should increase its
-//!capacity a 50% when existing capacity is exhausted.
-struct growth_factor_50{};
-
-//!This growth factor argument specifies that the container should increase its
-//!capacity a 60% when existing capacity is exhausted.
-struct growth_factor_60{};
-
-//!This growth factor argument specifies that the container should increase its
-//!capacity a 100% (doubling its capacity) when existing capacity is exhausted.
-struct growth_factor_100{};
-
-#endif   //!defined(BOOST_CONTAINER_DOXYGEN_INVOKED)
-
-//!This option setter specifies the growth factor strategy of the underlying vector.
-//!
-//!\tparam GrowthFactor A function object that has the following signature:<br/><br/>
-//!`template<class SizeType>`<br/>
-//!`SizeType operator()(SizeType cur_cap, SizeType add_min_cap, SizeType max_cap) const;`.<br/><br/>
-//!`cur_cap` is the current capacity, `add_min_cap` is the minimum additional capacity
-//!we want to achieve and `max_cap` is the maximum capacity that the allocator or other 
-//!factors allow. The implementation should return a value between `cur_cap` + `add_min_cap`
-//!and `max_cap`. `cur_cap` + `add_min_cap` is guaranteed not to overflow/wraparound,
-//! but the implementation should handle wraparound produced by the growth factor.
-//!
-//!Predefined growth factors that can be passed as arguments to this option are:
-//!\c boost::container::growth_factor_50
-//!\c boost::container::growth_factor_60
-//!\c boost::container::growth_factor_100
-//!
-//!If this option is not specified, a default will be used by the container.
-BOOST_INTRUSIVE_OPTION_TYPE(growth_factor, GrowthFactor, GrowthFactor, growth_factor_type)
-
-//!This option specifies the unsigned integer type that a user wants the container
-//!to use to hold size-related information inside a container (e.g. current size, current capacity).
-//!
-//!\tparam StoredSizeType An unsigned integer type. It shall be smaller than than the size
-//! of the size_type deduced from `allocator_traits<A>::size_type` or the same type.
-//!
-//!If the maximum capacity() to be used is limited, a user can try to use 8-bit, 16-bit 
-//!(e.g. in 32-bit machines), or 32-bit size types (e.g. in a 64 bit machine) to see if some
-//!memory can be saved for empty vectors. This could potentially performance benefits due to better
-//!cache usage.
-//!
-//!Note that alignment requirements can disallow theoretical space savings. Example:
-//!\c vector holds a pointer and two size types (for size and capacity), in a 32 bit machine
-//!a 8 bit size type (total size: 4 byte pointer + 2 x 1 byte sizes = 6 bytes) 
-//!will not save space when comparing two 16-bit size types because usually
-//!a 32 bit alignment is required for vector and the size will be rounded to 8 bytes. In a 64-bit
-//!machine a 16 bit size type does not usually save memory when comparing to a 32-bit size type.
-//!Measure the size of the resulting container and do not assume a smaller \c stored_size
-//!will always lead to a smaller sizeof(container).
-//!
-//!If a user tries to insert more elements than representable by \c stored_size, vector
-//!will throw a length_error.
-//!
-//!If this option is not specified, `allocator_traits<A>::size_type` (usually std::size_t) will
-//!be used to store size-related information inside the container.
-BOOST_INTRUSIVE_OPTION_TYPE(stored_size, StoredSizeType, StoredSizeType, stored_size_type)
-
-//! Helper metafunction to combine options into a single type to be used
-//! by \c boost::container::vector.
-//! Supported options are: \c boost::container::growth_factor and \c boost::container::stored_size
-#if defined(BOOST_CONTAINER_DOXYGEN_INVOKED) || defined(BOOST_CONTAINER_VARIADIC_TEMPLATES)
-template<class ...Options>
-#else
-template<class O1 = void, class O2 = void, class O3 = void, class O4 = void>
-#endif
-struct vector_options
-{
-   /// @cond
-   typedef typename ::boost::intrusive::pack_options
-      < vector_null_opt,
-      #if !defined(BOOST_CONTAINER_VARIADIC_TEMPLATES)
-      O1, O2, O3, O4
-      #else
-      Options...
-      #endif
-      >::type packed_options;
-   typedef vector_opt< typename packed_options::growth_factor_type
-                     , typename packed_options::stored_size_type> implementation_defined;
-   /// @endcond
-   typedef implementation_defined type;
-};
-
-#if !defined(BOOST_NO_CXX11_TEMPLATE_ALIASES)
-
-//! Helper alias metafunction to combine options into a single type to be used
-//! by \c boost::container::vector.
-//! Supported options are: \c boost::container::growth_factor and \c boost::container::stored_size
-template<class ...Options>
-using vector_options_t = typename boost::container::vector_options<Options...>::type;
-
-#endif
-
-////////////////////////////////////////////////////////////////
-//
-//
-//          OPTIONS FOR SMALL-VECTOR CONTAINER
-//
-//
-////////////////////////////////////////////////////////////////
-
-//! This option specifies the desired alignment for the value_type stored
-//! in the container.
-//! A value zero represents the natural alignment.
-//!
-//!\tparam Alignment An unsigned integer value. Must be power of two.
-BOOST_INTRUSIVE_OPTION_CONSTANT(inplace_alignment, std::size_t, Alignment, inplace_alignment)
-
-#if !defined(BOOST_CONTAINER_DOXYGEN_INVOKED)
-
-template<class GrowthType, std::size_t InplaceAlignment>
-struct small_vector_opt
-{
-   typedef GrowthType      growth_factor_type;
-   static const std::size_t inplace_alignment = InplaceAlignment;
-};
-
-typedef small_vector_opt<void, 0u> small_vector_null_opt;
-
-#endif    //!defined(BOOST_CONTAINER_DOXYGEN_INVOKED)
-
-//! Helper metafunction to combine options into a single type to be used
-//! by \c boost::container::small_vector.
-//! Supported options are: \c boost::container::growth_factor and \c boost::container::inplace_alignment
-#if defined(BOOST_CONTAINER_DOXYGEN_INVOKED) || defined(BOOST_CONTAINER_VARIADIC_TEMPLATES)
-template<class ...Options>
-#else
-template<class O1 = void, class O2 = void, class O3 = void, class O4 = void>
-#endif
-struct small_vector_options
-{
-   /// @cond
-   typedef typename ::boost::intrusive::pack_options
-      < small_vector_null_opt,
-      #if !defined(BOOST_CONTAINER_VARIADIC_TEMPLATES)
-      O1, O2, O3, O4
-      #else
-      Options...
-      #endif
-      >::type packed_options;
-   typedef small_vector_opt< typename packed_options::growth_factor_type
-                           , packed_options::inplace_alignment> implementation_defined;
-   /// @endcond
-   typedef implementation_defined type;
-};
-
-#if !defined(BOOST_NO_CXX11_TEMPLATE_ALIASES)
-
-//! Helper alias metafunction to combine options into a single type to be used
-//! by \c boost::container::small_vector.
-//! Supported options are: \c boost::container::growth_factor and \c boost::container::stored_size
-template<class ...Options>
-using small_vector_options_t = typename boost::container::small_vector_options<Options...>::type;
-
-#endif
-
-
-////////////////////////////////////////////////////////////////
-//
-//
-//          OPTIONS FOR STATIC-VECTOR CONTAINER
-//
-//
-////////////////////////////////////////////////////////////////
-
-//!This option specifies if the container will throw if in
-//!the static capacity is not sufficient to hold the required
-//!values. If false is specified, insufficient capacity will
-//!lead to BOOST_ASSERT, and if this assertion returns, to undefined behaviour,
-//!which potentially can lead to better static_vector performance.
-//!The default value is true.
-//!
-//!\tparam ThrowOnExhaustion A boolean value. True if throw is required.
-BOOST_INTRUSIVE_OPTION_CONSTANT(throw_on_overflow, bool, ThrowOnOverflow, throw_on_overflow)
-
-#if !defined(BOOST_CONTAINER_DOXYGEN_INVOKED)
-
-template<bool ThrowOnOverflow, std::size_t InplaceAlignment>
-struct static_vector_opt
-{
-   static const bool throw_on_overflow = ThrowOnOverflow;
-   static const std::size_t inplace_alignment = InplaceAlignment;
-};
-
-typedef static_vector_opt<true, 0u> static_vector_null_opt;
-
-#endif    //!defined(BOOST_CONTAINER_DOXYGEN_INVOKED)
-
-//! Helper metafunction to combine options into a single type to be used
-//! by \c boost::container::static_vector.
-//! Supported options are: \c boost::container::throw_on_overflow and \c boost::container::inplace_alignment
-#if defined(BOOST_CONTAINER_DOXYGEN_INVOKED) || defined(BOOST_CONTAINER_VARIADIC_TEMPLATES)
-template<class ...Options>
-#else
-template<class O1 = void, class O2 = void, class O3 = void, class O4 = void>
-#endif
-struct static_vector_options
-{
-   /// @cond
-   typedef typename ::boost::intrusive::pack_options
-      < static_vector_null_opt,
-      #if !defined(BOOST_CONTAINER_VARIADIC_TEMPLATES)
-      O1, O2, O3, O4
-      #else
-      Options...
-      #endif
-      >::type packed_options;
-   typedef static_vector_opt< packed_options::throw_on_overflow
-                            , packed_options::inplace_alignment> implementation_defined;
-   /// @endcond
-   typedef implementation_defined type;
-};
-
-#if !defined(BOOST_NO_CXX11_TEMPLATE_ALIASES)
-
-//! Helper alias metafunction to combine options into a single type to be used
-//! by \c boost::container::static_vector.
-//! Supported options are: \c boost::container::growth_factor and \c boost::container::stored_size
-template<class ...Options>
-using static_vector_options_t = typename boost::container::static_vector_options<Options...>::type;
-
-#endif
-
-
-////////////////////////////////////////////////////////////////
-//
-//
-//          OPTIONS FOR DEVECTOR CONTAINER
-//
-//
-////////////////////////////////////////////////////////////////
-
-//!Thse options specify the relocation strategy of devector.
-//!
-//!Predefined relocation limits that can be passed as arguments to this option are:
-//!\c boost::container::relocate_on_66
-//!\c boost::container::relocate_on_75
-//!\c boost::container::relocate_on_80
-//!\c boost::container::relocate_on_85
-//!\c boost::container::relocate_on_90
-//!
-//!If this option is not specified, a default will be used by the container.
-//!
-//!Note: Repeated insertions at only one end (only back insertions or only front insertions) usually will
-//!lead to a single relocation when `relocate_on_66` is used and two relocations when `relocate_on_90`
-//!is used.
-
-#if !defined(BOOST_CONTAINER_DOXYGEN_INVOKED)
-
-BOOST_INTRUSIVE_OPTION_CONSTANT(relocate_on, std::size_t, Fraction, free_fraction)
-
-struct relocate_on_66 : public relocate_on<3U>{};
-
-struct relocate_on_75 : public relocate_on<4U> {};
-
-struct relocate_on_80 : public relocate_on<5U> {};
-
-struct relocate_on_85 : public relocate_on<7U> {};
-
-struct relocate_on_90 : public relocate_on<10U> {};
-
-template<class GrowthType, class StoredSizeType, std::size_t FreeFraction>
-struct devector_opt
-   : vector_opt<GrowthType, StoredSizeType>
-{
-   static const std::size_t free_fraction = FreeFraction;
-};
-
-typedef devector_opt<void, void, 0u> devector_null_opt;
-
-#else
-
-//!This relocation condition option specifies that the container will never relocate
-//!elements when there is no space at the side the insertion should
-//!take place
-struct relocate_never;
-
-//!This relocation condition option specifies that the container will relocate
-//!all elements when there is no space at the side the insertion should
-//!take place and memory usage is below 66% (2/3)
-struct relocate_on_66;
-
-//!This relocation condition option specifies that the container will relocate
-//!all elements when there is no space at the side the insertion should
-//!take place and memory usage is below 75% (3/4)
-struct relocate_on_75;
-
-//!This relocation condition option specifies that the container will relocate
-//!all elements when there is no space at the side the insertion should
-//!take place and memory usage is below 80% (4/5)
-struct relocate_on_80;
-
-//!This relocation condition option specifies that the container will relocate
-//!all elements when there is no space at the side the insertion should
-//!take place and memory usage is below 85% (6/7)
-struct relocate_on_85;
-
-//!This relocation condition option specifies that the container will relocate
-//!all elements when there is no space at the side the insertion should
-//!take place and memory usage is below 90% (9/10)
-struct relocate_on_90;
-
-#endif
-
-
-//! Helper metafunction to combine options into a single type to be used
-//! by \c boost::container::devector.
-//! Supported options are: \c boost::container::growth_factor, \c boost::container::stored_size
-//! and \c boost::container::relocate_on
-#if defined(BOOST_CONTAINER_DOXYGEN_INVOKED) || defined(BOOST_CONTAINER_VARIADIC_TEMPLATES)
-template<class ...Options>
-#else
-template<class O1 = void, class O2 = void, class O3 = void, class O4 = void>
-#endif
-struct devector_options
-{
-   /// @cond
-   typedef typename ::boost::intrusive::pack_options
-      < devector_null_opt,
-      #if !defined(BOOST_CONTAINER_VARIADIC_TEMPLATES)
-      O1, O2, O3, O4
-      #else
-      Options...
-      #endif
-      >::type packed_options;
-   typedef devector_opt< typename packed_options::growth_factor_type
-                       , typename packed_options::stored_size_type
-                       , packed_options::free_fraction
-                       > implementation_defined;
-   /// @endcond
-   typedef implementation_defined type;
-};
-
-#if !defined(BOOST_NO_CXX11_TEMPLATE_ALIASES)
-
-//! Helper alias metafunction to combine options into a single type to be used
-//! by \c boost::container::devector.
-//! Supported options are: \c boost::container::growth_factor and \c boost::container::stored_size
-template<class ...Options>
-using devector_options_t = typename boost::container::devector_options<Options...>::type;
-
-#endif
-
-////////////////////////////////////////////////////////////////
-//
-//
-//          OPTIONS FOR DEQUE-BASED CONTAINERS
-//
-//
-////////////////////////////////////////////////////////////////
-
-#if !defined(BOOST_CONTAINER_DOXYGEN_INVOKED)
-
-template<std::size_t BlockBytes, std::size_t BlockSize>
-struct deque_opt
-{
-   static const std::size_t block_bytes = BlockBytes;
-   static const std::size_t block_size  = BlockSize;
-   BOOST_STATIC_ASSERT_MSG(!(block_bytes && block_size), "block_bytes and block_size can't be specified at the same time");
-};
-
-typedef deque_opt<0u, 0u> deque_null_opt;
-
-#endif
-
-//! Helper metafunction to combine options into a single type to be used
-//! by \c boost::container::deque.
-//! Supported options are: \c boost::container::block_bytes
-#if defined(BOOST_CONTAINER_DOXYGEN_INVOKED) || defined(BOOST_CONTAINER_VARIADIC_TEMPLATES)
-template<class ...Options>
-#else
-template<class O1 = void, class O2 = void, class O3 = void, class O4 = void>
-#endif
-struct deque_options
-{
-   /// @cond
-   typedef typename ::boost::intrusive::pack_options
-      < deque_null_opt,
-      #if !defined(BOOST_CONTAINER_VARIADIC_TEMPLATES)
-      O1, O2, O3, O4
-      #else
-      Options...
-      #endif
-      >::type packed_options;
-   typedef deque_opt< packed_options::block_bytes, packed_options::block_size > implementation_defined;
-   /// @endcond
-   typedef implementation_defined type;
-};
-
-#if !defined(BOOST_NO_CXX11_TEMPLATE_ALIASES)
-
-//! Helper alias metafunction to combine options into a single type to be used
-//! by \c boost::container::deque.
-//! Supported options are: \c boost::container::block_bytes
-template<class ...Options>
-using deque_options_t = typename boost::container::deque_options<Options...>::type;
-
-#endif
-
-//!This option specifies the maximum size of a block in bytes: this delimites the number of contiguous elements
-//!that will be allocated by deque as min(1u, BlockBytes/sizeof(value_type))
-//!A value zero represents the default value.
-//!
-//!\tparam BlockBytes An unsigned integer value.
-BOOST_INTRUSIVE_OPTION_CONSTANT(block_bytes, std::size_t, BlockBytes, block_bytes)
-
-//!This option specifies the size of a block, delimites the number of contiguous elements
-//!that will be allocated by deque as BlockSize.
-//!A value zero represents the default value.
-//!
-//!\tparam BlockBytes An unsigned integer value.
-BOOST_INTRUSIVE_OPTION_CONSTANT(block_size, std::size_t, BlockSize, block_size)
-
-}  //namespace container {
-}  //namespace boost {
-
-#include <boost/container/detail/config_end.hpp>
-
-#endif   //#ifndef BOOST_CONTAINER_OPTIONS_HPP
diff --git a/src/boost/container/string.hpp b/src/boost/container/string.hpp
deleted file mode 100644
index 4474ed48..00000000
--- a/src/boost/container/string.hpp
+++ /dev/null
@@ -1,3625 +0,0 @@
-//////////////////////////////////////////////////////////////////////////////
-//
-// (C) Copyright Ion Gaztanaga 2005-2015. Distributed under the Boost
-// 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.
-//
-//////////////////////////////////////////////////////////////////////////////
-
-#ifndef BOOST_CONTAINER_STRING_HPP
-#define BOOST_CONTAINER_STRING_HPP
-
-#ifndef BOOST_CONFIG_HPP
-#  include <boost/config.hpp>
-#endif
-
-#if defined(BOOST_HAS_PRAGMA_ONCE)
-#  pragma once
-#endif
-
-#include <boost/container/detail/config_begin.hpp>
-#include <boost/container/detail/workaround.hpp>
-#include <boost/container/container_fwd.hpp>
-// container
-#include <boost/container/allocator_traits.hpp>
-#include <boost/container/new_allocator.hpp> //new_allocator
-#include <boost/container/throw_exception.hpp>
-// container/detail
-#include <boost/container/detail/alloc_helpers.hpp>
-#include <boost/container/detail/allocator_version_traits.hpp>
-#include <boost/container/detail/allocation_type.hpp>
-#include <boost/container/detail/iterator.hpp>
-#include <boost/container/detail/iterators.hpp>
-#include <boost/container/detail/min_max.hpp>
-#include <boost/container/detail/mpl.hpp>
-#include <boost/container/detail/next_capacity.hpp>
-#include <boost/move/detail/to_raw_pointer.hpp>
-#include <boost/container/detail/version_type.hpp>
-#include <boost/container/detail/type_traits.hpp>
-#include <boost/container/detail/algorithm.hpp>
-#include <boost/container/detail/minimal_char_traits_header.hpp>  // for char_traits
-//intrusive
-#include <boost/intrusive/pointer_traits.hpp>
-#include <boost/intrusive/detail/hash_combine.hpp>
-#include <boost/move/detail/force_ptr.hpp>
-//move
-#include <boost/move/utility_core.hpp>
-#include <boost/move/adl_move_swap.hpp>
-#include <boost/move/traits.hpp>
-
-#include <boost/static_assert.hpp>
-
-#include <iosfwd> 
-#include <istream>   //
-#include <ostream>
-#include <ios>
-#include <locale>
-#include <cstddef>
-#include <climits>
-
-//std
-#if !defined(BOOST_NO_CXX11_HDR_INITIALIZER_LIST)
-#include <initializer_list>   //for std::initializer_list
-#endif
-
-//GCC 12 has a regression for array-bounds warnings
-#if defined(BOOST_GCC) && (BOOST_GCC >= 120000) && (BOOST_GCC < 130000)
-#pragma GCC diagnostic push
-#pragma GCC diagnostic ignored "-Warray-bounds"
-#endif
-
-
-namespace boost {
-namespace container {
-
-#ifndef BOOST_CONTAINER_DOXYGEN_INVOKED
-namespace dtl {
-// ------------------------------------------------------------
-// Class basic_string_base.
-
-// basic_string_base is a helper class that makes it it easier to write
-// an exception-safe version of basic_string.  The constructor allocates,
-// but does not initialize, a block of memory.  The destructor
-// deallocates, but does not destroy elements within, a block of
-// memory. The destructor assumes that the memory either is the internal buffer,
-// or else points to a block of memory that was allocated using string_base's
-// allocator and whose size is this->m_storage.
-template <class Allocator>
-class basic_string_base
-{
-   basic_string_base & operator=(const basic_string_base &);
-   basic_string_base(const basic_string_base &);
-
-   typedef Allocator allocator_type;
- public:
-   typedef allocator_traits<allocator_type>                 allocator_traits_type;
-   typedef allocator_type                                   stored_allocator_type;
-   typedef typename allocator_traits_type::pointer          pointer;
-   typedef typename allocator_traits_type::value_type       value_type;
-   typedef typename allocator_traits_type::size_type        size_type;
-   typedef typename allocator_traits_type::difference_type  difference_type;
-
-   typedef ::boost::intrusive::pointer_traits<pointer> pointer_traits;
-
-   BOOST_CONTAINER_FORCEINLINE basic_string_base()
-      : members_()
-   {}
-
-   BOOST_CONTAINER_FORCEINLINE explicit basic_string_base(const allocator_type& a)
-      : members_(a)
-   {}
-
-   BOOST_CONTAINER_FORCEINLINE explicit basic_string_base(BOOST_RV_REF(allocator_type) a)
-      :  members_(boost::move(a))
-   {}
-
-   BOOST_CONTAINER_FORCEINLINE basic_string_base(const allocator_type& a, size_type n)
-      : members_(a)
-   {
-      this->allocate_initial_block(n);
-   }
-
-   BOOST_CONTAINER_FORCEINLINE explicit basic_string_base(size_type n)
-      : members_()
-   {
-      this->allocate_initial_block(n);
-   }
-
-   BOOST_CONTAINER_FORCEINLINE ~basic_string_base()
-   {
-      if(!this->is_short()){
-         this->deallocate(this->priv_long_addr(), this->priv_long_storage());
-      }
-   }
-
-   private:
-
-   #if defined(BOOST_GCC) && (BOOST_GCC >= 40600)
-   #pragma GCC diagnostic push
-   #pragma GCC diagnostic ignored "-Wmaybe-uninitialized"
-   #endif
-
-   //This is the structure controlling a long string
-   struct long_t
-   {
-      size_type      is_short  : 1;
-      size_type      length    : (sizeof(size_type)*CHAR_BIT - 1);
-      size_type      storage;
-      pointer        start;
-
-      BOOST_CONTAINER_FORCEINLINE long_t()
-         : is_short(0)
-      {}
-
-      BOOST_CONTAINER_FORCEINLINE long_t(size_type len, size_type stor, pointer ptr)
-         : is_short(0), length(len), storage(stor), start(ptr)
-      {}
-
-      BOOST_CONTAINER_FORCEINLINE long_t(const long_t &other)
-      {
-         this->is_short = false;
-         length   = other.length;
-         storage  = other.storage;
-         start    = other.start;
-      }
-
-      BOOST_CONTAINER_FORCEINLINE long_t &operator= (const long_t &other)
-      {
-         length   = other.length;
-         storage  = other.storage;
-         start    = other.start;
-         return *this;
-      }
-   };
-
-   #if defined(BOOST_GCC) && (BOOST_GCC >= 40600)
-   #pragma GCC diagnostic pop
-   #endif
-
-
-   //This type is the first part of the structure controlling a short string
-   //The "data" member stores
-   struct short_header
-   {
-      unsigned char  is_short  : 1;
-      unsigned char  length    : (CHAR_BIT - 1);
-   };
-
-   //This type has the same alignment and size as long_t but it's POD
-   //so, unlike long_t, it can be placed in a union
-
-   typedef typename dtl::aligned_storage
-      <sizeof(long_t), dtl::alignment_of<long_t>::value>::type   long_raw_t;
-
-   protected:
-   static const size_type  MinInternalBufferChars = 8;
-   static const size_type  AlignmentOfValueType =
-      alignment_of<value_type>::value;
-   static const size_type  ShortDataOffset = ((sizeof(short_header)-1)/AlignmentOfValueType+1)*AlignmentOfValueType;
-   static const size_type  ZeroCostInternalBufferChars =
-      (sizeof(long_t) - ShortDataOffset)/sizeof(value_type);
-   static const size_type  UnalignedFinalInternalBufferChars =
-      (ZeroCostInternalBufferChars > MinInternalBufferChars) ?
-                ZeroCostInternalBufferChars : MinInternalBufferChars;
-
-   struct short_t
-   {
-      short_header   h;
-      value_type     data[UnalignedFinalInternalBufferChars];
-   };
-
-   union repr_t_size_t
-   {
-      long_raw_t  r;
-      short_t     s;
-   };
-
-   union repr_t
-   {
-      long_raw_t  r_aligner;
-      short_t     s_aligner;
-      unsigned char data[sizeof(repr_t_size_t)];
-   };
-
-   struct members_holder
-      :  public allocator_type
-   {
-      BOOST_CONTAINER_FORCEINLINE void init()
-      {
-         short_t &s = *::new(this->m_repr.data) short_t;
-         s.h.is_short = 1;
-         s.h.length = 0;
-      }
-
-      BOOST_CONTAINER_FORCEINLINE members_holder()
-         : allocator_type()
-      { this->init(); }
-
-      template<class AllocatorConvertible>
-      BOOST_CONTAINER_FORCEINLINE explicit members_holder(BOOST_FWD_REF(AllocatorConvertible) a)
-         :  allocator_type(boost::forward<AllocatorConvertible>(a))
-      { this->init(); }
-
-      BOOST_CONTAINER_FORCEINLINE const short_t *pshort_repr() const
-      {  return move_detail::force_ptr<const short_t*>(m_repr.data);  }
-
-      BOOST_CONTAINER_FORCEINLINE const long_t *plong_repr() const
-      {  return move_detail::force_ptr<const long_t*>(m_repr.data);  }
-
-      BOOST_CONTAINER_FORCEINLINE short_t *pshort_repr()
-      {  return move_detail::force_ptr<short_t*>(m_repr.data);  }
-
-      BOOST_CONTAINER_FORCEINLINE long_t *plong_repr()
-      {  return move_detail::force_ptr<long_t*>(m_repr.data);  }
-
-      repr_t m_repr;
-   } members_;
-
-   BOOST_CONTAINER_FORCEINLINE const allocator_type &alloc() const
-   {  return members_;  }
-
-   BOOST_CONTAINER_FORCEINLINE allocator_type &alloc()
-   {  return members_;  }
-
-   static const size_type InternalBufferChars = (sizeof(repr_t) - ShortDataOffset)/sizeof(value_type);
-
-   private:
-
-   static const size_type MinAllocation = InternalBufferChars*2;
-
-   protected:
-   BOOST_CONTAINER_FORCEINLINE bool is_short() const
-   {
-      //Access and copy (to avoid UB) the first byte of the union to know if the
-      //active representation is short or long
-      short_header hdr;
-      BOOST_STATIC_ASSERT((sizeof(short_header) == 1));
-      *(unsigned char*)&hdr = *(unsigned char*)&this->members_.m_repr;
-      return hdr.is_short != 0;
-   }
-
-   BOOST_CONTAINER_FORCEINLINE short_t *construct_short()
-   {
-      short_t *ps = ::new(this->members_.m_repr.data) short_t;
-      ps->h.is_short = 1;
-      return ps;
-   }
-
-   BOOST_CONTAINER_FORCEINLINE void destroy_short()
-   {
-      BOOST_ASSERT(this->is_short());
-      this->members_.pshort_repr()->~short_t();
-   }
-
-   short_t *assure_short()
-   {
-      if (!this->is_short()){
-         this->destroy_long();
-         return construct_short();
-      }
-      return this->members_.pshort_repr();
-   }
-
-   BOOST_CONTAINER_FORCEINLINE long_t *construct_long()
-   {
-      long_t *pl = ::new(this->members_.m_repr.data) long_t;
-      //is_short flag is written in the constructor
-      return pl;
-   }
-
-   BOOST_CONTAINER_FORCEINLINE void destroy_long()
-   {
-      BOOST_ASSERT(!this->is_short());
-      this->members_.plong_repr()->~long_t();
-   }
-
-   long_t *assure_long()
-   {
-      if (this->is_short()){
-         this->destroy_short();
-         return this->construct_long();
-      }
-      return this->members_.plong_repr();
-   }
-
-  
-   protected:
-
-   typedef dtl::integral_constant<unsigned,
-      boost::container::dtl::version<allocator_type>::value> alloc_version;
-
-   pointer allocation_command(allocation_type command,
-                         size_type limit_size,
-                         size_type &prefer_in_recvd_out_size,
-                         pointer &reuse)
-   {
-      if(this->is_short() && (command & (expand_fwd | expand_bwd)) ){
-         reuse = 0;
-         command &= ~(expand_fwd | expand_bwd);
-      }
-      return dtl::allocator_version_traits<allocator_type>::allocation_command
-         (this->alloc(), command, limit_size, prefer_in_recvd_out_size, reuse);
-   }
-
-   size_type next_capacity(size_type additional_objects) const
-   {
-      return growth_factor_100()
-            ( this->priv_storage(), additional_objects, allocator_traits_type::max_size(this->alloc()));
-   }
-
-   void deallocate(pointer p, size_type n)
-   {
-      if (p && (n > InternalBufferChars))
-         this->alloc().deallocate(p, n);
-   }
-
-   BOOST_CONTAINER_FORCEINLINE void construct(pointer p, const value_type &value = value_type())
-   {
-      allocator_traits_type::construct
-         ( this->alloc()
-         , boost::movelib::to_raw_pointer(p)
-         , value
-         );
-   }
-
-   void destroy(pointer p, size_type n)
-   {
-      value_type *raw_p = boost::movelib::to_raw_pointer(p);
-      for(; n--; ++raw_p){
-         allocator_traits_type::destroy( this->alloc(), raw_p);
-      }
-   }
-
-   BOOST_CONTAINER_FORCEINLINE void destroy(pointer p)
-   {
-      allocator_traits_type::destroy
-         ( this->alloc()
-         , boost::movelib::to_raw_pointer(p)
-         );
-   }
-
-   void allocate_initial_block(size_type n)
-   {
-      if (n <= this->max_size()) {
-         if(n > InternalBufferChars){
-            size_type new_cap = this->next_capacity(n);
-            pointer reuse = 0;
-            pointer p = this->allocation_command(allocate_new, n, new_cap, reuse);
-            BOOST_ASSERT(this->is_short());
-            this->construct_long();
-            this->priv_long_addr(p);
-            this->priv_long_size(0);
-            this->priv_storage(new_cap);
-         }
-      }
-      else{
-         throw_length_error("basic_string::allocate_initial_block max_size() exceeded");
-      }
-   }
-
-   BOOST_CONTAINER_FORCEINLINE void deallocate_block()
-   {  this->deallocate(this->priv_addr(), this->priv_storage());  }
-
-   BOOST_CONTAINER_FORCEINLINE size_type max_size() const
-   {  return allocator_traits_type::max_size(this->alloc()) - 1; }
-
-   protected:
-   BOOST_CONTAINER_FORCEINLINE size_type priv_capacity() const
-   { return this->priv_storage() - 1; }
-
-   BOOST_CONTAINER_FORCEINLINE pointer priv_short_addr() const
-   {  return pointer_traits::pointer_to(const_cast<value_type&>(this->members_.pshort_repr()->data[0]));  }
-
-   //GCC seems a bit confused about uninitialized accesses
-   #if defined(BOOST_GCC) && (BOOST_GCC >= 40700)
-   #pragma GCC diagnostic push
-   #pragma GCC diagnostic ignored "-Wmaybe-uninitialized"
-   #endif
-
-   BOOST_CONTAINER_FORCEINLINE pointer priv_long_addr() const
-   {  return this->members_.plong_repr()->start;  }
-
-   BOOST_CONTAINER_FORCEINLINE pointer priv_addr() const
-   {
-      return this->is_short()
-         ? priv_short_addr()
-         : priv_long_addr()
-         ;
-   }
-
-   BOOST_CONTAINER_FORCEINLINE pointer priv_end_addr() const
-   {
-      return this->is_short()
-         ? this->priv_short_addr() + difference_type(this->priv_short_size())
-         : this->priv_long_addr()  + difference_type(this->priv_long_size())
-         ;
-   }
-
-   BOOST_CONTAINER_FORCEINLINE void priv_long_addr(pointer addr)
-   {  this->members_.plong_repr()->start = addr;  }
-
-   BOOST_CONTAINER_FORCEINLINE size_type priv_storage() const
-   {  return this->is_short() ? priv_short_storage() : priv_long_storage();  }
-
-   BOOST_CONTAINER_FORCEINLINE size_type priv_short_storage() const
-   {  return InternalBufferChars;  }
-
-   BOOST_CONTAINER_FORCEINLINE size_type priv_long_storage() const
-   {  return this->members_.plong_repr()->storage;  }
-
-   BOOST_CONTAINER_FORCEINLINE void priv_storage(size_type storage)
-   {
-      if(!this->is_short())
-         this->priv_long_storage(storage);
-   }
-
-   BOOST_CONTAINER_FORCEINLINE void priv_long_storage(size_type storage)
-   {
-      this->members_.plong_repr()->storage = storage;
-   }
-
-   BOOST_CONTAINER_FORCEINLINE size_type priv_size() const
-   {  return this->is_short() ? this->priv_short_size() : this->priv_long_size();  }
-
-   BOOST_CONTAINER_FORCEINLINE size_type priv_short_size() const
-   {  return this->members_.pshort_repr()->h.length;  }
-
-   BOOST_CONTAINER_FORCEINLINE size_type priv_long_size() const
-   {  return this->members_.plong_repr()->length;  }
-
-   BOOST_CONTAINER_FORCEINLINE void priv_size(size_type sz)
-   {
-      if(this->is_short())
-         this->priv_short_size(sz);
-      else
-         this->priv_long_size(sz);
-   }
-
-   BOOST_CONTAINER_FORCEINLINE void priv_short_size(size_type sz)
-   {
-      typedef unsigned char uchar_type;
-      static const uchar_type mask = uchar_type(uchar_type(-1) >> 1U);
-      BOOST_ASSERT( sz <= mask );
-      //Make -Wconversion happy
-      this->members_.pshort_repr()->h.length = uchar_type(uchar_type(sz) & mask);
-   }
-
-   BOOST_CONTAINER_FORCEINLINE void priv_long_size(size_type sz)
-   {
-      static const size_type mask = size_type(-1) >> 1U;
-      BOOST_ASSERT( sz <= mask );
-      //Make -Wconversion happy
-      this->members_.plong_repr()->length = sz & mask;
-   }
-   #if defined(BOOST_GCC) && (BOOST_GCC >= 40700)
-   #pragma GCC diagnostic pop
-   #endif
-
-   void swap_data(basic_string_base& other)
-   {
-      if(this->is_short()){
-         if(other.is_short()){
-            repr_t tmp(this->members_.m_repr);
-            this->members_.m_repr = other.members_.m_repr;
-            other.members_.m_repr = tmp;
-         }
-         else{
-            short_t short_backup(*this->members_.pshort_repr());
-            this->members_.pshort_repr()->~short_t();
-            ::new(this->members_.plong_repr()) long_t(*other.members_.plong_repr());
-            other.members_.plong_repr()->~long_t();
-            ::new(other.members_.pshort_repr()) short_t(short_backup);
-         }
-      }
-      else{
-         if(other.is_short()){
-            short_t short_backup(*other.members_.pshort_repr());
-            other.members_.pshort_repr()->~short_t();
-            ::new(other.members_.plong_repr()) long_t(*this->members_.plong_repr());
-            this->members_.plong_repr()->~long_t();
-            ::new(this->members_.pshort_repr()) short_t(short_backup);
-         }
-         else{
-            boost::adl_move_swap(*this->members_.plong_repr(), *other.members_.plong_repr());
-         }
-      }
-   }
-};
-
-}  //namespace dtl {
-
-#endif   //#ifndef BOOST_CONTAINER_DOXYGEN_INVOKED
-
-//! The basic_string class represents a Sequence of characters. It contains all the
-//! usual operations of a Sequence, and, additionally, it contains standard string
-//! operations such as search and concatenation.
-//!
-//! The basic_string class is parameterized by character type, and by that type's
-//! Character Traits.
-//!
-//! This class has performance characteristics very much like vector<>, meaning,
-//! for example, that it does not perform reference-count or copy-on-write, and that
-//! concatenation of two strings is an O(N) operation.
-//!
-//! Some of basic_string's member functions use an unusual method of specifying positions
-//! and ranges. In addition to the conventional method using iterators, many of
-//! basic_string's member functions use a single value pos of type size_type to represent a
-//! position (in which case the position is begin() + pos, and many of basic_string's
-//! member functions use two values, pos and n, to represent a range. In that case pos is
-//! the beginning of the range and n is its size. That is, the range is
-//! [begin() + pos, begin() + pos + n).
-//!
-//! Note that the C++ standard does not specify the complexity of basic_string operations.
-//! In this implementation, basic_string has performance characteristics very similar to
-//! those of vector: access to a single character is O(1), while copy and concatenation
-//! are O(N).
-//!
-//! In this implementation, begin(),
-//! end(), rbegin(), rend(), operator[], c_str(), and data() do not invalidate iterators.
-//! In this implementation, iterators are only invalidated by member functions that
-//! explicitly change the string's contents.
-//!
-//! \tparam CharT The type of character it contains.
-//! \tparam Traits The Character Traits type, which encapsulates basic character operations
-//! \tparam Allocator The allocator, used for internal memory management.
-#ifdef BOOST_CONTAINER_DOXYGEN_INVOKED
-template <class CharT, class Traits = std::char_traits<CharT>, class Allocator = void >
-#else
-template <class CharT, class Traits, class Allocator>
-#endif
-class basic_string
-   :  private dtl::basic_string_base<typename real_allocator<CharT, Allocator>::type>
-{
-   #ifndef BOOST_CONTAINER_DOXYGEN_INVOKED
-   private:
-   BOOST_COPYABLE_AND_MOVABLE(basic_string)
-   typedef dtl::basic_string_base<typename real_allocator<CharT, Allocator>::type> base_t;
-   typedef typename base_t::allocator_traits_type allocator_traits_type;
-   static const typename base_t::size_type InternalBufferChars = base_t::InternalBufferChars;
-
-   protected:
-   // Allocator helper class to use a char_traits as a function object.
-
-   template <class Tr>
-   struct Eq_traits
-   {
-      //Compatibility with std::binary_function
-      typedef typename Tr::char_type   first_argument_type;
-      typedef typename Tr::char_type   second_argument_type;
-      typedef bool   result_type;
-
-      bool operator()(const first_argument_type& x, const second_argument_type& y) const
-         { return Tr::eq(x, y); }
-   };
-
-   template <class Tr>
-   struct Not_within_traits
-   {
-      typedef typename Tr::char_type   argument_type;
-      typedef bool                     result_type;
-
-      typedef const typename Tr::char_type* Pointer;
-      const Pointer m_first;
-      const Pointer m_last;
-
-      Not_within_traits(Pointer f, Pointer l)
-         : m_first(f), m_last(l) {}
-
-      bool operator()(const typename Tr::char_type& x) const
-      {
-         return boost::container::find_if(m_first, m_last,
-                        boost::container::bind1st(Eq_traits<Tr>(), x)) == m_last;
-      }
-   };
-   #endif   //#ifndef BOOST_CONTAINER_DOXYGEN_INVOKED
-
-   public:
-   //////////////////////////////////////////////
-   //
-   //                    types
-   //
-   //////////////////////////////////////////////
-   typedef Traits                                                                      traits_type;
-   typedef CharT                                                                       value_type;
-   typedef typename real_allocator<CharT, Allocator>::type                             allocator_type;
-   typedef typename ::boost::container::allocator_traits<allocator_type>::pointer           pointer;
-   typedef typename ::boost::container::allocator_traits<allocator_type>::const_pointer     const_pointer;
-   typedef typename ::boost::container::allocator_traits<allocator_type>::reference         reference;
-   typedef typename ::boost::container::allocator_traits<allocator_type>::const_reference   const_reference;
-   typedef typename ::boost::container::allocator_traits<allocator_type>::size_type         size_type;
-   typedef typename ::boost::container::allocator_traits<allocator_type>::difference_type   difference_type;
-   typedef BOOST_CONTAINER_IMPDEF(allocator_type)                                      stored_allocator_type;
-   typedef BOOST_CONTAINER_IMPDEF(pointer)                                             iterator;
-   typedef BOOST_CONTAINER_IMPDEF(const_pointer)                                       const_iterator;
-   typedef BOOST_CONTAINER_IMPDEF(boost::container::reverse_iterator<iterator>)        reverse_iterator;
-   typedef BOOST_CONTAINER_IMPDEF(boost::container::reverse_iterator<const_iterator>)  const_reverse_iterator;
-   static const size_type npos = size_type(-1);
-
-   #ifndef BOOST_CONTAINER_DOXYGEN_INVOKED
-   private:
-   typedef constant_iterator<CharT> cvalue_iterator;
-   typedef typename base_t::alloc_version  alloc_version;
-   typedef ::boost::intrusive::pointer_traits<pointer> pointer_traits;
-   #endif   //#ifndef BOOST_CONTAINER_DOXYGEN_INVOKED
-
-   public:                         // Constructor, destructor, assignment.
-   //////////////////////////////////////////////
-   //
-   //          construct/copy/destroy
-   //
-   //////////////////////////////////////////////
-   #ifndef BOOST_CONTAINER_DOXYGEN_INVOKED
-   struct reserve_t {};
-
-   basic_string(reserve_t, size_type n,
-                const allocator_type& a = allocator_type())
-      //Select allocator as in copy constructor as reserve_t-based constructors
-      //are two step copies optimized for capacity
-      : base_t( allocator_traits_type::select_on_container_copy_construction(a)
-              , n + 1)
-   { this->priv_terminate_string(); }
-
-   #endif   //#ifndef BOOST_CONTAINER_DOXYGEN_INVOKED
-
-   //! <b>Effects</b>: Default constructs a basic_string.
-   //!
-   //! <b>Throws</b>: If allocator_type's default constructor throws.
-   basic_string() BOOST_NOEXCEPT_IF(dtl::is_nothrow_default_constructible<allocator_type>::value)
-      : base_t()
-   { this->priv_terminate_string(); }
-
-
-   //! <b>Effects</b>: Constructs a basic_string taking the allocator as parameter.
-   //!
-   //! <b>Throws</b>: Nothing
-   explicit basic_string(const allocator_type& a) BOOST_NOEXCEPT_OR_NOTHROW
-      : base_t(a)
-   { this->priv_terminate_string(); }
-
-   //! <b>Effects</b>: Copy constructs a basic_string.
-   //!
-   //! <b>Postcondition</b>: x == *this.
-   //!
-   //! <b>Throws</b>: If allocator_type's default constructor or allocation throws.
-   basic_string(const basic_string& s)
-      :  base_t(allocator_traits_type::select_on_container_copy_construction(s.alloc()))
-   {
-      this->priv_terminate_string();
-      this->assign(s.begin(), s.end());
-   }
-
-   //! <b>Effects</b>: Same as basic_string(sv.data(), sv.size(), a).
-   //!
-   //! <b>Throws</b>: If allocator_type's default constructor or allocation throws.
-   template<template <class, class> class BasicStringView>
-   explicit basic_string(BasicStringView<CharT, Traits> sv, const allocator_type& a = allocator_type())
-      :  base_t(allocator_traits_type::select_on_container_copy_construction(a))
-   {
-      this->priv_terminate_string();
-      this->assign(sv);
-   }
-
-   //! <b>Effects</b>: Move constructor. Moves s's resources to *this.
-   //!
-   //! <b>Throws</b>: Nothing.
-   //!
-   //! <b>Complexity</b>: Constant.
-   basic_string(BOOST_RV_REF(basic_string) s) BOOST_NOEXCEPT_OR_NOTHROW
-      : base_t(boost::move(s.alloc()))
-   {
-      if(s.alloc() == this->alloc()){
-         this->swap_data(s);
-      }
-      else{
-         this->assign(s.begin(), s.end());
-      }
-   }
-
-   //! <b>Effects</b>: Copy constructs a basic_string using the specified allocator.
-   //!
-   //! <b>Postcondition</b>: x == *this.
-   //!
-   //! <b>Throws</b>: If allocation throws.
-   basic_string(const basic_string& s, const allocator_type &a)
-      :  base_t(a)
-   {
-      this->priv_terminate_string();
-      this->assign(s.begin(), s.end());
-   }
-
-   //! <b>Effects</b>: Move constructor using the specified allocator.
-   //!                 Moves s's resources to *this.
-   //!
-   //! <b>Throws</b>: If allocation throws.
-   //!
-   //! <b>Complexity</b>: Constant if a == s.get_allocator(), linear otherwise.
-   basic_string(BOOST_RV_REF(basic_string) s, const allocator_type &a)
-      : base_t(a)
-   {
-      this->priv_terminate_string();
-      if(s.alloc() == this->alloc()){
-         this->swap_data(s);
-      }
-      else{
-         this->assign(s.begin(), s.end());
-      }
-   }
-
-   //! <b>Effects</b>: Constructs a basic_string with a default-constructed allocator,
-   //!   and is initialized by a specific number of characters of the s string.
-   basic_string(const basic_string& s, size_type pos, size_type n = npos)
-      : base_t()
-   {
-      this->priv_terminate_string();
-      if (pos > s.size())
-         throw_out_of_range("basic_string::basic_string out of range position");
-      else
-         this->assign
-            (s.begin() + pos, s.begin() + pos + dtl::min_value(n, s.size() - pos));
-   }
-
-   //! <b>Effects</b>: Constructs a basic_string taking the allocator as parameter,
-   //!   and is initialized by a specific number of characters of the s string.
-   basic_string(const basic_string& s, size_type pos, size_type n, const allocator_type& a)
-      : base_t(a)
-   {
-      this->priv_terminate_string();
-      if (pos > s.size())
-         throw_out_of_range("basic_string::basic_string out of range position");
-      else
-         this->assign
-            (s.begin() + pos, s.begin() + pos + dtl::min_value(n, s.size() - pos));
-   }
-
-   //! <b>Effects</b>: Constructs a basic_string taking a default-constructed allocator,
-   //!   and is initialized by a specific number of characters of the s c-string.
-   basic_string(const CharT* s, size_type n)
-      : base_t()
-   {
-      this->priv_terminate_string();
-      this->assign(s, s + difference_type(n));
-   }
-
-   //! <b>Effects</b>: Constructs a basic_string taking the allocator as parameter,
-   //!   and is initialized by a specific number of characters of the s c-string.
-   basic_string(const CharT* s, size_type n, const allocator_type& a)
-      : base_t(a)
-   {
-      this->priv_terminate_string();
-      this->assign(s, s + difference_type(n));
-   }
-
-   //! <b>Effects</b>: Constructs a basic_string with a default-constructed allocator,
-   //!   and is initialized by the null-terminated s c-string.
-   basic_string(const CharT* s)
-      : base_t()
-   {
-      this->priv_terminate_string();
-      this->assign(s, s + Traits::length(s));
-   }
-
-   //! <b>Effects</b>: Constructs a basic_string taking the allocator as parameter,
-   //!   and is initialized by the null-terminated s c-string.
-   basic_string(const CharT* s, const allocator_type& a)
-      : base_t(a)
-   {
-      this->priv_terminate_string();
-      this->assign(s, s + Traits::length(s));
-   }
-
-
-   //! <b>Effects</b>: Constructs a basic_string with a default-constructed allocator,
-   //!   and is initialized by n copies of c.
-   basic_string(size_type n, CharT c)
-      : base_t()
-   {
-      this->priv_terminate_string();
-      this->assign(n, c);
-   }
-
-   //! <b>Effects</b>: Constructs a basic_string taking the allocator as parameter,
-   //!   and is initialized by n copies of c.
-   basic_string(size_type n, CharT c, const allocator_type& a)
-      : base_t(a)
-   {
-      this->priv_terminate_string();
-      this->assign(n, c);
-   }
-
-   //! <b>Effects</b>: Constructs a basic_string with a default-constructed allocator,
-   //!   and is initialized by n default-initialized characters.
-   basic_string(size_type n, default_init_t)
-      : base_t(n + 1)
-   {
-      this->priv_size(n);
-      this->priv_terminate_string();
-   }
-
-   //! <b>Effects</b>: Constructs a basic_string taking the allocator as parameter,
-   //!   and is initialized by n default-initialized characters.
-   basic_string(size_type n, default_init_t, const allocator_type& a)
-      : base_t(a, n + 1)
-   {
-      this->priv_size(n);
-      this->priv_terminate_string();
-   }
-
-   //! <b>Effects</b>: Constructs a basic_string with a default-constructed allocator,
-   //!   and a range of iterators.
-   template <class InputIterator>
-   basic_string(InputIterator f, InputIterator l)
-      : base_t()
-   {
-      this->priv_terminate_string();
-      this->assign(f, l);
-   }
-
-   //! <b>Effects</b>: Constructs a basic_string taking the allocator as parameter,
-   //!   and a range of iterators.
-   template <class InputIterator>
-   basic_string(InputIterator f, InputIterator l, const allocator_type& a)
-      : base_t(a)
-   {
-      this->priv_terminate_string();
-      this->assign(f, l);
-   }
-
-   #if !defined(BOOST_NO_CXX11_HDR_INITIALIZER_LIST)
-   //! <b>Effects</b>: Same as basic_string(il.begin(), il.end(), a).
-   //!
-   basic_string(std::initializer_list<value_type> il, const allocator_type& a = allocator_type())
-      : base_t(a)
-   {
-      this->priv_terminate_string();
-      this->assign(il.begin(), il.end());
-   }
-   #endif
-
-   //! <b>Effects</b>: Destroys the basic_string. All used memory is deallocated.
-   //!
-   //! <b>Throws</b>: Nothing.
-   //!
-   //! <b>Complexity</b>: Constant.
-   ~basic_string() BOOST_NOEXCEPT_OR_NOTHROW
-   {}
-
-   //! <b>Effects</b>: Copy constructs a string.
-   //!
-   //! <b>Postcondition</b>: x == *this.
-   //!
-   //! <b>Complexity</b>: Linear to the elements x contains.
-   basic_string& operator=(BOOST_COPY_ASSIGN_REF(basic_string) x)
-   {
-      if (BOOST_LIKELY(this != &x)) {
-         allocator_type &this_alloc     = this->alloc();
-         const allocator_type &x_alloc  = x.alloc();
-         dtl::bool_<allocator_traits_type::
-            propagate_on_container_copy_assignment::value> flag;
-         if(flag && this_alloc != x_alloc){
-            if(!this->is_short()){
-               this->deallocate_block();
-               this->assure_short();
-               Traits::assign(*this->priv_addr(), CharT(0));
-               this->priv_short_size(0);
-            }
-         }
-         dtl::assign_alloc(this->alloc(), x.alloc(), flag);
-         this->assign(x.begin(), x.end());
-      }
-      return *this;
-   }
-
-   //! <b>Effects</b>: Move constructor. Moves x's resources to *this.
-   //!
-   //! <b>Throws</b>: If allocator_traits_type::propagate_on_container_move_assignment
-   //!   is false and allocation throws
-   //!
-   //! <b>Complexity</b>: Constant if allocator_traits_type::
-   //!   propagate_on_container_move_assignment is true or
-   //!   this->get>allocator() == x.get_allocator(). Linear otherwise.
-   basic_string& operator=(BOOST_RV_REF(basic_string) x)
-      BOOST_NOEXCEPT_IF(allocator_traits_type::propagate_on_container_move_assignment::value
-                                  || allocator_traits_type::is_always_equal::value)
-   {
-      if (BOOST_LIKELY(this != &x)) {
-         allocator_type &this_alloc = this->alloc();
-         allocator_type &x_alloc    = x.alloc();
-         const bool propagate_alloc = allocator_traits_type::
-               propagate_on_container_move_assignment::value;
-         dtl::bool_<propagate_alloc> flag;
-         const bool allocators_equal = this_alloc == x_alloc; (void)allocators_equal;
-         //Resources can be transferred if both allocators are
-         //going to be equal after this function (either propagated or already equal)
-         if(propagate_alloc || allocators_equal){
-            //Destroy objects but retain memory in case x reuses it in the future
-            this->clear();
-            //Move allocator if needed
-            dtl::move_alloc(this_alloc, x_alloc, flag);
-            //Nothrow swap
-            this->swap_data(x);
-         }
-         //Else do a one by one move
-         else{
-            this->assign( x.begin(), x.end());
-         }
-      }
-      return *this;
-   }
-
-   //! <b>Effects</b>: Assignment from a null-terminated c-string.
-   //!
-   basic_string& operator=(const CharT* s)
-   { return this->assign(s, s + Traits::length(s)); }
-
-   //! <b>Effects</b>: Returns *this = basic_string(1, c).
-   //!
-   basic_string& operator=(CharT c)
-   { return this->assign(static_cast<size_type>(1), c); }
-
-   //! <b>Effects</b>: Equivalent to return assign(sv).
-   //!
-   template<template <class, class> class BasicStringView>
-   basic_string& operator=(BasicStringView<CharT, Traits> sv)
-   { return this->assign(sv.data(), sv.size()); }
-
-   #if !defined(BOOST_NO_CXX11_HDR_INITIALIZER_LIST)
-   //! <b>Effects</b>: Returns *this = basic_string(il);
-   //!
-   basic_string& operator=(std::initializer_list<CharT> il)
-   {
-      return this->assign(il.begin(), il.end());
-   }
-   #endif
-
-   //! <b>Effects</b>: Returns a copy of the internal allocator.
-   //!
-   //! <b>Throws</b>: If allocator's copy constructor throws.
-   //!
-   //! <b>Complexity</b>: Constant.
-   BOOST_CONTAINER_ATTRIBUTE_NODISCARD BOOST_CONTAINER_FORCEINLINE
-      allocator_type get_allocator() const BOOST_NOEXCEPT_OR_NOTHROW
-   { return this->alloc(); }
-
-   //! <b>Effects</b>: Returns a reference to the internal allocator.
-   //!
-   //! <b>Throws</b>: Nothing
-   //!
-   //! <b>Complexity</b>: Constant.
-   //!
-   //! <b>Note</b>: Non-standard extension.
-   BOOST_CONTAINER_ATTRIBUTE_NODISCARD BOOST_CONTAINER_FORCEINLINE
-      stored_allocator_type &get_stored_allocator() BOOST_NOEXCEPT_OR_NOTHROW
-   {  return this->alloc(); }
-
-   //! <b>Effects</b>: Returns a reference to the internal allocator.
-   //!
-   //! <b>Throws</b>: Nothing
-   //!
-   //! <b>Complexity</b>: Constant.
-   //!
-   //! <b>Note</b>: Non-standard extension.
-   BOOST_CONTAINER_ATTRIBUTE_NODISCARD BOOST_CONTAINER_FORCEINLINE
-      const stored_allocator_type &get_stored_allocator() const BOOST_NOEXCEPT_OR_NOTHROW
-   {  return this->alloc(); }
-
-   //////////////////////////////////////////////
-   //
-   //                iterators
-   //
-   //////////////////////////////////////////////
-
-   //! <b>Effects</b>: Returns an iterator to the first element contained in the vector.
-   //!
-   //! <b>Throws</b>: Nothing.
-   //!
-   //! <b>Complexity</b>: Constant.
-   BOOST_CONTAINER_ATTRIBUTE_NODISCARD BOOST_CONTAINER_FORCEINLINE
-      iterator begin() BOOST_NOEXCEPT_OR_NOTHROW
-   { return this->priv_addr(); }
-
-   //! <b>Effects</b>: Returns a const_iterator to the first element contained in the vector.
-   //!
-   //! <b>Throws</b>: Nothing.
-   //!
-   //! <b>Complexity</b>: Constant.
-   BOOST_CONTAINER_ATTRIBUTE_NODISCARD BOOST_CONTAINER_FORCEINLINE
-      const_iterator begin() const BOOST_NOEXCEPT_OR_NOTHROW
-   { return this->priv_addr(); }
-
-   //! <b>Effects</b>: Returns an iterator to the end of the vector.
-   //!
-   //! <b>Throws</b>: Nothing.
-   //!
-   //! <b>Complexity</b>: Constant.
-   BOOST_CONTAINER_ATTRIBUTE_NODISCARD BOOST_CONTAINER_FORCEINLINE
-      iterator end() BOOST_NOEXCEPT_OR_NOTHROW
-   { return this->priv_end_addr(); }
-
-   //! <b>Effects</b>: Returns a const_iterator to the end of the vector.
-   //!
-   //! <b>Throws</b>: Nothing.
-   //!
-   //! <b>Complexity</b>: Constant.
-   BOOST_CONTAINER_ATTRIBUTE_NODISCARD BOOST_CONTAINER_FORCEINLINE
-      const_iterator end() const BOOST_NOEXCEPT_OR_NOTHROW
-   { return this->priv_end_addr(); }
-
-   //! <b>Effects</b>: Returns a reverse_iterator pointing to the beginning
-   //! of the reversed vector.
-   //!
-   //! <b>Throws</b>: Nothing.
-   //!
-   //! <b>Complexity</b>: Constant.
-   BOOST_CONTAINER_ATTRIBUTE_NODISCARD BOOST_CONTAINER_FORCEINLINE
-      reverse_iterator rbegin()  BOOST_NOEXCEPT_OR_NOTHROW
-   { return reverse_iterator(this->priv_end_addr()); }
-
-   //! <b>Effects</b>: Returns a const_reverse_iterator pointing to the beginning
-   //! of the reversed vector.
-   //!
-   //! <b>Throws</b>: Nothing.
-   //!
-   //! <b>Complexity</b>: Constant.
-   BOOST_CONTAINER_ATTRIBUTE_NODISCARD BOOST_CONTAINER_FORCEINLINE
-      const_reverse_iterator rbegin() const BOOST_NOEXCEPT_OR_NOTHROW
-   { return this->crbegin(); }
-
-   //! <b>Effects</b>: Returns a reverse_iterator pointing to the end
-   //! of the reversed vector.
-   //!
-   //! <b>Throws</b>: Nothing.
-   //!
-   //! <b>Complexity</b>: Constant.
-   BOOST_CONTAINER_ATTRIBUTE_NODISCARD BOOST_CONTAINER_FORCEINLINE
-      reverse_iterator rend()  BOOST_NOEXCEPT_OR_NOTHROW
-   { return reverse_iterator(this->priv_addr()); }
-
-   //! <b>Effects</b>: Returns a const_reverse_iterator pointing to the end
-   //! of the reversed vector.
-   //!
-   //! <b>Throws</b>: Nothing.
-   //!
-   //! <b>Complexity</b>: Constant.
-   BOOST_CONTAINER_ATTRIBUTE_NODISCARD BOOST_CONTAINER_FORCEINLINE
-      const_reverse_iterator rend() const BOOST_NOEXCEPT_OR_NOTHROW
-   { return this->crend(); }
-
-   //! <b>Effects</b>: Returns a const_iterator to the first element contained in the vector.
-   //!
-   //! <b>Throws</b>: Nothing.
-   //!
-   //! <b>Complexity</b>: Constant.
-   BOOST_CONTAINER_ATTRIBUTE_NODISCARD BOOST_CONTAINER_FORCEINLINE
-      const_iterator cbegin() const BOOST_NOEXCEPT_OR_NOTHROW
-   { return this->priv_addr(); }
-
-   //! <b>Effects</b>: Returns a const_iterator to the end of the vector.
-   //!
-   //! <b>Throws</b>: Nothing.
-   //!
-   //! <b>Complexity</b>: Constant.
-   BOOST_CONTAINER_ATTRIBUTE_NODISCARD BOOST_CONTAINER_FORCEINLINE
-      const_iterator cend() const BOOST_NOEXCEPT_OR_NOTHROW
-   { return this->priv_end_addr(); }
-
-   //! <b>Effects</b>: Returns a const_reverse_iterator pointing to the beginning
-   //! of the reversed vector.
-   //!
-   //! <b>Throws</b>: Nothing.
-   //!
-   //! <b>Complexity</b>: Constant.
-   BOOST_CONTAINER_ATTRIBUTE_NODISCARD BOOST_CONTAINER_FORCEINLINE
-      const_reverse_iterator crbegin() const BOOST_NOEXCEPT_OR_NOTHROW
-   { return const_reverse_iterator(this->priv_end_addr()); }
-
-   //! <b>Effects</b>: Returns a const_reverse_iterator pointing to the end
-   //! of the reversed vector.
-   //!
-   //! <b>Throws</b>: Nothing.
-   //!
-   //! <b>Complexity</b>: Constant.
-   BOOST_CONTAINER_ATTRIBUTE_NODISCARD BOOST_CONTAINER_FORCEINLINE
-      const_reverse_iterator crend() const BOOST_NOEXCEPT_OR_NOTHROW
-   { return const_reverse_iterator(this->priv_addr()); }
-
-   //////////////////////////////////////////////
-   //
-   //                capacity
-   //
-   //////////////////////////////////////////////
-
-   //! <b>Effects</b>: Returns true if the vector contains no elements.
-   //!
-   //! <b>Throws</b>: Nothing.
-   //!
-   //! <b>Complexity</b>: Constant.
-   BOOST_CONTAINER_ATTRIBUTE_NODISCARD BOOST_CONTAINER_FORCEINLINE
-      bool empty() const BOOST_NOEXCEPT_OR_NOTHROW
-   { return !this->priv_size(); }
-
-   //! <b>Effects</b>: Returns the number of the elements contained in the vector.
-   //!
-   //! <b>Throws</b>: Nothing.
-   //!
-   //! <b>Complexity</b>: Constant.
-   BOOST_CONTAINER_ATTRIBUTE_NODISCARD BOOST_CONTAINER_FORCEINLINE
-      size_type size() const    BOOST_NOEXCEPT_OR_NOTHROW
-   { return this->priv_size(); }
-
-   //! <b>Effects</b>: Returns the number of the elements contained in the vector.
-   //!
-   //! <b>Throws</b>: Nothing.
-   //!
-   //! <b>Complexity</b>: Constant.
-   BOOST_CONTAINER_ATTRIBUTE_NODISCARD BOOST_CONTAINER_FORCEINLINE
-      size_type length() const BOOST_NOEXCEPT_OR_NOTHROW
-   { return this->size(); }
-
-   //! <b>Effects</b>: Returns the largest possible size of the vector.
-   //!
-   //! <b>Throws</b>: Nothing.
-   //!
-   //! <b>Complexity</b>: Constant
-   BOOST_CONTAINER_ATTRIBUTE_NODISCARD BOOST_CONTAINER_FORCEINLINE
-      size_type max_size() const BOOST_NOEXCEPT_OR_NOTHROW
-   { return base_t::max_size(); }
-
-   //! <b>Effects</b>: Inserts or erases elements at the end such that
-   //!   the size becomes n. New elements are copy constructed from x.
-   //!
-   //! <b>Throws</b>: If memory allocation throws
-   //!
-   //! <b>Complexity</b>: Linear to the difference between size() and new_size.
-   void resize(size_type n, CharT c)
-   {
-      if (n <= this->size())
-         this->erase(this->begin() + difference_type(n), this->end());
-      else
-         this->append(n - this->size(), c);
-   }
-
-   //! <b>Effects</b>: Inserts or erases elements at the end such that
-   //!   the size becomes n. New elements are value initialized.
-   //!
-   //! <b>Throws</b>: If memory allocation throws
-   //!
-   //! <b>Complexity</b>: Linear to the difference between size() and new_size.
-   void resize(size_type n)
-   { resize(n, CharT()); }
-
-   //! <b>Effects</b>: Inserts or erases elements at the end such that
-   //!   the size becomes n. New elements are uninitialized.
-   //!
-   //! <b>Throws</b>: If memory allocation throws
-   //!
-   //! <b>Complexity</b>: Linear to the difference between size() and new_size.
-   //!
-   //! <b>Note</b>: Non-standard extension
-   void resize(size_type n, default_init_t)
-   {
-      if (n <= this->size())
-         this->erase(this->begin() + difference_type(n), this->end());
-      else{
-         this->priv_reserve(n, false);
-         this->priv_size(n);
-         this->priv_terminate_string();
-      }
-   }
-
-   //! <b>Effects</b>: Number of elements for which memory has been allocated.
-   //!   capacity() is always greater than or equal to size().
-   //!
-   //! <b>Throws</b>: Nothing.
-   //!
-   //! <b>Complexity</b>: Constant.
-   BOOST_CONTAINER_ATTRIBUTE_NODISCARD BOOST_CONTAINER_FORCEINLINE
-      size_type capacity() const BOOST_NOEXCEPT_OR_NOTHROW
-   { return this->priv_capacity(); }
-
-   //! <b>Effects</b>: If n is less than or equal to capacity(), this call has no
-   //!   effect. Otherwise, it is a request for allocation of additional memory.
-   //!   If the request is successful, then capacity() is greater than or equal to
-   //!   n; otherwise, capacity() is unchanged. In either case, size() is unchanged.
-   //!
-   //! <b>Throws</b>: If memory allocation allocation throws
-   void reserve(size_type res_arg)
-   {  this->priv_reserve(res_arg);  }
-
-   //! <b>Effects</b>: Tries to deallocate the excess of memory created
-   //!   with previous allocations. The size of the string is unchanged
-   //!
-   //! <b>Throws</b>: Nothing
-   //!
-   //! <b>Complexity</b>: Linear to size().
-   void shrink_to_fit()
-   {
-      //Check if shrinking is possible
-      if(this->priv_storage() > InternalBufferChars){
-         //Check if we should pass from dynamically allocated buffer
-         //to the internal storage
-         if(this->priv_size() < InternalBufferChars){
-            //Dynamically allocated buffer attributes
-            pointer   long_addr    = this->priv_long_addr();
-            size_type long_storage = this->priv_long_storage();
-            size_type long_size    = this->priv_long_size();
-            //Shrink from allocated buffer to the internal one, including trailing null
-            Traits::copy( boost::movelib::to_raw_pointer(this->priv_short_addr())
-                        , boost::movelib::to_raw_pointer(long_addr)
-                        , long_size+1);
-            BOOST_ASSERT(!this->is_short());
-            this->destroy_long();
-            this->construct_short();
-            this->alloc().deallocate(long_addr, long_storage);
-         }
-         else{
-            //Shrinking in dynamic buffer
-            this->priv_shrink_to_fit_dynamic_buffer(alloc_version());
-         }
-      }
-   }
-
-   //////////////////////////////////////////////
-   //
-   //               element access
-   //
-   //////////////////////////////////////////////
-
-   //! <b>Requires</b>: !empty()
-   //!
-   //! <b>Effects</b>: Returns a reference to the first
-   //!   element of the container.
-   //!
-   //! <b>Throws</b>: Nothing.
-   //!
-   //! <b>Complexity</b>: Constant.
-   BOOST_CONTAINER_ATTRIBUTE_NODISCARD BOOST_CONTAINER_FORCEINLINE
-      reference         front() BOOST_NOEXCEPT_OR_NOTHROW
-   {
-      BOOST_ASSERT(!this->empty());
-      return *this->priv_addr();
-   }
-
-   //! <b>Requires</b>: !empty()
-   //!
-   //! <b>Effects</b>: Returns a const reference to the first
-   //!   element of the container.
-   //!
-   //! <b>Throws</b>: Nothing.
-   //!
-   //! <b>Complexity</b>: Constant.
-   BOOST_CONTAINER_ATTRIBUTE_NODISCARD BOOST_CONTAINER_FORCEINLINE
-      const_reference   front() const BOOST_NOEXCEPT_OR_NOTHROW
-   {
-      BOOST_ASSERT(!this->empty());
-      return *this->priv_addr();
-   }
-
-   //! <b>Requires</b>: !empty()
-   //!
-   //! <b>Effects</b>: Returns a reference to the last
-   //!   element of the container.
-   //!
-   //! <b>Throws</b>: Nothing.
-   //!
-   //! <b>Complexity</b>: Constant.
-   BOOST_CONTAINER_ATTRIBUTE_NODISCARD BOOST_CONTAINER_FORCEINLINE
-      reference         back() BOOST_NOEXCEPT_OR_NOTHROW
-   {
-      BOOST_ASSERT(!this->empty());
-      return *(this->priv_addr() + (this->size() - 1u) );
-   }
-
-   //! <b>Requires</b>: !empty()
-   //!
-   //! <b>Effects</b>: Returns a const reference to the last
-   //!   element of the container.
-   //!
-   //! <b>Throws</b>: Nothing.
-   //!
-   //! <b>Complexity</b>: Constant.
-   BOOST_CONTAINER_ATTRIBUTE_NODISCARD BOOST_CONTAINER_FORCEINLINE
-      const_reference   back()  const BOOST_NOEXCEPT_OR_NOTHROW
-   {
-      BOOST_ASSERT(!this->empty());
-      return *(this->priv_addr() + (this->size() - 1u) );
-   }
-
-   //! <b>Requires</b>: size() > n.
-   //!
-   //! <b>Effects</b>: Returns a reference to the nth element
-   //!   from the beginning of the container.
-   //!
-   //! <b>Throws</b>: Nothing.
-   //!
-   //! <b>Complexity</b>: Constant.
-   BOOST_CONTAINER_ATTRIBUTE_NODISCARD BOOST_CONTAINER_FORCEINLINE
-      reference operator[](size_type n) BOOST_NOEXCEPT_OR_NOTHROW
-   {
-      BOOST_ASSERT(this->size() > n);
-      return *(this->priv_addr() + difference_type(n));
-   }
-
-   //! <b>Requires</b>: size() > n.
-   //!
-   //! <b>Effects</b>: Returns a const reference to the nth element
-   //!   from the beginning of the container.
-   //!
-   //! <b>Throws</b>: Nothing.
-   //!
-   //! <b>Complexity</b>: Constant.
-   BOOST_CONTAINER_ATTRIBUTE_NODISCARD BOOST_CONTAINER_FORCEINLINE
-      const_reference operator[](size_type n) const BOOST_NOEXCEPT_OR_NOTHROW
-   {
-      BOOST_ASSERT(this->size() > n);
-      return *(this->priv_addr() + difference_type(n));
-   }
-
-   //! <b>Requires</b>: size() > n.
-   //!
-   //! <b>Effects</b>: Returns a reference to the nth element
-   //!   from the beginning of the container.
-   //!
-   //! <b>Throws</b>: range_error if n >= size()
-   //!
-   //! <b>Complexity</b>: Constant.
-   BOOST_CONTAINER_ATTRIBUTE_NODISCARD BOOST_CONTAINER_FORCEINLINE
-      reference at(size_type n)
-   {
-      if (n >= this->size())
-         throw_out_of_range("basic_string::at invalid subscript");
-      return *(this->priv_addr() + difference_type(n));
-   }
-
-   //! <b>Requires</b>: size() > n.
-   //!
-   //! <b>Effects</b>: Returns a const reference to the nth element
-   //!   from the beginning of the container.
-   //!
-   //! <b>Throws</b>: range_error if n >= size()
-   //!
-   //! <b>Complexity</b>: Constant.
-   BOOST_CONTAINER_ATTRIBUTE_NODISCARD BOOST_CONTAINER_FORCEINLINE
-      const_reference at(size_type n) const {
-      if (n >= this->size())
-         throw_out_of_range("basic_string::at invalid subscript");
-      return *(this->priv_addr() + difference_type(n));
-   }
-
-   //////////////////////////////////////////////
-   //
-   //                modifiers
-   //
-   //////////////////////////////////////////////
-
-   //! <b>Effects</b>: Calls append(str.data, str.size()).
-   //!
-   //! <b>Returns</b>: *this
-   basic_string& operator+=(const basic_string& s)
-   {  return this->append(s); }
-
-   //! <b>Effects</b>: Same as `return append(sv)`.
-   //!
-   template<template<class, class> class BasicStringView>
-   basic_string& operator+=(BasicStringView<CharT, Traits> sv)
-   {
-      return this->append(sv);
-   }
-
-   //! <b>Effects</b>: Calls append(s).
-   //!
-   //! <b>Returns</b>: *this
-   basic_string& operator+=(const CharT* s)
-   {  return this->append(s); }
-
-   //! <b>Effects</b>: Calls append(1, c).
-   //!
-   //! <b>Returns</b>: *this
-   basic_string& operator+=(CharT c)
-   {  this->push_back(c); return *this;   }
-
-   #if !defined(BOOST_NO_CXX11_HDR_INITIALIZER_LIST)
-   //! <b>Effects</b>: Returns append(il)
-   //!
-   basic_string& operator+=(std::initializer_list<CharT> il)
-   {
-      return this->append(il);
-   }
-   #endif
-
-   //! <b>Effects</b>: Calls append(str.data(), str.size()).
-   //!
-   //! <b>Returns</b>: *this
-   basic_string& append(const basic_string& s)
-   {  return this->append(s.begin(), s.end());  }
-
-   //! <b>Effects</b>: Same as return append(sv.data(), sv.size()).
-   //!
-   template<template<class, class> class BasicStringView>
-   basic_string& append(BasicStringView<CharT, Traits> sv)
-   {  return this->append(sv.data(), sv.size());  }
-
-   //! <b>Requires</b>: pos <= str.size()
-   //!
-   //! <b>Effects</b>: Determines the effective length rlen of the string to append
-   //! as the smaller of n and str.size() - pos and calls append(str.data() + pos, rlen).
-   //!
-   //! <b>Throws</b>: If memory allocation throws and out_of_range if pos > str.size()
-   //!
-   //! <b>Returns</b>: *this
-   basic_string& append(const basic_string& s, size_type pos, size_type n = npos)
-   {
-      if (pos > s.size())
-         throw_out_of_range("basic_string::append out of range position");
-      return this->append(s.begin() + pos,
-                          s.begin() + pos + dtl::min_value(n, s.size() - pos));
-   }
-
-   //! <b>Requires</b>: s points to an array of at least n elements of CharT.
-   //!
-   //! <b>Effects</b>: The function replaces the string controlled by *this with
-   //!   a string of length size() + n whose irst size() elements are a copy of the
-   //!   original string controlled by *this and whose remaining
-   //!   elements are a copy of the initial n elements of s.
-   //!
-   //! <b>Throws</b>: If memory allocation throws length_error if size() + n > max_size().
-   //!
-   //! <b>Returns</b>: *this
-   basic_string& append(const CharT* s, size_type n)
-   {  return this->append(s, s + difference_type(n));  }
-
-   //! <b>Requires</b>: s points to an array of at least traits::length(s) + 1 elements of CharT.
-   //!
-   //! <b>Effects</b>: Calls append(s, traits::length(s)).
-   //!
-   //! <b>Returns</b>: *this
-   basic_string& append(const CharT* s)
-   {  return this->append(s, s + Traits::length(s));  }
-
-   //! <b>Effects</b>: Equivalent to append(basic_string(n, c)).
-   //!
-   //! <b>Returns</b>: *this
-   basic_string& append(size_type n, CharT c)
-   {  return this->append(cvalue_iterator(c, n), cvalue_iterator()); }
-
-   //! <b>Requires</b>: [first,last) is a valid range.
-   //!
-   //! <b>Effects</b>: Equivalent to append(basic_string(first, last)).
-   //!
-   //! <b>Returns</b>: *this
-   template <class InputIter>
-   basic_string& append(InputIter first, InputIter last)
-   {  this->insert(this->end(), first, last);   return *this;  }
-
-   #if !defined(BOOST_NO_CXX11_HDR_INITIALIZER_LIST)
-   //! <b>Effects</b>: Returns append(il.begin(), il.size()).
-   //!
-   basic_string& append(std::initializer_list<CharT> il)
-   {
-      return this->append(il.begin(), il.size());
-   }
-   #endif
-
-   //! <b>Effects</b>: Equivalent to append(static_cast<size_type>(1), c).
-   //!
-   void push_back(CharT c)
-   {
-      const size_type old_size = this->priv_size();
-      if (old_size < this->capacity()){
-         const pointer addr = this->priv_addr();
-         this->priv_construct_null(addr + difference_type(old_size + 1u));
-         Traits::assign(addr[difference_type(old_size)], c);
-         this->priv_size(old_size+1u);
-      }
-      else{
-         //No enough memory, insert a new object at the end
-         this->append(size_type(1), c);
-      }
-   }
-
-   //! <b>Effects</b>: Equivalent to assign(str, 0, npos).
-   //!
-   //! <b>Returns</b>: *this
-   basic_string& assign(const basic_string& s)
-   {  return this->operator=(s); }
-
-   //! <b>Effects</b>: Equivalent to return assign(sv.data(), sv.size()).
-   //!
-   //! <b>Returns</b>: *this
-   template<template <class, class> class BasicStringView>
-   basic_string& assign(BasicStringView<CharT, Traits> sv)
-   {  return this->operator=(sv); }
-
-   //! <b>Effects</b>: The function replaces the string controlled by *this
-   //!    with a string of length str.size() whose elements are a copy of the string
-   //!   controlled by str. Leaves str in a valid but unspecified state.
-   //!
-   //! <b>Throws</b>: Nothing
-   //!
-   //! <b>Returns</b>: *this
-   basic_string& assign(BOOST_RV_REF(basic_string) ms) BOOST_NOEXCEPT_OR_NOTHROW
-   {  return this->swap_data(ms), *this;  }
-
-   //! <b>Requires</b>: pos <= str.size()
-   //!
-   //! <b>Effects</b>: Determines the effective length rlen of the string to assign as
-   //!   the smaller of n and str.size() - pos and calls assign(str.data() + pos rlen).
-   //!
-   //! <b>Throws</b>: If memory allocation throws or out_of_range if pos > str.size().
-   //!
-   //! <b>Returns</b>: *this
-   basic_string& assign(const basic_string& s, size_type pos, size_type n)
-   {
-      if (pos > s.size())
-         throw_out_of_range("basic_string::assign out of range position");
-      return this->assign(s.begin() + pos,
-                          s.begin() + pos + dtl::min_value(n, s.size() - pos));
-   }
-
-   //! <b>Requires</b>: s points to an array of at least n elements of CharT.
-   //!
-   //! <b>Effects</b>: Replaces the string controlled by *this with a string of
-   //! length n whose elements are a copy of those pointed to by s.
-   //!
-   //! <b>Throws</b>: If memory allocation throws or length_error if n > max_size().
-   //!
-   //! <b>Returns</b>: *this
-   basic_string& assign(const CharT* s, size_type n)
-   {  return this->assign(s, s + difference_type(n));   }
-
-   //! <b>Requires</b>: s points to an array of at least traits::length(s) + 1 elements of CharT.
-   //!
-   //! <b>Effects</b>: Calls assign(s, traits::length(s)).
-   //!
-   //! <b>Returns</b>: *this
-   basic_string& assign(const CharT* s)
-   { return this->assign(s, s + Traits::length(s)); }
-
-   //! <b>Effects</b>: Equivalent to assign(basic_string(n, c)).
-   //!
-   //! <b>Returns</b>: *this
-   basic_string& assign(size_type n, CharT c)
-   {  return this->assign(cvalue_iterator(c, n), cvalue_iterator()); }
-
-   //! <b>Effects</b>: Equivalent to assign(basic_string(first, last)).
-    //!
-    //! <b>Returns</b>: *this
-    basic_string& assign(const CharT* first, const CharT* last)
-    {
-       size_type n = static_cast<size_type>(last - first);
-       this->reserve(n);
-       CharT* ptr = boost::movelib::to_raw_pointer(this->priv_addr());
-       Traits::copy(ptr, first, n);
-       this->priv_construct_null(ptr + difference_type(n));
-       this->priv_size(n);
-       return *this;
-    }
-
-   //! <b>Effects</b>: Equivalent to assign(basic_string(first, last)).
-   //!
-   //! <b>Returns</b>: *this
-   template <class InputIter>
-   basic_string& assign(InputIter first, InputIter last
-      #if !defined(BOOST_CONTAINER_DOXYGEN_INVOKED)
-      , typename dtl::disable_if_convertible<InputIter, size_type>::type * = 0
-      #endif
-      )
-   {
-      size_type cur = 0;
-      const pointer addr = this->priv_addr();
-      CharT *ptr = boost::movelib::to_raw_pointer(addr);
-      const size_type old_size = this->priv_size();
-      while (first != last && cur != old_size) {
-         Traits::assign(*ptr, *first);
-         ++first;
-         ++cur;
-         ++ptr;
-      }
-      if (first == last)
-         this->erase(addr + difference_type(cur), addr + difference_type(old_size));
-      else
-         this->append(first, last);
-      return *this;
-   }
-
-   #if !defined(BOOST_NO_CXX11_HDR_INITIALIZER_LIST)
-   //! <b>Effects</b>: Returns assign(il.begin(), il.size()).
-   //!
-   basic_string& assign(std::initializer_list<CharT> il)
-   {
-      return this->assign(il.begin(), il.size());
-   }
-   #endif
-
-   //! <b>Requires</b>: pos <= size().
-   //!
-   //! <b>Effects</b>: Calls insert(pos, str.data(), str.size()).
-   //!
-   //! <b>Throws</b>: If memory allocation throws or out_of_range if pos > size().
-   //!
-   //! <b>Returns</b>: *this
-   basic_string& insert(size_type pos, const basic_string& s)
-   {
-      const size_type sz = this->size();
-      if (pos > sz)
-         throw_out_of_range("basic_string::insert out of range position");
-      if (sz > this->max_size() - s.size())
-         throw_length_error("basic_string::insert max_size() exceeded");
-      this->insert(this->priv_addr() + pos, s.begin(), s.end());
-      return *this;
-   }
-
-   //! <b>Requires</b>: pos1 <= size() and pos2 <= str.size()
-   //!
-   //! <b>Effects</b>: Determines the effective length rlen of the string to insert as
-   //!   the smaller of n and str.size() - pos2 and calls insert(pos1, str.data() + pos2, rlen).
-   //!
-   //! <b>Throws</b>: If memory allocation throws or out_of_range if pos1 > size() or pos2 > str.size().
-   //!
-   //! <b>Returns</b>: *this
-   basic_string& insert(size_type pos1, const basic_string& s, size_type pos2, size_type n = npos)
-   {
-      const size_type sz = this->size();
-      const size_type str_size = s.size();
-      if (pos1 > sz || pos2 > str_size)
-         throw_out_of_range("basic_string::insert out of range position");
-      size_type len = dtl::min_value(n, str_size - pos2);
-      if (sz > this->max_size() - len)
-         throw_length_error("basic_string::insert max_size() exceeded");
-      const CharT *beg_ptr = boost::movelib::to_raw_pointer(s.begin()) + pos2;
-      const CharT *end_ptr = beg_ptr + len;
-      this->insert(this->priv_addr() + pos1, beg_ptr, end_ptr);
-      return *this;
-   }
-
-   //! <b>Requires</b>: s points to an array of at least n elements of CharT and pos <= size().
-   //!
-   //! <b>Effects</b>: Replaces the string controlled by *this with a string of length size() + n
-   //!   whose first pos elements are a copy of the initial elements of the original string
-   //!   controlled by *this and whose next n elements are a copy of the elements in s and whose
-   //!   remaining elements are a copy of the remaining elements of the original string controlled by *this.
-   //!
-   //! <b>Throws</b>: If memory allocation throws, out_of_range if pos > size() or
-   //!   length_error if size() + n > max_size().
-   //!
-   //! <b>Returns</b>: *this
-   basic_string& insert(size_type pos, const CharT* s, size_type n)
-   {
-      if (pos > this->size())
-         throw_out_of_range("basic_string::insert out of range position");
-      if (this->size() > this->max_size() - n)
-         throw_length_error("basic_string::insert max_size() exceeded");
-      this->insert(this->priv_addr() + pos, s, s + difference_type(n));
-      return *this;
-   }
-
-   //! <b>Requires</b>: pos <= size() and s points to an array of at least traits::length(s) + 1 elements of CharT
-   //!
-   //! <b>Effects</b>: Calls insert(pos, s, traits::length(s)).
-   //!
-   //! <b>Throws</b>: If memory allocation throws, out_of_range if pos > size()
-   //!   length_error if size() > max_size() - Traits::length(s)
-   //!
-   //! <b>Returns</b>: *this
-   basic_string& insert(size_type pos, const CharT* s)
-   {
-      if (pos > this->size())
-         throw_out_of_range("basic_string::insert out of range position");
-      size_type len = Traits::length(s);
-      if (this->size() > this->max_size() - len)
-         throw_length_error("basic_string::insert max_size() exceeded");
-      this->insert(this->priv_addr() + pos, s, s + len);
-      return *this;
-   }
-
-   //! <b>Effects</b>: Equivalent to insert(pos, basic_string(n, c)).
-   //!
-   //! <b>Throws</b>: If memory allocation throws, out_of_range if pos > size()
-   //!   length_error if size() > max_size() - n
-   //!
-   //! <b>Returns</b>: *this
-   basic_string& insert(size_type pos, size_type n, CharT c)
-   {
-      if (pos > this->size())
-         throw_out_of_range("basic_string::insert out of range position");
-      if (this->size() > this->max_size() - n)
-         throw_length_error("basic_string::insert max_size() exceeded");
-      this->insert(const_iterator(this->priv_addr() + pos), n, c);
-      return *this;
-   }
-
-   //! <b>Effects</b>: Same as `return insert(pos, sv.data(), sv.size())`.
-   //!
-   template<template<class, class> class BasicStringView>
-   basic_string& insert(size_type pos, BasicStringView<CharT, Traits> sv)
-   {  return this->insert(pos, sv.data(), sv.size());  }
-
-   //! <b>Requires</b>: p is a valid iterator on *this.
-   //!
-   //! <b>Effects</b>: inserts a copy of c before the character referred to by p.
-   //!
-   //! <b>Returns</b>: An iterator which refers to the copy of the inserted character.
-   iterator insert(const_iterator p, CharT c)
-   {
-      size_type new_offset = size_type(p - this->priv_addr());
-      this->insert(p, cvalue_iterator(c, 1), cvalue_iterator());
-      return this->priv_addr() + new_offset;
-   }
-
-   //! <b>Requires</b>: p is a valid iterator on *this.
-   //!
-   //! <b>Effects</b>: Inserts n copies of c before the character referred to by p.
-   //!
-   //! <b>Returns</b>: an iterator to the first inserted element or p if n is 0.
-   iterator insert(const_iterator p, size_type n, CharT c)
-   {  return this->insert(p, cvalue_iterator(c, n), cvalue_iterator());  }
-
-   //! <b>Requires</b>: p is a valid iterator on *this. [first,last) is a valid range.
-   //!
-   //! <b>Effects</b>: Equivalent to insert(p - begin(), basic_string(first, last)).
-   //!
-   //! <b>Returns</b>: an iterator to the first inserted element or p if first == last.
-   template <class InputIter>
-   iterator insert(const_iterator p, InputIter first, InputIter last
-      #if !defined(BOOST_CONTAINER_DOXYGEN_INVOKED)
-      , typename dtl::disable_if_or
-         < void
-         , dtl::is_convertible<InputIter, size_type>
-         , dtl::is_not_input_iterator<InputIter>
-         >::type * = 0
-      #endif
-      )
-   {
-      const size_type n_pos = p - this->cbegin();
-      for ( ; first != last; ++first, ++p) {
-         p = this->insert(p, *first);
-      }
-      return this->begin() + difference_type(n_pos);
-   }
-
-   #if !defined(BOOST_CONTAINER_DOXYGEN_INVOKED)
-   template <class ForwardIter>
-   iterator insert(const_iterator p, ForwardIter first, ForwardIter last
-      , typename dtl::disable_if_or
-         < void
-         , dtl::is_convertible<ForwardIter, size_type>
-         , dtl::is_input_iterator<ForwardIter>
-         >::type * = 0
-      )
-   {
-      const size_type n_pos = size_type(p - this->cbegin());
-      if (first != last) {
-         const size_type n = boost::container::iterator_udistance(first, last);
-         const size_type old_size = this->priv_size();
-         const size_type remaining = this->capacity() - old_size;
-         const pointer old_start = this->priv_addr();
-         bool enough_capacity = false;
-         size_type new_cap = 0;
-
-         //Check if we have enough capacity
-         pointer hint = pointer();
-         pointer allocation_ret = pointer();
-         if (remaining >= n){
-            enough_capacity = true;
-         }
-         else {
-            //Otherwise expand current buffer or allocate new storage
-            new_cap  = this->next_capacity(n);
-            hint = old_start;
-            allocation_ret = this->allocation_command
-                  (allocate_new | expand_fwd | expand_bwd, old_size + n + 1u, new_cap, hint);
-
-            //Check forward expansion
-            if(old_start == allocation_ret){
-               enough_capacity = true;
-               this->priv_storage(new_cap);
-            }
-         }
-
-         //Reuse same buffer
-         if(enough_capacity){
-            const size_type elems_after = old_size - size_type(p - old_start);
-            const size_type old_length = old_size;
-            size_type new_size = 0;
-            if (elems_after >= n) {
-               const pointer pointer_past_last = old_start + difference_type(old_size + 1u);
-               priv_uninitialized_copy(old_start + difference_type(old_size - n + 1u),
-                                       pointer_past_last, pointer_past_last);
-
-               Traits::move(const_cast<CharT*>(boost::movelib::to_raw_pointer(p + difference_type(n))),
-                           boost::movelib::to_raw_pointer(p),
-                           (elems_after - n) + 1u);
-               (priv_copy)(first, last, const_cast<CharT*>(boost::movelib::to_raw_pointer(p)));
-               new_size = old_size + n;
-            }
-            else {
-               ForwardIter mid = first;
-               boost::container::iterator_uadvance(mid, elems_after + 1u);
-
-               priv_uninitialized_copy(mid, last, old_start + difference_type(old_size + 1u));
-               const size_type newer_size = old_size + (n - elems_after);
-               this->priv_size(newer_size);
-               priv_uninitialized_copy
-                  (p, const_iterator(old_start + difference_type(old_length + 1u)),
-                  old_start + difference_type(newer_size));
-               (priv_copy)(first, mid, const_cast<CharT*>(boost::movelib::to_raw_pointer(p)));
-               new_size = newer_size + elems_after;
-            }
-            this->priv_size(new_size);
-            this->priv_construct_null(old_start + difference_type(new_size));
-         }
-         else{
-            pointer new_start = allocation_ret;
-            if(!hint){
-               //Copy data to new buffer
-               size_type new_length = 0;
-               //This can't throw, since characters are POD
-               new_length += priv_uninitialized_copy
-                              (const_iterator(old_start), p, new_start);
-               new_length += priv_uninitialized_copy
-                              (first, last, new_start + difference_type(new_length));
-               new_length += priv_uninitialized_copy
-                              (p, const_iterator(old_start + difference_type(old_size)),
-                              new_start + difference_type(new_length));
-               this->priv_construct_null(new_start + difference_type(new_length));
-
-               this->deallocate_block();
-               this->assure_long();
-               this->priv_long_addr(new_start);
-               this->priv_long_size(new_length);
-               this->priv_long_storage(new_cap);
-            }
-            else{
-               //value_type is POD, so backwards expansion is much easier
-               //than with vector<T>
-               value_type * const oldbuf     = boost::movelib::to_raw_pointer(old_start);
-               value_type * const newbuf     = boost::movelib::to_raw_pointer(new_start);
-               const value_type *const pos   = boost::movelib::to_raw_pointer(p);
-               const size_type before  = size_type(pos - oldbuf);
-
-               //First move old data
-               Traits::move(newbuf, oldbuf, before);
-               Traits::move(newbuf + difference_type(before + n), pos, old_size - before);
-               //Now initialize the new data
-               priv_uninitialized_copy(first, last, new_start + difference_type(before));
-               this->priv_construct_null(new_start + difference_type(old_size + n));
-               this->assure_long();
-               this->priv_long_addr(new_start);
-               this->priv_long_size(old_size + n);
-               this->priv_long_storage(new_cap);
-            }
-         }
-      }
-      return this->begin() + difference_type(n_pos);
-   }
-   #endif
-
-   #if !defined(BOOST_NO_CXX11_HDR_INITIALIZER_LIST)
-   //! <b>Effects</b>: As if by insert(p, il.begin(), il.end()).
-   //!
-   //! <b>Returns</b>: An iterator which refers to the copy of the first inserted
-   //!   character, or p if i1 is empty.
-   BOOST_CONTAINER_FORCEINLINE iterator insert(const_iterator p, std::initializer_list<CharT> il)
-   {
-      return this->insert(p, il.begin(), il.end());
-   }
-   #endif
-
-   //! <b>Effects</b>: Removes the last element from the container.
-   //!
-   //! <b>Throws</b>: Nothing.
-   //!
-   //! <b>Complexity</b>: Constant time.
-   void pop_back() BOOST_NOEXCEPT_OR_NOTHROW
-   {
-      BOOST_ASSERT(!this->empty());
-      iterator p = this->end();
-      this->erase(--p);
-   }
-
-   //! <b>Requires</b>: pos <= size()
-   //!
-   //! <b>Effects</b>: Determines the effective length xlen of the string to be removed as the smaller of n and size() - pos.
-   //!   The function then replaces the string controlled by *this with a string of length size() - xlen
-   //!   whose first pos elements are a copy of the initial elements of the original string controlled by *this,
-   //!   and whose remaining elements are a copy of the elements of the original string controlled by *this
-   //!   beginning at position pos + xlen.
-   //!
-   //! <b>Throws</b>: out_of_range if pos > size().
-   //!
-   //! <b>Returns</b>: *this
-   basic_string& erase(size_type pos = 0, size_type n = npos)
-   {
-      if (pos > this->size())
-         throw_out_of_range("basic_string::erase out of range position");
-      const pointer addr = this->priv_addr();
-      erase(addr + difference_type(pos), addr + difference_type(pos) + dtl::min_value(n, this->size() - pos));
-      return *this;
-   }
-
-   //! <b>Effects</b>: Removes the character referred to by p.
-   //!
-   //! <b>Throws</b>: Nothing
-   //!
-   //! <b>Returns</b>: An iterator which points to the element immediately following p prior to the element being
-   //!    erased. If no such element exists, end() is returned.
-   iterator erase(const_iterator p) BOOST_NOEXCEPT_OR_NOTHROW
-   {
-      // The move includes the terminating null.
-      CharT * const ptr = const_cast<CharT*>(boost::movelib::to_raw_pointer(p));
-      const size_type old_size = this->priv_size();
-      Traits::move(ptr,
-                   boost::movelib::to_raw_pointer(p + 1),
-                   old_size - size_type(p - this->priv_addr()));
-      this->priv_size(old_size-1u);
-      return iterator(ptr);
-   }
-
-   //! <b>Requires</b>: first and last are valid iterators on *this, defining a range [first,last).
-   //!
-   //! <b>Effects</b>: Removes the characters in the range [first,last).
-   //!
-   //! <b>Throws</b>: Nothing
-   //!
-   //! <b>Returns</b>: An iterator which points to the element pointed to by last prior to
-   //!   the other elements being erased. If no such element exists, end() is returned.
-   iterator erase(const_iterator first, const_iterator last) BOOST_NOEXCEPT_OR_NOTHROW
-   {
-      CharT * f = const_cast<CharT*>(boost::movelib::to_raw_pointer(first));
-      if (first != last) { // The move includes the terminating null.
-         const size_type num_erased = size_type(last - first);
-         const size_type old_size = this->priv_size();
-         Traits::move(f,
-                      boost::movelib::to_raw_pointer(last),
-                      old_size + 1u - size_type(last - this->priv_addr()));
-         const size_type new_length = old_size - num_erased;
-         this->priv_size(new_length);
-      }
-      return iterator(f);
-   }
-
-   //! <b>Effects</b>: Erases all the elements of the vector.
-   //!
-   //! <b>Throws</b>: Nothing.
-   //!
-   //! <b>Complexity</b>: Linear to the number of elements in the vector.
-   void clear() BOOST_NOEXCEPT_OR_NOTHROW
-   {
-       if(this->is_short()) {
-           Traits::assign(*this->priv_short_addr(), CharT(0));
-           this->priv_short_size(0);
-       }
-       else {
-           Traits::assign(*this->priv_long_addr(), CharT(0));
-           this->priv_long_size(0);
-       }
-   }
-
-   //! <b>Requires</b>: pos1 <= size().
-   //!
-   //! <b>Effects</b>: Calls replace(pos1, n1, str.data(), str.size()).
-   //!
-   //! <b>Throws</b>: if memory allocation throws or out_of_range if pos1 > size().
-   //!
-   //! <b>Returns</b>: *this
-   basic_string& replace(size_type pos1, size_type n1, const basic_string& str)
-   {
-      if (pos1 > this->size())
-         throw_out_of_range("basic_string::replace out of range position");
-      const size_type len = dtl::min_value(n1, this->size() - pos1);
-      if (this->size() - len >= this->max_size() - str.size())
-         throw_length_error("basic_string::replace max_size() exceeded");
-      const pointer addr = this->priv_addr();
-      return this->replace( const_iterator(addr + difference_type(pos1))
-                          , const_iterator(addr + difference_type(pos1 + len))
-                          , str.begin(), str.end());
-   }
-
-   //! <b>Effects</b>: Calls `return replace(pos1, n1, sv.data(), sv.size());`.
-   //!
-   template<template<class, class> class BasicStringView>
-   BOOST_CONTAINER_FORCEINLINE basic_string& replace(size_type pos1, size_type n1, BasicStringView<CharT, Traits> sv)
-   {
-      return this->replace(pos1, n1, sv.data(), sv.size());
-   }
-
-   //! <b>Requires</b>: pos1 <= size() and pos2 <= str.size().
-   //!
-   //! <b>Effects</b>: Determines the effective length rlen of the string to be
-   //!   inserted as the smaller of n2 and str.size() - pos2 and calls
-   //!   replace(pos1, n1, str.data() + pos2, rlen).
-   //!
-   //! <b>Throws</b>: if memory allocation throws, out_of_range if pos1 > size() or pos2 > str.size().
-   //!
-   //! <b>Returns</b>: *this
-   basic_string& replace(size_type pos1, size_type n1,
-                         const basic_string& str, size_type pos2, size_type n2 = npos)
-   {
-      if (pos2 > str.size())
-         throw_out_of_range("basic_string::replace out of range position");
-      return this->replace(pos1, n1, str.data()+pos2, dtl::min_value(n2, str.size() - pos2));
-   }
-
-   //! <b>Throws</b>: out_of_range if pos1 > size() or pos2 > sv.size().
-   //!
-   //! <b>Effects</b>: Determines the effective length rlen of the string to be inserted as the
-   //!   smaller of n2 and sv.size() - pos2 and calls `replace(pos1, n1, sv.data() + pos2, rlen)`.
-   //!
-   //! <b>Returns</b>: *this.
-   template<template<class, class> class BasicStringView>
-   basic_string& replace(size_type pos1, size_type n1, BasicStringView<CharT, Traits> sv,
-                         size_type pos2, size_type n2 = npos)
-   {
-      if (pos2 > sv.size())
-         throw_out_of_range("basic_string::replace out of range position");
-      return this->replace(pos1, n1, sv.data()+pos2, dtl::min_value(n2, sv.size() - pos2));
-   }
-
-   //! <b>Requires</b>: pos1 <= size() and s points to an array of at least n2 elements of CharT.
-   //!
-   //! <b>Effects</b>: Determines the effective length xlen of the string to be removed as the
-   //!   smaller of n1 and size() - pos1. If size() - xlen >= max_size() - n2 throws length_error.
-   //!   Otherwise, the function replaces the string controlled by *this with a string of
-   //!   length size() - xlen + n2 whose first pos1 elements are a copy of the initial elements
-   //!   of the original string controlled by *this, whose next n2 elements are a copy of the
-   //!   initial n2 elements of s, and whose remaining elements are a copy of the elements of
-   //!   the original string controlled by *this beginning at position pos + xlen.
-   //!
-   //! <b>Throws</b>: if memory allocation throws, out_of_range if pos1 > size() or length_error
-   //!   if the length of the resulting string would exceed max_size()
-   //!
-   //! <b>Returns</b>: *this
-   basic_string& replace(size_type pos1, size_type n1, const CharT* s, size_type n2)
-   {
-      if (pos1 > this->size())
-         throw_out_of_range("basic_string::replace out of range position");
-      const size_type len = dtl::min_value(n1, this->size() - pos1);
-      const size_type max_sz = this->max_size();
-      if (n2 > max_sz || (this->size() - len) >= (max_sz - n2))
-         throw_length_error("basic_string::replace max_size() exceeded");
-      const pointer addr = this->priv_addr() + pos1;
-      return this->replace(addr, addr + difference_type(len), s, s + difference_type(n2));
-   }
-
-   //! <b>Requires</b>: pos1 <= size() and s points to an array of at least n2 elements of CharT.
-   //!
-   //! <b>Effects</b>: Determines the effective length xlen of the string to be removed as the smaller
-   //! of n1 and size() - pos1. If size() - xlen >= max_size() - n2 throws length_error. Otherwise,
-   //! the function replaces the string controlled by *this with a string of length size() - xlen + n2
-   //! whose first pos1 elements are a copy of the initial elements of the original string controlled
-   //! by *this, whose next n2 elements are a copy of the initial n2 elements of s, and whose
-   //! remaining elements are a copy of the elements of the original string controlled by *this
-   //! beginning at position pos + xlen.
-   //!
-   //! <b>Throws</b>: if memory allocation throws, out_of_range if pos1 > size() or length_error
-   //!   if the length of the resulting string would exceed max_size()
-   //!
-   //! <b>Returns</b>: *this
-   BOOST_CONTAINER_FORCEINLINE basic_string& replace(size_type pos, size_type n1, const CharT* s)
-   {
-      return this->replace(pos, n1, s, Traits::length(s));
-   }
-
-   //! <b>Requires</b>: pos1 <= size().
-   //!
-   //! <b>Effects</b>: Equivalent to replace(pos1, n1, basic_string(n2, c)).
-   //!
-   //! <b>Throws</b>: if memory allocation throws, out_of_range if pos1 > size() or length_error
-   //!   if the length of the  resulting string would exceed max_size()
-   //!
-   //! <b>Returns</b>: *this
-   basic_string& replace(size_type pos1, size_type n1, size_type n2, CharT c)
-   {
-      if (pos1 > this->size())
-         throw_out_of_range("basic_string::replace out of range position");
-      const size_type len = dtl::min_value(n1, this->size() - pos1);
-      if (n2 > this->max_size() || this->size() - len >= this->max_size() - n2)
-         throw_length_error("basic_string::replace max_size() exceeded");
-      const pointer addr    = this->priv_addr();
-      return this->replace(addr + difference_type(pos1), addr + difference_type(pos1 + len), n2, c);
-   }
-
-   //! <b>Requires</b>: [begin(),i1) and [i1,i2) are valid ranges.
-   //!
-   //! <b>Effects</b>: Calls replace(i1 - begin(), i2 - i1, str).
-   //!
-   //! <b>Throws</b>: if memory allocation throws
-   //!
-   //! <b>Returns</b>: *this
-   BOOST_CONTAINER_FORCEINLINE basic_string& replace(const_iterator i1, const_iterator i2, const basic_string& str)
-   { return this->replace(i1, i2, str.data(), str.data()+str.size()); }
-
-   //! <b>Requires</b>: [begin(),i1) and [i1,i2) are valid ranges and
-   //!   s points to an array of at least n elements
-   //!
-   //! <b>Effects</b>: Calls replace(i1 - begin(), i2 - i1, s, n).
-   //!
-   //! <b>Throws</b>: if memory allocation throws
-   //!
-   //! <b>Returns</b>: *this
-   BOOST_CONTAINER_FORCEINLINE basic_string& replace(const_iterator i1, const_iterator i2, const CharT* s, size_type n)
-   { return this->replace(i1, i2, s, s + difference_type(n)); }
-
-   //! <b>Requires</b>: [begin(),i1) and [i1,i2) are valid ranges and s points to an
-   //!   array of at least traits::length(s) + 1 elements of CharT.
-   //!
-   //! <b>Effects</b>: Calls replace(i1 - begin(), i2 - i1, s, traits::length(s)).
-   //!
-   //! <b>Throws</b>: if memory allocation throws
-   //!
-   //! <b>Returns</b>: *this
-   BOOST_CONTAINER_FORCEINLINE basic_string& replace(const_iterator i1, const_iterator i2, const CharT* s)
-   {  return this->replace(i1, i2, s, s + Traits::length(s));   }
-
-   //! <b>Requires</b>: [begin(),i1) and [i1,i2) are valid ranges.
-   //!
-   //! <b>Effects</b>: Calls replace(i1 - begin(), i2 - i1, basic_string(n, c)).
-   //!
-   //! <b>Throws</b>: if memory allocation throws
-   //!
-   //! <b>Returns</b>: *this
-   basic_string& replace(const_iterator i1, const_iterator i2, size_type n, CharT c)
-   {
-      const size_type len = static_cast<size_type>(i2 - i1);
-      if (len >= n) {
-         Traits::assign(const_cast<CharT*>(boost::movelib::to_raw_pointer(i1)), n, c);
-         erase(i1 + difference_type(n), i2);
-      }
-      else {
-         Traits::assign(const_cast<CharT*>(boost::movelib::to_raw_pointer(i1)), len, c);
-         insert(i2, n - len, c);
-      }
-      return *this;
-   }
-
-   //! <b>Requires</b>: [begin(),i1), [i1,i2) and [j1,j2) are valid ranges.
-   //!
-   //! <b>Effects</b>: Calls replace(i1 - begin(), i2 - i1, basic_string(j1, j2)).
-   //!
-   //! <b>Throws</b>: if memory allocation throws
-   //!
-   //! <b>Returns</b>: *this
-   template <class InputIter>
-   basic_string& replace(const_iterator i1, const_iterator i2, InputIter j1, InputIter j2
-      #if !defined(BOOST_CONTAINER_DOXYGEN_INVOKED)
-      , typename dtl::disable_if_or
-         < void
-         , dtl::is_convertible<InputIter, size_type>
-         , dtl::is_input_iterator<InputIter>
-         >::type * = 0
-      #endif
-      )
-   {
-      for ( ; i1 != i2 && j1 != j2; ++i1, ++j1){
-         Traits::assign(*const_cast<CharT*>(boost::movelib::to_raw_pointer(i1)), *j1);
-      }
-
-      if (j1 == j2)
-         this->erase(i1, i2);
-      else
-         this->insert(i2, j1, j2);
-      return *this;
-   }
-
-   #if !defined(BOOST_CONTAINER_DOXYGEN_INVOKED)
-   template <class ForwardIter>
-   basic_string& replace(const_iterator i1, const_iterator i2, ForwardIter j1, ForwardIter j2
-      , typename dtl::disable_if_or
-         < void
-         , dtl::is_convertible<ForwardIter, size_type>
-         , dtl::is_not_input_iterator<ForwardIter>
-         >::type * = 0
-      )
-   {
-      difference_type n = boost::container::iterator_distance(j1, j2);
-      const difference_type len = i2 - i1;
-      if (len >= n) {
-         this->priv_copy(j1, j2, const_cast<CharT*>(boost::movelib::to_raw_pointer(i1)));
-         this->erase(i1 + difference_type(n), i2);
-      }
-      else {
-         ForwardIter m = j1;
-         boost::container::iterator_advance(m, len);
-         this->priv_copy(j1, m, const_cast<CharT*>(boost::movelib::to_raw_pointer(i1)));
-         this->insert(i2, m, j2);
-      }
-      return *this;
-   }
-   #endif
-
-   //! <b>Requires</b>: [begin(), i1) and [i1, i2) are valid ranges.
-   //!
-   //! <b>Effects</b>: Calls `replace(i1 - begin(), i2 - i1, sv).`.
-   //!
-   //! <b>Returns</b>: *this.
-   template<template <class, class> class BasicStringView>
-   BOOST_CONTAINER_FORCEINLINE basic_string& replace(const_iterator i1, const_iterator i2, BasicStringView<CharT, Traits> sv)
-   {
-      return this->replace( static_cast<size_type>(i1 - this->cbegin())
-                          , static_cast<size_type>(i2 - i1), sv);
-   }
-
-   #if !defined(BOOST_NO_CXX11_HDR_INITIALIZER_LIST)
-   //! <b>Requires</b>: [begin(), i1) and [i1, i2) are valid ranges.
-   //!
-   //! <b>Effects</b>: Calls replace(i1 - begin(), i2 - i1, il.begin(), il.size()).
-   //!
-   //! <b>Returns</b>: *this.
-   BOOST_CONTAINER_FORCEINLINE basic_string& replace(const_iterator i1, const_iterator i2, std::initializer_list<CharT> il)
-   {
-      return this->replace( static_cast<size_type>(i1 - this->cbegin())
-                          , static_cast<size_type>(i2 - i1)
-                          , il.begin(), il.size());
-   }
-   #endif
-
-   //! <b>Requires</b>: pos <= size()
-   //!
-   //! <b>Effects</b>: Determines the effective length rlen of the string to copy as the
-   //!   smaller of n and size() - pos. s shall designate an array of at least rlen elements.
-   //!   The function then replaces the string designated by s with a string of length rlen
-   //!   whose elements are a copy of the string controlled by *this beginning at position pos.
-   //!   The function does not append a null object to the string designated by s.
-   //!
-   //! <b>Throws</b>: if memory allocation throws, out_of_range if pos > size().
-   //!
-   //! <b>Returns</b>: rlen
-   size_type copy(CharT* s, size_type n, size_type pos = 0) const
-   {
-      if (pos > this->size())
-         throw_out_of_range("basic_string::copy out of range position");
-      const size_type len = dtl::min_value(n, this->size() - pos);
-      Traits::copy(s, boost::movelib::to_raw_pointer(this->priv_addr() + pos), len);
-      return len;
-   }
-
-   //! <b>Effects</b>: *this contains the same sequence of characters that was in s,
-   //!   s contains the same sequence of characters that was in *this.
-   //!
-   //! <b>Throws</b>: Nothing
-   void swap(basic_string& x)
-      BOOST_NOEXCEPT_IF(allocator_traits_type::propagate_on_container_swap::value
-                               || allocator_traits_type::is_always_equal::value)
-   {
-      this->base_t::swap_data(x);
-      dtl::bool_<allocator_traits_type::propagate_on_container_swap::value> flag;
-      dtl::swap_alloc(this->alloc(), x.alloc(), flag);
-   }
-
-   //////////////////////////////////////////////
-   //
-   //                 data access
-   //
-   //////////////////////////////////////////////
-
-   //! <b>Requires</b>: The program shall not alter any of the values stored in the character array.
-   //!
-   //! <b>Returns</b>: A pointer p such that p + i == &operator[](i) for each i in [0,size()].
-   //!
-   //! <b>Complexity</b>: constant time.
-   BOOST_CONTAINER_ATTRIBUTE_NODISCARD BOOST_CONTAINER_FORCEINLINE
-      const CharT* c_str() const BOOST_NOEXCEPT_OR_NOTHROW
-   {  return boost::movelib::to_raw_pointer(this->priv_addr()); }
-
-   //! <b>Requires</b>: The program shall not alter any of the values stored in the character array.
-   //!
-   //! <b>Returns</b>: A pointer p such that p + i == &operator[](i) for each i in [0,size()].
-   //!
-   //! <b>Complexity</b>: constant time.
-   BOOST_CONTAINER_ATTRIBUTE_NODISCARD BOOST_CONTAINER_FORCEINLINE
-      const CharT* data()  const BOOST_NOEXCEPT_OR_NOTHROW
-   {  return boost::movelib::to_raw_pointer(this->priv_addr()); }
-
-   //! <b>Returns</b>: A pointer p such that p + i == &operator[](i) for each i in [0,size()].
-   //!
-   //! <b>Complexity</b>: constant time.
-   BOOST_CONTAINER_ATTRIBUTE_NODISCARD BOOST_CONTAINER_FORCEINLINE
-      CharT* data()  BOOST_NOEXCEPT_OR_NOTHROW
-   {  return boost::movelib::to_raw_pointer(this->priv_addr()); }
-
-   #ifndef BOOST_CONTAINER_TEMPLATED_CONVERSION_OPERATOR_BROKEN
-   //! <b>Returns</b>: a string_view to the characters in the string.
-   //!
-   //! <b>Complexity</b>: constant time.
-   template<template <class, class> class BasicStringView>
-   BOOST_CONTAINER_FORCEINLINE operator BasicStringView<CharT, Traits>() const BOOST_NOEXCEPT_OR_NOTHROW
-   { return this->to_view< BasicStringView<CharT, Traits> >(); }
-   #endif
-
-   //! <b>Returns</b>: a string_view to the characters in the string.
-   //!
-   //! <b>Complexity</b>: constant time.
-   //!
-   //! <b>Note</b>: This function is available to write portable code for compilers
-   //!   that don't support templated conversion operators.
-   template<class BasicStringView>
-   BOOST_CONTAINER_ATTRIBUTE_NODISCARD BOOST_CONTAINER_FORCEINLINE
-      BasicStringView to_view() const BOOST_NOEXCEPT_OR_NOTHROW
-   { return BasicStringView(this->data(), this->size()); }
-
-   //////////////////////////////////////////////
-   //
-   //             string operations
-   //
-   //////////////////////////////////////////////
-
-   //! <b>Effects</b>: Determines the lowest position xpos, if possible, such that both
-   //!   of the following conditions hold:
-   //!   1) pos <= xpos and xpos + str.size() <= size();
-   //!   2) traits::eq(at(xpos+I), str.at(I)) for all elements I of the string controlled by str.
-   //!
-   //! <b>Throws</b>: Nothing
-   //!
-   //! <b>Returns</b>: xpos if the function can determine such a value for xpos. Otherwise, returns npos.
-   BOOST_CONTAINER_ATTRIBUTE_NODISCARD BOOST_CONTAINER_FORCEINLINE
-      size_type find(const basic_string& s, size_type pos = 0) const
-   { return find(s.c_str(), pos, s.size()); }
-
-   //! <b>Effects</b>: Determines the lowest position xpos, if possible, such that both
-   //!   of the following conditions hold:
-   //!   1) pos <= xpos and xpos + sv.size() <= size();
-   //!   2) traits::eq(at(xpos+I), sv.at(I)) for all elements I of the string controlled by sv.
-   //!
-   //! <b>Throws</b>: Nothing
-   //!
-   //! <b>Returns</b>: xpos if the function can determine such a value for xpos. Otherwise, returns npos.
-   template<template <class, class> class BasicStringView>
-   BOOST_CONTAINER_ATTRIBUTE_NODISCARD BOOST_CONTAINER_FORCEINLINE
-      size_type find(BasicStringView<CharT, Traits> sv, size_type pos = 0) const
-   { return this->find(sv.data(), pos, sv.size()); }
-
-   //! <b>Requires</b>: s points to an array of at least n elements of CharT.
-   //!
-   //! <b>Throws</b>: Nothing
-   //!
-   //! <b>Returns</b>: find(basic_string<CharT,traits,allocator_type>(s,n),pos).
-   BOOST_CONTAINER_ATTRIBUTE_NODISCARD BOOST_CONTAINER_FORCEINLINE
-      size_type find(const CharT* s, size_type pos, size_type n) const
-   {
-      if (pos + n > this->size())
-         return npos;
-      else {
-         const pointer addr = this->priv_addr();
-         pointer finish = addr + difference_type(this->priv_size());
-         const const_iterator result =
-            boost::container::search(boost::movelib::to_raw_pointer(addr + difference_type(pos)),
-                   boost::movelib::to_raw_pointer(finish),
-                   s, s + difference_type(n), Eq_traits<Traits>());
-         return result != finish ? size_type(result - begin()) : npos;
-      }
-   }
-
-   //! <b>Requires</b>: s points to an array of at least traits::length(s) + 1 elements of CharT.
-   //!
-   //! <b>Throws</b>: Nothing
-   //!
-   //! <b>Returns</b>: find(basic_string(s), pos).
-   BOOST_CONTAINER_ATTRIBUTE_NODISCARD BOOST_CONTAINER_FORCEINLINE
-      size_type find(const CharT* s, size_type pos = 0) const
-   { return this->find(s, pos, Traits::length(s)); }
-
-   //! <b>Throws</b>: Nothing
-   //!
-   //! <b>Returns</b>: find(basic_string<CharT,traits,allocator_type>(1,c), pos).
-   BOOST_CONTAINER_ATTRIBUTE_NODISCARD BOOST_CONTAINER_FORCEINLINE
-      size_type find(CharT c, size_type pos = 0) const
-   {
-      const size_type sz = this->size();
-      if (pos >= sz)
-         return npos;
-      else {
-         const pointer addr    = this->priv_addr();
-         pointer finish = addr + difference_type(sz);
-         const const_iterator result =
-            boost::container::find_if(addr + difference_type(pos), finish,
-                  boost::container::bind2nd(Eq_traits<Traits>(), c));
-         return result != finish ? size_type(result - begin()) : npos;
-      }
-   }
-
-   //! <b>Effects</b>: Determines the highest position xpos, if possible, such
-   //!   that both of the following conditions obtain:
-   //!   a) xpos <= pos and xpos + str.size() <= size();
-   //!   b) traits::eq(at(xpos+I), str.at(I)) for all elements I of the string controlled by str.
-   //!
-   //! <b>Throws</b>: Nothing
-   //!
-   //! <b>Returns</b>: xpos if the function can determine such a value for xpos. Otherwise, returns npos.
-   BOOST_CONTAINER_ATTRIBUTE_NODISCARD BOOST_CONTAINER_FORCEINLINE
-      size_type rfind(const basic_string& str, size_type pos = npos) const
-      { return this->rfind(str.c_str(), pos, str.size()); }
-
-   //! <b>Effects</b>: Determines the highest position xpos, if possible, such
-   //!   that both of the following conditions obtain:
-   //!   a) xpos <= pos and xpos + sv.size() <= size();
-   //!   b) traits::eq(at(xpos+I), sv.at(I)) for all elements I of the string controlled by sv.
-   //!
-   //! <b>Throws</b>: Nothing
-   //!
-   //! <b>Returns</b>: xpos if the function can determine such a value for xpos. Otherwise, returns npos.
-   template<template <class, class> class BasicStringView>
-   BOOST_CONTAINER_ATTRIBUTE_NODISCARD BOOST_CONTAINER_FORCEINLINE
-      size_type rfind(BasicStringView<CharT, Traits> sv, size_type pos = npos) const
-      { return this->rfind(sv.data(), pos, sv.size()); }
-
-   //! <b>Requires</b>: s points to an array of at least n elements of CharT.
-   //!
-   //! <b>Throws</b>: Nothing
-   //!
-   //! <b>Returns</b>: rfind(basic_string(s, n), pos).
-   BOOST_CONTAINER_ATTRIBUTE_NODISCARD BOOST_CONTAINER_FORCEINLINE
-      size_type rfind(const CharT* s, size_type pos, size_type n) const
-   {
-      const size_type len = this->size();
-
-      if (n > len)
-         return npos;
-      else if (n == 0)
-         return dtl::min_value(len, pos);
-      else {
-         const const_iterator last = begin() + difference_type(dtl::min_value(len - n, pos + n));
-         const const_iterator result = boost::container::find_end
-            (begin(), last, s, s + difference_type(n), Eq_traits<Traits>());
-         return result != last ? size_type(result - begin()) : npos;
-      }
-   }
-
-   //! <b>Requires</b>: pos <= size() and s points to an array of at least
-   //!   traits::length(s) + 1 elements of CharT.
-   //!
-   //! <b>Throws</b>: Nothing
-   //!
-   //! <b>Returns</b>: rfind(basic_string(s), pos).
-   BOOST_CONTAINER_ATTRIBUTE_NODISCARD BOOST_CONTAINER_FORCEINLINE
-      size_type rfind(const CharT* s, size_type pos = npos) const
-      { return this->rfind(s, pos, Traits::length(s)); }
-
-   //! <b>Throws</b>: Nothing
-   //!
-   //! <b>Returns</b>: rfind(basic_string<CharT,traits,allocator_type>(1,c),pos).
-   BOOST_CONTAINER_ATTRIBUTE_NODISCARD BOOST_CONTAINER_FORCEINLINE
-      size_type rfind(CharT c, size_type pos = npos) const
-   {
-      const size_type len = this->size();
-
-      if (len < 1)
-         return npos;
-      else {
-         const const_iterator last = begin() + dtl::min_value(len - 1, pos) + 1;
-         const_reverse_iterator rresult =
-            boost::container::find_if(const_reverse_iterator(last), rend(),
-                  boost::container::bind2nd(Eq_traits<Traits>(), c));
-         return rresult != rend() ? size_type((rresult.base() - 1) - begin()) : npos;
-      }
-   }
-
-   //! <b>Effects</b>: Determines the lowest position xpos, if possible, such that both of the
-   //!   following conditions obtain: a) pos <= xpos and xpos < size();
-   //!   b) traits::eq(at(xpos), str.at(I)) for some element I of the string controlled by str.
-   //!
-   //! <b>Throws</b>: Nothing
-   //!
-   //! <b>Returns</b>: xpos if the function can determine such a value for xpos. Otherwise, returns npos.
-   BOOST_CONTAINER_ATTRIBUTE_NODISCARD BOOST_CONTAINER_FORCEINLINE
-      size_type find_first_of(const basic_string& str, size_type pos = 0) const
-      { return this->find_first_of(str.c_str(), pos, str.size()); }
-
-   //! <b>Effects</b>: Determines the lowest position xpos, if possible, such that both of the
-   //!   following conditions obtain: a) pos <= xpos and xpos < size();
-   //!   b) traits::eq(at(xpos), sv.at(I)) for some element I of the string controlled by sv.
-   //!
-   //! <b>Throws</b>: Nothing
-   //!
-   //! <b>Returns</b>: xpos if the function can determine such a value for xpos. Otherwise, returns npos.
-   template<template <class, class> class BasicStringView>
-   BOOST_CONTAINER_ATTRIBUTE_NODISCARD BOOST_CONTAINER_FORCEINLINE
-      size_type find_first_of(BasicStringView<CharT, Traits> sv, size_type pos = 0) const
-      { return this->find_first_of(sv.data(), pos, sv.size()); }
-
-   //! <b>Requires</b>: s points to an array of at least n elements of CharT.
-   //!
-   //! <b>Throws</b>: Nothing
-   //!
-   //! <b>Returns</b>: find_first_of(basic_string(s, n), pos).
-   BOOST_CONTAINER_ATTRIBUTE_NODISCARD BOOST_CONTAINER_FORCEINLINE
-      size_type find_first_of(const CharT* s, size_type pos, size_type n) const
-   {
-      const size_type sz = this->size();
-      if (pos >= sz)
-         return npos;
-      else {
-         const pointer addr    = this->priv_addr();
-         pointer finish = addr + difference_type(sz);
-         const_iterator result = boost::container::find_first_of
-            (addr + difference_type(pos), finish, s, s + difference_type(n), Eq_traits<Traits>());
-         return result != finish ? size_type(result - this->begin()) : npos;
-      }
-   }
-
-   //! <b>Requires</b>: s points to an array of at least traits::length(s) + 1 elements of CharT.
-   //!
-   //! <b>Throws</b>: Nothing
-   //!
-   //! <b>Returns</b>: find_first_of(basic_string(s), pos).
-   BOOST_CONTAINER_ATTRIBUTE_NODISCARD BOOST_CONTAINER_FORCEINLINE
-      size_type find_first_of(const CharT* s, size_type pos = 0) const
-      { return this->find_first_of(s, pos, Traits::length(s)); }
-
-   //! <b>Requires</b>: s points to an array of at least traits::length(s) + 1 elements of CharT.
-   //!
-   //! <b>Throws</b>: Nothing
-   //!
-   //! <b>Returns</b>: find_first_of(basic_string<CharT,traits,allocator_type>(1,c), pos).
-   BOOST_CONTAINER_ATTRIBUTE_NODISCARD BOOST_CONTAINER_FORCEINLINE
-      size_type find_first_of(CharT c, size_type pos = 0) const
-    { return this->find(c, pos); }
-
-   //! <b>Effects</b>: Determines the highest position xpos, if possible, such that both of
-   //!   the following conditions obtain: a) xpos <= pos and xpos < size(); b)
-   //!   traits::eq(at(xpos), str.at(I)) for some element I of the string controlled by str.
-   //!
-   //! <b>Throws</b>: Nothing
-   //!
-   //! <b>Returns</b>: xpos if the function can determine such a value for xpos. Otherwise, returns npos.
-   BOOST_CONTAINER_ATTRIBUTE_NODISCARD BOOST_CONTAINER_FORCEINLINE
-      size_type find_last_of(const basic_string& str, size_type pos = npos) const
-      { return this->find_last_of(str.c_str(), pos, str.size()); }
-
-   //! <b>Effects</b>: Determines the highest position xpos, if possible, such that both of
-   //!   the following conditions obtain: a) xpos <= pos and xpos < size(); b)
-   //!   traits::eq(at(xpos), str.at(I)) for some element I of the string controlled by str.
-   //!
-   //! <b>Throws</b>: Nothing
-   //!
-   //! <b>Returns</b>: xpos if the function can determine such a value for xpos. Otherwise, returns npos.
-   template<template <class, class> class BasicStringView>
-   BOOST_CONTAINER_ATTRIBUTE_NODISCARD BOOST_CONTAINER_FORCEINLINE
-      size_type find_last_of(BasicStringView<CharT, Traits> sv, size_type pos = npos) const
-      { return this->find_last_of(sv.data(), pos, sv.size()); }
-
-   //! <b>Requires</b>: s points to an array of at least n elements of CharT.
-   //!
-   //! <b>Throws</b>: Nothing
-   //!
-   //! <b>Returns</b>: find_last_of(basic_string(s, n), pos).
-   BOOST_CONTAINER_ATTRIBUTE_NODISCARD BOOST_CONTAINER_FORCEINLINE
-      size_type find_last_of(const CharT* s, size_type pos, size_type n) const
-   {
-      const size_type len = this->size();
-
-      if (len < 1)
-         return npos;
-      else {
-         const pointer addr    = this->priv_addr();
-         const const_iterator last = addr + difference_type(dtl::min_value(len - 1, pos) + 1);
-         const const_reverse_iterator rresult =
-            boost::container::find_first_of(const_reverse_iterator(last), rend(),
-                               s, s + difference_type(n), Eq_traits<Traits>());
-         return rresult != rend() ? size_type((rresult.base() - 1) - addr) : npos;
-      }
-   }
-
-   //! <b>Requires</b>: s points to an array of at least traits::length(s) + 1 elements of CharT.
-   //!
-   //! <b>Throws</b>: Nothing
-   //!
-   //! <b>Returns</b>: find_last_of(basic_string<CharT,traits,allocator_type>(1,c),pos).
-   BOOST_CONTAINER_ATTRIBUTE_NODISCARD BOOST_CONTAINER_FORCEINLINE
-      size_type find_last_of(const CharT* s, size_type pos = npos) const
-      { return this->find_last_of(s, pos, Traits::length(s)); }
-
-   //! <b>Throws</b>: Nothing
-   //!
-   //! <b>Returns</b>: find_last_of(basic_string(s), pos).
-   BOOST_CONTAINER_ATTRIBUTE_NODISCARD BOOST_CONTAINER_FORCEINLINE
-      size_type find_last_of(CharT c, size_type pos = npos) const
-      {  return this->rfind(c, pos);   }
-
-   //! <b>Effects</b>: Determines the lowest position xpos, if possible, such that
-   //!   both of the following conditions obtain:
-   //!   a) pos <= xpos and xpos < size(); b) traits::eq(at(xpos), str.at(I)) for no
-   //!   element I of the string controlled by str.
-   //!
-   //! <b>Throws</b>: Nothing
-   //!
-   //! <b>Returns</b>: xpos if the function can determine such a value for xpos. Otherwise, returns npos.
-   BOOST_CONTAINER_ATTRIBUTE_NODISCARD BOOST_CONTAINER_FORCEINLINE
-      size_type find_first_not_of(const basic_string& str, size_type pos = 0) const
-      { return this->find_first_not_of(str.c_str(), pos, str.size()); }
-
-   //! <b>Effects</b>: Determines the lowest position xpos, if possible, such that
-   //!   both of the following conditions obtain:
-   //!   a) pos <= xpos and xpos < size(); b) traits::eq(at(xpos), sv.at(I)) for no
-   //!   element I of the string controlled by sv.
-   //!
-   //! <b>Throws</b>: Nothing
-   //!
-   //! <b>Returns</b>: xpos if the function can determine such a value for xpos. Otherwise, returns npos.
-   template<template <class, class> class BasicStringView>
-   BOOST_CONTAINER_ATTRIBUTE_NODISCARD BOOST_CONTAINER_FORCEINLINE
-      size_type find_first_not_of(BasicStringView<CharT, Traits> sv, size_type pos = 0) const
-      { return this->find_first_not_of(sv.data(), pos, sv.size()); }
-
-   //! <b>Requires</b>: s points to an array of at least traits::length(s) + 1 elements of CharT.
-   //!
-   //! <b>Throws</b>: Nothing
-   //!
-   //! <b>Returns</b>: find_first_not_of(basic_string(s, n), pos).
-   BOOST_CONTAINER_ATTRIBUTE_NODISCARD BOOST_CONTAINER_FORCEINLINE
-      size_type find_first_not_of(const CharT* s, size_type pos, size_type n) const
-   {
-      if (pos > this->size())
-         return npos;
-      else {
-         const pointer addr   = this->priv_addr();
-         const pointer finish = addr + difference_type(this->priv_size());
-         const const_iterator result = boost::container::find_if
-            (addr + difference_type(pos), finish, Not_within_traits<Traits>(s, s + difference_type(n)));
-         return result != finish ? size_type(result - addr) : npos;
-      }
-   }
-
-   //! <b>Requires</b>: s points to an array of at least traits::length(s) + 1 elements of CharT.
-   //!
-   //! <b>Throws</b>: Nothing
-   //!
-   //! <b>Returns</b>: find_first_not_of(basic_string(s), pos).
-   BOOST_CONTAINER_ATTRIBUTE_NODISCARD BOOST_CONTAINER_FORCEINLINE
-      size_type find_first_not_of(const CharT* s, size_type pos = 0) const
-      { return this->find_first_not_of(s, pos, Traits::length(s)); }
-
-   //! <b>Throws</b>: Nothing
-   //!
-   //! <b>Returns</b>: find_first_not_of(basic_string(1, c), pos).
-   BOOST_CONTAINER_ATTRIBUTE_NODISCARD BOOST_CONTAINER_FORCEINLINE
-      size_type find_first_not_of(CharT c, size_type pos = 0) const
-   {
-      if (pos > this->size())
-         return npos;
-      else {
-         const pointer addr   = this->priv_addr();
-         const pointer finish = addr + difference_type(this->priv_size());
-         const const_iterator result
-            = boost::container::find_if(addr + difference_type(pos), finish,
-                     boost::container::not1(boost::container::bind2nd(Eq_traits<Traits>(), c)));
-         return result != finish ? size_type(result - begin()) : npos;
-      }
-   }
-
-   //! <b>Effects</b>: Determines the highest position xpos, if possible, such that
-   //!   both of the following conditions obtain: a) xpos <= pos and xpos < size();
-   //!   b) traits::eq(at(xpos), str.at(I)) for no element I of the string controlled by str.
-   //!
-   //! <b>Throws</b>: Nothing
-   //!
-   //! <b>Returns</b>: xpos if the function can determine such a value for xpos. Otherwise, returns npos.
-   BOOST_CONTAINER_ATTRIBUTE_NODISCARD BOOST_CONTAINER_FORCEINLINE
-      size_type find_last_not_of(const basic_string& str, size_type pos = npos) const
-      { return this->find_last_not_of(str.c_str(), pos, str.size()); }
-
-   //! <b>Effects</b>: Determines the highest position xpos, if possible, such that
-   //!   both of the following conditions obtain: a) xpos <= pos and xpos < size();
-   //!   b) traits::eq(at(xpos), sv.at(I)) for no element I of the string controlled by sv.
-   //!
-   //! <b>Throws</b>: Nothing
-   //!
-   //! <b>Returns</b>: xpos if the function can determine such a value for xpos. Otherwise, returns npos.
-   template<template <class, class> class BasicStringView>
-   BOOST_CONTAINER_ATTRIBUTE_NODISCARD BOOST_CONTAINER_FORCEINLINE
-      size_type find_last_not_of(BasicStringView<CharT, Traits> sv, size_type pos = npos) const
-      { return this->find_last_not_of(sv.data(), pos, sv.size()); }
-
-   //! <b>Requires</b>: s points to an array of at least n elements of CharT.
-   //!
-   //! <b>Throws</b>: Nothing
-   //!
-   //! <b>Returns</b>: find_last_not_of(basic_string(s, n), pos).
-   BOOST_CONTAINER_ATTRIBUTE_NODISCARD BOOST_CONTAINER_FORCEINLINE
-      size_type find_last_not_of(const CharT* s, size_type pos, size_type n) const
-   {
-      const size_type len = this->size();
-
-      if (len < 1)
-         return npos;
-      else {
-         const const_iterator last = begin() + dtl::min_value(len - 1, pos) + 1;
-         const const_reverse_iterator rresult =
-            boost::container::find_if(const_reverse_iterator(last), rend(),
-                    Not_within_traits<Traits>(s, s + difference_type(n)));
-         return rresult != rend() ? size_type((rresult.base() - 1) - begin()) : npos;
-      }
-   }
-
-   //! <b>Requires</b>: s points to an array of at least traits::length(s) + 1 elements of CharT.
-   //!
-   //! <b>Throws</b>: Nothing
-   //!
-   //! <b>Returns</b>: find_last_not_of(basic_string(s), pos).
-   BOOST_CONTAINER_ATTRIBUTE_NODISCARD BOOST_CONTAINER_FORCEINLINE
-      size_type find_last_not_of(const CharT* s, size_type pos = npos) const
-      { return this->find_last_not_of(s, pos, Traits::length(s)); }
-
-   //! <b>Throws</b>: Nothing
-   //!
-   //! <b>Returns</b>: find_last_not_of(basic_string(1, c), pos).
-   BOOST_CONTAINER_ATTRIBUTE_NODISCARD BOOST_CONTAINER_FORCEINLINE
-      size_type find_last_not_of(CharT c, size_type pos = npos) const
-   {
-      const size_type len = this->size();
-
-      if (len < 1)
-         return npos;
-      else {
-         const const_iterator last = begin() + dtl::min_value(len - 1, pos) + 1;
-         const const_reverse_iterator rresult =
-            boost::container::find_if(const_reverse_iterator(last), rend(),
-                  boost::container::not1(boost::container::bind2nd(Eq_traits<Traits>(), c)));
-         return rresult != rend() ? size_type((rresult.base() - 1) - begin()) : npos;
-      }
-   }
-
-   //! <b>Requires</b>: Requires: pos <= size()
-   //!
-   //! <b>Effects</b>: Determines the effective length rlen of the string to copy as
-   //!   the smaller of n and size() - pos.
-   //!
-   //! <b>Throws</b>: If memory allocation throws or out_of_range if pos > size().
-   //!
-   //! <b>Returns</b>: basic_string<CharT,traits,allocator_type>(data()+pos,rlen).
-   BOOST_CONTAINER_ATTRIBUTE_NODISCARD BOOST_CONTAINER_FORCEINLINE
-      basic_string substr(size_type pos = 0, size_type n = npos) const
-   {
-      if (pos > this->size())
-         throw_out_of_range("basic_string::substr out of range position");
-      const pointer addr = this->priv_addr();
-      return basic_string(addr + difference_type(pos),
-                          addr + difference_type(pos + dtl::min_value(n, size() - pos)), this->alloc());
-   }
-
-   //! <b>Effects</b>: Determines the effective length rlen of the string to compare as
-   //!   the smaller of size() and str.size(). The function then compares the two strings by
-   //!   calling traits::compare(data(), str.data(), rlen).
-   //!
-   //! <b>Throws</b>: Nothing
-   //!
-   //! <b>Returns</b>: The nonzero result if the result of the comparison is nonzero.
-   //!   Otherwise, returns a value < 0 if size() < str.size(), a 0 value if size() == str.size(),
-   //!   and value > 0 if size() > str.size()
-   BOOST_CONTAINER_ATTRIBUTE_NODISCARD BOOST_CONTAINER_FORCEINLINE
-      int compare(const basic_string& str) const
-   {
-      const pointer addr     = this->priv_addr();
-      const pointer str_addr = str.priv_addr();
-      return this->s_compare(addr, addr + difference_type(this->priv_size()), str_addr, str_addr + difference_type(str.priv_size()));
-   }
-
-   //! <b>Throws</b>: Nothing
-   //!
-   //! <b>Returns</b>: compare(basic_string(sv)).
-   template<template <class, class> class BasicStringView>
-   BOOST_CONTAINER_ATTRIBUTE_NODISCARD BOOST_CONTAINER_FORCEINLINE
-      int compare(BasicStringView<CharT,Traits> sv) const
-   {
-      const pointer addr = this->priv_addr();
-      return this->s_compare(addr, addr + difference_type(this->priv_size()), sv.data(), sv.data() + difference_type(sv.size()));
-   }
-
-   //! <b>Requires</b>: pos1 <= size()
-   //!
-   //! <b>Effects</b>: Determines the effective length rlen of the string to compare as
-   //!   the smaller of (this->size() - pos1), n1 and str.size(). The function then compares the two strings by
-   //!   calling traits::compare(data()+pos1, str.data(), rlen).
-   //!
-   //! <b>Throws</b>: out_of_range if pos1 > size()
-   //!
-   //! <b>Returns</b>:basic_string(*this,pos1,n1).compare(str).
-   BOOST_CONTAINER_ATTRIBUTE_NODISCARD BOOST_CONTAINER_FORCEINLINE
-      int compare(size_type pos1, size_type n1, const basic_string& str) const
-   {
-      if (pos1 > this->size())
-         throw_out_of_range("basic_string::compare out of range position");
-      const pointer addr    = this->priv_addr();
-      const pointer str_addr = str.priv_addr();
-      return this->s_compare(addr + difference_type(pos1),
-                        addr + difference_type(pos1 + dtl::min_value(n1, this->size() - pos1)),
-                        str_addr, str_addr + difference_type(str.priv_size()));
-   }
-
-   //! <b>Requires</b>: pos1 <= size()
-   //!
-   //! <b>Throws</b>: out_of_range if pos1 > size()
-   //!
-   //! <b>Returns</b>:basic_string(*this,pos1,n1).compare(sv).
-   template<template <class, class> class BasicStringView>
-   BOOST_CONTAINER_ATTRIBUTE_NODISCARD BOOST_CONTAINER_FORCEINLINE
-      int compare(size_type pos1, size_type n1, BasicStringView<CharT,Traits> sv) const
-   {
-      if (pos1 > this->size())
-         throw_out_of_range("basic_string::compare out of range position");
-      const pointer addr    = this->priv_addr() + pos1;
-      const CharT* str_addr = sv.data();
-      return this->s_compare(addr, addr + difference_type(dtl::min_value(n1, this->size() - pos1)),
-                       str_addr, str_addr + sv.size());
-   }
-
-   //! <b>Requires</b>: pos1 <= size() and pos2 <= str.size()
-   //!
-   //! <b>Effects</b>: Determines the effective length rlen of the string to copy as
-   //!   the smaller of
-   //!
-   //! <b>Throws</b>: out_of_range if pos1 > size() or pos2 > str.size()
-   //!
-   //! <b>Returns</b>: basic_string(*this, pos1, n1).compare(basic_string(str, pos2, n2)).
-   BOOST_CONTAINER_ATTRIBUTE_NODISCARD BOOST_CONTAINER_FORCEINLINE
-      int compare(size_type pos1, size_type n1, const basic_string& str, size_type pos2, size_type n2 = npos) const
-   {
-      if (pos1 > this->size() || pos2 > str.size())
-         throw_out_of_range("basic_string::compare out of range position");
-      const pointer addr     = this->priv_addr() + pos1;
-      const pointer str_addr = str.priv_addr() + pos2;
-      return this->s_compare(addr, addr + difference_type(dtl::min_value(n1, this->size() - pos1)),
-                             str_addr, str_addr + difference_type(dtl::min_value(n2, str.size() - pos2)));
-   }
-
-   //! <b>Requires</b>: pos1 <= size() and pos2 <= str.size()
-   //!
-   //! <b>Effects</b>: Determines the effective length rlen of the string to copy as
-   //!   the smaller of
-   //!
-   //! <b>Throws</b>: out_of_range if pos1 > size() or pos2 > sv.size()
-   //!
-   //! <b>Returns</b>: basic_string(*this, pos1, n1).compare(BasicStringView<CharT, Traits>(sv, pos2, n2)).
-   template<template <class, class> class BasicStringView>
-   BOOST_CONTAINER_ATTRIBUTE_NODISCARD BOOST_CONTAINER_FORCEINLINE
-      int compare(size_type pos1, size_type n1, BasicStringView<CharT,Traits> sv, size_type pos2, size_type n2) const
-   {
-      if (pos1 > this->size() || pos2 > sv.size())
-         throw_out_of_range("basic_string::compare out of range position");
-      const pointer addr     = this->priv_addr() + pos1;
-      const CharT * str_addr = sv.data() + pos2;
-      return this->s_compare(addr, addr + difference_type(dtl::min_value(n1, this->size() - pos1)),
-                       str_addr, str_addr + difference_type(dtl::min_value(n2, sv.size() - pos2)));
-   }
-
-   //! <b>Throws</b>: Nothing
-   //!
-   //! <b>Returns</b>: compare(basic_string(s)).
-   BOOST_CONTAINER_ATTRIBUTE_NODISCARD BOOST_CONTAINER_FORCEINLINE
-      int compare(const CharT* s) const
-   {
-      const pointer addr = this->priv_addr();
-      return this->s_compare(addr, addr + difference_type(this->priv_size()), s, s + Traits::length(s));
-   }
-
-   //! <b>Requires</b>: pos1 > size() and s points to an array of at least n2 elements of CharT.
-   //!
-   //! <b>Throws</b>: out_of_range if pos1 > size()
-   //!
-   //! <b>Returns</b>: basic_string(*this, pos, n1).compare(basic_string(s, n2)).
-   BOOST_CONTAINER_ATTRIBUTE_NODISCARD BOOST_CONTAINER_FORCEINLINE
-      int compare(size_type pos1, size_type n1, const CharT* s, size_type n2) const
-   {
-      if (pos1 > this->size())
-         throw_out_of_range("basic_string::compare out of range position");
-      const pointer addr = this->priv_addr();
-      return this->s_compare( addr + difference_type(pos1),
-                        addr + difference_type(pos1 + dtl::min_value(n1, this->size() - pos1)),
-                        s, s + difference_type(n2));
-   }
-
-   //! <b>Requires</b>: pos1 > size() and s points to an array of at least traits::length(s) + 1 elements of CharT.
-   //!
-   //! <b>Throws</b>: out_of_range if pos1 > size()
-   //!
-   //! <b>Returns</b>: basic_string(*this, pos, n1).compare(basic_string(s, n2)).
-   BOOST_CONTAINER_ATTRIBUTE_NODISCARD BOOST_CONTAINER_FORCEINLINE
-      int compare(size_type pos1, size_type n1, const CharT* s) const
-   {  return this->compare(pos1, n1, s, Traits::length(s)); }
-
-   #ifndef BOOST_CONTAINER_DOXYGEN_INVOKED
-   private:
-   void priv_reserve(size_type res_arg, const bool null_terminate = true)
-   {
-      if (res_arg > this->max_size()){
-         throw_length_error("basic_string::reserve max_size() exceeded");
-      }
-
-      if (this->capacity() < res_arg){
-         size_type n = dtl::max_value(res_arg, this->size()) + 1;
-         size_type new_cap = this->next_capacity(n);
-         pointer reuse = 0;
-         pointer new_start = this->allocation_command(allocate_new, n, new_cap, reuse);
-         size_type new_length = 0;
-
-         const pointer addr = this->priv_addr();
-         new_length += priv_uninitialized_copy
-            (addr, addr + difference_type(this->priv_size()), new_start);
-         if(null_terminate){
-            this->priv_construct_null(new_start + difference_type(new_length));
-         }
-         this->deallocate_block();
-         this->assure_long();
-         this->priv_long_addr(new_start);
-         this->priv_long_size(new_length);
-         this->priv_storage(new_cap);
-      }
-   }
-
-   template<class It1, class It2>
-   static int s_compare(It1 f1, It1 l1, It2 f2, It2 l2)
-   {
-      const std::size_t n1 = std::size_t(l1 - f1);
-      const std::size_t n2 = std::size_t(l2 - f2);
-      const int cmp = Traits::compare(boost::movelib::to_raw_pointer(f1),
-                                      boost::movelib::to_raw_pointer(f2),
-                                      dtl::min_value(n1, n2));
-      return cmp != 0 ? cmp : (n1 < n2 ? -1 : (n1 > n2 ? 1 : 0));
-   }
-
-   template<class AllocVersion>
-   void priv_shrink_to_fit_dynamic_buffer
-      ( AllocVersion
-      , typename dtl::enable_if<dtl::is_same<AllocVersion, version_1> >::type* = 0)
-   {
-      //Allocate a new buffer.
-      size_type real_cap = 0;
-      const pointer   long_addr    = this->priv_long_addr();
-      const size_type long_size    = this->priv_long_size();
-      const size_type long_storage = this->priv_long_storage();
-      //We can make this nothrow as chars are always NoThrowCopyables
-      BOOST_CONTAINER_TRY{
-         pointer reuse = 0;
-         real_cap = long_size+1;
-         const pointer ret = this->allocation_command(allocate_new, long_size+1, real_cap, reuse);
-         //Copy and update
-         Traits::copy( boost::movelib::to_raw_pointer(ret)
-                     , boost::movelib::to_raw_pointer(this->priv_long_addr())
-                     , long_size+1);
-         this->priv_long_addr(ret);
-         this->priv_storage(real_cap);
-         //And release old buffer
-         this->alloc().deallocate(long_addr, long_storage);
-      }
-      BOOST_CONTAINER_CATCH(...){
-         return;
-      }
-      BOOST_CONTAINER_CATCH_END
-   }
-
-   template<class AllocVersion>
-   void priv_shrink_to_fit_dynamic_buffer
-      ( AllocVersion
-      , typename dtl::enable_if<dtl::is_same<AllocVersion, version_2> >::type* = 0)
-   {
-      size_type received_size = this->priv_long_size()+1;
-      pointer hint = this->priv_long_addr();
-      if(this->alloc().allocation_command
-         ( shrink_in_place | nothrow_allocation, this->priv_long_storage(), received_size, hint)){
-         this->priv_storage(received_size);
-      }
-   }
-
-   BOOST_CONTAINER_FORCEINLINE void priv_construct_null(pointer p)
-   {  this->construct(p, CharT(0));  }
-
-   // Helper functions used by constructors.  It is a severe error for
-   // any of them to be called anywhere except from within constructors.
-   BOOST_CONTAINER_FORCEINLINE void priv_terminate_string()
-   {  this->priv_construct_null(this->priv_end_addr());  }
-
-   template<class FwdIt, class Count> inline
-   void priv_uninitialized_fill_n(FwdIt first, Count count, const CharT val)
-   {
-      //Save initial position
-      FwdIt init = first;
-
-      BOOST_CONTAINER_TRY{
-         //Construct objects
-         for (; count--; ++first){
-            this->construct(first, val);
-         }
-      }
-      BOOST_CONTAINER_CATCH(...){
-         //Call destructors
-         for (; init != first; ++init){
-            this->destroy(init);
-         }
-         BOOST_CONTAINER_RETHROW
-      }
-      BOOST_CONTAINER_CATCH_END
-   }
-
-   template<class InpIt, class FwdIt> inline
-   size_type priv_uninitialized_copy(InpIt first, InpIt last, FwdIt dest)
-   {
-      //Save initial destination position
-      FwdIt dest_init = dest;
-      size_type constructed = 0;
-
-      BOOST_CONTAINER_TRY{
-         //Try to build objects
-         for (; first != last; ++dest, ++first, ++constructed){
-            this->construct(dest, *first);
-         }
-      }
-      BOOST_CONTAINER_CATCH(...){
-         //Call destructors
-         for (; constructed--; ++dest_init){
-            this->destroy(dest_init);
-         }
-         BOOST_CONTAINER_RETHROW
-      }
-      BOOST_CONTAINER_CATCH_END
-      return (constructed);
-   }
-
-   template <class InputIterator, class OutIterator>
-   static void priv_copy(InputIterator first, InputIterator last, OutIterator result)
-   {
-      for ( ; first != last; ++first, ++result)
-         Traits::assign(*result, *first);
-   }
-
-   static BOOST_CONTAINER_FORCEINLINE void priv_copy(const CharT* first, const CharT* last, CharT* result)
-   {  Traits::copy(result, first, std::size_t(last - first));  }
-
-   template <class Integer>
-   BOOST_CONTAINER_FORCEINLINE basic_string& priv_replace_dispatch(const_iterator first, const_iterator last,
-                                       Integer n, Integer x,
-                                       dtl::true_)
-   {  return this->replace(first, last, (size_type) n, (CharT) x);   }
-
-   template <class InputIter>
-   BOOST_CONTAINER_FORCEINLINE basic_string& priv_replace_dispatch(const_iterator first, const_iterator last,
-                                       InputIter f, InputIter l,
-                                       dtl::false_)
-   {
-      typedef typename boost::container::iterator_traits<InputIter>::iterator_category Category;
-      return this->priv_replace(first, last, f, l, Category());
-   }
-
-   #endif   //#ifndef BOOST_CONTAINER_DOXYGEN_INVOKED
-};
-
-#ifndef BOOST_CONTAINER_NO_CXX17_CTAD
-
-template <typename InputIterator>
-basic_string(InputIterator, InputIterator) ->
-   basic_string<typename iterator_traits<InputIterator>::value_type>;
-
-template <typename InputIterator, typename Allocator>
-basic_string(InputIterator, InputIterator, Allocator const&) ->
-   basic_string<typename iterator_traits<InputIterator>::value_type, Allocator>;
-
-#endif
-
-#ifdef BOOST_CONTAINER_DOXYGEN_INVOKED
-
-//!Typedef for a basic_string of
-//!narrow characters
-typedef basic_string
-   <char
-   ,std::char_traits<char>
-   ,new_allocator<char> >
-string;
-
-//!Typedef for a basic_string of
-//!narrow characters
-typedef basic_string
-   <wchar_t
-   ,std::char_traits<wchar_t>
-   ,new_allocator<wchar_t> >
-wstring;
-
-#else
-
-template <class CharT, class Traits, class Allocator>
-const typename basic_string<CharT,Traits,Allocator>::size_type
-   basic_string<CharT,Traits,Allocator>::npos;
-
-template<class S>
-struct is_string
-{
-   static const bool value = false;
-};
-
-template<class C, class T, class A>
-struct is_string< basic_string<C, T, A> >
-{
-   static const bool value = true;
-};
-
-#endif
-
-// ------------------------------------------------------------
-// Non-member functions.
-
-// Operator+
-
-template <class CharT, class Traits, class Allocator> inline
-   basic_string<CharT,Traits,Allocator>
-   operator+(const basic_string<CharT,Traits,Allocator>& x
-            ,const basic_string<CharT,Traits,Allocator>& y)
-{
-   typedef basic_string<CharT,Traits,Allocator> str_t;
-   typedef typename str_t::reserve_t reserve_t;
-   reserve_t reserve;
-   str_t result(reserve, x.size() + y.size(), x.get_stored_allocator());
-   result.append(x);
-   result.append(y);
-   return result;
-}
-
-template <class CharT, class Traits, class Allocator> inline
-   basic_string<CharT, Traits, Allocator> operator+
-      ( BOOST_RV_REF_BEG basic_string<CharT, Traits, Allocator> BOOST_RV_REF_END x
-      , BOOST_RV_REF_BEG basic_string<CharT, Traits, Allocator> BOOST_RV_REF_END y)
-{
-   x += y;
-   return boost::move(x);
-}
-
-template <class CharT, class Traits, class Allocator> inline
-   basic_string<CharT, Traits, Allocator> operator+
-      ( BOOST_RV_REF_BEG basic_string<CharT, Traits, Allocator> BOOST_RV_REF_END x
-      , const basic_string<CharT,Traits,Allocator>& y)
-{
-   x += y;
-   return boost::move(x);
-}
-
-template <class CharT, class Traits, class Allocator> inline
-   basic_string<CharT, Traits, Allocator> operator+
-      (const basic_string<CharT,Traits,Allocator>& x
-      ,BOOST_RV_REF_BEG basic_string<CharT, Traits, Allocator> BOOST_RV_REF_END y)
-{
-   y.insert(y.begin(), x.begin(), x.end());
-   return boost::move(y);
-}
-
-template <class CharT, class Traits, class Allocator> inline
-   basic_string<CharT, Traits, Allocator> operator+
-      (const CharT* s, basic_string<CharT, Traits, Allocator> y)
-{
-   y.insert(y.begin(), s, s + Traits::length(s));
-   return y;
-}
-
-template <class CharT, class Traits, class Allocator> inline
-   basic_string<CharT,Traits,Allocator> operator+
-      (basic_string<CharT,Traits,Allocator> x, const CharT* s)
-{
-   x += s;
-   return x;
-}
-
-template <class CharT, class Traits, class Allocator> inline
-   basic_string<CharT,Traits,Allocator> operator+
-      (CharT c, basic_string<CharT,Traits,Allocator> y)
-{
-   y.insert(y.begin(), c);
-   return y;
-}
-
-template <class CharT, class Traits, class Allocator> inline
-   basic_string<CharT,Traits,Allocator> operator+
-      (basic_string<CharT,Traits,Allocator> x, const CharT c)
-{
-   x += c;
-   return x;
-}
-
-// Operator== and operator!=
-
-template <class CharT, class Traits, class Allocator>
-inline bool
-operator==(const basic_string<CharT,Traits,Allocator>& x, const basic_string<CharT,Traits,Allocator>& y)
-{
-   return x.size() == y.size() &&
-          Traits::compare(x.data(), y.data(), x.size()) == 0;
-}
-
-template <class CharT, class Traits, class Allocator>
-inline bool
-operator==(const CharT* s, const basic_string<CharT,Traits,Allocator>& y)
-{
-   typename basic_string<CharT,Traits,Allocator>::size_type n = Traits::length(s);
-   return n == y.size() && Traits::compare(s, y.data(), n) == 0;
-}
-
-template <class CharT, class Traits, class Allocator>
-inline bool
-operator==(const basic_string<CharT,Traits,Allocator>& x, const CharT* s)
-{
-   typename basic_string<CharT,Traits,Allocator>::size_type n = Traits::length(s);
-   return x.size() == n && Traits::compare(x.data(), s, n) == 0;
-}
-
-template <class CharT, class Traits, class Allocator, template <class, class> class BasicStringView>
-inline 
-   BOOST_CONTAINER_DOC1ST( bool, 
-                           typename dtl::disable_if
-                              <is_string< BasicStringView<CharT BOOST_MOVE_I Traits> > BOOST_MOVE_I bool >::type)
-      operator==( BasicStringView<CharT,Traits> x, const basic_string<CharT,Traits,Allocator>& y)
-{
-   return x.size() == y.size() &&
-          Traits::compare(x.data(), y.data(), x.size()) == 0;
-}
-
-template <class CharT, class Traits, class Allocator, template <class, class> class BasicStringView>
-inline
-   BOOST_CONTAINER_DOC1ST( bool, 
-                           typename dtl::disable_if
-                              <is_string< BasicStringView<CharT BOOST_MOVE_I Traits> > BOOST_MOVE_I bool >::type)
-      operator==( const basic_string<CharT,Traits,Allocator>& x, BasicStringView<CharT,Traits> y)
-{
-   return x.size() == y.size() &&
-          Traits::compare(x.data(), y.data(), x.size()) == 0;
-}
-
-template <class CharT, class Traits, class Allocator>
-inline bool
-operator!=(const basic_string<CharT,Traits,Allocator>& x, const basic_string<CharT,Traits,Allocator>& y)
-   {  return !(x == y);  }
-
-template <class CharT, class Traits, class Allocator>
-inline bool
-operator!=(const CharT* s, const basic_string<CharT,Traits,Allocator>& y)
-   {  return !(s == y); }
-
-template <class CharT, class Traits, class Allocator>
-inline bool
-operator!=(const basic_string<CharT,Traits,Allocator>& x, const CharT* s)
-   {  return !(x == s);   }
-
-
-template <class CharT, class Traits, class Allocator, template <class, class> class BasicStringView>
-inline
-   BOOST_CONTAINER_DOC1ST( bool, 
-                           typename dtl::disable_if
-                              <is_string< BasicStringView<CharT BOOST_MOVE_I Traits> > BOOST_MOVE_I bool >::type)
-operator!=( BasicStringView<CharT,Traits> x, const basic_string<CharT,Traits,Allocator>& y)
-   {  return !(x == y);  }
-
-template <class CharT, class Traits, class Allocator, template <class, class> class BasicStringView>
-inline
-   BOOST_CONTAINER_DOC1ST( bool, 
-                           typename dtl::disable_if
-                              <is_string< BasicStringView<CharT BOOST_MOVE_I Traits> > BOOST_MOVE_I bool >::type)
-operator!=( const basic_string<CharT,Traits,Allocator>& x, BasicStringView<CharT,Traits> y)
-   {  return !(x == y);  }
-
-// Operator< (and also >, <=, and >=).
-template <class CharT, class Traits, class Allocator>
-inline bool
-operator<(const basic_string<CharT,Traits,Allocator>& x, const basic_string<CharT,Traits,Allocator>& y)
-{
-   return x.compare(y) < 0;
-}
-
-template <class CharT, class Traits, class Allocator>
-inline bool
-operator<(const CharT* s, const basic_string<CharT,Traits,Allocator>& y)
-{
-   return y.compare(s) > 0;
-}
-
-template <class CharT, class Traits, class Allocator>
-inline bool
-operator<(const basic_string<CharT,Traits,Allocator>& x, const CharT* s)
-{
-   return x.compare(s) < 0;
-}
-
-template <class CharT, class Traits, class Allocator, template <class, class> class BasicStringView>
-inline
-   BOOST_CONTAINER_DOC1ST( bool, 
-                           typename dtl::disable_if
-                              <is_string< BasicStringView<CharT BOOST_MOVE_I Traits> > BOOST_MOVE_I bool >::type)
-operator<( BasicStringView<CharT,Traits> x, const basic_string<CharT,Traits,Allocator>& y)
-   {  return y.compare(x) > 0;  }
-
-template <class CharT, class Traits, class Allocator, template <class, class> class BasicStringView>
-inline
-   BOOST_CONTAINER_DOC1ST( bool, 
-                           typename dtl::disable_if
-                              <is_string< BasicStringView<CharT BOOST_MOVE_I Traits> > BOOST_MOVE_I bool >::type)
-operator<(  const basic_string<CharT,Traits,Allocator>& x, BasicStringView<CharT,Traits> y)
-   {  return x.compare(y) < 0;  }
-
-template <class CharT, class Traits, class Allocator>
-inline bool
-operator>(const basic_string<CharT,Traits,Allocator>& x, const basic_string<CharT,Traits,Allocator>& y) {
-   return y < x;
-}
-
-template <class CharT, class Traits, class Allocator>
-inline bool
-operator>(const CharT* s, const basic_string<CharT,Traits,Allocator>& y) {
-   return y < s;
-}
-
-template <class CharT, class Traits, class Allocator>
-inline bool
-operator>(const basic_string<CharT,Traits,Allocator>& x, const CharT* s)
-{
-   return s < x;
-}
-
-template <class CharT, class Traits, class Allocator, template <class, class> class BasicStringView>
-inline
-   BOOST_CONTAINER_DOC1ST( bool, 
-                           typename dtl::disable_if
-                              <is_string< BasicStringView<CharT BOOST_MOVE_I Traits> > BOOST_MOVE_I bool >::type)
-operator>( BasicStringView<CharT,Traits> x, const basic_string<CharT,Traits,Allocator>& y)
-   {  return y < x;  }
-
-template <class CharT, class Traits, class Allocator, template <class, class> class BasicStringView>
-inline
-   BOOST_CONTAINER_DOC1ST( bool, 
-                           typename dtl::disable_if
-                              <is_string< BasicStringView<CharT BOOST_MOVE_I Traits> > BOOST_MOVE_I bool >::type)
-operator>( const basic_string<CharT,Traits,Allocator>& x, BasicStringView<CharT,Traits> y)
-   {  return y < x;  }
-
-template <class CharT, class Traits, class Allocator>
-inline bool
-operator<=(const basic_string<CharT,Traits,Allocator>& x, const basic_string<CharT,Traits,Allocator>& y)
-{
-  return !(y < x);
-}
-
-template <class CharT, class Traits, class Allocator>
-inline bool
-operator<=(const CharT* s, const basic_string<CharT,Traits,Allocator>& y)
-   {  return !(y < s);  }
-
-template <class CharT, class Traits, class Allocator>
-inline bool
-operator<=(const basic_string<CharT,Traits,Allocator>& x, const CharT* s)
-   {  return !(s < x);  }
-
-
-template <class CharT, class Traits, class Allocator, template <class, class> class BasicStringView>
-inline
-   BOOST_CONTAINER_DOC1ST( bool, 
-                           typename dtl::disable_if
-                              <is_string< BasicStringView<CharT BOOST_MOVE_I Traits> > BOOST_MOVE_I bool >::type)
-operator<=( BasicStringView<CharT,Traits> x, const basic_string<CharT,Traits,Allocator>& y)
-   {  return !(y < x);  }
-
-template <class CharT, class Traits, class Allocator, template <class, class> class BasicStringView>
-inline
-   BOOST_CONTAINER_DOC1ST( bool, 
-                           typename dtl::disable_if
-                              <is_string< BasicStringView<CharT BOOST_MOVE_I Traits> > BOOST_MOVE_I bool >::type)
-operator<=( const basic_string<CharT,Traits,Allocator>& x, BasicStringView<CharT,Traits> y)
-   {  return !(y < x);  }
-
-template <class CharT, class Traits, class Allocator>
-inline bool
-operator>=(const basic_string<CharT,Traits,Allocator>& x,
-           const basic_string<CharT,Traits,Allocator>& y)
-   {  return !(x < y);  }
-
-template <class CharT, class Traits, class Allocator>
-inline bool
-operator>=(const CharT* s, const basic_string<CharT,Traits,Allocator>& y)
-   {  return !(s < y);  }
-
-template <class CharT, class Traits, class Allocator>
-inline bool
-operator>=(const basic_string<CharT,Traits,Allocator>& x, const CharT* s)
-   {  return !(x < s);  }
-
-template <class CharT, class Traits, class Allocator, template <class, class> class BasicStringView>
-inline
-   BOOST_CONTAINER_DOC1ST( bool, 
-                           typename dtl::disable_if
-                              <is_string< BasicStringView<CharT BOOST_MOVE_I Traits> > BOOST_MOVE_I bool >::type)
-operator>=( BasicStringView<CharT,Traits> x, const basic_string<CharT,Traits,Allocator>& y)
-   {  return !(x < y);  }
-
-template <class CharT, class Traits, class Allocator, template <class, class> class BasicStringView>
-inline
-   BOOST_CONTAINER_DOC1ST( bool, 
-                           typename dtl::disable_if
-                              <is_string< BasicStringView<CharT BOOST_MOVE_I Traits> > BOOST_MOVE_I bool >::type)
-operator>=( const basic_string<CharT,Traits,Allocator>& x, BasicStringView<CharT,Traits> y)
-   {  return !(x < y);  }
-
-// Swap.
-template <class CharT, class Traits, class Allocator>
-inline void swap(basic_string<CharT,Traits,Allocator>& x, basic_string<CharT,Traits,Allocator>& y)
-    BOOST_NOEXCEPT_IF(BOOST_NOEXCEPT(x.swap(y)))
-{  x.swap(y);  }
-
-#ifndef BOOST_CONTAINER_DOXYGEN_INVOKED
-// I/O.
-namespace dtl {
-
-template <class CharT, class Traits>
-inline bool
-string_fill(std::basic_ostream<CharT, Traits>& os,
-                  std::basic_streambuf<CharT, Traits>* buf,
-                  std::size_t n)
-{
-   CharT f = os.fill();
-   std::size_t i;
-   bool ok = true;
-
-   for (i = 0; i < n; i++)
-      ok = ok && !Traits::eq_int_type(buf->sputc(f), Traits::eof());
-   return ok;
-}
-
-}  //namespace dtl {
-#endif   //#ifndef BOOST_CONTAINER_DOXYGEN_INVOKED
-
-template <class CharT, class Traits, class Allocator>
-std::basic_ostream<CharT, Traits>&
-operator<<(std::basic_ostream<CharT, Traits>& os, const basic_string<CharT,Traits,Allocator>& s)
-{
-   typename std::basic_ostream<CharT, Traits>::sentry sentry(os);
-   bool ok = false;
-
-   if (sentry) {
-      ok = true;
-      typename basic_string<CharT,Traits,Allocator>::size_type n = s.size();
-      typename basic_string<CharT,Traits,Allocator>::size_type pad_len = 0;
-      const bool left = (os.flags() & std::ios::left) != 0;
-      const std::size_t w = os.width(0);
-      std::basic_streambuf<CharT, Traits>* buf = os.rdbuf();
-
-      if (w != 0 && n < w)
-         pad_len = w - n;
-
-      if (!left)
-         ok = dtl::string_fill(os, buf, pad_len);
-
-      ok = ok &&
-            buf->sputn(s.data(), std::streamsize(n)) == std::streamsize(n);
-
-      if (left)
-         ok = ok && dtl::string_fill(os, buf, pad_len);
-   }
-
-   if (!ok)
-      os.setstate(std::ios_base::failbit);
-
-   return os;
-}
-
-
-template <class CharT, class Traits, class Allocator>
-std::basic_istream<CharT, Traits>&
-operator>>(std::basic_istream<CharT, Traits>& is, basic_string<CharT,Traits,Allocator>& s)
-{
-   typename std::basic_istream<CharT, Traits>::sentry sentry(is);
-
-   if (sentry) {
-      std::basic_streambuf<CharT, Traits>* buf = is.rdbuf();
-      const std::ctype<CharT>& ctype = std::use_facet<std::ctype<CharT> >(is.getloc());
-
-      s.clear();
-      std::size_t n = is.width(0);
-      if (n == 0)
-         n = static_cast<std::size_t>(-1);
-      else
-         s.reserve(n);
-
-      while (n-- > 0) {
-         typename Traits::int_type c1 = buf->sbumpc();
-
-         if (Traits::eq_int_type(c1, Traits::eof())) {
-            is.setstate(std::ios_base::eofbit);
-            break;
-         }
-         else {
-            CharT c = Traits::to_char_type(c1);
-
-            if (ctype.is(std::ctype<CharT>::space, c)) {
-               if (Traits::eq_int_type(buf->sputbackc(c), Traits::eof()))
-                  is.setstate(std::ios_base::failbit);
-               break;
-            }
-            else
-               s.push_back(c);
-         }
-      }
-
-      // If we have read no characters, then set failbit.
-      if (s.size() == 0)
-         is.setstate(std::ios_base::failbit);
-   }
-   else
-      is.setstate(std::ios_base::failbit);
-
-   return is;
-}
-
-template <class CharT, class Traits, class Allocator>
-std::basic_istream<CharT, Traits>&
-getline(std::istream& is, basic_string<CharT,Traits,Allocator>& s,CharT delim)
-{
-   typename basic_string<CharT,Traits,Allocator>::size_type nread = 0;
-   typename std::basic_istream<CharT, Traits>::sentry sentry(is, true);
-   if (sentry) {
-      std::basic_streambuf<CharT, Traits>* buf = is.rdbuf();
-      s.clear();
-
-      while (nread < s.max_size()) {
-         int c1 = buf->sbumpc();
-         if (Traits::eq_int_type(c1, Traits::eof())) {
-            is.setstate(std::ios_base::eofbit);
-            break;
-         }
-         else {
-            ++nread;
-            CharT c = Traits::to_char_type(c1);
-            if (!Traits::eq(c, delim))
-               s.push_back(c);
-            else
-               break;              // Character is extracted but not appended.
-         }
-      }
-   }
-   if (nread == 0 || nread >= s.max_size())
-      is.setstate(std::ios_base::failbit);
-
-   return is;
-}
-
-template <class CharT, class Traits, class Allocator>
-inline std::basic_istream<CharT, Traits>&
-getline(std::basic_istream<CharT, Traits>& is, basic_string<CharT,Traits,Allocator>& s)
-{
-   return getline(is, s, '\n');
-}
-
-template <class Ch, class Allocator>
-inline std::size_t hash_value(basic_string<Ch, std::char_traits<Ch>, Allocator> const& v)
-{
-   std::size_t seed = 0;
-   const Ch *first = v.data();
-
-   for(std::size_t i = 0, i_max = v.size(); i != i_max; ++i)
-   {
-      boost::intrusive::detail::hash_combine_size_t(seed, static_cast<std::size_t>(*first));
-      ++first;
-   }
-
-   return seed;
-}
-
-}}
-
-//GCC 12 has a regression for array-bounds warnings
-#if defined(BOOST_GCC) && (BOOST_GCC >= 120000) && (BOOST_GCC < 130000)
-#pragma GCC diagnostic pop
-#endif
-
-
-#ifndef BOOST_CONTAINER_DOXYGEN_INVOKED
-
-namespace boost {
-
-//!has_trivial_destructor_after_move<> == true_type
-//!specialization for optimizations
-template <class C, class T, class Allocator>
-struct has_trivial_destructor_after_move<boost::container::basic_string<C, T, Allocator> >
-{
-   typedef typename boost::container::basic_string<C, T, Allocator>::allocator_type allocator_type;
-   typedef typename ::boost::container::allocator_traits<allocator_type>::pointer pointer;
-   static const bool value = ::boost::has_trivial_destructor_after_move<allocator_type>::value &&
-                             ::boost::has_trivial_destructor_after_move<pointer>::value;
-};
-
-}
-
-#endif   //#ifndef BOOST_CONTAINER_DOXYGEN_INVOKED
-
-#include <boost/container/detail/config_end.hpp>
-
-#endif // BOOST_CONTAINER_STRING_HPP
diff --git a/src/boost/container/throw_exception.hpp b/src/boost/container/throw_exception.hpp
deleted file mode 100644
index a49f222f..00000000
--- a/src/boost/container/throw_exception.hpp
+++ /dev/null
@@ -1,295 +0,0 @@
-//////////////////////////////////////////////////////////////////////////////
-//
-// (C) Copyright Ion Gaztanaga 2012-2013. Distributed under the Boost
-// 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.
-//
-//////////////////////////////////////////////////////////////////////////////
-
-#ifndef BOOST_CONTAINER_THROW_EXCEPTION_HPP
-#define BOOST_CONTAINER_THROW_EXCEPTION_HPP
-
-#ifndef BOOST_CONFIG_HPP
-#  include <boost/config.hpp>
-#endif
-
-#if defined(BOOST_HAS_PRAGMA_ONCE)
-#  pragma once
-#endif
-
-#include <boost/container/detail/config_begin.hpp>
-#include <boost/container/detail/workaround.hpp>
-
-#ifndef BOOST_NO_EXCEPTIONS
-#include <exception> //for std exception base
-
-#  if defined(BOOST_CONTAINER_USE_STD_EXCEPTIONS)
-   #include <stdexcept> //for std::out_of_range, std::length_error, std::logic_error, std::runtime_error
-   #include <string>    //for implicit std::string conversion
-   #include <new>       //for std::bad_alloc
-
-namespace boost {
-namespace container {
-
-typedef std::bad_alloc bad_alloc_t;
-typedef std::out_of_range out_of_range_t;
-typedef std::length_error length_error_t;
-typedef std::logic_error logic_error_t;
-typedef std::runtime_error runtime_error_t;
-
-}} //namespace boost::container
-
-#  else	//!BOOST_CONTAINER_USE_STD_EXCEPTIONS
-
-namespace boost {
-namespace container {
-
-class BOOST_SYMBOL_VISIBLE exception
-   : public ::std::exception
-{
-   typedef ::std::exception std_exception_t;
-
-   public:
-
-   //msg must be a static string (guaranteed by callers)
-   explicit exception(const char *msg)
-      : std_exception_t(), m_msg(msg)
-   {}
-
-   virtual const char *what() const BOOST_NOEXCEPT_OR_NOTHROW BOOST_OVERRIDE
-   {  return m_msg ? m_msg : "unknown boost::container exception"; }
-
-   private:
-   const char *m_msg;
-};
-
-class BOOST_SYMBOL_VISIBLE bad_alloc
-   : public exception
-{
-   public:
-   bad_alloc()
-      : exception("boost::container::bad_alloc thrown")
-   {}
-};
-
-typedef bad_alloc bad_alloc_t;
-
-class BOOST_SYMBOL_VISIBLE out_of_range
-   : public exception
-{
-   public:
-   explicit out_of_range(const char *msg)
-      : exception(msg)
-   {}
-};
-
-typedef out_of_range out_of_range_t;
-
-class BOOST_SYMBOL_VISIBLE length_error
-   : public exception
-{
-   public:
-   explicit length_error(const char *msg)
-      : exception(msg)
-   {}
-};
-
-typedef length_error length_error_t;
-
-class BOOST_SYMBOL_VISIBLE logic_error
-   : public exception
-{
-   public:
-   explicit logic_error(const char *msg)
-      : exception(msg)
-   {}
-};
-
-typedef logic_error logic_error_t;
-
-class BOOST_SYMBOL_VISIBLE runtime_error
-   : public exception
-{
-   public:
-   explicit runtime_error(const char *msg)
-      : exception(msg)
-   {}
-};
-
-typedef runtime_error runtime_error_t;
-
-}  // namespace boost {
-}  // namespace container {
-
-#  endif
-#else
-   #include <boost/assert.hpp>
-   #include <cstdlib>   //for std::abort
-#endif
-
-namespace boost {
-namespace container {
-
-#if defined(BOOST_CONTAINER_USER_DEFINED_THROW_CALLBACKS)
-   //The user must provide definitions for the following functions
-
-   BOOST_NORETURN void throw_bad_alloc();
-
-   BOOST_NORETURN void throw_out_of_range(const char* str);
-
-   BOOST_NORETURN void throw_length_error(const char* str);
-
-   BOOST_NORETURN void throw_logic_error(const char* str);
-
-   BOOST_NORETURN void throw_runtime_error(const char* str);
-
-#elif defined(BOOST_NO_EXCEPTIONS)
-
-   BOOST_NORETURN inline void throw_bad_alloc()
-   {
-      BOOST_ASSERT(!"boost::container bad_alloc thrown");
-      std::abort();
-   }
-
-   BOOST_NORETURN inline void throw_out_of_range(const char* str)
-   {
-      boost::container::ignore(str);
-      BOOST_ASSERT_MSG(!"boost::container out_of_range thrown", str);
-      std::abort();
-   }
-
-   BOOST_NORETURN inline void throw_length_error(const char* str)
-   {
-      boost::container::ignore(str);
-      BOOST_ASSERT_MSG(!"boost::container length_error thrown", str);
-      std::abort();
-   }
-
-   BOOST_NORETURN inline void throw_logic_error(const char* str)
-   {
-      boost::container::ignore(str);
-      BOOST_ASSERT_MSG(!"boost::container logic_error thrown", str);
-      std::abort();
-   }
-
-   BOOST_NORETURN inline void throw_runtime_error(const char* str)
-   {
-      boost::container::ignore(str);
-      BOOST_ASSERT_MSG(!"boost::container runtime_error thrown", str);
-      std::abort();
-   }
-
-#else //defined(BOOST_NO_EXCEPTIONS)
-
-   //! Exception callback called by Boost.Container when fails to allocate the requested storage space.
-   //! <ul>
-   //! <li>If BOOST_NO_EXCEPTIONS is NOT defined and BOOST_CONTAINER_USE_STD_EXCEPTIONS is NOT defined
-   //!   <code>boost::container::bad_alloc(str)</code> is thrown.</li>
-   //!
-   //! <li>If BOOST_NO_EXCEPTIONS is NOT defined and BOOST_CONTAINER_USE_STD_EXCEPTIONS is defined
-   //!   <code>std::bad_alloc(str)</code> is thrown.</li>
-   //!
-   //! <li>If BOOST_NO_EXCEPTIONS is defined and BOOST_CONTAINER_USER_DEFINED_THROW_CALLBACKS
-   //!   is NOT defined <code>BOOST_ASSERT(!"boost::container bad_alloc thrown")</code> is called
-   //!   and <code>std::abort()</code> if the former returns.</li>
-   //!
-   //! <li>If BOOST_NO_EXCEPTIONS and BOOST_CONTAINER_USER_DEFINED_THROW_CALLBACKS are defined
-   //!   the user must provide an implementation and the function should not return.</li>
-   //! </ul>
-   BOOST_NORETURN inline void throw_bad_alloc()
-   {
-      throw bad_alloc_t();
-   }
-
-   //! Exception callback called by Boost.Container to signal arguments out of range.
-   //! <ul>
-   //! <li>If BOOST_NO_EXCEPTIONS is NOT defined and BOOST_CONTAINER_USE_STD_EXCEPTIONS is NOT defined
-   //!   <code>boost::container::out_of_range(str)</code> is thrown.</li>
-   //!
-   //! <li>If BOOST_NO_EXCEPTIONS is NOT defined and BOOST_CONTAINER_USE_STD_EXCEPTIONS is defined
-   //!   <code>std::out_of_range(str)</code> is thrown.</li>
-   //!
-   //! <li>If BOOST_NO_EXCEPTIONS is defined and BOOST_CONTAINER_USER_DEFINED_THROW_CALLBACKS
-   //!   is NOT defined <code>BOOST_ASSERT_MSG(!"boost::container out_of_range thrown", str)</code> is called
-   //!   and <code>std::abort()</code> if the former returns.</li>
-   //!
-   //! <li>If BOOST_NO_EXCEPTIONS and BOOST_CONTAINER_USER_DEFINED_THROW_CALLBACKS are defined
-   //!   the user must provide an implementation and the function should not return.</li>
-   //! </ul>
-   BOOST_NORETURN inline void throw_out_of_range(const char* str)
-   {
-      throw out_of_range_t(str);
-   }
-
-   //! Exception callback called by Boost.Container to signal errors resizing.
-   //! <ul>
-   //!
-   //! <li>If BOOST_NO_EXCEPTIONS is NOT defined and BOOST_CONTAINER_USE_STD_EXCEPTIONS is NOT defined
-   //!   <code>boost::container::length_error(str)</code> is thrown.</li>
-   //!
-   //! <li>If BOOST_NO_EXCEPTIONS is NOT defined and BOOST_CONTAINER_USE_STD_EXCEPTIONS is defined
-   //!   <code>std::length_error(str)</code> is thrown.</li>
-   //!
-   //! <li>If BOOST_NO_EXCEPTIONS is defined and BOOST_CONTAINER_USER_DEFINED_THROW_CALLBACKS
-   //!   is NOT defined <code>BOOST_ASSERT_MSG(!"boost::container length_error thrown", str)</code> is called
-   //!   and <code>std::abort()</code> if the former returns.</li>
-   //!
-   //! <li>If BOOST_NO_EXCEPTIONS and BOOST_CONTAINER_USER_DEFINED_THROW_CALLBACKS are defined
-   //!   the user must provide an implementation and the function should not return.</li>
-   //! </ul>
-   BOOST_NORETURN inline void throw_length_error(const char* str)
-   {
-      throw length_error_t(str);
-   }
-
-   //! Exception callback called by Boost.Container  to report errors in the internal logical
-   //! of the program, such as violation of logical preconditions or class invariants.
-   //! <ul>
-   //!
-   //! <li>If BOOST_NO_EXCEPTIONS is NOT defined and BOOST_CONTAINER_USE_STD_EXCEPTIONS is NOT defined
-   //!   <code>boost::container::logic_error(str)</code> is thrown.</li>
-   //!
-   //! <li>If BOOST_NO_EXCEPTIONS is NOT defined and BOOST_CONTAINER_USE_STD_EXCEPTIONS is defined
-   //!   <code>std::logic_error(str)</code> is thrown.</li>
-   //!
-   //! <li>If BOOST_NO_EXCEPTIONS is defined and BOOST_CONTAINER_USER_DEFINED_THROW_CALLBACKS
-   //!   is NOT defined <code>BOOST_ASSERT_MSG(!"boost::container logic_error thrown", str)</code> is called
-   //!   and <code>std::abort()</code> if the former returns.</li>
-   //!
-   //! <li>If BOOST_NO_EXCEPTIONS and BOOST_CONTAINER_USER_DEFINED_THROW_CALLBACKS are defined
-   //!   the user must provide an implementation and the function should not return.</li>
-   //! </ul>
-   BOOST_NORETURN inline void throw_logic_error(const char* str)
-   {
-      throw logic_error_t(str);
-   }
-
-   //! Exception callback called by Boost.Container  to report errors that can only be detected during runtime.
-   //! <ul>
-   //! <li>If BOOST_NO_EXCEPTIONS is NOT defined and BOOST_CONTAINER_USE_STD_EXCEPTIONS is NOT defined
-   //!   <code>boost::container::runtime_error(str)</code> is thrown.</li>
-   //!
-   //! <li>If BOOST_NO_EXCEPTIONS is NOT defined and BOOST_CONTAINER_USE_STD_EXCEPTIONS is defined
-   //!   <code>std::runtime_error(str)</code> is thrown.</li>
-   //!
-   //! <li>If BOOST_NO_EXCEPTIONS is defined and BOOST_CONTAINER_USER_DEFINED_THROW_CALLBACKS
-   //!   is NOT defined <code>BOOST_ASSERT_MSG(!"boost::container runtime_error thrown", str)</code> is called
-   //!   and <code>std::abort()</code> if the former returns.</li>
-   //!
-   //! <li>If BOOST_NO_EXCEPTIONS and BOOST_CONTAINER_USER_DEFINED_THROW_CALLBACKS are defined
-   //!   the user must provide an implementation and the function should not return.</li>
-   //! </ul>
-   BOOST_NORETURN inline void throw_runtime_error(const char* str)
-   {
-      throw runtime_error_t(str);
-   }
-
-#endif
-
-}}  //namespace boost { namespace container {
-
-#include <boost/container/detail/config_end.hpp>
-
-#endif //#ifndef BOOST_CONTAINER_THROW_EXCEPTION_HPP
diff --git a/src/boost/container/vector.hpp b/src/boost/container/vector.hpp
deleted file mode 100644
index d5d2f1ea..00000000
--- a/src/boost/container/vector.hpp
+++ /dev/null
@@ -1,3188 +0,0 @@
-//////////////////////////////////////////////////////////////////////////////
-//
-// (C) Copyright Ion Gaztanaga 2005-2015. Distributed under the Boost
-// 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.
-//
-//////////////////////////////////////////////////////////////////////////////
-
-#ifndef BOOST_CONTAINER_CONTAINER_VECTOR_HPP
-#define BOOST_CONTAINER_CONTAINER_VECTOR_HPP
-
-#ifndef BOOST_CONFIG_HPP
-#  include <boost/config.hpp>
-#endif
-
-#if defined(BOOST_HAS_PRAGMA_ONCE)
-#  pragma once
-#endif
-
-#include <boost/container/detail/config_begin.hpp>
-#include <boost/container/detail/workaround.hpp>
-
-// container
-#include <boost/container/container_fwd.hpp>
-#include <boost/container/allocator_traits.hpp>
-#include <boost/container/new_allocator.hpp> //new_allocator
-#include <boost/container/throw_exception.hpp>
-#include <boost/container/options.hpp>
-// container detail
-#include <boost/container/detail/advanced_insert_int.hpp>
-#include <boost/container/detail/algorithm.hpp> //equal()
-#include <boost/container/detail/alloc_helpers.hpp>
-#include <boost/container/detail/allocation_type.hpp>
-#include <boost/container/detail/copy_move_algo.hpp>
-#include <boost/container/detail/destroyers.hpp>
-#include <boost/container/detail/iterator.hpp>
-#include <boost/container/detail/iterators.hpp>
-#include <boost/move/detail/iterator_to_raw_pointer.hpp>
-#include <boost/container/detail/mpl.hpp>
-#include <boost/container/detail/next_capacity.hpp>
-#include <boost/container/detail/value_functors.hpp>
-#include <boost/move/detail/to_raw_pointer.hpp>
-#include <boost/container/detail/type_traits.hpp>
-#include <boost/container/detail/version_type.hpp>
-// intrusive
-#include <boost/intrusive/pointer_traits.hpp>
-// move
-#include <boost/move/adl_move_swap.hpp>
-#include <boost/move/iterator.hpp>
-#include <boost/move/traits.hpp>
-#include <boost/move/utility_core.hpp>
-// move/detail
-#if defined(BOOST_NO_CXX11_VARIADIC_TEMPLATES)
-#include <boost/move/detail/fwd_macros.hpp>
-#endif
-#include <boost/move/detail/move_helpers.hpp>
-// move/algo
-#include <boost/move/algo/adaptive_merge.hpp>
-#include <boost/move/algo/unique.hpp>
-#include <boost/move/algo/predicate.hpp>
-#include <boost/move/algo/detail/set_difference.hpp>
-// other
-#include <boost/assert.hpp>
-#include <boost/cstdint.hpp>
-
-//std
-#if !defined(BOOST_NO_CXX11_HDR_INITIALIZER_LIST)
-#include <initializer_list>   //for std::initializer_list
-#endif
-
-namespace boost {
-namespace container {
-
-#ifndef BOOST_CONTAINER_DOXYGEN_INVOKED
-
-
-template <class Pointer, bool IsConst>
-class vec_iterator
-{
-   public:
-   typedef std::random_access_iterator_tag                                          iterator_category;
-   #ifdef BOOST_MOVE_CONTIGUOUS_ITERATOR_TAG
-   typedef std::contiguous_iterator_tag                                             iterator_concept;
-   #endif
-   typedef typename boost::intrusive::pointer_traits<Pointer>::element_type         value_type;
-
-   //Defining element_type to make libstdc++'s std::pointer_traits well-formed leads to ambiguity
-   //due to LWG3446. So we need to specialize std::pointer_traits. See 
-   //https://gcc.gnu.org/bugzilla/show_bug.cgi?id=96416 for details. Many thanks to Jonathan Wakely
-   //for explaining the issue.
-   #ifndef BOOST_GNU_STDLIB
-   //Define element_
-   typedef typename boost::intrusive::pointer_traits<Pointer>::element_type         element_type;
-   #endif
-   typedef typename boost::intrusive::pointer_traits<Pointer>::difference_type      difference_type;
-   typedef typename boost::intrusive::pointer_traits<Pointer>::size_type            size_type;
-   typedef typename dtl::if_c
-      < IsConst
-      , typename boost::intrusive::pointer_traits<Pointer>::template
-                                 rebind_pointer<const value_type>::type
-      , Pointer
-      >::type                                                                       pointer;
-   typedef typename boost::intrusive::pointer_traits<pointer>                       ptr_traits;
-   typedef typename ptr_traits::reference                                           reference;
-
-   #ifndef BOOST_CONTAINER_DOXYGEN_INVOKED
-   private:
-   Pointer m_ptr;
-
-   class nat
-   {
-      public:
-      Pointer get_ptr() const
-      { return Pointer();  }
-   };
-   typedef typename dtl::if_c< IsConst
-                             , vec_iterator<Pointer, false>
-                             , nat>::type                                           nonconst_iterator;
-
-   public:
-   BOOST_CONTAINER_FORCEINLINE
-      const Pointer &get_ptr() const BOOST_NOEXCEPT_OR_NOTHROW
-   {  return   m_ptr;  }
-
-   BOOST_CONTAINER_FORCEINLINE
-      Pointer &get_ptr() BOOST_NOEXCEPT_OR_NOTHROW
-   {  return   m_ptr;  }
-
-   BOOST_CONTAINER_FORCEINLINE explicit vec_iterator(Pointer ptr) BOOST_NOEXCEPT_OR_NOTHROW
-      : m_ptr(ptr)
-   {}
-   #endif   //#ifndef BOOST_CONTAINER_DOXYGEN_INVOKED
-
-   public:
-
-   //Constructors
-   BOOST_CONTAINER_FORCEINLINE vec_iterator() BOOST_NOEXCEPT_OR_NOTHROW
-      : m_ptr()   //Value initialization to achieve "null iterators" (N3644)
-   {}
-
-   BOOST_CONTAINER_FORCEINLINE vec_iterator(const vec_iterator& other) BOOST_NOEXCEPT_OR_NOTHROW
-      :  m_ptr(other.get_ptr())
-   {}
-
-   BOOST_CONTAINER_FORCEINLINE vec_iterator(const nonconst_iterator &other) BOOST_NOEXCEPT_OR_NOTHROW
-      :  m_ptr(other.get_ptr())
-   {}
-
-   BOOST_CONTAINER_FORCEINLINE vec_iterator & operator=(const vec_iterator& other) BOOST_NOEXCEPT_OR_NOTHROW
-   {  m_ptr = other.get_ptr();   return *this;  }
-
-   //Pointer like operators
-   BOOST_CONTAINER_ATTRIBUTE_NODISCARD BOOST_CONTAINER_FORCEINLINE
-      reference operator*()   const BOOST_NOEXCEPT_OR_NOTHROW
-   {  BOOST_ASSERT(!!m_ptr);  return *m_ptr;  }
-
-   BOOST_CONTAINER_ATTRIBUTE_NODISCARD BOOST_CONTAINER_FORCEINLINE
-      pointer operator->()  const BOOST_NOEXCEPT_OR_NOTHROW
-   {  return m_ptr;  }
-
-   BOOST_CONTAINER_ATTRIBUTE_NODISCARD BOOST_CONTAINER_FORCEINLINE
-      reference operator[](difference_type off) const BOOST_NOEXCEPT_OR_NOTHROW
-   {  BOOST_ASSERT(!!m_ptr);  return m_ptr[off];  }
-
-   //Increment / Decrement
-   BOOST_CONTAINER_FORCEINLINE vec_iterator& operator++() BOOST_NOEXCEPT_OR_NOTHROW
-   {  BOOST_ASSERT(!!m_ptr); ++m_ptr;  return *this; }
-
-   BOOST_CONTAINER_FORCEINLINE vec_iterator operator++(int) BOOST_NOEXCEPT_OR_NOTHROW
-   {  BOOST_ASSERT(!!m_ptr); return vec_iterator(m_ptr++); }
-
-   BOOST_CONTAINER_FORCEINLINE vec_iterator& operator--() BOOST_NOEXCEPT_OR_NOTHROW
-   {  BOOST_ASSERT(!!m_ptr); --m_ptr; return *this;  }
-
-   BOOST_CONTAINER_FORCEINLINE vec_iterator operator--(int) BOOST_NOEXCEPT_OR_NOTHROW
-   {  BOOST_ASSERT(!!m_ptr); return vec_iterator(m_ptr--); }
-
-   //Arithmetic
-   BOOST_CONTAINER_FORCEINLINE vec_iterator& operator+=(difference_type off) BOOST_NOEXCEPT_OR_NOTHROW
-   {  BOOST_ASSERT(m_ptr || !off); m_ptr += off; return *this;   }
-
-   BOOST_CONTAINER_FORCEINLINE vec_iterator& operator-=(difference_type off) BOOST_NOEXCEPT_OR_NOTHROW
-   {  BOOST_ASSERT(m_ptr || !off); m_ptr -= off; return *this;   }
-
-   BOOST_CONTAINER_ATTRIBUTE_NODISCARD BOOST_CONTAINER_FORCEINLINE
-      friend vec_iterator operator+(const vec_iterator &x, difference_type off) BOOST_NOEXCEPT_OR_NOTHROW
-   {  BOOST_ASSERT(x.m_ptr || !off); return vec_iterator(x.m_ptr+off);  }
-
-   BOOST_CONTAINER_ATTRIBUTE_NODISCARD BOOST_CONTAINER_FORCEINLINE
-      friend vec_iterator operator+(difference_type off, vec_iterator right) BOOST_NOEXCEPT_OR_NOTHROW
-   {  BOOST_ASSERT(right.m_ptr || !off); right.m_ptr += off;  return right; }
-
-   BOOST_CONTAINER_ATTRIBUTE_NODISCARD BOOST_CONTAINER_FORCEINLINE
-      friend vec_iterator operator-(vec_iterator left, difference_type off) BOOST_NOEXCEPT_OR_NOTHROW
-   {  BOOST_ASSERT(left.m_ptr || !off); left.m_ptr -= off;  return left; }
-
-   //Difference
-   BOOST_CONTAINER_ATTRIBUTE_NODISCARD BOOST_CONTAINER_FORCEINLINE
-      friend difference_type operator-(const vec_iterator &left, const vec_iterator& right) BOOST_NOEXCEPT_OR_NOTHROW
-   {  return left.m_ptr - right.m_ptr;   }
-
-   //Comparison operators
-   BOOST_CONTAINER_ATTRIBUTE_NODISCARD BOOST_CONTAINER_FORCEINLINE
-      friend bool operator==   (const vec_iterator& l, const vec_iterator& r) BOOST_NOEXCEPT_OR_NOTHROW
-   {  return l.m_ptr == r.m_ptr;  }
-
-   BOOST_CONTAINER_ATTRIBUTE_NODISCARD BOOST_CONTAINER_FORCEINLINE
-      friend bool operator!=   (const vec_iterator& l, const vec_iterator& r) BOOST_NOEXCEPT_OR_NOTHROW
-   {  return l.m_ptr != r.m_ptr;  }
-
-   BOOST_CONTAINER_ATTRIBUTE_NODISCARD BOOST_CONTAINER_FORCEINLINE
-      friend bool operator<    (const vec_iterator& l, const vec_iterator& r) BOOST_NOEXCEPT_OR_NOTHROW
-   {  return l.m_ptr < r.m_ptr;  }
-
-   BOOST_CONTAINER_ATTRIBUTE_NODISCARD BOOST_CONTAINER_FORCEINLINE
-      friend bool operator<=   (const vec_iterator& l, const vec_iterator& r) BOOST_NOEXCEPT_OR_NOTHROW
-   {  return l.m_ptr <= r.m_ptr;  }
-
-   BOOST_CONTAINER_ATTRIBUTE_NODISCARD BOOST_CONTAINER_FORCEINLINE
-      friend bool operator>    (const vec_iterator& l, const vec_iterator& r) BOOST_NOEXCEPT_OR_NOTHROW
-   {  return l.m_ptr > r.m_ptr;  }
-
-   BOOST_CONTAINER_ATTRIBUTE_NODISCARD BOOST_CONTAINER_FORCEINLINE
-      friend bool operator>=   (const vec_iterator& l, const vec_iterator& r) BOOST_NOEXCEPT_OR_NOTHROW
-   {  return l.m_ptr >= r.m_ptr;  }
-};
-
-template<class BiDirPosConstIt, class BiDirValueIt>
-struct vector_insert_ordered_cursor
-{
-   typedef typename iterator_traits<BiDirPosConstIt>::value_type  size_type;
-   typedef typename iterator_traits<BiDirValueIt>::reference      reference;
-
-   BOOST_CONTAINER_FORCEINLINE vector_insert_ordered_cursor(BiDirPosConstIt posit, BiDirValueIt valueit)
-      : last_position_it(posit), last_value_it(valueit)
-   {}
-
-   void operator --()
-   {
-      --last_value_it;
-      --last_position_it;
-      while(this->get_pos() == size_type(-1)){
-         --last_value_it;
-         --last_position_it;
-      }
-   }
-
-   BOOST_CONTAINER_FORCEINLINE size_type get_pos() const
-   {  return *last_position_it;  }
-
-   BOOST_CONTAINER_FORCEINLINE reference get_val()
-   {  return *last_value_it;  }
-
-   BiDirPosConstIt last_position_it;
-   BiDirValueIt last_value_it;
-};
-
-template<class Pointer, bool IsConst>
-BOOST_CONTAINER_FORCEINLINE const Pointer &vector_iterator_get_ptr(const vec_iterator<Pointer, IsConst> &it) BOOST_NOEXCEPT_OR_NOTHROW
-{  return   it.get_ptr();  }
-
-template<class Pointer, bool IsConst>
-BOOST_CONTAINER_FORCEINLINE Pointer &get_ptr(vec_iterator<Pointer, IsConst> &it) BOOST_NOEXCEPT_OR_NOTHROW
-{  return  it.get_ptr();  }
-
-struct initial_capacity_t {};
-
-struct vector_uninitialized_size_t {};
-static const vector_uninitialized_size_t vector_uninitialized_size = vector_uninitialized_size_t();
-
-struct maybe_initial_capacity_t {};
-
-template <class T>
-struct vector_value_traits_base
-{
-   static const bool trivial_dctr = dtl::is_trivially_destructible<T>::value;
-   static const bool trivial_dctr_after_move = has_trivial_destructor_after_move<T>::value;
-};
-
-template <class Allocator>
-struct vector_value_traits
-   : public vector_value_traits_base<typename Allocator::value_type>
-{
-   typedef vector_value_traits_base<typename Allocator::value_type> base_t;
-   //This is the anti-exception array destructor
-   //to deallocate values already constructed
-   typedef typename dtl::if_c
-      <base_t::trivial_dctr
-      ,dtl::null_scoped_destructor_n<Allocator>
-      ,dtl::scoped_destructor_n<Allocator>
-      >::type   ArrayDestructor;
-   //This is the anti-exception array deallocator
-   typedef dtl::scoped_array_deallocator<Allocator> ArrayDeallocator;
-};
-
-//!This struct deallocates and allocated memory
-template < class Allocator
-         , class StoredSizeType
-         , class AllocatorVersion = typename dtl::version<Allocator>::type
-         >
-struct vector_alloc_holder
-   : public Allocator
-{
-   private:
-   BOOST_MOVABLE_BUT_NOT_COPYABLE(vector_alloc_holder)
-
-   public:
-   typedef Allocator                                           allocator_type;
-   typedef StoredSizeType                                      stored_size_type;
-   typedef boost::container::allocator_traits<allocator_type>  allocator_traits_type;
-   typedef typename allocator_traits_type::pointer             pointer;
-   typedef typename allocator_traits_type::size_type           size_type;
-   typedef typename allocator_traits_type::value_type          value_type;
-
-
-   private:
-
-   template<class SizeType>
-   void do_initial_capacity(SizeType initial_capacity)
-   {
-      if (BOOST_UNLIKELY(initial_capacity > size_type(-1))) {
-         boost::container::throw_length_error("get_next_capacity, allocator's max size reached");
-      }
-      else if (initial_capacity) {
-         pointer reuse = pointer();
-         size_type final_cap = static_cast<size_type>(initial_capacity);
-         m_start = this->allocation_command(allocate_new, final_cap, final_cap, reuse);
-         this->set_stored_capacity(final_cap);
-      }
-   }
-
-   template<class SizeType>
-   void do_maybe_initial_capacity(pointer p, SizeType initial_capacity)
-   {
-      if (BOOST_UNLIKELY(initial_capacity > size_type(-1))) {
-         boost::container::throw_length_error("get_next_capacity, allocator's max size reached");
-      }
-      else if (p) {
-         m_start = p;
-      }
-      else {
-         BOOST_ASSERT(initial_capacity > 0);
-         pointer reuse = pointer();
-         size_type final_cap = static_cast<size_type>(initial_capacity);
-         m_start = this->allocation_command(allocate_new, final_cap, final_cap, reuse);
-         this->set_stored_capacity(final_cap);
-      }
-   }
-
-   public:
-
-   BOOST_CONTAINER_FORCEINLINE
-      static bool is_propagable_from(const allocator_type &from_alloc, pointer p, const allocator_type &to_alloc, bool const propagate_allocator)
-   {
-      (void)propagate_allocator; (void)p; (void)to_alloc; (void)from_alloc;
-      const bool all_storage_propagable = !allocator_traits_type::is_partially_propagable::value ||
-                                          !allocator_traits_type::storage_is_unpropagable(from_alloc, p);
-      return all_storage_propagable &&
-         (propagate_allocator || allocator_traits_type::is_always_equal::value || allocator_traits_type::equal(from_alloc, to_alloc));
-   }
-
-   BOOST_CONTAINER_FORCEINLINE
-      static bool are_swap_propagable(const allocator_type &l_a, pointer l_p, const allocator_type &r_a, pointer r_p, bool const propagate_allocator)
-   {
-      (void)propagate_allocator; (void)l_p; (void)r_p; (void)l_a; (void)r_a;
-      const bool all_storage_propagable = !allocator_traits_type::is_partially_propagable::value || 
-              !(allocator_traits_type::storage_is_unpropagable(l_a, l_p) || allocator_traits_type::storage_is_unpropagable(r_a, r_p));
-      return all_storage_propagable && (propagate_allocator || allocator_traits_type::equal(l_a, r_a));
-   }
-
-   //Constructor, does not throw
-   vector_alloc_holder()
-      BOOST_NOEXCEPT_IF(dtl::is_nothrow_default_constructible<allocator_type>::value)
-      : allocator_type(), m_start(), m_size(), m_capacity()
-   {}
-
-   //Constructor, does not throw
-   template<class AllocConvertible>
-   explicit vector_alloc_holder(BOOST_FWD_REF(AllocConvertible) a) BOOST_NOEXCEPT_OR_NOTHROW
-      : allocator_type(boost::forward<AllocConvertible>(a)), m_start(), m_size(), m_capacity()
-   {}
-
-
-   template<class AllocConvertible, class SizeType>
-   vector_alloc_holder(vector_uninitialized_size_t, BOOST_FWD_REF(AllocConvertible) a, SizeType initial_size)
-      : allocator_type(boost::forward<AllocConvertible>(a))
-      , m_start()
-      //Size is initialized here so vector should only call uninitialized_xxx after this
-      , m_size(static_cast<stored_size_type>(initial_size))
-      , m_capacity()
-   {  this->do_initial_capacity(initial_size);  }
-
-   template<class SizeType>
-   vector_alloc_holder(vector_uninitialized_size_t, SizeType initial_size)
-      : allocator_type()
-      , m_start()
-      //Size is initialized here so vector should only call uninitialized_xxx after this
-      , m_size(static_cast<stored_size_type>(initial_size))
-      , m_capacity()
-   {  this->do_initial_capacity(initial_size);  }
-
-   vector_alloc_holder(initial_capacity_t, pointer p, size_type n)
-      BOOST_NOEXCEPT_IF(dtl::is_nothrow_default_constructible<allocator_type>::value)
-      : allocator_type()
-      , m_start(p)
-      , m_size()
-      //n is guaranteed to fit into stored_size_type
-      , m_capacity(static_cast<stored_size_type>(n))
-   {}
-
-   template<class AllocFwd>
-   vector_alloc_holder(initial_capacity_t, pointer p, size_type n, BOOST_FWD_REF(AllocFwd) a)
-      : allocator_type(::boost::forward<AllocFwd>(a))
-      , m_start(p)
-      , m_size()
-      , m_capacity(n)
-   {}
-
-   template<class AllocConvertible, class SizeType>
-   vector_alloc_holder(maybe_initial_capacity_t, pointer p, SizeType initial_capacity, BOOST_FWD_REF(AllocConvertible) a)
-      : allocator_type(boost::forward<AllocConvertible>(a))
-      //, m_start()
-      //Size is initialized here so vector should only call uninitialized_xxx after this
-      , m_size()
-      , m_capacity(static_cast<stored_size_type>(initial_capacity))
-   {  this->do_maybe_initial_capacity(p, initial_capacity);  }
-
-   template<class SizeType>
-   vector_alloc_holder(maybe_initial_capacity_t, pointer p, SizeType initial_capacity)
-      : allocator_type()
-      //, m_start()
-      //Size is initialized here so vector should only call uninitialized_xxx after this
-      , m_size()
-      , m_capacity(static_cast<stored_size_type>(initial_capacity))
-   {  this->do_maybe_initial_capacity(p, initial_capacity);  }
-
-   vector_alloc_holder(BOOST_RV_REF(vector_alloc_holder) holder) BOOST_NOEXCEPT_OR_NOTHROW
-      : allocator_type(BOOST_MOVE_BASE(allocator_type, holder))
-      , m_start(holder.m_start)
-      , m_size(holder.m_size)
-      , m_capacity(holder.m_capacity)
-   {
-      holder.m_start = pointer();
-      holder.m_size = holder.m_capacity = 0;
-   }
-
-   BOOST_CONTAINER_FORCEINLINE ~vector_alloc_holder() BOOST_NOEXCEPT_OR_NOTHROW
-   {
-      if(this->m_capacity){
-         this->deallocate(this->m_start, this->m_capacity);
-      }
-   }
-
-   BOOST_CONTAINER_FORCEINLINE void set_stored_size(size_type s) BOOST_NOEXCEPT_OR_NOTHROW
-      {  this->m_size = static_cast<stored_size_type>(s);   }
-
-   BOOST_CONTAINER_FORCEINLINE void dec_stored_size(size_type s) BOOST_NOEXCEPT_OR_NOTHROW
-      {  this->m_size = static_cast<stored_size_type>(this->m_size - s);   }
-
-   BOOST_CONTAINER_FORCEINLINE void inc_stored_size(size_type s) BOOST_NOEXCEPT_OR_NOTHROW
-      {  this->m_size = static_cast<stored_size_type>(this->m_size + s);   }
-
-   BOOST_CONTAINER_FORCEINLINE void set_stored_capacity(size_type c) BOOST_NOEXCEPT_OR_NOTHROW
-      {  this->m_capacity = static_cast<stored_size_type>(c);  }
-
-   BOOST_CONTAINER_FORCEINLINE pointer allocation_command(boost::container::allocation_type command,
-                                 size_type limit_size, size_type &prefer_in_recvd_out_size, pointer &reuse)
-   {
-      typedef typename dtl::version<allocator_type>::type alloc_version;
-      return this->priv_allocation_command(alloc_version(), command, limit_size, prefer_in_recvd_out_size, reuse);
-   }
-
-   BOOST_CONTAINER_FORCEINLINE pointer allocate(size_type n)
-   {
-      const size_type max_alloc = allocator_traits_type::max_size(this->alloc());
-      const size_type max = max_alloc <= stored_size_type(-1) ? max_alloc : stored_size_type(-1);
-      if (BOOST_UNLIKELY(max < n) )
-         boost::container::throw_length_error("get_next_capacity, allocator's max size reached");
-
-      return allocator_traits_type::allocate(this->alloc(), n);
-   }
-
-   BOOST_CONTAINER_FORCEINLINE void deallocate(const pointer &p, size_type n)
-   {
-      allocator_traits_type::deallocate(this->alloc(), p, n);
-   }
-
-   bool try_expand_fwd(size_type at_least)
-   {
-      //There is not enough memory, try to expand the old one
-      const size_type new_cap = size_type(this->capacity() + at_least);
-      size_type real_cap = new_cap;
-      pointer reuse = this->start();
-      bool const success = !!this->allocation_command(expand_fwd, new_cap, real_cap, reuse);
-      //Check for forward expansion
-      if(success){
-         #ifdef BOOST_CONTAINER_VECTOR_ALLOC_STATS
-         ++this->num_expand_fwd;
-         #endif
-         this->capacity(real_cap);
-      }
-      return success;
-   }
-
-   template<class GrowthFactorType>
-   size_type next_capacity(size_type additional_objects) const
-   {
-      BOOST_ASSERT(additional_objects > size_type(this->m_capacity - this->m_size));
-      size_type max = allocator_traits_type::max_size(this->alloc());
-      (clamp_by_stored_size_type<size_type>)(max, stored_size_type());
-      const size_type remaining_cap = size_type(max - size_type(this->m_capacity));
-      const size_type min_additional_cap = size_type(additional_objects - size_type(this->m_capacity - this->m_size));
-
-      if ( remaining_cap < min_additional_cap )
-         boost::container::throw_length_error("get_next_capacity, allocator's max size reached");
-
-      return GrowthFactorType()( size_type(this->m_capacity), min_additional_cap, max);
-   }
-
-   pointer           m_start;
-   stored_size_type  m_size;
-   stored_size_type  m_capacity;
-
-   void swap_resources(vector_alloc_holder &x) BOOST_NOEXCEPT_OR_NOTHROW
-   {
-      boost::adl_move_swap(this->m_start, x.m_start);
-      boost::adl_move_swap(this->m_size, x.m_size);
-      boost::adl_move_swap(this->m_capacity, x.m_capacity);
-   }
-
-   void steal_resources(vector_alloc_holder &x) BOOST_NOEXCEPT_OR_NOTHROW
-   {
-      this->m_start     = x.m_start;
-      this->m_size      = x.m_size;
-      this->m_capacity  = x.m_capacity;
-      x.m_start = pointer();
-      x.m_size = x.m_capacity = 0;
-   }
-
-   BOOST_CONTAINER_FORCEINLINE allocator_type &alloc() BOOST_NOEXCEPT_OR_NOTHROW
-   {  return *this;  }
-
-   BOOST_CONTAINER_FORCEINLINE const allocator_type &alloc() const BOOST_NOEXCEPT_OR_NOTHROW
-   {  return *this;  }
-
-   BOOST_CONTAINER_FORCEINLINE const pointer   &start() const     BOOST_NOEXCEPT_OR_NOTHROW
-      {  return m_start;  }
-   BOOST_CONTAINER_FORCEINLINE       size_type capacity() const     BOOST_NOEXCEPT_OR_NOTHROW
-      {  return m_capacity;  }
-   BOOST_CONTAINER_FORCEINLINE void start(const pointer &p)       BOOST_NOEXCEPT_OR_NOTHROW
-      {  m_start = p;  }
-   BOOST_CONTAINER_FORCEINLINE void capacity(const size_type &c)  BOOST_NOEXCEPT_OR_NOTHROW
-      {  BOOST_ASSERT( c <= stored_size_type(-1)); this->set_stored_capacity(c);  }
-
-   static BOOST_CONTAINER_FORCEINLINE void on_capacity_overflow()
-   { }
-
-   private:
-   void priv_first_allocation(size_type cap)
-   {
-      if(cap){
-         pointer reuse = pointer();
-         m_start = this->allocation_command(allocate_new, cap, cap, reuse);
-         m_capacity = cap;
-         #ifdef BOOST_CONTAINER_VECTOR_ALLOC_STATS
-         ++this->num_alloc;
-         #endif
-      }
-   }
-
-   pointer priv_allocation_command(version_1, boost::container::allocation_type command,
-                         size_type limit_size,
-                         size_type &prefer_in_recvd_out_size,
-                         pointer &reuse)
-   {
-      (void)command;
-      BOOST_ASSERT( (command & allocate_new));
-      BOOST_ASSERT(!(command & nothrow_allocation));
-      //First detect overflow on smaller stored_size_types
-      if (BOOST_UNLIKELY(limit_size > stored_size_type(-1))){
-         boost::container::throw_length_error("get_next_capacity, allocator's max size reached");
-      }
-      (clamp_by_stored_size_type<size_type>)(prefer_in_recvd_out_size, stored_size_type());
-      pointer const p = this->allocate(prefer_in_recvd_out_size);
-      reuse = pointer();
-      return p;
-   }
-
-   pointer priv_allocation_command(version_2, boost::container::allocation_type command,
-                         size_type limit_size,
-                         size_type &prefer_in_recvd_out_size,
-                         pointer &reuse)
-   {
-      //First detect overflow on smaller stored_size_types
-      if (BOOST_UNLIKELY(limit_size > stored_size_type(-1))){
-         boost::container::throw_length_error("get_next_capacity, allocator's max size reached");
-      }
-      (clamp_by_stored_size_type<size_type>)(prefer_in_recvd_out_size, stored_size_type());
-      //Allocate memory 
-      pointer p = this->alloc().allocation_command(command, limit_size, prefer_in_recvd_out_size, reuse);
-      //If after allocation prefer_in_recvd_out_size is not representable by stored_size_type, truncate it.
-      (clamp_by_stored_size_type<size_type>)(prefer_in_recvd_out_size, stored_size_type());
-      return p;
-   }
-};
-
-//!This struct deallocates and allocated memory
-template <class Allocator, class StoredSizeType>
-struct vector_alloc_holder<Allocator, StoredSizeType, version_0>
-   : public Allocator
-{
-   private:
-   BOOST_MOVABLE_BUT_NOT_COPYABLE(vector_alloc_holder)
-
-   public:
-   typedef Allocator                                     allocator_type;
-   typedef boost::container::
-      allocator_traits<allocator_type>                   allocator_traits_type;
-   typedef typename allocator_traits_type::pointer       pointer;
-   typedef typename allocator_traits_type::size_type     size_type;
-   typedef typename allocator_traits_type::value_type    value_type;
-   typedef StoredSizeType                                stored_size_type;
-      
-   template <class OtherAllocator, class OtherStoredSizeType, class OtherAllocatorVersion>
-   friend struct vector_alloc_holder;
-
-   //Constructor, does not throw
-   vector_alloc_holder()
-      BOOST_NOEXCEPT_IF(dtl::is_nothrow_default_constructible<allocator_type>::value)
-      : allocator_type(), m_size()
-   {}
-
-   //Constructor, does not throw
-   template<class AllocConvertible>
-   explicit vector_alloc_holder(BOOST_FWD_REF(AllocConvertible) a) BOOST_NOEXCEPT_OR_NOTHROW
-      : allocator_type(boost::forward<AllocConvertible>(a)), m_size()
-   {}
-
-   //Constructor, does not throw
-   template<class AllocConvertible>
-   vector_alloc_holder(vector_uninitialized_size_t, BOOST_FWD_REF(AllocConvertible) a, size_type initial_size)
-      : allocator_type(boost::forward<AllocConvertible>(a))
-      , m_size(initial_size)  //Size is initialized here...
-   {
-      //... and capacity here, so vector, must call uninitialized_xxx in the derived constructor
-      this->priv_first_allocation(initial_size);
-   }
-
-   //Constructor, does not throw
-   vector_alloc_holder(vector_uninitialized_size_t, size_type initial_size)
-      : allocator_type()
-      , m_size(initial_size)  //Size is initialized here...
-   {
-      //... and capacity here, so vector, must call uninitialized_xxx in the derived constructor
-      this->priv_first_allocation(initial_size);
-   }
-
-   vector_alloc_holder(BOOST_RV_REF(vector_alloc_holder) holder)
-      : allocator_type(BOOST_MOVE_BASE(allocator_type, holder))
-      , m_size(holder.m_size) //Size is initialized here so vector should only call uninitialized_xxx after this
-   {
-      ::boost::container::uninitialized_move_alloc_n
-         (this->alloc(), boost::movelib::to_raw_pointer(holder.start()), m_size, boost::movelib::to_raw_pointer(this->start()));
-      ::boost::container::destroy_alloc_n
-         (this->alloc(), boost::movelib::to_raw_pointer(holder.start()), m_size);
-      holder.m_size = 0;
-   }
-
-   template<class OtherAllocator, class OtherStoredSizeType, class OtherAllocatorVersion>
-   vector_alloc_holder(BOOST_RV_REF_BEG vector_alloc_holder<OtherAllocator, OtherStoredSizeType, OtherAllocatorVersion> BOOST_RV_REF_END holder)
-      : allocator_type()
-      , m_size(holder.m_size) //Initialize it to m_size as first_allocation can only succeed or abort
-   {
-      //Different allocator type so we must check we have enough storage
-      const size_type n = holder.m_size;
-      this->priv_first_allocation(n);
-      ::boost::container::uninitialized_move_alloc_n
-         (this->alloc(), boost::movelib::to_raw_pointer(holder.start()), n, boost::movelib::to_raw_pointer(this->start()));
-   }
-
-   static BOOST_CONTAINER_FORCEINLINE void on_capacity_overflow()
-   {  allocator_type::on_capacity_overflow();  }
-
-   BOOST_CONTAINER_FORCEINLINE void set_stored_size(size_type s) BOOST_NOEXCEPT_OR_NOTHROW
-      {  this->m_size = static_cast<stored_size_type>(s);   }
-
-   BOOST_CONTAINER_FORCEINLINE void dec_stored_size(size_type s) BOOST_NOEXCEPT_OR_NOTHROW
-      {  this->m_size = static_cast<stored_size_type>(this->m_size - s);   }
-
-   BOOST_CONTAINER_FORCEINLINE void inc_stored_size(size_type s) BOOST_NOEXCEPT_OR_NOTHROW
-      {  this->m_size = static_cast<stored_size_type>(this->m_size + s);   }
-
-   BOOST_CONTAINER_FORCEINLINE void priv_first_allocation(size_type cap)
-   {
-      if(cap > allocator_type::internal_capacity){
-         on_capacity_overflow();
-      }
-   }
-
-   BOOST_CONTAINER_FORCEINLINE void deep_swap(vector_alloc_holder &x)
-      {  this->priv_deep_swap(x);   }
-
-   template<class OtherAllocator, class OtherStoredSizeType, class OtherAllocatorVersion>
-   void deep_swap(vector_alloc_holder<OtherAllocator, OtherStoredSizeType, OtherAllocatorVersion> &x)
-   {
-      typedef typename real_allocator<value_type, OtherAllocator>::type other_allocator_type;
-      if(this->m_size > other_allocator_type::internal_capacity || x.m_size > allocator_type::internal_capacity){
-         on_capacity_overflow();
-      }
-      this->priv_deep_swap(x);
-   }
-
-   BOOST_CONTAINER_FORCEINLINE void swap_resources(vector_alloc_holder &) BOOST_NOEXCEPT_OR_NOTHROW
-   {  //Containers with version 0 allocators can't be moved without moving elements one by one
-      on_capacity_overflow();
-   }
-
-   BOOST_CONTAINER_FORCEINLINE void steal_resources(vector_alloc_holder &)
-   {  //Containers with version 0 allocators can't be moved without moving elements one by one
-      on_capacity_overflow();
-   }
-
-   BOOST_CONTAINER_FORCEINLINE allocator_type &alloc() BOOST_NOEXCEPT_OR_NOTHROW
-   {  return *this;  }
-
-   BOOST_CONTAINER_FORCEINLINE const allocator_type &alloc() const BOOST_NOEXCEPT_OR_NOTHROW
-   {  return *this;  }
-
-   BOOST_CONTAINER_FORCEINLINE bool try_expand_fwd(size_type at_least)
-   {  return !at_least;  }
-
-   BOOST_CONTAINER_FORCEINLINE pointer start() const       BOOST_NOEXCEPT_OR_NOTHROW
-   {  return allocator_type::internal_storage();  }
-   
-   BOOST_CONTAINER_FORCEINLINE size_type capacity() const BOOST_NOEXCEPT_OR_NOTHROW
-   {  return allocator_type::internal_capacity;  }
-   
-   stored_size_type m_size;
-
-   private:
-
-   template<class OtherAllocator, class OtherStoredSizeType, class OtherAllocatorVersion>
-   void priv_deep_swap(vector_alloc_holder<OtherAllocator, OtherStoredSizeType, OtherAllocatorVersion> &x)
-   {
-      const size_type MaxTmpStorage = sizeof(value_type)*allocator_type::internal_capacity;
-      value_type *const first_this = boost::movelib::to_raw_pointer(this->start());
-      value_type *const first_x = boost::movelib::to_raw_pointer(x.start());
-
-      if(this->m_size < x.m_size){
-         boost::container::deep_swap_alloc_n<MaxTmpStorage>(this->alloc(), first_this, this->m_size, first_x, x.m_size);
-      }
-      else{
-         boost::container::deep_swap_alloc_n<MaxTmpStorage>(this->alloc(), first_x, x.m_size, first_this, this->m_size);
-      }
-      boost::adl_move_swap(this->m_size, x.m_size);
-   }
-};
-
-struct growth_factor_60;
-struct growth_factor_100;
-
-template<class Options, class AllocatorSizeType>
-struct get_vector_opt
-{
-   typedef vector_opt< typename default_if_void<typename Options::growth_factor_type, growth_factor_60>::type
-                     , typename default_if_void<typename Options::stored_size_type, AllocatorSizeType>::type
-                     > type;
-};
-
-template<class AllocatorSizeType>
-struct get_vector_opt<void, AllocatorSizeType>
-{
-   typedef vector_opt<growth_factor_60, AllocatorSizeType> type;
-};
-
-#endif   //#ifndef BOOST_CONTAINER_DOXYGEN_INVOKED
-
-//! A vector is a sequence that supports random access to elements, constant
-//! time insertion and removal of elements at the end, and linear time insertion
-//! and removal of elements at the beginning or in the middle. The number of
-//! elements in a vector may vary dynamically; memory management is automatic.
-//!
-//! \tparam T The type of object that is stored in the vector
-//! \tparam A The allocator used for all internal memory management, use void
-//!   for the default allocator
-//! \tparam Options A type produced from \c boost::container::vector_options.
-template <class T, class A BOOST_CONTAINER_DOCONLY(= void), class Options BOOST_CONTAINER_DOCONLY(= void) >
-class vector
-{
-public:
-   //////////////////////////////////////////////
-   //
-   //                    types
-   //
-   //////////////////////////////////////////////
-   typedef T                                                                           value_type;
-   typedef BOOST_CONTAINER_IMPDEF
-      (typename real_allocator<T BOOST_MOVE_I A>::type)                                allocator_type;
-   typedef ::boost::container::allocator_traits<allocator_type>                        allocator_traits_t;
-   typedef typename   allocator_traits<allocator_type>::pointer                        pointer;
-   typedef typename   allocator_traits<allocator_type>::const_pointer                  const_pointer;
-   typedef typename   allocator_traits<allocator_type>::reference                      reference;
-   typedef typename   allocator_traits<allocator_type>::const_reference                const_reference;
-   typedef typename   allocator_traits<allocator_type>::size_type                      size_type;
-   typedef typename   allocator_traits<allocator_type>::difference_type                difference_type;
-   typedef allocator_type                                                              stored_allocator_type;
-   typedef BOOST_CONTAINER_IMPDEF(vec_iterator<pointer BOOST_MOVE_I false>)            iterator;
-   typedef BOOST_CONTAINER_IMPDEF(vec_iterator<pointer BOOST_MOVE_I true >)            const_iterator;
-   typedef BOOST_CONTAINER_IMPDEF(boost::container::reverse_iterator<iterator>)        reverse_iterator;
-   typedef BOOST_CONTAINER_IMPDEF(boost::container::reverse_iterator<const_iterator>)  const_reverse_iterator;
-
-private:
-
-   #ifndef BOOST_CONTAINER_DOXYGEN_INVOKED
-   typedef typename boost::container::
-      allocator_traits<allocator_type>::size_type                             alloc_size_type;
-   typedef typename get_vector_opt<Options, alloc_size_type>::type            options_type;
-   typedef typename options_type::growth_factor_type                          growth_factor_type;
-   typedef typename options_type::stored_size_type                            stored_size_type;
-   typedef value_less<T>                                                      value_less_t;
-
-   //If provided the stored_size option must specify a type that is equal or a type that is smaller.
-   BOOST_STATIC_ASSERT( (sizeof(stored_size_type) < sizeof(alloc_size_type) ||
-                        dtl::is_same<stored_size_type, alloc_size_type>::value) );
-
-   typedef typename dtl::version<allocator_type>::type alloc_version;
-   typedef boost::container::vector_alloc_holder
-      <allocator_type, stored_size_type> alloc_holder_t;
-
-   alloc_holder_t m_holder;
-
-   typedef allocator_traits<allocator_type>                      allocator_traits_type;
-   template <class U, class UA, class UOptions>
-   friend class vector;
-
-
-   protected:
-   BOOST_CONTAINER_FORCEINLINE
-      static bool is_propagable_from(const allocator_type &from_alloc, pointer p, const allocator_type &to_alloc, bool const propagate_allocator)
-   {  return alloc_holder_t::is_propagable_from(from_alloc, p, to_alloc, propagate_allocator);  }
-
-   BOOST_CONTAINER_FORCEINLINE
-      static bool are_swap_propagable( const allocator_type &l_a, pointer l_p
-                                     , const allocator_type &r_a, pointer r_p, bool const propagate_allocator)
-   {  return alloc_holder_t::are_swap_propagable(l_a, l_p, r_a, r_p, propagate_allocator);  }
-
-   #endif   //#ifndef BOOST_CONTAINER_DOXYGEN_INVOKED
-   #ifndef BOOST_CONTAINER_DOXYGEN_INVOKED
-   private:
-   BOOST_COPYABLE_AND_MOVABLE(vector)
-   typedef vector_value_traits<allocator_type> value_traits;
-   typedef constant_iterator<T>            cvalue_iterator;
-
-   protected:
-
-   BOOST_CONTAINER_FORCEINLINE void steal_resources(vector &x)
-   {  return this->m_holder.steal_resources(x.m_holder);   }
-
-   BOOST_CONTAINER_FORCEINLINE void protected_set_size(size_type n)
-   {  this->m_holder.m_size = static_cast<stored_size_type>(n);   }
-
-   template<class AllocFwd>
-   BOOST_CONTAINER_FORCEINLINE vector(initial_capacity_t, pointer initial_memory, size_type cap, BOOST_FWD_REF(AllocFwd) a)
-      : m_holder(initial_capacity_t(), initial_memory, cap, ::boost::forward<AllocFwd>(a))
-   {}
-
-   BOOST_CONTAINER_FORCEINLINE vector(initial_capacity_t, pointer initial_memory, size_type cap)
-      : m_holder(initial_capacity_t(), initial_memory, cap)
-   {}
-
-   template<class SizeType, class AllocFwd>
-   BOOST_CONTAINER_FORCEINLINE vector(maybe_initial_capacity_t, pointer p, SizeType initial_capacity, BOOST_FWD_REF(AllocFwd) a)
-      : m_holder(maybe_initial_capacity_t(), p, initial_capacity, ::boost::forward<AllocFwd>(a))
-   {
-      #ifdef BOOST_CONTAINER_VECTOR_ALLOC_STATS
-      this->num_alloc += size_type(p != pointer());
-      #endif
-   }
-
-   template<class SizeType>
-   BOOST_CONTAINER_FORCEINLINE vector(maybe_initial_capacity_t, pointer p, SizeType initial_capacity)
-      : m_holder(maybe_initial_capacity_t(), p, initial_capacity)
-   {
-      #ifdef BOOST_CONTAINER_VECTOR_ALLOC_STATS
-      this->num_alloc += size_type(p != pointer());
-      #endif
-   }
-
-   template <class U>
-   void protected_init_n(const size_type new_size, const U& u)
-   {
-      BOOST_ASSERT(this->empty());
-      this->priv_resize_proxy(u).uninitialized_copy_n_and_update(this->m_holder.alloc(), this->priv_raw_begin(), new_size);
-      this->m_holder.set_stored_size(new_size);
-   }
-
-   #endif   //#ifndef BOOST_CONTAINER_DOXYGEN_INVOKED
-
-   public:
-   //////////////////////////////////////////////
-   //
-   //          construct/copy/destroy
-   //
-   //////////////////////////////////////////////
-
-   //! <b>Effects</b>: Constructs a vector taking the allocator as parameter.
-   //!
-   //! <b>Throws</b>: Nothing.
-   //!
-   //! <b>Complexity</b>: Constant.
-   vector() BOOST_NOEXCEPT_IF(dtl::is_nothrow_default_constructible<allocator_type>::value)
-      : m_holder()
-   {}
-
-   //! <b>Effects</b>: Constructs a vector taking the allocator as parameter.
-   //!
-   //! <b>Throws</b>: Nothing
-   //!
-   //! <b>Complexity</b>: Constant.
-   explicit vector(const allocator_type& a) BOOST_NOEXCEPT_OR_NOTHROW
-      : m_holder(a)
-   {}
-
-   //! <b>Effects</b>: Constructs a vector and inserts n value initialized values.
-   //!
-   //! <b>Throws</b>: If allocator_type's allocation
-   //!   throws or T's value initialization throws.
-   //!
-   //! <b>Complexity</b>: Linear to n.
-   explicit vector(size_type n)
-      :  m_holder(vector_uninitialized_size, n)
-   {
-      #ifdef BOOST_CONTAINER_VECTOR_ALLOC_STATS
-      this->num_alloc += n != 0;
-      #endif
-      boost::container::uninitialized_value_init_alloc_n
-         (this->m_holder.alloc(), n, this->priv_raw_begin());
-   }
-
-   //! <b>Effects</b>: Constructs a vector that will use a copy of allocator a
-   //!   and inserts n value initialized values.
-   //!
-   //! <b>Throws</b>: If allocator_type's allocation
-   //!   throws or T's value initialization throws.
-   //!
-   //! <b>Complexity</b>: Linear to n.
-   explicit vector(size_type n, const allocator_type &a)
-      :  m_holder(vector_uninitialized_size, a, n)
-   {
-      #ifdef BOOST_CONTAINER_VECTOR_ALLOC_STATS
-      this->num_alloc += n != 0;
-      #endif
-      boost::container::uninitialized_value_init_alloc_n
-         (this->m_holder.alloc(), n, this->priv_raw_begin());
-   }
-
-   //! <b>Effects</b>: Constructs a vector that will use a copy of allocator a
-   //!   and inserts n default initialized values.
-   //!
-   //! <b>Throws</b>: If allocator_type's allocation
-   //!   throws or T's default initialization throws.
-   //!
-   //! <b>Complexity</b>: Linear to n.
-   //!
-   //! <b>Note</b>: Non-standard extension
-   vector(size_type n, default_init_t)
-      :  m_holder(vector_uninitialized_size, n)
-   {
-      #ifdef BOOST_CONTAINER_VECTOR_ALLOC_STATS
-      this->num_alloc += n != 0;
-      #endif
-      boost::container::uninitialized_default_init_alloc_n
-         (this->m_holder.alloc(), n, this->priv_raw_begin());
-   }
-
-   //! <b>Effects</b>: Constructs a vector that will use a copy of allocator a
-   //!   and inserts n default initialized values.
-   //!
-   //! <b>Throws</b>: If allocator_type's allocation
-   //!   throws or T's default initialization throws.
-   //!
-   //! <b>Complexity</b>: Linear to n.
-   //!
-   //! <b>Note</b>: Non-standard extension
-   vector(size_type n, default_init_t, const allocator_type &a)
-      :  m_holder(vector_uninitialized_size, a, n)
-   {
-      #ifdef BOOST_CONTAINER_VECTOR_ALLOC_STATS
-      this->num_alloc += n != 0;
-      #endif
-      boost::container::uninitialized_default_init_alloc_n
-         (this->m_holder.alloc(), n, this->priv_raw_begin());
-   }
-
-   //! <b>Effects</b>: Constructs a vector
-   //!   and inserts n copies of value.
-   //!
-   //! <b>Throws</b>: If allocator_type's allocation
-   //!   throws or T's copy constructor throws.
-   //!
-   //! <b>Complexity</b>: Linear to n.
-   vector(size_type n, const T& value)
-      :  m_holder(vector_uninitialized_size, n)
-   {
-      #ifdef BOOST_CONTAINER_VECTOR_ALLOC_STATS
-      this->num_alloc += n != 0;
-      #endif
-      boost::container::uninitialized_fill_alloc_n
-         (this->m_holder.alloc(), value, n, this->priv_raw_begin());
-   }
-
-   //! <b>Effects</b>: Constructs a vector that will use a copy of allocator a
-   //!   and inserts n copies of value.
-   //!
-   //! <b>Throws</b>: If allocation
-   //!   throws or T's copy constructor throws.
-   //!
-   //! <b>Complexity</b>: Linear to n.
-   vector(size_type n, const T& value, const allocator_type& a)
-      :  m_holder(vector_uninitialized_size, a, n)
-   {
-      #ifdef BOOST_CONTAINER_VECTOR_ALLOC_STATS
-      this->num_alloc += n != 0;
-      #endif
-      boost::container::uninitialized_fill_alloc_n
-         (this->m_holder.alloc(), value, n, this->priv_raw_begin());
-   }
-
-   //! <b>Effects</b>: Constructs a vector
-   //!   and inserts a copy of the range [first, last) in the vector.
-   //!
-   //! <b>Throws</b>: If allocator_type's allocation
-   //!   throws or T's constructor taking a dereferenced InIt throws.
-   //!
-   //! <b>Complexity</b>: Linear to the range [first, last).
-//    template <class InIt>
-//    vector(InIt first, InIt last
-//           BOOST_CONTAINER_DOCIGN(BOOST_MOVE_I typename dtl::disable_if_c
-//                                  < dtl::is_convertible<InIt BOOST_MOVE_I size_type>::value
-//                                  BOOST_MOVE_I dtl::nat >::type * = 0)
-//           ) -> vector<typename iterator_traits<InIt>::value_type, new_allocator<typename iterator_traits<InIt>::value_type>>;
-   template <class InIt>
-   vector(InIt first, InIt last
-      BOOST_CONTAINER_DOCIGN(BOOST_MOVE_I typename dtl::disable_if_c
-         < dtl::is_convertible<InIt BOOST_MOVE_I size_type>::value
-         BOOST_MOVE_I dtl::nat >::type * = 0)
-      )
-      :  m_holder()
-   {  this->assign(first, last); }
-
-   //! <b>Effects</b>: Constructs a vector that will use a copy of allocator a
-   //!   and inserts a copy of the range [first, last) in the vector.
-   //!
-   //! <b>Throws</b>: If allocator_type's allocation
-   //!   throws or T's constructor taking a dereferenced InIt throws.
-   //!
-   //! <b>Complexity</b>: Linear to the range [first, last).
-   template <class InIt>
-   vector(InIt first, InIt last, const allocator_type& a
-      BOOST_CONTAINER_DOCIGN(BOOST_MOVE_I typename dtl::disable_if_c
-         < dtl::is_convertible<InIt BOOST_MOVE_I size_type>::value
-         BOOST_MOVE_I dtl::nat >::type * = 0)
-      )
-      :  m_holder(a)
-   {  this->assign(first, last); }
-
-   //! <b>Effects</b>: Copy constructs a vector.
-   //!
-   //! <b>Postcondition</b>: x == *this.
-   //!
-   //! <b>Throws</b>: If allocator_type's allocation
-   //!   throws or T's copy constructor throws.
-   //!
-   //! <b>Complexity</b>: Linear to the elements x contains.
-   vector(const vector &x)
-      :  m_holder( vector_uninitialized_size
-                 , allocator_traits_type::select_on_container_copy_construction(x.m_holder.alloc())
-                 , x.size())
-   {
-      #ifdef BOOST_CONTAINER_VECTOR_ALLOC_STATS
-      this->num_alloc += x.size() != 0;
-      #endif
-      ::boost::container::uninitialized_copy_alloc_n
-         ( this->m_holder.alloc(), x.priv_raw_begin()
-         , x.size(), this->priv_raw_begin());
-   }
-
-   //! <b>Effects</b>: Move constructor. Moves x's resources to *this.
-   //!
-   //! <b>Throws</b>: Nothing
-   //!
-   //! <b>Complexity</b>: Constant.
-   vector(BOOST_RV_REF(vector) x) BOOST_NOEXCEPT_OR_NOTHROW
-      :  m_holder(boost::move(x.m_holder))
-   {  BOOST_STATIC_ASSERT((!allocator_traits_type::is_partially_propagable::value));  }
-
-   #if !defined(BOOST_NO_CXX11_HDR_INITIALIZER_LIST)
-   //! <b>Effects</b>: Constructs a vector that will use a copy of allocator a
-   //!  and inserts a copy of the range [il.begin(), il.last()) in the vector
-   //!
-   //! <b>Throws</b>: If T's constructor taking a dereferenced initializer_list iterator throws.
-   //!
-   //! <b>Complexity</b>: Linear to the range [il.begin(), il.end()).
-   vector(std::initializer_list<value_type> il, const allocator_type& a = allocator_type())
-      :  m_holder(vector_uninitialized_size, a, il.size())
-   {
-      #ifdef BOOST_CONTAINER_VECTOR_ALLOC_STATS
-      this->num_alloc += il.size() != 0;
-      #endif
-      ::boost::container::uninitialized_copy_alloc_n_source
-         ( this->m_holder.alloc(), il.begin()
-         , static_cast<size_type>(il.size()), this->priv_raw_begin());
-   }
-   #endif
-
-   #if !defined(BOOST_CONTAINER_DOXYGEN_INVOKED)
-
-   //! <b>Effects</b>: Move constructor. Moves x's resources to *this.
-   //!
-   //! <b>Throws</b>: If T's move constructor or allocation throws
-   //!
-   //! <b>Complexity</b>: Linear.
-   //!
-   //! <b>Note</b>: Non-standard extension to support static_vector
-   template<class OtherA>
-   vector(BOOST_RV_REF_BEG vector<T, OtherA, Options> BOOST_RV_REF_END x
-         , typename dtl::enable_if_c
-            < dtl::is_version<typename real_allocator<T, OtherA>::type, 0>::value>::type * = 0
-         )
-      :  m_holder(boost::move(x.m_holder))
-   {}
-
-   #endif   // defined(BOOST_CONTAINER_DOXYGEN_INVOKED)
-
-   //! <b>Effects</b>: Copy constructs a vector using the specified allocator.
-   //!
-   //! <b>Postcondition</b>: x == *this.
-   //!
-   //! <b>Throws</b>: If allocation
-   //!   throws or T's copy constructor throws.
-   //!
-   //! <b>Complexity</b>: Linear to the elements x contains.
-   vector(const vector &x, const allocator_type &a)
-      :  m_holder(vector_uninitialized_size, a, x.size())
-   {
-      #ifdef BOOST_CONTAINER_VECTOR_ALLOC_STATS
-      this->num_alloc += x.size() != 0;
-      #endif
-      ::boost::container::uninitialized_copy_alloc_n_source
-         ( this->m_holder.alloc(), x.priv_raw_begin()
-         , x.size(), this->priv_raw_begin());
-   }
-
-   //! <b>Effects</b>: Move constructor using the specified allocator.
-   //!                 Moves x's resources to *this if a == allocator_type().
-   //!                 Otherwise copies values from x to *this.
-   //!
-   //! <b>Throws</b>: If allocation or T's copy constructor throws.
-   //!
-   //! <b>Complexity</b>: Constant if a == x.get_allocator(), linear otherwise.
-   vector(BOOST_RV_REF(vector) x, const allocator_type &a)
-      :  m_holder( vector_uninitialized_size, a
-                 //In this allocator move constructor the allocator won't be propagated --v
-                 , is_propagable_from(x.get_stored_allocator(), x.m_holder.start(), a, false) ? 0 : x.size()
-                 )
-   {
-      //In this allocator move constructor the allocator won't be propagated ---v
-      if(is_propagable_from(x.get_stored_allocator(), x.m_holder.start(), a, false)){
-         this->m_holder.steal_resources(x.m_holder);
-      }
-      else{
-         const size_type n = x.size();
-         #ifdef BOOST_CONTAINER_VECTOR_ALLOC_STATS
-         this->num_alloc += n != 0;
-         #endif
-         ::boost::container::uninitialized_move_alloc_n_source
-            ( this->m_holder.alloc(), x.priv_raw_begin()
-            , n, this->priv_raw_begin());
-      }
-   }
-
-   //! <b>Effects</b>: Destroys the vector. All stored values are destroyed
-   //!   and used memory is deallocated.
-   //!
-   //! <b>Throws</b>: Nothing.
-   //!
-   //! <b>Complexity</b>: Linear to the number of elements.
-   ~vector() BOOST_NOEXCEPT_OR_NOTHROW
-   {
-      boost::container::destroy_alloc_n
-         (this->get_stored_allocator(), this->priv_raw_begin(), this->m_holder.m_size);
-      //vector_alloc_holder deallocates the data
-   }
-
-   //! <b>Effects</b>: Makes *this contain the same elements as x.
-   //!
-   //! <b>Postcondition</b>: this->size() == x.size(). *this contains a copy
-   //! of each of x's elements.
-   //!
-   //! <b>Throws</b>: If memory allocation throws or T's copy/move constructor/assignment throws.
-   //!
-   //! <b>Complexity</b>: Linear to the number of elements in x.
-   BOOST_CONTAINER_FORCEINLINE vector& operator=(BOOST_COPY_ASSIGN_REF(vector) x)
-   {
-      if (BOOST_LIKELY(&x != this)){
-         this->priv_copy_assign(x);
-      }
-      return *this;
-   }
-
-   #if !defined(BOOST_NO_CXX11_HDR_INITIALIZER_LIST)
-   //! <b>Effects</b>: Make *this container contains elements from il.
-   //!
-   //! <b>Complexity</b>: Linear to the range [il.begin(), il.end()).
-   BOOST_CONTAINER_FORCEINLINE vector& operator=(std::initializer_list<value_type> il)
-   {
-      this->assign(il.begin(), il.end());
-      return *this;
-   }
-   #endif
-
-   //! <b>Effects</b>: Move assignment. All x's values are transferred to *this.
-   //!
-   //! <b>Postcondition</b>: x.empty(). *this contains a the elements x had
-   //!   before the function.
-   //!
-   //! <b>Throws</b>: If allocator_traits_type::propagate_on_container_move_assignment
-   //!   is false and (allocation throws or value_type's move constructor throws)
-   //!
-   //! <b>Complexity</b>: Constant if allocator_traits_type::
-   //!   propagate_on_container_move_assignment is true or
-   //!   this->get>allocator() == x.get_allocator(). Linear otherwise.
-   BOOST_CONTAINER_FORCEINLINE vector& operator=(BOOST_RV_REF(vector) x)
-      BOOST_NOEXCEPT_IF(allocator_traits_type::propagate_on_container_move_assignment::value
-                        || allocator_traits_type::is_always_equal::value)
-   {
-      if (BOOST_LIKELY(&x != this)){
-         this->priv_move_assign(boost::move(x));
-      }
-      return *this;
-   }
-
-   #if !defined(BOOST_CONTAINER_DOXYGEN_INVOKED)
-
-   //! <b>Effects</b>: Move assignment. All x's values are transferred to *this.
-   //!
-   //! <b>Postcondition</b>: x.empty(). *this contains a the elements x had
-   //!   before the function.
-   //!
-   //! <b>Throws</b>: If move constructor/assignment of T throws or allocation throws
-   //!
-   //! <b>Complexity</b>: Linear.
-   //!
-   //! <b>Note</b>: Non-standard extension to support static_vector
-   template<class OtherA>
-   BOOST_CONTAINER_FORCEINLINE typename dtl::enable_if_and
-                           < vector&
-                           , dtl::is_version<typename real_allocator<T, OtherA>::type, 0>
-                           , dtl::is_different<typename real_allocator<T, OtherA>::type, allocator_type>
-                           >::type
-      operator=(BOOST_RV_REF_BEG vector<value_type, OtherA, Options> BOOST_RV_REF_END x)
-   {
-      this->priv_move_assign(boost::move(x));
-      return *this;
-   }
-
-   //! <b>Effects</b>: Copy assignment. All x's values are copied to *this.
-   //!
-   //! <b>Postcondition</b>: x.empty(). *this contains a the elements x had
-   //!   before the function.
-   //!
-   //! <b>Throws</b>: If move constructor/assignment of T throws or allocation throws
-   //!
-   //! <b>Complexity</b>: Linear.
-   //!
-   //! <b>Note</b>: Non-standard extension to support static_vector
-   template<class OtherA>
-   BOOST_CONTAINER_FORCEINLINE typename dtl::enable_if_and
-                           < vector&
-                           , dtl::is_version<typename real_allocator<T, OtherA>::type, 0>
-                           , dtl::is_different<typename real_allocator<T, OtherA>::type, allocator_type>
-                           >::type
-      operator=(const vector<value_type, OtherA, Options> &x)
-   {
-      this->priv_copy_assign(x);
-      return *this;
-   }
-
-   #endif
-
-   //! <b>Effects</b>: Assigns the the range [first, last) to *this.
-   //!
-   //! <b>Throws</b>: If memory allocation throws or T's copy/move constructor/assignment or
-   //!   T's constructor/assignment from dereferencing InpIt throws.
-   //!
-   //! <b>Complexity</b>: Linear to n.
-   template <class InIt>
-   void assign(InIt first, InIt last
-      //Input iterators or version 0 allocator
-      BOOST_CONTAINER_DOCIGN(BOOST_MOVE_I typename dtl::disable_if_or
-         < void
-         BOOST_MOVE_I dtl::is_convertible<InIt BOOST_MOVE_I size_type>
-         BOOST_MOVE_I dtl::and_
-            < dtl::is_different<alloc_version BOOST_MOVE_I version_0>
-            BOOST_MOVE_I dtl::is_not_input_iterator<InIt>
-            >
-         >::type * = 0)
-      )
-   {
-      //Overwrite all elements we can from [first, last)
-      iterator cur = this->begin();
-      const iterator end_it = this->end();
-      for ( ; first != last && cur != end_it; ++cur, ++first){
-         *cur = *first;
-      }
-
-      if (first == last){
-         //There are no more elements in the sequence, erase remaining
-         T* const end_pos = this->priv_raw_end();
-         const size_type n = static_cast<size_type>(end_pos - boost::movelib::iterator_to_raw_pointer(cur));
-         this->priv_destroy_last_n(n);
-      }
-      else{
-         //There are more elements in the range, insert the remaining ones
-         this->insert(this->cend(), first, last);
-      }
-   }
-
-   #if !defined(BOOST_NO_CXX11_HDR_INITIALIZER_LIST)
-   //! <b>Effects</b>: Assigns the the range [il.begin(), il.end()) to *this.
-   //!
-   //! <b>Throws</b>: If memory allocation throws or
-   //!   T's constructor from dereferencing iniializer_list iterator throws.
-   //!
-   BOOST_CONTAINER_FORCEINLINE void assign(std::initializer_list<T> il)
-   {
-      this->assign(il.begin(), il.end());
-   }
-   #endif
-
-   //! <b>Effects</b>: Assigns the the range [first, last) to *this.
-   //!
-   //! <b>Throws</b>: If memory allocation throws or T's copy/move constructor/assignment or
-   //!   T's constructor/assignment from dereferencing InpIt throws.
-   //!
-   //! <b>Complexity</b>: Linear to n.
-   template <class FwdIt>
-   void assign(FwdIt first, FwdIt last
-      //Forward iterators and version > 0 allocator
-      BOOST_CONTAINER_DOCIGN(BOOST_MOVE_I typename dtl::disable_if_or
-         < void
-         BOOST_MOVE_I dtl::is_same<alloc_version BOOST_MOVE_I version_0>
-         BOOST_MOVE_I dtl::is_convertible<FwdIt BOOST_MOVE_I size_type>
-         BOOST_MOVE_I dtl::is_input_iterator<FwdIt>
-         >::type * = 0)
-      )
-   {
-      typedef typename iter_size<FwdIt>::type it_size_type;
-      //For Fwd iterators the standard only requires EmplaceConstructible and assignable from *first
-      //so we can't do any backwards allocation
-      const it_size_type sz = boost::container::iterator_udistance(first, last);
-      if (BOOST_UNLIKELY(sz > size_type(-1))){
-         boost::container::throw_length_error("vector::assign, FwdIt's max length reached");
-      }
-
-      const size_type input_sz = static_cast<size_type>(sz);
-      const size_type old_capacity = this->capacity();
-      if(input_sz > old_capacity){  //If input range is too big, we need to reallocate
-         size_type real_cap = 0;
-         pointer reuse(this->m_holder.start());
-         pointer const ret(this->m_holder.allocation_command(allocate_new|expand_fwd, input_sz, real_cap = input_sz, reuse));
-         if(!reuse){  //New allocation, just emplace new values
-            #ifdef BOOST_CONTAINER_VECTOR_ALLOC_STATS
-            ++this->num_alloc;
-            #endif
-            pointer const old_p = this->m_holder.start();
-            if(old_p){
-               this->priv_destroy_all();
-               this->m_holder.deallocate(old_p, old_capacity);
-            }
-            this->m_holder.start(ret);
-            this->m_holder.capacity(real_cap);
-            this->m_holder.m_size = 0;
-            this->priv_uninitialized_construct_at_end(first, last);
-            return;
-         }
-         else{
-            #ifdef BOOST_CONTAINER_VECTOR_ALLOC_STATS
-            ++this->num_expand_fwd;
-            #endif
-            this->m_holder.capacity(real_cap);
-            //Forward expansion, use assignment + back deletion/construction that comes later
-         }
-      }
-
-      boost::container::copy_assign_range_alloc_n(this->m_holder.alloc(), first, input_sz, this->priv_raw_begin(), this->size());
-      m_holder.set_stored_size(input_sz);
-   }
-
-   //! <b>Effects</b>: Assigns the n copies of val to *this.
-   //!
-   //! <b>Throws</b>: If memory allocation throws or
-   //!   T's copy/move constructor/assignment throws.
-   //!
-   //! <b>Complexity</b>: Linear to n.
-   BOOST_CONTAINER_FORCEINLINE void assign(size_type n, const value_type& val)
-   {  this->assign(cvalue_iterator(val, n), cvalue_iterator());   }
-
-   //! <b>Effects</b>: Returns a copy of the internal allocator.
-   //!
-   //! <b>Throws</b>: If allocator's copy constructor throws.
-   //!
-   //! <b>Complexity</b>: Constant.
-   BOOST_CONTAINER_ATTRIBUTE_NODISCARD BOOST_CONTAINER_FORCEINLINE allocator_type get_allocator() const BOOST_NOEXCEPT_OR_NOTHROW
-   { return this->m_holder.alloc();  }
-
-   //! <b>Effects</b>: Returns a reference to the internal allocator.
-   //!
-   //! <b>Throws</b>: Nothing
-   //!
-   //! <b>Complexity</b>: Constant.
-   //!
-   //! <b>Note</b>: Non-standard extension.
-   BOOST_CONTAINER_ATTRIBUTE_NODISCARD BOOST_CONTAINER_FORCEINLINE 
-      stored_allocator_type &get_stored_allocator() BOOST_NOEXCEPT_OR_NOTHROW
-   {  return this->m_holder.alloc(); }
-
-   //! <b>Effects</b>: Returns a reference to the internal allocator.
-   //!
-   //! <b>Throws</b>: Nothing
-   //!
-   //! <b>Complexity</b>: Constant.
-   //!
-   //! <b>Note</b>: Non-standard extension.
-   BOOST_CONTAINER_ATTRIBUTE_NODISCARD BOOST_CONTAINER_FORCEINLINE
-      const stored_allocator_type &get_stored_allocator() const BOOST_NOEXCEPT_OR_NOTHROW
-   {  return this->m_holder.alloc(); }
-
-   //////////////////////////////////////////////
-   //
-   //                iterators
-   //
-   //////////////////////////////////////////////
-
-   //! <b>Effects</b>: Returns an iterator to the first element contained in the vector.
-   //!
-   //! <b>Throws</b>: Nothing.
-   //!
-   //! <b>Complexity</b>: Constant.
-   BOOST_CONTAINER_ATTRIBUTE_NODISCARD BOOST_CONTAINER_FORCEINLINE iterator begin() BOOST_NOEXCEPT_OR_NOTHROW
-   { return iterator(this->m_holder.start()); }
-
-   //! <b>Effects</b>: Returns a const_iterator to the first element contained in the vector.
-   //!
-   //! <b>Throws</b>: Nothing.
-   //!
-   //! <b>Complexity</b>: Constant.
-   BOOST_CONTAINER_ATTRIBUTE_NODISCARD BOOST_CONTAINER_FORCEINLINE const_iterator begin() const BOOST_NOEXCEPT_OR_NOTHROW
-   { return const_iterator(this->m_holder.start()); }
-
-   //! <b>Effects</b>: Returns an iterator to the end of the vector.
-   //!
-   //! <b>Throws</b>: Nothing.
-   //!
-   //! <b>Complexity</b>: Constant.
-   BOOST_CONTAINER_ATTRIBUTE_NODISCARD BOOST_CONTAINER_FORCEINLINE iterator end() BOOST_NOEXCEPT_OR_NOTHROW
-   {
-      iterator it (this->m_holder.start());
-      it += difference_type(this->m_holder.m_size);
-      return it;  //Adding zero to null pointer is allowed (non-UB)
-   }
-
-   //! <b>Effects</b>: Returns a const_iterator to the end of the vector.
-   //!
-   //! <b>Throws</b>: Nothing.
-   //!
-   //! <b>Complexity</b>: Constant.
-   BOOST_CONTAINER_ATTRIBUTE_NODISCARD BOOST_CONTAINER_FORCEINLINE const_iterator end() const BOOST_NOEXCEPT_OR_NOTHROW
-   { return this->cend(); }
-
-   //! <b>Effects</b>: Returns a reverse_iterator pointing to the beginning
-   //! of the reversed vector.
-   //!
-   //! <b>Throws</b>: Nothing.
-   //!
-   //! <b>Complexity</b>: Constant.
-   BOOST_CONTAINER_ATTRIBUTE_NODISCARD BOOST_CONTAINER_FORCEINLINE reverse_iterator rbegin() BOOST_NOEXCEPT_OR_NOTHROW
-   { return reverse_iterator(this->end());      }
-
-   //! <b>Effects</b>: Returns a const_reverse_iterator pointing to the beginning
-   //! of the reversed vector.
-   //!
-   //! <b>Throws</b>: Nothing.
-   //!
-   //! <b>Complexity</b>: Constant.
-   BOOST_CONTAINER_ATTRIBUTE_NODISCARD BOOST_CONTAINER_FORCEINLINE const_reverse_iterator rbegin() const BOOST_NOEXCEPT_OR_NOTHROW
-   { return this->crbegin(); }
-
-   //! <b>Effects</b>: Returns a reverse_iterator pointing to the end
-   //! of the reversed vector.
-   //!
-   //! <b>Throws</b>: Nothing.
-   //!
-   //! <b>Complexity</b>: Constant.
-   BOOST_CONTAINER_ATTRIBUTE_NODISCARD BOOST_CONTAINER_FORCEINLINE reverse_iterator rend() BOOST_NOEXCEPT_OR_NOTHROW
-   { return reverse_iterator(this->begin());       }
-
-   //! <b>Effects</b>: Returns a const_reverse_iterator pointing to the end
-   //! of the reversed vector.
-   //!
-   //! <b>Throws</b>: Nothing.
-   //!
-   //! <b>Complexity</b>: Constant.
-   BOOST_CONTAINER_ATTRIBUTE_NODISCARD BOOST_CONTAINER_FORCEINLINE const_reverse_iterator rend() const BOOST_NOEXCEPT_OR_NOTHROW
-   { return this->crend(); }
-
-   //! <b>Effects</b>: Returns a const_iterator to the first element contained in the vector.
-   //!
-   //! <b>Throws</b>: Nothing.
-   //!
-   //! <b>Complexity</b>: Constant.
-   BOOST_CONTAINER_ATTRIBUTE_NODISCARD BOOST_CONTAINER_FORCEINLINE const_iterator cbegin() const BOOST_NOEXCEPT_OR_NOTHROW
-   { return const_iterator(this->m_holder.start()); }
-
-   //! <b>Effects</b>: Returns a const_iterator to the end of the vector.
-   //!
-   //! <b>Throws</b>: Nothing.
-   //!
-   //! <b>Complexity</b>: Constant.
-   BOOST_CONTAINER_ATTRIBUTE_NODISCARD BOOST_CONTAINER_FORCEINLINE const_iterator cend() const BOOST_NOEXCEPT_OR_NOTHROW
-   {
-      const_iterator it (this->m_holder.start());
-      it += difference_type(this->m_holder.m_size);
-      return it;  //Adding zero to null pointer is allowed (non-UB)
-   }
-
-   //! <b>Effects</b>: Returns a const_reverse_iterator pointing to the beginning
-   //! of the reversed vector.
-   //!
-   //! <b>Throws</b>: Nothing.
-   //!
-   //! <b>Complexity</b>: Constant.
-   BOOST_CONTAINER_ATTRIBUTE_NODISCARD BOOST_CONTAINER_FORCEINLINE const_reverse_iterator crbegin() const BOOST_NOEXCEPT_OR_NOTHROW
-   { return const_reverse_iterator(this->end());}
-
-   //! <b>Effects</b>: Returns a const_reverse_iterator pointing to the end
-   //! of the reversed vector.
-   //!
-   //! <b>Throws</b>: Nothing.
-   //!
-   //! <b>Complexity</b>: Constant.
-   BOOST_CONTAINER_ATTRIBUTE_NODISCARD BOOST_CONTAINER_FORCEINLINE const_reverse_iterator crend() const BOOST_NOEXCEPT_OR_NOTHROW
-   { return const_reverse_iterator(this->begin()); }
-
-   //////////////////////////////////////////////
-   //
-   //                capacity
-   //
-   //////////////////////////////////////////////
-
-   //! <b>Effects</b>: Returns true if the vector contains no elements.
-   //!
-   //! <b>Throws</b>: Nothing.
-   //!
-   //! <b>Complexity</b>: Constant.
-   BOOST_CONTAINER_ATTRIBUTE_NODISCARD BOOST_CONTAINER_FORCEINLINE bool empty() const BOOST_NOEXCEPT_OR_NOTHROW
-   { return !this->m_holder.m_size; }
-
-   //! <b>Effects</b>: Returns the number of the elements contained in the vector.
-   //!
-   //! <b>Throws</b>: Nothing.
-   //!
-   //! <b>Complexity</b>: Constant.
-   BOOST_CONTAINER_ATTRIBUTE_NODISCARD BOOST_CONTAINER_FORCEINLINE size_type size() const BOOST_NOEXCEPT_OR_NOTHROW
-   { return this->m_holder.m_size; }
-
-   //! <b>Effects</b>: Returns the largest possible size of the vector.
-   //!
-   //! <b>Throws</b>: Nothing.
-   //!
-   //! <b>Complexity</b>: Constant.
-   BOOST_CONTAINER_ATTRIBUTE_NODISCARD BOOST_CONTAINER_FORCEINLINE size_type max_size() const BOOST_NOEXCEPT_OR_NOTHROW
-   { return allocator_traits_type::max_size(this->m_holder.alloc()); }
-
-   //! <b>Effects</b>: Inserts or erases elements at the end such that
-   //!   the size becomes n. New elements are value initialized.
-   //!
-   //! <b>Throws</b>: If memory allocation throws, or T's copy/move or value initialization throws.
-   //!
-   //! <b>Complexity</b>: Linear to the difference between size() and new_size.
-   BOOST_CONTAINER_FORCEINLINE void resize(size_type new_size)
-   {  this->priv_resize(new_size, value_init, alloc_version());  }
-
-   //! <b>Effects</b>: Inserts or erases elements at the end such that
-   //!   the size becomes n. New elements are default initialized.
-   //!
-   //! <b>Throws</b>: If memory allocation throws, or T's copy/move or default initialization throws.
-   //!
-   //! <b>Complexity</b>: Linear to the difference between size() and new_size.
-   //!
-   //! <b>Note</b>: Non-standard extension
-   BOOST_CONTAINER_FORCEINLINE void resize(size_type new_size, default_init_t)
-   {  this->priv_resize(new_size, default_init, alloc_version());  }
-
-   //! <b>Effects</b>: Inserts or erases elements at the end such that
-   //!   the size becomes n. New elements are copy constructed from x.
-   //!
-   //! <b>Throws</b>: If memory allocation throws, or T's copy/move constructor throws.
-   //!
-   //! <b>Complexity</b>: Linear to the difference between size() and new_size.
-   BOOST_CONTAINER_FORCEINLINE void resize(size_type new_size, const T& x)
-   {  this->priv_resize(new_size, x, alloc_version());  }
-
-   //! <b>Effects</b>: Number of elements for which memory has been allocated.
-   //!   capacity() is always greater than or equal to size().
-   //!
-   //! <b>Throws</b>: Nothing.
-   //!
-   //! <b>Complexity</b>: Constant.
-   BOOST_CONTAINER_ATTRIBUTE_NODISCARD BOOST_CONTAINER_FORCEINLINE size_type capacity() const BOOST_NOEXCEPT_OR_NOTHROW
-   { return this->m_holder.capacity(); }
-
-   //! <b>Effects</b>: If n is less than or equal to capacity(), this call has no
-   //!   effect. Otherwise, it is a request for allocation of additional memory.
-   //!   If the request is successful, then capacity() is greater than or equal to
-   //!   n; otherwise, capacity() is unchanged. In either case, size() is unchanged.
-   //!
-   //! <b>Throws</b>: If memory allocation allocation throws or T's copy/move constructor throws.
-   BOOST_CONTAINER_FORCEINLINE void reserve(size_type new_cap)
-   {
-      if (this->capacity() < new_cap){
-         this->priv_move_to_new_buffer(new_cap, alloc_version());
-      }
-   }
-
-   //! <b>Effects</b>: Tries to deallocate the excess of memory created
-   //!   with previous allocations. The size of the vector is unchanged
-   //!
-   //! <b>Throws</b>: If memory allocation throws, or T's copy/move constructor throws.
-   //!
-   //! <b>Complexity</b>: Linear to size().
-   BOOST_CONTAINER_FORCEINLINE void shrink_to_fit()
-   {  this->priv_shrink_to_fit(alloc_version());   }
-
-   //////////////////////////////////////////////
-   //
-   //               element access
-   //
-   //////////////////////////////////////////////
-
-   //! <b>Requires</b>: !empty()
-   //!
-   //! <b>Effects</b>: Returns a reference to the first
-   //!   element of the container.
-   //!
-   //! <b>Throws</b>: Nothing.
-   //!
-   //! <b>Complexity</b>: Constant.
-   BOOST_CONTAINER_ATTRIBUTE_NODISCARD BOOST_CONTAINER_FORCEINLINE reference front() BOOST_NOEXCEPT_OR_NOTHROW
-   {
-      BOOST_ASSERT(!this->empty());
-      return *this->m_holder.start();
-   }
-
-   //! <b>Requires</b>: !empty()
-   //!
-   //! <b>Effects</b>: Returns a const reference to the first
-   //!   element of the container.
-   //!
-   //! <b>Throws</b>: Nothing.
-   //!
-   //! <b>Complexity</b>: Constant.
-   BOOST_CONTAINER_ATTRIBUTE_NODISCARD BOOST_CONTAINER_FORCEINLINE const_reference front() const BOOST_NOEXCEPT_OR_NOTHROW
-   {
-      BOOST_ASSERT(!this->empty());
-      return *this->m_holder.start();
-   }
-
-   //! <b>Requires</b>: !empty()
-   //!
-   //! <b>Effects</b>: Returns a reference to the last
-   //!   element of the container.
-   //!
-   //! <b>Throws</b>: Nothing.
-   //!
-   //! <b>Complexity</b>: Constant.
-   BOOST_CONTAINER_ATTRIBUTE_NODISCARD BOOST_CONTAINER_FORCEINLINE reference back() BOOST_NOEXCEPT_OR_NOTHROW
-   {
-      BOOST_ASSERT(!this->empty());
-      return this->m_holder.start()[difference_type(this->m_holder.m_size - 1u)];
-   }
-
-   //! <b>Requires</b>: !empty()
-   //!
-   //! <b>Effects</b>: Returns a const reference to the last
-   //!   element of the container.
-   //!
-   //! <b>Throws</b>: Nothing.
-   //!
-   //! <b>Complexity</b>: Constant.
-   BOOST_CONTAINER_ATTRIBUTE_NODISCARD BOOST_CONTAINER_FORCEINLINE const_reference back()  const BOOST_NOEXCEPT_OR_NOTHROW
-   {
-      BOOST_ASSERT(!this->empty());
-      return this->m_holder.start()[this->m_holder.m_size - 1];
-   }
-
-   //! <b>Requires</b>: size() > n.
-   //!
-   //! <b>Effects</b>: Returns a reference to the nth element
-   //!   from the beginning of the container.
-   //!
-   //! <b>Throws</b>: Nothing.
-   //!
-   //! <b>Complexity</b>: Constant.
-   BOOST_CONTAINER_ATTRIBUTE_NODISCARD BOOST_CONTAINER_FORCEINLINE reference operator[](size_type n) BOOST_NOEXCEPT_OR_NOTHROW
-   {
-      BOOST_ASSERT(this->m_holder.m_size > n);
-      return this->m_holder.start()[difference_type(n)];
-   }
-
-   //! <b>Requires</b>: size() > n.
-   //!
-   //! <b>Effects</b>: Returns a const reference to the nth element
-   //!   from the beginning of the container.
-   //!
-   //! <b>Throws</b>: Nothing.
-   //!
-   //! <b>Complexity</b>: Constant.
-   BOOST_CONTAINER_ATTRIBUTE_NODISCARD BOOST_CONTAINER_FORCEINLINE
-      const_reference operator[](size_type n) const BOOST_NOEXCEPT_OR_NOTHROW
-   {
-      BOOST_ASSERT(this->m_holder.m_size > n);
-      return this->m_holder.start()[n];
-   }
-
-   //! <b>Requires</b>: size() >= n.
-   //!
-   //! <b>Effects</b>: Returns an iterator to the nth element
-   //!   from the beginning of the container. Returns end()
-   //!   if n == size().
-   //!
-   //! <b>Throws</b>: Nothing.
-   //!
-   //! <b>Complexity</b>: Constant.
-   //!
-   //! <b>Note</b>: Non-standard extension
-   BOOST_CONTAINER_ATTRIBUTE_NODISCARD BOOST_CONTAINER_FORCEINLINE
-      iterator nth(size_type n) BOOST_NOEXCEPT_OR_NOTHROW
-   {
-      BOOST_ASSERT(this->m_holder.m_size >= n);
-      return iterator(this->m_holder.start()+difference_type(n));
-   }
-
-   //! <b>Requires</b>: size() >= n.
-   //!
-   //! <b>Effects</b>: Returns a const_iterator to the nth element
-   //!   from the beginning of the container. Returns end()
-   //!   if n == size().
-   //!
-   //! <b>Throws</b>: Nothing.
-   //!
-   //! <b>Complexity</b>: Constant.
-   //!
-   //! <b>Note</b>: Non-standard extension
-   BOOST_CONTAINER_ATTRIBUTE_NODISCARD BOOST_CONTAINER_FORCEINLINE
-      const_iterator nth(size_type n) const BOOST_NOEXCEPT_OR_NOTHROW
-   {
-      BOOST_ASSERT(this->m_holder.m_size >= n);
-      return const_iterator(this->m_holder.start()+difference_type(n));
-   }
-
-   //! <b>Requires</b>: begin() <= p <= end().
-   //!
-   //! <b>Effects</b>: Returns the index of the element pointed by p
-   //!   and size() if p == end().
-   //!
-   //! <b>Throws</b>: Nothing.
-   //!
-   //! <b>Complexity</b>: Constant.
-   //!
-   //! <b>Note</b>: Non-standard extension
-   BOOST_CONTAINER_ATTRIBUTE_NODISCARD BOOST_CONTAINER_FORCEINLINE
-      size_type index_of(iterator p) BOOST_NOEXCEPT_OR_NOTHROW
-   {
-      //Range check assert done in priv_index_of
-      return this->priv_index_of(vector_iterator_get_ptr(p));
-   }
-
-   //! <b>Requires</b>: begin() <= p <= end().
-   //!
-   //! <b>Effects</b>: Returns the index of the element pointed by p
-   //!   and size() if p == end().
-   //!
-   //! <b>Throws</b>: Nothing.
-   //!
-   //! <b>Complexity</b>: Constant.
-   //!
-   //! <b>Note</b>: Non-standard extension
-   BOOST_CONTAINER_ATTRIBUTE_NODISCARD BOOST_CONTAINER_FORCEINLINE
-      size_type index_of(const_iterator p) const BOOST_NOEXCEPT_OR_NOTHROW
-   {
-      //Range check assert done in priv_index_of
-      return this->priv_index_of(vector_iterator_get_ptr(p));
-   }
-
-   //! <b>Requires</b>: size() > n.
-   //!
-   //! <b>Effects</b>: Returns a reference to the nth element
-   //!   from the beginning of the container.
-   //!
-   //! <b>Throws</b>: range_error if n >= size()
-   //!
-   //! <b>Complexity</b>: Constant.
-   BOOST_CONTAINER_ATTRIBUTE_NODISCARD BOOST_CONTAINER_FORCEINLINE reference at(size_type n)
-   {
-      this->priv_throw_if_out_of_range(n);
-      return this->m_holder.start()[difference_type(n)];
-   }
-
-   //! <b>Requires</b>: size() > n.
-   //!
-   //! <b>Effects</b>: Returns a const reference to the nth element
-   //!   from the beginning of the container.
-   //!
-   //! <b>Throws</b>: range_error if n >= size()
-   //!
-   //! <b>Complexity</b>: Constant.
-   BOOST_CONTAINER_ATTRIBUTE_NODISCARD BOOST_CONTAINER_FORCEINLINE const_reference at(size_type n) const
-   {
-      this->priv_throw_if_out_of_range(n);
-      return this->m_holder.start()[n];
-   }
-
-   //////////////////////////////////////////////
-   //
-   //                 data access
-   //
-   //////////////////////////////////////////////
-
-   //! <b>Returns</b>: A pointer such that [data(),data() + size()) is a valid range.
-   //!   For a non-empty vector, data() == &front().
-   //!
-   //! <b>Throws</b>: Nothing.
-   //!
-   //! <b>Complexity</b>: Constant.
-   BOOST_CONTAINER_ATTRIBUTE_NODISCARD BOOST_CONTAINER_FORCEINLINE T* data() BOOST_NOEXCEPT_OR_NOTHROW
-   { return this->priv_raw_begin(); }
-
-   //! <b>Returns</b>: A pointer such that [data(),data() + size()) is a valid range.
-   //!   For a non-empty vector, data() == &front().
-   //!
-   //! <b>Throws</b>: Nothing.
-   //!
-   //! <b>Complexity</b>: Constant.
-   BOOST_CONTAINER_ATTRIBUTE_NODISCARD BOOST_CONTAINER_FORCEINLINE const T * data()  const BOOST_NOEXCEPT_OR_NOTHROW
-   { return this->priv_raw_begin(); }
-
-   //////////////////////////////////////////////
-   //
-   //                modifiers
-   //
-   //////////////////////////////////////////////
-
-   #if !defined(BOOST_NO_CXX11_VARIADIC_TEMPLATES) || defined(BOOST_CONTAINER_DOXYGEN_INVOKED)
-   //! <b>Effects</b>: Inserts an object of type T constructed with
-   //!   std::forward<Args>(args)... in the end of the vector.
-   //!
-   //! <b>Returns</b>: A reference to the created object.
-   //!
-   //! <b>Throws</b>: If memory allocation throws or the in-place constructor throws or
-   //!   T's copy/move constructor throws.
-   //!
-   //! <b>Complexity</b>: Amortized constant time.
-   template<class ...Args>
-   BOOST_CONTAINER_FORCEINLINE reference emplace_back(BOOST_FWD_REF(Args)...args)
-   {
-      T* const p = this->priv_raw_end();
-      if (BOOST_LIKELY(this->room_enough())){
-         //There is more memory, just construct a new object at the end
-         allocator_traits_type::construct(this->m_holder.alloc(), p, ::boost::forward<Args>(args)...);
-         ++this->m_holder.m_size;
-         return *p;
-      }
-      else{
-         typedef dtl::insert_emplace_proxy<allocator_type, Args...> proxy_t;
-         return *this->priv_insert_forward_range_no_capacity
-            (p, 1, proxy_t(::boost::forward<Args>(args)...), alloc_version());
-      }
-   }
-
-   //! <b>Effects</b>: Inserts an object of type T constructed with
-   //!   std::forward<Args>(args)... in the end of the vector.
-   //!
-   //! <b>Throws</b>: If the in-place constructor throws.
-   //!
-   //! <b>Complexity</b>: Constant time.
-   //!
-   //! <b>Note</b>: Non-standard extension.
-   template<class ...Args>
-   BOOST_CONTAINER_FORCEINLINE bool stable_emplace_back(BOOST_FWD_REF(Args)...args)
-   {
-      const bool is_room_enough = this->room_enough() || (alloc_version::value == 2 && this->m_holder.try_expand_fwd(1u));
-      if (BOOST_LIKELY(is_room_enough)){
-         //There is more memory, just construct a new object at the end
-         allocator_traits_type::construct(this->m_holder.alloc(), this->priv_raw_end(), ::boost::forward<Args>(args)...);
-         ++this->m_holder.m_size;
-      }
-      return is_room_enough;
-   }
-
-   //! <b>Requires</b>: position must be a valid iterator of *this.
-   //!
-   //! <b>Effects</b>: Inserts an object of type T constructed with
-   //!   std::forward<Args>(args)... before position
-   //!
-   //! <b>Throws</b>: If memory allocation throws or the in-place constructor throws or
-   //!   T's copy/move constructor/assignment throws.
-   //!
-   //! <b>Complexity</b>: If position is end(), amortized constant time
-   //!   Linear time otherwise.
-   template<class ...Args>
-   BOOST_CONTAINER_FORCEINLINE iterator emplace(const_iterator position, BOOST_FWD_REF(Args) ...args)
-   {
-      BOOST_ASSERT(this->priv_in_range_or_end(position));
-      //Just call more general insert(pos, size, value) and return iterator
-      typedef dtl::insert_emplace_proxy<allocator_type, Args...> proxy_t;
-      return this->priv_insert_forward_range( vector_iterator_get_ptr(position), 1
-                                            , proxy_t(::boost::forward<Args>(args)...));
-   }
-
-   #else // !defined(BOOST_NO_CXX11_VARIADIC_TEMPLATES)
-
-   #define BOOST_CONTAINER_VECTOR_EMPLACE_CODE(N) \
-   BOOST_MOVE_TMPL_LT##N BOOST_MOVE_CLASS##N BOOST_MOVE_GT##N \
-   BOOST_CONTAINER_FORCEINLINE reference emplace_back(BOOST_MOVE_UREF##N)\
-   {\
-      T* const p = this->priv_raw_end();\
-      if (BOOST_LIKELY(this->room_enough())){\
-         allocator_traits_type::construct (this->m_holder.alloc()\
-            , this->priv_raw_end() BOOST_MOVE_I##N BOOST_MOVE_FWD##N);\
-         ++this->m_holder.m_size;\
-         return *p;\
-      }\
-      else{\
-         typedef dtl::insert_emplace_proxy_arg##N<allocator_type BOOST_MOVE_I##N BOOST_MOVE_TARG##N> proxy_t;\
-         return *this->priv_insert_forward_range_no_capacity\
-            ( p, 1, proxy_t(BOOST_MOVE_FWD##N), alloc_version());\
-      }\
-   }\
-   \
-   BOOST_MOVE_TMPL_LT##N BOOST_MOVE_CLASS##N BOOST_MOVE_GT##N \
-   BOOST_CONTAINER_FORCEINLINE bool stable_emplace_back(BOOST_MOVE_UREF##N)\
-   {\
-      const bool is_room_enough = this->room_enough() || (alloc_version::value == 2 && this->m_holder.try_expand_fwd(1u));\
-      if (BOOST_LIKELY(is_room_enough)){\
-         allocator_traits_type::construct (this->m_holder.alloc()\
-            , this->priv_raw_end() BOOST_MOVE_I##N BOOST_MOVE_FWD##N);\
-         ++this->m_holder.m_size;\
-      }\
-      return is_room_enough;\
-   }\
-   \
-   BOOST_MOVE_TMPL_LT##N BOOST_MOVE_CLASS##N BOOST_MOVE_GT##N \
-   BOOST_CONTAINER_FORCEINLINE iterator emplace(const_iterator pos BOOST_MOVE_I##N BOOST_MOVE_UREF##N)\
-   {\
-      BOOST_ASSERT(this->priv_in_range_or_end(pos));\
-      typedef dtl::insert_emplace_proxy_arg##N<allocator_type BOOST_MOVE_I##N BOOST_MOVE_TARG##N> proxy_t;\
-      return this->priv_insert_forward_range(vector_iterator_get_ptr(pos), 1, proxy_t(BOOST_MOVE_FWD##N));\
-   }\
-   //
-   BOOST_MOVE_ITERATE_0TO9(BOOST_CONTAINER_VECTOR_EMPLACE_CODE)
-   #undef BOOST_CONTAINER_VECTOR_EMPLACE_CODE
-
-   #endif
-
-   #if defined(BOOST_CONTAINER_DOXYGEN_INVOKED)
-   //! <b>Effects</b>: Inserts a copy of x at the end of the vector.
-   //!
-   //! <b>Throws</b>: If memory allocation throws or
-   //!   T's copy/move constructor throws.
-   //!
-   //! <b>Complexity</b>: Amortized constant time.
-   void push_back(const T &x);
-
-   //! <b>Effects</b>: Constructs a new element in the end of the vector
-   //!   and moves the resources of x to this new element.
-   //!
-   //! <b>Throws</b>: If memory allocation throws or
-   //!   T's copy/move constructor throws.
-   //!
-   //! <b>Complexity</b>: Amortized constant time.
-   void push_back(T &&x);
-   #else
-   BOOST_MOVE_CONVERSION_AWARE_CATCH(push_back, T, void, priv_push_back)
-   #endif
-
-   #if defined(BOOST_CONTAINER_DOXYGEN_INVOKED)
-   //! <b>Requires</b>: position must be a valid iterator of *this.
-   //!
-   //! <b>Effects</b>: Insert a copy of x before position.
-   //!
-   //! <b>Throws</b>: If memory allocation throws or T's copy/move constructor/assignment throws.
-   //!
-   //! <b>Complexity</b>: If position is end(), amortized constant time
-   //!   Linear time otherwise.
-   iterator insert(const_iterator position, const T &x);
-
-   //! <b>Requires</b>: position must be a valid iterator of *this.
-   //!
-   //! <b>Effects</b>: Insert a new element before position with x's resources.
-   //!
-   //! <b>Throws</b>: If memory allocation throws.
-   //!
-   //! <b>Complexity</b>: If position is end(), amortized constant time
-   //!   Linear time otherwise.
-   iterator insert(const_iterator position, T &&x);
-   #else
-   BOOST_MOVE_CONVERSION_AWARE_CATCH_1ARG(insert, T, iterator, priv_insert, const_iterator, const_iterator)
-   #endif
-
-   //! <b>Requires</b>: p must be a valid iterator of *this.
-   //!
-   //! <b>Effects</b>: Insert n copies of x before pos.
-   //!
-   //! <b>Returns</b>: an iterator to the first inserted element or p if n is 0.
-   //!
-   //! <b>Throws</b>: If memory allocation throws or T's copy/move constructor throws.
-   //!
-   //! <b>Complexity</b>: Linear to n.
-   BOOST_CONTAINER_FORCEINLINE iterator insert(const_iterator p, size_type n, const T& x)
-   {
-      BOOST_ASSERT(this->priv_in_range_or_end(p));
-      dtl::insert_n_copies_proxy<allocator_type> proxy(x);
-      return this->priv_insert_forward_range(vector_iterator_get_ptr(p), n, proxy);
-   }
-
-   //! <b>Requires</b>: p must be a valid iterator of *this.
-   //!
-   //! <b>Effects</b>: Insert a copy of the [first, last) range before pos.
-   //!
-   //! <b>Returns</b>: an iterator to the first inserted element or pos if first == last.
-   //!
-   //! <b>Throws</b>: If memory allocation throws, T's constructor from a
-   //!   dereferenced InpIt throws or T's copy/move constructor/assignment throws.
-   //!
-   //! <b>Complexity</b>: Linear to boost::container::iterator_distance [first, last).
-   template <class InIt>
-   iterator insert(const_iterator pos, InIt first, InIt last
-      #if !defined(BOOST_CONTAINER_DOXYGEN_INVOKED)
-      , typename dtl::disable_if_or
-         < void
-         , dtl::is_convertible<InIt, size_type>
-         , dtl::is_not_input_iterator<InIt>
-         >::type * = 0
-      #endif
-      )
-   {
-      BOOST_ASSERT(this->priv_in_range_or_end(pos));
-      const size_type n_pos = size_type(pos - this->cbegin());
-      iterator it(vector_iterator_get_ptr(pos));
-      for(;first != last; ++first){
-         it = this->emplace(it, *first);
-         ++it;
-      }
-      return iterator(this->m_holder.start() + difference_type(n_pos));
-   }
-
-   #if !defined(BOOST_CONTAINER_DOXYGEN_INVOKED)
-   template <class FwdIt>
-   BOOST_CONTAINER_FORCEINLINE iterator insert(const_iterator pos, FwdIt first, FwdIt last
-      , typename dtl::disable_if_or
-         < void
-         , dtl::is_convertible<FwdIt, size_type>
-         , dtl::is_input_iterator<FwdIt>
-         >::type * = 0
-      )
-   {
-      typedef typename iter_size<FwdIt>::type it_size_type;
-      BOOST_ASSERT(this->priv_in_range_or_end(pos));
-      const it_size_type sz = boost::container::iterator_udistance(first, last);
-      if (BOOST_UNLIKELY(sz > size_type(-1))){
-         boost::container::throw_length_error("vector::insert, FwdIt's max length reached");
-      }
-
-      dtl::insert_range_proxy<allocator_type, FwdIt> proxy(first);
-      return this->priv_insert_forward_range(vector_iterator_get_ptr(pos), static_cast<size_type>(sz), proxy);
-   }
-   #endif
-
-   //! <b>Requires</b>: p must be a valid iterator of *this. num, must
-   //!   be equal to boost::container::iterator_distance(first, last)
-   //!
-   //! <b>Effects</b>: Insert a copy of the [first, last) range before pos.
-   //!
-   //! <b>Returns</b>: an iterator to the first inserted element or pos if first == last.
-   //!
-   //! <b>Throws</b>: If memory allocation throws, T's constructor from a
-   //!   dereferenced InpIt throws or T's copy/move constructor/assignment throws.
-   //!
-   //! <b>Complexity</b>: Linear to boost::container::iterator_distance [first, last).
-   //!
-   //! <b>Note</b>: This function avoids a linear operation to calculate boost::container::iterator_distance[first, last)
-   //!   for forward and bidirectional iterators, and a one by one insertion for input iterators. This is a
-   //!   a non-standard extension.
-   #if !defined(BOOST_CONTAINER_DOXYGEN_INVOKED)
-   template <class InIt>
-   BOOST_CONTAINER_FORCEINLINE iterator insert(const_iterator pos, size_type num, InIt first, InIt last)
-   {
-      BOOST_ASSERT(this->priv_in_range_or_end(pos));
-      BOOST_ASSERT(dtl::is_input_iterator<InIt>::value ||
-                   num == boost::container::iterator_udistance(first, last));
-      (void)last;
-      dtl::insert_range_proxy<allocator_type, InIt> proxy(first);
-      return this->priv_insert_forward_range(vector_iterator_get_ptr(pos), num, proxy);
-   }
-   #endif
-
-   #if !defined(BOOST_NO_CXX11_HDR_INITIALIZER_LIST)
-   //! <b>Requires</b>: position must be a valid iterator of *this.
-   //!
-   //! <b>Effects</b>: Insert a copy of the [il.begin(), il.end()) range before position.
-   //!
-   //! <b>Returns</b>: an iterator to the first inserted element or position if first == last.
-   //!
-   //! <b>Complexity</b>: Linear to the range [il.begin(), il.end()).
-   BOOST_CONTAINER_FORCEINLINE iterator insert(const_iterator position, std::initializer_list<value_type> il)
-   {
-      //Assertion done in insert()
-      return this->insert(position, il.begin(), il.end());
-   }
-   #endif
-
-   //! <b>Effects</b>: Removes the last element from the container.
-   //!
-   //! <b>Throws</b>: Nothing.
-   //!
-   //! <b>Complexity</b>: Constant time.
-   BOOST_CONTAINER_FORCEINLINE void pop_back() BOOST_NOEXCEPT_OR_NOTHROW
-   {
-      BOOST_ASSERT(!this->empty());
-      //Destroy last element
-      allocator_traits_type::destroy(this->get_stored_allocator(), this->priv_raw_end() - 1);
-      --this->m_holder.m_size;
-   }
-
-   //! <b>Effects</b>: Erases the element at position pos.
-   //!
-   //! <b>Throws</b>: Nothing.
-   //!
-   //! <b>Complexity</b>: Linear to the elements between pos and the
-   //!   last element. Constant if pos is the last element.
-   iterator erase(const_iterator position)
-   {
-      BOOST_ASSERT(this->priv_in_range(position));
-      const pointer p = vector_iterator_get_ptr(position);
-      T *const pos_ptr = boost::movelib::to_raw_pointer(p);
-      T *const end_ptr = this->priv_raw_end();
-
-      //Move elements forward and destroy last
-      (void)::boost::container::move(pos_ptr + 1, end_ptr, pos_ptr);
-
-      T *const last_ptr = end_ptr-1;
-      if(!value_traits::trivial_dctr_after_move || pos_ptr == last_ptr){
-         allocator_traits_type::destroy(this->get_stored_allocator(), last_ptr);
-      }
-      --this->m_holder.m_size;
-      return iterator(p);
-   }
-
-   //! <b>Effects</b>: Erases the elements pointed by [first, last).
-   //!
-   //! <b>Throws</b>: Nothing.
-   //!
-   //! <b>Complexity</b>: Linear to the distance between first and last
-   //!   plus linear to the elements between pos and the last element.
-   iterator erase(const_iterator first, const_iterator last)
-   {
-      BOOST_ASSERT(this->priv_in_range_or_end(first));
-      BOOST_ASSERT(this->priv_in_range_or_end(last));
-      BOOST_ASSERT(first <= last);
-      if(first != last){
-         T* const old_end_ptr = this->priv_raw_end();
-         T* const first_ptr = boost::movelib::to_raw_pointer(vector_iterator_get_ptr(first));
-         T* const last_ptr  = boost::movelib::to_raw_pointer(vector_iterator_get_ptr(last));
-         T* const new_last_ptr = boost::movelib::to_raw_pointer(boost::container::move(last_ptr, old_end_ptr, first_ptr));
-         const size_type n = static_cast<size_type>(old_end_ptr - new_last_ptr);
-         if(!value_traits::trivial_dctr_after_move || old_end_ptr == last_ptr){
-            boost::container::destroy_alloc_n(this->get_stored_allocator(), new_last_ptr, n);
-         }
-         this->m_holder.dec_stored_size(n);
-      }
-      return iterator(vector_iterator_get_ptr(first));
-   }
-
-   //! <b>Effects</b>: Swaps the contents of *this and x.
-   //!
-   //! <b>Throws</b>: Nothing.
-   //!
-   //! <b>Complexity</b>: Constant.
-   BOOST_CONTAINER_FORCEINLINE void swap(vector& x)
-      BOOST_NOEXCEPT_IF( ((allocator_traits_type::propagate_on_container_swap::value
-                                    || allocator_traits_type::is_always_equal::value) &&
-                                    !dtl::is_version<allocator_type, 0>::value))
-   {
-      this->priv_swap(x, dtl::bool_<dtl::is_version<allocator_type, 0>::value>());
-   }
-
-   #ifndef BOOST_CONTAINER_DOXYGEN_INVOKED
-
-   //! <b>Effects</b>: Swaps the contents of *this and x.
-   //!
-   //! <b>Throws</b>: Nothing.
-   //!
-   //! <b>Complexity</b>: Linear
-   //!
-   //! <b>Note</b>: Non-standard extension to support static_vector
-   template<class OtherA>
-   BOOST_CONTAINER_FORCEINLINE void swap(vector<T, OtherA, Options> & x
-            , typename dtl::enable_if_and
-                     < void
-                     , dtl::is_version<typename real_allocator<T, OtherA>::type, 0>
-                     , dtl::is_different<typename real_allocator<T, OtherA>::type, allocator_type>
-                     >::type * = 0
-            )
-   {  this->m_holder.deep_swap(x.m_holder); }
-
-   #endif   //#ifndef BOOST_CONTAINER_DOXYGEN_INVOKED
-
-   //! <b>Effects</b>: Erases all the elements of the vector.
-   //!
-   //! <b>Throws</b>: Nothing.
-   //!
-   //! <b>Complexity</b>: Linear to the number of elements in the container.
-   BOOST_CONTAINER_FORCEINLINE void clear() BOOST_NOEXCEPT_OR_NOTHROW
-   {  this->priv_destroy_all();  }
-
-   //! <b>Effects</b>: Returns true if x and y are equal
-   //!
-   //! <b>Complexity</b>: Linear to the number of elements in the container.
-   BOOST_CONTAINER_ATTRIBUTE_NODISCARD BOOST_CONTAINER_FORCEINLINE friend bool operator==(const vector& x, const vector& y)
-   {  return x.size() == y.size() && ::boost::container::algo_equal(x.begin(), x.end(), y.begin());  }
-
-   //! <b>Effects</b>: Returns true if x and y are unequal
-   //!
-   //! <b>Complexity</b>: Linear to the number of elements in the container.
-   BOOST_CONTAINER_ATTRIBUTE_NODISCARD BOOST_CONTAINER_FORCEINLINE friend bool operator!=(const vector& x, const vector& y)
-   {  return !(x == y); }
-
-   //! <b>Effects</b>: Returns true if x is less than y
-   //!
-   //! <b>Complexity</b>: Linear to the number of elements in the container.
-   BOOST_CONTAINER_ATTRIBUTE_NODISCARD friend bool operator<(const vector& x, const vector& y)
-   {  return boost::container::algo_lexicographical_compare(x.begin(), x.end(), y.begin(), y.end());  }
-
-   //! <b>Effects</b>: Returns true if x is greater than y
-   //!
-   //! <b>Complexity</b>: Linear to the number of elements in the container.
-   BOOST_CONTAINER_ATTRIBUTE_NODISCARD BOOST_CONTAINER_FORCEINLINE friend bool operator>(const vector& x, const vector& y)
-   {  return y < x;  }
-
-   //! <b>Effects</b>: Returns true if x is equal or less than y
-   //!
-   //! <b>Complexity</b>: Linear to the number of elements in the container.
-   BOOST_CONTAINER_ATTRIBUTE_NODISCARD BOOST_CONTAINER_FORCEINLINE friend bool operator<=(const vector& x, const vector& y)
-   {  return !(y < x);  }
-
-   //! <b>Effects</b>: Returns true if x is equal or greater than y
-   //!
-   //! <b>Complexity</b>: Linear to the number of elements in the container.
-   BOOST_CONTAINER_ATTRIBUTE_NODISCARD BOOST_CONTAINER_FORCEINLINE friend bool operator>=(const vector& x, const vector& y)
-   {  return !(x < y);  }
-
-   //! <b>Effects</b>: x.swap(y)
-   //!
-   //! <b>Complexity</b>: Constant.
-   BOOST_CONTAINER_FORCEINLINE friend void swap(vector& x, vector& y)
-       BOOST_NOEXCEPT_IF(BOOST_NOEXCEPT(x.swap(y)))
-   {  x.swap(y);  }
-
-   #ifndef BOOST_CONTAINER_DOXYGEN_INVOKED
-   //! <b>Effects</b>: If n is less than or equal to capacity(), this call has no
-   //!   effect. Otherwise, it is a request for allocation of additional memory
-   //!   (memory expansion) that will not invalidate iterators.
-   //!   If the request is successful, then capacity() is greater than or equal to
-   //!   n; otherwise, capacity() is unchanged. In either case, size() is unchanged.
-   //!
-   //! <b>Throws</b>: If memory allocation allocation throws or T's copy/move constructor throws.
-   //!
-   //! <b>Note</b>: Non-standard extension.
-   bool stable_reserve(size_type new_cap)
-   {
-      const size_type cp = this->capacity();
-      return cp >= new_cap || (alloc_version::value == 2 && this->m_holder.try_expand_fwd(size_type(new_cap - cp)));
-   }
-
-   //Absolutely experimental. This function might change, disappear or simply crash!
-   template<class BiDirPosConstIt, class BiDirValueIt>
-   BOOST_CONTAINER_FORCEINLINE void insert_ordered_at(const size_type element_count, BiDirPosConstIt last_position_it, BiDirValueIt last_value_it)
-   {
-      typedef vector_insert_ordered_cursor<BiDirPosConstIt, BiDirValueIt> inserter_t;
-      return this->priv_insert_ordered_at(element_count, inserter_t(last_position_it, last_value_it));
-   }
-
-   template<class InputIt>
-   BOOST_CONTAINER_FORCEINLINE void merge(InputIt first, InputIt last)
-   {  this->merge(first, last, value_less_t());  }
-
-   template<class InputIt, class Compare>
-   BOOST_CONTAINER_FORCEINLINE void merge(InputIt first, InputIt last, Compare comp)
-   {
-      size_type const s = this->size();
-      size_type const c = this->capacity();
-      size_type n = 0;
-      size_type const free_cap = c - s;
-      //If not input iterator and new elements don't fit in the remaining capacity, merge in new buffer
-      if(!dtl::is_input_iterator<InputIt>::value &&
-         free_cap < (n = boost::container::iterator_udistance(first, last))){
-         this->priv_merge_in_new_buffer(first, n, comp, alloc_version());
-      }
-      else{
-         this->insert(this->cend(), first, last);
-         T *const raw_beg = this->priv_raw_begin();
-         T *const raw_end = this->priv_raw_end();
-         T *const raw_pos = raw_beg + s;
-         boost::movelib::adaptive_merge(raw_beg, raw_pos, raw_end, comp, raw_end, free_cap - n);
-      }
-   }
-
-   template<class InputIt>
-   BOOST_CONTAINER_FORCEINLINE void merge_unique(InputIt first, InputIt last)
-   {  this->merge_unique(first, last, value_less_t());  }
-
-   template<class InputIt, class Compare>
-   BOOST_CONTAINER_FORCEINLINE void merge_unique(InputIt first, InputIt last, Compare comp)
-   {
-      size_type const old_size = this->size();
-      this->priv_set_difference_back(first, last, comp);
-      T *const raw_beg = this->priv_raw_begin();
-      T *const raw_end = this->priv_raw_end();
-      T *raw_pos = raw_beg + old_size;
-      boost::movelib::adaptive_merge(raw_beg, raw_pos, raw_end, comp, raw_end, this->capacity() - this->size());
-   }
-
-   private:
-   template<class PositionValue>
-   void priv_insert_ordered_at(const size_type element_count, PositionValue position_value)
-   {
-      const size_type old_size_pos = this->size();
-      this->reserve(old_size_pos + element_count);
-      T* const begin_ptr = this->priv_raw_begin();
-      size_type insertions_left = element_count;
-      size_type prev_pos = old_size_pos;
-      size_type old_hole_size = element_count;
-
-      //Exception rollback. If any copy throws before the hole is filled, values
-      //already inserted/copied at the end of the buffer will be destroyed.
-      typename value_traits::ArrayDestructor past_hole_values_destroyer
-         (begin_ptr + old_size_pos + element_count, this->m_holder.alloc(), size_type(0u));
-      //Loop for each insertion backwards, first moving the elements after the insertion point,
-      //then inserting the element.
-      while(insertions_left){
-         --position_value;
-         size_type const pos = position_value.get_pos();
-         BOOST_ASSERT(pos != size_type(-1) && pos <= old_size_pos && pos <= prev_pos);
-         //If needed shift the range after the insertion point and the previous insertion point.
-         //Function will take care if the shift crosses the size() boundary, using copy/move
-         //or uninitialized copy/move if necessary.
-         size_type new_hole_size = (pos != prev_pos)
-            ? priv_insert_ordered_at_shift_range(pos, prev_pos, this->size(), insertions_left)
-            : old_hole_size
-            ;
-         if(new_hole_size){
-            //The hole was reduced by priv_insert_ordered_at_shift_range so expand exception rollback range backwards
-            past_hole_values_destroyer.increment_size_backwards(prev_pos - pos);
-            //Insert the new value in the hole
-            allocator_traits_type::construct(this->m_holder.alloc(), begin_ptr + pos + insertions_left - 1, position_value.get_val());
-            if(--new_hole_size){
-               //The hole was reduced by the new insertion by one
-               past_hole_values_destroyer.increment_size_backwards(size_type(1u));
-            }
-            else{
-               //Hole was just filled, disable exception rollback and change vector size
-               past_hole_values_destroyer.release();
-               this->m_holder.inc_stored_size(element_count);
-            }
-         }
-         else{
-            if(old_hole_size){
-               //Hole was just filled by priv_insert_ordered_at_shift_range, disable exception rollback and change vector size
-               past_hole_values_destroyer.release();
-               this->m_holder.inc_stored_size(element_count);
-            }
-            //Insert the new value in the already constructed range
-            begin_ptr[pos + insertions_left - 1] = position_value.get_val();
-         }
-         --insertions_left;
-         old_hole_size = new_hole_size;
-         prev_pos = pos;
-      }
-   }
-
-   template<class InputIt, class Compare>
-   void priv_set_difference_back(InputIt first1, InputIt last1, Compare comp)
-   {
-      T * old_first2 = this->priv_raw_begin();
-      T * first2 = old_first2;
-      T * last2  = this->priv_raw_end();
-
-      while (first1 != last1) {
-         if (first2 == last2){
-            this->insert(this->cend(), first1, last1);
-            return;
-         }
-
-         if (comp(*first1, *first2)) {
-            this->emplace_back(*first1);
-            T * const raw_begin = this->priv_raw_begin();
-            if(old_first2 != raw_begin)
-            {
-               //Reallocation happened, update range
-               first2 = raw_begin + (first2 - old_first2);
-               last2  = raw_begin + (last2 - old_first2);
-               old_first2 = raw_begin;
-            }
-            ++first1;
-         }
-         else {
-            if (!comp(*first2, *first1)) {
-               ++first1;
-            }
-            ++first2;
-         }
-      }
-   }
-
-   template<class FwdIt, class Compare>
-   BOOST_CONTAINER_FORCEINLINE void priv_merge_in_new_buffer(FwdIt, size_type, Compare, version_0)
-   {
-      alloc_holder_t::on_capacity_overflow();
-   }
-
-   template<class FwdIt, class Compare, class Version>
-   void priv_merge_in_new_buffer(FwdIt first, size_type n, Compare comp, Version)
-   {
-      size_type const new_size = this->size() + n;
-      size_type new_cap = new_size;
-      pointer p = pointer();
-      pointer const new_storage = this->m_holder.allocation_command(allocate_new, new_size, new_cap, p);
-
-      BOOST_ASSERT((new_cap >= this->size() ) && (new_cap - this->size()) >= n);
-      allocator_type &a = this->m_holder.alloc();
-      typename value_traits::ArrayDeallocator new_buffer_deallocator(new_storage, a, new_cap);
-      typename value_traits::ArrayDestructor  new_values_destroyer(new_storage, a, 0u);
-      T* pbeg  = this->priv_raw_begin();
-      size_type const old_size = this->size();
-      T* const pend = pbeg + old_size;
-      T* d_first = boost::movelib::to_raw_pointer(new_storage);
-      size_type added = n;
-      //Merge in new buffer loop
-      while(1){
-         if(!n) {
-            ::boost::container::uninitialized_move_alloc(this->m_holder.alloc(), pbeg, pend, d_first);
-            break;
-         } 
-         else if(pbeg == pend) {
-            ::boost::container::uninitialized_move_alloc_n(this->m_holder.alloc(), first, n, d_first);
-            break;
-         }
-         //maintain stability moving external values only if they are strictly less
-         else if(comp(*first, *pbeg)) {
-            allocator_traits_type::construct( this->m_holder.alloc(), d_first, *first );
-            new_values_destroyer.increment_size(1u);
-            ++first;
-            --n;
-            ++d_first;
-         }
-         else{
-            allocator_traits_type::construct( this->m_holder.alloc(), d_first, boost::move(*pbeg) );
-            new_values_destroyer.increment_size(1u);
-            ++pbeg;
-            ++d_first;
-         }
-      }
-
-      //Nothrow operations
-      pointer const old_p     = this->m_holder.start();
-      size_type const old_cap = this->m_holder.capacity();
-      boost::container::destroy_alloc_n(a, boost::movelib::to_raw_pointer(old_p), old_size);
-      if (old_cap > 0) {
-         this->m_holder.deallocate(old_p, old_cap);
-      }
-      m_holder.set_stored_size(old_size + added);
-      this->m_holder.start(new_storage);
-      this->m_holder.capacity(new_cap);
-      new_buffer_deallocator.release();
-      new_values_destroyer.release();
-   }
-
-   BOOST_CONTAINER_FORCEINLINE bool room_enough() const
-   {  return this->m_holder.m_size != this->m_holder.capacity();   }
-
-   BOOST_CONTAINER_FORCEINLINE pointer back_ptr() const
-   {  return this->m_holder.start() + difference_type(this->m_holder.m_size);  }
-
-   BOOST_CONTAINER_FORCEINLINE size_type priv_index_of(pointer p) const
-   {
-      BOOST_ASSERT(this->m_holder.start() <= p);
-      BOOST_ASSERT(p <= (this->m_holder.start()+difference_type(this->size())));
-      return static_cast<size_type>(p - this->m_holder.start());
-   }
-
-   template<class OtherA>
-   void priv_move_assign(BOOST_RV_REF_BEG vector<T, OtherA, Options> BOOST_RV_REF_END x
-      , typename dtl::enable_if_c
-         < dtl::is_version<typename real_allocator<T, OtherA>::type, 0>::value >::type * = 0)
-   {
-      if(!dtl::is_same<typename real_allocator<T, OtherA>::type, allocator_type>::value &&
-          this->capacity() < x.size()){
-         alloc_holder_t::on_capacity_overflow();
-      }
-      T* const this_start  = this->priv_raw_begin();
-      T* const other_start = x.priv_raw_begin();
-      const size_type this_sz  = m_holder.m_size;
-      const size_type other_sz = static_cast<size_type>(x.m_holder.m_size);
-      boost::container::move_assign_range_alloc_n(this->m_holder.alloc(), other_start, other_sz, this_start, this_sz);
-      m_holder.set_stored_size(other_sz);
-      //Not emptying the source container seems to be confusing for users as drop-in
-      //replacement for non-static vectors, so clear it.
-      x.clear();
-   }
-
-   template<class OtherA>
-   void priv_move_assign(BOOST_RV_REF_BEG vector<T, OtherA, Options> BOOST_RV_REF_END x
-      , typename dtl::disable_if_or
-         < void
-         , dtl::is_version<typename real_allocator<T, OtherA>::type, 0>
-         , dtl::is_different<typename real_allocator<T, OtherA>::type, allocator_type>
-         >::type * = 0)
-   {
-      //for move assignment, no aliasing (&x != this) is assumed.
-      //x.size() == 0 is allowed for buggy std libraries.
-      BOOST_ASSERT(this != &x || x.size() == 0);
-      allocator_type &this_alloc = this->m_holder.alloc();
-      allocator_type &x_alloc    = x.m_holder.alloc();
-      const bool propagate_alloc = allocator_traits_type::propagate_on_container_move_assignment::value;
-
-      //In this allocator move constructor the allocator maybe will be propagated -----------------------v
-      const bool is_propagable_from_x = is_propagable_from(x_alloc, x.m_holder.start(), this_alloc, propagate_alloc);
-
-      //Resources can be transferred if both allocators are
-      //going to be equal after this function (either propagated or already equal)
-      if(is_propagable_from_x){
-         this->clear();
-         if(BOOST_LIKELY(!!this->m_holder.m_start))
-            this->m_holder.deallocate(this->m_holder.m_start, this->m_holder.m_capacity);
-         this->m_holder.steal_resources(x.m_holder);
-      }
-      //Else do a one by one move. Also, clear the source as users find confusing
-      //elements are still alive in the source container.
-      else{
-         this->assign( boost::make_move_iterator(boost::movelib::iterator_to_raw_pointer(x.begin()))
-                     , boost::make_move_iterator(boost::movelib::iterator_to_raw_pointer(x.end()  ))
-                     );
-         x.clear();
-      }
-      //Move allocator if needed
-      dtl::move_alloc(this_alloc, x_alloc, dtl::bool_<propagate_alloc>());
-   }
-
-   template<class OtherA>
-   void priv_copy_assign(const vector<T, OtherA, Options> &x
-      , typename dtl::enable_if_c
-         < dtl::is_version<typename real_allocator<T, OtherA>::type, 0>::value >::type * = 0)
-   {
-      if(!dtl::is_same<typename real_allocator<T, OtherA>::type, allocator_type>::value &&
-         this->capacity() < x.size()){
-         alloc_holder_t::on_capacity_overflow();
-      }
-      T* const this_start  = this->priv_raw_begin();
-      T* const other_start = x.priv_raw_begin();
-      const size_type this_sz  = m_holder.m_size;
-      const size_type other_sz = static_cast<size_type>(x.m_holder.m_size);
-      boost::container::copy_assign_range_alloc_n(this->m_holder.alloc(), other_start, other_sz, this_start, this_sz);
-      m_holder.set_stored_size(other_sz);
-   }
-
-   template<class OtherA>
-   typename dtl::disable_if_or
-      < void
-      , dtl::is_version<typename real_allocator<T, OtherA>::type, 0>
-      , dtl::is_different<typename real_allocator<T, OtherA>::type, allocator_type>
-      >::type
-      priv_copy_assign(const vector<T, OtherA, Options> &x)
-   {
-      allocator_type &this_alloc     = this->m_holder.alloc();
-      const allocator_type &x_alloc  = x.m_holder.alloc();
-      dtl::bool_<allocator_traits_type::
-         propagate_on_container_copy_assignment::value> flag;
-      if(flag && this_alloc != x_alloc){
-         this->clear();
-         this->shrink_to_fit();
-      }
-      dtl::assign_alloc(this_alloc, x_alloc, flag);
-      this->assign( x.priv_raw_begin(), x.priv_raw_end() );
-   }
-
-   template<class Vector>  //Template it to avoid it in explicit instantiations
-   BOOST_CONTAINER_FORCEINLINE void priv_swap(Vector &x, dtl::true_type)   //version_0
-   {  this->m_holder.deep_swap(x.m_holder);  }
-
-   template<class Vector>  //Template it to avoid it in explicit instantiations
-   void priv_swap(Vector &x, dtl::false_type)  //version_N
-   {
-      const bool propagate_alloc = allocator_traits_type::propagate_on_container_swap::value;
-      if (BOOST_UNLIKELY(&x == this)){
-         return;
-      }
-      else if(are_swap_propagable( this->get_stored_allocator(), this->m_holder.start()
-                                 , x.get_stored_allocator(), x.m_holder.start(), propagate_alloc)){
-         //Just swap internals
-         this->m_holder.swap_resources(x.m_holder);
-      }
-      else{
-         //Else swap element by element...
-         bool const t_smaller = this->size() < x.size();
-         vector &sml = t_smaller ? *this : x;
-         vector &big = t_smaller ? x : *this;
-
-         //For empty containers, maybe storage can be moved from the other (just like in the move constructor)         
-         if(sml.empty() && is_propagable_from(big.get_stored_allocator(), big.data(), sml.get_allocator(), propagate_alloc)){
-            if(BOOST_LIKELY(0u != sml.capacity()))
-               sml.m_holder.deallocate(sml.m_holder.m_start, sml.m_holder.m_capacity);
-            sml.steal_resources(big);
-         }
-         else {
-            //Else swap element by element...
-            size_type const common_elements = sml.size();
-            for(size_type i = 0; i != common_elements; ++i){
-               boost::adl_move_swap(sml[i], big[i]);
-            }
-            //... and move-insert the remaining range
-            sml.insert( sml.cend()
-                      , boost::make_move_iterator(boost::movelib::iterator_to_raw_pointer(big.nth(common_elements)))
-                      , boost::make_move_iterator(boost::movelib::iterator_to_raw_pointer(big.end()))
-                      );
-            //Destroy remaining elements
-            big.erase(big.nth(common_elements), big.cend());
-         }
-      }
-      //And now swap the allocator
-      dtl::swap_alloc(this->m_holder.alloc(), x.m_holder.alloc(), dtl::bool_<propagate_alloc>());
-   }
-
-   BOOST_CONTAINER_FORCEINLINE void priv_move_to_new_buffer(size_type, version_0)
-   {  alloc_holder_t::on_capacity_overflow();  }
-
-   BOOST_CONTAINER_FORCEINLINE dtl::insert_range_proxy<allocator_type, boost::move_iterator<T*> > priv_dummy_empty_proxy()
-   {
-      return dtl::insert_range_proxy<allocator_type, boost::move_iterator<T*> >
-         (::boost::make_move_iterator((T *)0));
-   }
-
-   BOOST_CONTAINER_FORCEINLINE void priv_move_to_new_buffer(size_type new_cap, version_1)
-   {
-      //There is not enough memory, allocate a new buffer
-      //Pass the hint so that allocators can take advantage of this.
-      pointer const p = this->m_holder.allocate(new_cap);
-      #ifdef BOOST_CONTAINER_VECTOR_ALLOC_STATS
-      ++this->num_alloc;
-      #endif
-      //We will reuse insert code, so create a dummy input iterator
-      this->priv_insert_forward_range_new_allocation
-         ( boost::movelib::to_raw_pointer(p), new_cap, this->priv_raw_end(), 0, this->priv_dummy_empty_proxy());
-   }
-
-   void priv_move_to_new_buffer(size_type new_cap, version_2)
-   {
-      //There is not enough memory, allocate a new
-      //buffer or expand the old one.
-      bool same_buffer_start;
-      size_type real_cap = 0;
-      pointer reuse(this->m_holder.start());
-      pointer const ret(this->m_holder.allocation_command(allocate_new | expand_fwd | expand_bwd, new_cap, real_cap = new_cap, reuse));
-
-      //Check for forward expansion
-      same_buffer_start = reuse && this->m_holder.start() == ret;
-      if(same_buffer_start){
-         #ifdef BOOST_CONTAINER_VECTOR_ALLOC_STATS
-         ++this->num_expand_fwd;
-         #endif
-         this->m_holder.capacity(real_cap);
-      }
-      else{ //If there is no forward expansion, move objects, we will reuse insertion code
-         T * const new_mem = boost::movelib::to_raw_pointer(ret);
-         T * const ins_pos = this->priv_raw_end();
-         if(reuse){   //Backwards (and possibly forward) expansion
-            #ifdef BOOST_CONTAINER_VECTOR_ALLOC_STATS
-            ++this->num_expand_bwd;
-            #endif
-            this->priv_insert_forward_range_expand_backwards
-               ( new_mem, real_cap, ins_pos, 0, this->priv_dummy_empty_proxy());
-         }
-         else{ //New buffer
-            #ifdef BOOST_CONTAINER_VECTOR_ALLOC_STATS
-            ++this->num_alloc;
-            #endif
-            this->priv_insert_forward_range_new_allocation
-               ( new_mem, real_cap, ins_pos, 0, this->priv_dummy_empty_proxy());
-         }
-      }
-   }
-
-   void priv_destroy_last_n(const size_type n) BOOST_NOEXCEPT_OR_NOTHROW
-   {
-      BOOST_ASSERT(n <= this->m_holder.m_size);
-      boost::container::destroy_alloc_n(this->get_stored_allocator(), this->priv_raw_end() - n, n);
-      this->m_holder.dec_stored_size(n);
-   }
-
-   template<class InpIt>
-   void priv_uninitialized_construct_at_end(InpIt first, InpIt last)
-   {
-      T* const old_end_pos = this->priv_raw_end();
-      T* const new_end_pos = boost::container::uninitialized_copy_alloc(this->m_holder.alloc(), first, last, old_end_pos);
-      this->m_holder.inc_stored_size(static_cast<size_type>(new_end_pos - old_end_pos));
-   }
-
-   void priv_destroy_all() BOOST_NOEXCEPT_OR_NOTHROW
-   {
-      boost::container::destroy_alloc_n
-         (this->get_stored_allocator(), this->priv_raw_begin(), this->m_holder.m_size);
-      this->m_holder.m_size = 0;
-   }
-
-   template<class U>
-   BOOST_CONTAINER_FORCEINLINE iterator priv_insert(const const_iterator &p, BOOST_FWD_REF(U) u)
-   {
-      return this->emplace(p, ::boost::forward<U>(u));
-   }
-
-   template <class U>
-   BOOST_CONTAINER_FORCEINLINE void priv_push_back(BOOST_FWD_REF(U) u)
-   {
-      this->emplace_back(::boost::forward<U>(u));
-   }
-
-   //Overload to support compiler errors that instantiate too much
-   BOOST_CONTAINER_FORCEINLINE void priv_push_back(::boost::move_detail::nat)
-   {}
-
-   BOOST_CONTAINER_FORCEINLINE iterator priv_insert(const_iterator, ::boost::move_detail::nat)
-   {  return iterator();  }
-
-   BOOST_CONTAINER_FORCEINLINE dtl::insert_n_copies_proxy<allocator_type> priv_resize_proxy(const T &x)
-   {  return dtl::insert_n_copies_proxy<allocator_type>(x);   }
-
-   BOOST_CONTAINER_FORCEINLINE dtl::insert_default_initialized_n_proxy<allocator_type> priv_resize_proxy(default_init_t)
-   {  return dtl::insert_default_initialized_n_proxy<allocator_type>();  }
-
-   BOOST_CONTAINER_FORCEINLINE dtl::insert_value_initialized_n_proxy<allocator_type> priv_resize_proxy(value_init_t)
-   {  return dtl::insert_value_initialized_n_proxy<allocator_type>(); }
-
-   BOOST_CONTAINER_FORCEINLINE void priv_shrink_to_fit(version_0) BOOST_NOEXCEPT_OR_NOTHROW
-   {}
-
-   void priv_shrink_to_fit(version_1)
-   {
-      const size_type cp = this->m_holder.capacity();
-      if(cp){
-         const size_type sz = this->size();
-         if(!sz){
-            if(BOOST_LIKELY(!!this->m_holder.m_start))
-               this->m_holder.deallocate(this->m_holder.m_start, cp);
-            this->m_holder.m_start     = pointer();
-            this->m_holder.m_capacity  = 0;
-         }
-         else if(sz < cp){
-            this->priv_move_to_new_buffer(sz, alloc_version());
-         }
-      }
-   }
-
-   void priv_shrink_to_fit(version_2) BOOST_NOEXCEPT_OR_NOTHROW
-   {
-      const size_type cp = this->m_holder.capacity();
-      if(cp){
-         const size_type sz = this->size();
-         if(!sz){
-            if(BOOST_LIKELY(!!this->m_holder.m_start))
-               this->m_holder.deallocate(this->m_holder.m_start, cp);
-            this->m_holder.m_start     = pointer();
-            this->m_holder.m_capacity  = 0;
-         }
-         else{
-            size_type received_size = sz;
-            pointer reuse(this->m_holder.start());
-            if(this->m_holder.allocation_command
-               (shrink_in_place | nothrow_allocation, cp, received_size, reuse)){
-               this->m_holder.capacity(received_size);
-               #ifdef BOOST_CONTAINER_VECTOR_ALLOC_STATS
-               ++this->num_shrink;
-               #endif
-            }
-         }
-      }
-   }
-
-   template <class InsertionProxy>
-   BOOST_CONTAINER_FORCEINLINE iterator priv_insert_forward_range_no_capacity
-      (T * const, const size_type, const InsertionProxy , version_0)
-   {
-      return alloc_holder_t::on_capacity_overflow(), iterator();
-   }
-
-   template <class InsertionProxy>
-   BOOST_CONTAINER_NOINLINE iterator priv_insert_forward_range_no_capacity
-      (T *const raw_pos, const size_type n, const InsertionProxy insert_range_proxy, version_1)
-   {
-      //Check if we have enough memory or try to expand current memory
-      const size_type n_pos = static_cast<size_type>(raw_pos - this->priv_raw_begin());
-
-      const size_type new_cap = this->m_holder.template next_capacity<growth_factor_type>(n);
-      //Pass the hint so that allocators can take advantage of this.
-      T * const new_buf = boost::movelib::to_raw_pointer(this->m_holder.allocate(new_cap));
-      #ifdef BOOST_CONTAINER_VECTOR_ALLOC_STATS
-      ++this->num_alloc;
-      #endif
-      this->priv_insert_forward_range_new_allocation(new_buf, new_cap, raw_pos, n, insert_range_proxy);
-      return iterator(this->m_holder.start() + difference_type(n_pos));
-   }
-
-   template <class InsertionProxy>
-   BOOST_CONTAINER_NOINLINE iterator priv_insert_forward_range_no_capacity
-      (T *const raw_pos, const size_type n, const InsertionProxy insert_range_proxy, version_2)
-   {
-      //Check if we have enough memory or try to expand current memory
-      const size_type n_pos = size_type(raw_pos - this->priv_raw_begin());
-
-      //There is not enough memory, allocate a new
-      //buffer or expand the old one.
-      size_type real_cap = this->m_holder.template next_capacity<growth_factor_type>(n);
-      pointer reuse(this->m_holder.start());
-      pointer const ret (this->m_holder.allocation_command
-         (allocate_new | expand_fwd | expand_bwd, size_type(this->m_holder.m_size + n), real_cap, reuse));
-
-      //Buffer reallocated
-      if(reuse){
-         //Forward expansion, delay insertion
-         if(this->m_holder.start() == ret){
-            #ifdef BOOST_CONTAINER_VECTOR_ALLOC_STATS
-            ++this->num_expand_fwd;
-            #endif
-            this->m_holder.capacity(real_cap);
-            //Expand forward
-            this->priv_insert_forward_range_expand_forward
-               (raw_pos, n, insert_range_proxy, dtl::bool_<dtl::is_single_value_proxy<InsertionProxy>::value>());
-         }
-         //Backwards (and possibly forward) expansion
-         else{
-            #ifdef BOOST_CONTAINER_VECTOR_ALLOC_STATS
-            ++this->num_expand_bwd;
-            #endif
-            this->priv_insert_forward_range_expand_backwards
-               (boost::movelib::to_raw_pointer(ret), real_cap, raw_pos, n, insert_range_proxy);
-         }
-      }
-      //New buffer
-      else{
-         #ifdef BOOST_CONTAINER_VECTOR_ALLOC_STATS
-         ++this->num_alloc;
-         #endif
-         this->priv_insert_forward_range_new_allocation
-            ( boost::movelib::to_raw_pointer(ret), real_cap, raw_pos, n, insert_range_proxy);
-      }
-
-      return iterator(this->m_holder.start() + (difference_type)(n_pos));
-   }
-
-   template <class InsertionProxy>
-   BOOST_CONTAINER_FORCEINLINE iterator priv_insert_forward_range
-      (const pointer &pos, const size_type n, const InsertionProxy insert_range_proxy)
-   {
-      BOOST_ASSERT(this->m_holder.capacity() >= this->m_holder.m_size);
-      T *const p = boost::movelib::to_raw_pointer(pos);
-      //Check if we have enough memory or try to expand current memory
-      if (BOOST_LIKELY(n <= (this->m_holder.capacity() - this->m_holder.m_size))){
-         //Expand forward
-         this->priv_insert_forward_range_expand_forward
-            (p, n, insert_range_proxy, dtl::bool_<dtl::is_single_value_proxy<InsertionProxy>::value>());
-         return iterator(pos);
-      }
-      else{
-         return this->priv_insert_forward_range_no_capacity(p, n, insert_range_proxy, alloc_version());
-      }
-   }
-
-   template <class U>
-   void priv_resize(const size_type new_size, const U &u, version_0)
-   {
-      const size_type sz = this->m_holder.m_size;
-      if (new_size > this->capacity()){
-         //This will trigger an error
-         alloc_holder_t::on_capacity_overflow();
-      }
-      else if (new_size < sz){
-         //Destroy last elements
-         this->priv_destroy_last_n(sz - new_size);
-      }
-      else{
-         T* const old_finish = this->priv_raw_end();
-         this->priv_resize_proxy(u).uninitialized_copy_n_and_update(this->m_holder.alloc(), old_finish, new_size - sz);
-         this->m_holder.set_stored_size(new_size);
-      }
-   }
-
-   template <class U, class AllocVersion>
-   void priv_resize(const size_type new_size, const U &u, AllocVersion)
-   {
-      const size_type sz = this->m_holder.m_size;
-      if (new_size < sz){
-         //Destroy last elements
-         this->priv_destroy_last_n(size_type(sz - new_size));
-      }
-      else {
-         this->priv_insert_forward_range(this->back_ptr(), size_type(new_size - sz), this->priv_resize_proxy(u));
-      }
-   }
-
-   //Takes the range pointed by [first_pos, last_pos) and shifts it to the right
-   //by 'shift_count'. 'limit_pos' marks the end of constructed elements.
-   //
-   //Precondition: first_pos <= last_pos <= limit_pos
-   //
-   //The shift operation might cross limit_pos so elements to moved beyond limit_pos
-   //are uninitialized_moved with an allocator. Other elements are moved.
-   //
-   //The shift operation might left uninitialized elements after limit_pos
-   //and the number of uninitialized elements is returned by the function.
-   //
-   //Old situation:
-   //       first_pos   last_pos         old_limit
-   //             |       |                  |
-   // ____________V_______V__________________V_____________
-   //|   prefix   | range |     suffix       |raw_mem      ~
-   //|____________|_______|__________________|_____________~
-   //
-   //New situation in Case A (hole_size == 0):
-   // range is moved through move assignments
-   //
-   //       first_pos   last_pos         limit_pos
-   //             |       |                  |
-   // ____________V_______V__________________V_____________
-   //|   prefix'  |       |  | range |suffix'|raw_mem      ~
-   //|________________+______|___^___|_______|_____________~
-   //                 |          |
-   //                 |_>_>_>_>_>^
-   //
-   //
-   //New situation in Case B (hole_size >= 0):
-   // range is moved through uninitialized moves
-   //
-   //       first_pos   last_pos         limit_pos
-   //             |       |                  |
-   // ____________V_______V__________________V________________
-   //|    prefix' |       |                  | [hole] | range |
-   //|_______________________________________|________|___^___|
-   //                 |                                   |
-   //                 |_>_>_>_>_>_>_>_>_>_>_>_>_>_>_>_>_>_^
-   //
-   //New situation in Case C (hole_size == 0):
-   // range is moved through move assignments and uninitialized moves
-   //
-   //       first_pos   last_pos         limit_pos
-   //             |       |                  |
-   // ____________V_______V__________________V___
-   //|   prefix'  |       |              | range |
-   //|___________________________________|___^___|
-   //                 |                      |
-   //                 |_>_>_>_>_>_>_>_>_>_>_>^
-   size_type priv_insert_ordered_at_shift_range
-      (size_type first_pos, size_type last_pos, size_type limit_pos, size_type shift_count)
-   {
-      BOOST_ASSERT(first_pos <= last_pos);
-      BOOST_ASSERT(last_pos <= limit_pos);
-      //
-      T* const begin_ptr = this->priv_raw_begin();
-      T* const first_ptr = begin_ptr + first_pos;
-      T* const last_ptr  = begin_ptr + last_pos;
-
-      size_type hole_size = 0;
-      //Case A:
-      if((last_pos + shift_count) <= limit_pos){
-         //All move assigned
-         boost::container::move_backward(first_ptr, last_ptr, last_ptr + shift_count);
-      }
-      //Case B:
-      else if((first_pos + shift_count) >= limit_pos){
-         //All uninitialized_moved
-         ::boost::container::uninitialized_move_alloc
-            (this->m_holder.alloc(), first_ptr, last_ptr, first_ptr + shift_count);
-         //Cast in case size_type is narrower than int, promotions are applied
-         //and Wconversion is in place
-         hole_size = static_cast<size_type>(first_pos + shift_count - limit_pos);
-      }
-      //Case C:
-      else{
-         //Some uninitialized_moved
-         T* const limit_ptr    = begin_ptr + limit_pos;
-         T* const boundary_ptr = limit_ptr - shift_count;
-         ::boost::container::uninitialized_move_alloc(this->m_holder.alloc(), boundary_ptr, last_ptr, limit_ptr);
-         //The rest is move assigned
-         boost::container::move_backward(first_ptr, boundary_ptr, limit_ptr);
-      }
-      return hole_size;
-   }
-
-   private:
-   BOOST_CONTAINER_FORCEINLINE T *priv_raw_begin() const
-   {  return boost::movelib::to_raw_pointer(m_holder.start());  }
-
-   BOOST_CONTAINER_FORCEINLINE T* priv_raw_end() const
-   {  return this->priv_raw_begin() + this->m_holder.m_size;  }
-
-   template <class InsertionProxy>  //inline single-element version as it is significantly smaller
-   BOOST_CONTAINER_FORCEINLINE void priv_insert_forward_range_expand_forward
-      (T* const raw_pos, const size_type, InsertionProxy insert_range_proxy, dtl::true_type)
-   {
-      BOOST_ASSERT(this->room_enough());
-      //There is enough memory
-      T* const old_finish = this->priv_raw_end();
-      allocator_type & a = this->m_holder.alloc();
-
-      if (old_finish == raw_pos){
-         insert_range_proxy.uninitialized_copy_n_and_update(a, old_finish, 1);
-         ++this->m_holder.m_size;
-      }
-      else{
-         //New elements can be just copied.
-         //Move to uninitialized memory last objects
-         T * const before_old_finish = old_finish-1;
-
-         allocator_traits_type::construct(a, old_finish, ::boost::move(*before_old_finish));
-         ++this->m_holder.m_size;
-         //Copy previous to last objects to the initialized end
-         boost::container::move_backward(raw_pos, before_old_finish, old_finish);
-         //Insert new objects in the raw_pos
-         insert_range_proxy.copy_n_and_update(a, raw_pos, 1);
-      }
-   }
-
-   template <class InsertionProxy>
-   BOOST_CONTAINER_FORCEINLINE void priv_insert_forward_range_expand_forward
-      (T* const raw_pos, const size_type n, InsertionProxy insert_range_proxy, dtl::false_type)
-   {
-      //There is enough memory
-      boost::container::expand_forward_and_insert_alloc
-         ( this->m_holder.alloc(), raw_pos, this->priv_raw_end(), n, insert_range_proxy);
-      this->m_holder.inc_stored_size(n);
-   }
-
-   template <class InsertionProxy>
-   void priv_insert_forward_range_new_allocation
-      (T* const new_start, size_type new_cap, T* const pos, const size_type n, InsertionProxy insert_range_proxy)
-   {
-      //n can be zero, if we want to reallocate!
-      allocator_type &a =  this->m_holder.alloc();
-      T * const raw_old_buffer = this->priv_raw_begin();
-
-      typename value_traits::ArrayDeallocator new_buffer_deallocator(new_start, a, new_cap);
-      boost::container::uninitialized_move_and_insert_alloc
-         (a, raw_old_buffer, pos, this->priv_raw_end(), new_start, n, insert_range_proxy);
-      new_buffer_deallocator.release();
-
-      //Destroy and deallocate old elements
-      if(raw_old_buffer){
-         BOOST_IF_CONSTEXPR(!has_trivial_destructor_after_move<value_type>::value)
-            boost::container::destroy_alloc_n(a, raw_old_buffer, this->m_holder.m_size);
-         this->m_holder.deallocate(this->m_holder.start(), this->m_holder.capacity());
-      }
-
-      this->m_holder.start(new_start);
-      this->m_holder.inc_stored_size(n);
-      this->m_holder.capacity(new_cap);
-   }
-
-   template <class InsertionProxy>
-   void priv_insert_forward_range_expand_backwards
-         (T* const new_start, const size_type new_capacity,
-          T* const pos, const size_type n, InsertionProxy insert_range_proxy)
-   {
-      T* const old_start = this->priv_raw_begin();
-      const size_type old_size = this->m_holder.m_size;
-      allocator_type& a = this->m_holder.alloc();
-
-      //Update the vector buffer information to a safe state
-      this->m_holder.start(new_start);
-      this->m_holder.capacity(new_capacity);
-      this->m_holder.m_size = 0;
-
-      expand_backward_forward_and_insert_alloc(old_start, old_size, new_start, pos, n, insert_range_proxy, a);
-
-      //Update the vector buffer information to a safe state
-      this->m_holder.m_size = stored_size_type(old_size + n);
-   }
-
-   void priv_throw_if_out_of_range(size_type n) const
-   {
-      //If n is out of range, throw an out_of_range exception
-      if (n >= this->size()){
-         throw_out_of_range("vector::at out of range");
-      }
-   }
-
-   BOOST_CONTAINER_FORCEINLINE bool priv_in_range(const_iterator pos) const
-   {
-      return (this->begin() <= pos) && (pos < this->end());
-   }
-
-   BOOST_CONTAINER_FORCEINLINE bool priv_in_range_or_end(const_iterator pos) const
-   {
-      return (this->begin() <= pos) && (pos <= this->end());
-   }
-
-   #ifdef BOOST_CONTAINER_VECTOR_ALLOC_STATS
-   public:
-   unsigned int num_expand_fwd;
-   unsigned int num_expand_bwd;
-   unsigned int num_shrink;
-   unsigned int num_alloc;
-   void reset_alloc_stats()
-   {  num_expand_fwd = num_expand_bwd = num_alloc = 0, num_shrink = 0;   }
-   #endif
-   #endif   //#ifndef BOOST_CONTAINER_DOXYGEN_INVOKED
-};
-
-#ifndef BOOST_CONTAINER_NO_CXX17_CTAD
-
-template <typename InputIterator>
-vector(InputIterator, InputIterator) ->
-   vector<typename iter_value<InputIterator>::type>;
-
-template <typename InputIterator, typename Allocator>
-vector(InputIterator, InputIterator, Allocator const&) ->
-   vector<typename iter_value<InputIterator>::type, Allocator>;
-
-#endif
-
-
-}} //namespace boost::container
-
-#ifndef BOOST_CONTAINER_DOXYGEN_INVOKED
-
-namespace boost {
-
-//!has_trivial_destructor_after_move<> == true_type
-//!specialization for optimizations
-template <class T, class Allocator, class Options>
-struct has_trivial_destructor_after_move<boost::container::vector<T, Allocator, Options> >
-{
-   typedef typename boost::container::vector<T, Allocator, Options>::allocator_type allocator_type;
-   typedef typename ::boost::container::allocator_traits<allocator_type>::pointer pointer;
-   static const bool value = ::boost::has_trivial_destructor_after_move<allocator_type>::value &&
-                             ::boost::has_trivial_destructor_after_move<pointer>::value;
-};
-
-}
-
-//See comments on vec_iterator::element_type to know why is this needed
-#ifdef BOOST_GNU_STDLIB
-
-BOOST_MOVE_STD_NS_BEG
-
-template <class Pointer, bool IsConst>
-struct pointer_traits< boost::container::vec_iterator<Pointer, IsConst> >
-   : public boost::intrusive::pointer_traits< boost::container::vec_iterator<Pointer, IsConst> >
-{};
-
-BOOST_MOVE_STD_NS_END
-
-#endif   //BOOST_GNU_STDLIB
-
-#endif   //#ifndef BOOST_CONTAINER_DOXYGEN_INVOKED
-
-#include <boost/container/detail/config_end.hpp>
-
-#endif //   #ifndef  BOOST_CONTAINER_CONTAINER_VECTOR_HPP
diff --git a/src/boost/core/use_default.hpp b/src/boost/core/use_default.hpp
deleted file mode 100644
index 9d9be79d..00000000
--- a/src/boost/core/use_default.hpp
+++ /dev/null
@@ -1,17 +0,0 @@
-/*
-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_USE_DEFAULT_HPP
-#define BOOST_CORE_USE_DEFAULT_HPP
-
-namespace boost {
-
-struct use_default { };
-
-} /* boost */
-
-#endif
diff --git a/src/boost/detail/allocator_utilities.hpp b/src/boost/detail/allocator_utilities.hpp
deleted file mode 100644
index 056ba37e..00000000
--- a/src/boost/detail/allocator_utilities.hpp
+++ /dev/null
@@ -1,193 +0,0 @@
-/* Copyright 2003-2013 Joaquin M Lopez Munoz.
- * Distributed under the Boost Software License, Version 1.0.
- * (See accompanying file LICENSE_1_0.txt or copy at
- * http://www.boost.org/LICENSE_1_0.txt)
- *
- * See Boost website at http://www.boost.org/
- */
-
-#ifndef BOOST_DETAIL_ALLOCATOR_UTILITIES_HPP
-#define BOOST_DETAIL_ALLOCATOR_UTILITIES_HPP
-
-#include <boost/config.hpp> /* keep it first to prevent nasty warns in MSVC */
-#include <boost/detail/workaround.hpp>
-#include <boost/detail/select_type.hpp>
-#include <boost/type_traits/is_same.hpp>
-#include <cstddef>
-#include <memory>
-#include <new>
-
-namespace boost{
-
-namespace detail{
-
-/* Allocator adaption layer. Some stdlibs provide allocators without rebind
- * and template ctors. These facilities are simulated with the external
- * template class rebind_to and the aid of partial_std_allocator_wrapper.
- */
-
-namespace allocator{
-
-/* partial_std_allocator_wrapper inherits the functionality of a std
- * allocator while providing a templatized ctor and other bits missing
- * in some stdlib implementation or another.
- */
-
-template<typename Type>
-class partial_std_allocator_wrapper:public std::allocator<Type>
-{
-public:
-  /* Oddly enough, STLport does not define std::allocator<void>::value_type
-   * when configured to work without partial template specialization.
-   * No harm in supplying the definition here unconditionally.
-   */
-
-  typedef Type value_type;
-
-  partial_std_allocator_wrapper(){}
-
-  template<typename Other>
-  partial_std_allocator_wrapper(const partial_std_allocator_wrapper<Other>&){}
-
-  partial_std_allocator_wrapper(const std::allocator<Type>& x):
-    std::allocator<Type>(x)
-  {
-  }
-
-#if defined(BOOST_DINKUMWARE_STDLIB)
-  /* Dinkumware guys didn't provide a means to call allocate() without
-   * supplying a hint, in disagreement with the standard.
-   */
-
-  Type* allocate(std::size_t n,const void* hint=0)
-  {
-    std::allocator<Type>& a=*this;
-    return a.allocate(n,hint);
-  }
-#endif
-
-};
-
-/* Detects whether a given allocator belongs to a defective stdlib not
- * having the required member templates.
- * Note that it does not suffice to check the Boost.Config stdlib
- * macros, as the user might have passed a custom, compliant allocator.
- * The checks also considers partial_std_allocator_wrapper to be
- * a standard defective allocator.
- */
-
-#if defined(BOOST_NO_STD_ALLOCATOR)&&\
-  (defined(BOOST_HAS_PARTIAL_STD_ALLOCATOR)||defined(BOOST_DINKUMWARE_STDLIB))
-
-template<typename Allocator>
-struct is_partial_std_allocator
-{
-  BOOST_STATIC_CONSTANT(bool,
-    value=
-      (is_same<
-        std::allocator<BOOST_DEDUCED_TYPENAME Allocator::value_type>,
-        Allocator
-      >::value)||
-      (is_same<
-        partial_std_allocator_wrapper<
-          BOOST_DEDUCED_TYPENAME Allocator::value_type>,
-        Allocator
-      >::value));
-};
-
-#else
-
-template<typename Allocator>
-struct is_partial_std_allocator
-{
-  BOOST_STATIC_CONSTANT(bool,value=false);
-};
-
-#endif
-
-/* rebind operations for defective std allocators */
-
-template<typename Allocator,typename Type>
-struct partial_std_allocator_rebind_to
-{
-  typedef partial_std_allocator_wrapper<Type> type;
-};
-
-/* rebind operation in all other cases */
-
-template<typename Allocator>
-struct rebinder
-{
-  template<typename Type>
-  struct result
-  {
-#ifdef BOOST_NO_CXX11_ALLOCATOR
-      typedef typename Allocator::BOOST_NESTED_TEMPLATE
-          rebind<Type>::other other;
-#else
-      typedef typename std::allocator_traits<Allocator>::BOOST_NESTED_TEMPLATE
-          rebind_alloc<Type> other;
-#endif
-  };
-};
-
-template<typename Allocator,typename Type>
-struct compliant_allocator_rebind_to
-{
-  typedef typename rebinder<Allocator>::
-      BOOST_NESTED_TEMPLATE result<Type>::other type;
-};
-
-/* rebind front-end */
-
-template<typename Allocator,typename Type>
-struct rebind_to:
-  boost::detail::if_true<
-    is_partial_std_allocator<Allocator>::value
-  >::template then<
-    partial_std_allocator_rebind_to<Allocator,Type>,
-    compliant_allocator_rebind_to<Allocator,Type>
-  >::type
-{
-};
-
-/* allocator-independent versions of construct and destroy */
-
-template<typename Type>
-void construct(void* p,const Type& t)
-{
-  new (p) Type(t);
-}
-
-#if BOOST_WORKAROUND(BOOST_MSVC,BOOST_TESTED_AT(1500))
-/* MSVC++ issues spurious warnings about unreferencend formal parameters
- * in destroy<Type> when Type is a class with trivial dtor.
- */
-
-#pragma warning(push)
-#pragma warning(disable:4100)
-#endif
-
-template<typename Type>
-void destroy(const Type* p)
-{
-
-#if BOOST_WORKAROUND(__SUNPRO_CC,BOOST_TESTED_AT(0x590))
-  const_cast<Type*>(p)->~Type();
-#else
-  p->~Type();
-#endif
-
-}
-
-#if BOOST_WORKAROUND(BOOST_MSVC,BOOST_TESTED_AT(1500))
-#pragma warning(pop)
-#endif
-
-} /* namespace boost::detail::allocator */
-
-} /* namespace boost::detail */
-
-} /* namespace boost */
-
-#endif
diff --git a/src/boost/detail/indirect_traits.hpp b/src/boost/detail/indirect_traits.hpp
deleted file mode 100644
index 94e9b34d..00000000
--- a/src/boost/detail/indirect_traits.hpp
+++ /dev/null
@@ -1,195 +0,0 @@
-// Copyright David Abrahams 2002.
-// Distributed under the Boost Software License, Version 1.0. (See
-// accompanying file LICENSE_1_0.txt or copy at
-// http://www.boost.org/LICENSE_1_0.txt)
-#ifndef INDIRECT_TRAITS_DWA2002131_HPP
-# define INDIRECT_TRAITS_DWA2002131_HPP
-# include <boost/type_traits/integral_constant.hpp>
-# include <boost/type_traits/is_function.hpp>
-# include <boost/type_traits/is_reference.hpp>
-# include <boost/type_traits/is_pointer.hpp>
-# include <boost/type_traits/is_class.hpp>
-# include <boost/type_traits/is_const.hpp>
-# include <boost/type_traits/is_volatile.hpp>
-# include <boost/type_traits/is_member_function_pointer.hpp>
-# include <boost/type_traits/is_member_pointer.hpp>
-# include <boost/type_traits/remove_cv.hpp>
-# include <boost/type_traits/remove_reference.hpp>
-# include <boost/type_traits/remove_pointer.hpp>
-
-# include <boost/detail/workaround.hpp>
-# include <boost/detail/select_type.hpp>
-
-
-namespace boost { namespace detail {
-
-namespace indirect_traits {
-
-template <class T>
-struct is_reference_to_const : boost::false_type
-{
-};
-
-template <class T>
-struct is_reference_to_const<T const&> : boost::true_type
-{
-};
-
-#   if defined(BOOST_MSVC) && _MSC_FULL_VER <= 13102140 // vc7.01 alpha workaround
-template<class T>
-struct is_reference_to_const<T const volatile&> : boost::true_type
-{
-};
-#   endif
-
-template <class T>
-struct is_reference_to_function : boost::false_type
-{
-};
-
-template <class T>
-struct is_reference_to_function<T&> : is_function<T>
-{
-};
-
-template <class T>
-struct is_pointer_to_function : boost::false_type
-{
-};
-
-// There's no such thing as a pointer-to-cv-function, so we don't need
-// specializations for those
-template <class T>
-struct is_pointer_to_function<T*> : is_function<T>
-{
-};
-
-template <class T>
-struct is_reference_to_member_function_pointer_impl : boost::false_type
-{
-};
-
-template <class T>
-struct is_reference_to_member_function_pointer_impl<T&>
-    : is_member_function_pointer<typename remove_cv<T>::type>
-{
-};
-
-
-template <class T>
-struct is_reference_to_member_function_pointer
-    : is_reference_to_member_function_pointer_impl<T>
-{
-};
-
-template <class T>
-struct is_reference_to_function_pointer_aux
-    : boost::integral_constant<bool,
-          is_reference<T>::value &&
-          is_pointer_to_function<
-              typename remove_cv<
-                  typename remove_reference<T>::type
-              >::type
-          >::value
-      >
-{
-    // There's no such thing as a pointer-to-cv-function, so we don't need specializations for those
-};
-
-template <class T>
-struct is_reference_to_function_pointer
-    : boost::detail::if_true<
-          is_reference_to_function<T>::value
-      >::template then<
-          boost::false_type
-        , is_reference_to_function_pointer_aux<T>
-      >::type
-{
-};
-
-template <class T>
-struct is_reference_to_non_const
-    : boost::integral_constant<bool,
-          is_reference<T>::value &&
-          !is_reference_to_const<T>::value
-      >
-{
-};
-
-template <class T>
-struct is_reference_to_volatile : boost::false_type
-{
-};
-
-template <class T>
-struct is_reference_to_volatile<T volatile&> : boost::true_type
-{
-};
-
-#   if defined(BOOST_MSVC) && _MSC_FULL_VER <= 13102140 // vc7.01 alpha workaround
-template <class T>
-struct is_reference_to_volatile<T const volatile&> : boost::true_type
-{
-};
-#   endif
-
-
-template <class T>
-struct is_reference_to_pointer : boost::false_type
-{
-};
-
-template <class T>
-struct is_reference_to_pointer<T*&> : boost::true_type
-{
-};
-
-template <class T>
-struct is_reference_to_pointer<T* const&> : boost::true_type
-{
-};
-
-template <class T>
-struct is_reference_to_pointer<T* volatile&> : boost::true_type
-{
-};
-
-template <class T>
-struct is_reference_to_pointer<T* const volatile&> : boost::true_type
-{
-};
-
-template <class T>
-struct is_reference_to_class
-    : boost::integral_constant<bool,
-          is_reference<T>::value &&
-          is_class<
-              typename remove_cv<
-                  typename remove_reference<T>::type
-              >::type
-          >::value
-      >
-{
-};
-
-template <class T>
-struct is_pointer_to_class
-    : boost::integral_constant<bool,
-          is_pointer<T>::value &&
-          is_class<
-              typename remove_cv<
-                  typename remove_pointer<T>::type
-              >::type
-          >::value
-      >
-{
-};
-
-
-}
-
-using namespace indirect_traits;
-
-}} // namespace boost::python::detail
-
-#endif // INDIRECT_TRAITS_DWA2002131_HPP
diff --git a/src/boost/detail/interlocked.hpp b/src/boost/detail/interlocked.hpp
deleted file mode 100644
index 8084857b..00000000
--- a/src/boost/detail/interlocked.hpp
+++ /dev/null
@@ -1,273 +0,0 @@
-#ifndef BOOST_DETAIL_INTERLOCKED_HPP_INCLUDED
-#define BOOST_DETAIL_INTERLOCKED_HPP_INCLUDED
-
-//
-//  boost/detail/interlocked.hpp
-//
-//  Copyright 2005 Peter Dimov
-//  Copyright 2018, 2019 Andrey Semashev
-//
-//  Distributed under the Boost Software License, Version 1.0. (See
-//  accompanying file LICENSE_1_0.txt or copy at
-//  http://www.boost.org/LICENSE_1_0.txt)
-//
-
-#include <boost/config.hpp>
-
-#ifdef BOOST_HAS_PRAGMA_ONCE
-#pragma once
-#endif
-
-// BOOST_INTERLOCKED_HAS_INTRIN_H
-
-// VC9 has intrin.h, but it collides with <utility>
-#if defined( BOOST_MSVC ) && BOOST_MSVC >= 1600
-
-# define BOOST_INTERLOCKED_HAS_INTRIN_H
-
-// Unlike __MINGW64__, __MINGW64_VERSION_MAJOR is defined by MinGW-w64 for both 32 and 64-bit targets.
-#elif defined( __MINGW64_VERSION_MAJOR )
-
-// MinGW-w64 provides intrin.h for both 32 and 64-bit targets.
-# define BOOST_INTERLOCKED_HAS_INTRIN_H
-
-#elif defined( __CYGWIN__ )
-
-// Cygwin and Cygwin64 provide intrin.h. On Cygwin64 we have to use intrin.h because it's an LP64 target,
-// where long is 64-bit and therefore _Interlocked* functions have different signatures.
-# define BOOST_INTERLOCKED_HAS_INTRIN_H
-
-// Intel C++ on Windows on VC10+ stdlib
-#elif defined( BOOST_INTEL_WIN ) && defined( _CPPLIB_VER ) && _CPPLIB_VER >= 520
-
-# define BOOST_INTERLOCKED_HAS_INTRIN_H
-
-// clang-cl on Windows on VC10+ stdlib
-#elif defined( __clang__ ) && defined( _MSC_VER ) && defined( _CPPLIB_VER ) && _CPPLIB_VER >= 520
-
-# define BOOST_INTERLOCKED_HAS_INTRIN_H
-
-#endif
-
-#if !defined(__LP64__)
-#define BOOST_INTERLOCKED_LONG32 long
-#else
-#define BOOST_INTERLOCKED_LONG32 int
-#endif
-
-#if defined( BOOST_USE_WINDOWS_H )
-
-# include <windows.h>
-
-# define BOOST_INTERLOCKED_INCREMENT(dest) \
-    InterlockedIncrement((BOOST_INTERLOCKED_LONG32*)(dest))
-# define BOOST_INTERLOCKED_DECREMENT(dest) \
-    InterlockedDecrement((BOOST_INTERLOCKED_LONG32*)(dest))
-# define BOOST_INTERLOCKED_COMPARE_EXCHANGE(dest, exchange, compare) \
-    InterlockedCompareExchange((BOOST_INTERLOCKED_LONG32*)(dest), (BOOST_INTERLOCKED_LONG32)(exchange), (BOOST_INTERLOCKED_LONG32)(compare))
-# define BOOST_INTERLOCKED_EXCHANGE(dest, exchange) \
-    InterlockedExchange((BOOST_INTERLOCKED_LONG32*)(dest), (BOOST_INTERLOCKED_LONG32)(exchange))
-# define BOOST_INTERLOCKED_EXCHANGE_ADD(dest, add) \
-    InterlockedExchangeAdd((BOOST_INTERLOCKED_LONG32*)(dest), (BOOST_INTERLOCKED_LONG32)(add))
-# define BOOST_INTERLOCKED_COMPARE_EXCHANGE_POINTER(dest, exchange, compare) \
-    InterlockedCompareExchangePointer((void**)(dest), (void*)(exchange), (void*)(compare))
-# define BOOST_INTERLOCKED_EXCHANGE_POINTER(dest, exchange) \
-    InterlockedExchangePointer((void**)(dest), (void*)(exchange))
-
-#elif defined( BOOST_USE_INTRIN_H ) || defined( BOOST_INTERLOCKED_HAS_INTRIN_H )
-
-#include <intrin.h>
-
-# define BOOST_INTERLOCKED_INCREMENT(dest) \
-    _InterlockedIncrement((BOOST_INTERLOCKED_LONG32*)(dest))
-# define BOOST_INTERLOCKED_DECREMENT(dest) \
-    _InterlockedDecrement((BOOST_INTERLOCKED_LONG32*)(dest))
-# define BOOST_INTERLOCKED_COMPARE_EXCHANGE(dest, exchange, compare) \
-    _InterlockedCompareExchange((BOOST_INTERLOCKED_LONG32*)(dest), (BOOST_INTERLOCKED_LONG32)(exchange), (BOOST_INTERLOCKED_LONG32)(compare))
-# define BOOST_INTERLOCKED_EXCHANGE(dest, exchange) \
-    _InterlockedExchange((BOOST_INTERLOCKED_LONG32*)(dest), (BOOST_INTERLOCKED_LONG32)(exchange))
-# define BOOST_INTERLOCKED_EXCHANGE_ADD(dest, add) \
-    _InterlockedExchangeAdd((BOOST_INTERLOCKED_LONG32*)(dest), (BOOST_INTERLOCKED_LONG32)(add))
-
-// Note: Though MSVC-12 defines _InterlockedCompareExchangePointer and _InterlockedExchangePointer in intrin.h, the latter
-//       is actually broken as it conflicts with winnt.h from Windows SDK 8.1.
-# if (defined(_MSC_VER) && _MSC_VER >= 1900) || \
-  (defined(_M_IA64) || defined(_M_AMD64) || defined(__x86_64__) || defined(__x86_64) || defined(_M_ARM64))
-
-#  define BOOST_INTERLOCKED_COMPARE_EXCHANGE_POINTER(dest, exchange, compare) \
-     _InterlockedCompareExchangePointer((void**)(dest), (void*)(exchange), (void*)(compare))
-#  define BOOST_INTERLOCKED_EXCHANGE_POINTER(dest, exchange) \
-     _InterlockedExchangePointer((void**)(dest), (void*)(exchange))
-
-# else
-
-#  define BOOST_INTERLOCKED_COMPARE_EXCHANGE_POINTER(dest, exchange, compare) \
-    ((void*)BOOST_INTERLOCKED_COMPARE_EXCHANGE((BOOST_INTERLOCKED_LONG32*)(dest), (BOOST_INTERLOCKED_LONG32)(exchange), (BOOST_INTERLOCKED_LONG32)(compare)))
-#  define BOOST_INTERLOCKED_EXCHANGE_POINTER(dest, exchange) \
-    ((void*)BOOST_INTERLOCKED_EXCHANGE((BOOST_INTERLOCKED_LONG32*)(dest), (BOOST_INTERLOCKED_LONG32)(exchange)))
-
-# endif
-
-#elif defined(_WIN32_WCE)
-
-#if _WIN32_WCE >= 0x600
-
-extern "C" BOOST_INTERLOCKED_LONG32 __cdecl _InterlockedIncrement( BOOST_INTERLOCKED_LONG32 volatile * );
-extern "C" BOOST_INTERLOCKED_LONG32 __cdecl _InterlockedDecrement( BOOST_INTERLOCKED_LONG32 volatile * );
-extern "C" BOOST_INTERLOCKED_LONG32 __cdecl _InterlockedCompareExchange( BOOST_INTERLOCKED_LONG32 volatile *, BOOST_INTERLOCKED_LONG32, BOOST_INTERLOCKED_LONG32 );
-extern "C" BOOST_INTERLOCKED_LONG32 __cdecl _InterlockedExchange( BOOST_INTERLOCKED_LONG32 volatile *, BOOST_INTERLOCKED_LONG32 );
-extern "C" BOOST_INTERLOCKED_LONG32 __cdecl _InterlockedExchangeAdd( BOOST_INTERLOCKED_LONG32 volatile *, BOOST_INTERLOCKED_LONG32 );
-
-# define BOOST_INTERLOCKED_INCREMENT(dest) \
-    _InterlockedIncrement((BOOST_INTERLOCKED_LONG32*)(dest))
-# define BOOST_INTERLOCKED_DECREMENT(dest) \
-    _InterlockedDecrement((BOOST_INTERLOCKED_LONG32*)(dest))
-# define BOOST_INTERLOCKED_COMPARE_EXCHANGE(dest, exchange, compare) \
-    _InterlockedCompareExchange((BOOST_INTERLOCKED_LONG32*)(dest), (BOOST_INTERLOCKED_LONG32)(exchange), (BOOST_INTERLOCKED_LONG32)(compare))
-# define BOOST_INTERLOCKED_EXCHANGE(dest, exchange) \
-    _InterlockedExchange((BOOST_INTERLOCKED_LONG32*)(dest), (BOOST_INTERLOCKED_LONG32)(exchange))
-# define BOOST_INTERLOCKED_EXCHANGE_ADD(dest, add) \
-    _InterlockedExchangeAdd((BOOST_INTERLOCKED_LONG32*)(dest), (BOOST_INTERLOCKED_LONG32)(add))
-
-#else // _WIN32_WCE >= 0x600
-
-// under Windows CE we still have old-style Interlocked* functions
-
-extern "C" BOOST_INTERLOCKED_LONG32 __cdecl InterlockedIncrement( BOOST_INTERLOCKED_LONG32 * );
-extern "C" BOOST_INTERLOCKED_LONG32 __cdecl InterlockedDecrement( BOOST_INTERLOCKED_LONG32 * );
-extern "C" BOOST_INTERLOCKED_LONG32 __cdecl InterlockedCompareExchange( BOOST_INTERLOCKED_LONG32 *, BOOST_INTERLOCKED_LONG32, BOOST_INTERLOCKED_LONG32 );
-extern "C" BOOST_INTERLOCKED_LONG32 __cdecl InterlockedExchange( BOOST_INTERLOCKED_LONG32 *, BOOST_INTERLOCKED_LONG32 );
-extern "C" BOOST_INTERLOCKED_LONG32 __cdecl InterlockedExchangeAdd( BOOST_INTERLOCKED_LONG32 *, BOOST_INTERLOCKED_LONG32 );
-
-# define BOOST_INTERLOCKED_INCREMENT(dest) \
-    InterlockedIncrement((BOOST_INTERLOCKED_LONG32*)(dest))
-# define BOOST_INTERLOCKED_DECREMENT(dest) \
-    InterlockedDecrement((BOOST_INTERLOCKED_LONG32*)(dest))
-# define BOOST_INTERLOCKED_COMPARE_EXCHANGE(dest, exchange, compare) \
-    InterlockedCompareExchange((BOOST_INTERLOCKED_LONG32*)(dest), (BOOST_INTERLOCKED_LONG32)(exchange), (BOOST_INTERLOCKED_LONG32)(compare))
-# define BOOST_INTERLOCKED_EXCHANGE(dest, exchange) \
-    InterlockedExchange((BOOST_INTERLOCKED_LONG32*)(dest), (BOOST_INTERLOCKED_LONG32)(exchange))
-# define BOOST_INTERLOCKED_EXCHANGE_ADD(dest, add) \
-    InterlockedExchangeAdd((BOOST_INTERLOCKED_LONG32*)(dest), (BOOST_INTERLOCKED_LONG32)(add))
-
-#endif // _WIN32_WCE >= 0x600
-
-# define BOOST_INTERLOCKED_COMPARE_EXCHANGE_POINTER(dest, exchange, compare) \
-    ((void*)BOOST_INTERLOCKED_COMPARE_EXCHANGE((BOOST_INTERLOCKED_LONG32*)(dest), (BOOST_INTERLOCKED_LONG32)(exchange), (BOOST_INTERLOCKED_LONG32)(compare)))
-# define BOOST_INTERLOCKED_EXCHANGE_POINTER(dest, exchange) \
-    ((void*)BOOST_INTERLOCKED_EXCHANGE((BOOST_INTERLOCKED_LONG32*)(dest), (BOOST_INTERLOCKED_LONG32)(exchange)))
-
-#elif defined( BOOST_MSVC ) || defined( BOOST_INTEL_WIN )
-
-# if defined( __CLRCALL_PURE_OR_CDECL )
-#  define BOOST_INTERLOCKED_CLRCALL_PURE_OR_CDECL __CLRCALL_PURE_OR_CDECL
-# else
-#  define BOOST_INTERLOCKED_CLRCALL_PURE_OR_CDECL __cdecl
-# endif
-
-extern "C" BOOST_INTERLOCKED_LONG32 BOOST_INTERLOCKED_CLRCALL_PURE_OR_CDECL _InterlockedIncrement( BOOST_INTERLOCKED_LONG32 volatile * );
-extern "C" BOOST_INTERLOCKED_LONG32 BOOST_INTERLOCKED_CLRCALL_PURE_OR_CDECL _InterlockedDecrement( BOOST_INTERLOCKED_LONG32 volatile * );
-extern "C" BOOST_INTERLOCKED_LONG32 BOOST_INTERLOCKED_CLRCALL_PURE_OR_CDECL _InterlockedCompareExchange( BOOST_INTERLOCKED_LONG32 volatile *, BOOST_INTERLOCKED_LONG32, BOOST_INTERLOCKED_LONG32 );
-extern "C" BOOST_INTERLOCKED_LONG32 BOOST_INTERLOCKED_CLRCALL_PURE_OR_CDECL _InterlockedExchange( BOOST_INTERLOCKED_LONG32 volatile *, BOOST_INTERLOCKED_LONG32 );
-extern "C" BOOST_INTERLOCKED_LONG32 BOOST_INTERLOCKED_CLRCALL_PURE_OR_CDECL _InterlockedExchangeAdd( BOOST_INTERLOCKED_LONG32 volatile *, BOOST_INTERLOCKED_LONG32 );
-
-# if defined( BOOST_MSVC ) && BOOST_MSVC >= 1310
-#  pragma intrinsic( _InterlockedIncrement )
-#  pragma intrinsic( _InterlockedDecrement )
-#  pragma intrinsic( _InterlockedCompareExchange )
-#  pragma intrinsic( _InterlockedExchange )
-#  pragma intrinsic( _InterlockedExchangeAdd )
-# endif
-
-# if defined(_M_IA64) || defined(_M_AMD64) || defined(_M_ARM64)
-
-extern "C" void* BOOST_INTERLOCKED_CLRCALL_PURE_OR_CDECL _InterlockedCompareExchangePointer( void* volatile *, void*, void* );
-extern "C" void* BOOST_INTERLOCKED_CLRCALL_PURE_OR_CDECL _InterlockedExchangePointer( void* volatile *, void* );
-
-#  if defined( BOOST_MSVC ) && BOOST_MSVC >= 1310
-#   pragma intrinsic( _InterlockedCompareExchangePointer )
-#   pragma intrinsic( _InterlockedExchangePointer )
-#  endif
-
-#  define BOOST_INTERLOCKED_COMPARE_EXCHANGE_POINTER(dest, exchange, compare) \
-     _InterlockedCompareExchangePointer((void**)(dest), (void*)(exchange), (void*)(compare))
-#  define BOOST_INTERLOCKED_EXCHANGE_POINTER(dest, exchange) \
-     _InterlockedExchangePointer((void**)(dest), (void*)(exchange))
-
-# else
-
-#  define BOOST_INTERLOCKED_COMPARE_EXCHANGE_POINTER(dest, exchange, compare) \
-    ((void*)BOOST_INTERLOCKED_COMPARE_EXCHANGE((BOOST_INTERLOCKED_LONG32*)(dest), (BOOST_INTERLOCKED_LONG32)(exchange), (BOOST_INTERLOCKED_LONG32)(compare)))
-#  define BOOST_INTERLOCKED_EXCHANGE_POINTER(dest, exchange) \
-    ((void*)BOOST_INTERLOCKED_EXCHANGE((BOOST_INTERLOCKED_LONG32*)(dest), (BOOST_INTERLOCKED_LONG32)(exchange)))
-
-# endif
-
-# undef BOOST_INTERLOCKED_CLRCALL_PURE_OR_CDECL
-
-# define BOOST_INTERLOCKED_INCREMENT(dest) \
-    _InterlockedIncrement((BOOST_INTERLOCKED_LONG32*)(dest))
-# define BOOST_INTERLOCKED_DECREMENT(dest) \
-    _InterlockedDecrement((BOOST_INTERLOCKED_LONG32*)(dest))
-# define BOOST_INTERLOCKED_COMPARE_EXCHANGE(dest, exchange, compare) \
-    _InterlockedCompareExchange((BOOST_INTERLOCKED_LONG32*)(dest), (BOOST_INTERLOCKED_LONG32)(exchange), (BOOST_INTERLOCKED_LONG32)(compare))
-# define BOOST_INTERLOCKED_EXCHANGE(dest, exchange) \
-    _InterlockedExchange((BOOST_INTERLOCKED_LONG32*)(dest), (BOOST_INTERLOCKED_LONG32)(exchange))
-# define BOOST_INTERLOCKED_EXCHANGE_ADD(dest, add) \
-    _InterlockedExchangeAdd((BOOST_INTERLOCKED_LONG32*)(dest), (BOOST_INTERLOCKED_LONG32)(add))
-
-#elif defined( WIN32 ) || defined( _WIN32 ) || defined( __WIN32__ )
-
-#define BOOST_INTERLOCKED_IMPORT __declspec(dllimport)
-
-namespace boost
-{
-
-namespace detail
-{
-
-extern "C" BOOST_INTERLOCKED_IMPORT BOOST_INTERLOCKED_LONG32 __stdcall InterlockedIncrement( BOOST_INTERLOCKED_LONG32 volatile * );
-extern "C" BOOST_INTERLOCKED_IMPORT BOOST_INTERLOCKED_LONG32 __stdcall InterlockedDecrement( BOOST_INTERLOCKED_LONG32 volatile * );
-extern "C" BOOST_INTERLOCKED_IMPORT BOOST_INTERLOCKED_LONG32 __stdcall InterlockedCompareExchange( BOOST_INTERLOCKED_LONG32 volatile *, BOOST_INTERLOCKED_LONG32, BOOST_INTERLOCKED_LONG32 );
-extern "C" BOOST_INTERLOCKED_IMPORT BOOST_INTERLOCKED_LONG32 __stdcall InterlockedExchange( BOOST_INTERLOCKED_LONG32 volatile *, BOOST_INTERLOCKED_LONG32 );
-extern "C" BOOST_INTERLOCKED_IMPORT BOOST_INTERLOCKED_LONG32 __stdcall InterlockedExchangeAdd( BOOST_INTERLOCKED_LONG32 volatile *, BOOST_INTERLOCKED_LONG32 );
-
-# if defined(_M_IA64) || defined(_M_AMD64) || defined(_M_ARM64)
-extern "C" BOOST_INTERLOCKED_IMPORT void* __stdcall InterlockedCompareExchangePointer( void* volatile *, void*, void* );
-extern "C" BOOST_INTERLOCKED_IMPORT void* __stdcall InterlockedExchangePointer( void* volatile *, void* );
-# endif
-
-} // namespace detail
-
-} // namespace boost
-
-# define BOOST_INTERLOCKED_INCREMENT(dest) \
-    ::boost::detail::InterlockedIncrement((BOOST_INTERLOCKED_LONG32*)(dest))
-# define BOOST_INTERLOCKED_DECREMENT(dest) \
-    ::boost::detail::InterlockedDecrement((BOOST_INTERLOCKED_LONG32*)(dest))
-# define BOOST_INTERLOCKED_COMPARE_EXCHANGE(dest, exchange, compare) \
-    ::boost::detail::InterlockedCompareExchange((BOOST_INTERLOCKED_LONG32*)(dest), (BOOST_INTERLOCKED_LONG32)(exchange), (BOOST_INTERLOCKED_LONG32)(compare))
-# define BOOST_INTERLOCKED_EXCHANGE(dest, exchange) \
-    ::boost::detail::InterlockedExchange((BOOST_INTERLOCKED_LONG32*)(dest), (BOOST_INTERLOCKED_LONG32)(exchange))
-# define BOOST_INTERLOCKED_EXCHANGE_ADD(dest, add) \
-    ::boost::detail::InterlockedExchangeAdd((BOOST_INTERLOCKED_LONG32*)(dest), (BOOST_INTERLOCKED_LONG32)(add))
-
-# if defined(_M_IA64) || defined(_M_AMD64) || defined(_M_ARM64)
-#  define BOOST_INTERLOCKED_COMPARE_EXCHANGE_POINTER(dest, exchange, compare) \
-     ::boost::detail::InterlockedCompareExchangePointer((void**)(dest), (void*)(exchange), (void*)(compare))
-#  define BOOST_INTERLOCKED_EXCHANGE_POINTER(dest, exchange) \
-     ::boost::detail::InterlockedExchangePointer((void**)(dest), (void*)(exchange))
-# else
-#  define BOOST_INTERLOCKED_COMPARE_EXCHANGE_POINTER(dest, exchange, compare) \
-    ((void*)BOOST_INTERLOCKED_COMPARE_EXCHANGE((BOOST_INTERLOCKED_LONG32 volatile*)(dest),(BOOST_INTERLOCKED_LONG32)(exchange),(BOOST_INTERLOCKED_LONG32)(compare)))
-#  define BOOST_INTERLOCKED_EXCHANGE_POINTER(dest, exchange) \
-    ((void*)BOOST_INTERLOCKED_EXCHANGE((BOOST_INTERLOCKED_LONG32*)(dest),(BOOST_INTERLOCKED_LONG32)(exchange)))
-# endif
-
-#else
-
-# error "Interlocked intrinsics not available"
-
-#endif
-
-#endif // #ifndef BOOST_DETAIL_INTERLOCKED_HPP_INCLUDED
diff --git a/src/boost/detail/select_type.hpp b/src/boost/detail/select_type.hpp
deleted file mode 100644
index c13946f3..00000000
--- a/src/boost/detail/select_type.hpp
+++ /dev/null
@@ -1,36 +0,0 @@
-// (C) Copyright David Abrahams 2001.
-// Distributed under the Boost 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 for most recent version including documentation.
-
-// Revision History
-// 09 Feb 01  Applied John Maddock's Borland patch Moving <true>
-//            specialization to unspecialized template (David Abrahams)
-// 06 Feb 01  Created (David Abrahams)
-
-#ifndef SELECT_TYPE_DWA20010206_HPP
-# define SELECT_TYPE_DWA20010206_HPP
-
-namespace boost { namespace detail {
-
-  // Template class if_true -- select among 2 types based on a bool constant expression
-  // Usage:
-  //   typename if_true<(bool_const_expression)>::template then<true_type, false_type>::type
-
-  // HP aCC cannot deal with missing names for template value parameters
-  template <bool b> struct if_true
-  {
-      template <class T, class F>
-      struct then { typedef T type; };
-  };
-
-  template <>
-  struct if_true<false>
-  {
-      template <class T, class F>
-      struct then { typedef F type; };
-  };
-}}
-#endif // SELECT_TYPE_DWA20010206_HPP
diff --git a/src/boost/flyweight/no_locking_fwd.hpp b/src/boost/flyweight.hpp
similarity index 54%
rename from src/boost/flyweight/no_locking_fwd.hpp
rename to src/boost/flyweight.hpp
index 132f50dc..852ea8ec 100644
--- a/src/boost/flyweight/no_locking_fwd.hpp
+++ b/src/boost/flyweight.hpp
@@ -6,21 +6,17 @@
  * See http://www.boost.org/libs/flyweight for library home page.
  */
 
-#ifndef BOOST_FLYWEIGHT_NO_LOCKING_FWD_HPP
-#define BOOST_FLYWEIGHT_NO_LOCKING_FWD_HPP
+#ifndef BOOST_FLYWEIGHT_HPP
+#define BOOST_FLYWEIGHT_HPP
 
 #if defined(_MSC_VER)
 #pragma once
 #endif
 
-namespace boost{
-
-namespace flyweights{
-
-struct no_locking;
-
-} /* namespace flyweights */
-
-} /* namespace boost */
+#include <boost/flyweight/flyweight.hpp>
+#include <boost/flyweight/hashed_factory.hpp>
+#include <boost/flyweight/refcounted.hpp>
+#include <boost/flyweight/simple_locking.hpp>
+#include <boost/flyweight/static_holder.hpp>
 
 #endif
diff --git a/src/boost/flyweight/assoc_container_factory.hpp b/src/boost/flyweight/assoc_container_factory.hpp
deleted file mode 100644
index 9b35b16a..00000000
--- a/src/boost/flyweight/assoc_container_factory.hpp
+++ /dev/null
@@ -1,116 +0,0 @@
-/* Copyright 2006-2015 Joaquin M Lopez Munoz.
- * Distributed under the Boost 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/flyweight for library home page.
- */
-
-#ifndef BOOST_FLYWEIGHT_ASSOC_CONTAINER_FACTORY_HPP
-#define BOOST_FLYWEIGHT_ASSOC_CONTAINER_FACTORY_HPP
-
-#if defined(_MSC_VER)
-#pragma once
-#endif
-
-#include <boost/config.hpp> /* keep it first to prevent nasty warns in MSVC */
-#include <boost/flyweight/assoc_container_factory_fwd.hpp>
-#include <boost/flyweight/detail/is_placeholder_expr.hpp>
-#include <boost/flyweight/detail/nested_xxx_if_not_ph.hpp>
-#include <boost/flyweight/factory_tag.hpp>
-#include <boost/mpl/apply.hpp>
-#include <boost/mpl/aux_/lambda_support.hpp>
-#include <boost/mpl/if.hpp>
-
-#if !defined(BOOST_NO_CXX11_RVALUE_REFERENCES)
-#include <utility>
-#endif
-
-namespace boost{namespace flyweights{namespace detail{
-BOOST_FLYWEIGHT_NESTED_XXX_IF_NOT_PLACEHOLDER_EXPRESSION_DEF(iterator)
-BOOST_FLYWEIGHT_NESTED_XXX_IF_NOT_PLACEHOLDER_EXPRESSION_DEF(value_type)
-}}} /* namespace boost::flyweights::detail */
-
-/* Factory class using a given associative container.
- */
-
-namespace boost{
-
-namespace flyweights{
-
-template<typename Container>
-class assoc_container_factory_class:public factory_marker
-{
-public:
-  /* When assoc_container_factory_class<Container> is an MPL placeholder
-   * expression, referring to Container::iterator and Container::value_type
-   * force the MPL placeholder expression Container to be instantiated, which
-   * is wasteful and can fail in concept-checked STL implementations.
-   * We protect ourselves against this circumstance.
-   */
-
-  typedef typename detail::nested_iterator_if_not_placeholder_expression<
-    Container
-  >::type                                handle_type;
-  typedef typename detail::nested_value_type_if_not_placeholder_expression<
-    Container
-  >::type                                entry_type;
-  
-  handle_type insert(const entry_type& x)
-  {
-    return cont.insert(x).first;
-  }
-
-#if !defined(BOOST_NO_CXX11_RVALUE_REFERENCES)
-  handle_type insert(entry_type&& x)
-  {
-    return cont.insert(std::move(x)).first;
-  }
-#endif
-
-  void erase(handle_type h)
-  {
-    cont.erase(h);
-  }
-
-  static const entry_type& entry(handle_type h){return *h;}
-
-private:
-  /* As above, avoid instantiating Container if it is an
-   * MPL placeholder expression.
-   */
-
-  typedef typename mpl::if_<
-    detail::is_placeholder_expression<Container>,
-    int,
-    Container
-  >::type container_type;
-  container_type cont;
-
-public:
-  typedef assoc_container_factory_class type;
-  BOOST_MPL_AUX_LAMBDA_SUPPORT(1,assoc_container_factory_class,(Container))
-};
-
-/* assoc_container_factory_class specifier */
-
-template<
-  typename ContainerSpecifier
-  BOOST_FLYWEIGHT_NOT_A_PLACEHOLDER_EXPRESSION_DEF
->
-struct assoc_container_factory:factory_marker
-{
-  template<typename Entry,typename Key>
-  struct apply
-  {
-    typedef assoc_container_factory_class<
-      typename mpl::apply2<ContainerSpecifier,Entry,Key>::type
-    > type;
-  };
-};
-
-}  /* namespace flyweights */
-
-} /* namespace boost */
-
-#endif
diff --git a/src/boost/flyweight/assoc_container_factory_fwd.hpp b/src/boost/flyweight/assoc_container_factory_fwd.hpp
deleted file mode 100644
index 278c04d7..00000000
--- a/src/boost/flyweight/assoc_container_factory_fwd.hpp
+++ /dev/null
@@ -1,35 +0,0 @@
-/* Copyright 2006-2008 Joaquin M Lopez Munoz.
- * Distributed under the Boost 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/flyweight for library home page.
- */
-
-#ifndef BOOST_FLYWEIGHT_ASSOC_CONTAINER_FACTORY_FWD_HPP
-#define BOOST_FLYWEIGHT_ASSOC_CONTAINER_FACTORY_FWD_HPP
-
-#if defined(_MSC_VER)
-#pragma once
-#endif
-
-#include <boost/flyweight/detail/not_placeholder_expr.hpp>
-
-namespace boost{
-
-namespace flyweights{
-
-template<typename Container>
-class assoc_container_factory_class;
-
-template<
-  typename ContainerSpecifier
-  BOOST_FLYWEIGHT_NOT_A_PLACEHOLDER_EXPRESSION
->
-struct assoc_container_factory;
-
-}  /* namespace flyweights */
-
-} /* namespace boost */
-
-#endif
diff --git a/src/boost/flyweight/detail/archive_constructed.hpp b/src/boost/flyweight/detail/archive_constructed.hpp
deleted file mode 100644
index 0697d8e1..00000000
--- a/src/boost/flyweight/detail/archive_constructed.hpp
+++ /dev/null
@@ -1,79 +0,0 @@
-/* Copyright 2006-2020 Joaquin M Lopez Munoz.
- * Distributed under the Boost 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/flyweight for library home page.
- */
-
-#ifndef BOOST_FLYWEIGHT_DETAIL_ARCHIVE_CONSTRUCTED_HPP
-#define BOOST_FLYWEIGHT_DETAIL_ARCHIVE_CONSTRUCTED_HPP
-
-#if defined(_MSC_VER)&&(_MSC_VER>=1200)
-#pragma once
-#endif
-
-#include <boost/config.hpp> /* keep it first to prevent nasty warns in MSVC */
-#include <boost/core/no_exceptions_support.hpp>
-#include <boost/noncopyable.hpp>
-#include <boost/core/serialization.hpp>
-#include <boost/type_traits/aligned_storage.hpp>
-#include <boost/type_traits/alignment_of.hpp> 
-
-namespace boost{
-
-namespace flyweights{
-
-namespace detail{
-
-/* constructs a stack-based object from a serialization archive */
-
-template<typename T>
-struct archive_constructed:private noncopyable
-{
-  template<class Archive>
-  archive_constructed(Archive& ar,const unsigned int version)
-  {
-    core::load_construct_data_adl(ar,&get(),version);
-    BOOST_TRY{
-      ar>>get();
-    }
-    BOOST_CATCH(...){
-      (&get())->~T();
-      BOOST_RETHROW;
-    }
-    BOOST_CATCH_END
-  }
-
-  template<class Archive>
-  archive_constructed(const char* name,Archive& ar,const unsigned int version)
-  {
-    core::load_construct_data_adl(ar,&get(),version);
-    BOOST_TRY{
-      ar>>serialization::make_nvp(name,get());
-    }
-    BOOST_CATCH(...){
-      (&get())->~T();
-      BOOST_RETHROW;
-    }
-    BOOST_CATCH_END
-  }
-
-  ~archive_constructed()
-  {
-    (&get())->~T();
-  }
-
-  T& get(){return *static_cast<T*>(static_cast<void*>(&space));}
-
-private:
-  typename aligned_storage<sizeof(T),alignment_of<T>::value>::type space;
-};
-
-} /* namespace flyweights::detail */
-
-} /* namespace flyweights */
-
-} /* namespace boost */
-
-#endif
diff --git a/src/boost/flyweight/detail/is_placeholder_expr.hpp b/src/boost/flyweight/detail/is_placeholder_expr.hpp
deleted file mode 100644
index a89aad65..00000000
--- a/src/boost/flyweight/detail/is_placeholder_expr.hpp
+++ /dev/null
@@ -1,65 +0,0 @@
-/* Copyright 2006-2009 Joaquin M Lopez Munoz.
- * Distributed under the Boost 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/flyweight for library home page.
- */
-
-#ifndef BOOST_FLYWEIGHT_DETAIL_IS_PLACEHOLDER_EXPR_HPP
-#define BOOST_FLYWEIGHT_DETAIL_IS_PLACEHOLDER_EXPR_HPP
-
-#if defined(_MSC_VER)
-#pragma once
-#endif
-
-#include <boost/type_traits/is_same.hpp>
-#include <boost/mpl/apply.hpp>
-#include <boost/mpl/aux_/lambda_support.hpp>
-#include <boost/mpl/not.hpp>
-#include <boost/preprocessor/facilities/intercept.hpp>
-#include <boost/preprocessor/repetition/enum_params.hpp>
-
-namespace boost{
-
-namespace flyweights{
-
-namespace detail{
-
-/* is_placeholder_expression<T> indicates whether T is an
- * MPL placeholder expression.
- */
-
-template<typename T>
-struct is_placeholder_expression_helper
-{
-  template<
-    BOOST_PP_ENUM_PARAMS(
-      BOOST_MPL_LIMIT_METAFUNCTION_ARITY,typename BOOST_PP_INTERCEPT)
-  >
-  struct apply{
-    typedef int type;
-  };
-
-  BOOST_MPL_AUX_LAMBDA_SUPPORT(1,is_placeholder_expression_helper,(T))
-};
-
-template<typename T>
-struct is_placeholder_expression:
-  mpl::not_<is_same<
-    typename mpl::apply<
-      is_placeholder_expression_helper<T>,
-      BOOST_PP_ENUM_PARAMS(
-        BOOST_MPL_LIMIT_METAFUNCTION_ARITY,int BOOST_PP_INTERCEPT)
-    >::type,
-    int
-  > >
-{};
-
-} /* namespace flyweights::detail */
-
-} /* namespace flyweights */
-
-} /* namespace boost */
-
-#endif
diff --git a/src/boost/flyweight/detail/nested_xxx_if_not_ph.hpp b/src/boost/flyweight/detail/nested_xxx_if_not_ph.hpp
deleted file mode 100644
index 32412b41..00000000
--- a/src/boost/flyweight/detail/nested_xxx_if_not_ph.hpp
+++ /dev/null
@@ -1,39 +0,0 @@
-/* Copyright 2006-2009 Joaquin M Lopez Munoz.
- * Distributed under the Boost 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/flyweight for library home page.
- */
-
-#ifndef BOOST_FLYWEIGHT_DETAIL_NESTED_XXX_IF_NOT_PH_HPP
-#define BOOST_FLYWEIGHT_DETAIL_NESTED_XXX_IF_NOT_PH_HPP
-
-#if defined(_MSC_VER)
-#pragma once
-#endif
-
-#include <boost/flyweight/detail/is_placeholder_expr.hpp>
-#include <boost/mpl/if.hpp>
-
-/* nested_##name##_if_not_placeholder_expression<T>::type is T::name unless
- * T is an MPL placeholder expression, in which case it defaults to int.
- */
-
-#define BOOST_FLYWEIGHT_NESTED_XXX_IF_NOT_PLACEHOLDER_EXPRESSION_DEF(name) \
-struct nested_##name##_if_not_placeholder_expression_helper                \
-{                                                                          \
-  typedef int name;                                                        \
-};                                                                         \
-                                                                           \
-template<typename T>                                                       \
-struct nested_##name##_if_not_placeholder_expression                       \
-{                                                                          \
-  typedef typename boost::mpl::if_<                                        \
-    boost::flyweights::detail::is_placeholder_expression<T>,               \
-    nested_##name##_if_not_placeholder_expression_helper,                  \
-    T                                                                      \
-  >::type::name type;                                                      \
-};
-
-#endif
diff --git a/src/boost/flyweight/detail/serialization_helper.hpp b/src/boost/flyweight/detail/serialization_helper.hpp
deleted file mode 100644
index 8a150443..00000000
--- a/src/boost/flyweight/detail/serialization_helper.hpp
+++ /dev/null
@@ -1,98 +0,0 @@
-/* Copyright 2006-2014 Joaquin M Lopez Munoz.
- * Distributed under the Boost 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/flyweight for library home page.
- */
-
-#ifndef BOOST_FLYWEIGHT_DETAIL_SERIALIZATION_HELPER_HPP
-#define BOOST_FLYWEIGHT_DETAIL_SERIALIZATION_HELPER_HPP
-
-#if defined(_MSC_VER)&&(_MSC_VER>=1200)
-#pragma once
-#endif
-
-#include <boost/config.hpp> /* keep it first to prevent nasty warns in MSVC */
-#include <boost/multi_index_container.hpp>
-#include <boost/multi_index/hashed_index.hpp>
-#include <boost/multi_index/random_access_index.hpp>
-#include <boost/noncopyable.hpp>
-#include <vector>
-
-namespace boost{
-
-namespace flyweights{
-
-namespace detail{
-
-/* The serialization helpers for flyweight<T> map numerical IDs to
- * flyweight exemplars --an exemplar is the flyweight object
- * associated to a given value that appears first on the serialization
- * stream, so that subsequent equivalent flyweight objects will be made
- * to refer to it during the serialization process.
- */
-
-template<typename Flyweight>
-struct flyweight_value_address
-{
-  typedef const typename Flyweight::value_type* result_type;
-
-  result_type operator()(const Flyweight& x)const{return &x.get();}
-};
-
-template<typename Flyweight>
-class save_helper:private noncopyable
-{
-  typedef multi_index::multi_index_container<
-    Flyweight,
-    multi_index::indexed_by<
-      multi_index::random_access<>,
-      multi_index::hashed_unique<flyweight_value_address<Flyweight> >
-    >
-  > table;
-
-public:
-
-  typedef typename table::size_type size_type;
-
-  size_type size()const{return t.size();}
-
-  size_type find(const Flyweight& x)const
-  {
-    return multi_index::project<0>(t,multi_index::get<1>(t).find(&x.get()))
-             -t.begin();
-  }
-
-  void push_back(const Flyweight& x){t.push_back(x);}
-  
-private:
-  table t;
-};
-
-template<typename Flyweight>
-class load_helper:private noncopyable
-{
-  typedef std::vector<Flyweight> table;
-
-public:
-
-  typedef typename table::size_type size_type;
-
-  size_type size()const{return t.size();}
-
-  Flyweight operator[](size_type n)const{return t[n];}
-
-  void push_back(const Flyweight& x){t.push_back(x);}
-  
-private:
-  table t;
-};
-
-} /* namespace flyweights::detail */
-
-} /* namespace flyweights */
-
-} /* namespace boost */
-
-#endif
diff --git a/src/boost/flyweight/intermodule_holder.hpp b/src/boost/flyweight/intermodule_holder.hpp
deleted file mode 100644
index a96bc541..00000000
--- a/src/boost/flyweight/intermodule_holder.hpp
+++ /dev/null
@@ -1,54 +0,0 @@
-/* Copyright 2006-2011 Joaquin M Lopez Munoz.
- * Distributed under the Boost 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/flyweight for library home page.
- */
-
-#ifndef BOOST_FLYWEIGHT_INTERMODULE_HOLDER_HPP
-#define BOOST_FLYWEIGHT_INTERMODULE_HOLDER_HPP
-
-#if defined(_MSC_VER)
-#pragma once
-#endif
-
-#include <boost/config.hpp> /* keep it first to prevent nasty warns in MSVC */
-#include <boost/flyweight/holder_tag.hpp>
-#include <boost/flyweight/intermodule_holder_fwd.hpp>
-#include <boost/interprocess/detail/intermodule_singleton.hpp>
-#include <boost/mpl/aux_/lambda_support.hpp>
-
-/* intermodule_holder_class guarantees a unique instance across all dynamic
- * modules of a program.
- */
-
-namespace boost{
-
-namespace flyweights{
-
-template<typename C>
-struct intermodule_holder_class:
-  interprocess::ipcdetail::intermodule_singleton<C,true>,
-  holder_marker
-{
-  typedef intermodule_holder_class type;
-  BOOST_MPL_AUX_LAMBDA_SUPPORT(1,intermodule_holder_class,(C))
-};
-
-/* intermodule_holder_class specifier */
-
-struct intermodule_holder:holder_marker
-{
-  template<typename C>
-  struct apply
-  {
-    typedef intermodule_holder_class<C> type;
-  };
-};
-
-} /* namespace flyweights */
-
-} /* namespace boost */
-
-#endif
diff --git a/src/boost/flyweight/intermodule_holder_fwd.hpp b/src/boost/flyweight/intermodule_holder_fwd.hpp
deleted file mode 100644
index f2ea8845..00000000
--- a/src/boost/flyweight/intermodule_holder_fwd.hpp
+++ /dev/null
@@ -1,29 +0,0 @@
-/* Copyright 2006-2008 Joaquin M Lopez Munoz.
- * Distributed under the Boost 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/flyweight for library home page.
- */
-
-#ifndef BOOST_FLYWEIGHT_INTERMODULE_HOLDER_FWD_HPP
-#define BOOST_FLYWEIGHT_INTERMODULE_HOLDER_FWD_HPP
-
-#if defined(_MSC_VER)
-#pragma once
-#endif
-
-namespace boost{
-
-namespace flyweights{
-
-template<typename C>
-struct intermodule_holder_class;
-
-struct intermodule_holder;
-
-} /* namespace flyweights */
-
-} /* namespace boost */
-
-#endif
diff --git a/src/boost/flyweight/key_value.hpp b/src/boost/flyweight/key_value.hpp
deleted file mode 100644
index 6a95ae0b..00000000
--- a/src/boost/flyweight/key_value.hpp
+++ /dev/null
@@ -1,301 +0,0 @@
-/* Copyright 2006-2018 Joaquin M Lopez Munoz.
- * Distributed under the Boost 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/flyweight for library home page.
- */
-
-#ifndef BOOST_FLYWEIGHT_KEY_VALUE_HPP
-#define BOOST_FLYWEIGHT_KEY_VALUE_HPP
-
-#if defined(_MSC_VER)
-#pragma once
-#endif
-
-#include <boost/config.hpp> /* keep it first to prevent nasty warns in MSVC */
-#include <boost/detail/workaround.hpp>
-#include <boost/flyweight/detail/perfect_fwd.hpp>
-#include <boost/flyweight/detail/value_tag.hpp>
-#include <boost/flyweight/key_value_fwd.hpp>
-#include <boost/mpl/assert.hpp>
-#include <boost/type_traits/aligned_storage.hpp>
-#include <boost/type_traits/alignment_of.hpp> 
-#include <boost/type_traits/is_same.hpp>
-#include <new>
-
-/* key-value policy: flywewight lookup is based on Key, which also serves
- * to construct Value only when needed (new factory entry). key_value is
- * used to avoid the construction of temporary values when such construction
- * is expensive.
- * Optionally, KeyFromValue extracts the key from a value, which
- * is needed in expressions like this:
- *
- *  typedef flyweight<key_value<Key,Value> > fw_t;
- *  fw_t  fw;
- *  Value v;
- *  fw=v; // no key explicitly given
- *
- * If no KeyFromValue is provided, this latter expression fails to compile.
- */
-
-namespace boost{
-
-namespace flyweights{
-
-namespace detail{
-
-template<typename Key,typename Value,typename KeyFromValue>
-struct optimized_key_value:value_marker
-{
-  typedef Key   key_type;
-  typedef Value value_type;
-
-  class rep_type
-  {
-  public:
-    /* template ctors */
-
-#define BOOST_FLYWEIGHT_PERFECT_FWD_CTR_BODY(args)       \
-  :value_ptr(0)                                          \
-{                                                        \
-  new(spc_ptr())key_type(BOOST_FLYWEIGHT_FORWARD(args)); \
-}
-
-  BOOST_FLYWEIGHT_PERFECT_FWD(
-    explicit rep_type,
-    BOOST_FLYWEIGHT_PERFECT_FWD_CTR_BODY)
-
-#undef BOOST_FLYWEIGHT_PERFECT_FWD_CTR_BODY
-
-    rep_type(const rep_type& x):value_ptr(x.value_ptr)
-    {
-      if(!x.value_ptr)new(key_ptr())key_type(*x.key_ptr());
-    }
-
-    rep_type(const value_type& x):value_ptr(&x){}
-
-#if !defined(BOOST_NO_CXX11_RVALUE_REFERENCES)
-    rep_type(rep_type&& x):value_ptr(x.value_ptr)
-    {
-      if(!x.value_ptr)new(key_ptr())key_type(std::move(*x.key_ptr()));
-    }
-
-    rep_type(value_type&& x):value_ptr(&x){}
-#endif
-
-    ~rep_type()
-    {
-      if(!value_ptr)       key_ptr()->~key_type();
-      else if(value_cted())value_ptr->~value_type();
-    }
-
-    operator const key_type&()const
-    {
-      if(value_ptr)return key_from_value(*value_ptr);
-      else         return *key_ptr();
-    }
-
-    operator const value_type&()const
-    {
-      /* This is always called after construct_value() or copy_value(),
-       * so we access spc directly rather than through value_ptr to
-       * save us an indirection.
-       */
-
-      return *static_cast<value_type*>(spc_ptr());
-    }
-
-  private:
-    friend struct optimized_key_value;
-
-    void* spc_ptr()const{return static_cast<void*>(&spc);}
-    bool  value_cted()const{return value_ptr==spc_ptr();}
-
-    key_type* key_ptr()const
-    {
-      return static_cast<key_type*>(static_cast<void*>(&spc));
-    }
-
-    static const key_type& key_from_value(const value_type& x)
-    {
-      KeyFromValue k;
-      return k(x);
-    }
-
-    void construct_value()const
-    {
-      if(!value_cted()){
-        /* value_ptr must be ==0, oherwise copy_value would have been called */
-
-#if !defined(BOOST_NO_CXX11_RVALUE_REFERENCES)
-        key_type k(std::move(*key_ptr()));
-#else
-        key_type k(*key_ptr());
-#endif
-
-        key_ptr()->~key_type();
-        value_ptr= /* guarantees key won't be re-dted at ~rep_type if the */
-          static_cast<value_type*>(spc_ptr())+1; /* next statement throws */
-        value_ptr=new(spc_ptr())value_type(k);
-      }
-    }
-
-    void copy_value()const
-    {
-      if(!value_cted())value_ptr=new(spc_ptr())value_type(*value_ptr);
-    }
-
-#if !defined(BOOST_NO_CXX11_RVALUE_REFERENCES)
-    void move_value()const
-    {
-      if(!value_cted())value_ptr=
-        new(spc_ptr())value_type(std::move(const_cast<value_type&>(*value_ptr)));
-    }
-#endif
-
-    mutable typename boost::aligned_storage<
-      (sizeof(key_type)>sizeof(value_type))?
-        sizeof(key_type):sizeof(value_type),
-      (boost::alignment_of<key_type>::value >
-       boost::alignment_of<value_type>::value)?
-        boost::alignment_of<key_type>::value:
-        boost::alignment_of<value_type>::value
-    >::type                                    spc;
-    mutable const value_type*                  value_ptr;
-  };
-
-  static void construct_value(const rep_type& r)
-  {
-    r.construct_value();
-  }
-
-  static void copy_value(const rep_type& r)
-  {
-    r.copy_value();
-  }
-
-#if !defined(BOOST_NO_CXX11_RVALUE_REFERENCES)
-  static void move_value(const rep_type& r)
-  {
-    r.move_value();
-  }
-#endif
-};
-
-template<typename Key,typename Value>
-struct regular_key_value:value_marker
-{
-  typedef Key   key_type;
-  typedef Value value_type;
-
-  class rep_type
-  {
-  public:
-    /* template ctors */
-
-#if !defined(BOOST_NO_CXX11_RVALUE_REFERENCES)&&\
-    !defined(BOOST_NO_CXX11_VARIADIC_TEMPLATES)&&\
-    BOOST_WORKAROUND(__GNUC__,<=4)&&(__GNUC__<4||__GNUC_MINOR__<=4)
-
-/* GCC 4.4.2 (and probably prior) bug: the default ctor generated by the
- * variadic temmplate ctor below fails to value-initialize key.
- */
-
-    rep_type():key(),value_ptr(0){}
-#endif
-
-#define BOOST_FLYWEIGHT_PERFECT_FWD_CTR_BODY(args) \
-  :key(BOOST_FLYWEIGHT_FORWARD(args)),value_ptr(0){}
-
-  BOOST_FLYWEIGHT_PERFECT_FWD(
-    explicit rep_type,
-    BOOST_FLYWEIGHT_PERFECT_FWD_CTR_BODY)
-
-#undef BOOST_FLYWEIGHT_PERFECT_FWD_CTR_BODY
-
-    rep_type(const rep_type& x):key(x.key),value_ptr(0){}
-    rep_type(const value_type&):key(no_key_from_value_failure()){}
-
-#if !defined(BOOST_NO_CXX11_RVALUE_REFERENCES)
-    rep_type(rep_type&& x):key(std::move(x.key)),value_ptr(0){}
-    rep_type(value_type&&):key(no_key_from_value_failure()){}
-#endif
-
-    ~rep_type()
-    {
-      if(value_ptr)value_ptr->~value_type();
-    }
-
-    operator const key_type&()const{return key;}
-
-    operator const value_type&()const
-    {
-      /* This is always called after construct_value(),so we access spc
-       * directly rather than through value_ptr to save us an indirection.
-       */
-
-      return *static_cast<value_type*>(spc_ptr());
-    }
-
-  private:
-    friend struct regular_key_value;
-
-    void* spc_ptr()const{return static_cast<void*>(&spc);}
-
-    struct no_key_from_value_failure
-    {
-      BOOST_MPL_ASSERT_MSG(
-        false,
-        NO_KEY_FROM_VALUE_CONVERSION_PROVIDED,
-        (key_type,value_type));
-
-      operator const key_type&()const;
-    };
-
-    void construct_value()const
-    {
-      if(!value_ptr)value_ptr=new(spc_ptr())value_type(key);
-    }
-
-    key_type                                 key;
-    mutable typename boost::aligned_storage<
-      sizeof(value_type),
-      boost::alignment_of<value_type>::value
-    >::type                                  spc;
-    mutable const value_type*                value_ptr;
-  };
-
-  static void construct_value(const rep_type& r)
-  {
-    r.construct_value();
-  }
-
-  /* copy_value() and move_value() can't really ever be called, provided to avoid
-   * compile errors (it is the no_key_from_value_failure compile error we want to
-   * appear in these cases).
-   */
-
-  static void copy_value(const rep_type&){}
-
-#if !defined(BOOST_NO_CXX11_RVALUE_REFERENCES)
-  static void move_value(const rep_type&){}
-#endif
-};
-
-} /* namespace flyweights::detail */
-
-template<typename Key,typename Value,typename KeyFromValue>
-struct key_value:
-  mpl::if_<
-    is_same<KeyFromValue,no_key_from_value>,
-    detail::regular_key_value<Key,Value>,
-    detail::optimized_key_value<Key,Value,KeyFromValue>
-  >::type
-{};
-
-} /* namespace flyweights */
-
-} /* namespace boost */
-
-#endif
diff --git a/src/boost/flyweight/key_value_fwd.hpp b/src/boost/flyweight/key_value_fwd.hpp
deleted file mode 100644
index 878a778c..00000000
--- a/src/boost/flyweight/key_value_fwd.hpp
+++ /dev/null
@@ -1,29 +0,0 @@
-/* Copyright 2006-2008 Joaquin M Lopez Munoz.
- * Distributed under the Boost 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/flyweight for library home page.
- */
-
-#ifndef BOOST_FLYWEIGHT_KEY_VALUE_FWD_HPP
-#define BOOST_FLYWEIGHT_KEY_VALUE_FWD_HPP
-
-#if defined(_MSC_VER)
-#pragma once
-#endif
-
-namespace boost{
-
-namespace flyweights{
-
-struct no_key_from_value;
-
-template<typename Key,typename Value,typename KeyFromValue=no_key_from_value>
-struct key_value;
-
-} /* namespace flyweights */
-
-} /* namespace boost */
-
-#endif
diff --git a/src/boost/flyweight/no_locking.hpp b/src/boost/flyweight/no_locking.hpp
deleted file mode 100644
index 4d1bcd8b..00000000
--- a/src/boost/flyweight/no_locking.hpp
+++ /dev/null
@@ -1,36 +0,0 @@
-/* Copyright 2006-2008 Joaquin M Lopez Munoz.
- * Distributed under the Boost 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/flyweight for library home page.
- */
-
-#ifndef BOOST_FLYWEIGHT_NO_LOCKING_HPP
-#define BOOST_FLYWEIGHT_NO_LOCKING_HPP
-
-#if defined(_MSC_VER)
-#pragma once
-#endif
-
-#include <boost/config.hpp> /* keep it first to prevent nasty warns in MSVC */
-#include <boost/flyweight/no_locking_fwd.hpp>
-#include <boost/flyweight/locking_tag.hpp>
-
-/* null locking policy */
-
-namespace boost{
-
-namespace flyweights{
-
-struct no_locking:locking_marker
-{
-  struct             mutex_type{};
-  typedef mutex_type lock_type;
-};
-
-} /* namespace flyweights */
-
-} /* namespace boost */
-
-#endif
diff --git a/src/boost/flyweight/no_tracking.hpp b/src/boost/flyweight/no_tracking.hpp
deleted file mode 100644
index 47ce8f9e..00000000
--- a/src/boost/flyweight/no_tracking.hpp
+++ /dev/null
@@ -1,46 +0,0 @@
-/* Copyright 2006-2008 Joaquin M Lopez Munoz.
- * Distributed under the Boost 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/flyweight for library home page.
- */
-
-#ifndef BOOST_FLYWEIGHT_NO_TRACKING_HPP
-#define BOOST_FLYWEIGHT_NO_TRACKING_HPP
-
-#if defined(_MSC_VER)
-#pragma once
-#endif
-
-#include <boost/config.hpp> /* keep it first to prevent nasty warns in MSVC */
-#include <boost/flyweight/no_tracking_fwd.hpp>
-#include <boost/flyweight/tracking_tag.hpp>
-
-/* Null tracking policy: elements are never erased from the factory.
- */
-
-namespace boost{
-
-namespace flyweights{
-
-struct no_tracking:tracking_marker
-{
-  struct entry_type
-  {
-    template<typename Value,typename Key>
-    struct apply{typedef Value type;};
-  };
-
-  struct handle_type
-  {
-    template<typename Handle,typename TrackingHelper>
-    struct apply{typedef Handle type;};
-  };
-};
-
-} /* namespace flyweights */
-
-} /* namespace boost */
-
-#endif
diff --git a/src/boost/flyweight/no_tracking_fwd.hpp b/src/boost/flyweight/no_tracking_fwd.hpp
deleted file mode 100644
index a6010125..00000000
--- a/src/boost/flyweight/no_tracking_fwd.hpp
+++ /dev/null
@@ -1,26 +0,0 @@
-/* Copyright 2006-2008 Joaquin M Lopez Munoz.
- * Distributed under the Boost 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/flyweight for library home page.
- */
-
-#ifndef BOOST_FLYWEIGHT_NO_TRACKING_FWD_HPP
-#define BOOST_FLYWEIGHT_NO_TRACKING_FWD_HPP
-
-#if defined(_MSC_VER)
-#pragma once
-#endif
-
-namespace boost{
-
-namespace flyweights{
-
-struct no_tracking;
-
-} /* namespace flyweights */
-
-} /* namespace boost */
-
-#endif
diff --git a/src/boost/flyweight/serialize.hpp b/src/boost/flyweight/serialize.hpp
deleted file mode 100644
index 0e55de7f..00000000
--- a/src/boost/flyweight/serialize.hpp
+++ /dev/null
@@ -1,97 +0,0 @@
-/* Copyright 2006-2023 Joaquin M Lopez Munoz.
- * Distributed under the Boost 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/flyweight for library home page.
- */
-
-#ifndef BOOST_FLYWEIGHT_SERIALIZE_HPP
-#define BOOST_FLYWEIGHT_SERIALIZE_HPP
-
-#if defined(_MSC_VER)&&(_MSC_VER>=1200)
-#pragma once
-#endif
-
-#include <boost/config.hpp> /* keep it first to prevent nasty warns in MSVC */
-#include <boost/flyweight/flyweight_fwd.hpp>
-#include <boost/flyweight/detail/archive_constructed.hpp>
-#include <boost/flyweight/detail/serialization_helper.hpp>
-#include <boost/core/serialization.hpp>
-#include <boost/throw_exception.hpp>
-#include <memory>
-#include <stdexcept>
-
-/* Serialization routines for flyweight<T>. 
- */
-
-namespace boost{
-
-namespace flyweights{
-
-template<
-  class Archive,
-  typename T,typename Arg1,typename Arg2,typename Arg3
->
-inline void serialize(
-  Archive& ar,::boost::flyweights::flyweight<T,Arg1,Arg2,Arg3>& f,
-  const unsigned int version)
-{
-  core::split_free(ar,f,version);
-}                                               
-
-template<
-  class Archive,
-  typename T,typename Arg1,typename Arg2,typename Arg3
->
-void save(
-  Archive& ar,const ::boost::flyweights::flyweight<T,Arg1,Arg2,Arg3>& f,
-  const unsigned int /*version*/)
-{
-  typedef ::boost::flyweights::flyweight<T,Arg1,Arg2,Arg3>    flyweight;
-  typedef ::boost::flyweights::detail::save_helper<flyweight> helper;
-  typedef typename helper::size_type                          size_type;
-
-  helper& hlp=ar.template get_helper<helper>();
-
-  size_type n=hlp.find(f);
-  ar<<make_nvp("item",n);
-  if(n==hlp.size()){
-    ar<<make_nvp("key",f.get_key());
-    hlp.push_back(f);
-  }
-}
-
-template<
-  class Archive,
-  typename T,typename Arg1,typename Arg2,typename Arg3
->
-void load(
-  Archive& ar,::boost::flyweights::flyweight<T,Arg1,Arg2,Arg3>& f,
-  const unsigned int version)
-{
-  typedef ::boost::flyweights::flyweight<T,Arg1,Arg2,Arg3>    flyweight;
-  typedef typename flyweight::key_type                        key_type;
-  typedef ::boost::flyweights::detail::load_helper<flyweight> helper;
-  typedef typename helper::size_type                          size_type;
-
-  helper& hlp=ar.template get_helper<helper>();
-
-  size_type n=0;
-  ar>>make_nvp("item",n);
-  if(n>hlp.size()){
-    throw_exception(std::runtime_error("Invalid or corrupted archive"));
-  }
-  else if(n==hlp.size()){
-    ::boost::flyweights::detail::archive_constructed<key_type> k(
-      "key",ar,version);
-    hlp.push_back(flyweight(k.get()));
-  }
-  f=hlp[n];
-}
-
-} /* namespace flyweights */
-
-} /* namespace boost */
-
-#endif
diff --git a/src/boost/flyweight/set_factory.hpp b/src/boost/flyweight/set_factory.hpp
deleted file mode 100644
index b0eeee75..00000000
--- a/src/boost/flyweight/set_factory.hpp
+++ /dev/null
@@ -1,82 +0,0 @@
-/* Copyright 2006-2009 Joaquin M Lopez Munoz.
- * Distributed under the Boost 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/flyweight for library home page.
- */
-
-#ifndef BOOST_FLYWEIGHT_SET_FACTORY_HPP
-#define BOOST_FLYWEIGHT_SET_FACTORY_HPP
-
-#if defined(_MSC_VER)
-#pragma once
-#endif
-
-#include <boost/config.hpp> /* keep it first to prevent nasty warns in MSVC */
-#include <boost/detail/allocator_utilities.hpp>
-#include <boost/flyweight/assoc_container_factory.hpp>
-#include <boost/flyweight/factory_tag.hpp>
-#include <boost/flyweight/set_factory_fwd.hpp>
-#include <boost/mpl/aux_/lambda_support.hpp>
-#include <boost/mpl/if.hpp>
-#include <set>
-
-/* Particularization of assoc_container_factory_class using a set.
- */
-
-namespace boost{
-
-namespace flyweights{
-
-template<
-  typename Entry,typename Key,
-  typename Compare,typename Allocator
->
-class set_factory_class:
-  public assoc_container_factory_class<
-    std::set<
-      Entry,
-      typename boost::mpl::if_<
-        mpl::is_na<Compare>,
-        std::less<Key>,
-        Compare
-      >::type,
-      typename boost::mpl::if_<
-        mpl::is_na<Allocator>,
-        std::allocator<Entry>,
-        Allocator
-      >::type
-    >
-  >
-{
-public:
-  typedef set_factory_class type;
-  BOOST_MPL_AUX_LAMBDA_SUPPORT(
-    4,set_factory_class,(Entry,Key,Compare,Allocator))
-};
-
-/* set_factory_class specifier */
-
-template<
-  typename Compare,typename Allocator
-  BOOST_FLYWEIGHT_NOT_A_PLACEHOLDER_EXPRESSION_DEF
->
-struct set_factory:factory_marker
-{
-  template<typename Entry,typename Key>
-  struct apply:
-    mpl::apply2<
-      set_factory_class<
-        boost::mpl::_1,boost::mpl::_2,Compare,Allocator
-      >,
-      Entry,Key
-    >
-  {};
-};
-
-} /* namespace flyweights */
-
-} /* namespace boost */
-
-#endif
diff --git a/src/boost/flyweight/set_factory_fwd.hpp b/src/boost/flyweight/set_factory_fwd.hpp
deleted file mode 100644
index 8d26e73d..00000000
--- a/src/boost/flyweight/set_factory_fwd.hpp
+++ /dev/null
@@ -1,40 +0,0 @@
-/* Copyright 2006-2008 Joaquin M Lopez Munoz.
- * Distributed under the Boost 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/flyweight for library home page.
- */
-
-#ifndef BOOST_FLYWEIGHT_SET_FACTORY_FWD_HPP
-#define BOOST_FLYWEIGHT_SET_FACTORY_FWD_HPP
-
-#if defined(_MSC_VER)
-#pragma once
-#endif
-
-#include <boost/config.hpp> /* keep it first to prevent nasty warns in MSVC */
-#include <boost/flyweight/detail/not_placeholder_expr.hpp>
-#include <boost/mpl/aux_/na.hpp>
-
-namespace boost{
-
-namespace flyweights{
-
-template<
-  typename Entry,typename Key,
-  typename Compare=mpl::na,typename Allocator=mpl::na
->
-class set_factory_class;
-
-template<
-  typename Compare=mpl::na,typename Allocator=mpl::na
-  BOOST_FLYWEIGHT_NOT_A_PLACEHOLDER_EXPRESSION
->
-struct set_factory;
-
-} /* namespace flyweights */
-
-} /* namespace boost */
-
-#endif
diff --git a/src/boost/integer/common_factor_rt.hpp b/src/boost/integer/common_factor_rt.hpp
deleted file mode 100644
index b8339c7d..00000000
--- a/src/boost/integer/common_factor_rt.hpp
+++ /dev/null
@@ -1,580 +0,0 @@
-//  (C) Copyright Jeremy William Murphy 2016.
-
-//  Use, modification and distribution are subject to the
-//  Boost Software License, Version 1.0. (See accompanying file
-//  LICENSE_1_0.txt or copy at https://www.boost.org/LICENSE_1_0.txt)
-
-#ifndef BOOST_INTEGER_COMMON_FACTOR_RT_HPP
-#define BOOST_INTEGER_COMMON_FACTOR_RT_HPP
-
-#include <boost/assert.hpp>
-#include <boost/core/enable_if.hpp>
-
-#include <boost/config.hpp>  // for BOOST_NESTED_TEMPLATE, etc.
-#include <boost/limits.hpp>  // for std::numeric_limits
-#include <climits>           // for CHAR_MIN
-#include <boost/detail/workaround.hpp>
-#include <iterator>
-#include <algorithm>
-#include <limits>
-#ifndef BOOST_NO_CXX11_HDR_TYPE_TRAITS
-#include <type_traits>
-#endif
-#ifdef BOOST_NO_CXX11_HDR_FUNCTIONAL
-#include <functional>
-#endif
-
-#if ((defined(BOOST_MSVC) && (BOOST_MSVC >= 1600)) || (defined(__clang__) && defined(__c2__)) || (defined(BOOST_INTEL) && defined(_MSC_VER))) && (defined(_M_IX86) || defined(_M_X64))
-#include <intrin.h>
-#endif
-
-#ifdef BOOST_MSVC
-#pragma warning(push)
-#pragma warning(disable:4127 4244)  // Conditional expression is constant
-#endif
-
-#if !defined(BOOST_NO_CXX11_HDR_TYPE_TRAITS) && !defined(BOOST_NO_CXX11_NOEXCEPT)
-#define BOOST_GCD_NOEXCEPT(T) noexcept(std::is_arithmetic<T>::value)
-#else
-#define BOOST_GCD_NOEXCEPT(T)
-#endif
-
-namespace boost {
-
-   template <class I>
-   class rational;
-
-   namespace integer {
-
-      namespace gcd_detail{
-
-         //
-         // some helper functions which really should be constexpr already, but sadly aren't:
-         //
-#ifndef BOOST_NO_CXX14_CONSTEXPR
-         template <class T>
-         inline constexpr T constexpr_min(T const& a, T const& b) BOOST_GCD_NOEXCEPT(T)
-         {
-            return a < b ? a : b;
-         }
-         template <class T>
-         inline constexpr auto constexpr_swap(T&a, T& b) BOOST_GCD_NOEXCEPT(T) -> decltype(a.swap(b))
-         {
-            return a.swap(b);
-         }
-         template <class T, class U>
-         inline constexpr void constexpr_swap(T&a, U& b...) BOOST_GCD_NOEXCEPT(T)
-         {
-            T t(static_cast<T&&>(a));
-            a = static_cast<T&&>(b);
-            b = static_cast<T&&>(t);
-         }
-#else
-         template <class T>
-         inline T constexpr_min(T const& a, T const& b) BOOST_GCD_NOEXCEPT(T)
-         {
-            return a < b ? a : b;
-         }
-         template <class T>
-         inline void constexpr_swap(T&a, T& b) BOOST_GCD_NOEXCEPT(T)
-         {
-            using std::swap;
-            swap(a, b);
-         }
-#endif
-
-      template <class T, bool a =
-#ifndef BOOST_NO_CXX11_HDR_TYPE_TRAITS
-         std::is_unsigned<T>::value ||
-#endif
-         (std::numeric_limits<T>::is_specialized && !std::numeric_limits<T>::is_signed)>
-      struct gcd_traits_abs_defaults
-      {
-         inline static BOOST_CXX14_CONSTEXPR const T& abs(const T& val) BOOST_GCD_NOEXCEPT(T) { return val; }
-      };
-      template <class T>
-      struct gcd_traits_abs_defaults<T, false>
-      {
-         inline static T BOOST_CXX14_CONSTEXPR abs(const T& val) BOOST_GCD_NOEXCEPT(T)
-         {
-            // This sucks, but std::abs is not constexpr :(
-            return val < T(0) ? -val : val;
-         }
-      };
-
-      enum method_type
-      {
-         method_euclid = 0,
-         method_binary = 1,
-         method_mixed = 2
-      };
-
-      struct any_convert
-      {
-         template <class T>
-         any_convert(const T&);
-      };
-
-      struct unlikely_size
-      {
-         char buf[9973];
-      };
-
-      unlikely_size operator <<= (any_convert, any_convert);
-      unlikely_size operator >>= (any_convert, any_convert);
-
-      template <class T>
-      struct gcd_traits_defaults : public gcd_traits_abs_defaults<T>
-      {
-         BOOST_FORCEINLINE static BOOST_CXX14_CONSTEXPR unsigned make_odd(T& val) BOOST_GCD_NOEXCEPT(T)
-         {
-            unsigned r = 0;
-            while (T(0) == (val & 1u))
-            {
-#ifdef _MSC_VER  // VC++ can't handle operator >>= in constexpr code for some reason
-               val = val >> 1;
-#else
-               val >>= 1;
-#endif
-               ++r;
-            }
-            return r;
-         }
-         inline static BOOST_CXX14_CONSTEXPR bool less(const T& a, const T& b) BOOST_GCD_NOEXCEPT(T)
-         {
-            return a < b;
-         }
-
-         static T& get_value();
-
-#ifndef BOOST_NO_SFINAE
-         static const bool has_operator_left_shift_equal = sizeof(get_value() <<= 2) != sizeof(unlikely_size);
-         static const bool has_operator_right_shift_equal = sizeof(get_value() >>= 2) != sizeof(unlikely_size);
-#else
-         static const bool has_operator_left_shift_equal = true;
-         static const bool has_operator_right_shift_equal = true;
-#endif
-         static const method_type method = std::numeric_limits<T>::is_specialized && std::numeric_limits<T>::is_integer && has_operator_left_shift_equal && has_operator_right_shift_equal ? method_mixed : method_euclid;
-      };
-      //
-      // Default gcd_traits just inherits from defaults:
-      //
-      template <class T>
-      struct gcd_traits : public gcd_traits_defaults<T> {};
-
-      //
-      // Some platforms have fast bitscan operations, that allow us to implement
-      // make_odd much more efficiently, unfortunately we can't use these if we want
-      // the functions to be constexpr as the compiler intrinsics aren't constexpr.
-      //
-#if defined(BOOST_NO_CXX14_CONSTEXPR) && ((defined(BOOST_MSVC) && (BOOST_MSVC >= 1600)) || (defined(__clang__) && defined(__c2__)) || (defined(BOOST_INTEL) && defined(_MSC_VER))) && (defined(_M_IX86) || defined(_M_X64))
-#pragma intrinsic(_BitScanForward,)
-      template <>
-      struct gcd_traits<unsigned long> : public gcd_traits_defaults<unsigned long>
-      {
-         BOOST_FORCEINLINE static unsigned find_lsb(unsigned long val) BOOST_NOEXCEPT
-         {
-            unsigned long result;
-            _BitScanForward(&result, val);
-            return result;
-         }
-         BOOST_FORCEINLINE static unsigned make_odd(unsigned long& val) BOOST_NOEXCEPT
-         {
-            unsigned result = find_lsb(val);
-            val >>= result;
-            return result;
-         }
-      };
-
-#ifdef _M_X64
-#pragma intrinsic(_BitScanForward64)
-      template <>
-      struct gcd_traits<unsigned __int64> : public gcd_traits_defaults<unsigned __int64>
-      {
-         BOOST_FORCEINLINE static unsigned find_lsb(unsigned __int64 mask) BOOST_NOEXCEPT
-         {
-            unsigned long result;
-            _BitScanForward64(&result, mask);
-            return result;
-         }
-         BOOST_FORCEINLINE static unsigned make_odd(unsigned __int64& val) BOOST_NOEXCEPT
-         {
-            unsigned result = find_lsb(val);
-            val >>= result;
-            return result;
-         }
-      };
-#endif
-      //
-      // Other integer type are trivial adaptations of the above,
-      // this works for signed types too, as by the time these functions
-      // are called, all values are > 0.
-      //
-      template <> struct gcd_traits<long> : public gcd_traits_defaults<long>
-      { BOOST_FORCEINLINE static unsigned make_odd(long& val)BOOST_NOEXCEPT{ unsigned result = gcd_traits<unsigned long>::find_lsb(val); val >>= result; return result; } };
-      template <> struct gcd_traits<unsigned int> : public gcd_traits_defaults<unsigned int>
-      { BOOST_FORCEINLINE static unsigned make_odd(unsigned int& val)BOOST_NOEXCEPT{ unsigned result = gcd_traits<unsigned long>::find_lsb(val); val >>= result; return result; } };
-      template <> struct gcd_traits<int> : public gcd_traits_defaults<int>
-      { BOOST_FORCEINLINE static unsigned make_odd(int& val)BOOST_NOEXCEPT{ unsigned result = gcd_traits<unsigned long>::find_lsb(val); val >>= result; return result; } };
-      template <> struct gcd_traits<unsigned short> : public gcd_traits_defaults<unsigned short>
-      { BOOST_FORCEINLINE static unsigned make_odd(unsigned short& val)BOOST_NOEXCEPT{ unsigned result = gcd_traits<unsigned long>::find_lsb(val); val >>= result; return result; } };
-      template <> struct gcd_traits<short> : public gcd_traits_defaults<short>
-      { BOOST_FORCEINLINE static unsigned make_odd(short& val)BOOST_NOEXCEPT{ unsigned result = gcd_traits<unsigned long>::find_lsb(val); val >>= result; return result; } };
-      template <> struct gcd_traits<unsigned char> : public gcd_traits_defaults<unsigned char>
-      { BOOST_FORCEINLINE static unsigned make_odd(unsigned char& val)BOOST_NOEXCEPT{ unsigned result = gcd_traits<unsigned long>::find_lsb(val); val >>= result; return result; } };
-      template <> struct gcd_traits<signed char> : public gcd_traits_defaults<signed char>
-      { BOOST_FORCEINLINE static unsigned make_odd(signed char& val)BOOST_NOEXCEPT{ unsigned result = gcd_traits<unsigned long>::find_lsb(val); val >>= result; return result; } };
-      template <> struct gcd_traits<char> : public gcd_traits_defaults<char>
-      { BOOST_FORCEINLINE static unsigned make_odd(char& val)BOOST_NOEXCEPT{ unsigned result = gcd_traits<unsigned long>::find_lsb(val); val >>= result; return result; } };
-#ifndef BOOST_NO_INTRINSIC_WCHAR_T
-      template <> struct gcd_traits<wchar_t> : public gcd_traits_defaults<wchar_t>
-      { BOOST_FORCEINLINE static unsigned make_odd(wchar_t& val)BOOST_NOEXCEPT{ unsigned result = gcd_traits<unsigned long>::find_lsb(val); val >>= result; return result; } };
-#endif
-#ifdef _M_X64
-      template <> struct gcd_traits<__int64> : public gcd_traits_defaults<__int64>
-      { BOOST_FORCEINLINE static unsigned make_odd(__int64& val)BOOST_NOEXCEPT{ unsigned result = gcd_traits<unsigned __int64>::find_lsb(val); val >>= result; return result; } };
-#endif
-
-#elif defined(BOOST_GCC) || defined(__clang__) || (defined(BOOST_INTEL) && defined(__GNUC__))
-
-      template <>
-      struct gcd_traits<unsigned> : public gcd_traits_defaults<unsigned>
-      {
-         BOOST_FORCEINLINE static BOOST_CXX14_CONSTEXPR unsigned find_lsb(unsigned mask)BOOST_NOEXCEPT
-         {
-            return __builtin_ctz(mask);
-         }
-         BOOST_FORCEINLINE static BOOST_CXX14_CONSTEXPR unsigned make_odd(unsigned& val)BOOST_NOEXCEPT
-         {
-            unsigned result = find_lsb(val);
-            val >>= result;
-            return result;
-         }
-      };
-      template <>
-      struct gcd_traits<unsigned long> : public gcd_traits_defaults<unsigned long>
-      {
-         BOOST_FORCEINLINE static BOOST_CXX14_CONSTEXPR unsigned find_lsb(unsigned long mask)BOOST_NOEXCEPT
-         {
-            return __builtin_ctzl(mask);
-         }
-         BOOST_FORCEINLINE static BOOST_CXX14_CONSTEXPR unsigned make_odd(unsigned long& val)BOOST_NOEXCEPT
-         {
-            unsigned result = find_lsb(val);
-            val >>= result;
-            return result;
-         }
-      };
-      template <>
-      struct gcd_traits<boost::ulong_long_type> : public gcd_traits_defaults<boost::ulong_long_type>
-      {
-         BOOST_FORCEINLINE static BOOST_CXX14_CONSTEXPR unsigned find_lsb(boost::ulong_long_type mask)BOOST_NOEXCEPT
-         {
-            return __builtin_ctzll(mask);
-         }
-         BOOST_FORCEINLINE static BOOST_CXX14_CONSTEXPR unsigned make_odd(boost::ulong_long_type& val)BOOST_NOEXCEPT
-         {
-            unsigned result = find_lsb(val);
-            val >>= result;
-            return result;
-         }
-      };
-      //
-      // Other integer type are trivial adaptations of the above,
-      // this works for signed types too, as by the time these functions
-      // are called, all values are > 0.
-      //
-      template <> struct gcd_traits<boost::long_long_type> : public gcd_traits_defaults<boost::long_long_type>
-      {
-         BOOST_FORCEINLINE static BOOST_CXX14_CONSTEXPR unsigned make_odd(boost::long_long_type& val)BOOST_NOEXCEPT { unsigned result = gcd_traits<boost::ulong_long_type>::find_lsb(val); val >>= result; return result; }
-      };
-      template <> struct gcd_traits<long> : public gcd_traits_defaults<long>
-      {
-         BOOST_FORCEINLINE static BOOST_CXX14_CONSTEXPR unsigned make_odd(long& val)BOOST_NOEXCEPT { unsigned result = gcd_traits<unsigned long>::find_lsb(val); val >>= result; return result; }
-      };
-      template <> struct gcd_traits<int> : public gcd_traits_defaults<int>
-      {
-         BOOST_FORCEINLINE static BOOST_CXX14_CONSTEXPR unsigned make_odd(int& val)BOOST_NOEXCEPT { unsigned result = gcd_traits<unsigned long>::find_lsb(val); val >>= result; return result; }
-      };
-      template <> struct gcd_traits<unsigned short> : public gcd_traits_defaults<unsigned short>
-      {
-         BOOST_FORCEINLINE static BOOST_CXX14_CONSTEXPR unsigned make_odd(unsigned short& val)BOOST_NOEXCEPT { unsigned result = gcd_traits<unsigned>::find_lsb(val); val >>= result; return result; }
-      };
-      template <> struct gcd_traits<short> : public gcd_traits_defaults<short>
-      {
-         BOOST_FORCEINLINE static BOOST_CXX14_CONSTEXPR unsigned make_odd(short& val)BOOST_NOEXCEPT { unsigned result = gcd_traits<unsigned>::find_lsb(val); val >>= result; return result; }
-      };
-      template <> struct gcd_traits<unsigned char> : public gcd_traits_defaults<unsigned char>
-      {
-         BOOST_FORCEINLINE static BOOST_CXX14_CONSTEXPR unsigned make_odd(unsigned char& val)BOOST_NOEXCEPT { unsigned result = gcd_traits<unsigned>::find_lsb(val); val >>= result; return result; }
-      };
-      template <> struct gcd_traits<signed char> : public gcd_traits_defaults<signed char>
-      {
-         BOOST_FORCEINLINE static BOOST_CXX14_CONSTEXPR unsigned make_odd(signed char& val)BOOST_NOEXCEPT { unsigned result = gcd_traits<unsigned>::find_lsb(val); val >>= result; return result; }
-      };
-      template <> struct gcd_traits<char> : public gcd_traits_defaults<char>
-      {
-         BOOST_FORCEINLINE static BOOST_CXX14_CONSTEXPR unsigned make_odd(char& val)BOOST_NOEXCEPT { unsigned result = gcd_traits<unsigned>::find_lsb(val); val >>= result; return result; }
-      };
-#ifndef BOOST_NO_INTRINSIC_WCHAR_T
-      template <> struct gcd_traits<wchar_t> : public gcd_traits_defaults<wchar_t>
-      {
-         BOOST_FORCEINLINE static BOOST_CXX14_CONSTEXPR unsigned make_odd(wchar_t& val)BOOST_NOEXCEPT { unsigned result = gcd_traits<unsigned>::find_lsb(val); val >>= result; return result; }
-      };
-#endif
-#endif
-   //
-   // The Mixed Binary Euclid Algorithm
-   // Sidi Mohamed Sedjelmaci
-   // Electronic Notes in Discrete Mathematics 35 (2009) 169-176
-   //
-   template <class T>
-   BOOST_CXX14_CONSTEXPR T mixed_binary_gcd(T u, T v) BOOST_GCD_NOEXCEPT(T)
-   {
-      if(gcd_traits<T>::less(u, v))
-         constexpr_swap(u, v);
-
-      unsigned shifts = 0;
-
-      if(u == T(0))
-         return v;
-      if(v == T(0))
-         return u;
-
-      shifts = constexpr_min(gcd_traits<T>::make_odd(u), gcd_traits<T>::make_odd(v));
-
-      while(gcd_traits<T>::less(1, v))
-      {
-         u %= v;
-         v -= u;
-         if(u == T(0))
-            return v << shifts;
-         if(v == T(0))
-            return u << shifts;
-         gcd_traits<T>::make_odd(u);
-         gcd_traits<T>::make_odd(v);
-         if(gcd_traits<T>::less(u, v))
-            constexpr_swap(u, v);
-      }
-      return (v == 1 ? v : u) << shifts;
-   }
-
-    /** Stein gcd (aka 'binary gcd')
-     *
-     * From Mathematics to Generic Programming, Alexander Stepanov, Daniel Rose
-     */
-    template <typename SteinDomain>
-    BOOST_CXX14_CONSTEXPR SteinDomain Stein_gcd(SteinDomain m, SteinDomain n) BOOST_GCD_NOEXCEPT(SteinDomain)
-    {
-        BOOST_ASSERT(m >= 0);
-        BOOST_ASSERT(n >= 0);
-        if (m == SteinDomain(0))
-            return n;
-        if (n == SteinDomain(0))
-            return m;
-        // m > 0 && n > 0
-        unsigned d_m = gcd_traits<SteinDomain>::make_odd(m);
-        unsigned d_n = gcd_traits<SteinDomain>::make_odd(n);
-        // odd(m) && odd(n)
-        while (m != n)
-        {
-            if (n > m)
-               constexpr_swap(n, m);
-            m -= n;
-            gcd_traits<SteinDomain>::make_odd(m);
-        }
-        // m == n
-        m <<= constexpr_min(d_m, d_n);
-        return m;
-    }
-
-
-    /** Euclidean algorithm
-     *
-     * From Mathematics to Generic Programming, Alexander Stepanov, Daniel Rose
-     *
-     */
-    template <typename EuclideanDomain>
-    inline BOOST_CXX14_CONSTEXPR EuclideanDomain Euclid_gcd(EuclideanDomain a, EuclideanDomain b) BOOST_GCD_NOEXCEPT(EuclideanDomain)
-    {
-        while (b != EuclideanDomain(0))
-        {
-            a %= b;
-            constexpr_swap(a, b);
-        }
-        return a;
-    }
-
-
-    template <typename T>
-    inline BOOST_CXX14_CONSTEXPR BOOST_DEDUCED_TYPENAME enable_if_c<gcd_traits<T>::method == method_mixed, T>::type
-       optimal_gcd_select(T const &a, T const &b) BOOST_GCD_NOEXCEPT(T)
-    {
-       return gcd_detail::mixed_binary_gcd(a, b);
-    }
-
-    template <typename T>
-    inline BOOST_CXX14_CONSTEXPR BOOST_DEDUCED_TYPENAME enable_if_c<gcd_traits<T>::method == method_binary, T>::type
-       optimal_gcd_select(T const &a, T const &b) BOOST_GCD_NOEXCEPT(T)
-    {
-       return gcd_detail::Stein_gcd(a, b);
-    }
-
-    template <typename T>
-    inline BOOST_CXX14_CONSTEXPR BOOST_DEDUCED_TYPENAME enable_if_c<gcd_traits<T>::method == method_euclid, T>::type
-       optimal_gcd_select(T const &a, T const &b) BOOST_GCD_NOEXCEPT(T)
-    {
-       return gcd_detail::Euclid_gcd(a, b);
-    }
-
-    template <class T>
-    inline BOOST_CXX14_CONSTEXPR T lcm_imp(const T& a, const T& b) BOOST_GCD_NOEXCEPT(T)
-    {
-       T temp = boost::integer::gcd_detail::optimal_gcd_select(a, b);
-#if BOOST_WORKAROUND(BOOST_GCC_VERSION, < 40500)
-       return (temp != T(0)) ? T(a / temp * b) : T(0);
-#else
-       return temp != T(0) ? T(a / temp * b) : T(0);
-#endif
-    }
-
-} // namespace detail
-
-
-template <typename Integer>
-inline BOOST_CXX14_CONSTEXPR Integer gcd(Integer const &a, Integer const &b) BOOST_GCD_NOEXCEPT(Integer)
-{
-    if(a == (std::numeric_limits<Integer>::min)())
-       return a == static_cast<Integer>(0) ? gcd_detail::gcd_traits<Integer>::abs(b) : boost::integer::gcd(static_cast<Integer>(a % b), b);
-    else if (b == (std::numeric_limits<Integer>::min)())
-       return b == static_cast<Integer>(0) ? gcd_detail::gcd_traits<Integer>::abs(a) : boost::integer::gcd(a, static_cast<Integer>(b % a));
-    return gcd_detail::optimal_gcd_select(static_cast<Integer>(gcd_detail::gcd_traits<Integer>::abs(a)), static_cast<Integer>(gcd_detail::gcd_traits<Integer>::abs(b)));
-}
-
-template <typename Integer>
-inline BOOST_CXX14_CONSTEXPR Integer lcm(Integer const &a, Integer const &b) BOOST_GCD_NOEXCEPT(Integer)
-{
-   return gcd_detail::lcm_imp(static_cast<Integer>(gcd_detail::gcd_traits<Integer>::abs(a)), static_cast<Integer>(gcd_detail::gcd_traits<Integer>::abs(b)));
-}
-#ifndef BOOST_NO_CXX11_VARIADIC_TEMPLATES
-//
-// This looks slightly odd, but the variadic forms must have 3 or more arguments, and the variadic argument pack may be empty.
-// This matters not at all for most compilers, but Oracle C++ selects the wrong overload in the 2-arg case unless we do this.
-//
-template <typename Integer, typename... Args>
-inline BOOST_CXX14_CONSTEXPR Integer gcd(Integer const &a, Integer const &b, const Integer& c, Args const&... args) BOOST_GCD_NOEXCEPT(Integer)
-{
-   Integer t = gcd(b, c, args...);
-   return t == 1 ? 1 : gcd(a, t);
-}
-
-template <typename Integer, typename... Args>
-inline BOOST_CXX14_CONSTEXPR Integer lcm(Integer const &a, Integer const &b, Integer const& c, Args const&... args) BOOST_GCD_NOEXCEPT(Integer)
-{
-   return lcm(a, lcm(b, c, args...));
-}
-#endif
-//
-// Special handling for rationals:
-//
-template <typename Integer>
-inline typename boost::enable_if_c<std::numeric_limits<Integer>::is_specialized, boost::rational<Integer> >::type gcd(boost::rational<Integer> const &a, boost::rational<Integer> const &b)
-{
-   return boost::rational<Integer>(static_cast<Integer>(gcd(a.numerator(), b.numerator())), static_cast<Integer>(lcm(a.denominator(), b.denominator())));
-}
-
-template <typename Integer>
-inline typename boost::enable_if_c<std::numeric_limits<Integer>::is_specialized, boost::rational<Integer> >::type lcm(boost::rational<Integer> const &a, boost::rational<Integer> const &b)
-{
-   return boost::rational<Integer>(static_cast<Integer>(lcm(a.numerator(), b.numerator())), static_cast<Integer>(gcd(a.denominator(), b.denominator())));
-}
-/**
- * Knuth, The Art of Computer Programming: Volume 2, Third edition, 1998
- * Chapter 4.5.2, Algorithm C: Greatest common divisor of n integers.
- *
- * Knuth counts down from n to zero but we naturally go from first to last.
- * We also return the termination position because it might be useful to know.
- *
- * Partly by quirk, partly by design, this algorithm is defined for n = 1,
- * because the gcd of {x} is x. It is not defined for n = 0.
- *
- * @tparam  I   Input iterator.
- * @return  The gcd of the range and the iterator position at termination.
- */
-template <typename I>
-std::pair<typename std::iterator_traits<I>::value_type, I>
-gcd_range(I first, I last) BOOST_GCD_NOEXCEPT(I)
-{
-    BOOST_ASSERT(first != last);
-    typedef typename std::iterator_traits<I>::value_type T;
-
-    T d = *first;
-    ++first;
-    while (d != T(1) && first != last)
-    {
-        d = gcd(d, *first);
-        ++first;
-    }
-    return std::make_pair(d, first);
-}
-template <typename I>
-std::pair<typename std::iterator_traits<I>::value_type, I>
-lcm_range(I first, I last) BOOST_GCD_NOEXCEPT(I)
-{
-    BOOST_ASSERT(first != last);
-    typedef typename std::iterator_traits<I>::value_type T;
-
-    T d = *first;
-    ++first;
-    while (d != T(0) && first != last)
-    {
-        d = lcm(d, *first);
-        ++first;
-    }
-    return std::make_pair(d, first);
-}
-
-template < typename IntegerType >
-class gcd_evaluator
-#ifdef BOOST_NO_CXX11_HDR_FUNCTIONAL
-   : public std::binary_function<IntegerType, IntegerType, IntegerType>
-#endif
-{
-public:
-#ifndef BOOST_NO_CXX11_HDR_FUNCTIONAL
-   typedef IntegerType first_argument_type;
-   typedef IntegerType second_argument_type;
-   typedef IntegerType result_type;
-#endif
-   IntegerType operator()(IntegerType const &a, IntegerType const &b) const
-   {
-      return boost::integer::gcd(a, b);
-   }
-};
-
-template < typename IntegerType >
-class lcm_evaluator
-#ifdef BOOST_NO_CXX11_HDR_FUNCTIONAL
-   : public std::binary_function<IntegerType, IntegerType, IntegerType>
-#endif
-{
-public:
-#ifndef BOOST_NO_CXX11_HDR_FUNCTIONAL
-   typedef IntegerType first_argument_type;
-   typedef IntegerType second_argument_type;
-   typedef IntegerType result_type;
-#endif
-   IntegerType operator()(IntegerType const &a, IntegerType const &b)const
-   {
-      return boost::integer::lcm(a, b);
-   }
-};
-
-}  // namespace integer
-}  // namespace boost
-
-#ifdef BOOST_MSVC
-#pragma warning(pop)
-#endif
-
-#endif  // BOOST_INTEGER_COMMON_FACTOR_RT_HPP
diff --git a/src/boost/interprocess/allocators/allocator.hpp b/src/boost/interprocess/allocators/allocator.hpp
deleted file mode 100644
index 9a5bf326..00000000
--- a/src/boost/interprocess/allocators/allocator.hpp
+++ /dev/null
@@ -1,307 +0,0 @@
-///////////////////////////////////////////////////////////////////////////////
-//
-// (C) Copyright Ion Gaztanaga 2005-2012. Distributed under the Boost
-// 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/interprocess for documentation.
-//
-///////////////////////////////////////////////////////////////////////////////
-
-#ifndef BOOST_INTERPROCESS_ALLOCATOR_HPP
-#define BOOST_INTERPROCESS_ALLOCATOR_HPP
-
-#ifndef BOOST_CONFIG_HPP
-#  include <boost/config.hpp>
-#endif
-#
-#if defined(BOOST_HAS_PRAGMA_ONCE)
-#  pragma once
-#endif
-
-#include <boost/interprocess/detail/config_begin.hpp>
-#include <boost/interprocess/detail/workaround.hpp>
-
-#include <boost/intrusive/pointer_traits.hpp>
-
-#include <boost/interprocess/interprocess_fwd.hpp>
-#include <boost/interprocess/containers/allocation_type.hpp>
-#include <boost/container/detail/multiallocation_chain.hpp>
-#include <boost/interprocess/allocators/detail/allocator_common.hpp>
-#include <boost/interprocess/detail/utilities.hpp>
-#include <boost/interprocess/containers/version_type.hpp>
-#include <boost/interprocess/exceptions.hpp>
-#include <boost/assert.hpp>
-#include <boost/utility/addressof.hpp>
-#include <boost/interprocess/detail/type_traits.hpp>
-#include <boost/container/detail/placement_new.hpp>
-
-#include <cstddef>
-#include <stdexcept>
-
-//!\file
-//!Describes an allocator that allocates portions of fixed size
-//!memory buffer (shared memory, mapped file...)
-
-namespace boost {
-namespace interprocess {
-
-
-//!An STL compatible allocator that uses a segment manager as
-//!memory source. The internal pointer type will of the same type (raw, smart) as
-//!"typename SegmentManager::void_pointer" type. This allows
-//!placing the allocator in shared memory, memory mapped-files, etc...
-template<class T, class SegmentManager>
-class allocator
-{
-   public:
-   //Segment manager
-   typedef SegmentManager                                segment_manager;
-   typedef typename SegmentManager::void_pointer         void_pointer;
-
-   #if !defined(BOOST_INTERPROCESS_DOXYGEN_INVOKED)
-   private:
-
-   //Self type
-   typedef allocator<T, SegmentManager>   self_t;
-
-   //Pointer to void
-   typedef typename segment_manager::void_pointer  aux_pointer_t;
-
-   //Typedef to const void pointer
-   typedef typename boost::intrusive::
-      pointer_traits<aux_pointer_t>::template
-         rebind_pointer<const void>::type          cvoid_ptr;
-
-   //Pointer to the allocator
-   typedef typename boost::intrusive::
-      pointer_traits<cvoid_ptr>::template
-         rebind_pointer<segment_manager>::type          alloc_ptr_t;
-
-   //Not assignable from related allocator
-   template<class T2, class SegmentManager2>
-   allocator& operator=(const allocator<T2, SegmentManager2>&);
-
-   //Not assignable from other allocator
-   allocator& operator=(const allocator&);
-
-   //Pointer to the allocator
-   alloc_ptr_t mp_mngr;
-   #endif   //#ifndef BOOST_INTERPROCESS_DOXYGEN_INVOKED
-
-   public:
-   typedef T                                    value_type;
-   typedef typename boost::intrusive::
-      pointer_traits<cvoid_ptr>::template
-         rebind_pointer<T>::type                pointer;
-   typedef typename boost::intrusive::
-      pointer_traits<pointer>::template
-         rebind_pointer<const T>::type          const_pointer;
-   typedef typename ipcdetail::add_reference
-                     <value_type>::type         reference;
-   typedef typename ipcdetail::add_reference
-                     <const value_type>::type   const_reference;
-   typedef typename segment_manager::size_type               size_type;
-   typedef typename segment_manager::difference_type         difference_type;
-
-   typedef boost::interprocess::version_type<allocator, 2>   version;
-
-   #if !defined(BOOST_INTERPROCESS_DOXYGEN_INVOKED)
-
-   //Experimental. Don't use.
-   typedef boost::container::dtl::transform_multiallocation_chain
-      <typename SegmentManager::multiallocation_chain, T>multiallocation_chain;
-   #endif   //#ifndef BOOST_INTERPROCESS_DOXYGEN_INVOKED
-
-   //!Obtains an allocator that allocates
-   //!objects of type T2
-   template<class T2>
-   struct rebind
-   {
-      typedef allocator<T2, SegmentManager>     other;
-   };
-
-   //!Returns the segment manager.
-   //!Never throws
-   segment_manager* get_segment_manager()const
-   {  return ipcdetail::to_raw_pointer(mp_mngr);   }
-
-   //!Constructor from the segment manager.
-   //!Never throws
-   allocator(segment_manager *segment_mngr)
-      : mp_mngr(segment_mngr) { }
-
-   //!Constructor from other allocator.
-   //!Never throws
-   allocator(const allocator &other)
-      : mp_mngr(other.get_segment_manager()){ }
-
-   //!Constructor from related allocator.
-   //!Never throws
-   template<class T2>
-   allocator(const allocator<T2, SegmentManager> &other)
-      : mp_mngr(other.get_segment_manager()){}
-
-   //!Allocates memory for an array of count elements.
-   //!Throws boost::interprocess::bad_alloc if there is no enough memory
-   pointer allocate(size_type count, cvoid_ptr hint = 0)
-   {
-      (void)hint;
-      if(size_overflows<sizeof(T)>(count)){
-         throw bad_alloc();
-      }
-      return pointer(static_cast<value_type*>(mp_mngr->allocate(count*sizeof(T))));
-   }
-
-   //!Deallocates memory previously allocated.
-   //!Never throws
-   void deallocate(const pointer &ptr, size_type)
-   {  mp_mngr->deallocate((void*)ipcdetail::to_raw_pointer(ptr));  }
-
-   //!Returns the number of elements that could be allocated.
-   //!Never throws
-   size_type max_size() const
-   {  return mp_mngr->get_size()/sizeof(T);   }
-
-   //!Swap segment manager. Does not throw. If each allocator is placed in
-   //!different memory segments, the result is undefined.
-   friend void swap(self_t &alloc1, self_t &alloc2)
-   {  boost::adl_move_swap(alloc1.mp_mngr, alloc2.mp_mngr);   }
-
-   //!Returns maximum the number of objects the previously allocated memory
-   //!pointed by p can hold. This size only works for memory allocated with
-   //!allocate, allocation_command and allocate_many.
-   size_type size(const pointer &p) const
-   {
-      return (size_type)mp_mngr->size(ipcdetail::to_raw_pointer(p))/sizeof(T);
-   }
-
-   pointer allocation_command(boost::interprocess::allocation_type command,
-                           size_type limit_size, size_type &prefer_in_recvd_out_size, pointer &reuse)
-   {
-      value_type *reuse_raw = ipcdetail::to_raw_pointer(reuse);
-      pointer const p = mp_mngr->allocation_command(command, limit_size, prefer_in_recvd_out_size, reuse_raw);
-      reuse = reuse_raw;
-      return p;
-   }
-
-   //!Allocates many elements of size elem_size in a contiguous block
-   //!of memory. The minimum number to be allocated is min_elements,
-   //!the preferred and maximum number is
-   //!preferred_elements. The number of actually allocated elements is
-   //!will be assigned to received_size. The elements must be deallocated
-   //!with deallocate(...)
-   void allocate_many(size_type elem_size, size_type num_elements, multiallocation_chain &chain)
-   {
-      if(size_overflows<sizeof(T)>(elem_size)){
-         throw bad_alloc();
-      }
-      mp_mngr->allocate_many(elem_size*sizeof(T), num_elements, chain);
-   }
-
-   //!Allocates n_elements elements, each one of size elem_sizes[i]in a
-   //!contiguous block
-   //!of memory. The elements must be deallocated
-   void allocate_many(const size_type *elem_sizes, size_type n_elements, multiallocation_chain &chain)
-   {
-      mp_mngr->allocate_many(elem_sizes, n_elements, sizeof(T), chain);
-   }
-
-   //!Allocates many elements of size elem_size in a contiguous block
-   //!of memory. The minimum number to be allocated is min_elements,
-   //!the preferred and maximum number is
-   //!preferred_elements. The number of actually allocated elements is
-   //!will be assigned to received_size. The elements must be deallocated
-   //!with deallocate(...)
-   void deallocate_many(multiallocation_chain &chain)
-   {  mp_mngr->deallocate_many(chain); }
-
-   //!Allocates just one object. Memory allocated with this function
-   //!must be deallocated only with deallocate_one().
-   //!Throws boost::interprocess::bad_alloc if there is no enough memory
-   pointer allocate_one()
-   {  return this->allocate(1);  }
-
-   //!Allocates many elements of size == 1 in a contiguous block
-   //!of memory. The minimum number to be allocated is min_elements,
-   //!the preferred and maximum number is
-   //!preferred_elements. The number of actually allocated elements is
-   //!will be assigned to received_size. Memory allocated with this function
-   //!must be deallocated only with deallocate_one().
-   void allocate_individual(size_type num_elements, multiallocation_chain &chain)
-   {  this->allocate_many(1, num_elements, chain); }
-
-   //!Deallocates memory previously allocated with allocate_one().
-   //!You should never use deallocate_one to deallocate memory allocated
-   //!with other functions different from allocate_one(). Never throws
-   void deallocate_one(const pointer &p)
-   {  return this->deallocate(p, 1);  }
-
-   //!Allocates many elements of size == 1 in a contiguous block
-   //!of memory. The minimum number to be allocated is min_elements,
-   //!the preferred and maximum number is
-   //!preferred_elements. The number of actually allocated elements is
-   //!will be assigned to received_size. Memory allocated with this function
-   //!must be deallocated only with deallocate_one().
-   void deallocate_individual(multiallocation_chain &chain)
-   {  this->deallocate_many(chain); }
-
-   //!Returns address of mutable object.
-   //!Never throws
-   pointer address(reference value) const
-   {  return pointer(boost::addressof(value));  }
-
-   //!Returns address of non mutable object.
-   //!Never throws
-   const_pointer address(const_reference value) const
-   {  return const_pointer(boost::addressof(value));  }
-
-   //!Constructs an object
-   //!Throws if T's constructor throws
-   //!For backwards compatibility with libraries using C++03 allocators
-   template<class P>
-   void construct(const pointer &ptr, BOOST_FWD_REF(P) p)
-   {  ::new((void*)ipcdetail::to_raw_pointer(ptr), boost_container_new_t()) value_type(::boost::forward<P>(p));  }
-
-   //!Destroys object. Throws if object's
-   //!destructor throws
-   void destroy(const pointer &ptr)
-   {  BOOST_ASSERT(ptr != 0); (*ptr).~value_type();  }
-
-};
-
-//!Equality test for same type
-//!of allocator
-template<class T, class SegmentManager> inline
-bool operator==(const allocator<T , SegmentManager>  &alloc1,
-                const allocator<T, SegmentManager>  &alloc2)
-   {  return alloc1.get_segment_manager() == alloc2.get_segment_manager(); }
-
-//!Inequality test for same type
-//!of allocator
-template<class T, class SegmentManager> inline
-bool operator!=(const allocator<T, SegmentManager>  &alloc1,
-                const allocator<T, SegmentManager>  &alloc2)
-   {  return alloc1.get_segment_manager() != alloc2.get_segment_manager(); }
-
-}  //namespace interprocess {
-
-#if !defined(BOOST_INTERPROCESS_DOXYGEN_INVOKED)
-
-template<class T>
-struct has_trivial_destructor;
-
-template<class T, class SegmentManager>
-struct has_trivial_destructor
-   <boost::interprocess::allocator <T, SegmentManager> >
-{
-   static const bool value = true;
-};
-#endif   //#ifndef BOOST_INTERPROCESS_DOXYGEN_INVOKED
-
-}  //namespace boost {
-
-#include <boost/interprocess/detail/config_end.hpp>
-
-#endif   //BOOST_INTERPROCESS_ALLOCATOR_HPP
-
diff --git a/src/boost/interprocess/allocators/detail/allocator_common.hpp b/src/boost/interprocess/allocators/detail/allocator_common.hpp
deleted file mode 100644
index bb301ebf..00000000
--- a/src/boost/interprocess/allocators/detail/allocator_common.hpp
+++ /dev/null
@@ -1,857 +0,0 @@
-//////////////////////////////////////////////////////////////////////////////
-//
-// (C) Copyright Ion Gaztanaga 2008-2012. Distributed under the Boost
-// 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/interprocess for documentation.
-//
-//////////////////////////////////////////////////////////////////////////////
-
-#ifndef BOOST_INTERPROCESS_ALLOCATOR_DETAIL_ALLOCATOR_COMMON_HPP
-#define BOOST_INTERPROCESS_ALLOCATOR_DETAIL_ALLOCATOR_COMMON_HPP
-
-#ifndef BOOST_CONFIG_HPP
-#  include <boost/config.hpp>
-#endif
-#
-#if defined(BOOST_HAS_PRAGMA_ONCE)
-#  pragma once
-#endif
-
-#include <boost/interprocess/detail/config_begin.hpp>
-#include <boost/interprocess/detail/workaround.hpp>
-
-#include <boost/intrusive/pointer_traits.hpp>
-
-#include <boost/interprocess/interprocess_fwd.hpp>
-#include <boost/interprocess/detail/utilities.hpp> //to_raw_pointer
-#include <boost/utility/addressof.hpp> //boost::addressof
-#include <boost/assert.hpp>   //BOOST_ASSERT
-#include <boost/interprocess/exceptions.hpp> //bad_alloc
-#include <boost/interprocess/sync/scoped_lock.hpp> //scoped_lock
-#include <boost/interprocess/containers/allocation_type.hpp> //boost::interprocess::allocation_type
-#include <boost/container/detail/multiallocation_chain.hpp>
-#include <boost/interprocess/mem_algo/detail/mem_algo_common.hpp>
-#include <boost/interprocess/detail/segment_manager_helper.hpp>
-#include <boost/move/utility_core.hpp>
-#include <boost/interprocess/detail/type_traits.hpp>
-#include <boost/interprocess/detail/utilities.hpp>
-#include <boost/container/detail/placement_new.hpp>
-#include <boost/move/adl_move_swap.hpp>
-
-namespace boost {
-namespace interprocess {
-
-template <class T>
-struct sizeof_value
-{
-   static const std::size_t value = sizeof(T);
-};
-
-template <>
-struct sizeof_value<void>
-{
-   static const std::size_t value = sizeof(void*);
-};
-
-template <>
-struct sizeof_value<const void>
-{
-   static const std::size_t value = sizeof(void*);
-};
-
-template <>
-struct sizeof_value<volatile void>
-{
-   static const std::size_t value = sizeof(void*);
-};
-
-template <>
-struct sizeof_value<const volatile void>
-{
-   static const std::size_t value = sizeof(void*);
-};
-
-namespace ipcdetail {
-
-//!Object function that creates the node allocator if it is not created and
-//!increments reference count if it is already created
-template<class NodePool>
-struct get_or_create_node_pool_func
-{
-
-   //!This connects or constructs the unique instance of node_pool_t
-   //!Can throw boost::interprocess::bad_alloc
-   void operator()()
-   {
-      //Find or create the node_pool_t
-      mp_node_pool =    mp_segment_manager->template find_or_construct
-                        <NodePool>(boost::interprocess::unique_instance)(mp_segment_manager);
-      //If valid, increment link count
-      if(mp_node_pool != 0)
-         mp_node_pool->inc_ref_count();
-   }
-
-   //!Constructor. Initializes function
-   //!object parameters
-   get_or_create_node_pool_func(typename NodePool::segment_manager *mngr)
-      : mp_segment_manager(mngr){}
-
-   NodePool                            *mp_node_pool;
-   typename NodePool::segment_manager  *mp_segment_manager;
-};
-
-template<class NodePool>
-inline NodePool *get_or_create_node_pool(typename NodePool::segment_manager *mgnr)
-{
-   ipcdetail::get_or_create_node_pool_func<NodePool> func(mgnr);
-   mgnr->atomic_func(func);
-   return func.mp_node_pool;
-}
-
-//!Object function that decrements the reference count. If the count
-//!reaches to zero destroys the node allocator from memory.
-//!Never throws
-template<class NodePool>
-struct destroy_if_last_link_func
-{
-   //!Decrements reference count and destroys the object if there is no
-   //!more attached allocators. Never throws
-   void operator()()
-   {
-      //If not the last link return
-      if(mp_node_pool->dec_ref_count() != 0) return;
-
-      //Last link, let's destroy the segment_manager
-      mp_node_pool->get_segment_manager()->template destroy<NodePool>(boost::interprocess::unique_instance);
-   }
-
-   //!Constructor. Initializes function
-   //!object parameters
-   destroy_if_last_link_func(NodePool *pool)
-      : mp_node_pool(pool)
-   {}
-
-   NodePool                           *mp_node_pool;
-};
-
-//!Destruction function, initializes and executes destruction function
-//!object. Never throws
-template<class NodePool>
-inline void destroy_node_pool_if_last_link(NodePool *pool)
-{
-   //Get segment manager
-   typename NodePool::segment_manager *mngr = pool->get_segment_manager();
-   //Execute destruction functor atomically
-   destroy_if_last_link_func<NodePool>func(pool);
-   mngr->atomic_func(func);
-}
-
-template<class NodePool>
-class cache_impl
-{
-   typedef typename NodePool::segment_manager::
-      void_pointer                                          void_pointer;
-   typedef typename boost::intrusive::
-      pointer_traits<void_pointer>::template
-         rebind_pointer<NodePool>::type                     node_pool_ptr;
-   typedef typename NodePool::multiallocation_chain         multiallocation_chain;
-   typedef typename NodePool::segment_manager::size_type    size_type;
-   node_pool_ptr                 mp_node_pool;
-   multiallocation_chain         m_cached_nodes;
-   size_type                     m_max_cached_nodes;
-
-   public:
-   typedef typename NodePool::segment_manager            segment_manager;
-
-   cache_impl(segment_manager *segment_mngr, size_type max_cached_nodes)
-      : mp_node_pool(get_or_create_node_pool<NodePool>(segment_mngr))
-      , m_max_cached_nodes(max_cached_nodes)
-   {}
-
-   cache_impl(const cache_impl &other)
-      : mp_node_pool(other.get_node_pool())
-      , m_max_cached_nodes(other.get_max_cached_nodes())
-   {
-      mp_node_pool->inc_ref_count();
-   }
-
-   ~cache_impl()
-   {
-      this->deallocate_all_cached_nodes();
-      ipcdetail::destroy_node_pool_if_last_link(ipcdetail::to_raw_pointer(mp_node_pool));
-   }
-
-   NodePool *get_node_pool() const
-   {  return ipcdetail::to_raw_pointer(mp_node_pool); }
-
-   segment_manager *get_segment_manager() const
-   {  return mp_node_pool->get_segment_manager(); }
-
-   size_type get_max_cached_nodes() const
-   {  return m_max_cached_nodes; }
-
-   void *cached_allocation()
-   {
-      //If don't have any cached node, we have to get a new list of free nodes from the pool
-      if(m_cached_nodes.empty()){
-         mp_node_pool->allocate_nodes(m_max_cached_nodes/2, m_cached_nodes);
-      }
-      void *ret = ipcdetail::to_raw_pointer(m_cached_nodes.pop_front());
-      return ret;
-   }
-
-   void cached_allocation(size_type n, multiallocation_chain &chain)
-   {
-      size_type count = n, allocated(0);
-      BOOST_TRY{
-         //If don't have any cached node, we have to get a new list of free nodes from the pool
-         while(!m_cached_nodes.empty() && count--){
-            void *ret = ipcdetail::to_raw_pointer(m_cached_nodes.pop_front());
-            chain.push_back(ret);
-            ++allocated;
-         }
-
-         if(allocated != n){
-            mp_node_pool->allocate_nodes(n - allocated, chain);
-         }
-      }
-      BOOST_CATCH(...){
-         this->cached_deallocation(chain);
-         BOOST_RETHROW
-      } BOOST_CATCH_END
-   }
-
-   void cached_deallocation(void *ptr)
-   {
-      //Check if cache is full
-      if(m_cached_nodes.size() >= m_max_cached_nodes){
-         //This only occurs if this allocator deallocate memory allocated
-         //with other equal allocator. Since the cache is full, and more
-         //deallocations are probably coming, we'll make some room in cache
-         //in a single, efficient multi node deallocation.
-         this->priv_deallocate_n_nodes(m_cached_nodes.size() - m_max_cached_nodes/2);
-      }
-      m_cached_nodes.push_front(ptr);
-   }
-
-   void cached_deallocation(multiallocation_chain &chain)
-   {
-      m_cached_nodes.splice_after(m_cached_nodes.before_begin(), chain);
-
-      //Check if cache is full
-      if(m_cached_nodes.size() >= m_max_cached_nodes){
-         //This only occurs if this allocator deallocate memory allocated
-         //with other equal allocator. Since the cache is full, and more
-         //deallocations are probably coming, we'll make some room in cache
-         //in a single, efficient multi node deallocation.
-         this->priv_deallocate_n_nodes(m_cached_nodes.size() - m_max_cached_nodes/2);
-      }
-   }
-
-   //!Sets the new max cached nodes value. This can provoke deallocations
-   //!if "newmax" is less than current cached nodes. Never throws
-   void set_max_cached_nodes(size_type newmax)
-   {
-      m_max_cached_nodes = newmax;
-      this->priv_deallocate_remaining_nodes();
-   }
-
-   //!Frees all cached nodes.
-   //!Never throws
-   void deallocate_all_cached_nodes()
-   {
-      if(m_cached_nodes.empty()) return;
-      mp_node_pool->deallocate_nodes(m_cached_nodes);
-   }
-
-   private:
-   //!Frees all cached nodes at once.
-   //!Never throws
-   void priv_deallocate_remaining_nodes()
-   {
-      if(m_cached_nodes.size() > m_max_cached_nodes){
-         priv_deallocate_n_nodes(m_cached_nodes.size()-m_max_cached_nodes);
-      }
-   }
-
-   //!Frees n cached nodes at once. Never throws
-   void priv_deallocate_n_nodes(size_type n)
-   {
-      //This only occurs if this allocator deallocate memory allocated
-      //with other equal allocator. Since the cache is full, and more
-      //deallocations are probably coming, we'll make some room in cache
-      //in a single, efficient multi node deallocation.
-      size_type count(n);
-      typename multiallocation_chain::iterator it(m_cached_nodes.before_begin());
-      while(count--){
-         ++it;
-      }
-      multiallocation_chain chain;
-      chain.splice_after(chain.before_begin(), m_cached_nodes, m_cached_nodes.before_begin(), it, n);
-      //Deallocate all new linked list at once
-      mp_node_pool->deallocate_nodes(chain);
-   }
-
-   public:
-   void swap(cache_impl &other)
-   {
-      ::boost::adl_move_swap(mp_node_pool, other.mp_node_pool);
-      ::boost::adl_move_swap(m_cached_nodes, other.m_cached_nodes);
-      ::boost::adl_move_swap(m_max_cached_nodes, other.m_max_cached_nodes);
-   }
-};
-
-template<class Derived, class T, class SegmentManager>
-class array_allocation_impl
-{
-   const Derived *derived() const
-   {  return static_cast<const Derived*>(this); }
-   Derived *derived()
-   {  return static_cast<Derived*>(this); }
-
-   typedef typename SegmentManager::void_pointer         void_pointer;
-
-   public:
-   typedef typename boost::intrusive::
-      pointer_traits<void_pointer>::template
-         rebind_pointer<T>::type                         pointer;
-   typedef typename boost::intrusive::
-      pointer_traits<void_pointer>::template
-         rebind_pointer<const T>::type                   const_pointer;
-   typedef T                                             value_type;
-   typedef typename ipcdetail::add_reference
-                     <value_type>::type                  reference;
-   typedef typename ipcdetail::add_reference
-                     <const value_type>::type            const_reference;
-   typedef typename SegmentManager::size_type            size_type;
-   typedef typename SegmentManager::difference_type      difference_type;
-   typedef boost::container::dtl::transform_multiallocation_chain
-      <typename SegmentManager::multiallocation_chain, T>multiallocation_chain;
-
-
-   public:
-   //!Returns maximum the number of objects the previously allocated memory
-   //!pointed by p can hold. This size only works for memory allocated with
-   //!allocate, allocation_command and allocate_many.
-   size_type size(const pointer &p) const
-   {
-      return (size_type)this->derived()->get_segment_manager()->size(ipcdetail::to_raw_pointer(p))/sizeof(T);
-   }
-
-   pointer allocation_command(boost::interprocess::allocation_type command,
-                         size_type limit_size, size_type &prefer_in_recvd_out_size, pointer &reuse)
-   {
-      value_type *reuse_raw = ipcdetail::to_raw_pointer(reuse);
-      pointer const p = this->derived()->get_segment_manager()->allocation_command
-         (command, limit_size, prefer_in_recvd_out_size, reuse_raw);
-      reuse = reuse_raw;
-      return p;
-   }
-
-   //!Allocates many elements of size elem_size in a contiguous block
-   //!of memory. The minimum number to be allocated is min_elements,
-   //!the preferred and maximum number is
-   //!preferred_elements. The number of actually allocated elements is
-   //!will be assigned to received_size. The elements must be deallocated
-   //!with deallocate(...)
-   void allocate_many(size_type elem_size, size_type num_elements, multiallocation_chain &chain)
-   {
-      if(size_overflows<sizeof(T)>(elem_size)){
-         throw bad_alloc();
-      }
-      this->derived()->get_segment_manager()->allocate_many(elem_size*sizeof(T), num_elements, chain);
-   }
-
-   //!Allocates n_elements elements, each one of size elem_sizes[i]in a
-   //!contiguous block
-   //!of memory. The elements must be deallocated
-   void allocate_many(const size_type *elem_sizes, size_type n_elements, multiallocation_chain &chain)
-   {
-      this->derived()->get_segment_manager()->allocate_many(elem_sizes, n_elements, sizeof(T), chain);
-   }
-
-   //!Allocates many elements of size elem_size in a contiguous block
-   //!of memory. The minimum number to be allocated is min_elements,
-   //!the preferred and maximum number is
-   //!preferred_elements. The number of actually allocated elements is
-   //!will be assigned to received_size. The elements must be deallocated
-   //!with deallocate(...)
-   void deallocate_many(multiallocation_chain &chain)
-   {  this->derived()->get_segment_manager()->deallocate_many(chain); }
-
-   //!Returns the number of elements that could be
-   //!allocated. Never throws
-   size_type max_size() const
-   {  return this->derived()->get_segment_manager()->get_size()/sizeof(T);  }
-
-   //!Returns address of mutable object.
-   //!Never throws
-   pointer address(reference value) const
-   {  return pointer(boost::addressof(value));  }
-
-   //!Returns address of non mutable object.
-   //!Never throws
-   const_pointer address(const_reference value) const
-   {  return const_pointer(boost::addressof(value));  }
-
-   //!Constructs an object
-   //!Throws if T's constructor throws
-   //!For backwards compatibility with libraries using C++03 allocators
-   template<class P>
-   void construct(const pointer &ptr, BOOST_FWD_REF(P) p)
-   {  ::new((void*)ipcdetail::to_raw_pointer(ptr), boost_container_new_t()) value_type(::boost::forward<P>(p));  }
-
-   //!Destroys object. Throws if object's
-   //!destructor throws
-   void destroy(const pointer &ptr)
-   {  BOOST_ASSERT(ptr != 0); (*ptr).~value_type();  }
-};
-
-
-template<class Derived, unsigned int Version, class T, class SegmentManager>
-class node_pool_allocation_impl
-   :  public array_allocation_impl
-      < Derived
-      , T
-      , SegmentManager>
-{
-   const Derived *derived() const
-   {  return static_cast<const Derived*>(this); }
-   Derived *derived()
-   {  return static_cast<Derived*>(this); }
-
-   typedef typename SegmentManager::void_pointer         void_pointer;
-   typedef typename boost::intrusive::
-      pointer_traits<void_pointer>::template
-         rebind_pointer<const void>::type                cvoid_pointer;
-
-   public:
-   typedef typename boost::intrusive::
-      pointer_traits<void_pointer>::template
-         rebind_pointer<T>::type                         pointer;
-   typedef typename boost::intrusive::
-      pointer_traits<void_pointer>::template
-         rebind_pointer<const T>::type                   const_pointer;
-   typedef T                                             value_type;
-   typedef typename ipcdetail::add_reference
-                     <value_type>::type                  reference;
-   typedef typename ipcdetail::add_reference
-                     <const value_type>::type            const_reference;
-   typedef typename SegmentManager::size_type            size_type;
-   typedef typename SegmentManager::difference_type      difference_type;
-   typedef boost::container::dtl::transform_multiallocation_chain
-      <typename SegmentManager::multiallocation_chain, T>multiallocation_chain;
-
-
-   template <int Dummy>
-   struct node_pool
-   {
-      typedef typename Derived::template node_pool<0>::type type;
-      static type *get(void *p)
-      {  return static_cast<type*>(p); }
-   };
-
-   public:
-   //!Allocate memory for an array of count elements.
-   //!Throws boost::interprocess::bad_alloc if there is no enough memory
-   pointer allocate(size_type count, cvoid_pointer hint = 0)
-   {
-      (void)hint;
-      typedef typename node_pool<0>::type node_pool_t;
-      node_pool_t *pool = node_pool<0>::get(this->derived()->get_node_pool());
-      if(size_overflows<sizeof(T)>(count)){
-         throw bad_alloc();
-      }
-      else if(Version == 1 && count == 1){
-         return pointer(static_cast<value_type*>
-         (pool->allocate_node()));
-      }
-      else{
-         return pointer(static_cast<value_type*>
-            (pool->get_segment_manager()->allocate(count*sizeof(T))));
-      }
-   }
-
-   //!Deallocate allocated memory. Never throws
-   void deallocate(const pointer &ptr, size_type count)
-   {
-      (void)count;
-      typedef typename node_pool<0>::type node_pool_t;
-      node_pool_t *pool = node_pool<0>::get(this->derived()->get_node_pool());
-      if(Version == 1 && count == 1)
-         pool->deallocate_node(ipcdetail::to_raw_pointer(ptr));
-      else
-         pool->get_segment_manager()->deallocate((void*)ipcdetail::to_raw_pointer(ptr));
-   }
-
-   //!Allocates just one object. Memory allocated with this function
-   //!must be deallocated only with deallocate_one().
-   //!Throws boost::interprocess::bad_alloc if there is no enough memory
-   pointer allocate_one()
-   {
-      typedef typename node_pool<0>::type node_pool_t;
-      node_pool_t *pool = node_pool<0>::get(this->derived()->get_node_pool());
-      return pointer(static_cast<value_type*>(pool->allocate_node()));
-   }
-
-   //!Allocates many elements of size == 1 in a contiguous block
-   //!of memory. The minimum number to be allocated is min_elements,
-   //!the preferred and maximum number is
-   //!preferred_elements. The number of actually allocated elements is
-   //!will be assigned to received_size. Memory allocated with this function
-   //!must be deallocated only with deallocate_one().
-   void allocate_individual(size_type num_elements, multiallocation_chain &chain)
-   {
-      typedef typename node_pool<0>::type node_pool_t;
-      node_pool_t *pool = node_pool<0>::get(this->derived()->get_node_pool());
-      pool->allocate_nodes(num_elements, chain);
-   }
-
-   //!Deallocates memory previously allocated with allocate_one().
-   //!You should never use deallocate_one to deallocate memory allocated
-   //!with other functions different from allocate_one(). Never throws
-   void deallocate_one(const pointer &p)
-   {
-      typedef typename node_pool<0>::type node_pool_t;
-      node_pool_t *pool = node_pool<0>::get(this->derived()->get_node_pool());
-      pool->deallocate_node(ipcdetail::to_raw_pointer(p));
-   }
-
-   //!Allocates many elements of size == 1 in a contiguous block
-   //!of memory. The minimum number to be allocated is min_elements,
-   //!the preferred and maximum number is
-   //!preferred_elements. The number of actually allocated elements is
-   //!will be assigned to received_size. Memory allocated with this function
-   //!must be deallocated only with deallocate_one().
-   void deallocate_individual(multiallocation_chain &chain)
-   {
-      node_pool<0>::get(this->derived()->get_node_pool())->deallocate_nodes
-         (chain);
-   }
-
-   //!Deallocates all free blocks of the pool
-   void deallocate_free_blocks()
-   {  node_pool<0>::get(this->derived()->get_node_pool())->deallocate_free_blocks();  }
-
-   //!Deprecated, use deallocate_free_blocks.
-   //!Deallocates all free chunks of the pool.
-   void deallocate_free_chunks()
-   {  node_pool<0>::get(this->derived()->get_node_pool())->deallocate_free_blocks();  }
-};
-
-template<class T, class NodePool, unsigned int Version>
-class cached_allocator_impl
-   :  public array_allocation_impl
-         <cached_allocator_impl<T, NodePool, Version>, T, typename NodePool::segment_manager>
-{
-   cached_allocator_impl & operator=(const cached_allocator_impl& other);
-   typedef array_allocation_impl
-         < cached_allocator_impl
-            <T, NodePool, Version>
-         , T
-         , typename NodePool::segment_manager> base_t;
-
-   public:
-   typedef NodePool                                      node_pool_t;
-   typedef typename NodePool::segment_manager            segment_manager;
-   typedef typename segment_manager::void_pointer        void_pointer;
-   typedef typename boost::intrusive::
-      pointer_traits<void_pointer>::template
-         rebind_pointer<const void>::type                cvoid_pointer;
-   typedef typename base_t::pointer                      pointer;
-   typedef typename base_t::size_type                    size_type;
-   typedef typename base_t::multiallocation_chain        multiallocation_chain;
-   typedef typename base_t::value_type                   value_type;
-
-   public:
-   static const std::size_t DEFAULT_MAX_CACHED_NODES = 64;
-
-   cached_allocator_impl(segment_manager *segment_mngr, size_type max_cached_nodes)
-      : m_cache(segment_mngr, max_cached_nodes)
-   {}
-
-   cached_allocator_impl(const cached_allocator_impl &other)
-      : m_cache(other.m_cache)
-   {}
-
-   //!Copy constructor from related cached_adaptive_pool_base. If not present, constructs
-   //!a node pool. Increments the reference count of the associated node pool.
-   //!Can throw boost::interprocess::bad_alloc
-   template<class T2, class NodePool2>
-   cached_allocator_impl
-      (const cached_allocator_impl
-         <T2, NodePool2, Version> &other)
-      : m_cache(other.get_segment_manager(), other.get_max_cached_nodes())
-   {}
-
-   //!Returns a pointer to the node pool.
-   //!Never throws
-   node_pool_t* get_node_pool() const
-   {  return m_cache.get_node_pool();   }
-
-   //!Returns the segment manager.
-   //!Never throws
-   segment_manager* get_segment_manager()const
-   {  return m_cache.get_segment_manager();   }
-
-   //!Sets the new max cached nodes value. This can provoke deallocations
-   //!if "newmax" is less than current cached nodes. Never throws
-   void set_max_cached_nodes(size_type newmax)
-   {  m_cache.set_max_cached_nodes(newmax);   }
-
-   //!Returns the max cached nodes parameter.
-   //!Never throws
-   size_type get_max_cached_nodes() const
-   {  return m_cache.get_max_cached_nodes();   }
-
-   //!Allocate memory for an array of count elements.
-   //!Throws boost::interprocess::bad_alloc if there is no enough memory
-   pointer allocate(size_type count, cvoid_pointer hint = 0)
-   {
-      (void)hint;
-      void * ret;
-      if(size_overflows<sizeof(T)>(count)){
-         throw bad_alloc();
-      }
-      else if(Version == 1 && count == 1){
-         ret = m_cache.cached_allocation();
-      }
-      else{
-         ret = this->get_segment_manager()->allocate(count*sizeof(T));
-      }
-      return pointer(static_cast<T*>(ret));
-   }
-
-   //!Deallocate allocated memory. Never throws
-   void deallocate(const pointer &ptr, size_type count)
-   {
-      (void)count;
-      if(Version == 1 && count == 1){
-         m_cache.cached_deallocation(ipcdetail::to_raw_pointer(ptr));
-      }
-      else{
-         this->get_segment_manager()->deallocate((void*)ipcdetail::to_raw_pointer(ptr));
-      }
-   }
-
-   //!Allocates just one object. Memory allocated with this function
-   //!must be deallocated only with deallocate_one().
-   //!Throws boost::interprocess::bad_alloc if there is no enough memory
-   pointer allocate_one()
-   {  return pointer(static_cast<value_type*>(this->m_cache.cached_allocation()));   }
-
-   //!Allocates many elements of size == 1 in a contiguous block
-   //!of memory. The minimum number to be allocated is min_elements,
-   //!the preferred and maximum number is
-   //!preferred_elements. The number of actually allocated elements is
-   //!will be assigned to received_size. Memory allocated with this function
-   //!must be deallocated only with deallocate_one().
-   void allocate_individual(size_type num_elements, multiallocation_chain &chain)
-   {  this->m_cache.cached_allocation(num_elements, chain);   }
-
-   //!Deallocates memory previously allocated with allocate_one().
-   //!You should never use deallocate_one to deallocate memory allocated
-   //!with other functions different from allocate_one(). Never throws
-   void deallocate_one(const pointer &p)
-   {  this->m_cache.cached_deallocation(ipcdetail::to_raw_pointer(p)); }
-
-   //!Allocates many elements of size == 1 in a contiguous block
-   //!of memory. The minimum number to be allocated is min_elements,
-   //!the preferred and maximum number is
-   //!preferred_elements. The number of actually allocated elements is
-   //!will be assigned to received_size. Memory allocated with this function
-   //!must be deallocated only with deallocate_one().
-   void deallocate_individual(multiallocation_chain &chain)
-   {  m_cache.cached_deallocation(chain);  }
-
-   //!Deallocates all free blocks of the pool
-   void deallocate_free_blocks()
-   {  m_cache.get_node_pool()->deallocate_free_blocks();   }
-
-   //!Swaps allocators. Does not throw. If each allocator is placed in a
-   //!different shared memory segments, the result is undefined.
-   friend void swap(cached_allocator_impl &alloc1, cached_allocator_impl &alloc2)
-   {  ::boost::adl_move_swap(alloc1.m_cache, alloc2.m_cache);   }
-
-   void deallocate_cache()
-   {  m_cache.deallocate_all_cached_nodes(); }
-
-   //!Deprecated use deallocate_free_blocks.
-   void deallocate_free_chunks()
-   {  m_cache.get_node_pool()->deallocate_free_blocks();   }
-
-   #if !defined(BOOST_INTERPROCESS_DOXYGEN_INVOKED)
-   private:
-   cache_impl<node_pool_t> m_cache;
-   #endif   //!defined(BOOST_INTERPROCESS_DOXYGEN_INVOKED)
-};
-
-//!Equality test for same type of
-//!cached_allocator_impl
-template<class T, class N, unsigned int V> inline
-bool operator==(const cached_allocator_impl<T, N, V> &alloc1,
-                const cached_allocator_impl<T, N, V> &alloc2)
-   {  return alloc1.get_node_pool() == alloc2.get_node_pool(); }
-
-//!Inequality test for same type of
-//!cached_allocator_impl
-template<class T, class N, unsigned int V> inline
-bool operator!=(const cached_allocator_impl<T, N, V> &alloc1,
-                const cached_allocator_impl<T, N, V> &alloc2)
-   {  return alloc1.get_node_pool() != alloc2.get_node_pool(); }
-
-
-//!Pooled shared memory allocator using adaptive pool. Includes
-//!a reference count but the class does not delete itself, this is
-//!responsibility of user classes. Node size (NodeSize) and the number of
-//!nodes allocated per block (NodesPerBlock) are known at compile time
-template<class private_node_allocator_t>
-class shared_pool_impl
-   : public private_node_allocator_t
-{
- public:
-   //!Segment manager typedef
-   typedef typename private_node_allocator_t::
-      segment_manager                           segment_manager;
-   typedef typename private_node_allocator_t::
-      multiallocation_chain                     multiallocation_chain;
-   typedef typename private_node_allocator_t::
-     size_type                                 size_type;
-
- private:
-   typedef typename segment_manager::mutex_family::mutex_type mutex_type;
-
- public:
-   //!Constructor from a segment manager. Never throws
-   shared_pool_impl(segment_manager *segment_mngr)
-      : private_node_allocator_t(segment_mngr)
-   {}
-
-   //!Destructor. Deallocates all allocated blocks. Never throws
-   ~shared_pool_impl()
-   {}
-
-   //!Allocates array of count elements. Can throw boost::interprocess::bad_alloc
-   void *allocate_node()
-   {
-      //-----------------------
-      boost::interprocess::scoped_lock<mutex_type> guard(m_header);
-      //-----------------------
-      return private_node_allocator_t::allocate_node();
-   }
-
-   //!Deallocates an array pointed by ptr. Never throws
-   void deallocate_node(void *ptr)
-   {
-      //-----------------------
-      boost::interprocess::scoped_lock<mutex_type> guard(m_header);
-      //-----------------------
-      private_node_allocator_t::deallocate_node(ptr);
-   }
-
-   //!Allocates n nodes.
-   //!Can throw boost::interprocess::bad_alloc
-   void allocate_nodes(const size_type n, multiallocation_chain &chain)
-   {
-      //-----------------------
-      boost::interprocess::scoped_lock<mutex_type> guard(m_header);
-      //-----------------------
-      private_node_allocator_t::allocate_nodes(n, chain);
-   }
-
-   //!Deallocates a linked list of nodes ending in null pointer. Never throws
-   void deallocate_nodes(multiallocation_chain &nodes, size_type num)
-   {
-      //-----------------------
-      boost::interprocess::scoped_lock<mutex_type> guard(m_header);
-      //-----------------------
-      private_node_allocator_t::deallocate_nodes(nodes, num);
-   }
-
-   //!Deallocates the nodes pointed by the multiallocation iterator. Never throws
-   void deallocate_nodes(multiallocation_chain &chain)
-   {
-      //-----------------------
-      boost::interprocess::scoped_lock<mutex_type> guard(m_header);
-      //-----------------------
-      private_node_allocator_t::deallocate_nodes(chain);
-   }
-
-   //!Deallocates all the free blocks of memory. Never throws
-   void deallocate_free_blocks()
-   {
-      //-----------------------
-      boost::interprocess::scoped_lock<mutex_type> guard(m_header);
-      //-----------------------
-      private_node_allocator_t::deallocate_free_blocks();
-   }
-
-   //!Deallocates all used memory from the common pool.
-   //!Precondition: all nodes allocated from this pool should
-   //!already be deallocated. Otherwise, undefined behavior. Never throws
-   void purge_blocks()
-   {
-      //-----------------------
-      boost::interprocess::scoped_lock<mutex_type> guard(m_header);
-      //-----------------------
-      private_node_allocator_t::purge_blocks();
-   }
-
-   //!Increments internal reference count and returns new count. Never throws
-   size_type inc_ref_count()
-   {
-      //-----------------------
-      boost::interprocess::scoped_lock<mutex_type> guard(m_header);
-      //-----------------------
-      return ++m_header.m_usecount;
-   }
-
-   //!Decrements internal reference count and returns new count. Never throws
-   size_type dec_ref_count()
-   {
-      //-----------------------
-      boost::interprocess::scoped_lock<mutex_type> guard(m_header);
-      //-----------------------
-      BOOST_ASSERT(m_header.m_usecount > 0);
-      return --m_header.m_usecount;
-   }
-
-   //!Deprecated, use deallocate_free_blocks.
-   void deallocate_free_chunks()
-   {
-      //-----------------------
-      boost::interprocess::scoped_lock<mutex_type> guard(m_header);
-      //-----------------------
-      private_node_allocator_t::deallocate_free_blocks();
-   }
-
-   //!Deprecated, use purge_blocks.
-   void purge_chunks()
-   {
-      //-----------------------
-      boost::interprocess::scoped_lock<mutex_type> guard(m_header);
-      //-----------------------
-      private_node_allocator_t::purge_blocks();
-   }
-
-   private:
-   //!This struct includes needed data and derives from
-   //!the mutex type to allow EBO when using null_mutex
-   struct header_t : mutex_type
-   {
-      size_type m_usecount;    //Number of attached allocators
-
-      header_t()
-      :  m_usecount(0) {}
-   } m_header;
-};
-
-}  //namespace ipcdetail {
-}  //namespace interprocess {
-}  //namespace boost {
-
-#include <boost/interprocess/detail/config_end.hpp>
-
-#endif   //#ifndef BOOST_INTERPROCESS_ALLOCATOR_DETAIL_ALLOCATOR_COMMON_HPP
diff --git a/src/boost/interprocess/containers/allocation_type.hpp b/src/boost/interprocess/containers/allocation_type.hpp
deleted file mode 100644
index d99b7ab5..00000000
--- a/src/boost/interprocess/containers/allocation_type.hpp
+++ /dev/null
@@ -1,44 +0,0 @@
-//////////////////////////////////////////////////////////////////////////////
-//
-// (C) Copyright Ion Gaztanaga 2008-2012. Distributed under the Boost
-// 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/interprocess for documentation.
-//
-//////////////////////////////////////////////////////////////////////////////
-
-#ifndef BOOST_INTERPROCESS_CONTAINERS_ALLOCATION_TYPE_HPP
-#define BOOST_INTERPROCESS_CONTAINERS_ALLOCATION_TYPE_HPP
-
-#ifndef BOOST_CONFIG_HPP
-#  include <boost/config.hpp>
-#endif
-#
-#if defined(BOOST_HAS_PRAGMA_ONCE)
-#  pragma once
-#endif
-
-#include <boost/interprocess/detail/config_begin.hpp>
-#include <boost/container/detail/allocation_type.hpp>
-
-namespace boost {
-namespace interprocess {
-
-#if !defined(BOOST_INTERPROCESS_DOXYGEN_INVOKED)
-using boost::container::allocation_type;
-#endif   //#ifndef BOOST_INTERPROCESS_DOXYGEN_INVOKED
-static const allocation_type allocate_new       = boost::container::allocate_new;
-static const allocation_type expand_fwd         = boost::container::expand_fwd;
-static const allocation_type expand_bwd         = boost::container::expand_bwd;
-static const allocation_type shrink_in_place    = boost::container::shrink_in_place;
-static const allocation_type try_shrink_in_place= boost::container::try_shrink_in_place;
-static const allocation_type nothrow_allocation = boost::container::nothrow_allocation;
-static const allocation_type zero_memory        = boost::container::zero_memory;
-
-}  //namespace interprocess {
-}  //namespace boost {
-
-#include <boost/interprocess/detail/config_end.hpp>
-
-#endif //   #ifndef  BOOST_INTERPROCESS_CONTAINERS_ALLOCATION_TYPE_HPP
diff --git a/src/boost/interprocess/containers/version_type.hpp b/src/boost/interprocess/containers/version_type.hpp
deleted file mode 100644
index 68850729..00000000
--- a/src/boost/interprocess/containers/version_type.hpp
+++ /dev/null
@@ -1,37 +0,0 @@
-//////////////////////////////////////////////////////////////////////////////
-//
-// (C) Copyright Ion Gaztanaga 2008-2012. Distributed under the Boost
-// 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/interprocess for documentation.
-//
-//////////////////////////////////////////////////////////////////////////////
-
-#ifndef BOOST_INTERPROCESS_CONTAINERS_VERSION_TYPE_HPP
-#define BOOST_INTERPROCESS_CONTAINERS_VERSION_TYPE_HPP
-
-#ifndef BOOST_CONFIG_HPP
-#  include <boost/config.hpp>
-#endif
-#
-#if defined(BOOST_HAS_PRAGMA_ONCE)
-#  pragma once
-#endif
-
-#include <boost/interprocess/detail/config_begin.hpp>
-#include <boost/container/detail/version_type.hpp>
-
-namespace boost {
-namespace interprocess {
-
-using boost::container::dtl::version_type;
-using boost::container::dtl::version;
-
-}  //namespace interprocess {
-}  //namespace boost {
-
-#include <boost/interprocess/detail/config_end.hpp>
-
-#endif //   #ifndef  BOOST_INTERPROCESS_CONTAINERS_VERSION_TYPE_HPP
-
diff --git a/src/boost/interprocess/creation_tags.hpp b/src/boost/interprocess/creation_tags.hpp
deleted file mode 100644
index faf4e6f2..00000000
--- a/src/boost/interprocess/creation_tags.hpp
+++ /dev/null
@@ -1,85 +0,0 @@
-//////////////////////////////////////////////////////////////////////////////
-//
-// (C) Copyright Ion Gaztanaga 2005-2012. Distributed under the Boost
-// 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/interprocess for documentation.
-//
-//////////////////////////////////////////////////////////////////////////////
-
-#ifndef BOOST_INTERPROCESS_CREATION_TAGS_HPP
-#define BOOST_INTERPROCESS_CREATION_TAGS_HPP
-
-#ifndef BOOST_CONFIG_HPP
-#  include <boost/config.hpp>
-#endif
-#
-#if defined(BOOST_HAS_PRAGMA_ONCE)
-#  pragma once
-#endif
-
-#include <boost/interprocess/detail/config_begin.hpp>
-#include <boost/interprocess/detail/workaround.hpp>
-
-namespace boost {
-namespace interprocess {
-
-//!Tag to indicate that the resource must
-//!be only created
-struct create_only_t {};
-
-//!Tag to indicate that the resource must
-//!be only opened
-struct open_only_t {};
-
-//!Tag to indicate that the resource must
-//!be only opened for reading
-struct open_read_only_t {};
-
-//!Tag to indicate that the resource must
-//!be only opened privately for reading
-struct open_read_private_t {};
-
-//!Tag to indicate that the resource must
-//!be only opened for reading
-struct open_copy_on_write_t {};
-
-//!Tag to indicate that the resource must
-//!be created. If already created, it must be opened.
-struct open_or_create_t {};
-
-//!Value to indicate that the resource must
-//!be only created
-static const create_only_t    create_only    = create_only_t();
-
-//!Value to indicate that the resource must
-//!be only opened
-static const open_only_t      open_only      = open_only_t();
-
-//!Value to indicate that the resource must
-//!be only opened for reading
-static const open_read_only_t open_read_only = open_read_only_t();
-
-//!Value to indicate that the resource must
-//!be created. If already created, it must be opened.
-static const open_or_create_t open_or_create = open_or_create_t();
-
-//!Value to indicate that the resource must
-//!be only opened for reading
-static const open_copy_on_write_t open_copy_on_write = open_copy_on_write_t();
-
-namespace ipcdetail {
-
-enum create_enum_t
-{  DoCreate, DoOpen, DoOpenOrCreate   };
-
-}  //namespace ipcdetail {
-
-}  //namespace interprocess {
-}  //namespace boost {
-
-#include <boost/interprocess/detail/config_end.hpp>
-
-#endif   //#ifndef BOOST_INTERPROCESS_CREATION_TAGS_HPP
-
diff --git a/src/boost/interprocess/detail/atomic.hpp b/src/boost/interprocess/detail/atomic.hpp
deleted file mode 100644
index f177305b..00000000
--- a/src/boost/interprocess/detail/atomic.hpp
+++ /dev/null
@@ -1,674 +0,0 @@
-//////////////////////////////////////////////////////////////////////////////
-//
-// (C) Copyright Ion Gaztanaga 2006-2012
-// (C) Copyright Markus Schoepflin 2007
-// (C) Copyright Bryce Lelbach 2010
-//
-// Distributed under the Boost 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/interprocess for documentation.
-//
-//////////////////////////////////////////////////////////////////////////////
-
-#ifndef BOOST_INTERPROCESS_DETAIL_ATOMIC_HPP
-#define BOOST_INTERPROCESS_DETAIL_ATOMIC_HPP
-
-#ifndef BOOST_CONFIG_HPP
-#  include <boost/config.hpp>
-#endif
-#
-#if defined(BOOST_HAS_PRAGMA_ONCE)
-#  pragma once
-#endif
-
-#include <boost/interprocess/detail/config_begin.hpp>
-#include <boost/interprocess/detail/workaround.hpp>
-#include <boost/cstdint.hpp>
-
-#if !defined(_AIX)
-#define BOOST_INTERPROCESS_DETAIL_PPC_ASM_LABEL(label) label ":\n\t"
-#define BOOST_INTERPROCESS_DETAIL_PPC_ASM_JUMP(insn, label, offset) insn " " label "\n\t"
-#else
-#define BOOST_INTERPROCESS_DETAIL_PPC_ASM_LABEL(label)
-#define BOOST_INTERPROCESS_DETAIL_PPC_ASM_JUMP(insn, label, offset) insn " $" offset "\n\t"
-#endif
-
-namespace boost{
-namespace interprocess{
-namespace ipcdetail{
-
-//! Atomically increment an boost::uint32_t by 1
-//! "mem": pointer to the object
-//! Returns the old value pointed to by mem
-inline boost::uint32_t atomic_inc32(volatile boost::uint32_t *mem);
-
-//! Atomically read an boost::uint32_t from memory
-inline boost::uint32_t atomic_read32(volatile boost::uint32_t *mem);
-
-//! Atomically set an boost::uint32_t in memory
-//! "mem": pointer to the object
-//! "param": val value that the object will assume
-inline void atomic_write32(volatile boost::uint32_t *mem, boost::uint32_t val);
-
-//! Compare an boost::uint32_t's value with "cmp".
-//! If they are the same swap the value with "with"
-//! "mem": pointer to the value
-//! "with": what to swap it with
-//! "cmp": the value to compare it to
-//! Returns the old value of *mem
-inline boost::uint32_t atomic_cas32
-   (volatile boost::uint32_t *mem, boost::uint32_t with, boost::uint32_t cmp);
-
-}  //namespace ipcdetail{
-}  //namespace interprocess{
-}  //namespace boost{
-
-#if defined (BOOST_INTERPROCESS_WINDOWS)
-
-#include <boost/interprocess/detail/win32_api.hpp>
-
-#if defined( _MSC_VER )
-   extern "C" void _ReadWriteBarrier(void);
-   #pragma intrinsic(_ReadWriteBarrier)
-
-#define BOOST_INTERPROCESS_READ_WRITE_BARRIER \
-            BOOST_INTERPROCESS_DISABLE_DEPRECATED_WARNING \
-            _ReadWriteBarrier() \
-            BOOST_INTERPROCESS_RESTORE_WARNING
-
-#elif defined(__GNUC__)
-   #if (__GNUC__ * 10000 + __GNUC_MINOR__ * 100 + __GNUC_PATCHLEVEL__) > 40100
-      #define BOOST_INTERPROCESS_READ_WRITE_BARRIER __sync_synchronize()
-   #else
-      #define BOOST_INTERPROCESS_READ_WRITE_BARRIER __asm__ __volatile__("" : : : "memory")
-   #endif
-#endif
-
-namespace boost{
-namespace interprocess{
-namespace ipcdetail{
-
-//! Atomically decrement an boost::uint32_t by 1
-//! "mem": pointer to the atomic value
-//! Returns the old value pointed to by mem
-inline boost::uint32_t atomic_dec32(volatile boost::uint32_t *mem)
-{  return (boost::uint32_t)winapi::interlocked_decrement(reinterpret_cast<volatile long*>(mem)) + 1;  }
-
-//! Atomically increment an apr_uint32_t by 1
-//! "mem": pointer to the object
-//! Returns the old value pointed to by mem
-inline boost::uint32_t atomic_inc32(volatile boost::uint32_t *mem)
-{  return (boost::uint32_t)winapi::interlocked_increment(reinterpret_cast<volatile long*>(mem))-1;  }
-
-//! Atomically read an boost::uint32_t from memory
-inline boost::uint32_t atomic_read32(volatile boost::uint32_t *mem)
-{
-    const boost::uint32_t val = *mem;
-    BOOST_INTERPROCESS_READ_WRITE_BARRIER;
-    return val;
-}
-
-//! Atomically set an boost::uint32_t in memory
-//! "mem": pointer to the object
-//! "param": val value that the object will assume
-inline void atomic_write32(volatile boost::uint32_t *mem, boost::uint32_t val)
-{  winapi::interlocked_exchange(reinterpret_cast<volatile long*>(mem), (long)val);  }
-
-//! Compare an boost::uint32_t's value with "cmp".
-//! If they are the same swap the value with "with"
-//! "mem": pointer to the value
-//! "with": what to swap it with
-//! "cmp": the value to compare it to
-//! Returns the old value of *mem
-inline boost::uint32_t atomic_cas32
-   (volatile boost::uint32_t *mem, boost::uint32_t with, boost::uint32_t cmp)
-{  return (boost::uint32_t)winapi::interlocked_compare_exchange(reinterpret_cast<volatile long*>(mem), (long)with, (long)cmp);  }
-
-}  //namespace ipcdetail{
-}  //namespace interprocess{
-}  //namespace boost{
-
-#elif defined(__GNUC__) && (defined(__i386__) || defined(__x86_64__)) && !defined(_CRAYC)
-
-namespace boost {
-namespace interprocess {
-namespace ipcdetail{
-
-//! Compare an boost::uint32_t's value with "cmp".
-//! If they are the same swap the value with "with"
-//! "mem": pointer to the value
-//! "with" what to swap it with
-//! "cmp": the value to compare it to
-//! Returns the old value of *mem
-inline boost::uint32_t atomic_cas32
-   (volatile boost::uint32_t *mem, boost::uint32_t with, boost::uint32_t cmp)
-{
-   boost::uint32_t prev = cmp;
-   // This version by Mans Rullgard of Pathscale
-   __asm__ __volatile__ ( "lock\n\t"
-                          "cmpxchg %2,%0"
-                        : "+m"(*mem), "+a"(prev)
-                        : "r"(with)
-                        : "cc");
-
-   return prev;
-}
-
-//! Atomically add 'val' to an boost::uint32_t
-//! "mem": pointer to the object
-//! "val": amount to add
-//! Returns the old value pointed to by mem
-inline boost::uint32_t atomic_add32
-   (volatile boost::uint32_t *mem, boost::uint32_t val)
-{
-   // int r = *pw;
-   // *mem += val;
-   // return r;
-   boost::uint32_t r;
-
-   asm volatile
-   (
-      "lock\n\t"
-      "xadd %1, %0":
-      "+m"( *mem ), "=r"( r ): // outputs (%0, %1)
-      "1"( val ): // inputs (%2 == %1)
-      "memory", "cc" // clobbers
-   );
-
-   return r;
-}
-
-//! Atomically increment an apr_uint32_t by 1
-//! "mem": pointer to the object
-//! Returns the old value pointed to by mem
-inline boost::uint32_t atomic_inc32(volatile boost::uint32_t *mem)
-{  return atomic_add32(mem, 1);  }
-
-//! Atomically decrement an boost::uint32_t by 1
-//! "mem": pointer to the atomic value
-//! Returns the old value pointed to by mem
-inline boost::uint32_t atomic_dec32(volatile boost::uint32_t *mem)
-{  return atomic_add32(mem, (boost::uint32_t)-1);  }
-
-//! Atomically read an boost::uint32_t from memory
-inline boost::uint32_t atomic_read32(volatile boost::uint32_t *mem)
-{
-   const boost::uint32_t val = *mem;
-   __asm__ __volatile__ ( "" ::: "memory" );
-   return val;
-}
-
-//! Atomically set an boost::uint32_t in memory
-//! "mem": pointer to the object
-//! "param": val value that the object will assume
-inline void atomic_write32(volatile boost::uint32_t *mem, boost::uint32_t val)
-{
-   __asm__ __volatile__
-   (
-      "xchgl %0, %1"
-      : "+r" (val), "+m" (*mem)
-      :: "memory"
-   );
-}
-
-}  //namespace ipcdetail{
-}  //namespace interprocess{
-}  //namespace boost{
-
-#elif defined(__GNUC__) && (defined(__PPC__) || defined(__ppc__))
-
-namespace boost {
-namespace interprocess {
-namespace ipcdetail{
-
-//! Atomically add 'val' to an boost::uint32_t
-//! "mem": pointer to the object
-//! "val": amount to add
-//! Returns the old value pointed to by mem
-inline boost::uint32_t atomic_add32(volatile boost::uint32_t *mem, boost::uint32_t val)
-{
-   boost::uint32_t prev, temp;
-
-   asm volatile
-     (
-         BOOST_INTERPROCESS_DETAIL_PPC_ASM_LABEL("1")
-         "lwarx  %0,0,%2\n\t"
-         "add    %1,%0,%3\n\t"
-         "stwcx. %1,0,%2\n\t"
-         BOOST_INTERPROCESS_DETAIL_PPC_ASM_JUMP("bne-", "1b", "-12")
-         : "=&r" (prev), "=&r" (temp)
-         : "b" (mem), "r" (val)
-         : "cc", "memory"
-      );
-   return prev;
-}
-
-//! Compare an boost::uint32_t's value with "cmp".
-//! If they are the same swap the value with "with"
-//! "mem": pointer to the value
-//! "with" what to swap it with
-//! "cmp": the value to compare it to
-//! Returns the old value of *mem
-inline boost::uint32_t atomic_cas32
-   (volatile boost::uint32_t *mem, boost::uint32_t with, boost::uint32_t cmp)
-{
-   boost::uint32_t prev;
-
-   asm volatile
-     (
-         BOOST_INTERPROCESS_DETAIL_PPC_ASM_LABEL("1")
-         "lwarx  %0,0,%1\n\t"
-         "cmpw   %0,%3\n\t"
-         BOOST_INTERPROCESS_DETAIL_PPC_ASM_JUMP("bne-", "2f", "+12")
-         "stwcx. %2,0,%1\n\t"
-         BOOST_INTERPROCESS_DETAIL_PPC_ASM_JUMP("bne-", "1b", "-16")
-         BOOST_INTERPROCESS_DETAIL_PPC_ASM_LABEL("2")
-         : "=&r"(prev)
-	 : "b" (mem), "r" (with), "r" (cmp)
-	 : "cc", "memory"
-      );
-   return prev;
-}
-
-//! Atomically increment an apr_uint32_t by 1
-//! "mem": pointer to the object
-//! Returns the old value pointed to by mem
-inline boost::uint32_t atomic_inc32(volatile boost::uint32_t *mem)
-{  return atomic_add32(mem, 1);  }
-
-//! Atomically decrement an boost::uint32_t by 1
-//! "mem": pointer to the atomic value
-//! Returns the old value pointed to by mem
-inline boost::uint32_t atomic_dec32(volatile boost::uint32_t *mem)
-{  return atomic_add32(mem, boost::uint32_t(-1u));  }
-
-//! Atomically read an boost::uint32_t from memory
-inline boost::uint32_t atomic_read32(volatile boost::uint32_t *mem)
-{
-   const boost::uint32_t val = *mem;
-   __asm__ __volatile__ ( "" ::: "memory" );
-   return val;
-}
-
-//! Atomically set an boost::uint32_t in memory
-//! "mem": pointer to the object
-//! "param": val value that the object will assume
-inline void atomic_write32(volatile boost::uint32_t *mem, boost::uint32_t val)
-{  *mem = val; }
-
-}  //namespace ipcdetail{
-}  //namespace interprocess{
-}  //namespace boost{
-
-#elif (defined(sun) || defined(__sun))
-
-#include <atomic.h>
-
-namespace boost{
-namespace interprocess{
-namespace ipcdetail{
-
-//! Atomically add 'val' to an boost::uint32_t
-//! "mem": pointer to the object
-//! "val": amount to add
-//! Returns the old value pointed to by mem
-inline boost::uint32_t atomic_add32(volatile boost::uint32_t *mem, boost::uint32_t val)
-{   return atomic_add_32_nv(reinterpret_cast<volatile ::uint32_t*>(mem), (int32_t)val) - val;   }
-
-//! Compare an boost::uint32_t's value with "cmp".
-//! If they are the same swap the value with "with"
-//! "mem": pointer to the value
-//! "with" what to swap it with
-//! "cmp": the value to compare it to
-//! Returns the old value of *mem
-inline boost::uint32_t atomic_cas32
-   (volatile boost::uint32_t *mem, boost::uint32_t with, boost::uint32_t cmp)
-{  return atomic_cas_32(reinterpret_cast<volatile ::uint32_t*>(mem), cmp, with);  }
-
-//! Atomically increment an apr_uint32_t by 1
-//! "mem": pointer to the object
-//! Returns the old value pointed to by mem
-inline boost::uint32_t atomic_inc32(volatile boost::uint32_t *mem)
-{  return atomic_add_32_nv(reinterpret_cast<volatile ::uint32_t*>(mem), 1) - 1; }
-
-//! Atomically decrement an boost::uint32_t by 1
-//! "mem": pointer to the atomic value
-//! Returns the old value pointed to by mem
-inline boost::uint32_t atomic_dec32(volatile boost::uint32_t *mem)
-{  return atomic_add_32_nv(reinterpret_cast<volatile ::uint32_t*>(mem), (boost::uint32_t)-1) + 1; }
-
-//! Atomically read an boost::uint32_t from memory
-inline boost::uint32_t atomic_read32(volatile boost::uint32_t *mem)
-{  return *mem;   }
-
-//! Atomically set an boost::uint32_t in memory
-//! "mem": pointer to the object
-//! "param": val value that the object will assume
-inline void atomic_write32(volatile boost::uint32_t *mem, boost::uint32_t val)
-{  *mem = val; }
-
-}  //namespace ipcdetail{
-}  //namespace interprocess{
-}  //namespace boost{
-
-#elif defined(__osf__) && defined(__DECCXX)
-
-#include <machine/builtins.h>
-#include <c_asm.h>
-
-namespace boost{
-namespace interprocess{
-namespace ipcdetail{
-
-//! Atomically decrement a uint32_t by 1
-//! "mem": pointer to the atomic value
-//! Returns the old value pointed to by mem
-//! Acquire, memory barrier after decrement.
-inline boost::uint32_t atomic_dec32(volatile boost::uint32_t *mem)
-{  boost::uint32_t old_val = __ATOMIC_DECREMENT_LONG(mem); __MB(); return old_val; }
-
-//! Atomically increment a uint32_t by 1
-//! "mem": pointer to the object
-//! Returns the old value pointed to by mem
-//! Release, memory barrier before increment.
-inline boost::uint32_t atomic_inc32(volatile boost::uint32_t *mem)
-{  __MB(); return __ATOMIC_INCREMENT_LONG(mem); }
-
-// Rational for the implementation of the atomic read and write functions.
-//
-// 1. The Alpha Architecture Handbook requires that access to a byte,
-// an aligned word, an aligned longword, or an aligned quadword is
-// atomic. (See 'Alpha Architecture Handbook', version 4, chapter 5.2.2.)
-//
-// 2. The CXX User's Guide states that volatile quantities are accessed
-// with single assembler instructions, and that a compilation error
-// occurs when declaring a quantity as volatile which is not properly
-// aligned.
-
-//! Atomically read an boost::uint32_t from memory
-//! Acquire, memory barrier after load.
-inline boost::uint32_t atomic_read32(volatile boost::uint32_t *mem)
-{  boost::uint32_t old_val = *mem; __MB(); return old_val;  }
-
-//! Atomically set an boost::uint32_t in memory
-//! "mem": pointer to the object
-//! "param": val value that the object will assume
-//! Release, memory barrier before store.
-inline void atomic_write32(volatile boost::uint32_t *mem, boost::uint32_t val)
-{  __MB(); *mem = val; }
-
-//! Compare an boost::uint32_t's value with "cmp".
-//! If they are the same swap the value with "with"
-//! "mem": pointer to the value
-//! "with" what to swap it with
-//! "cmp": the value to compare it to
-//! Returns the old value of *mem
-//! Memory barrier between load and store.
-inline boost::uint32_t atomic_cas32(
-  volatile boost::uint32_t *mem, boost::uint32_t with, boost::uint32_t cmp)
-{
-  // Note:
-  //
-  // Branch prediction prefers backward branches, and the Alpha Architecture
-  // Handbook explicitely states that the loop should not be implemented like
-  // it is below. (See chapter 4.2.5.) Therefore the code should probably look
-  // like this:
-  //
-  // return asm(
-  //   "10: ldl_l %v0,(%a0) ;"
-  //   "    cmpeq %v0,%a2,%t0 ;"
-  //   "    beq %t0,20f ;"
-  //   "    mb ;"
-  //   "    mov %a1,%t0 ;"
-  //   "    stl_c %t0,(%a0) ;"
-  //   "    beq %t0,30f ;"
-  //   "20: ret ;"
-  //   "30: br 10b;",
-  //   mem, with, cmp);
-  //
-  // But as the compiler always transforms this into the form where a backward
-  // branch is taken on failure, we can as well implement it in the straight
-  // forward form, as this is what it will end up in anyway.
-
-  return asm(
-    "10: ldl_l %v0,(%a0) ;"    // load prev value from mem and lock mem
-    "    cmpeq %v0,%a2,%t0 ;"  // compare with given value
-    "    beq %t0,20f ;"        // if not equal, we're done
-    "    mb ;"                 // memory barrier
-    "    mov %a1,%t0 ;"        // load new value into scratch register
-    "    stl_c %t0,(%a0) ;"    // store new value to locked mem (overwriting scratch)
-    "    beq %t0,10b ;"        // store failed because lock has been stolen, retry
-    "20: ",
-    mem, with, cmp);
-}
-
-}  //namespace ipcdetail{
-}  //namespace interprocess{
-}  //namespace boost{
-
-#elif defined(__IBMCPP__) && (__IBMCPP__ >= 800) && defined(_AIX)
-
-#include <builtins.h>
-
-namespace boost {
-namespace interprocess {
-namespace ipcdetail{
-
-//first define boost::uint32_t versions of __lwarx and __stwcx to avoid poluting
-//all the functions with casts
-
-//! From XLC documenation :
-//! This function can be used with a subsequent stwcxu call to implement a
-//! read-modify-write on a specified memory location. The two functions work
-//! together to ensure that if the store is successfully performed, no other
-//! processor or mechanism can modify the target doubleword between the time
-//! lwarxu function is executed and the time the stwcxu functio ncompletes.
-//! "mem" : pointer to the object
-//! Returns the value at pointed to by mem
-inline boost::uint32_t lwarxu(volatile boost::uint32_t *mem)
-{
-   return static_cast<boost::uint32_t>(__lwarx(reinterpret_cast<volatile int*>(mem)));
-}
-
-//! "mem" : pointer to the object
-//! "val" : the value to store
-//! Returns true if the update of mem is successful and false if it is
-//!unsuccessful
-inline bool stwcxu(volatile boost::uint32_t* mem, boost::uint32_t val)
-{
-   return (__stwcx(reinterpret_cast<volatile int*>(mem), static_cast<int>(val)) != 0);
-}
-
-//! "mem": pointer to the object
-//! "val": amount to add
-//! Returns the old value pointed to by mem
-inline boost::uint32_t atomic_add32
-   (volatile boost::uint32_t *mem, boost::uint32_t val)
-{
-   boost::uint32_t oldValue;
-   do
-   {
-      oldValue = lwarxu(mem);
-   }while (!stwcxu(mem, oldValue+val));
-   return oldValue;
-}
-
-//! Atomically increment an apr_uint32_t by 1
-//! "mem": pointer to the object
-//! Returns the old value pointed to by mem
-inline boost::uint32_t atomic_inc32(volatile boost::uint32_t *mem)
-{  return atomic_add32(mem, 1);  }
-
-//! Atomically decrement an boost::uint32_t by 1
-//! "mem": pointer to the atomic value
-//! Returns the old value pointed to by mem
-inline boost::uint32_t atomic_dec32(volatile boost::uint32_t *mem)
-{  return atomic_add32(mem, (boost::uint32_t)-1);   }
-
-//! Atomically read an boost::uint32_t from memory
-inline boost::uint32_t atomic_read32(volatile boost::uint32_t *mem)
-{  return *mem;   }
-
-//! Compare an boost::uint32_t's value with "cmp".
-//! If they are the same swap the value with "with"
-//! "mem": pointer to the value
-//! "with" what to swap it with
-//! "cmp": the value to compare it to
-//! Returns the old value of *mem
-inline boost::uint32_t atomic_cas32
-   (volatile boost::uint32_t *mem, boost::uint32_t with, boost::uint32_t cmp)
-{
-   boost::uint32_t oldValue;
-   boost::uint32_t valueToStore;
-   do
-   {
-      oldValue = lwarxu(mem);
-   } while (!stwcxu(mem, (oldValue == with) ? cmp : oldValue));
-
-   return oldValue;
-}
-
-//! Atomically set an boost::uint32_t in memory
-//! "mem": pointer to the object
-//! "param": val value that the object will assume
-inline void atomic_write32(volatile boost::uint32_t *mem, boost::uint32_t val)
-{  *mem = val; }
-
-}  //namespace ipcdetail
-}  //namespace interprocess
-}  //namespace boost
-
-#elif defined(__GNUC__) && ( __GNUC__ * 100 + __GNUC_MINOR__ >= 401 )
-
-namespace boost {
-namespace interprocess {
-namespace ipcdetail{
-
-//! Atomically add 'val' to an boost::uint32_t
-//! "mem": pointer to the object
-//! "val": amount to add
-//! Returns the old value pointed to by mem
-inline boost::uint32_t atomic_add32
-   (volatile boost::uint32_t *mem, boost::uint32_t val)
-{  return __sync_fetch_and_add(const_cast<boost::uint32_t *>(mem), val);   }
-
-//! Atomically increment an apr_uint32_t by 1
-//! "mem": pointer to the object
-//! Returns the old value pointed to by mem
-inline boost::uint32_t atomic_inc32(volatile boost::uint32_t *mem)
-{  return atomic_add32(mem, 1);  }
-
-//! Atomically decrement an boost::uint32_t by 1
-//! "mem": pointer to the atomic value
-//! Returns the old value pointed to by mem
-inline boost::uint32_t atomic_dec32(volatile boost::uint32_t *mem)
-{  return atomic_add32(mem, (boost::uint32_t)-1);   }
-
-//! Atomically read an boost::uint32_t from memory
-inline boost::uint32_t atomic_read32(volatile boost::uint32_t *mem)
-{  boost::uint32_t old_val = *mem; __sync_synchronize(); return old_val;  }
-
-//! Compare an boost::uint32_t's value with "cmp".
-//! If they are the same swap the value with "with"
-//! "mem": pointer to the value
-//! "with" what to swap it with
-//! "cmp": the value to compare it to
-//! Returns the old value of *mem
-inline boost::uint32_t atomic_cas32
-   (volatile boost::uint32_t *mem, boost::uint32_t with, boost::uint32_t cmp)
-{  return __sync_val_compare_and_swap(const_cast<boost::uint32_t *>(mem), cmp, with);   }
-
-//! Atomically set an boost::uint32_t in memory
-//! "mem": pointer to the object
-//! "param": val value that the object will assume
-inline void atomic_write32(volatile boost::uint32_t *mem, boost::uint32_t val)
-{  __sync_synchronize(); *mem = val;  }
-
-}  //namespace ipcdetail{
-}  //namespace interprocess{
-}  //namespace boost{
-#elif defined(__VXWORKS__)
-
-#include <vxAtomicLib.h>
-// VxWorks atomic32_t is not volatile, for some unknown reason
-#define vx_atomic_cast(_i)   (reinterpret_cast< ::atomic32_t *>( const_cast<boost::uint32_t *>(_i)))
-
-namespace boost {
-namespace interprocess {
-namespace ipcdetail{
-
-//! Atomically add 'val' to an boost::uint32_t
-//! "mem": pointer to the object
-//! "val": amount to add
-//! Returns the old value pointed to by mem
-inline boost::uint32_t atomic_add32
-   (volatile boost::uint32_t *mem, boost::uint32_t val)
-{  return ::vxAtomic32Add( vx_atomic_cast(mem), val);   }
-
-//! Atomically increment an apr_uint32_t by 1
-//! "mem": pointer to the object
-//! Returns the old value pointed to by mem
-inline boost::uint32_t atomic_inc32(volatile boost::uint32_t *mem)
-{  return ::vxAtomic32Inc( vx_atomic_cast(mem) );  }
-
-//! Atomically decrement an boost::uint32_t by 1
-//! "mem": pointer to the atomic value
-//! Returns the old value pointed to by mem
-inline boost::uint32_t atomic_dec32(volatile boost::uint32_t *mem)
-{  return ::vxAtomic32Dec( vx_atomic_cast(mem) );   }
-
-//! Atomically read an boost::uint32_t from memory
-inline boost::uint32_t atomic_read32(volatile boost::uint32_t *mem)
-{  return ::vxAtomic32Get( vx_atomic_cast(mem) );  }
-
-//! Compare an boost::uint32_t's value with "cmp".
-//! If they are the same swap the value with "with"
-//! "mem": pointer to the value
-//! "with" what to swap it with
-//! "cmp": the value to compare it to
-//! Returns the old value of *mem
-inline boost::uint32_t atomic_cas32
-   (volatile boost::uint32_t *mem, boost::uint32_t with, boost::uint32_t cmp)
-{  return ::vxAtomic32Cas( vx_atomic_cast(mem), cmp, with);  }
-
-//! Atomically set an boost::uint32_t in memory
-//! "mem": pointer to the object
-//! "param": val value that the object will assume
-inline void atomic_write32(volatile boost::uint32_t *mem, boost::uint32_t val)
-{  ::vxAtomic32Set( vx_atomic_cast(mem), val);  }
-
-
-}  //namespace ipcdetail{
-}  //namespace interprocess{
-}  //namespace boost{
-
-#else
-
-#error No atomic operations implemented for this platform, sorry!
-
-#endif
-
-namespace boost{
-namespace interprocess{
-namespace ipcdetail{
-
-inline bool atomic_add_unless32
-   (volatile boost::uint32_t *mem, boost::uint32_t value, boost::uint32_t unless_this)
-{
-   boost::uint32_t old, c(atomic_read32(mem));
-   while(c != unless_this && (old = atomic_cas32(mem, c + value, c)) != c){
-      c = old;
-   }
-   return c != unless_this;
-}
-
-}  //namespace ipcdetail
-}  //namespace interprocess
-}  //namespace boost
-
-
-#include <boost/interprocess/detail/config_end.hpp>
-
-#endif   //BOOST_INTERPROCESS_DETAIL_ATOMIC_HPP
diff --git a/src/boost/interprocess/detail/cast_tags.hpp b/src/boost/interprocess/detail/cast_tags.hpp
deleted file mode 100644
index e47b8634..00000000
--- a/src/boost/interprocess/detail/cast_tags.hpp
+++ /dev/null
@@ -1,31 +0,0 @@
-//////////////////////////////////////////////////////////////////////////////
-//
-// (C) Copyright Ion Gaztanaga 2005-2012. Distributed under the Boost
-// 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/interprocess for documentation.
-//
-//////////////////////////////////////////////////////////////////////////////
-
-#ifndef BOOST_INTERPROCESS_DETAIL_CAST_TAGS_HPP
-#define BOOST_INTERPROCESS_DETAIL_CAST_TAGS_HPP
-
-#ifndef BOOST_CONFIG_HPP
-#  include <boost/config.hpp>
-#endif
-#
-#if defined(BOOST_HAS_PRAGMA_ONCE)
-#  pragma once
-#endif
-
-namespace boost { namespace interprocess { namespace ipcdetail {
-
-struct static_cast_tag {};
-struct const_cast_tag {};
-struct dynamic_cast_tag {};
-struct reinterpret_cast_tag {};
-
-}}}  //namespace boost { namespace interprocess { namespace ipcdetail {
-
-#endif   //#ifndef BOOST_INTERPROCESS_DETAIL_CAST_TAGS_HPP
diff --git a/src/boost/interprocess/detail/char_wchar_holder.hpp b/src/boost/interprocess/detail/char_wchar_holder.hpp
deleted file mode 100644
index 8831aa20..00000000
--- a/src/boost/interprocess/detail/char_wchar_holder.hpp
+++ /dev/null
@@ -1,127 +0,0 @@
-//////////////////////////////////////////////////////////////////////////////
-//
-// (C) Copyright Ion Gaztanaga 2020-2021. Distributed under the Boost
-// 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/interprocess for documentation.
-//
-//////////////////////////////////////////////////////////////////////////////
-
-#ifndef BOOST_INTERPROCESS_DETAIL_CHAR_WCHAR_HOLDER_HPP
-#define BOOST_INTERPROCESS_DETAIL_CHAR_WCHAR_HOLDER_HPP
-
-#ifndef BOOST_CONFIG_HPP
-#  include <boost/config.hpp>
-#endif
-#
-#if defined(BOOST_HAS_PRAGMA_ONCE)
-#  pragma once
-#endif
-
-#include <boost/interprocess/detail/config_begin.hpp>
-#include <boost/interprocess/detail/workaround.hpp>
-
-#include <cwchar>
-#include <cstring>
-
-namespace boost {
-namespace interprocess {
-
-class char_wchar_holder
-{
-   public:
-   char_wchar_holder()
-      : m_str(), m_is_wide()
-   {
-      m_str.n = 0;
-   }
-
-   char_wchar_holder(const char *nstr)
-      : m_str(), m_is_wide()
-   {
-      m_str.n = new char [std::strlen(nstr)+1];
-      std::strcpy(m_str.n, nstr);
-   }
-
-   char_wchar_holder(const wchar_t *wstr)
-      : m_str(), m_is_wide(true)
-   {
-      m_str.w = new wchar_t [std::wcslen(wstr)+1];
-      std::wcscpy(m_str.w, wstr);
-   }
-
-   char_wchar_holder& operator=(const char *nstr)
-   {
-      char *tmp = new char [std::strlen(nstr)+1];
-      this->delete_mem();
-      m_str.n = tmp;
-      std::strcpy(m_str.n, nstr);
-      return *this;
-   }
-
-   char_wchar_holder& operator=(const wchar_t *wstr)
-   {
-      wchar_t *tmp = new wchar_t [std::wcslen(wstr)+1];
-      this->delete_mem();
-      m_str.w = tmp;
-      std::wcscpy(m_str.w, wstr);
-      return *this;
-   }
-
-   char_wchar_holder& operator=(const char_wchar_holder &other)
-   {
-      if (other.m_is_wide)
-         *this = other.getn();
-      else
-         *this = other.getw();
-      return *this;
-   }
-
-   ~char_wchar_holder()
-   {
-      this->delete_mem();
-   }
-
-   wchar_t *getw() const
-   {  return m_is_wide ? m_str.w : 0; }
-
-   char *getn() const
-   {  return !m_is_wide ? m_str.n : 0; }
-
-   void swap(char_wchar_holder& other)
-   {
-      char_wchar tmp;
-      std::memcpy(&tmp, &m_str, sizeof(char_wchar));
-      std::memcpy(&m_str, &other.m_str, sizeof(char_wchar));
-      std::memcpy(&other.m_str, &tmp, sizeof(char_wchar));
-      //
-      bool b_tmp(m_is_wide);
-      m_is_wide = other.m_is_wide;
-      other.m_is_wide = b_tmp;
-   }
-
-   private:
-
-   void delete_mem()
-   {
-      if(m_is_wide)
-         delete [] m_str.w;
-      else
-         delete [] m_str.n;
-   }
-
-   union char_wchar
-   {
-      char    *n;
-      wchar_t *w;
-   } m_str;
-   bool m_is_wide;
-};
-
-}  //namespace interprocess {
-}  //namespace boost {
-
-#include <boost/interprocess/detail/config_end.hpp>
-
-#endif   //BOOST_INTERPROCESS_DETAIL_CHAR_WCHAR_HOLDER_HPP
diff --git a/src/boost/interprocess/detail/config_begin.hpp b/src/boost/interprocess/detail/config_begin.hpp
deleted file mode 100644
index d003ccd3..00000000
--- a/src/boost/interprocess/detail/config_begin.hpp
+++ /dev/null
@@ -1,50 +0,0 @@
-//////////////////////////////////////////////////////////////////////////////
-//
-// (C) Copyright Ion Gaztanaga 2005-2012. Distributed under the Boost
-// 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/interprocess for documentation.
-//
-//////////////////////////////////////////////////////////////////////////////
-#ifndef BOOST_INTERPROCESS_CONFIG_INCLUDED
-#define BOOST_INTERPROCESS_CONFIG_INCLUDED
-#include <boost/config.hpp>
-#endif
-
-#ifdef BOOST_MSVC
-   #pragma warning (push)
-   #pragma warning (disable : 4702) // unreachable code
-   #pragma warning (disable : 4706) // assignment within conditional expression
-   #pragma warning (disable : 4127) // conditional expression is constant
-   #pragma warning (disable : 4146) // unary minus operator applied to unsigned type, result still unsigned
-   #pragma warning (disable : 4284) // odd return type for operator->
-   #pragma warning (disable : 4244) // possible loss of data
-   #pragma warning (disable : 4251) // "identifier" : class "type" needs to have dll-interface to be used by clients of class "type2"
-   #pragma warning (disable : 4267) // conversion from "X" to "Y", possible loss of data
-   #pragma warning (disable : 4275) // non DLL-interface classkey "identifier" used as base for DLL-interface classkey "identifier"
-   #pragma warning (disable : 4355) // "this" : used in base member initializer list
-   #pragma warning (disable : 4345) // behavior change: an object of POD type constructed with an initializer of the form () will  be default-initialized
-   #pragma warning (disable : 4503) // "identifier" : decorated name length exceeded, name was truncated
-   #pragma warning (disable : 4511) // copy constructor could not be generated
-   #pragma warning (disable : 4512) // assignment operator could not be generated
-   #pragma warning (disable : 4514) // unreferenced inline removed
-   #pragma warning (disable : 4521) // Disable "multiple copy constructors specified"
-   #pragma warning (disable : 4522) // "class" : multiple assignment operators specified
-   #pragma warning (disable : 4675) // "method" should be declared "static" and have exactly one parameter
-   #pragma warning (disable : 4710) // function not inlined
-   #pragma warning (disable : 4711) // function selected for automatic inline expansion
-   #pragma warning (disable : 4786) // identifier truncated in debug info
-   #pragma warning (disable : 4996) // "function": was declared deprecated
-   #pragma warning (disable : 4197) // top-level volatile in cast is ignored
-   #pragma warning (disable : 4541) // 'typeid' used on polymorphic type 'boost::exception'
-                                    //    with /GR-; unpredictable behavior may result
-   #pragma warning (disable : 4673) //  throwing '' the following types will not be considered at the catch site
-   #pragma warning (disable : 4671) //  the copy constructor is inaccessible
-   #pragma warning (disable : 4250) //  inherits 'x' via dominance
-#endif
-
-#if defined(BOOST_GCC) && (BOOST_GCC >= 40600)
-#pragma GCC diagnostic push
-#pragma GCC diagnostic ignored "-Wdeprecated-declarations"
-#endif
diff --git a/src/boost/interprocess/detail/config_end.hpp b/src/boost/interprocess/detail/config_end.hpp
deleted file mode 100644
index 55bccd1b..00000000
--- a/src/boost/interprocess/detail/config_end.hpp
+++ /dev/null
@@ -1,16 +0,0 @@
-//////////////////////////////////////////////////////////////////////////////
-//
-// (C) Copyright Ion Gaztanaga 2005-2012. Distributed under the Boost
-// 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/interprocess for documentation.
-//
-//////////////////////////////////////////////////////////////////////////////
-#if defined BOOST_MSVC
-   #pragma warning (pop)
-#endif
-
-#if defined(BOOST_GCC) && (BOOST_GCC >= 40600)
-#pragma GCC diagnostic pop
-#endif
diff --git a/src/boost/interprocess/detail/config_external_begin.hpp b/src/boost/interprocess/detail/config_external_begin.hpp
deleted file mode 100644
index 67c05568..00000000
--- a/src/boost/interprocess/detail/config_external_begin.hpp
+++ /dev/null
@@ -1,23 +0,0 @@
-//////////////////////////////////////////////////////////////////////////////
-//
-// (C) Copyright Ion Gaztanaga 2012-2012. Distributed under the Boost
-// 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/interprocess for documentation.
-//
-//////////////////////////////////////////////////////////////////////////////
-#ifndef BOOST_INTERPROCESS_EXTERNAL_CONFIG_INCLUDED
-#define BOOST_INTERPROCESS_EXTERNAL_CONFIG_INCLUDED
-#include <boost/config.hpp>
-#endif
-
-#if defined(__GNUC__) && ((__GNUC__*100 + __GNUC_MINOR__) >= 406)
-#  pragma GCC diagnostic push
-#  pragma GCC diagnostic ignored "-Wshadow"
-#  pragma GCC diagnostic ignored "-Wsign-conversion"
-#  pragma GCC diagnostic ignored "-Wconversion"
-#  if (BOOST_GCC >= 100000)
-#     pragma GCC diagnostic ignored "-Warith-conversion"
-#  endif
-#endif
diff --git a/src/boost/interprocess/detail/config_external_end.hpp b/src/boost/interprocess/detail/config_external_end.hpp
deleted file mode 100644
index 214558f5..00000000
--- a/src/boost/interprocess/detail/config_external_end.hpp
+++ /dev/null
@@ -1,12 +0,0 @@
-//////////////////////////////////////////////////////////////////////////////
-//
-// (C) Copyright Ion Gaztanaga 2012-2012. Distributed under the Boost
-// 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/interprocess for documentation.
-//
-//////////////////////////////////////////////////////////////////////////////
-#if defined(__GNUC__) && ((__GNUC__*100 + __GNUC_MINOR__) >= 406)
-#  pragma GCC diagnostic pop
-#endif
diff --git a/src/boost/interprocess/detail/file_locking_helpers.hpp b/src/boost/interprocess/detail/file_locking_helpers.hpp
deleted file mode 100644
index c6688e61..00000000
--- a/src/boost/interprocess/detail/file_locking_helpers.hpp
+++ /dev/null
@@ -1,302 +0,0 @@
-//////////////////////////////////////////////////////////////////////////////
-//
-// (C) Copyright Ion Gaztanaga 2009-2012. Distributed under the Boost
-// 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/interprocess for documentation.
-//
-//////////////////////////////////////////////////////////////////////////////
-
-#ifndef BOOST_INTERPROCESS_FILE_LOCKING_HELPERS_HPP
-#define BOOST_INTERPROCESS_FILE_LOCKING_HELPERS_HPP
-
-#ifndef BOOST_CONFIG_HPP
-#  include <boost/config.hpp>
-#endif
-#
-#if defined(BOOST_HAS_PRAGMA_ONCE)
-#pragma once
-#endif
-
-#include <boost/interprocess/detail/config_begin.hpp>
-#include <boost/interprocess/detail/workaround.hpp>
-
-#include <sstream>
-#include <string>
-#include <sys/types.h>
-#include <sys/stat.h>
-#include <errno.h>
-#include <cstddef>
-#include <boost/interprocess/detail/os_file_functions.hpp>
-
-#include <boost/interprocess/detail/shared_dir_helpers.hpp>
-
-#if defined(BOOST_INTERPROCESS_WINDOWS)
-
-#include <fcntl.h>
-#include <io.h>
-#include <sys/locking.h>
-
-#else //defined(BOOST_INTERPROCESS_WINDOWS)
-
-#include <fcntl.h>
-#include <sys/stat.h>
-#include <unistd.h>
-
-#endif   //defined(BOOST_INTERPROCESS_WINDOWS)
-
-namespace boost{
-namespace interprocess{
-namespace ipcdetail{
-
-#if defined(BOOST_INTERPROCESS_WINDOWS)
-
-struct locking_file_serial_id
-{
-   int fd;
-   unsigned long dwVolumeSerialNumber;
-   unsigned long nFileIndexHigh;
-   unsigned long nFileIndexLow;
-   //This reference count counts the number of modules attached
-   //to the shared memory and lock file. This serves to unlink
-   //the locking file and shared memory when all modules are
-   //done with the global memory (shared memory)
-   volatile boost::uint32_t modules_attached_to_gmem_count;
-};
-
-inline bool lock_locking_file(int fd)
-{
-   int ret = 0;
-   while(ret != 0 && errno == EDEADLK){
-      ret = _locking(fd, _LK_LOCK, 1/*lock_file_contents_length()*/);
-   }
-   return 0 == ret;
-}
-
-inline bool try_lock_locking_file(int fd)
-{
-   return 0 == _locking(fd, _LK_NBLCK , 1);
-}
-
-inline int open_or_create_and_lock_file(const char *name)
-{
-   permissions p;
-   p.set_unrestricted();
-   while(1){
-      file_handle_t handle = create_or_open_file(name, read_write, p);
-      int fd = _open_osfhandle((intptr_t)handle, _O_TEXT);
-      if(fd < 0){
-         close_file(handle);
-         return fd;
-      }
-      if(!try_lock_locking_file(fd)){
-         _close(fd);
-         return -1;
-      }
-      struct _stat s;
-      if(0 == _stat(name, &s)){
-         return fd;
-      }
-      else{
-         _close(fd);
-      }
-   }
-}
-
-inline int try_open_and_lock_file(const char *name)
-{
-   file_handle_t handle = open_existing_file(name, read_write);
-   int fd = _open_osfhandle((intptr_t)handle, _O_TEXT);
-   if(fd < 0){
-      close_file(handle);
-      return fd;
-   }
-   if(!try_lock_locking_file(fd)){
-      _close(fd);
-      return -1;
-   }
-   return fd;
-}
-
-inline void close_lock_file(int fd)
-{  _close(fd); }
-
-inline bool is_valid_fd(int fd)
-{
-   struct _stat s;
-   return EBADF != _fstat(fd, &s);
-}
-
-inline bool is_normal_file(int fd)
-{
-   if(_isatty(fd))
-      return false;
-   struct _stat s;
-   if(0 != _fstat(fd, &s))
-      return false;
-   return 0 != (s.st_mode & _S_IFREG);
-}
-
-inline std::size_t get_size(int fd)
-{
-   struct _stat s;
-   if(0 != _fstat(fd, &s))
-      return 0u;
-   return (std::size_t)s.st_size;
-}
-
-inline bool fill_file_serial_id(int fd, locking_file_serial_id &id)
-{
-   winapi::interprocess_by_handle_file_information info;
-   if(!winapi::get_file_information_by_handle((void*)_get_osfhandle(fd), &info))
-      return false;
-   id.fd = fd;
-   id.dwVolumeSerialNumber = info.dwVolumeSerialNumber;
-   id.nFileIndexHigh = info.nFileIndexHigh;
-   id.nFileIndexLow = info.nFileIndexLow;
-   id.modules_attached_to_gmem_count = 1; //Initialize attached count
-   return true;
-}
-
-inline bool compare_file_serial(int fd, const locking_file_serial_id &id)
-{
-   winapi::interprocess_by_handle_file_information info;
-   if(!winapi::get_file_information_by_handle((void*)_get_osfhandle(fd), &info))
-      return false;
-
-   return   id.dwVolumeSerialNumber == info.dwVolumeSerialNumber  &&
-            id.nFileIndexHigh       == info.nFileIndexHigh        &&
-            id.nFileIndexLow        == info.nFileIndexLow;
-}
-
-#else //UNIX
-
-struct locking_file_serial_id
-{
-   int fd;
-   dev_t st_dev;
-   ino_t st_ino;
-   //This reference count counts the number of modules attached
-   //to the shared memory and lock file. This serves to unlink
-   //the locking file and shared memory when all modules are
-   //done with the global memory (shared memory)
-   volatile boost::uint32_t modules_attached_to_gmem_count;
-};
-
-inline bool lock_locking_file(int fd)
-{
-   int ret = 0;
-   while(ret != 0 && errno != EINTR){
-      struct flock lock;
-      lock.l_type = F_WRLCK;
-      lock.l_whence = SEEK_SET;
-      lock.l_start = 0;
-      lock.l_len = 1;
-      ret = fcntl (fd, F_SETLKW, &lock);
-   }
-   return 0 == ret;
-}
-
-inline bool try_lock_locking_file(int fd)
-{
-   struct flock lock;
-   lock.l_type = F_WRLCK;
-   lock.l_whence = SEEK_SET;
-   lock.l_start = 0;
-   lock.l_len = 1;
-   return 0 == fcntl (fd, F_SETLK, &lock);
-}
-
-inline int open_or_create_and_lock_file(const char *name)
-{
-   permissions p;
-   p.set_unrestricted();
-   while(1){
-      int fd = create_or_open_file(name, read_write, p);
-      if(fd < 0){
-         return fd;
-      }
-      if(!try_lock_locking_file(fd)){
-         close(fd);
-         return -1;
-      }
-      struct stat s;
-      if(0 == stat(name, &s)){
-         return fd;
-      }
-      else{
-         close(fd);
-      }
-   }
-}
-
-inline int try_open_and_lock_file(const char *name)
-{
-   int fd = open_existing_file(name, read_write);
-   if(fd < 0){
-      return fd;
-   }
-   if(!try_lock_locking_file(fd)){
-      close(fd);
-      return -1;
-   }
-   return fd;
-}
-
-inline void close_lock_file(int fd)
-{  close(fd); }
-
-inline bool is_valid_fd(int fd)
-{
-   struct stat s;
-   return EBADF != fstat(fd, &s);
-}
-
-inline bool is_normal_file(int fd)
-{
-   struct stat s;
-   if(0 != fstat(fd, &s))
-      return false;
-   return 0 != (s.st_mode & S_IFREG);
-}
-
-inline std::size_t get_size(int fd)
-{
-   struct stat s;
-   if(0 != fstat(fd, &s))
-      return 0u;
-   return (std::size_t)s.st_size;
-}
-
-inline bool fill_file_serial_id(int fd, locking_file_serial_id &id)
-{
-   struct stat s;
-   if(0 != fstat(fd, &s))
-      return false;
-   id.fd = fd;
-   id.st_dev = s.st_dev;
-   id.st_ino = s.st_ino;
-   id.modules_attached_to_gmem_count = 1; //Initialize attached count
-   return true;
-}
-
-inline bool compare_file_serial(int fd, const locking_file_serial_id &id)
-{
-   struct stat info;
-   if(0 != fstat(fd, &info))
-      return false;
-
-   return   id.st_dev == info.st_dev  &&
-            id.st_ino == info.st_ino;
-}
-
-#endif
-
-}  //namespace ipcdetail{
-}  //namespace interprocess{
-}  //namespace boost{
-
-#include <boost/interprocess/detail/config_end.hpp>
-
-#endif   //BOOST_INTERPROCESS_FILE_LOCKING_HELPERS_HPP
diff --git a/src/boost/interprocess/detail/in_place_interface.hpp b/src/boost/interprocess/detail/in_place_interface.hpp
deleted file mode 100644
index 6ba6229b..00000000
--- a/src/boost/interprocess/detail/in_place_interface.hpp
+++ /dev/null
@@ -1,77 +0,0 @@
-//////////////////////////////////////////////////////////////////////////////
-//
-// (C) Copyright Ion Gaztanaga 2005-2012. Distributed under the Boost
-// 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/interprocess for documentation.
-//
-//////////////////////////////////////////////////////////////////////////////
-
-#ifndef BOOST_INTERPROCESS_IN_PLACE_INTERFACE_HPP
-#define BOOST_INTERPROCESS_IN_PLACE_INTERFACE_HPP
-
-#ifndef BOOST_CONFIG_HPP
-#  include <boost/config.hpp>
-#endif
-#
-#if defined(BOOST_HAS_PRAGMA_ONCE)
-#  pragma once
-#endif
-
-#include <boost/interprocess/detail/config_begin.hpp>
-#include <boost/interprocess/detail/workaround.hpp>
-#include <boost/interprocess/detail/type_traits.hpp>
-#include <boost/container/detail/type_traits.hpp>  //alignment_of, aligned_storage
-#include <typeinfo>  //typeid
-
-//!\file
-//!Describes an abstract interface for placement construction and destruction.
-
-namespace boost {
-namespace interprocess {
-namespace ipcdetail {
-
-struct in_place_interface
-{
-   in_place_interface(std::size_t alignm, std::size_t sz, const char *tname)
-   :  alignment(alignm), size(sz), type_name(tname)
-   {}
-
-   std::size_t alignment;
-   std::size_t size;
-   const char *type_name;
-
-   virtual void construct_n(void *mem, std::size_t num, std::size_t &constructed) = 0;
-   virtual void destroy_n(void *mem, std::size_t num, std::size_t &destroyed) = 0;
-   virtual ~in_place_interface(){}
-};
-
-template<class T>
-struct placement_destroy :  public in_place_interface
-{
-   placement_destroy()
-      :  in_place_interface(::boost::container::dtl::alignment_of<T>::value, sizeof(T), typeid(T).name())
-   {}
-
-   virtual void destroy_n(void *mem, std::size_t num, std::size_t &destroyed) BOOST_OVERRIDE
-   {
-      T* memory = static_cast<T*>(mem);
-      for(destroyed = 0; destroyed < num; ++destroyed)
-         (memory++)->~T();
-   }
-
-   virtual void construct_n(void *, std::size_t, std::size_t &) BOOST_OVERRIDE {}
-
-   private:
-   void destroy(void *mem)
-   {  static_cast<T*>(mem)->~T();   }
-};
-
-}
-}
-}   //namespace boost { namespace interprocess { namespace ipcdetail {
-
-#include <boost/interprocess/detail/config_end.hpp>
-
-#endif //#ifndef BOOST_INTERPROCESS_IN_PLACE_INTERFACE_HPP
diff --git a/src/boost/interprocess/detail/intermodule_singleton.hpp b/src/boost/interprocess/detail/intermodule_singleton.hpp
deleted file mode 100644
index 24148d47..00000000
--- a/src/boost/interprocess/detail/intermodule_singleton.hpp
+++ /dev/null
@@ -1,53 +0,0 @@
-//////////////////////////////////////////////////////////////////////////////
-//
-// (C) Copyright Ion Gaztanaga 2009-2012. Distributed under the Boost
-// 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/interprocess for documentation.
-//
-//////////////////////////////////////////////////////////////////////////////
-
-#ifndef BOOST_INTERPROCESS_INTERMODULE_SINGLETON_HPP
-#define BOOST_INTERPROCESS_INTERMODULE_SINGLETON_HPP
-
-#ifndef BOOST_CONFIG_HPP
-#  include <boost/config.hpp>
-#endif
-#
-#if defined(BOOST_HAS_PRAGMA_ONCE)
-#pragma once
-#endif
-
-#include <boost/interprocess/detail/config_begin.hpp>
-#include <boost/interprocess/detail/workaround.hpp>
-
-#ifdef BOOST_INTERPROCESS_WINDOWS
-   #include <boost/interprocess/detail/windows_intermodule_singleton.hpp>
-#else
-   #include <boost/interprocess/detail/portable_intermodule_singleton.hpp>
-#endif
-
-namespace boost{
-namespace interprocess{
-namespace ipcdetail{
-
-//Now this class is a singleton, initializing the singleton in
-//the first get() function call if LazyInit is true. If false
-//then the singleton will be initialized when loading the module.
-template<typename C, bool LazyInit = true, bool Phoenix = false>
-class intermodule_singleton
-   #ifdef BOOST_INTERPROCESS_WINDOWS
-   : public windows_intermodule_singleton<C, LazyInit, Phoenix>
-   #else
-   : public portable_intermodule_singleton<C, LazyInit, Phoenix>
-   #endif
-{};
-
-}  //namespace ipcdetail{
-}  //namespace interprocess{
-}  //namespace boost{
-
-#include <boost/interprocess/detail/config_end.hpp>
-
-#endif
diff --git a/src/boost/interprocess/detail/intermodule_singleton_common.hpp b/src/boost/interprocess/detail/intermodule_singleton_common.hpp
deleted file mode 100644
index 2218cd9b..00000000
--- a/src/boost/interprocess/detail/intermodule_singleton_common.hpp
+++ /dev/null
@@ -1,505 +0,0 @@
-//////////////////////////////////////////////////////////////////////////////
-//
-// (C) Copyright Ion Gaztanaga 2009-2012. Distributed under the Boost
-// 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/interprocess for documentation.
-//
-//////////////////////////////////////////////////////////////////////////////
-
-#ifndef BOOST_INTERPROCESS_INTERMODULE_SINGLETON_COMMON_HPP
-#define BOOST_INTERPROCESS_INTERMODULE_SINGLETON_COMMON_HPP
-
-#ifndef BOOST_CONFIG_HPP
-#  include <boost/config.hpp>
-#endif
-#
-#if defined(BOOST_HAS_PRAGMA_ONCE)
-#pragma once
-#endif
-
-#include <boost/interprocess/detail/config_begin.hpp>
-#include <boost/interprocess/detail/workaround.hpp>
-
-#include <boost/interprocess/detail/atomic.hpp>
-#include <boost/interprocess/detail/os_thread_functions.hpp>
-#include <boost/interprocess/exceptions.hpp>
-#include <boost/container/detail/type_traits.hpp>  //alignment_of, aligned_storage
-#include <boost/interprocess/detail/mpl.hpp>
-#include <boost/interprocess/sync/spin/wait.hpp>
-#include <boost/assert.hpp>
-#include <cstddef>
-#include <cstdio>
-#include <cstdlib>
-#include <cstring>
-#include <string>
-#include <typeinfo>
-#include <sstream>
-
-namespace boost{
-namespace interprocess{
-namespace ipcdetail{
-
-namespace intermodule_singleton_helpers {
-
-inline void get_pid_creation_time_str(std::string &s)
-{
-   std::stringstream stream;
-   stream << get_current_process_id() << '_';
-   stream.precision(6);
-   stream << std::fixed << get_current_process_creation_time();
-   s = stream.str();
-}
-
-inline const char *get_map_base_name()
-{  return "bip.gmem.map.";  }
-
-inline void get_map_name(std::string &map_name)
-{
-   get_pid_creation_time_str(map_name);
-   map_name.insert(0, get_map_base_name());
-}
-
-inline std::size_t get_map_size()
-{  return 65536;  }
-
-template<class ThreadSafeGlobalMap>
-struct thread_safe_global_map_dependant;
-
-}  //namespace intermodule_singleton_helpers {
-
-//This class contains common code for all singleton types, so that we instantiate this
-//code just once per module. This class also holds a thread soafe global map
-//to be used by all instances protected with a reference count
-template<class ThreadSafeGlobalMap>
-class intermodule_singleton_common
-{
-   public:
-   typedef void*(singleton_constructor_t)(ThreadSafeGlobalMap &);
-   typedef void (singleton_destructor_t)(void *, ThreadSafeGlobalMap &);
-
-   static const ::boost::uint32_t Uninitialized       = 0u;
-   static const ::boost::uint32_t Initializing        = 1u;
-   static const ::boost::uint32_t Initialized         = 2u;
-   static const ::boost::uint32_t Broken              = 3u;
-   static const ::boost::uint32_t Destroyed           = 4u;
-
-   //Initialize this_module_singleton_ptr, creates the global map if needed and also creates an unique
-   //opaque type in global map through a singleton_constructor_t function call,
-   //initializing the passed pointer to that unique instance.
-   //
-   //We have two concurrency types here. a)the global map/singleton creation must
-   //be safe between threads of this process but in different modules/dlls. b)
-   //the pointer to the singleton is per-module, so we have to protect this
-   //initization between threads of the same module.
-   //
-   //All static variables declared here are shared between inside a module
-   //so atomic operations will synchronize only threads of the same module.
-   static void initialize_singleton_logic
-      (void *&ptr, volatile boost::uint32_t &this_module_singleton_initialized, singleton_constructor_t constructor, bool phoenix)
-   {
-      //If current module is not initialized enter to lock free logic
-      if(atomic_read32(&this_module_singleton_initialized) != Initialized){
-         //Now a single thread of the module will succeed in this CAS.
-         //trying to pass from Uninitialized to Initializing
-         ::boost::uint32_t previous_module_singleton_initialized = atomic_cas32
-            (&this_module_singleton_initialized, Initializing, Uninitialized);
-         //If the thread succeeded the CAS (winner) it will compete with other
-         //winner threads from other modules to create the global map
-         if(previous_module_singleton_initialized == Destroyed){
-            //Trying to resurrect a dead Phoenix singleton. Just try to
-            //mark it as uninitialized and start again
-            if(phoenix){
-               atomic_cas32(&this_module_singleton_initialized, Uninitialized, Destroyed);
-               previous_module_singleton_initialized = atomic_cas32
-                  (&this_module_singleton_initialized, Initializing, Uninitialized);
-            }
-            //Trying to resurrect a non-Phoenix dead singleton is an error
-            else{
-               throw interprocess_exception("Boost.Interprocess: Dead reference on non-Phoenix singleton of type");
-            }
-         }
-         if(previous_module_singleton_initialized == Uninitialized){
-            BOOST_TRY{
-               //Now initialize the global map, this function must solve concurrency
-               //issues between threads of several modules
-               initialize_global_map_handle();
-               //Now try to create the singleton in global map.
-               //This function solves concurrency issues
-               //between threads of several modules
-               ThreadSafeGlobalMap *const pmap = get_map_ptr();
-               void *tmp = constructor(*pmap);
-               //Increment the module reference count that reflects how many
-               //singletons this module holds, so that we can safely destroy
-               //module global map object when no singleton is left
-               atomic_inc32(&this_module_singleton_count);
-               //Insert a barrier before assigning the pointer to
-               //make sure this assignment comes after the initialization
-               atomic_write32(&this_module_singleton_initialized, Initializing);
-               //Assign the singleton address to the module-local pointer
-               ptr = tmp;
-               //Memory barrier inserted, all previous operations should complete
-               //before this one. Now marked as initialized
-               atomic_write32(&this_module_singleton_initialized, Initialized);
-            }
-            BOOST_CATCH(...){
-               //Mark singleton failed to initialize
-               atomic_write32(&this_module_singleton_initialized, Broken);
-               BOOST_RETHROW
-            } BOOST_CATCH_END
-         }
-         //If previous state was initializing, this means that another winner thread is
-         //trying to initialize the singleton. Just wait until completes its work.
-         else if(previous_module_singleton_initialized == Initializing){
-            spin_wait swait;
-            while(1){
-               previous_module_singleton_initialized = atomic_read32(&this_module_singleton_initialized);
-               if(previous_module_singleton_initialized >= Initialized){
-                  //Already initialized, or exception thrown by initializer thread
-                  break;
-               }
-               else if(previous_module_singleton_initialized == Initializing){
-                  swait.yield();
-               }
-               else{
-                  //This can't be happening!
-                  BOOST_ASSERT(0);
-               }
-            }
-         }
-         else if(previous_module_singleton_initialized == Initialized){
-            //Nothing to do here, the singleton is ready
-         }
-         //If previous state was greater than initialized, then memory is broken
-         //trying to initialize the singleton.
-         else{//(previous_module_singleton_initialized > Initialized)
-            throw interprocess_exception("boost::interprocess::intermodule_singleton initialization failed");
-         }
-      }
-      BOOST_ASSERT(ptr != 0);
-   }
-
-   static void finalize_singleton_logic(void *&ptr, volatile boost::uint32_t &this_module_singleton_initialized, singleton_destructor_t destructor)
-   {
-      //Protect destruction against lazy singletons not initialized in this execution
-      if(ptr){
-         //Note: this destructor might provoke a Phoenix singleton
-         //resurrection. This means that this_module_singleton_count
-         //might change after this call.
-         ThreadSafeGlobalMap * const pmap = get_map_ptr();
-         destructor(ptr, *pmap);
-         ptr = 0;
-
-         //Memory barrier to make sure pointer is nulled.
-         //Mark this singleton as destroyed.
-         atomic_write32(&this_module_singleton_initialized, Destroyed);
-
-         //If this is the last singleton of this module
-         //apply map destruction.
-         //Note: singletons are destroyed when the module is unloaded
-         //so no threads should be executing or holding references
-         //to this module
-         if(1 == atomic_dec32(&this_module_singleton_count)){
-            destroy_global_map_handle();
-         }
-      }
-   }
-
-   private:
-   static ThreadSafeGlobalMap *get_map_ptr()
-   {
-      return static_cast<ThreadSafeGlobalMap *>(static_cast<void*>(mem_holder.map_mem));
-   }
-
-   static void initialize_global_map_handle()
-   {
-      //Obtain unique map name and size
-      spin_wait swait;
-      while(1){
-         //Try to pass map state to initializing
-         ::boost::uint32_t tmp = atomic_cas32(&this_module_map_initialized, Initializing, Uninitialized);
-         if(tmp == Initialized || tmp == Broken){
-            break;
-         }
-         else if(tmp == Destroyed){
-            tmp = atomic_cas32(&this_module_map_initialized, Uninitialized, Destroyed);
-            continue;
-         }
-         //If some other thread is doing the work wait
-         else if(tmp == Initializing){
-            swait.yield();
-         }
-         else{ //(tmp == Uninitialized)
-            //If not initialized try it again?
-            BOOST_TRY{
-               //Remove old global map from the system
-               intermodule_singleton_helpers::thread_safe_global_map_dependant<ThreadSafeGlobalMap>::remove_old_gmem();
-               //in-place construction of the global map class
-               ThreadSafeGlobalMap * const pmap = get_map_ptr();
-               intermodule_singleton_helpers::thread_safe_global_map_dependant
-                  <ThreadSafeGlobalMap>::construct_map(static_cast<void*>(pmap));
-               //Use global map's internal lock to initialize the lock file
-               //that will mark this gmem as "in use".
-               typename intermodule_singleton_helpers::thread_safe_global_map_dependant<ThreadSafeGlobalMap>::
-                  lock_file_logic f(*pmap);
-               //If function failed (maybe a competing process has erased the shared
-               //memory between creation and file locking), retry with a new instance.
-               if(f.retry()){
-                  pmap->~ThreadSafeGlobalMap();
-                  atomic_write32(&this_module_map_initialized, Destroyed);
-               }
-               else{
-                  //Locking succeeded, so this global map module-instance is ready
-                  atomic_write32(&this_module_map_initialized, Initialized);
-                  break;
-               }
-            }
-            BOOST_CATCH(...){
-               //
-               BOOST_RETHROW
-            } BOOST_CATCH_END
-         }
-      }
-   }
-
-   static void destroy_global_map_handle()
-   {
-      if(!atomic_read32(&this_module_singleton_count)){
-         //This module is being unloaded, so destroy
-         //the global map object of this module
-         //and unlink the global map if it's the last
-         ThreadSafeGlobalMap * const pmap = get_map_ptr();
-         typename intermodule_singleton_helpers::thread_safe_global_map_dependant<ThreadSafeGlobalMap>::
-            unlink_map_logic f(*pmap);
-         pmap->~ThreadSafeGlobalMap();
-         atomic_write32(&this_module_map_initialized, Destroyed);
-         //Do some cleanup for other processes old gmem instances
-         intermodule_singleton_helpers::thread_safe_global_map_dependant<ThreadSafeGlobalMap>::remove_old_gmem();
-      }
-   }
-
-   //Static data, zero-initalized without any dependencies
-   //this_module_singleton_count is the number of singletons used by this module
-   static volatile boost::uint32_t this_module_singleton_count;
-
-   //this_module_map_initialized is the state of this module's map class object.
-   //Values: Uninitialized, Initializing, Initialized, Broken
-   static volatile boost::uint32_t this_module_map_initialized;
-
-   //Raw memory to construct the global map manager
-   static union mem_holder_t
-   {
-      unsigned char map_mem [sizeof(ThreadSafeGlobalMap)];
-      ::boost::container::dtl::max_align_t aligner;
-   } mem_holder;
-};
-
-template<class ThreadSafeGlobalMap>
-volatile boost::uint32_t intermodule_singleton_common<ThreadSafeGlobalMap>::this_module_singleton_count;
-
-template<class ThreadSafeGlobalMap>
-volatile boost::uint32_t intermodule_singleton_common<ThreadSafeGlobalMap>::this_module_map_initialized;
-
-template<class ThreadSafeGlobalMap>
-typename intermodule_singleton_common<ThreadSafeGlobalMap>::mem_holder_t
-   intermodule_singleton_common<ThreadSafeGlobalMap>::mem_holder;
-
-//A reference count to be stored in global map holding the number
-//of singletons (one per module) attached to the instance pointed by
-//the internal ptr.
-struct ref_count_ptr
-{
-   ref_count_ptr(void *p, boost::uint32_t count)
-      : ptr(p), singleton_ref_count(count)
-   {}
-   void *ptr;
-   //This reference count serves to count the number of attached
-   //modules to this singleton
-   volatile boost::uint32_t singleton_ref_count;
-};
-
-
-//Now this class is a singleton, initializing the singleton in
-//the first get() function call if LazyInit is true. If false
-//then the singleton will be initialized when loading the module.
-template<typename C, bool LazyInit, bool Phoenix, class ThreadSafeGlobalMap>
-class intermodule_singleton_impl
-{
-   public:
-
-   static C& get()   //Let's make inlining easy
-   {
-      if(!this_module_singleton_ptr){
-         if(lifetime.dummy_function()){  //This forces lifetime instantiation, for reference counted destruction
-            atentry_work();
-         }
-      }
-      return *static_cast<C*>(this_module_singleton_ptr);
-   }
-
-   private:
-
-   static void atentry_work()
-   {
-      intermodule_singleton_common<ThreadSafeGlobalMap>::initialize_singleton_logic
-         (this_module_singleton_ptr, this_module_singleton_initialized, singleton_constructor, Phoenix);
-   }
-
-   static void atexit_work()
-   {
-      intermodule_singleton_common<ThreadSafeGlobalMap>::finalize_singleton_logic
-         (this_module_singleton_ptr, this_module_singleton_initialized, singleton_destructor);
-   }
-
-   //These statics will be zero-initialized without any constructor call dependency
-   //this_module_singleton_ptr will be a module-local pointer to the singleton
-   static void*                      this_module_singleton_ptr;
-
-   //this_module_singleton_count will be used to synchronize threads of the same module
-   //for access to a singleton instance, and to flag the state of the
-   //singleton.
-   static volatile boost::uint32_t   this_module_singleton_initialized;
-
-   //This class destructor will trigger singleton destruction
-   struct lifetime_type_lazy
-   {
-      bool dummy_function()
-      {  return m_dummy == 0; }
-
-      ~lifetime_type_lazy()
-      {
-         //if(!Phoenix){
-            //atexit_work();
-         //}
-      }
-
-      //Dummy volatile so that the compiler can't resolve its value at compile-time
-      //and can't avoid lifetime_type instantiation if dummy_function() is called.
-      static volatile int m_dummy;
-   };
-
-   struct lifetime_type_static
-      : public lifetime_type_lazy
-   {
-      lifetime_type_static()
-      {  atentry_work();  }
-   };
-
-   typedef typename if_c
-      <LazyInit, lifetime_type_lazy, lifetime_type_static>::type lifetime_type;
-
-   static lifetime_type lifetime;
-
-   //A functor to be executed inside global map lock that just
-   //searches for the singleton in map and if not present creates a new one.
-   //If singleton constructor throws, the exception is propagated
-   struct init_atomic_func
-   {
-      init_atomic_func(ThreadSafeGlobalMap &m)
-         : m_map(m), ret_ptr()
-      {}
-
-      void operator()()
-      {
-         ref_count_ptr *rcount = intermodule_singleton_helpers::thread_safe_global_map_dependant
-            <ThreadSafeGlobalMap>::find(m_map, typeid(C).name());
-         if(!rcount){
-            C *p = new C;
-            BOOST_TRY{
-               ref_count_ptr val(p, 0u);
-               rcount = intermodule_singleton_helpers::thread_safe_global_map_dependant
-                           <ThreadSafeGlobalMap>::insert(m_map, typeid(C).name(), val);
-            }
-            BOOST_CATCH(...){
-               intermodule_singleton_helpers::thread_safe_global_map_dependant
-                           <ThreadSafeGlobalMap>::erase(m_map, typeid(C).name());
-               delete p;
-               BOOST_RETHROW
-            } BOOST_CATCH_END
-         }
-         //if(Phoenix){
-            std::atexit(&atexit_work);
-         //}
-         atomic_inc32(&rcount->singleton_ref_count);
-         ret_ptr = rcount->ptr;
-      }
-      void *data() const
-         { return ret_ptr;  }
-
-      private:
-      ThreadSafeGlobalMap &m_map;
-      void *ret_ptr;
-   };
-
-   //A functor to be executed inside global map lock that just
-   //deletes the singleton in map if the attached count reaches to zero
-   struct fini_atomic_func
-   {
-      fini_atomic_func(ThreadSafeGlobalMap &m)
-         : m_map(m)
-      {}
-
-      void operator()()
-      {
-         ref_count_ptr *rcount = intermodule_singleton_helpers::thread_safe_global_map_dependant
-            <ThreadSafeGlobalMap>::find(m_map, typeid(C).name());
-            //The object must exist
-         BOOST_ASSERT(rcount);
-         BOOST_ASSERT(rcount->singleton_ref_count > 0);
-         //Check if last reference
-         if(atomic_dec32(&rcount->singleton_ref_count) == 1){
-            //If last, destroy the object
-            BOOST_ASSERT(rcount->ptr != 0);
-            C *pc = static_cast<C*>(rcount->ptr);
-            //Now destroy map entry
-            bool destroyed = intermodule_singleton_helpers::thread_safe_global_map_dependant
-                        <ThreadSafeGlobalMap>::erase(m_map, typeid(C).name());
-            (void)destroyed;  BOOST_ASSERT(destroyed == true);
-            delete pc;
-         }
-      }
-
-      private:
-      ThreadSafeGlobalMap &m_map;
-   };
-
-   //A wrapper to execute init_atomic_func
-   static void *singleton_constructor(ThreadSafeGlobalMap &map)
-   {
-      init_atomic_func f(map);
-      intermodule_singleton_helpers::thread_safe_global_map_dependant
-                  <ThreadSafeGlobalMap>::atomic_func(map, f);
-      return f.data();
-   }
-
-   //A wrapper to execute fini_atomic_func
-   static void singleton_destructor(void *p, ThreadSafeGlobalMap &map)
-   {  (void)p;
-      fini_atomic_func f(map);
-      intermodule_singleton_helpers::thread_safe_global_map_dependant
-                  <ThreadSafeGlobalMap>::atomic_func(map, f);
-   }
-};
-
-template <typename C, bool L, bool P, class ThreadSafeGlobalMap>
-volatile int intermodule_singleton_impl<C, L, P, ThreadSafeGlobalMap>::lifetime_type_lazy::m_dummy = 0;
-
-//These will be zero-initialized by the loader
-template <typename C, bool L, bool P, class ThreadSafeGlobalMap>
-void *intermodule_singleton_impl<C, L, P, ThreadSafeGlobalMap>::this_module_singleton_ptr = 0;
-
-template <typename C, bool L, bool P, class ThreadSafeGlobalMap>
-volatile boost::uint32_t intermodule_singleton_impl<C, L, P, ThreadSafeGlobalMap>::this_module_singleton_initialized = 0;
-
-template <typename C, bool L, bool P, class ThreadSafeGlobalMap>
-typename intermodule_singleton_impl<C, L, P, ThreadSafeGlobalMap>::lifetime_type
-   intermodule_singleton_impl<C, L, P, ThreadSafeGlobalMap>::lifetime;
-
-}  //namespace ipcdetail{
-}  //namespace interprocess{
-}  //namespace boost{
-
-#include <boost/interprocess/detail/config_end.hpp>
-
-#endif   //#ifndef BOOST_INTERPROCESS_INTERMODULE_SINGLETON_COMMON_HPP
diff --git a/src/boost/interprocess/detail/interprocess_tester.hpp b/src/boost/interprocess/detail/interprocess_tester.hpp
deleted file mode 100644
index 368820f8..00000000
--- a/src/boost/interprocess/detail/interprocess_tester.hpp
+++ /dev/null
@@ -1,39 +0,0 @@
-//////////////////////////////////////////////////////////////////////////////
-//
-// (C) Copyright Ion Gaztanaga 2007-2012. Distributed under the Boost
-// 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/interprocess for documentation.
-//
-//////////////////////////////////////////////////////////////////////////////
-
-#ifndef BOOST_INTERPROCESS_DETAIL_INTERPROCESS_TESTER_HPP
-#define BOOST_INTERPROCESS_DETAIL_INTERPROCESS_TESTER_HPP
-
-#ifndef BOOST_CONFIG_HPP
-#  include <boost/config.hpp>
-#endif
-#
-#if defined(BOOST_HAS_PRAGMA_ONCE)
-#  pragma once
-#endif
-
-namespace boost{
-namespace interprocess{
-namespace ipcdetail{
-
-class interprocess_tester
-{
-   public:
-   template<class T>
-   static void dont_close_on_destruction(T &t)
-   {  t.dont_close_on_destruction(); }
-};
-
-}  //namespace ipcdetail{
-}  //namespace interprocess{
-}  //namespace boost{
-
-#endif   //#ifndef BOOST_INTERPROCESS_DETAIL_INTERPROCESS_TESTER_HPP
-
diff --git a/src/boost/interprocess/detail/managed_global_memory.hpp b/src/boost/interprocess/detail/managed_global_memory.hpp
deleted file mode 100644
index fdf9e1f0..00000000
--- a/src/boost/interprocess/detail/managed_global_memory.hpp
+++ /dev/null
@@ -1,119 +0,0 @@
-//////////////////////////////////////////////////////////////////////////////
-//
-// (C) Copyright Ion Gaztanaga 2009-2012. Distributed under the Boost
-// 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/interprocess for documentation.
-//
-//////////////////////////////////////////////////////////////////////////////
-
-#ifndef BOOST_INTERPROCESS_BASIC_GLOBAL_MEMORY_HPP
-#define BOOST_INTERPROCESS_BASIC_GLOBAL_MEMORY_HPP
-
-#ifndef BOOST_CONFIG_HPP
-#  include <boost/config.hpp>
-#endif
-#
-#if defined(BOOST_HAS_PRAGMA_ONCE)
-#pragma once
-#endif
-
-#include <boost/interprocess/detail/config_begin.hpp>
-#include <boost/interprocess/detail/workaround.hpp>
-
-#include <boost/interprocess/offset_ptr.hpp>
-#include <boost/interprocess/sync/spin/mutex.hpp>
-#include <boost/interprocess/sync/spin/recursive_mutex.hpp>
-#include <boost/interprocess/detail/managed_memory_impl.hpp>
-#include <boost/interprocess/detail/managed_open_or_create_impl.hpp>
-#include <boost/interprocess/mem_algo/rbtree_best_fit.hpp>
-#include <boost/interprocess/indexes/iset_index.hpp>
-#include <boost/interprocess/creation_tags.hpp>
-#include <boost/interprocess/permissions.hpp>
-
-namespace boost{
-namespace interprocess{
-namespace ipcdetail{
-
-struct intermodule_singleton_mutex_family
-{
-   typedef boost::interprocess::ipcdetail::spin_mutex              mutex_type;
-   typedef boost::interprocess::ipcdetail::spin_recursive_mutex    recursive_mutex_type;
-};
-
-struct intermodule_types
-{
-   //We must use offset_ptr since a loaded DLL can map the singleton holder shared memory
-   //at a different address than other DLLs or the main executable
-   typedef rbtree_best_fit<intermodule_singleton_mutex_family, offset_ptr<void> > mem_algo;
-   template<class Device, bool FileBased>
-   struct open_or_create
-   {
-      typedef managed_open_or_create_impl
-            <Device, mem_algo::Alignment, FileBased, false> type;
-   };
-};
-
-//we must implement our own managed shared memory to avoid circular dependencies
-template<class Device, bool FileBased>
-class basic_managed_global_memory
-   : public basic_managed_memory_impl
-      < char
-      , intermodule_types::mem_algo
-      , iset_index
-      , intermodule_types::open_or_create<Device, FileBased>::type::ManagedOpenOrCreateUserOffset
-      >
-   , private intermodule_types::open_or_create<Device, FileBased>::type
-{
-   #if !defined(BOOST_INTERPROCESS_DOXYGEN_INVOKED)
-   typedef typename intermodule_types::template open_or_create<Device, FileBased>::type base2_t;
-
-   typedef basic_managed_memory_impl
-      < char
-      , intermodule_types::mem_algo
-      , iset_index
-      , base2_t::ManagedOpenOrCreateUserOffset
-      > base_t;
-
-   typedef create_open_func<base_t>        create_open_func_t;
-
-   basic_managed_global_memory *get_this_pointer()
-   {  return this;   }
-
-   public:
-   typedef typename base_t::size_type              size_type;
-
-   private:
-   typedef typename base_t::char_ptr_holder_t   char_ptr_holder_t;
-   BOOST_MOVABLE_BUT_NOT_COPYABLE(basic_managed_global_memory)
-   #endif   //#ifndef BOOST_INTERPROCESS_DOXYGEN_INVOKED
-
-   public: //functions
-
-   basic_managed_global_memory (open_or_create_t,
-                              const char *name, size_type size,
-                              const void *addr = 0, const permissions& perm = permissions())
-      : base_t()
-      , base2_t(open_or_create_t(), name, size, read_write, addr,
-                create_open_func_t(get_this_pointer(),
-                DoOpenOrCreate), perm)
-   {}
-
-   basic_managed_global_memory (open_only_t , const char* name,
-                                const void *addr = 0)
-      : base_t()
-      , base2_t(open_only_t(), name, read_write, addr,
-                create_open_func_t(get_this_pointer(),
-                DoOpen))
-   {}
-};
-
-
-}  //namespace ipcdetail{
-}  //namespace interprocess{
-}  //namespace boost{
-
-#include <boost/interprocess/detail/config_end.hpp>
-
-#endif   //#ifndef BOOST_INTERPROCESS_BASIC_GLOBAL_MEMORY_HPP
diff --git a/src/boost/interprocess/detail/managed_memory_impl.hpp b/src/boost/interprocess/detail/managed_memory_impl.hpp
deleted file mode 100644
index 72e242d5..00000000
--- a/src/boost/interprocess/detail/managed_memory_impl.hpp
+++ /dev/null
@@ -1,775 +0,0 @@
-//////////////////////////////////////////////////////////////////////////////
-//
-// (C) Copyright Ion Gaztanaga 2005-2012. Distributed under the Boost
-// 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/interprocess for documentation.
-//
-//////////////////////////////////////////////////////////////////////////////
-
-#ifndef BOOST_INTERPROCESS_DETAIL_MANAGED_MEMORY_IMPL_HPP
-#define BOOST_INTERPROCESS_DETAIL_MANAGED_MEMORY_IMPL_HPP
-
-#ifndef BOOST_CONFIG_HPP
-#  include <boost/config.hpp>
-#endif
-#
-#if defined(BOOST_HAS_PRAGMA_ONCE)
-#  pragma once
-#endif
-
-#include <boost/interprocess/detail/config_begin.hpp>
-#include <boost/interprocess/detail/workaround.hpp>
-
-#include <boost/interprocess/interprocess_fwd.hpp>
-#include <boost/interprocess/detail/utilities.hpp>
-#include <boost/interprocess/detail/os_file_functions.hpp>
-#include <boost/interprocess/creation_tags.hpp>
-#include <boost/interprocess/exceptions.hpp>
-#include <boost/interprocess/segment_manager.hpp>
-#include <boost/interprocess/sync/scoped_lock.hpp>
-#include <boost/interprocess/detail/nothrow.hpp>
-#include <boost/interprocess/detail/simple_swap.hpp>
-//
-#include <boost/core/no_exceptions_support.hpp>
-//
-#include <boost/intrusive/detail/minimal_pair_header.hpp>
-#include <boost/assert.hpp>
-
-//!\file
-//!Describes a named shared memory allocation user class.
-//!
-
-namespace boost {
-namespace interprocess {
-namespace ipcdetail {
-
-template<class BasicManagedMemoryImpl>
-class create_open_func;
-
-template<
-         class CharType,
-         class MemoryAlgorithm,
-         template<class IndexConfig> class IndexType
-        >
-struct segment_manager_type
-{
-   typedef segment_manager<CharType, MemoryAlgorithm, IndexType> type;
-};
-
-//!This class is designed to be a base class to classes that manage
-//!creation of objects in a fixed size memory buffer. Apart
-//!from allocating raw memory, the user can construct named objects. To
-//!achieve this, this class uses the reserved space provided by the allocation
-//!algorithm to place a named_allocator_algo, who takes care of name mappings.
-//!The class can be customized with the char type used for object names
-//!and the memory allocation algorithm to be used.*/
-template <  class CharType
-         ,  class MemoryAlgorithm
-         ,  template<class IndexConfig> class IndexType
-         ,  std::size_t Offset = 0
-         >
-class basic_managed_memory_impl
-{
-   //Non-copyable
-   basic_managed_memory_impl(const basic_managed_memory_impl &);
-   basic_managed_memory_impl &operator=(const basic_managed_memory_impl &);
-
-   template<class BasicManagedMemoryImpl>
-   friend class create_open_func;
-
-   public:
-   typedef typename segment_manager_type
-      <CharType, MemoryAlgorithm, IndexType>::type    segment_manager;
-   typedef CharType                                   char_type;
-   typedef MemoryAlgorithm                            memory_algorithm;
-   typedef typename MemoryAlgorithm::mutex_family     mutex_family;
-   typedef CharType                                   char_t;
-   typedef typename MemoryAlgorithm::size_type        size_type;
-   typedef typename MemoryAlgorithm::difference_type  difference_type;
-   typedef difference_type                            handle_t;
-   typedef typename segment_manager::
-      const_named_iterator                            const_named_iterator;
-   typedef typename segment_manager::
-      const_unique_iterator                           const_unique_iterator;
-
-   #if !defined(BOOST_INTERPROCESS_DOXYGEN_INVOKED)
-
-   typedef typename
-           segment_manager::char_ptr_holder_t         char_ptr_holder_t;
-   //Experimental. Don't use.
-
-   typedef typename segment_manager::multiallocation_chain  multiallocation_chain;
-
-   #endif   //#ifndef BOOST_INTERPROCESS_DOXYGEN_INVOKED
-
-   static const size_type PayloadPerAllocation = segment_manager::PayloadPerAllocation;
-
-   private:
-   typedef basic_managed_memory_impl
-               <CharType, MemoryAlgorithm, IndexType, Offset> self_t;
-   protected:
-   template<class ManagedMemory, class CharT>
-   static bool grow(const CharT *filename, size_type extra_bytes)
-   {
-      typedef typename ManagedMemory::device_type device_type;
-      //Increase file size
-      BOOST_TRY{
-         offset_t old_size;
-         {
-            device_type f(open_or_create, filename, read_write);
-            if(!f.get_size(old_size))
-               return false;
-            f.truncate(old_size + static_cast<offset_t>(extra_bytes));
-         }
-         ManagedMemory managed_memory(open_only, filename);
-         //Grow always works
-         managed_memory.self_t::grow(extra_bytes);
-      }
-      BOOST_CATCH(...){
-         return false;
-      } BOOST_CATCH_END
-      return true;
-   }
-
-   template<class ManagedMemory, class CharT>
-   static bool shrink_to_fit(const CharT *filename)
-   {
-      typedef typename ManagedMemory::device_type device_type;
-      size_type new_size;
-      BOOST_TRY{
-         ManagedMemory managed_memory(open_only, filename);
-         managed_memory.get_size();
-         managed_memory.self_t::shrink_to_fit();
-         new_size = managed_memory.get_size();
-      }
-      BOOST_CATCH(...){
-         return false;
-      } BOOST_CATCH_END
-
-      //Decrease file size
-      {
-         device_type f(open_or_create, filename, read_write);
-         f.truncate(static_cast<offset_t>(new_size));
-      }
-      return true;
-   }
-
-   //!Constructor. Allocates basic resources. Never throws.
-   basic_managed_memory_impl()
-      : mp_header(0){}
-
-   //!Destructor. Calls close. Never throws.
-   ~basic_managed_memory_impl()
-   {  this->close_impl(); }
-
-   //!Places segment manager in the reserved space. This can throw.
-   bool  create_impl   (void *addr, size_type size)
-   {
-      if(mp_header)  return false;
-
-      //Check if there is enough space
-      if(size < segment_manager::get_min_size())
-         return false;
-
-      //This function should not throw. The index construction can
-      //throw if constructor allocates memory. So we must catch it.
-      BOOST_TRY{
-         //Let's construct the allocator in memory
-         BOOST_ASSERT((0 == (std::size_t)addr % boost::move_detail::alignment_of<segment_manager>::value));
-         mp_header       = ::new(addr, boost_container_new_t()) segment_manager(size);
-      }
-      BOOST_CATCH(...){
-         return false;
-      } BOOST_CATCH_END
-      return true;
-   }
-
-   //!Connects to a segment manager in the reserved buffer. Never throws.
-   bool  open_impl     (void *addr, size_type)
-   {
-      if(mp_header)  return false;
-      mp_header = static_cast<segment_manager*>(addr);
-      return true;
-   }
-
-   //!Frees resources. Never throws.
-   bool close_impl()
-   {
-      bool ret = mp_header != 0;
-      mp_header = 0;
-      return ret;
-   }
-
-   //!Frees resources and destroys common resources. Never throws.
-   bool destroy_impl()
-   {
-      if(mp_header == 0)
-         return false;
-      mp_header->~segment_manager();
-      this->close_impl();
-         return true;
-   }
-
-   //!
-   void grow(size_type extra_bytes)
-   {  mp_header->grow(extra_bytes); }
-
-   void shrink_to_fit()
-   {  mp_header->shrink_to_fit(); }
-
-   public:
-
-   //!Returns segment manager. Never throws.
-   segment_manager *get_segment_manager() const
-   {   return mp_header; }
-
-   //!Returns the base address of the memory in this process. Never throws.
-   void *   get_address   () const
-   {   return reinterpret_cast<char*>(mp_header) - Offset; }
-
-   //!Returns the size of memory segment. Never throws.
-   size_type   get_size   () const
-   {   return mp_header->get_size() + Offset;  }
-
-   //!Returns the number of free bytes of the memory
-   //!segment
-   size_type get_free_memory() const
-   {  return mp_header->get_free_memory();  }
-
-   //!Returns the result of "all_memory_deallocated()" function
-   //!of the used memory algorithm
-   bool all_memory_deallocated()
-   {   return mp_header->all_memory_deallocated(); }
-
-   //!Returns the result of "check_sanity()" function
-   //!of the used memory algorithm
-   bool check_sanity()
-   {   return mp_header->check_sanity(); }
-
-   //!Writes to zero free memory (memory not yet allocated) of
-   //!the memory algorithm
-   void zero_free_memory()
-   {   mp_header->zero_free_memory(); }
-
-   //!Transforms an absolute address into an offset from base address.
-   //!The address must belong to the memory segment. Never throws.
-   handle_t get_handle_from_address   (const void *ptr) const
-   {
-      return (handle_t)(reinterpret_cast<const char*>(ptr) -
-             reinterpret_cast<const char*>(this->get_address()));
-   }
-
-   //!Returns true if the address belongs to the managed memory segment
-   bool belongs_to_segment (const void *ptr) const
-   {
-      return ptr >= this->get_address() &&
-             ptr <  (reinterpret_cast<const char*>(this->get_address()) + this->get_size());
-   }
-
-   //!Transforms previously obtained offset into an absolute address in the
-   //!process space of the current process. Never throws.*/
-   void *    get_address_from_handle (handle_t offset) const
-   {  return reinterpret_cast<char*>(this->get_address()) + offset; }
-
-   //!Searches for nbytes of free memory in the segment, marks the
-   //!memory as used and return the pointer to the memory. If no
-   //!memory is available throws a boost::interprocess::bad_alloc exception
-   void* allocate             (size_type nbytes)
-   {   return mp_header->allocate(nbytes);   }
-
-   //!Searches for nbytes of free memory in the segment, marks the
-   //!memory as used and return the pointer to the memory. If no memory
-   //!is available returns 0. Never throws.
-   void* allocate             (size_type nbytes, const std::nothrow_t &tag)
-   {   return mp_header->allocate(nbytes, tag);  }
-
-   //!Allocates nbytes bytes aligned to "alignment" bytes. "alignment"
-   //!must be power of two. If no memory
-   //!is available returns 0. Never throws.
-   void * allocate_aligned (size_type nbytes, size_type alignment, const std::nothrow_t &tag)
-   {   return mp_header->allocate_aligned(nbytes, alignment, tag);  }
-
-   template<class T>
-   T * allocation_command  (boost::interprocess::allocation_type command,   size_type limit_size,
-                           size_type &prefer_in_recvd_out_size, T *&reuse)
-   {  return mp_header->allocation_command(command, limit_size, prefer_in_recvd_out_size, reuse);  }
-
-   //!Allocates nbytes bytes aligned to "alignment" bytes. "alignment"
-   //!must be power of two. If no
-   //!memory is available throws a boost::interprocess::bad_alloc exception
-   void * allocate_aligned(size_type nbytes, size_type alignment)
-   {   return mp_header->allocate_aligned(nbytes, alignment);  }
-
-   #if !defined(BOOST_INTERPROCESS_DOXYGEN_INVOKED)
-
-   //Experimental. Don't use.
-
-   //!Allocates n_elements of elem_bytes bytes.
-   //!Throws bad_alloc on failure. chain.size() is not increased on failure.
-   void allocate_many(size_type elem_bytes, size_type n_elements, multiallocation_chain &chain)
-   {  mp_header->allocate_many(elem_bytes, n_elements, chain); }
-
-   //!Allocates n_elements, each one of element_lengths[i]*sizeof_element bytes.
-   //!Throws bad_alloc on failure. chain.size() is not increased on failure.
-   void allocate_many(const size_type *element_lengths, size_type n_elements, size_type sizeof_element, multiallocation_chain &chain)
-   {  mp_header->allocate_many(element_lengths, n_elements, sizeof_element, chain); }
-
-   //!Allocates n_elements of elem_bytes bytes.
-   //!Non-throwing version. chain.size() is not increased on failure.
-   void allocate_many(const std::nothrow_t &tag, size_type elem_bytes, size_type n_elements, multiallocation_chain &chain)
-   {  mp_header->allocate_many(tag, elem_bytes, n_elements, chain); }
-
-   //!Allocates n_elements, each one of
-   //!element_lengths[i]*sizeof_element bytes.
-   //!Non-throwing version. chain.size() is not increased on failure.
-   void allocate_many(const std::nothrow_t &tag, const size_type *elem_sizes, size_type n_elements, size_type sizeof_element, multiallocation_chain &chain)
-   {  mp_header->allocate_many(tag, elem_sizes, n_elements, sizeof_element, chain); }
-
-   //!Deallocates all elements contained in chain.
-   //!Never throws.
-   void deallocate_many(multiallocation_chain &chain)
-   {  mp_header->deallocate_many(chain); }
-
-   #endif   //#ifndef BOOST_INTERPROCESS_DOXYGEN_INVOKED
-
-   //!Marks previously allocated memory as free. Never throws.
-   void  deallocate           (void *addr)
-   {   if (mp_header) mp_header->deallocate(addr);  }
-
-   //!Tries to find a previous named allocation address. Returns a memory
-   //!buffer and the object count. If not found returned pointer is 0.
-   //!Never throws.
-   template <class T>
-   std::pair<T*, size_type> find  (char_ptr_holder_t name)
-   {   return mp_header->template find<T>(name); }
-
-   //!Creates a named object or array in memory
-   //!
-   //!Allocates and constructs a T object or an array of T in memory,
-   //!associates this with the given name and returns a pointer to the
-   //!created object. If an array is being constructed all objects are
-   //!created using the same parameters given to this function.
-   //!
-   //!-> If the name was previously used, returns 0.
-   //!
-   //!-> Throws boost::interprocess::bad_alloc if there is no available memory
-   //!
-   //!-> If T's constructor throws, the function throws that exception.
-   //!
-   //!Memory is freed automatically if T's constructor throws and if an
-   //!array was being constructed, destructors of created objects are called
-   //!before freeing the memory.
-   template <class T>
-   typename segment_manager::template construct_proxy<T>::type
-      construct(char_ptr_holder_t name)
-   {   return mp_header->template construct<T>(name);  }
-
-   //!Finds or creates a named object or array in memory
-   //!
-   //!Tries to find an object with the given name in memory. If
-   //!found, returns the pointer to this pointer. If the object is not found,
-   //!allocates and constructs a T object or an array of T in memory,
-   //!associates this with the given name and returns a pointer to the
-   //!created object. If an array is being constructed all objects are
-   //!created using the same parameters given to this function.
-   //!
-   //!-> Throws boost::interprocess::bad_alloc if there is no available memory
-   //!
-   //!-> If T's constructor throws, the function throws that exception.
-   //!
-   //!Memory is freed automatically if T's constructor throws and if an
-   //!array was being constructed, destructors of created objects are called
-   //!before freeing the memory.
-   template <class T>
-   typename segment_manager::template construct_proxy<T>::type
-      find_or_construct(char_ptr_holder_t name)
-   {   return mp_header->template find_or_construct<T>(name);  }
-
-   //!Creates a named object or array in memory
-   //!
-   //!Allocates and constructs a T object or an array of T in memory,
-   //!associates this with the given name and returns a pointer to the
-   //!created object. If an array is being constructed all objects are
-   //!created using the same parameters given to this function.
-   //!
-   //!-> If the name was previously used, returns 0.
-   //!
-   //!-> Returns 0 if there is no available memory
-   //!
-   //!-> If T's constructor throws, the function throws that exception.
-   //!
-   //!Memory is freed automatically if T's constructor throws and if an
-   //!array was being constructed, destructors of created objects are called
-   //!before freeing the memory.
-   template <class T>
-   typename segment_manager::template construct_proxy<T>::type
-      construct(char_ptr_holder_t name, const std::nothrow_t &tag)
-   {   return mp_header->template construct<T>(name, tag);  }
-
-   //!Finds or creates a named object or array in memory
-   //!
-   //!Tries to find an object with the given name in memory. If
-   //!found, returns the pointer to this pointer. If the object is not found,
-   //!allocates and constructs a T object or an array of T in memory,
-   //!associates this with the given name and returns a pointer to the
-   //!created object. If an array is being constructed all objects are
-   //!created using the same parameters given to this function.
-   //!
-   //!-> Returns 0 if there is no available memory
-   //!
-   //!-> If T's constructor throws, the function throws that exception.
-   //!
-   //!Memory is freed automatically if T's constructor throws and if an
-   //!array was being constructed, destructors of created objects are called
-   //!before freeing the memory.
-   template <class T>
-   typename segment_manager::template construct_proxy<T>::type
-      find_or_construct(char_ptr_holder_t name, const std::nothrow_t &tag)
-   {   return mp_header->template find_or_construct<T>(name, tag);  }
-
-   //!Creates a named array from iterators in memory
-   //!
-   //!Allocates and constructs an array of T in memory,
-   //!associates this with the given name and returns a pointer to the
-   //!created object. Each element in the array is created using the
-   //!objects returned when dereferencing iterators as parameters
-   //!and incrementing all iterators for each element.
-   //!
-   //!-> If the name was previously used, returns 0.
-   //!
-   //!-> Throws boost::interprocess::bad_alloc if there is no available memory
-   //!
-   //!-> If T's constructor throws, the function throws that exception.
-   //!
-   //!Memory is freed automatically if T's constructor throws and
-   //!destructors of created objects are called before freeing the memory.
-   template <class T>
-   typename segment_manager::template construct_iter_proxy<T>::type
-      construct_it(char_ptr_holder_t name)
-   {   return mp_header->template construct_it<T>(name);  }
-
-   //!Finds or creates a named array from iterators in memory
-   //!
-   //!Tries to find an object with the given name in memory. If
-   //!found, returns the pointer to this pointer. If the object is not found,
-   //!allocates and constructs an array of T in memory,
-   //!associates this with the given name and returns a pointer to the
-   //!created object. Each element in the array is created using the
-   //!objects returned when dereferencing iterators as parameters
-   //!and incrementing all iterators for each element.
-   //!
-   //!-> If the name was previously used, returns 0.
-   //!
-   //!-> Throws boost::interprocess::bad_alloc if there is no available memory
-   //!
-   //!-> If T's constructor throws, the function throws that exception.
-   //!
-   //!Memory is freed automatically if T's constructor throws and
-   //!destructors of created objects are called before freeing the memory.
-   template <class T>
-   typename segment_manager::template construct_iter_proxy<T>::type
-      find_or_construct_it(char_ptr_holder_t name)
-   {   return mp_header->template find_or_construct_it<T>(name);  }
-
-   //!Creates a named array from iterators in memory
-   //!
-   //!Allocates and constructs an array of T in memory,
-   //!associates this with the given name and returns a pointer to the
-   //!created object. Each element in the array is created using the
-   //!objects returned when dereferencing iterators as parameters
-   //!and incrementing all iterators for each element.
-   //!
-   //!-> If the name was previously used, returns 0.
-   //!
-   //!-> If there is no available memory, returns 0.
-   //!
-   //!-> If T's constructor throws, the function throws that exception.
-   //!
-   //!Memory is freed automatically if T's constructor throws and
-   //!destructors of created objects are called before freeing the memory.*/
-   template <class T>
-   typename segment_manager::template construct_iter_proxy<T>::type
-      construct_it(char_ptr_holder_t name, const std::nothrow_t &tag)
-   {   return mp_header->template construct_it<T>(name, tag);  }
-
-   //!Finds or creates a named array from iterators in memory
-   //!
-   //!Tries to find an object with the given name in memory. If
-   //!found, returns the pointer to this pointer. If the object is not found,
-   //!allocates and constructs an array of T in memory,
-   //!associates this with the given name and returns a pointer to the
-   //!created object. Each element in the array is created using the
-   //!objects returned when dereferencing iterators as parameters
-   //!and incrementing all iterators for each element.
-   //!
-   //!-> If the name was previously used, returns 0.
-   //!
-   //!-> If there is no available memory, returns 0.
-   //!
-   //!-> If T's constructor throws, the function throws that exception.
-   //!
-   //!Memory is freed automatically if T's constructor throws and
-   //!destructors of created objects are called before freeing the memory.*/
-   template <class T>
-   typename segment_manager::template construct_iter_proxy<T>::type
-      find_or_construct_it(char_ptr_holder_t name, const std::nothrow_t &tag)
-   {   return mp_header->template find_or_construct_it<T>(name, tag);  }
-
-   //!Calls a functor and guarantees that no new construction, search or
-   //!destruction will be executed by any process while executing the object
-   //!function call. If the functor throws, this function throws.
-   template <class Func>
-   void atomic_func(Func &f)
-   {   mp_header->atomic_func(f);  }
-
-   //!Tries to call a functor guaranteeing that no new construction, search or
-   //!destruction will be executed by any process while executing the object
-   //!function call. If the atomic function can't be immediatelly executed
-   //!because the internal mutex is already locked, returns false.
-   //!If the functor throws, this function throws.
-   template <class Func>
-   bool try_atomic_func(Func &f)
-   {   return mp_header->try_atomic_func(f); }
-
-   //!Destroys a named memory object or array.
-   //!
-   //!Finds the object with the given name, calls its destructors,
-   //!frees used memory and returns true.
-   //!
-   //!-> If the object is not found, it returns false.
-   //!
-   //!Exception Handling:
-   //!
-   //!When deleting a dynamically object or array, the Standard
-   //!does not guarantee that dynamically allocated memory, will be released.
-   //!Also, when deleting arrays, the Standard doesn't require calling
-   //!destructors for the rest of the objects if for one of them the destructor
-   //!terminated with an exception.
-   //!
-   //!Destroying an object:
-   //!
-   //!If the destructor throws, the memory will be freed and that exception
-   //!will be thrown.
-   //!
-   //!Destroying an array:
-   //!
-   //!When destroying an array, if a destructor throws, the rest of
-   //!destructors are called. If any of these throws, the exceptions are
-   //!ignored. The name association will be erased, memory will be freed and
-   //!the first exception will be thrown. This guarantees the unlocking of
-   //!mutexes and other resources.
-   //!
-   //!For all theses reasons, classes with throwing destructors are not
-   //!recommended.
-   template <class T>
-   bool destroy(const CharType *name)
-   {   return mp_header->template destroy<T>(name); }
-
-   //!Destroys the unique instance of type T
-   //!
-   //!Calls the destructor, frees used memory and returns true.
-   //!
-   //!Exception Handling:
-   //!
-   //!When deleting a dynamically object, the Standard does not
-   //!guarantee that dynamically allocated memory will be released.
-   //!
-   //!Destroying an object:
-   //!
-   //!If the destructor throws, the memory will be freed and that exception
-   //!will be thrown.
-   //!
-   //!For all theses reasons, classes with throwing destructors are not
-   //!recommended for  memory.
-   template <class T>
-   bool destroy(const unique_instance_t *const )
-   {   return mp_header->template destroy<T>(unique_instance);  }
-
-   //!Destroys the object (named, unique, or anonymous)
-   //!
-   //!Calls the destructor, frees used memory and returns true.
-   //!
-   //!Exception Handling:
-   //!
-   //!When deleting a dynamically object, the Standard does not
-   //!guarantee that dynamically allocated memory will be released.
-   //!
-   //!Destroying an object:
-   //!
-   //!If the destructor throws, the memory will be freed and that exception
-   //!will be thrown.
-   //!
-   //!For all theses reasons, classes with throwing destructors are not
-   //!recommended for  memory.
-   template <class T>
-   void destroy_ptr(const T *ptr)
-   {  mp_header->template destroy_ptr<T>(ptr); }
-
-   //!Returns the name of an object created with construct/find_or_construct
-   //!functions. If ptr points to an unique instance typeid(T).name() is returned.
-   template<class T>
-   static const char_type *get_instance_name(const T *ptr)
-   {  return segment_manager::get_instance_name(ptr);   }
-
-   //!Returns is the type an object created with construct/find_or_construct
-   //!functions. Does not throw.
-   template<class T>
-   static instance_type get_instance_type(const T *ptr)
-   {  return segment_manager::get_instance_type(ptr); }
-
-   //!Returns the length of an object created with construct/find_or_construct
-   //!functions (1 if is a single element, >=1 if it's an array). Does not throw.
-   template<class T>
-   static size_type get_instance_length(const T *ptr)
-   {  return segment_manager::get_instance_length(ptr); }
-
-   //!Preallocates needed index resources to optimize the
-   //!creation of "num" named objects in the  memory segment.
-   //!Can throw boost::interprocess::bad_alloc if there is no enough memory.
-   void reserve_named_objects(size_type num)
-   {  mp_header->reserve_named_objects(num);  }
-
-   //!Preallocates needed index resources to optimize the
-   //!creation of "num" unique objects in the  memory segment.
-   //!Can throw boost::interprocess::bad_alloc if there is no enough memory.
-   void reserve_unique_objects(size_type num)
-   {  mp_header->reserve_unique_objects(num);  }
-
-   //!Calls shrink_to_fit in both named and unique object indexes
-   //to try to free unused memory from those indexes.
-   void shrink_to_fit_indexes()
-   {  mp_header->shrink_to_fit_indexes();  }
-
-   //!Returns the number of named objects stored
-   //!in the managed segment.
-   size_type get_num_named_objects()
-   {  return mp_header->get_num_named_objects();  }
-
-   //!Returns the number of unique objects stored
-   //!in the managed segment.
-   size_type get_num_unique_objects()
-   {  return mp_header->get_num_unique_objects();  }
-
-   //!Returns a constant iterator to the index storing the
-   //!named allocations. NOT thread-safe. Never throws.
-   const_named_iterator named_begin() const
-   {  return mp_header->named_begin(); }
-
-   //!Returns a constant iterator to the end of the index
-   //!storing the named allocations. NOT thread-safe. Never throws.
-   const_named_iterator named_end() const
-   {  return mp_header->named_end(); }
-
-   //!Returns a constant iterator to the index storing the
-   //!unique allocations. NOT thread-safe. Never throws.
-   const_unique_iterator unique_begin() const
-   {  return mp_header->unique_begin(); }
-
-   //!Returns a constant iterator to the end of the index
-   //!storing the unique allocations. NOT thread-safe. Never throws.
-   const_unique_iterator unique_end() const
-   {  return mp_header->unique_end(); }
-
-   //!This is the default allocator to allocate types T
-   //!from this managed segment
-   template<class T>
-   struct allocator
-   {
-      typedef typename segment_manager::template allocator<T>::type type;
-   };
-
-   //!Returns an instance of the default allocator for type T
-   //!initialized that allocates memory from this segment manager.
-   template<class T>
-   typename allocator<T>::type
-      get_allocator()
-   {   return mp_header->template get_allocator<T>(); }
-
-   //!This is the default deleter to delete types T
-   //!from this managed segment.
-   template<class T>
-   struct deleter
-   {
-      typedef typename segment_manager::template deleter<T>::type type;
-   };
-
-   //!Returns an instance of the default allocator for type T
-   //!initialized that allocates memory from this segment manager.
-   template<class T>
-   typename deleter<T>::type
-      get_deleter()
-   {   return mp_header->template get_deleter<T>(); }
-
-   #if !defined(BOOST_INTERPROCESS_DOXYGEN_INVOKED)
-   //!Tries to find a previous named allocation address. Returns a memory
-   //!buffer and the object count. If not found returned pointer is 0.
-   //!Never throws.
-   template <class T>
-   std::pair<T*, size_type> find_no_lock  (char_ptr_holder_t name)
-   {   return mp_header->template find_no_lock<T>(name); }
-   #endif   //#ifndef BOOST_INTERPROCESS_DOXYGEN_INVOKED
-
-   protected:
-   //!Swaps the segment manager's managed by this managed memory segment.
-   //!NOT thread-safe. Never throws.
-   void swap(basic_managed_memory_impl &other)
-   {  (simple_swap)(mp_header, other.mp_header); }
-
-   private:
-   segment_manager *mp_header;
-};
-
-template<class BasicManagedMemoryImpl>
-class create_open_func
-{
-   typedef typename BasicManagedMemoryImpl::size_type size_type;
-
-   public:
-
-   create_open_func(BasicManagedMemoryImpl * const frontend, create_enum_t type)
-      : m_frontend(frontend), m_type(type){}
-
-   bool operator()(void *addr, std::size_t size, bool created) const
-   {
-      if( ((m_type == DoOpen)   &&  created) ||
-          ((m_type == DoCreate) && !created) ||
-          //Check for overflow
-          size_type(-1) < size ){
-         return false;
-      }
-      else if(created){
-         return m_frontend->create_impl(addr, static_cast<size_type>(size));
-      }
-      else{
-         return m_frontend->open_impl  (addr, static_cast<size_type>(size));
-      }
-   }
-
-   static std::size_t get_min_size()
-   {
-      const size_type sz = BasicManagedMemoryImpl::segment_manager::get_min_size();
-      if(sz > std::size_t(-1)){
-         //The minimum size is not representable by std::size_t
-         BOOST_ASSERT(false);
-         return std::size_t(-1);
-      }
-      else{
-         return static_cast<std::size_t>(sz);
-      }
-   }
-
-   private:
-   BasicManagedMemoryImpl *m_frontend;
-   create_enum_t           m_type;
-};
-
-}  //namespace ipcdetail {
-}  //namespace interprocess {
-}  //namespace boost {
-
-#include <boost/interprocess/detail/config_end.hpp>
-
-#endif   //BOOST_INTERPROCESS_DETAIL_MANAGED_MEMORY_IMPL_HPP
-
diff --git a/src/boost/interprocess/detail/managed_open_or_create_impl.hpp b/src/boost/interprocess/detail/managed_open_or_create_impl.hpp
deleted file mode 100644
index 84a89ad9..00000000
--- a/src/boost/interprocess/detail/managed_open_or_create_impl.hpp
+++ /dev/null
@@ -1,533 +0,0 @@
-//////////////////////////////////////////////////////////////////////////////
-//
-// (C) Copyright Ion Gaztanaga 2006-2012. Distributed under the Boost
-// 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/interprocess for documentation.
-//
-//////////////////////////////////////////////////////////////////////////////
-
-#ifndef BOOST_INTERPROCESS_MANAGED_OPEN_OR_CREATE_IMPL
-#define BOOST_INTERPROCESS_MANAGED_OPEN_OR_CREATE_IMPL
-
-#ifndef BOOST_CONFIG_HPP
-#  include <boost/config.hpp>
-#endif
-#
-#if defined(BOOST_HAS_PRAGMA_ONCE)
-#  pragma once
-#endif
-
-#include <boost/interprocess/detail/config_begin.hpp>
-#include <boost/interprocess/detail/os_thread_functions.hpp>
-#include <boost/interprocess/detail/os_file_functions.hpp>
-#include <boost/interprocess/creation_tags.hpp>
-#include <boost/interprocess/mapped_region.hpp>
-#include <boost/interprocess/detail/utilities.hpp>
-#include <boost/interprocess/detail/type_traits.hpp>
-#include <boost/interprocess/detail/atomic.hpp>
-#include <boost/interprocess/detail/interprocess_tester.hpp>
-#include <boost/interprocess/creation_tags.hpp>
-#include <boost/interprocess/detail/mpl.hpp>
-#include <boost/interprocess/permissions.hpp>
-#include <boost/container/detail/type_traits.hpp>  //alignment_of, aligned_storage
-#include <boost/interprocess/sync/spin/wait.hpp>
-#include <boost/interprocess/detail/timed_utils.hpp>
-#include <boost/move/move.hpp>
-#include <boost/cstdint.hpp>
-
-namespace boost {
-namespace interprocess {
-namespace ipcdetail {
-
-template <bool StoreDevice, class DeviceAbstraction>
-class managed_open_or_create_impl_device_holder
-{
-   public:
-   DeviceAbstraction &get_device()
-   {  static DeviceAbstraction dev; return dev; }
-
-   const DeviceAbstraction &get_device() const
-   {  static DeviceAbstraction dev; return dev; }
-};
-
-template <class DeviceAbstraction>
-class managed_open_or_create_impl_device_holder<true, DeviceAbstraction>
-{
-   public:
-   DeviceAbstraction &get_device()
-   {  return dev; }
-
-   const DeviceAbstraction &get_device() const
-   {  return dev; }
-
-   private:
-   DeviceAbstraction dev;
-};
-
-template<class DeviceAbstraction, std::size_t MemAlignment, bool FileBased, bool StoreDevice>
-class managed_open_or_create_impl
-   : public managed_open_or_create_impl_device_holder<StoreDevice, DeviceAbstraction>
-{
-   //Non-copyable
-   BOOST_MOVABLE_BUT_NOT_COPYABLE(managed_open_or_create_impl)
-   typedef bool_<FileBased> file_like_t;
-
-   static const unsigned MaxCreateOrOpenTries = BOOST_INTERPROCESS_MANAGED_OPEN_OR_CREATE_INITIALIZE_MAX_TRIES;
-   static const unsigned MaxInitializeTimeSec = BOOST_INTERPROCESS_MANAGED_OPEN_OR_CREATE_INITIALIZE_TIMEOUT_SEC;
-
-   typedef managed_open_or_create_impl_device_holder<StoreDevice, DeviceAbstraction> DevHolder;
-   enum
-   {
-      UninitializedSegment,
-      InitializingSegment,
-      InitializedSegment,
-      CorruptedSegment
-   };
-
-   static const std::size_t RequiredAlignment =
-      MemAlignment ? MemAlignment
-                   : boost::container::dtl::alignment_of< boost::container::dtl::max_align_t >::value
-                   ;
-
-   public:
-   static const std::size_t ManagedOpenOrCreateUserOffset =
-      ct_rounded_size<sizeof(boost::uint32_t), RequiredAlignment>::value;
-
-   managed_open_or_create_impl()
-   {}
-
-   template <class DeviceId>
-   managed_open_or_create_impl(create_only_t,
-                 const DeviceId & id,
-                 std::size_t size,
-                 mode_t mode,
-                 const void *addr,
-                 const permissions &perm)
-   {
-      priv_open_or_create
-         ( DoCreate
-         , id
-         , size
-         , mode
-         , addr
-         , perm
-         , null_mapped_region_function());
-   }
-
-   template <class DeviceId>
-   managed_open_or_create_impl(open_only_t,
-                 const DeviceId & id,
-                 mode_t mode,
-                 const void *addr)
-   {
-      priv_open_or_create
-         ( DoOpen
-         , id
-         , 0
-         , mode
-         , addr
-         , permissions()
-         , null_mapped_region_function());
-   }
-
-   template <class DeviceId>
-   managed_open_or_create_impl(open_or_create_t,
-                 const DeviceId & id,
-                 std::size_t size,
-                 mode_t mode,
-                 const void *addr,
-                 const permissions &perm)
-   {
-      priv_open_or_create
-         ( DoOpenOrCreate
-         , id
-         , size
-         , mode
-         , addr
-         , perm
-         , null_mapped_region_function());
-   }
-
-   template <class DeviceId, class ConstructFunc>
-   managed_open_or_create_impl(create_only_t,
-                 const DeviceId & id,
-                 std::size_t size,
-                 mode_t mode,
-                 const void *addr,
-                 const ConstructFunc &construct_func,
-                 const permissions &perm)
-   {
-      priv_open_or_create
-         (DoCreate
-         , id
-         , size
-         , mode
-         , addr
-         , perm
-         , construct_func);
-   }
-
-   template <class DeviceId, class ConstructFunc>
-   managed_open_or_create_impl(open_only_t,
-                 const DeviceId & id,
-                 mode_t mode,
-                 const void *addr,
-                 const ConstructFunc &construct_func)
-   {
-      priv_open_or_create
-         ( DoOpen
-         , id
-         , 0
-         , mode
-         , addr
-         , permissions()
-         , construct_func);
-   }
-
-   template <class DeviceId, class ConstructFunc>
-   managed_open_or_create_impl(open_or_create_t,
-                 const DeviceId & id,
-                 std::size_t size,
-                 mode_t mode,
-                 const void *addr,
-                 const ConstructFunc &construct_func,
-                 const permissions &perm)
-   {
-      priv_open_or_create
-         ( DoOpenOrCreate
-         , id
-         , size
-         , mode
-         , addr
-         , perm
-         , construct_func);
-   }
-
-   managed_open_or_create_impl(BOOST_RV_REF(managed_open_or_create_impl) moved)
-   {  this->swap(moved);   }
-
-   managed_open_or_create_impl &operator=(BOOST_RV_REF(managed_open_or_create_impl) moved)
-   {
-      managed_open_or_create_impl tmp(boost::move(moved));
-      this->swap(tmp);
-      return *this;
-   }
-
-   ~managed_open_or_create_impl()
-   {}
-
-   std::size_t get_user_size()  const
-   {  return m_mapped_region.get_size() - ManagedOpenOrCreateUserOffset; }
-
-   void *get_user_address()  const
-   {  return static_cast<char*>(m_mapped_region.get_address()) + ManagedOpenOrCreateUserOffset;  }
-
-   std::size_t get_real_size()  const
-   {  return m_mapped_region.get_size(); }
-
-   void *get_real_address()  const
-   {  return m_mapped_region.get_address();  }
-
-   void swap(managed_open_or_create_impl &other)
-   {
-      this->m_mapped_region.swap(other.m_mapped_region);
-   }
-
-   bool flush()
-   {  return m_mapped_region.flush();  }
-
-   const mapped_region &get_mapped_region() const
-   {  return m_mapped_region;  }
-
-   DeviceAbstraction &get_device()
-   {  return this->DevHolder::get_device(); }
-
-   const DeviceAbstraction &get_device() const
-   {  return this->DevHolder::get_device(); }
-
-   private:
-
-   //These are templatized to allow explicit instantiations
-   template<bool dummy>
-   static void truncate_device(DeviceAbstraction &, offset_t, false_)
-   {} //Empty
-
-   template<bool dummy>
-   static void truncate_device(DeviceAbstraction &dev, offset_t size, true_)
-   {  dev.truncate(size);  }
-
-
-   template<bool dummy>
-   static bool check_offset_t_size(std::size_t , false_)
-   { return true; } //Empty
-
-   template<bool dummy>
-   static bool check_offset_t_size(std::size_t size, true_)
-   { return size == std::size_t(offset_t(size)); }
-
-   //These are templatized to allow explicit instantiations
-   template<bool dummy, class DeviceId>
-   static void create_device(DeviceAbstraction &dev, const DeviceId & id, std::size_t size, const permissions &perm, false_ /*file_like*/)
-   {
-      DeviceAbstraction tmp(create_only, id, read_write, size, perm);
-      tmp.swap(dev);
-   }
-
-   template<bool dummy, class DeviceId>
-   static void create_device(DeviceAbstraction &dev, const DeviceId & id, std::size_t, const permissions &perm, true_ /*file_like*/)
-   {
-      DeviceAbstraction tmp(create_only, id, read_write, perm);
-      tmp.swap(dev);
-   }
-
-   template <class DeviceId>
-   static bool do_create_else_open(DeviceAbstraction &dev, const DeviceId & id, std::size_t size, const permissions &perm)
-   {
-      //This loop is very ugly, but brute force is sometimes better
-      //than diplomacy. In POSIX file-based resources we can' know if we
-      //effectively created the file or not (there is no ERROR_ALREADY_EXISTS equivalent),
-      //so we try to create exclusively and fallback to open if already exists, with
-      //some retries if opening also fails because the file does not exist
-      //(there is a race, the creator just removed the file after creating it).
-      //
-      //We'll put a maximum retry limit just to avoid possible deadlocks, we don't
-      //want to support pathological use cases.
-      spin_wait swait;
-      unsigned tries = 0;
-      while(1){
-         BOOST_TRY{
-            create_device<FileBased>(dev, id, size, perm, file_like_t());
-            return true;
-         }
-         BOOST_CATCH(interprocess_exception &ex){
-            #ifndef BOOST_NO_EXCEPTIONS
-            if(ex.get_error_code() != already_exists_error){
-               BOOST_RETHROW
-            }
-            else if (++tries == MaxCreateOrOpenTries) {
-               //File existing when trying to create, but non-existing when
-               //trying to open, and tried MaxCreateOrOpenTries times. Something fishy
-               //is happening here and we can't solve it
-               throw interprocess_exception(error_info(corrupted_error));
-            }
-            else{
-               BOOST_TRY{
-                  DeviceAbstraction tmp(open_only, id, read_write);
-                  dev.swap(tmp);
-                  return false;
-               }
-               BOOST_CATCH(interprocess_exception &e){
-                  if(e.get_error_code() != not_found_error){
-                     BOOST_RETHROW
-                  }
-               }
-               BOOST_CATCH(...){
-                  BOOST_RETHROW
-               } BOOST_CATCH_END
-            }
-            #endif   //#ifndef BOOST_NO_EXCEPTIONS
-         }
-         BOOST_CATCH(...){
-            BOOST_RETHROW
-         } BOOST_CATCH_END
-         swait.yield();
-      }
-      return false;
-   }
-
-   template <class ConstructFunc>
-   static void do_map_after_create
-      (DeviceAbstraction &dev, mapped_region &final_region,
-       std::size_t size, const void *addr, ConstructFunc construct_func)
-   {
-      BOOST_TRY{
-         //If this throws, we are lost
-         truncate_device<FileBased>(dev, static_cast<offset_t>(size), file_like_t());
-
-         //If the following throws, we will truncate the file to 1
-         mapped_region region(dev, read_write, 0, 0, addr);
-         boost::uint32_t *patomic_word = 0;  //avoid gcc warning
-         patomic_word = static_cast<boost::uint32_t*>(region.get_address());
-         boost::uint32_t previous = atomic_cas32(patomic_word, InitializingSegment, UninitializedSegment);
-
-         if(previous == UninitializedSegment){
-            BOOST_TRY{
-               construct_func( static_cast<char*>(region.get_address()) + ManagedOpenOrCreateUserOffset
-                              , size - ManagedOpenOrCreateUserOffset, true);
-               //All ok, just move resources to the external mapped region
-               final_region.swap(region);
-            }
-            BOOST_CATCH(...){
-               atomic_write32(patomic_word, CorruptedSegment);
-               BOOST_RETHROW
-            } BOOST_CATCH_END
-            atomic_write32(patomic_word, InitializedSegment);
-         }
-         else{
-            atomic_write32(patomic_word, CorruptedSegment);
-            throw interprocess_exception(error_info(corrupted_error));
-         }
-      }
-      BOOST_CATCH(...){
-         BOOST_TRY{
-            truncate_device<FileBased>(dev, 1u, file_like_t());
-         }
-         BOOST_CATCH(...){
-         }
-         BOOST_CATCH_END
-         BOOST_RETHROW
-      }
-      BOOST_CATCH_END
-   }
-
-   template <class ConstructFunc>
-   static void do_map_after_open
-      ( DeviceAbstraction &dev, mapped_region &final_region
-      , const void *addr, ConstructFunc construct_func
-      , bool ronly, bool cow)
-   {
-      const usduration TimeoutSec(usduration_seconds(MaxInitializeTimeSec));
-
-      if(FileBased){
-         offset_t filesize = 0;
-         spin_wait swait;
-
-         //If a file device was used, the creator might be truncating the device, so wait
-         //until the file size is enough to map the initial word
-         ustime ustime_start = microsec_clock<ustime>::universal_time();
-
-         while(1){
-            if(!get_file_size(file_handle_from_mapping_handle(dev.get_mapping_handle()), filesize)){
-               error_info err = system_error_code();
-               throw interprocess_exception(err);
-            }
-            if (filesize != 0)
-               break;
-            else {
-               //More than MaxZeroTruncateTimeSec seconds waiting to the creator
-               //to minimally increase the size of the file: something bad has happened
-               const usduration elapsed(microsec_clock<ustime>::universal_time() - ustime_start);
-               if (elapsed > TimeoutSec){
-                  throw interprocess_exception(error_info(corrupted_error));
-               }
-               swait.yield();
-            }
-         }
-         //The creator detected an error creating the file and signalled it with size 1
-         if(filesize == 1){
-            throw interprocess_exception(error_info(corrupted_error));
-         }
-      }
-
-      mapped_region  region(dev, ronly ? read_only : (cow ? copy_on_write : read_write), 0, 0, addr);
-
-      boost::uint32_t *patomic_word = static_cast<boost::uint32_t*>(region.get_address());
-      boost::uint32_t value = atomic_read32(patomic_word);
-
-      if (value != InitializedSegment){
-         ustime ustime_start = microsec_clock<ustime>::universal_time();
-         spin_wait swait;
-         while ((value = atomic_read32(patomic_word)) != InitializedSegment){
-            if(value == CorruptedSegment){
-               throw interprocess_exception(error_info(corrupted_error));
-            }
-            //More than MaxZeroTruncateTimeSec seconds waiting to the creator
-            //to minimally increase the size of the file: something bad has happened
-            const usduration elapsed(microsec_clock<ustime>::universal_time() - ustime_start);
-            if (elapsed > TimeoutSec){
-               throw interprocess_exception(error_info(corrupted_error));
-            }
-            swait.yield();
-         }
-         //The size of the file might have grown while Uninitialized -> Initializing, so remap
-         {
-            mapped_region null_map;
-            region.swap(null_map);
-         }
-         mapped_region  final_size_map(dev, ronly ? read_only : (cow ? copy_on_write : read_write), 0, 0, addr);
-         final_size_map.swap(region);
-      }
-      construct_func( static_cast<char*>(region.get_address()) + ManagedOpenOrCreateUserOffset
-                     , region.get_size() - ManagedOpenOrCreateUserOffset
-                     , false);
-      //All ok, just move resources to the external mapped region
-      final_region.swap(region);
-   }
-
-   template <class DeviceId, class ConstructFunc> inline
-   void priv_open_or_create
-      (create_enum_t type,
-       const DeviceId & id,
-       std::size_t size,
-       mode_t mode, const void *addr,
-       const permissions &perm,
-       ConstructFunc construct_func)
-   {
-      if(type != DoOpen){
-         //Check if the requested size is enough to build the managed metadata
-         const std::size_t func_min_size = construct_func.get_min_size();
-         if( (std::size_t(-1) - ManagedOpenOrCreateUserOffset) < func_min_size ||
-             size < (func_min_size + ManagedOpenOrCreateUserOffset) ){
-            throw interprocess_exception(error_info(size_error));
-         }
-         //Check size can be represented by offset_t (used by truncate)
-         if (!check_offset_t_size<FileBased>(size, file_like_t())){
-           throw interprocess_exception(error_info(size_error));
-         }
-      }
-
-      //Now create the device (file, shm file, etc.)
-      DeviceAbstraction dev;
-      (void)mode;
-      bool created = false;
-      bool ronly   = false;
-      bool cow     = false;
-      if(type == DoOpen){
-         DeviceAbstraction tmp(open_only, id, mode == read_write ? read_write : read_only);
-         tmp.swap(dev);
-         ronly = mode == read_only;
-         cow = mode == copy_on_write;
-      }
-      else if(type == DoCreate){
-         create_device<FileBased>(dev, id, size, perm, file_like_t());
-         created = true;
-      }
-      else { //DoOpenOrCreate
-         created = this->do_create_else_open(dev, id, size, perm);
-      }
-
-      if(created){
-         this->do_map_after_create(dev, m_mapped_region, size, addr, construct_func);
-      }
-      else{
-         this->do_map_after_open(dev, m_mapped_region, addr, construct_func, ronly, cow);
-      }
-
-      if(StoreDevice){
-         this->DevHolder::get_device() = boost::move(dev);
-      }
-   }
-
-   friend void swap(managed_open_or_create_impl &left, managed_open_or_create_impl &right)
-   {
-      left.swap(right);
-   }
-
-   private:
-   friend class interprocess_tester;
-   void dont_close_on_destruction()
-   {  interprocess_tester::dont_close_on_destruction(m_mapped_region);  }
-
-   mapped_region     m_mapped_region;
-};
-
-}  //namespace ipcdetail {
-
-}  //namespace interprocess {
-}  //namespace boost {
-
-#include <boost/interprocess/detail/config_end.hpp>
-
-#endif   //#ifndef BOOST_INTERPROCESS_MANAGED_OPEN_OR_CREATE_IMPL
diff --git a/src/boost/interprocess/detail/math_functions.hpp b/src/boost/interprocess/detail/math_functions.hpp
deleted file mode 100644
index a19efac1..00000000
--- a/src/boost/interprocess/detail/math_functions.hpp
+++ /dev/null
@@ -1,118 +0,0 @@
-//////////////////////////////////////////////////////////////////////////////
-//
-// (C) Copyright Stephen Cleary 2000.
-// (C) Copyright Ion Gaztanaga 2007-2012.
-//
-// Distributed under the Boost 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/interprocess for documentation.
-//
-// This file is a slightly modified file from Boost.Pool
-//
-//////////////////////////////////////////////////////////////////////////////
-
-#ifndef BOOST_INTERPROCESS_DETAIL_MATH_FUNCTIONS_HPP
-#define BOOST_INTERPROCESS_DETAIL_MATH_FUNCTIONS_HPP
-
-#ifndef BOOST_CONFIG_HPP
-#  include <boost/config.hpp>
-#endif
-#
-#if defined(BOOST_HAS_PRAGMA_ONCE)
-#  pragma once
-#endif
-
-#include <climits>
-#include <boost/static_assert.hpp>
-
-namespace boost {
-namespace interprocess {
-namespace ipcdetail {
-
-// Greatest common divisor and least common multiple
-
-//
-// gcd is an algorithm that calculates the greatest common divisor of two
-//  integers, using Euclid's algorithm.
-//
-// Pre: A > 0 && B > 0
-// Recommended: A > B
-template <typename Integer>
-inline Integer gcd(Integer A, Integer B)
-{
-   do
-   {
-      const Integer tmp(B);
-      B = A % B;
-      A = tmp;
-   } while (B != 0);
-
-   return A;
-}
-
-//
-// lcm is an algorithm that calculates the least common multiple of two
-//  integers.
-//
-// Pre: A > 0 && B > 0
-// Recommended: A > B
-template <typename Integer>
-inline Integer lcm(const Integer & A, const Integer & B)
-{
-   Integer ret = A;
-   ret /= gcd(A, B);
-   ret *= B;
-   return ret;
-}
-
-template <typename Integer>
-inline Integer log2_ceil(const Integer & A)
-{
-   Integer i = 0;
-   Integer power_of_2 = 1;
-
-   while(power_of_2 < A){
-      power_of_2 <<= 1;
-      ++i;
-   }
-   return i;
-}
-
-template <typename Integer>
-inline Integer upper_power_of_2(const Integer & A)
-{
-   Integer power_of_2 = 1;
-
-   while(power_of_2 < A){
-      power_of_2 <<= 1;
-   }
-   return power_of_2;
-}
-
-//This function uses binary search to discover the
-//highest set bit of the integer
-inline std::size_t floor_log2 (std::size_t x)
-{
-   const std::size_t Bits = sizeof(std::size_t)*CHAR_BIT;
-   const bool Size_t_Bits_Power_2= !(Bits & (Bits-1));
-   BOOST_STATIC_ASSERT(((Size_t_Bits_Power_2)== true));
-
-   std::size_t n = x;
-   std::size_t log2 = 0;
-
-   for(std::size_t shift = Bits >> 1; shift; shift >>= 1){
-      std::size_t tmp = n >> shift;
-      if (tmp)
-         log2 += shift, n = tmp;
-   }
-
-   return log2;
-}
-
-} // namespace ipcdetail
-} // namespace interprocess
-} // namespace boost
-
-#endif
diff --git a/src/boost/interprocess/detail/min_max.hpp b/src/boost/interprocess/detail/min_max.hpp
deleted file mode 100644
index 2097ff42..00000000
--- a/src/boost/interprocess/detail/min_max.hpp
+++ /dev/null
@@ -1,44 +0,0 @@
-//////////////////////////////////////////////////////////////////////////////
-//
-// (C) Copyright Ion Gaztanaga 2005-2012.
-//
-// Distributed under the Boost 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/interprocess for documentation.
-//
-//////////////////////////////////////////////////////////////////////////////
-
-#ifndef BOOST_INTERPROCESS_DETAIL_MIN_MAX_HPP
-#define BOOST_INTERPROCESS_DETAIL_MIN_MAX_HPP
-
-#ifndef BOOST_CONFIG_HPP
-#  include <boost/config.hpp>
-#endif
-#
-#if defined(BOOST_HAS_PRAGMA_ONCE)
-#  pragma once
-#endif
-
-#include <boost/interprocess/detail/config_begin.hpp>
-#include <boost/interprocess/detail/workaround.hpp>
-
-namespace boost {
-namespace interprocess {
-
-template<class T>
-const T &max_value(const T &a, const T &b)
-{  return a > b ? a : b;   }
-
-template<class T>
-const T &min_value(const T &a, const T &b)
-{  return a < b ? a : b;   }
-
-}  //namespace interprocess {
-}  //namespace boost {
-
-#include <boost/interprocess/detail/config_end.hpp>
-
-#endif   //#ifndef BOOST_INTERPROCESS_DETAIL_MIN_MAX_HPP
-
diff --git a/src/boost/interprocess/detail/mpl.hpp b/src/boost/interprocess/detail/mpl.hpp
deleted file mode 100644
index 3dd8d63e..00000000
--- a/src/boost/interprocess/detail/mpl.hpp
+++ /dev/null
@@ -1,122 +0,0 @@
-//////////////////////////////////////////////////////////////////////////////
-//
-// (C) Copyright Ion Gaztanaga 2005-2016.
-//
-// Distributed under the Boost 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/interprocess for documentation.
-//
-//////////////////////////////////////////////////////////////////////////////
-
-#ifndef BOOST_INTERPROCESS_DETAIL_MPL_HPP
-#define BOOST_INTERPROCESS_DETAIL_MPL_HPP
-
-#ifndef BOOST_CONFIG_HPP
-#  include <boost/config.hpp>
-#endif
-#
-#if defined(BOOST_HAS_PRAGMA_ONCE)
-#  pragma once
-#endif
-
-#include <cstddef>
-
-namespace boost {
-namespace interprocess {
-namespace ipcdetail {
-
-template <class T, T val>
-struct integral_constant
-{
-   static const T value = val;
-   typedef integral_constant<T,val> type;
-};
-
-template< bool C_ >
-struct bool_ : integral_constant<bool, C_>
-{
-   static const bool value = C_;
-};
-
-typedef bool_<true>        true_;
-typedef bool_<false>       false_;
-
-typedef true_  true_type;
-typedef false_ false_type;
-
-typedef char yes_type;
-struct no_type
-{
-   char padding[8];
-};
-
-template <bool B, class T = void>
-struct enable_if_c {
-  typedef T type;
-};
-
-template <class T>
-struct enable_if_c<false, T> {};
-
-template <class Cond, class T = void>
-struct enable_if : public enable_if_c<Cond::value, T> {};
-
-template <class Cond, class T = void>
-struct disable_if : public enable_if_c<!Cond::value, T> {};
-
-template<
-      bool C
-    , typename T1
-    , typename T2
-    >
-struct if_c
-{
-    typedef T1 type;
-};
-
-template<
-      typename T1
-    , typename T2
-    >
-struct if_c<false,T1,T2>
-{
-    typedef T2 type;
-};
-
-template<
-      typename T1
-    , typename T2
-    , typename T3
-    >
-struct if_
-{
-   typedef typename if_c<0 != T1::value, T2, T3>::type type;
-};
-
-
-template<std::size_t S>
-struct ls_zeros
-{
-   static const std::size_t value = (S & std::size_t(1)) ? 0 : (1u + ls_zeros<(S >> 1u)>::value);
-};
-
-template<>
-struct ls_zeros<0>
-{
-   static const std::size_t value = 0;
-};
-
-template<>
-struct ls_zeros<1>
-{
-   static const std::size_t value = 0;
-};
-
-}  //namespace ipcdetail {
-}  //namespace interprocess {
-}  //namespace boost {
-
-#endif   //#ifndef BOOST_INTERPROCESS_DETAIL_MPL_HPP
-
diff --git a/src/boost/interprocess/detail/named_proxy.hpp b/src/boost/interprocess/detail/named_proxy.hpp
deleted file mode 100644
index 57a908f2..00000000
--- a/src/boost/interprocess/detail/named_proxy.hpp
+++ /dev/null
@@ -1,316 +0,0 @@
-//////////////////////////////////////////////////////////////////////////////
-//
-// (C) Copyright Ion Gaztanaga 2005-2012. Distributed under the Boost
-// 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/interprocess for documentation.
-//
-//////////////////////////////////////////////////////////////////////////////
-
-#ifndef BOOST_INTERPROCESS_NAMED_PROXY_HPP
-#define BOOST_INTERPROCESS_NAMED_PROXY_HPP
-
-#ifndef BOOST_CONFIG_HPP
-#  include <boost/config.hpp>
-#endif
-#
-#if defined(BOOST_HAS_PRAGMA_ONCE)
-#  pragma once
-#endif
-
-#include <boost/interprocess/detail/config_begin.hpp>
-#include <boost/interprocess/detail/workaround.hpp>
-
-// interprocess/detail
-#include <boost/interprocess/detail/in_place_interface.hpp>
-#include <boost/interprocess/detail/mpl.hpp>
-#include <boost/move/utility_core.hpp>
-#ifndef BOOST_INTERPROCESS_PERFECT_FORWARDING
-#include <boost/move/detail/fwd_macros.hpp>
-#else
-#include <boost/move/utility_core.hpp>
-#include <boost/interprocess/detail/variadic_templates_tools.hpp>
-#endif   //#ifdef BOOST_INTERPROCESS_PERFECT_FORWARDING
-#include <boost/container/detail/placement_new.hpp>
-
-#include <cstddef>
-
-//!\file
-//!Describes a proxy class that implements named allocation syntax.
-
-namespace boost {
-namespace interprocess {
-namespace ipcdetail {
-
-#ifdef BOOST_INTERPROCESS_PERFECT_FORWARDING
-
-template<class T, bool is_iterator, class ...Args>
-struct CtorArgN : public placement_destroy<T>
-{
-   typedef bool_<is_iterator> IsIterator;
-   typedef CtorArgN<T, is_iterator, Args...> self_t;
-   typedef typename build_number_seq<sizeof...(Args)>::type index_tuple_t;
-
-   self_t& operator++()
-   {
-      this->do_increment(IsIterator(), index_tuple_t());
-      return *this;
-   }
-
-   self_t  operator++(int) {  return ++*this;   *this;  }
-
-   CtorArgN(Args && ...args)
-      :  args_(args...)
-   {}
-
-   virtual void construct_n(void *mem
-                     , std::size_t num
-                     , std::size_t &constructed) BOOST_OVERRIDE
-   {
-      T* memory      = static_cast<T*>(mem);
-      for(constructed = 0; constructed < num; ++constructed){
-         this->construct(memory++, IsIterator(), index_tuple_t());
-         this->do_increment(IsIterator(), index_tuple_t());
-      }
-   }
-
-   private:
-   template<std::size_t ...IdxPack>
-   void construct(void *mem, true_, const index_tuple<IdxPack...>&)
-   {  ::new((void*)mem, boost_container_new_t())T(*boost::forward<Args>(get<IdxPack>(args_))...); }
-
-   template<std::size_t ...IdxPack>
-   void construct(void *mem, false_, const index_tuple<IdxPack...>&)
-   {  ::new((void*)mem, boost_container_new_t())T(boost::forward<Args>(get<IdxPack>(args_))...); }
-
-   template<std::size_t ...IdxPack>
-   void do_increment(true_, const index_tuple<IdxPack...>&)
-   {
-      this->expansion_helper(++get<IdxPack>(args_)...);
-   }
-
-   template<class ...ExpansionArgs>
-   void expansion_helper(ExpansionArgs &&...)
-   {}
-
-   template<std::size_t ...IdxPack>
-   void do_increment(false_, const index_tuple<IdxPack...>&)
-   {}
-
-   tuple<Args&...> args_;
-};
-
-//!Describes a proxy class that implements named
-//!allocation syntax.
-template
-   < class SegmentManager  //segment manager to construct the object
-   , class T               //type of object to build
-   , bool is_iterator      //passing parameters are normal object or iterators?
-   >
-class named_proxy
-{
-   typedef typename SegmentManager::char_type char_type;
-   const char_type *    mp_name;
-   SegmentManager *     mp_mngr;
-   mutable std::size_t  m_num;
-   const bool           m_find;
-   const bool           m_dothrow;
-
-   public:
-   named_proxy(SegmentManager *mngr, const char_type *name, bool find, bool dothrow)
-      :  mp_name(name), mp_mngr(mngr), m_num(1)
-      ,  m_find(find),  m_dothrow(dothrow)
-   {}
-
-   template<class ...Args>
-   T *operator()(Args &&...args) const
-   {
-      CtorArgN<T, is_iterator, Args...> &&ctor_obj = CtorArgN<T, is_iterator, Args...>
-         (boost::forward<Args>(args)...);
-      return mp_mngr->template
-         generic_construct<T>(mp_name, m_num, m_find, m_dothrow, ctor_obj);
-   }
-
-   //This operator allows --> named_new("Name")[3]; <-- syntax
-   const named_proxy &operator[](std::size_t num) const
-   {  m_num *= num; return *this;  }
-};
-
-#else //#ifdef BOOST_INTERPROCESS_PERFECT_FORWARDING
-
-////////////////////////////////////////////////////////////////
-//    What the macro should generate (n == 2):
-//
-//    template<class T, bool is_iterator, class P1, class P2>
-//    struct Ctor2Arg
-//      :  public placement_destroy<T>
-//    {
-//       typedef bool_<is_iterator> IsIterator;
-//       typedef Ctor2Arg self_t;
-//
-//       void do_increment(false_)
-//       { ++m_p1; ++m_p2;  }
-//
-//       void do_increment(true_){}
-//
-//       self_t& operator++()
-//       {
-//          this->do_increment(IsIterator());
-//          return *this;
-//       }
-//
-//       self_t  operator++(int) {  return ++*this;   *this;  }
-//
-//       Ctor2Arg(const P1 &p1, const P2 &p2)
-//          : p1((P1 &)p_1), p2((P2 &)p_2) {}
-//
-//       void construct(void *mem)
-//       {  new((void*)object)T(m_p1, m_p2); }
-//
-//       virtual void construct_n(void *mem
-//                                , std::size_t num
-//                                , std::size_t &constructed)
-//       {
-//          T* memory      = static_cast<T*>(mem);
-//          for(constructed = 0; constructed < num; ++constructed){
-//             this->construct(memory++, IsIterator());
-//             this->do_increment(IsIterator());
-//          }
-//       }
-//
-//       private:
-//       void construct(void *mem, true_)
-//       {  new((void*)mem)T(*m_p1, *m_p2); }
-//
-//       void construct(void *mem, false_)
-//       {  new((void*)mem)T(m_p1, m_p2); }
-//
-//       P1 &m_p1; P2 &m_p2;
-//    };
-////////////////////////////////////////////////////////////////
-
-#define BOOST_INTERPROCESS_NAMED_PROXY_CTORARGN(N)\
-\
-template<class T BOOST_MOVE_I##N BOOST_MOVE_CLASS##N >  \
-struct CtorArg##N : placement_destroy<T>\
-{\
-   typedef CtorArg##N self_t;\
-   \
-   CtorArg##N ( BOOST_MOVE_UREF##N  )\
-      BOOST_MOVE_COLON##N BOOST_MOVE_FWD_INIT##N{}\
-   \
-   virtual void construct_n(void *mem, std::size_t num, std::size_t &constructed) BOOST_OVERRIDE\
-   {\
-      T* memory      = static_cast<T*>(mem);\
-      for(constructed = 0; constructed < num; ++constructed){\
-         ::new((void*)memory++) T ( BOOST_MOVE_MFWD##N );\
-      }\
-   }\
-   \
-   private:\
-   BOOST_MOVE_MREF##N\
-};\
-//!
-BOOST_MOVE_ITERATE_0TO9(BOOST_INTERPROCESS_NAMED_PROXY_CTORARGN)
-#undef BOOST_INTERPROCESS_NAMED_PROXY_CTORARGN
-
-#define BOOST_INTERPROCESS_NAMED_PROXY_CTORITN(N)\
-\
-template<class T BOOST_MOVE_I##N BOOST_MOVE_CLASS##N > \
-struct CtorIt##N : public placement_destroy<T>\
-{\
-   typedef CtorIt##N self_t;\
-   \
-   self_t& operator++()\
-   {  BOOST_MOVE_MINC##N;  return *this;  }\
-   \
-   self_t  operator++(int) {  return ++*this; *this;  }\
-   \
-   CtorIt##N ( BOOST_MOVE_VAL##N  )\
-      BOOST_MOVE_COLON##N BOOST_MOVE_VAL_INIT##N{}\
-   \
-   virtual void construct_n(void *mem, std::size_t num, std::size_t &constructed) BOOST_OVERRIDE\
-   {\
-      T* memory      = static_cast<T*>(mem);\
-      for(constructed = 0; constructed < num; ++constructed){\
-         ::new((void*)memory++) T( BOOST_MOVE_MITFWD##N );\
-         ++(*this);\
-      }\
-   }\
-   \
-   private:\
-   BOOST_MOVE_MEMB##N\
-};\
-//!
-BOOST_MOVE_ITERATE_0TO9(BOOST_INTERPROCESS_NAMED_PROXY_CTORITN)
-#undef BOOST_INTERPROCESS_NAMED_PROXY_CTORITN
-
-//!Describes a proxy class that implements named
-//!allocation syntax.
-template
-   < class SegmentManager  //segment manager to construct the object
-   , class T               //type of object to build
-   , bool is_iterator      //passing parameters are normal object or iterators?
-   >
-class named_proxy
-{
-   typedef typename SegmentManager::char_type char_type;
-   const char_type *    mp_name;
-   SegmentManager *     mp_mngr;
-   mutable std::size_t  m_num;
-   const bool           m_find;
-   const bool           m_dothrow;
-
-   public:
-   named_proxy(SegmentManager *mngr, const char_type *name, bool find, bool dothrow)
-      :  mp_name(name), mp_mngr(mngr), m_num(1)
-      ,  m_find(find),  m_dothrow(dothrow)
-   {}
-
-   #define BOOST_INTERPROCESS_NAMED_PROXY_CALL_OPERATOR(N)\
-   \
-   BOOST_MOVE_TMPL_LT##N BOOST_MOVE_CLASS##N BOOST_MOVE_GT##N \
-   T *operator()( BOOST_MOVE_UREF##N ) const\
-   {\
-      typedef typename if_c<is_iterator \
-         , CtorIt##N <T BOOST_MOVE_I##N BOOST_MOVE_TARG##N> \
-         , CtorArg##N<T BOOST_MOVE_I##N BOOST_MOVE_TARG##N> \
-         >::type ctor_obj_t;\
-      ctor_obj_t ctor_obj = ctor_obj_t( BOOST_MOVE_FWD##N );\
-      return mp_mngr->template generic_construct<T>(mp_name, m_num, m_find, m_dothrow, ctor_obj);\
-   }\
-   //
-   BOOST_MOVE_ITERATE_0TO9(BOOST_INTERPROCESS_NAMED_PROXY_CALL_OPERATOR)
-   #undef BOOST_INTERPROCESS_NAMED_PROXY_CALL_OPERATOR
-
-   ////////////////////////////////////////////////////////////////////////
-   //             What the macro should generate (n == 2)
-   ////////////////////////////////////////////////////////////////////////
-   //
-   // template <class P1, class P2>
-   // T *operator()(P1 &p1, P2 &p2) const
-   // {
-   //    typedef CtorArg2
-   //       <T, is_iterator, P1, P2>
-   //       ctor_obj_t;
-   //    ctor_obj_t ctor_obj(p1, p2);
-   //
-   //    return mp_mngr->template generic_construct<T>
-   //       (mp_name, m_num, m_find, m_dothrow, ctor_obj);
-   // }
-   //
-   //////////////////////////////////////////////////////////////////////////
-
-   //This operator allows --> named_new("Name")[3]; <-- syntax
-   const named_proxy &operator[](std::size_t num) const
-      {  m_num *= num; return *this;  }
-};
-
-#endif   //#ifdef BOOST_INTERPROCESS_PERFECT_FORWARDING
-
-}}}   //namespace boost { namespace interprocess { namespace ipcdetail {
-
-#include <boost/interprocess/detail/config_end.hpp>
-
-#endif //#ifndef BOOST_INTERPROCESS_NAMED_PROXY_HPP
diff --git a/src/boost/interprocess/detail/nothrow.hpp b/src/boost/interprocess/detail/nothrow.hpp
deleted file mode 100644
index d79ba764..00000000
--- a/src/boost/interprocess/detail/nothrow.hpp
+++ /dev/null
@@ -1,42 +0,0 @@
-//////////////////////////////////////////////////////////////////////////////
-//
-// (C) Copyright Ion Gaztanaga 2014-2015. Distributed under the Boost
-// 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/interprocess for documentation.
-//
-//////////////////////////////////////////////////////////////////////////////
-#ifndef BOOST_INTERPROCESS_DETAIL_NOTHROW_HPP
-#define BOOST_INTERPROCESS_DETAIL_NOTHROW_HPP
-
-#ifndef BOOST_CONFIG_HPP
-#  include <boost/config.hpp>
-#endif
-#
-#if defined(BOOST_HAS_PRAGMA_ONCE)
-#  pragma once
-#endif
-
-namespace std {   //no namespace versioning in clang+libc++
-
-struct nothrow_t;
-
-}  //namespace std {
-
-namespace boost{ namespace interprocess {
-
-template <int Dummy = 0>
-struct nothrow
-{
-   static const std::nothrow_t &get()   {  return *pnothrow;  }
-   static std::nothrow_t *pnothrow;
-};
-
-template <int Dummy>
-std::nothrow_t *nothrow<Dummy>::pnothrow =
-   reinterpret_cast<std::nothrow_t *>(0x1234);  //Avoid sanitizer warnings on references to null
-
-}}  //namespace boost{ namespace interprocess {
-
-#endif //#ifndef BOOST_INTERPROCESS_DETAIL_NOTHROW_HPP
diff --git a/src/boost/interprocess/detail/os_file_functions.hpp b/src/boost/interprocess/detail/os_file_functions.hpp
deleted file mode 100644
index 0a2b7d57..00000000
--- a/src/boost/interprocess/detail/os_file_functions.hpp
+++ /dev/null
@@ -1,856 +0,0 @@
-//////////////////////////////////////////////////////////////////////////////
-//
-// (C) Copyright Ion Gaztanaga 2005-2012. Distributed under the Boost
-// 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/interprocess for documentation.
-//
-//////////////////////////////////////////////////////////////////////////////
-
-#ifndef BOOST_INTERPROCESS_DETAIL_OS_FILE_FUNCTIONS_HPP
-#define BOOST_INTERPROCESS_DETAIL_OS_FILE_FUNCTIONS_HPP
-
-#ifndef BOOST_CONFIG_HPP
-#  include <boost/config.hpp>
-#endif
-#
-#if defined(BOOST_HAS_PRAGMA_ONCE)
-#  pragma once
-#endif
-
-#include <boost/interprocess/detail/config_begin.hpp>
-#include <boost/interprocess/detail/workaround.hpp>
-#include <boost/interprocess/errors.hpp>
-#include <boost/interprocess/permissions.hpp>
-#include <boost/static_assert.hpp>
-
-#include <climits>
-#include <string>
-#include <boost/move/detail/type_traits.hpp> //make_unsigned
-
-#if defined (BOOST_INTERPROCESS_WINDOWS)
-#  include <boost/interprocess/detail/win32_api.hpp>
-#  include <wchar.h> //wcsxxx()
-#else
-#  ifdef BOOST_HAS_UNISTD_H
-#     include <fcntl.h>
-#     include <unistd.h>
-#     include <sys/types.h>
-#     include <sys/stat.h>
-#     include <dirent.h>
-#     include <cerrno>
-#     include <cstdio>
-#     if 0
-#        include <sys/file.h>
-#     endif
-#  else
-#    error Unknown platform
-#  endif
-#endif
-
-#include <cstring>
-#include <cstdlib>
-
-namespace boost {
-namespace interprocess {
-
-#if defined (BOOST_INTERPROCESS_WINDOWS)
-
-typedef void *                   file_handle_t;
-typedef __int64  offset_t;
-typedef struct mapping_handle_impl_t{
-   void *   handle;
-   bool     is_shm;
-}  mapping_handle_t;
-
-typedef enum { read_only      = winapi::generic_read
-             , read_write     = winapi::generic_read | winapi::generic_write
-             , copy_on_write
-             , read_private
-             , invalid_mode   = 0xffff
-             } mode_t;
-
-typedef enum { file_begin     = winapi::file_begin
-             , file_end       = winapi::file_end
-             , file_current   = winapi::file_current
-             } file_pos_t;
-
-typedef unsigned long      map_options_t;
-static const map_options_t default_map_options = map_options_t(-1);
-
-namespace ipcdetail{
-
-inline mapping_handle_t mapping_handle_from_file_handle(file_handle_t hnd)
-{
-   mapping_handle_t ret;
-   ret.handle = hnd;
-   ret.is_shm = false;
-   return ret;
-}
-
-inline mapping_handle_t mapping_handle_from_shm_handle(file_handle_t hnd)
-{
-   mapping_handle_t ret;
-   ret.handle = hnd;
-   ret.is_shm = true;
-   return ret;
-}
-
-inline file_handle_t file_handle_from_mapping_handle(mapping_handle_t hnd)
-{  return hnd.handle; }
-
-template<class CharT>
-inline bool create_directory(const CharT *path)
-{  return winapi::create_directory(path); }
-
-template<class CharT>
-inline bool open_or_create_directory(const CharT *path)
-{
-   //If fails, check that it's because it already exists
-   return create_directory(path)
-      ||  error_info(system_error_code()).get_error_code() == already_exists_error;
-}
-
-template<class CharT>
-inline bool open_or_create_shared_directory(const CharT *path)
-{
-   return open_or_create_directory(path);
-}
-
-template <class CharT>
-inline bool remove_directory(const CharT *path)
-{  return winapi::remove_directory(path); }
-
-inline bool get_temporary_path(char *buffer, std::size_t buf_len, std::size_t &required_len)
-{
-   required_len = 0;
-   //std::size_t is always bigger or equal than unsigned long in Windows systems
-   //In case std::size_t is bigger than unsigned long
-   unsigned long buf = buf_len;
-   if(buf_len != buf){   //maybe overflowed
-      return false;
-   }
-   required_len = winapi::get_temp_path(buf_len, buffer);
-   const bool ret = required_len && (buf_len > required_len);
-   if(ret && buffer[required_len-1] == '\\'){
-      buffer[required_len-1] = '\0';
-   }
-   return ret;
-}
-
-inline bool get_temporary_path(wchar_t *buffer, std::size_t buf_len, std::size_t &required_len)
-{
-   required_len = 0;
-   //std::size_t is always bigger or equal than unsigned long in Windows systems
-   //In case std::size_t is bigger than unsigned long
-   unsigned long buf = buf_len;
-   if(buf_len != buf){   //maybe overflowed
-      return false;
-   }
-   required_len = winapi::get_temp_path(buf_len, buffer);
-   const bool ret = !(buf_len < required_len);
-   if(ret && buffer[required_len-1] == L'\\'){
-      buffer[required_len-1] = L'\0';
-   }
-   return ret;
-}
-
-template<class CharT>
-inline file_handle_t create_new_file
-   (const CharT *name, mode_t mode, const permissions & perm = permissions(), bool temporary = false)
-{
-   unsigned long attr = temporary ? winapi::file_attribute_temporary : 0;
-   return winapi::create_file
-      ( name, (unsigned int)mode, winapi::create_new, attr
-      , (winapi::interprocess_security_attributes*)perm.get_permissions());
-}
-
-template <class CharT>
-inline file_handle_t create_or_open_file
-   (const CharT *name, mode_t mode, const permissions & perm = permissions(), bool temporary = false)
-{
-   unsigned long attr = temporary ? winapi::file_attribute_temporary : 0;
-   return winapi::create_file
-      ( name, (unsigned int)mode, winapi::open_always, attr
-      , (winapi::interprocess_security_attributes*)perm.get_permissions());
-}
-
-template<class CharT>
-inline file_handle_t open_existing_file
-   (const CharT *name, mode_t mode, bool temporary = false)
-{
-   unsigned long attr = temporary ? winapi::file_attribute_temporary : 0;
-   return winapi::create_file
-      (name, (unsigned int)mode, winapi::open_existing, attr, 0);
-}
-
-inline bool delete_file(const char *name)
-{  return winapi::unlink_file(name);   }
-
-inline bool delete_file(const wchar_t *name)
-{  return winapi::unlink_file(name);   }
-
-inline bool truncate_file (file_handle_t hnd, std::size_t size)
-{
-   offset_t filesize;
-   if(!winapi::get_file_size(hnd, filesize))
-      return false;
-
-   typedef ::boost::move_detail::make_unsigned<offset_t>::type uoffset_t;
-   const uoffset_t max_filesize = uoffset_t(-1)/2u;
-   const uoffset_t uoff_size    = uoffset_t(size);
-   //Avoid unused variable warnings in 32 bit systems
-   if(uoff_size > max_filesize){
-      winapi::set_last_error(winapi::error_file_too_large);
-      return false;
-   }
-
-   if(offset_t(size) > filesize){
-      if(!winapi::set_file_pointer(hnd, filesize, 0, winapi::file_begin)){
-         return false;
-      }
-      //We will write zeros in the end of the file
-      //since set_end_of_file does not guarantee this
-      for(std::size_t remaining = size - std::size_t(filesize), write_size = 0
-         ;remaining > 0
-         ;remaining -= write_size){
-         const std::size_t DataSize = 512;
-         static char data [DataSize];
-         write_size = DataSize < remaining ? DataSize : remaining;
-         unsigned long written;
-         winapi::write_file(hnd, data, (unsigned long)write_size, &written, 0);
-         if(written != write_size){
-            return false;
-         }
-      }
-   }
-   else{
-      if(!winapi::set_file_pointer(hnd, size, 0, winapi::file_begin)){
-         return false;
-      }
-      if(!winapi::set_end_of_file(hnd)){
-         return false;
-      }
-   }
-   return true;
-}
-
-inline bool get_file_size(file_handle_t hnd, offset_t &size)
-{  return winapi::get_file_size(hnd, size);  }
-
-inline bool set_file_pointer(file_handle_t hnd, offset_t off, file_pos_t pos)
-{  return winapi::set_file_pointer(hnd, off, 0, (unsigned long) pos); }
-
-inline bool get_file_pointer(file_handle_t hnd, offset_t &off)
-{  return winapi::set_file_pointer(hnd, 0, &off, winapi::file_current); }
-
-inline bool write_file(file_handle_t hnd, const void *data, std::size_t numdata)
-{
-   unsigned long written;
-   return 0 != winapi::write_file(hnd, data, (unsigned long)numdata, &written, 0);
-}
-
-inline file_handle_t invalid_file()
-{  return winapi::invalid_handle_value;  }
-
-inline bool close_file(file_handle_t hnd)
-{  return 0 != winapi::close_handle(hnd);   }
-
-inline bool acquire_file_lock(file_handle_t hnd)
-{
-   static winapi::interprocess_overlapped overlapped;
-   const unsigned long len = ((unsigned long)-1);
-//   winapi::interprocess_overlapped overlapped;
-//   std::memset(&overlapped, 0, sizeof(overlapped));
-   return winapi::lock_file_ex
-      (hnd, winapi::lockfile_exclusive_lock, 0, len, len, &overlapped);
-}
-
-inline bool try_acquire_file_lock(file_handle_t hnd, bool &acquired)
-{
-   const unsigned long len = ((unsigned long)-1);
-   winapi::interprocess_overlapped overlapped;
-   std::memset(&overlapped, 0, sizeof(overlapped));
-   if(!winapi::lock_file_ex
-      (hnd, winapi::lockfile_exclusive_lock | winapi::lockfile_fail_immediately,
-       0, len, len, &overlapped)){
-      return winapi::get_last_error() == winapi::error_lock_violation ?
-               acquired = false, true : false;
-
-   }
-   acquired = true;
-   return true;
-}
-
-inline bool release_file_lock(file_handle_t hnd)
-{
-   const unsigned long len = ((unsigned long)-1);
-   winapi::interprocess_overlapped overlapped;
-   std::memset(&overlapped, 0, sizeof(overlapped));
-   return winapi::unlock_file_ex(hnd, 0, len, len, &overlapped);
-}
-
-inline bool acquire_file_lock_sharable(file_handle_t hnd)
-{
-   const unsigned long len = ((unsigned long)-1);
-   winapi::interprocess_overlapped overlapped;
-   std::memset(&overlapped, 0, sizeof(overlapped));
-   return winapi::lock_file_ex(hnd, 0, 0, len, len, &overlapped);
-}
-
-inline bool try_acquire_file_lock_sharable(file_handle_t hnd, bool &acquired)
-{
-   const unsigned long len = ((unsigned long)-1);
-   winapi::interprocess_overlapped overlapped;
-   std::memset(&overlapped, 0, sizeof(overlapped));
-   if(!winapi::lock_file_ex
-      (hnd, winapi::lockfile_fail_immediately, 0, len, len, &overlapped)){
-      return winapi::get_last_error() == winapi::error_lock_violation ?
-               acquired = false, true : false;
-   }
-   
-   acquired = true;
-   return true;
-}
-
-inline bool release_file_lock_sharable(file_handle_t hnd)
-{  return release_file_lock(hnd);   }
-
-template<class CharT>
-struct os_file_traits;
-
-template<>
-struct os_file_traits<char>
-{
-   static const char *any_file()
-   {  return "\\*.*";   }
-
-   static const char *backslash()
-   {  return "\\";   }
-
-   static char dot()
-   {  return '.';   }
-
-   typedef winapi::win32_find_data_a win32_find_data_t;
-
-   static int cmp(const char *a, const char *b)
-   {  return std::strcmp(a, b); }
-};
-
-template<>
-struct os_file_traits<wchar_t>
-{
-   static const wchar_t *any_file()
-   {  return L"\\*.*";   }
-
-   static const wchar_t *backslash()
-   {  return L"\\";   }
-
-   static wchar_t dot()
-   {  return L'.';   }
-
-   typedef winapi::win32_find_data_w win32_find_data_t;
-
-   static int cmp(const wchar_t *a, const wchar_t *b)
-   {  return std::wcscmp(a, b); }
-};
-
-template<class CharT>
-inline bool delete_subdirectories_recursive
-   (const std::basic_string<CharT> &refcstrRootDirectory, const CharT *dont_delete_this, unsigned int count)
-{
-   bool               bSubdirectory = false;       // Flag, indicating whether
-                                                   // subdirectories have been found
-   void *             hFile;                       // Handle to directory
-   std::basic_string<CharT>        strFilePath;                 // Filepath
-   std::basic_string<CharT>        strPattern;                  // Pattern
-   typedef os_file_traits<CharT> traits_t;
-   typename traits_t::win32_find_data_t  FileInformation;     // File information
-
-   //Find all files and directories
-   strPattern = refcstrRootDirectory + traits_t::any_file();
-   hFile = winapi::find_first_file(strPattern.c_str(), &FileInformation);
-   if(hFile != winapi::invalid_handle_value){
-      do{
-         //If it's not "." or ".." or the pointed root_level dont_delete_this erase it
-         if(FileInformation.cFileName[0] != traits_t::dot() &&
-            !(dont_delete_this && count == 0 && traits_t::cmp(dont_delete_this, FileInformation.cFileName) == 0)){
-            strFilePath.erase();
-            strFilePath = refcstrRootDirectory + traits_t::backslash() + FileInformation.cFileName;
-
-            //If it's a directory, go recursive
-            if(FileInformation.dwFileAttributes & winapi::file_attribute_directory){
-               // Delete subdirectory
-               if(!delete_subdirectories_recursive(strFilePath, dont_delete_this, count+1)){
-                  winapi::find_close(hFile);
-                  return false;
-               }
-            }
-            //If it's a file, just delete it
-            else{
-               // Set file attributes
-               //if(::SetFileAttributes(strFilePath.c_str(), winapi::file_attribute_normal) == 0)
-               //return winapi::get_last_error();
-               // Delete file
-               winapi::unlink_file(strFilePath.c_str());
-            }
-         }
-      //Go to the next file
-      } while(winapi::find_next_file(hFile, &FileInformation) == 1);
-
-      // Close handle
-      winapi::find_close(hFile);
-
-      //See if the loop has ended with an error or just because we've traversed all the files
-      if(winapi::get_last_error() != winapi::error_no_more_files){
-         return false;
-      }
-      else
-      {
-         //Erase empty subdirectories or original refcstrRootDirectory
-         if(!bSubdirectory && count)
-         {
-            // Set directory attributes
-            //if(::SetFileAttributes(refcstrRootDirectory.c_str(), FILE_ATTRIBUTE_NORMAL) == 0)
-               //return ::GetLastError();
-            // Delete directory
-            if(winapi::remove_directory(refcstrRootDirectory.c_str()) == 0)
-               return false;
-         }
-      }
-   }
-   return true;
-}
-
-//This function erases all the subdirectories of a directory except the one pointed by "dont_delete_this"
-template <class CharT>
-inline bool delete_subdirectories(const std::basic_string<CharT> &refcstrRootDirectory, const CharT *dont_delete_this)
-{
-   return delete_subdirectories_recursive(refcstrRootDirectory, dont_delete_this, 0u);
-}
-
-
-template<class Function>
-inline bool for_each_file_in_dir(const char *dir, Function f)
-{
-   void *             hFile;                       // Handle to directory
-   winapi::win32_find_data_a  FileInformation;     // File information
-
-   //Get base directory
-   std::string str(dir);
-   const std::size_t base_root_dir_len = str.size();
-
-   //Find all files and directories
-   str  +=  "\\*.*";
-   hFile = winapi::find_first_file(str.c_str(), &FileInformation);
-   if(hFile != winapi::invalid_handle_value){
-      do{   //Now loop every file
-         str.erase(base_root_dir_len);
-         //If it's not "." or ".." skip it
-         if(FileInformation.cFileName[0] != '.'){
-            str += "\\";   str += FileInformation.cFileName;
-            //If it's a file, apply erase logic
-            if(!(FileInformation.dwFileAttributes & winapi::file_attribute_directory)){
-               f(str.c_str(), FileInformation.cFileName);
-            }
-         }
-      //Go to the next file
-      } while(winapi::find_next_file(hFile, &FileInformation) == 1);
-
-      // Close handle and see if the loop has ended with an error
-      winapi::find_close(hFile);
-      if(winapi::get_last_error() != winapi::error_no_more_files){
-         return false;
-      }
-   }
-   return true;
-}
-
-
-#else    //#if defined (BOOST_INTERPROCESS_WINDOWS)
-
-typedef int       file_handle_t;
-typedef off_t     offset_t;
-
-typedef struct mapping_handle_impl_t
-{
-   file_handle_t  handle;
-   bool           is_xsi;
-}  mapping_handle_t;
-
-typedef enum { read_only      = O_RDONLY
-             , read_write     = O_RDWR
-             , copy_on_write
-             , read_private
-             , invalid_mode   = 0xffff
-             } mode_t;
-
-typedef enum { file_begin     = SEEK_SET
-             , file_end       = SEEK_END
-             , file_current   = SEEK_CUR
-             } file_pos_t;
-
-typedef int map_options_t;
-static const map_options_t default_map_options = map_options_t(-1);
-
-namespace ipcdetail{
-
-inline mapping_handle_t mapping_handle_from_file_handle(file_handle_t hnd)
-{
-   mapping_handle_t ret;
-   ret.handle = hnd;
-   ret.is_xsi = false;
-   return ret;
-}
-
-inline file_handle_t file_handle_from_mapping_handle(mapping_handle_t hnd)
-{  return hnd.handle; }
-
-inline bool create_directory(const char *path)
-{
-   ::mode_t m = ::mode_t(0777);
-   return ::mkdir(path, m) == 0;
-}
-
-inline bool open_or_create_directory(const char *path)
-{
-   ::mode_t m = ::mode_t(0777);
-   return ::mkdir(path, m) == 0 || (errno == EEXIST);
-}
-
-inline bool open_or_create_shared_directory(const char *path)
-{
-   const ::mode_t m = ::mode_t(01777);
-   const bool created = ::mkdir(path, m) == 0;
-   const bool created_or_exists = created || (errno == EEXIST);
-   //Try to maximize the chance that the sticky bit is set in shared dirs
-   //created with old versions that did not set it (for security reasons)
-   const bool chmoded = ::chmod(path, m) == 0;
-   return created ? chmoded : created_or_exists;
-}
-
-inline bool remove_directory(const char *path)
-{  return ::rmdir(path) == 0; }
-
-inline bool get_temporary_path(char *buffer, std::size_t buf_len, std::size_t &required_len)
-{
-   required_len = 5u;
-   if(buf_len < required_len)
-      return false;
-   else{
-      std::strcpy(buffer, "/tmp");
-   }
-   return true;
-}
-
-inline file_handle_t create_new_file
-   (const char *name, mode_t mode, const permissions & perm = permissions(), bool temporary = false)
-{
-   (void)temporary;
-   int ret = ::open(name, ((int)mode) | O_EXCL | O_CREAT, perm.get_permissions());
-   if(ret >= 0){
-      ::fchmod(ret, perm.get_permissions());
-   }
-   return ret;
-}
-
-inline file_handle_t create_or_open_file
-   (const char *name, mode_t mode, const permissions & perm = permissions(), bool temporary = false)
-{
-   (void)temporary;
-   int ret = -1;
-   //We need a loop to change permissions correctly using fchmod, since
-   //with "O_CREAT only" ::open we don't know if we've created or opened the file.
-   while(true){
-      ret = ::open(name, ((int)mode) | O_EXCL | O_CREAT, perm.get_permissions());
-      if(ret >= 0){
-         ::fchmod(ret, perm.get_permissions());
-         break;
-      }
-      else if(errno == EEXIST){
-         if((ret = ::open(name, (int)mode)) >= 0 || errno != ENOENT){
-            break;
-         }
-      }
-      else{
-         break;
-      }
-   }
-   return ret;
-}
-
-inline file_handle_t open_existing_file
-   (const char *name, mode_t mode, bool temporary = false)
-{
-   (void)temporary;
-   return ::open(name, (int)mode);
-}
-
-inline bool delete_file(const char *name)
-{  return ::unlink(name) == 0;   }
-
-inline bool truncate_file (file_handle_t hnd, std::size_t size)
-{
-   typedef boost::move_detail::make_unsigned<off_t>::type uoff_t;
-   BOOST_STATIC_ASSERT(( sizeof(uoff_t) >= sizeof(std::size_t) ));
-   if( uoff_t(-1)/2u < uoff_t(size) ){
-      errno = EINVAL;
-      return false;
-   }
-   return 0 == ::ftruncate(hnd, off_t(size));
-}
-
-inline bool get_file_size(file_handle_t hnd, offset_t &size)
-{
-   struct stat data;
-   bool ret = 0 == ::fstat(hnd, &data);
-   if(ret){
-      size = data.st_size;
-   }
-   return ret;
-}
-
-inline bool set_file_pointer(file_handle_t hnd, offset_t off, file_pos_t pos)
-{  return ((off_t)(-1)) != ::lseek(hnd, off, (int)pos); }
-
-inline bool get_file_pointer(file_handle_t hnd, offset_t &off)
-{
-   off = ::lseek(hnd, 0, SEEK_CUR);
-   return off != ((off_t)-1);
-}
-
-inline bool write_file(file_handle_t hnd, const void *data, std::size_t numdata)
-{  return (ssize_t(numdata)) == ::write(hnd, data, numdata);  }
-
-inline file_handle_t invalid_file()
-{  return -1;  }
-
-inline bool close_file(file_handle_t hnd)
-{  return ::close(hnd) == 0;   }
-
-inline bool acquire_file_lock(file_handle_t hnd)
-{
-   struct ::flock lock;
-   lock.l_type    = F_WRLCK;
-   lock.l_whence  = SEEK_SET;
-   lock.l_start   = 0;
-   lock.l_len     = 0;
-   return -1 != ::fcntl(hnd, F_SETLKW, &lock);
-}
-
-inline bool try_acquire_file_lock(file_handle_t hnd, bool &acquired)
-{
-   struct ::flock lock;
-   lock.l_type    = F_WRLCK;
-   lock.l_whence  = SEEK_SET;
-   lock.l_start   = 0;
-   lock.l_len     = 0;
-   int ret = ::fcntl(hnd, F_SETLK, &lock);
-   if(ret == -1){
-      return (errno == EAGAIN || errno == EACCES) ?
-               (acquired = false, true) : false;
-   }
-   return (acquired = true);
-}
-
-inline bool release_file_lock(file_handle_t hnd)
-{
-   struct ::flock lock;
-   lock.l_type    = F_UNLCK;
-   lock.l_whence  = SEEK_SET;
-   lock.l_start   = 0;
-   lock.l_len     = 0;
-   return -1 != ::fcntl(hnd, F_SETLK, &lock);
-}
-
-inline bool acquire_file_lock_sharable(file_handle_t hnd)
-{
-   struct ::flock lock;
-   lock.l_type    = F_RDLCK;
-   lock.l_whence  = SEEK_SET;
-   lock.l_start   = 0;
-   lock.l_len     = 0;
-   return -1 != ::fcntl(hnd, F_SETLKW, &lock);
-}
-
-inline bool try_acquire_file_lock_sharable(file_handle_t hnd, bool &acquired)
-{
-   struct flock lock;
-   lock.l_type    = F_RDLCK;
-   lock.l_whence  = SEEK_SET;
-   lock.l_start   = 0;
-   lock.l_len     = 0;
-   int ret = ::fcntl(hnd, F_SETLK, &lock);
-   if(ret == -1){
-      return (errno == EAGAIN || errno == EACCES) ?
-               (acquired = false, true) : false;
-   }
-   return (acquired = true);
-}
-
-inline bool release_file_lock_sharable(file_handle_t hnd)
-{  return release_file_lock(hnd);   }
-
-#if 0
-inline bool acquire_file_lock(file_handle_t hnd)
-{  return 0 == ::flock(hnd, LOCK_EX); }
-
-inline bool try_acquire_file_lock(file_handle_t hnd, bool &acquired)
-{
-   int ret = ::flock(hnd, LOCK_EX | LOCK_NB);
-   acquired = ret == 0;
-   return (acquired || errno == EWOULDBLOCK);
-}
-
-inline bool release_file_lock(file_handle_t hnd)
-{  return 0 == ::flock(hnd, LOCK_UN); }
-
-inline bool acquire_file_lock_sharable(file_handle_t hnd)
-{  return 0 == ::flock(hnd, LOCK_SH); }
-
-inline bool try_acquire_file_lock_sharable(file_handle_t hnd, bool &acquired)
-{
-   int ret = ::flock(hnd, LOCK_SH | LOCK_NB);
-   acquired = ret == 0;
-   return (acquired || errno == EWOULDBLOCK);
-}
-
-inline bool release_file_lock_sharable(file_handle_t hnd)
-{  return 0 == ::flock(hnd, LOCK_UN); }
-#endif
-
-inline bool delete_subdirectories_recursive
-   (const std::string &refcstrRootDirectory, const char *dont_delete_this)
-{
-   DIR *d = opendir(refcstrRootDirectory.c_str());
-   if(!d) {
-      return false;
-   }
-
-   struct dir_close
-   {
-      DIR *d_;
-      dir_close(DIR *d) : d_(d) {}
-      ~dir_close() { ::closedir(d_); }
-   } dc(d); (void)dc;
-
-   struct ::dirent *de;
-   struct ::stat st;
-   std::string fn;
-
-   while((de=::readdir(d))) {
-      if( de->d_name[0] == '.' && ( de->d_name[1] == '\0'
-            || (de->d_name[1] == '.' && de->d_name[2] == '\0' )) ){
-         continue;
-      }
-      if(dont_delete_this && std::strcmp(dont_delete_this, de->d_name) == 0){
-         continue;
-      }
-      fn = refcstrRootDirectory;
-      fn += '/';
-      fn += de->d_name;
-
-      if(std::remove(fn.c_str())) {
-         if(::stat(fn.c_str(), & st)) {
-            return false;
-         }
-         if(S_ISDIR(st.st_mode)) {
-            if(!delete_subdirectories_recursive(fn, 0) ){
-               return false;
-            }
-         } else {
-            return false;
-         }
-      }
-   }
-   return std::remove(refcstrRootDirectory.c_str()) ? false : true;
-}
-
-template<class Function>
-inline bool for_each_file_in_dir(const char *dir, Function f)
-{
-   std::string refcstrRootDirectory(dir);
-
-   DIR *d = opendir(refcstrRootDirectory.c_str());
-   if(!d) {
-      return false;
-   }
-
-   struct dir_close
-   {
-      DIR *d_;
-      dir_close(DIR *d) : d_(d) {}
-      ~dir_close() { ::closedir(d_); }
-   } dc(d); (void)dc;
-
-   struct ::dirent *de;
-   struct ::stat st;
-   std::string fn;
-
-   while((de=::readdir(d))) {
-      if( de->d_name[0] == '.' && ( de->d_name[1] == '\0'
-            || (de->d_name[1] == '.' && de->d_name[2] == '\0' )) ){
-         continue;
-      }
-      fn = refcstrRootDirectory;
-      fn += '/';
-      fn += de->d_name;
-
-      if(::stat(fn.c_str(), & st)) {
-         return false;
-      }
-      //If it's a file, apply erase logic
-      if(!S_ISDIR(st.st_mode)) {
-         f(fn.c_str(), de->d_name);
-      }
-   }
-   return true;
-}
-
-
-//This function erases all the subdirectories of a directory except the one pointed by "dont_delete_this"
-inline bool delete_subdirectories(const std::string &refcstrRootDirectory, const char *dont_delete_this)
-{
-   return delete_subdirectories_recursive(refcstrRootDirectory, dont_delete_this );
-}
-
-#endif   //#if defined (BOOST_INTERPROCESS_WINDOWS)
-
-inline std::string get_temporary_path()
-{
-   std::size_t required_len = 0;
-   get_temporary_path((char*)0, 0, required_len);
-   std::string ret_str(required_len, char(0));
-   get_temporary_path(&ret_str[0], ret_str.size(), required_len);
-   while(!ret_str.empty() && !ret_str[ret_str.size()-1]){
-      ret_str.erase(ret_str.size()-1);
-   }
-
-   return ret_str;
-}
-
-#ifdef BOOST_INTERPROCESS_WCHAR_NAMED_RESOURCES
-
-inline std::wstring get_temporary_wpath()
-{
-   std::size_t required_len = 0;
-   get_temporary_path((wchar_t*)0, 0, required_len);
-   std::wstring ret_str(required_len, char(0));
-   get_temporary_path(&ret_str[0], ret_str.size(), required_len);
-   while(!ret_str.empty() && !ret_str[ret_str.size()-1]){
-      ret_str.erase(ret_str.size()-1);
-   }
-
-   return ret_str;
-}
-
-#endif
-
-}  //namespace ipcdetail{
-}  //namespace interprocess {
-}  //namespace boost {
-
-#include <boost/interprocess/detail/config_end.hpp>
-
-#endif   //BOOST_INTERPROCESS_DETAIL_OS_FILE_FUNCTIONS_HPP
diff --git a/src/boost/interprocess/detail/os_thread_functions.hpp b/src/boost/interprocess/detail/os_thread_functions.hpp
deleted file mode 100644
index 624321fc..00000000
--- a/src/boost/interprocess/detail/os_thread_functions.hpp
+++ /dev/null
@@ -1,630 +0,0 @@
-//////////////////////////////////////////////////////////////////////////////
-//
-// (C) Copyright Ion Gaztanaga 2005-2013. Distributed under the Boost
-// 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/interprocess for documentation.
-//
-//////////////////////////////////////////////////////////////////////////////
-
-//Thread launching functions are adapted from boost/detail/lightweight_thread.hpp
-//
-//  boost/detail/lightweight_thread.hpp
-//
-//  Copyright (c) 2002 Peter Dimov and Multi Media Ltd.
-//  Copyright (c) 2008 Peter Dimov
-//
-//  Distributed under the Boost Software License, Version 1.0.
-//  See accompanying file LICENSE_1_0.txt or copy at
-//  http://www.boost.org/LICENSE_1_0.txt
-
-#ifndef BOOST_INTERPROCESS_DETAIL_OS_THREAD_FUNCTIONS_HPP
-#define BOOST_INTERPROCESS_DETAIL_OS_THREAD_FUNCTIONS_HPP
-
-#ifndef BOOST_CONFIG_HPP
-#  include <boost/config.hpp>
-#endif
-#
-#if defined(BOOST_HAS_PRAGMA_ONCE)
-#  pragma once
-#endif
-
-#include <boost/interprocess/detail/config_begin.hpp>
-#include <boost/interprocess/detail/workaround.hpp>
-#include <boost/interprocess/streams/bufferstream.hpp>
-#include <cstddef>
-#include <ostream>
-
-#if defined(BOOST_INTERPROCESS_WINDOWS)
-#  include <boost/interprocess/detail/win32_api.hpp>
-#  include <boost/winapi/thread.hpp>
-#else
-#  include <pthread.h>
-#  include <unistd.h>
-#  include <sched.h>
-#  include <time.h>
-#  ifdef BOOST_INTERPROCESS_BSD_DERIVATIVE
-      //Some *BSD systems (OpenBSD & NetBSD) need sys/param.h before sys/sysctl.h, whereas
-      //others (FreeBSD & Darwin) need sys/types.h
-#     include <sys/types.h>
-#     include <sys/param.h>
-#     include <sys/sysctl.h>
-#  endif
-#if defined(__VXWORKS__) 
-#include <vxCpuLib.h>
-#endif 
-//According to the article "C/C++ tip: How to measure elapsed real time for benchmarking"
-//Check MacOs first as macOS 10.12 SDK defines both CLOCK_MONOTONIC and
-//CLOCK_MONOTONIC_RAW and no clock_gettime.
-#  if (defined(macintosh) || defined(__APPLE__) || defined(__APPLE_CC__))
-#     include <mach/mach_time.h>  // mach_absolute_time, mach_timebase_info_data_t
-#     define BOOST_INTERPROCESS_MATCH_ABSOLUTE_TIME
-#  elif defined(CLOCK_MONOTONIC_PRECISE)   //BSD
-#     define BOOST_INTERPROCESS_CLOCK_MONOTONIC CLOCK_MONOTONIC_PRECISE
-#  elif defined(CLOCK_MONOTONIC_RAW)     //Linux
-#     define BOOST_INTERPROCESS_CLOCK_MONOTONIC CLOCK_MONOTONIC_RAW
-#  elif defined(CLOCK_HIGHRES)           //Solaris
-#     define BOOST_INTERPROCESS_CLOCK_MONOTONIC CLOCK_HIGHRES
-#  elif defined(CLOCK_MONOTONIC)         //POSIX (AIX, BSD, Linux, Solaris)
-#     define BOOST_INTERPROCESS_CLOCK_MONOTONIC CLOCK_MONOTONIC
-#  else
-#     error "No high resolution steady clock in your system, please provide a patch"
-#  endif
-#endif
-
-namespace boost {
-namespace interprocess {
-namespace ipcdetail{
-
-#if defined (BOOST_INTERPROCESS_WINDOWS)
-
-typedef unsigned long OS_process_id_t;
-typedef unsigned long OS_thread_id_t;
-struct OS_thread_t
-{
-   OS_thread_t()
-      : m_handle()
-   {}
-
-   
-   void* handle() const
-   {  return m_handle;  }
-
-   void* m_handle;
-};
-
-typedef OS_thread_id_t OS_systemwide_thread_id_t;
-
-//process
-inline OS_process_id_t get_current_process_id()
-{  return winapi::get_current_process_id();  }
-
-inline OS_process_id_t get_invalid_process_id()
-{  return OS_process_id_t(0);  }
-
-//thread
-inline OS_thread_id_t get_current_thread_id()
-{  return winapi::get_current_thread_id();  }
-
-inline OS_thread_id_t get_invalid_thread_id()
-{  return OS_thread_id_t(0xffffffff);  }
-
-inline bool equal_thread_id(OS_thread_id_t id1, OS_thread_id_t id2)
-{  return id1 == id2;  }
-
-//return the system tick in ns
-inline unsigned long get_system_tick_ns()
-{
-   unsigned long curres, ignore1, ignore2;
-   winapi::query_timer_resolution(&ignore1, &ignore2, &curres);
-   //Windows API returns the value in hundreds of ns
-   return (curres - 1ul)*100ul;
-}
-
-//return the system tick in us
-inline unsigned long get_system_tick_us()
-{
-   unsigned long curres, ignore1, ignore2;
-   winapi::query_timer_resolution(&ignore1, &ignore2, &curres);
-   //Windows API returns the value in hundreds of ns
-   return (curres - 1ul)/10ul + 1ul;
-}
-
-typedef unsigned __int64 OS_highres_count_t;
-
-inline unsigned long get_system_tick_in_highres_counts()
-{
-   __int64 freq;
-   unsigned long curres, ignore1, ignore2;
-   winapi::query_timer_resolution(&ignore1, &ignore2, &curres);
-   //Frequency in counts per second
-   if(!winapi::query_performance_frequency(&freq)){
-      //Tick resolution in ms
-      return (curres-1ul)/10000ul + 1ul;
-   }
-   else{
-      //In femtoseconds
-      __int64 count_fs    = (1000000000000000LL - 1LL)/freq + 1LL;
-      __int64 tick_counts = (static_cast<__int64>(curres)*100000000LL - 1LL)/count_fs + 1LL;
-      return static_cast<unsigned long>(tick_counts);
-   }
-}
-
-inline OS_highres_count_t get_current_system_highres_count()
-{
-   __int64 count;
-   if(!winapi::query_performance_counter(&count)){
-      count = winapi::get_tick_count();
-   }
-   return (OS_highres_count_t)count;
-}
-
-inline void zero_highres_count(OS_highres_count_t &count)
-{  count = 0;  }
-
-inline bool is_highres_count_zero(const OS_highres_count_t &count)
-{  return count == 0;  }
-
-template <class Ostream>
-inline Ostream &ostream_highres_count(Ostream &ostream, const OS_highres_count_t &count)
-{
-   ostream << count;
-   return ostream;
-}
-
-inline OS_highres_count_t system_highres_count_subtract(const OS_highres_count_t &l, const OS_highres_count_t &r)
-{  return l - r;  }
-
-inline bool system_highres_count_less(const OS_highres_count_t &l, const OS_highres_count_t &r)
-{  return l < r;  }
-
-inline bool system_highres_count_less_ul(const OS_highres_count_t &l, unsigned long r)
-{  return l < static_cast<OS_highres_count_t>(r);  }
-
-inline void thread_sleep_tick()
-{  winapi::sleep_tick();   }
-
-inline void thread_yield()
-{  winapi::sched_yield();  }
-
-inline void thread_sleep(unsigned int ms)
-{  winapi::sleep(ms);  }
-
-//systemwide thread
-inline OS_systemwide_thread_id_t get_current_systemwide_thread_id()
-{
-   return get_current_thread_id();
-}
-
-inline void systemwide_thread_id_copy
-   (const volatile OS_systemwide_thread_id_t &from, volatile OS_systemwide_thread_id_t &to)
-{
-   to = from;
-}
-
-inline bool equal_systemwide_thread_id(const OS_systemwide_thread_id_t &id1, const OS_systemwide_thread_id_t &id2)
-{
-   return equal_thread_id(id1, id2);
-}
-
-inline OS_systemwide_thread_id_t get_invalid_systemwide_thread_id()
-{
-   return get_invalid_thread_id();
-}
-
-inline long double get_current_process_creation_time()
-{
-   winapi::interprocess_filetime CreationTime, ExitTime, KernelTime, UserTime;
-
-   winapi::get_process_times
-      ( winapi::get_current_process(), &CreationTime, &ExitTime, &KernelTime, &UserTime);
-
-   typedef long double ldouble_t;
-   const ldouble_t resolution = (100.0l/1000000000.0l);
-   return CreationTime.dwHighDateTime*(ldouble_t(1u<<31u)*2.0l*resolution) +
-              CreationTime.dwLowDateTime*resolution;
-}
-
-inline unsigned int get_num_cores()
-{
-   winapi::interprocess_system_info sysinfo;
-   winapi::get_system_info( &sysinfo );
-   //in Windows dw is long which is equal in bits to int
-   return static_cast<unsigned>(sysinfo.dwNumberOfProcessors);
-}
-
-#else    //#if defined (BOOST_INTERPROCESS_WINDOWS)
-
-typedef pthread_t OS_thread_t;
-typedef pthread_t OS_thread_id_t;
-typedef pid_t     OS_process_id_t;
-
-struct OS_systemwide_thread_id_t
-{
-   OS_systemwide_thread_id_t()
-      :  pid(), tid()
-   {}
-
-   OS_systemwide_thread_id_t(pid_t p, pthread_t t)
-      :  pid(p), tid(t)
-   {}
-
-   OS_systemwide_thread_id_t(const OS_systemwide_thread_id_t &x)
-      :  pid(x.pid), tid(x.tid)
-   {}
-
-   OS_systemwide_thread_id_t(const volatile OS_systemwide_thread_id_t &x)
-      :  pid(x.pid), tid(x.tid)
-   {}
-
-   OS_systemwide_thread_id_t & operator=(const OS_systemwide_thread_id_t &x)
-   {  pid = x.pid;   tid = x.tid;   return *this;   }
-
-   OS_systemwide_thread_id_t & operator=(const volatile OS_systemwide_thread_id_t &x)
-   {  pid = x.pid;   tid = x.tid;   return *this;  }
-
-   void operator=(const OS_systemwide_thread_id_t &x) volatile
-   {  pid = x.pid;   tid = x.tid;   }
-
-   pid_t       pid;
-   pthread_t   tid;
-};
-
-inline void systemwide_thread_id_copy
-   (const volatile OS_systemwide_thread_id_t &from, volatile OS_systemwide_thread_id_t &to)
-{
-   to.pid = from.pid;
-   to.tid = from.tid;
-}
-
-//process
-inline OS_process_id_t get_current_process_id()
-{  return ::getpid();  }
-
-inline OS_process_id_t get_invalid_process_id()
-{  return pid_t(0);  }
-
-//thread
-inline OS_thread_id_t get_current_thread_id()
-{  return ::pthread_self();  }
-
-inline OS_thread_id_t get_invalid_thread_id()
-{
-   static pthread_t invalid_id;
-   return invalid_id;
-}
-
-inline bool equal_thread_id(OS_thread_id_t id1, OS_thread_id_t id2)
-{  return 0 != pthread_equal(id1, id2);  }
-
-inline void thread_yield()
-{  ::sched_yield();  }
-
-#ifndef BOOST_INTERPROCESS_MATCH_ABSOLUTE_TIME
-typedef struct timespec OS_highres_count_t;
-#else
-typedef unsigned long long OS_highres_count_t;
-#endif
-
-inline unsigned long get_system_tick_ns()
-{
-   #ifdef _SC_CLK_TCK
-   long ticks_per_second =::sysconf(_SC_CLK_TCK); // ticks per sec
-   if(ticks_per_second <= 0){   //Try a typical value on error
-      ticks_per_second = 100;
-   }
-   return 999999999ul/static_cast<unsigned long>(ticks_per_second)+1ul;
-   #else
-      #error "Can't obtain system tick value for your system, please provide a patch"
-   #endif
-}
-
-inline unsigned long get_system_tick_in_highres_counts()
-{
-   #ifndef BOOST_INTERPROCESS_MATCH_ABSOLUTE_TIME
-   return get_system_tick_ns();
-   #else
-   mach_timebase_info_data_t info;
-   mach_timebase_info(&info);
-            //ns
-   return static_cast<unsigned long>
-   (
-      static_cast<double>(get_system_tick_ns())
-         / (static_cast<double>(info.numer) / info.denom)
-   );
-   #endif
-}
-
-//return system ticks in us
-inline unsigned long get_system_tick_us()
-{
-   return (get_system_tick_ns()-1)/1000ul + 1ul;
-}
-
-inline OS_highres_count_t get_current_system_highres_count()
-{
-   #if defined(BOOST_INTERPROCESS_CLOCK_MONOTONIC)
-      struct timespec count;
-      ::clock_gettime(BOOST_INTERPROCESS_CLOCK_MONOTONIC, &count);
-      return count;
-   #elif defined(BOOST_INTERPROCESS_MATCH_ABSOLUTE_TIME)
-      return ::mach_absolute_time();
-   #endif
-}
-
-#ifndef BOOST_INTERPROCESS_MATCH_ABSOLUTE_TIME
-
-inline void zero_highres_count(OS_highres_count_t &count)
-{  count.tv_sec = 0; count.tv_nsec = 0;  }
-
-inline bool is_highres_count_zero(const OS_highres_count_t &count)
-{  return count.tv_sec == 0 && count.tv_nsec == 0;  }
-
-template <class Ostream>
-inline Ostream &ostream_highres_count(Ostream &ostream, const OS_highres_count_t &count)
-{
-   ostream << count.tv_sec << "s:" << count.tv_nsec << "ns";
-   return ostream;
-}
-
-inline OS_highres_count_t system_highres_count_subtract(const OS_highres_count_t &l, const OS_highres_count_t &r)
-{
-   OS_highres_count_t res;
-
-   if (l.tv_nsec < r.tv_nsec){
-      res.tv_nsec = 1000000000 + l.tv_nsec - r.tv_nsec;
-      res.tv_sec  = l.tv_sec - 1 - r.tv_sec;
-   }
-   else{
-      res.tv_nsec = l.tv_nsec - r.tv_nsec;
-      res.tv_sec  = l.tv_sec - r.tv_sec;
-   }
-
-   return res;
-}
-
-inline bool system_highres_count_less(const OS_highres_count_t &l, const OS_highres_count_t &r)
-{  return l.tv_sec < r.tv_sec || (l.tv_sec == r.tv_sec && l.tv_nsec < r.tv_nsec);  }
-
-inline bool system_highres_count_less_ul(const OS_highres_count_t &l, unsigned long r)
-{  return !l.tv_sec && (static_cast<unsigned long>(l.tv_nsec) < r);  }
-
-#else
-
-inline void zero_highres_count(OS_highres_count_t &count)
-{  count = 0;  }
-
-inline bool is_highres_count_zero(const OS_highres_count_t &count)
-{  return count == 0;  }
-
-template <class Ostream>
-inline Ostream &ostream_highres_count(Ostream &ostream, const OS_highres_count_t &count)
-{
-   ostream << count ;
-   return ostream;
-}
-
-inline OS_highres_count_t system_highres_count_subtract(const OS_highres_count_t &l, const OS_highres_count_t &r)
-{  return l - r;  }
-
-inline bool system_highres_count_less(const OS_highres_count_t &l, const OS_highres_count_t &r)
-{  return l < r;  }
-
-inline bool system_highres_count_less_ul(const OS_highres_count_t &l, unsigned long r)
-{  return l < static_cast<OS_highres_count_t>(r);  }
-
-#endif
-
-inline void thread_sleep_tick()
-{
-   struct timespec rqt;
-   //Sleep for the half of the tick time
-   rqt.tv_sec  = 0;
-   rqt.tv_nsec = (long)get_system_tick_ns()/2;
-   ::nanosleep(&rqt, 0);
-}
-
-inline void thread_sleep(unsigned int ms)
-{
-   struct timespec rqt;
-   rqt.tv_sec = ms/1000u;
-   rqt.tv_nsec = (ms%1000u)*1000000u;
-   ::nanosleep(&rqt, 0);
-}
-
-//systemwide thread
-inline OS_systemwide_thread_id_t get_current_systemwide_thread_id()
-{
-   return OS_systemwide_thread_id_t(::getpid(), ::pthread_self());
-}
-
-inline bool equal_systemwide_thread_id(const OS_systemwide_thread_id_t &id1, const OS_systemwide_thread_id_t &id2)
-{
-   return (0 != pthread_equal(id1.tid, id2.tid)) && (id1.pid == id2.pid);
-}
-
-inline OS_systemwide_thread_id_t get_invalid_systemwide_thread_id()
-{
-   return OS_systemwide_thread_id_t(get_invalid_process_id(), get_invalid_thread_id());
-}
-
-inline long double get_current_process_creation_time()
-{ return 0.0L; }
-
-inline unsigned int get_num_cores()
-{
-   #ifdef _SC_NPROCESSORS_ONLN
-      long cores = ::sysconf(_SC_NPROCESSORS_ONLN);
-      // sysconf returns -1 if the name is invalid, the option does not exist or
-      // does not have a definite limit.
-      // if sysconf returns some other negative number, we have no idea
-      // what is going on. Default to something safe.
-      if(cores <= 0){
-         return 1;
-      }
-      //Check for overflow (unlikely)
-      else if(static_cast<unsigned long>(cores) >=
-              static_cast<unsigned long>(static_cast<unsigned int>(-1))){
-         return static_cast<unsigned int>(-1);
-      }
-      else{
-         return static_cast<unsigned int>(cores);
-      }
-   #elif defined(BOOST_INTERPROCESS_BSD_DERIVATIVE) && defined(HW_NCPU)
-      int request[2] = { CTL_HW, HW_NCPU };
-      int num_cores;
-      std::size_t result_len = sizeof(num_cores);
-      if ( (::sysctl (request, 2, &num_cores, &result_len, 0, 0) < 0) || (num_cores <= 0) ){
-         //Return a safe value
-         return 1;
-      }
-      else{
-         return static_cast<unsigned int>(num_cores);
-      }
-   #elif defined(__VXWORKS__)
-      cpuset_t set =  ::vxCpuEnabledGet();
-    #ifdef __DCC__
-      int i;
-      for( i = 0; set; ++i)
-          {
-               set &= set -1;
-          }
-      return(i);
-    #else  
-      return (__builtin_popcount(set) );
-    #endif  
-   #endif
-}
-
-inline int thread_create(OS_thread_t * thread, void *(*start_routine)(void*), void* arg)
-{  return pthread_create(thread, 0, start_routine, arg); }
-
-inline void thread_join(OS_thread_t thread)
-{  (void)pthread_join(thread, 0);  }
-
-#endif   //#if defined (BOOST_INTERPROCESS_WINDOWS)
-
-typedef char pid_str_t[sizeof(OS_process_id_t)*3+1];
-
-inline void get_pid_str(pid_str_t &pid_str, OS_process_id_t pid)
-{
-   bufferstream bstream(pid_str, sizeof(pid_str));
-   bstream << pid << std::ends;
-}
-
-inline void get_pid_str(pid_str_t &pid_str)
-{  get_pid_str(pid_str, get_current_process_id());  }
-
-#if defined(BOOST_INTERPROCESS_WINDOWS)
-
-inline int thread_create( OS_thread_t * thread, boost::ipwinapiext::LPTHREAD_START_ROUTINE_ start_routine, void* arg )
-{
-   void* h = boost::ipwinapiext::CreateThread(0, 0, start_routine, arg, 0, 0);
-
-   if( h != 0 ){
-      thread->m_handle = h;
-      return 0;
-   }
-   else{
-      return 1;
-   }
-}
-
-inline void thread_join( OS_thread_t thread)
-{
-   winapi::wait_for_single_object( thread.handle(), winapi::infinite_time );
-   winapi::close_handle( thread.handle() );
-}
-
-#endif
-
-class abstract_thread
-{
-   public:
-   virtual ~abstract_thread() {}
-   virtual void run() = 0;
-};
-
-template<class T>
-class os_thread_func_ptr_deleter
-{
-   public:
-   explicit os_thread_func_ptr_deleter(T* p)
-      : m_p(p)
-   {}
-
-   T *release()
-   {  T *p = m_p; m_p = 0; return p;  }
-
-   T *get() const
-   {  return m_p;  }
-
-   T *operator ->() const
-   {  return m_p;  }
-
-   ~os_thread_func_ptr_deleter()
-   {  delete m_p; }
-
-   private:
-   T *m_p;
-};
-
-#if defined(BOOST_INTERPROCESS_WINDOWS)
-
-inline boost::winapi::DWORD_ __stdcall launch_thread_routine(boost::winapi::LPVOID_ pv)
-{
-   os_thread_func_ptr_deleter<abstract_thread> pt( static_cast<abstract_thread *>( pv ) );
-   pt->run();
-   return 0;
-}
-
-#else
-
-extern "C" void * launch_thread_routine( void * pv );
-
-inline void * launch_thread_routine( void * pv )
-{
-   os_thread_func_ptr_deleter<abstract_thread> pt( static_cast<abstract_thread *>( pv ) );
-   pt->run();
-   return 0;
-}
-
-#endif
-
-template<class F>
-class launch_thread_impl
-   : public abstract_thread
-{
-   public:
-   explicit launch_thread_impl( F f )
-      : f_( f )
-   {}
-
-   virtual void run() BOOST_OVERRIDE
-   {  f_();  }
-
-   private:
-   F f_;
-};
-
-template<class F>
-inline int thread_launch( OS_thread_t & pt, F f )
-{
-   os_thread_func_ptr_deleter<abstract_thread> p( new launch_thread_impl<F>( f ) );
-
-   int r = thread_create(&pt, launch_thread_routine, p.get());
-   if( r == 0 ){
-      p.release();
-   }
-
-   return r;
-}
-
-}  //namespace ipcdetail{
-}  //namespace interprocess {
-}  //namespace boost {
-
-#include <boost/interprocess/detail/config_end.hpp>
-
-#endif   //BOOST_INTERPROCESS_DETAIL_OS_THREAD_FUNCTIONS_HPP
diff --git a/src/boost/interprocess/detail/portable_intermodule_singleton.hpp b/src/boost/interprocess/detail/portable_intermodule_singleton.hpp
deleted file mode 100644
index 32e196a6..00000000
--- a/src/boost/interprocess/detail/portable_intermodule_singleton.hpp
+++ /dev/null
@@ -1,361 +0,0 @@
-//////////////////////////////////////////////////////////////////////////////
-//
-// (C) Copyright Ion Gaztanaga 2009-2012. Distributed under the Boost
-// 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/interprocess for documentation.
-//
-//////////////////////////////////////////////////////////////////////////////
-
-#ifndef BOOST_INTERPROCESS_PORTABLE_INTERMODULE_SINGLETON_HPP
-#define BOOST_INTERPROCESS_PORTABLE_INTERMODULE_SINGLETON_HPP
-
-#ifndef BOOST_CONFIG_HPP
-#  include <boost/config.hpp>
-#endif
-#
-#if defined(BOOST_HAS_PRAGMA_ONCE)
-#pragma once
-#endif
-
-#include <boost/interprocess/detail/config_begin.hpp>
-#include <boost/interprocess/detail/workaround.hpp>
-
-#include <boost/interprocess/detail/managed_global_memory.hpp>
-#include <boost/interprocess/detail/intermodule_singleton_common.hpp>
-#include <boost/interprocess/shared_memory_object.hpp>
-#include <boost/interprocess/detail/atomic.hpp>
-#include <boost/interprocess/detail/os_thread_functions.hpp>
-#include <boost/interprocess/detail/shared_dir_helpers.hpp>
-#include <boost/interprocess/detail/os_file_functions.hpp>
-#include <boost/interprocess/detail/file_locking_helpers.hpp>
-#include <boost/assert.hpp>
-#include <cstddef>
-#include <cstdio>
-#include <cstring>
-#include <string>
-
-namespace boost{
-namespace interprocess{
-namespace ipcdetail{
-
-typedef basic_managed_global_memory<shared_memory_object, true>    managed_global_memory;
-
-namespace intermodule_singleton_helpers {
-
-static void create_tmp_subdir_and_get_pid_based_filepath
-   (const char *subdir_name, const char *file_prefix, OS_process_id_t pid, std::string &s, bool creation_time = false)
-{
-   //Let's create a lock file for each process gmem that will mark if
-   //the process is alive or not
-   create_shared_dir_and_clean_old(s);
-   s += "/";
-   s += subdir_name;
-   if(!open_or_create_shared_directory(s.c_str())){
-      error_info err = system_error_code();
-      throw interprocess_exception(err);
-   }
-   s += "/";
-   s += file_prefix;
-   if(creation_time){
-      std::string sstamp;
-      get_pid_creation_time_str(sstamp);
-      s += sstamp;
-   }
-   else{
-      pid_str_t pid_str;
-      get_pid_str(pid_str, pid);
-      s += pid_str;
-   }
-}
-
-static bool check_if_filename_complies_with_pid
-   (const char *filename, const char *prefix, OS_process_id_t pid, std::string &file_suffix, bool creation_time = false)
-{
-   //Check if filename complies with lock file name pattern
-   std::string fname(filename);
-   std::string fprefix(prefix);
-   if(fname.size() <= fprefix.size()){
-      return false;
-   }
-   fname.resize(fprefix.size());
-   if(fname != fprefix){
-      return false;
-   }
-
-   //If not our lock file, delete it if we can lock it
-   fname = filename;
-   fname.erase(0, fprefix.size());
-   pid_str_t pid_str;
-   get_pid_str(pid_str, pid);
-   file_suffix = pid_str;
-   if(creation_time){
-      std::size_t p = fname.find('_');
-      if (p == std::string::npos){
-         return false;
-      }
-      std::string save_suffix(fname);
-      fname.erase(p);
-      fname.swap(file_suffix);
-      bool ret = (file_suffix == fname);
-      file_suffix.swap(save_suffix);
-      return ret;
-   }
-   else{
-      fname.swap(file_suffix);
-      return (file_suffix == fname);
-   }
-}
-
-template<>
-struct thread_safe_global_map_dependant<managed_global_memory>
-{
-   private:
-   static const int GMemMarkToBeRemoved = -1;
-   static const int GMemNotPresent      = -2;
-
-   static const char *get_lock_file_subdir_name()
-   {  return "gmem";  }
-
-   static const char *get_lock_file_base_name()
-   {  return "lck";  }
-
-   static void create_and_get_singleton_lock_file_path(std::string &s)
-   {
-      create_tmp_subdir_and_get_pid_based_filepath
-         (get_lock_file_subdir_name(), get_lock_file_base_name(), get_current_process_id(), s, true);
-   }
-
-   struct gmem_erase_func
-   {
-      gmem_erase_func(const char *shm_name, const char *singleton_lock_file_path, managed_global_memory & shm)
-         :shm_name_(shm_name), singleton_lock_file_path_(singleton_lock_file_path), shm_(shm)
-      {}
-
-      void operator()()
-      {
-         locking_file_serial_id *pserial_id = shm_.find<locking_file_serial_id>("lock_file_fd").first;
-         if(pserial_id){
-            pserial_id->fd = GMemMarkToBeRemoved;
-         }
-         delete_file(singleton_lock_file_path_);
-         shared_memory_object::remove(shm_name_);
-      }
-
-      const char * const shm_name_;
-      const char * const singleton_lock_file_path_;
-      managed_global_memory & shm_;
-   };
-
-   //This function applies shared memory erasure logic based on the passed lock file.
-   static void apply_gmem_erase_logic(const char *filepath, const char *filename)
-   {
-      int fd = GMemMarkToBeRemoved;
-      BOOST_TRY{
-         std::string str;
-         //If the filename is current process lock file, then avoid it
-         if(check_if_filename_complies_with_pid
-            (filename, get_lock_file_base_name(), get_current_process_id(), str, true)){
-            return;
-         }
-         //Open and lock the other process' lock file
-         fd = try_open_and_lock_file(filepath);
-         if(fd < 0){
-            return;
-         }
-         //If done, then the process is dead so take global shared memory name
-         //(the name is based on the lock file name) and try to apply erasure logic
-         str.insert(0, get_map_base_name());
-         BOOST_TRY{
-            managed_global_memory shm(open_only, str.c_str());
-            gmem_erase_func func(str.c_str(), filepath, shm);
-            shm.try_atomic_func(func);
-         }
-         BOOST_CATCH(interprocess_exception &e){
-            //If shared memory is not found erase the lock file
-            if(e.get_error_code() == not_found_error){
-               delete_file(filepath);
-            }
-         } BOOST_CATCH_END
-      }
-      BOOST_CATCH(...){
-
-      } BOOST_CATCH_END
-      if(fd >= 0){
-         close_lock_file(fd);
-      }
-   }
-
-   public:
-
-   static bool remove_old_gmem()
-   {
-      std::string refcstrRootDirectory;
-      get_shared_dir(refcstrRootDirectory);
-      refcstrRootDirectory += "/";
-      refcstrRootDirectory += get_lock_file_subdir_name();
-      return for_each_file_in_dir(refcstrRootDirectory.c_str(), apply_gmem_erase_logic);
-   }
-
-   struct lock_file_logic
-   {
-      lock_file_logic(managed_global_memory &shm)
-         : mshm(shm)
-      {  shm.atomic_func(*this); }
-
-      void operator()(void)
-      {
-         retry_with_new_map = false;
-
-         //First find the file locking descriptor id
-         locking_file_serial_id *pserial_id =
-            mshm.find<locking_file_serial_id>("lock_file_fd").first;
-
-         int fd;
-         //If not found schedule a creation
-         if(!pserial_id){
-            fd = GMemNotPresent;
-         }
-         //Else get it
-         else{
-            fd = pserial_id->fd;
-         }
-         //If we need to create a new one, do it
-         if(fd == GMemNotPresent){
-            std::string lck_str;
-            //Create a unique current pid based lock file path
-            create_and_get_singleton_lock_file_path(lck_str);
-            //Open or create and lock file
-            int fd_lockfile = open_or_create_and_lock_file(lck_str.c_str());
-            //If failed, write a bad file descriptor to notify other modules that
-            //something was wrong and unlink shared memory. Mark the function object
-            //to tell caller to retry with another shared memory
-            if(fd_lockfile < 0){
-               this->register_lock_file(GMemMarkToBeRemoved);
-               std::string s;
-               get_map_name(s);
-               shared_memory_object::remove(s.c_str());
-               retry_with_new_map = true;
-            }
-            //If successful, register the file descriptor
-            else{
-               this->register_lock_file(fd_lockfile);
-            }
-         }
-         //If the fd was invalid (maybe a previous try failed) notify caller that
-         //should retry creation logic, since this shm might have been already
-         //unlinked since the shm was removed
-         else if (fd == GMemMarkToBeRemoved){
-            retry_with_new_map = true;
-         }
-         //If the stored fd is not valid (a open fd, a normal file with the
-         //expected size, or does not have the same file id number,
-         //then it's an old shm from an old process with the same pid.
-         //If that's the case, mark it as invalid
-         else if(!is_valid_fd(fd) ||
-               !is_normal_file(fd) ||
-               0 != get_size(fd) ||
-               !compare_file_serial(fd, *pserial_id)){
-            pserial_id->fd = GMemMarkToBeRemoved;
-            std::string s;
-            get_map_name(s);
-            shared_memory_object::remove(s.c_str());
-            retry_with_new_map = true;
-         }
-         else{
-            //If the lock file is ok, increment reference count of
-            //attached modules to shared memory
-            atomic_inc32(&pserial_id->modules_attached_to_gmem_count);
-         }
-      }
-
-      bool retry() const { return retry_with_new_map; }
-
-      private:
-      locking_file_serial_id * register_lock_file(int fd)
-      {
-         locking_file_serial_id *pinfo = mshm.construct<locking_file_serial_id>("lock_file_fd")();
-         fill_file_serial_id(fd, *pinfo);
-         return pinfo;
-      }
-
-      managed_global_memory &mshm;
-      bool retry_with_new_map;
-   };
-
-   static void construct_map(void *addr)
-   {
-      std::string s;
-      intermodule_singleton_helpers::get_map_name(s);
-      const char *MapName = s.c_str();
-      const std::size_t MapSize = intermodule_singleton_helpers::get_map_size();;
-      ::new (addr)managed_global_memory(open_or_create, MapName, MapSize);
-   }
-
-   struct unlink_map_logic
-   {
-      unlink_map_logic(managed_global_memory &mshm)
-         : mshm_(mshm)
-      {  mshm.atomic_func(*this);  }
-
-      void operator()()
-      {
-         locking_file_serial_id *pserial_id =
-            mshm_.find<locking_file_serial_id>
-               ("lock_file_fd").first;
-         BOOST_ASSERT(0 != pserial_id);
-         if(1 == atomic_dec32(&pserial_id->modules_attached_to_gmem_count)){
-            int fd = pserial_id->fd;
-            if(fd > 0){
-               pserial_id->fd = GMemMarkToBeRemoved;
-               std::string s;
-               create_and_get_singleton_lock_file_path(s);
-               delete_file(s.c_str());
-               close_lock_file(fd);
-               intermodule_singleton_helpers::get_map_name(s);
-               shared_memory_object::remove(s.c_str());
-            }
-         }
-      }
-
-      private:
-      managed_global_memory &mshm_;
-   };
-
-   static ref_count_ptr *find(managed_global_memory &map, const char *name)
-   {
-      return map.find<ref_count_ptr>(name).first;
-   }
-
-   static ref_count_ptr *insert(managed_global_memory &map, const char *name, const ref_count_ptr &ref)
-   {
-      return map.construct<ref_count_ptr>(name)(ref);
-   }
-
-   static bool erase(managed_global_memory &map, const char *name)
-   {
-      return map.destroy<ref_count_ptr>(name);
-   }
-
-   template<class F>
-   static void atomic_func(managed_global_memory &map, F &f)
-   {
-      map.atomic_func(f);
-   }
-};
-
-}  //namespace intermodule_singleton_helpers {
-
-template<typename C, bool LazyInit = true, bool Phoenix = false>
-class portable_intermodule_singleton
-   : public intermodule_singleton_impl<C, LazyInit, Phoenix, managed_global_memory>
-{};
-
-}  //namespace ipcdetail{
-}  //namespace interprocess{
-}  //namespace boost{
-
-#include <boost/interprocess/detail/config_end.hpp>
-
-#endif   //#ifndef BOOST_INTERPROCESS_PORTABLE_INTERMODULE_SINGLETON_HPP
diff --git a/src/boost/interprocess/detail/segment_manager_helper.hpp b/src/boost/interprocess/detail/segment_manager_helper.hpp
deleted file mode 100644
index 036dab5c..00000000
--- a/src/boost/interprocess/detail/segment_manager_helper.hpp
+++ /dev/null
@@ -1,518 +0,0 @@
-//////////////////////////////////////////////////////////////////////////////
-//
-// (C) Copyright Ion Gaztanaga 2005-2012. Distributed under the Boost
-// 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/interprocess for documentation.
-//
-//////////////////////////////////////////////////////////////////////////////
-
-#ifndef BOOST_INTERPROCESS_SEGMENT_MANAGER_BASE_HPP
-#define BOOST_INTERPROCESS_SEGMENT_MANAGER_BASE_HPP
-
-#ifndef BOOST_CONFIG_HPP
-#  include <boost/config.hpp>
-#endif
-#
-#if defined(BOOST_HAS_PRAGMA_ONCE)
-#  pragma once
-#endif
-
-#include <boost/interprocess/detail/config_begin.hpp>
-#include <boost/interprocess/detail/workaround.hpp>
-
-// interprocess
-#include <boost/interprocess/exceptions.hpp>
-// interprocess/detail
-#include <boost/interprocess/detail/type_traits.hpp>
-#include <boost/interprocess/detail/utilities.hpp>
-#include <boost/interprocess/detail/in_place_interface.hpp>
-// container/detail
-#include <boost/container/detail/type_traits.hpp> //alignment_of
-#include <boost/container/detail/minimal_char_traits_header.hpp>
-// intrusive
-#include <boost/intrusive/pointer_traits.hpp>
-// move/detail
-#include <boost/move/detail/type_traits.hpp> //make_unsigned
-#include <boost/move/detail/force_ptr.hpp>
-// other boost
-#include <boost/assert.hpp>   //BOOST_ASSERT
-#include <boost/core/no_exceptions_support.hpp>
-// std
-#include <cstddef>   //std::size_t
-
-//!\file
-//!Describes the object placed in a memory segment that provides
-//!named object allocation capabilities.
-
-namespace boost{
-namespace interprocess{
-
-template<class MemoryManager>
-class segment_manager_base;
-
-//!An integer that describes the type of the
-//!instance constructed in memory
-enum instance_type {   anonymous_type, named_type, unique_type, max_allocation_type };
-
-namespace ipcdetail{
-
-template<class MemoryAlgorithm>
-class mem_algo_deallocator
-{
-   void *            m_ptr;
-   MemoryAlgorithm & m_algo;
-
-   public:
-   mem_algo_deallocator(void *ptr, MemoryAlgorithm &algo)
-      :  m_ptr(ptr), m_algo(algo)
-   {}
-
-   void release()
-   {  m_ptr = 0;  }
-
-   ~mem_algo_deallocator()
-   {  if(m_ptr) m_algo.deallocate(m_ptr);  }
-};
-
-template<class size_type>
-struct block_header
-{
-   size_type      m_value_bytes;
-   unsigned short m_num_char;
-   unsigned char  m_value_alignment;
-   unsigned char  m_alloc_type_sizeof_char;
-
-   block_header(size_type val_bytes
-               ,size_type val_alignment
-               ,unsigned char al_type
-               ,std::size_t szof_char
-               ,std::size_t num_char
-               )
-      :  m_value_bytes(val_bytes)
-      ,  m_num_char((unsigned short)num_char)
-      ,  m_value_alignment((unsigned char)val_alignment)
-      ,  m_alloc_type_sizeof_char( (unsigned char)((al_type << 5u) | ((unsigned char)szof_char & 0x1F)) )
-   {};
-
-   template<class T>
-   block_header &operator= (const T& )
-   {  return *this;  }
-
-   size_type total_size() const
-   {
-      if(alloc_type() != anonymous_type){
-         return name_offset() + (m_num_char+1u)*sizeof_char();
-      }
-      else{
-         return this->value_offset() + m_value_bytes;
-      }
-   }
-
-   size_type value_bytes() const
-   {  return m_value_bytes;   }
-
-   template<class Header>
-   size_type total_size_with_header() const
-   {
-      return get_rounded_size
-               ( size_type(sizeof(Header))
-            , size_type(::boost::container::dtl::alignment_of<block_header<size_type> >::value))
-           + total_size();
-   }
-
-   unsigned char alloc_type() const
-   {  return (m_alloc_type_sizeof_char >> 5u)&(unsigned char)0x7;  }
-
-   unsigned char sizeof_char() const
-   {  return m_alloc_type_sizeof_char & (unsigned char)0x1F;  }
-
-   template<class CharType>
-   CharType *name() const
-   {
-      return const_cast<CharType*>(move_detail::force_ptr<const CharType*>
-         (reinterpret_cast<const char*>(this) + name_offset()));
-   }
-
-   unsigned short name_length() const
-   {  return m_num_char;   }
-
-   size_type name_offset() const
-   {
-      return this->value_offset() + get_rounded_size(size_type(m_value_bytes), size_type(sizeof_char()));
-   }
-
-   void *value() const
-   {
-      return const_cast<char*>((reinterpret_cast<const char*>(this) + this->value_offset()));
-   }
-
-   size_type value_offset() const
-   {
-      return get_rounded_size(size_type(sizeof(block_header<size_type>)), size_type(m_value_alignment));
-   }
-
-   template<class CharType>
-   bool less_comp(const block_header<size_type> &b) const
-   {
-      return m_num_char < b.m_num_char ||
-             (m_num_char < b.m_num_char &&
-              std::char_traits<CharType>::compare(name<CharType>(), b.name<CharType>(), m_num_char) < 0);
-   }
-
-   template<class CharType>
-   bool equal_comp(const block_header<size_type> &b) const
-   {
-      return m_num_char == b.m_num_char &&
-             std::char_traits<CharType>::compare(name<CharType>(), b.name<CharType>(), m_num_char) == 0;
-   }
-
-   template<class T>
-   static block_header<size_type> *block_header_from_value(T *value)
-   {  return block_header_from_value(value, sizeof(T), ::boost::container::dtl::alignment_of<T>::value);  }
-
-   static block_header<size_type> *block_header_from_value(const void *value, std::size_t sz, std::size_t algn)
-   {
-      block_header * hdr =
-         const_cast<block_header*>
-            (move_detail::force_ptr<const block_header*>(reinterpret_cast<const char*>(value) -
-               get_rounded_size(sizeof(block_header), algn)));
-      (void)sz;
-      //Some sanity checks
-      BOOST_ASSERT(hdr->m_value_alignment == algn);
-      BOOST_ASSERT(hdr->m_value_bytes % sz == 0);
-      return hdr;
-   }
-
-   template<class Header>
-   static block_header<size_type> *from_first_header(Header *header)
-   {
-      block_header<size_type> * hdr =
-         move_detail::force_ptr<block_header<size_type>*>(reinterpret_cast<char*>(header) +
-       get_rounded_size( size_type(sizeof(Header))
-                       , size_type(::boost::container::dtl::alignment_of<block_header<size_type> >::value)));
-      //Some sanity checks
-      return hdr;
-   }
-
-   template<class Header>
-   static Header *to_first_header(block_header<size_type> *bheader)
-   {
-      Header * hdr =
-         move_detail::force_ptr<Header*>(reinterpret_cast<char*>(bheader) -
-       get_rounded_size( size_type(sizeof(Header))
-                       , size_type(::boost::container::dtl::alignment_of<block_header<size_type> >::value)));
-      //Some sanity checks
-      return hdr;
-   }
-};
-
-inline void array_construct(void *mem, std::size_t num, in_place_interface &table)
-{
-   //Try constructors
-   std::size_t constructed = 0;
-   BOOST_TRY{
-      table.construct_n(mem, num, constructed);
-   }
-   //If there is an exception call destructors and erase index node
-   BOOST_CATCH(...){
-      std::size_t destroyed = 0;
-      table.destroy_n(mem, constructed, destroyed);
-      BOOST_RETHROW
-   } BOOST_CATCH_END
-}
-
-template<class CharT>
-struct intrusive_compare_key
-{
-   typedef CharT char_type;
-
-   intrusive_compare_key(const CharT *str, std::size_t len)
-      :  mp_str(str), m_len(len)
-   {}
-
-   const CharT *  mp_str;
-   std::size_t    m_len;
-};
-
-//!This struct indicates an anonymous object creation
-//!allocation
-template<instance_type type>
-class instance_t
-{
-   instance_t(){}
-};
-
-template<class T>
-struct char_if_void
-{
-   typedef T type;
-};
-
-template<>
-struct char_if_void<void>
-{
-   typedef char type;
-};
-
-typedef instance_t<anonymous_type>  anonymous_instance_t;
-typedef instance_t<unique_type>     unique_instance_t;
-
-
-template<class Hook, class CharType, class SizeType>
-struct intrusive_value_type_impl
-   :  public Hook
-{
-   private:
-   //Non-copyable
-   intrusive_value_type_impl(const intrusive_value_type_impl &);
-   intrusive_value_type_impl& operator=(const intrusive_value_type_impl &);
-
-   public:
-   typedef CharType char_type;
-   typedef SizeType size_type;
-
-   intrusive_value_type_impl(){}
-
-   enum  {  BlockHdrAlignment = ::boost::container::dtl::alignment_of<block_header<size_type> >::value  };
-
-   block_header<size_type> *get_block_header() const
-   {
-      return const_cast<block_header<size_type>*>
-         (move_detail::force_ptr<const block_header<size_type> *>(reinterpret_cast<const char*>(this) +
-            get_rounded_size(size_type(sizeof(*this)), size_type(BlockHdrAlignment))));
-   }
-
-   bool operator <(const intrusive_value_type_impl<Hook, CharType, SizeType> & other) const
-   {  return (this->get_block_header())->template less_comp<CharType>(*other.get_block_header());  }
-
-   bool operator ==(const intrusive_value_type_impl<Hook, CharType, SizeType> & other) const
-   {  return (this->get_block_header())->template equal_comp<CharType>(*other.get_block_header());  }
-
-   static intrusive_value_type_impl *get_intrusive_value_type(block_header<size_type> *hdr)
-   {
-      return move_detail::force_ptr<intrusive_value_type_impl*>(reinterpret_cast<char*>(hdr) -
-         get_rounded_size(size_type(sizeof(intrusive_value_type_impl)), size_type(BlockHdrAlignment)));
-   }
-
-   CharType *name() const
-   {  return get_block_header()->template name<CharType>(); }
-
-   unsigned short name_length() const
-   {  return get_block_header()->name_length(); }
-
-   void *value() const
-   {  return get_block_header()->value(); }
-};
-
-template<class CharType>
-class char_ptr_holder
-{
-   public:
-   char_ptr_holder(const CharType *name)
-      : m_name(name)
-   {}
-
-   char_ptr_holder(const anonymous_instance_t *)
-      : m_name(static_cast<CharType*>(0))
-   {}
-
-   char_ptr_holder(const unique_instance_t *)
-      : m_name(reinterpret_cast<CharType*>(-1))
-   {}
-
-   operator const CharType *()
-   {  return m_name;  }
-
-   const CharType *get() const
-   {  return m_name;  }
-
-   bool is_unique() const
-   {  return m_name == reinterpret_cast<CharType*>(-1);  }
-
-   bool is_anonymous() const
-   {  return m_name == static_cast<CharType*>(0);  }
-
-   private:
-   const CharType *m_name;
-};
-
-//!The key of the the named allocation information index. Stores an offset pointer
-//!to a null terminated string and the length of the string to speed up sorting
-template<class CharT, class VoidPointer>
-struct index_key
-{
-   typedef typename boost::intrusive::
-      pointer_traits<VoidPointer>::template
-         rebind_pointer<const CharT>::type               const_char_ptr_t;
-   typedef CharT                                         char_type;
-   typedef typename boost::intrusive::pointer_traits<const_char_ptr_t>::difference_type difference_type;
-   typedef typename boost::move_detail::make_unsigned<difference_type>::type size_type;
-
-   private:
-   //Offset pointer to the object's name
-   const_char_ptr_t  mp_str;
-   //Length of the name buffer (null NOT included)
-   size_type         m_len;
-   public:
-
-   //!Constructor of the key
-   index_key (const char_type *nm, size_type length)
-      : mp_str(nm), m_len(length)
-   {}
-
-   //!Less than function for index ordering
-   bool operator < (const index_key & right) const
-   {
-      return (m_len < right.m_len) ||
-               (m_len == right.m_len &&
-                std::char_traits<char_type>::compare
-                  (to_raw_pointer(mp_str),to_raw_pointer(right.mp_str), m_len) < 0);
-   }
-
-   //!Equal to function for index ordering
-   bool operator == (const index_key & right) const
-   {
-      return   m_len == right.m_len &&
-               std::char_traits<char_type>::compare
-                  (to_raw_pointer(mp_str), to_raw_pointer(right.mp_str), m_len) == 0;
-   }
-
-   void name(const CharT *nm)
-   {  mp_str = nm; }
-
-   void name_length(size_type len)
-   {  m_len = len; }
-
-   const CharT *name() const
-   {  return to_raw_pointer(mp_str); }
-
-   size_type name_length() const
-   {  return m_len; }
-};
-
-//!The index_data stores a pointer to a buffer and the element count needed
-//!to know how many destructors must be called when calling destroy
-template<class VoidPointer>
-struct index_data
-{
-   typedef VoidPointer void_pointer;
-   void_pointer    m_ptr;
-   explicit index_data(void *ptr) : m_ptr(ptr){}
-
-   void *value() const
-   {  return static_cast<void*>(to_raw_pointer(m_ptr));  }
-};
-
-template<class MemoryAlgorithm>
-struct segment_manager_base_type
-{  typedef segment_manager_base<MemoryAlgorithm> type;   };
-
-template<class CharT, class MemoryAlgorithm>
-struct index_config
-{
-   typedef typename MemoryAlgorithm::void_pointer        void_pointer;
-   typedef CharT                                         char_type;
-   typedef index_key<CharT, void_pointer>        key_type;
-   typedef index_data<void_pointer>              mapped_type;
-   typedef typename segment_manager_base_type
-      <MemoryAlgorithm>::type                            segment_manager_base;
-
-   template<class HeaderBase>
-   struct intrusive_value_type
-   {  typedef intrusive_value_type_impl<HeaderBase, CharT, typename segment_manager_base::size_type>  type; };
-
-   typedef intrusive_compare_key<CharT>            intrusive_compare_key_type;
-};
-
-template<class Iterator, bool intrusive>
-class segment_manager_iterator_value_adaptor
-{
-   typedef typename Iterator::value_type        iterator_val_t;
-   typedef typename iterator_val_t::char_type   char_type;
-
-   public:
-   segment_manager_iterator_value_adaptor(const typename Iterator::value_type &val)
-      :  m_val(&val)
-   {}
-
-   const char_type *name() const
-   {  return m_val->name(); }
-
-   unsigned short name_length() const
-   {  return m_val->name_length(); }
-
-   const void *value() const
-   {  return m_val->value(); }
-
-   const typename Iterator::value_type *m_val;
-};
-
-
-template<class Iterator>
-class segment_manager_iterator_value_adaptor<Iterator, false>
-{
-   typedef typename Iterator::value_type        iterator_val_t;
-   typedef typename iterator_val_t::first_type  first_type;
-   typedef typename iterator_val_t::second_type second_type;
-   typedef typename first_type::char_type       char_type;
-   typedef typename first_type::size_type       size_type;
-
-   public:
-   segment_manager_iterator_value_adaptor(const typename Iterator::value_type &val)
-      :  m_val(&val)
-   {}
-
-   const char_type *name() const
-   {  return m_val->first.name(); }
-
-   size_type name_length() const
-   {  return m_val->first.name_length(); }
-
-   const void *value() const
-   {
-      return move_detail::force_ptr<block_header<size_type>*>
-         (to_raw_pointer(m_val->second.m_ptr))->value();
-   }
-
-   const typename Iterator::value_type *m_val;
-};
-
-template<class Iterator, bool intrusive>
-struct segment_manager_iterator_transform
-{
-   typedef segment_manager_iterator_value_adaptor<Iterator, intrusive> result_type;
-
-   template <class T> result_type operator()(const T &arg) const
-   {  return result_type(arg); }
-};
-
-}  //namespace ipcdetail {
-
-//These pointers are the ones the user will use to
-//indicate previous allocation types
-static const ipcdetail::anonymous_instance_t   * anonymous_instance = 0;
-static const ipcdetail::unique_instance_t      * unique_instance = 0;
-
-namespace ipcdetail_really_deep_namespace {
-
-//Otherwise, gcc issues a warning of previously defined
-//anonymous_instance and unique_instance
-struct dummy
-{
-   dummy()
-   {
-      (void)anonymous_instance;
-      (void)unique_instance;
-   }
-};
-
-}  //detail_really_deep_namespace
-
-}} //namespace boost { namespace interprocess
-
-#include <boost/interprocess/detail/config_end.hpp>
-
-#endif //#ifndef BOOST_INTERPROCESS_SEGMENT_MANAGER_BASE_HPP
-
diff --git a/src/boost/interprocess/detail/shared_dir_helpers.hpp b/src/boost/interprocess/detail/shared_dir_helpers.hpp
deleted file mode 100644
index 8d9d36f2..00000000
--- a/src/boost/interprocess/detail/shared_dir_helpers.hpp
+++ /dev/null
@@ -1,258 +0,0 @@
-//////////////////////////////////////////////////////////////////////////////
-//
-// (C) Copyright Ion Gaztanaga 2007-2014. Distributed under the Boost
-// 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/interprocess for documentation.
-//
-//////////////////////////////////////////////////////////////////////////////
-
-#ifndef BOOST_INTERPROCESS_DETAIL_SHARED_DIR_HELPERS_HPP
-#define BOOST_INTERPROCESS_DETAIL_SHARED_DIR_HELPERS_HPP
-
-#ifndef BOOST_CONFIG_HPP
-#  include <boost/config.hpp>
-#endif
-#
-#if defined(BOOST_HAS_PRAGMA_ONCE)
-#  pragma once
-#endif
-
-#include <boost/interprocess/detail/config_begin.hpp>
-#include <boost/interprocess/detail/workaround.hpp>
-#include <boost/interprocess/detail/os_file_functions.hpp>
-#include <boost/interprocess/errors.hpp>
-#include <boost/interprocess/exceptions.hpp>
-#include <string>
-
-#if defined(BOOST_INTERPROCESS_HAS_KERNEL_BOOTTIME) && defined(BOOST_INTERPROCESS_WINDOWS)
-   #include <boost/interprocess/detail/windows_intermodule_singleton.hpp>
-#endif
-
-namespace boost {
-namespace interprocess {
-namespace ipcdetail {
-
-template<class CharT>
-struct shared_dir_constants;
-
-template<>
-struct shared_dir_constants<char>
-{
-   static char dir_separator()
-   {  return '/';   }
-
-   static const char *dir_interprocess()
-   {  return "/boost_interprocess";   }
-};
-
-template<>
-struct shared_dir_constants<wchar_t>
-{
-   static wchar_t dir_separator()
-   {  return L'/';   }
-
-   static const wchar_t *dir_interprocess()
-   {  return L"/boost_interprocess";   }
-};
-
-#if defined(BOOST_INTERPROCESS_HAS_KERNEL_BOOTTIME)
-   #if defined(BOOST_INTERPROCESS_WINDOWS)
-      //This type will initialize the stamp
-      template<class CharT>
-      struct windows_bootstamp
-      {
-         windows_bootstamp()
-         {
-            //Throw if bootstamp not available
-            if(!winapi::get_last_bootup_time(stamp)){
-               error_info err = system_error_code();
-               throw interprocess_exception(err);
-            }
-         }
-         //Use std::string. Even if this will be constructed in shared memory, all
-         //modules/dlls are from this process so internal raw pointers to heap are always valid
-         std::basic_string<CharT> stamp;
-      };
-
-      template <class CharT>
-      inline void get_bootstamp(std::basic_string<CharT> &s, bool add = false)
-      {
-         const windows_bootstamp<CharT> &bootstamp = windows_intermodule_singleton<windows_bootstamp<CharT> >::get();
-         if(add){
-            s += bootstamp.stamp;
-         }
-         else{
-            s = bootstamp.stamp;
-         }
-      }
-   #elif defined(BOOST_INTERPROCESS_HAS_BSD_KERNEL_BOOTTIME)
-      inline void get_bootstamp(std::string &s, bool add = false)
-      {
-         // FreeBSD specific: sysctl "kern.boottime"
-         int request[2] = { CTL_KERN, KERN_BOOTTIME };
-         struct ::timeval result;
-         std::size_t result_len = sizeof result;
-
-         if (::sysctl (request, 2, &result, &result_len, 0, 0) < 0)
-            return;
-
-         char bootstamp_str[256];
-
-         const char Characters [] =
-            { '0', '1', '2', '3', '4', '5', '6', '7'
-            , '8', '9', 'A', 'B', 'C', 'D', 'E', 'F' };
-
-         std::size_t char_counter = 0;
-         //32 bit values to allow 32 and 64 bit process IPC
-         boost::uint32_t fields[2] = { boost::uint32_t(result.tv_sec), boost::uint32_t(result.tv_usec) };
-         for(std::size_t field = 0; field != 2; ++field){
-            for(std::size_t i = 0; i != sizeof(fields[0]); ++i){
-               const char *ptr = (const char *)&fields[field];
-               bootstamp_str[char_counter++] = Characters[(ptr[i]&0xF0)>>4];
-               bootstamp_str[char_counter++] = Characters[(ptr[i]&0x0F)];
-            }
-         }
-         bootstamp_str[char_counter] = 0;
-         if(add){
-            s += bootstamp_str;
-         }
-         else{
-            s = bootstamp_str;
-         }
-      }
-   #else
-      #error "BOOST_INTERPROCESS_HAS_KERNEL_BOOTTIME defined with no known implementation"
-   #endif
-#endif   //#if defined(BOOST_INTERPROCESS_HAS_KERNEL_BOOTTIME)
-
-template <class CharT>
-inline void get_shared_dir_root(std::basic_string<CharT> &dir_path)
-{
-   #if defined (BOOST_INTERPROCESS_WINDOWS)
-      winapi::get_shared_documents_folder(dir_path);
-   #else               
-      dir_path = "/tmp";
-   #endif
-
-   //We always need this path, so throw on error
-   if(dir_path.empty()){
-      error_info err = system_error_code();
-      throw interprocess_exception(err);
-   }
-
-   dir_path += shared_dir_constants<CharT>::dir_interprocess();
-}
-
-#if defined(BOOST_INTERPROCESS_SHARED_DIR_FUNC) && defined(BOOST_INTERPROCESS_SHARED_DIR_PATH)
-#error "Error: Both BOOST_INTERPROCESS_SHARED_DIR_FUNC and BOOST_INTERPROCESS_SHARED_DIR_PATH defined!"
-#endif
-
-#ifdef BOOST_INTERPROCESS_SHARED_DIR_FUNC
-
-   // When BOOST_INTERPROCESS_SHARED_DIR_FUNC is defined, users have to implement
-   // get_shared_dir
-   void get_shared_dir(std::string &shared_dir);
-
-   // When BOOST_INTERPROCESS_SHARED_DIR_FUNC is defined, users have to implement
-   // get_shared_dir
-   void get_shared_dir(std::wstring &shared_dir);
-
-#else
-
-#if defined(BOOST_INTERPROCESS_SHARED_DIR_PATH)
-
-inline void get_shared_dir(std::string &shared_dir)
-{
-   shared_dir = BOOST_INTERPROCESS_SHARED_DIR_PATH;
-}
-
-#endif
-
-#if defined(BOOST_INTERPROCESS_SHARED_DIR_WPATH)
-
-inline void get_shared_dir(std::wstring &shared_dir)
-{
-   shared_dir = BOOST_INTERPROCESS_SHARED_DIR_WPATH;
-}
-
-#endif
-
-template<class CharT>
-inline void get_shared_dir(std::basic_string<CharT> &shared_dir)
-{
-      get_shared_dir_root(shared_dir);
-      #if defined(BOOST_INTERPROCESS_HAS_KERNEL_BOOTTIME)
-         shared_dir += shared_dir_constants<CharT>::dir_separator();
-         get_bootstamp(shared_dir, true);
-      #endif
-}
-#endif
-
-template<class CharT>
-inline void shared_filepath(const CharT *filename, std::basic_string<CharT> &filepath)
-{
-   get_shared_dir(filepath);
-   filepath += shared_dir_constants<CharT>::dir_separator();
-   filepath += filename;
-}
-
-template<class CharT>
-inline void create_shared_dir_and_clean_old(std::basic_string<CharT> &shared_dir)
-{
-   #if defined(BOOST_INTERPROCESS_SHARED_DIR_PATH) || defined(BOOST_INTERPROCESS_SHARED_DIR_FUNC)
-      get_shared_dir(shared_dir);
-   #else
-      //First get the temp directory
-      std::basic_string<CharT> root_shared_dir;
-      get_shared_dir_root(root_shared_dir);
-
-      //If fails, check that it's because already exists
-      if(!open_or_create_shared_directory(root_shared_dir.c_str())){
-         error_info info(system_error_code());
-         throw interprocess_exception(info);
-      }
-
-      #if defined(BOOST_INTERPROCESS_HAS_KERNEL_BOOTTIME)
-         get_shared_dir(shared_dir);
-
-         //If fails, check that it's because already exists
-         if(!open_or_create_shared_directory(shared_dir.c_str())){
-            error_info info(system_error_code());
-            throw interprocess_exception(info);
-         }
-         //Now erase all old directories created in the previous boot sessions
-         std::basic_string<CharT> subdir = shared_dir;
-         subdir.erase(0, root_shared_dir.size()+1);
-         delete_subdirectories(root_shared_dir, subdir.c_str());
-      #else
-         shared_dir = root_shared_dir;
-      #endif
-   #endif
-}
-
-template<class CharT>
-inline void create_shared_dir_cleaning_old_and_get_filepath(const CharT *filename, std::basic_string<CharT> &shared_dir)
-{
-   create_shared_dir_and_clean_old(shared_dir);
-   shared_dir += shared_dir_constants<CharT>::dir_separator();
-   shared_dir += filename;
-}
-
-template<class CharT>
-inline void add_leading_slash(const CharT *name, std::basic_string<CharT> &new_name)
-{
-   if(name[0] != shared_dir_constants<CharT>::dir_separator()){
-      new_name = shared_dir_constants<CharT>::dir_separator();
-   }
-   new_name += name;
-}
-
-}  //namespace boost{
-}  //namespace interprocess {
-}  //namespace ipcdetail {
-
-#include <boost/interprocess/detail/config_end.hpp>
-
-#endif   //ifndef BOOST_INTERPROCESS_DETAIL_SHARED_DIR_HELPERS_HPP
diff --git a/src/boost/interprocess/detail/simple_swap.hpp b/src/boost/interprocess/detail/simple_swap.hpp
deleted file mode 100644
index 797a9970..00000000
--- a/src/boost/interprocess/detail/simple_swap.hpp
+++ /dev/null
@@ -1,29 +0,0 @@
-#ifndef BOOST_INTERPROCESS_DETAIL_SWAP_HPP
-#define BOOST_INTERPROCESS_DETAIL_SWAP_HPP
-//////////////////////////////////////////////////////////////////////////////
-//
-// (C) Copyright Ion Gaztanaga 2014-2015. Distributed under the Boost
-// 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/interprocess for documentation.
-//
-//////////////////////////////////////////////////////////////////////////////
-
-#ifndef BOOST_CONFIG_HPP
-#  include <boost/config.hpp>
-#endif
-#
-#if defined(BOOST_HAS_PRAGMA_ONCE)
-#  pragma once
-#endif
-
-namespace boost { namespace interprocess {
-
-template<class T>
-void simple_swap(T&x, T&y)
-{  T tmp(x); x = y; y = tmp;  }
-
-}}  //namespace boost{ namespace interprocess {
-
-#endif //#ifndef BOOST_INTERPROCESS_DETAIL_SWAP_HPP
diff --git a/src/boost/interprocess/detail/std_fwd.hpp b/src/boost/interprocess/detail/std_fwd.hpp
deleted file mode 100644
index 282771c3..00000000
--- a/src/boost/interprocess/detail/std_fwd.hpp
+++ /dev/null
@@ -1,57 +0,0 @@
-//////////////////////////////////////////////////////////////////////////////
-//
-// (C) Copyright Ion Gaztanaga 2014-2015. Distributed under the Boost
-// 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/interprocess for documentation.
-//
-//////////////////////////////////////////////////////////////////////////////
-#ifndef BOOST_INTERPROCESS_DETAIL_STD_FWD_HPP
-#define BOOST_INTERPROCESS_DETAIL_STD_FWD_HPP
-
-#ifndef BOOST_CONFIG_HPP
-#  include <boost/config.hpp>
-#endif
-#
-#if defined(BOOST_HAS_PRAGMA_ONCE)
-#  pragma once
-#endif
-
-//////////////////////////////////////////////////////////////////////////////
-//                        Standard predeclarations
-//////////////////////////////////////////////////////////////////////////////
-
-#include <boost/move/detail/std_ns_begin.hpp>
-BOOST_MOVE_STD_NS_BEG
-
-struct input_iterator_tag;
-struct forward_iterator_tag;
-struct bidirectional_iterator_tag;
-struct random_access_iterator_tag;
-
-template<class T>
-struct char_traits;
-
-#if defined(BOOST_MSVC) && (BOOST_MSVC >= 1800) &&defined(BOOST_DINKUMWARE_STDLIB)
-#define BOOST_INTERPROCESS_STD_FWD_MSVC_IOS_BUG
-// Compiler bug workaround. Previous versions (<= VC11)
-// used dummy virtual functions
-#  pragma vtordisp(push, 2)
-#endif
-
-template<class CharT, class Traits>
-class basic_ostream;
-
-template<class CharT, class Traits>
-class basic_istream;
-
-#ifdef BOOST_INTERPROCESS_STD_FWD_MSVC_IOS_BUG
-#  pragma vtordisp(pop)
-#  undef BOOST_INTERPROCESS_STD_FWD_MSVC_IOS_BUG
-#endif
-
-BOOST_MOVE_STD_NS_END
-#include <boost/move/detail/std_ns_end.hpp>
-
-#endif //#ifndef BOOST_INTERPROCESS_DETAIL_STD_FWD_HPP
diff --git a/src/boost/interprocess/detail/timed_utils.hpp b/src/boost/interprocess/detail/timed_utils.hpp
deleted file mode 100644
index 89fbccd0..00000000
--- a/src/boost/interprocess/detail/timed_utils.hpp
+++ /dev/null
@@ -1,388 +0,0 @@
-//////////////////////////////////////////////////////////////////////////////
-//
-// (C) Copyright Ion Gaztanaga 2021-2021.
-//
-// Distributed under the Boost 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/interprocess for documentation.
-//
-//////////////////////////////////////////////////////////////////////////////
-
-#ifndef BOOST_INTERPROCESS_DETAIL_TIMED_UTILS_HPP
-#define BOOST_INTERPROCESS_DETAIL_TIMED_UTILS_HPP
-
-#ifndef BOOST_CONFIG_HPP
-#  include <boost/config.hpp>
-#endif
-#
-#if defined(BOOST_HAS_PRAGMA_ONCE)
-#  pragma once
-#endif
-
-#include <boost/interprocess/detail/config_begin.hpp>
-#include <boost/interprocess/detail/workaround.hpp>
-#include <boost/interprocess/detail/mpl.hpp>
-#include <boost/interprocess/detail/type_traits.hpp>
-#include <boost/intrusive/detail/mpl.hpp>
-
-#include <ctime>
-#include <boost/cstdint.hpp>
-
-//The following is used to support high precision time clocks
-#ifdef BOOST_HAS_GETTIMEOFDAY
-#include <sys/time.h>
-#endif
-
-#ifdef BOOST_HAS_FTIME
-#include <time.h>
-#include <boost/winapi/time.hpp>
-#endif
-
-namespace boost {
-namespace interprocess {
-namespace ipcdetail {
-
-BOOST_INTRUSIVE_INSTANTIATE_DEFAULT_TYPE_TMPLT(time_duration_type)
-BOOST_INTRUSIVE_INSTANTIATE_DEFAULT_TYPE_TMPLT(clock)
-BOOST_INTRUSIVE_INSTANTIATE_DEFAULT_TYPE_TMPLT(rep_type)
-BOOST_INTRUSIVE_INSTANTIATE_DEFAULT_TYPE_TMPLT(rep)
-
-template<class T>
-struct enable_if_ptime
-   : enable_if_c< BOOST_INTRUSIVE_HAS_TYPE(boost::interprocess::ipcdetail::, T, time_duration_type) >
-{};
-
-template<class T>
-struct disable_if_ptime
-   : enable_if_c< ! BOOST_INTRUSIVE_HAS_TYPE(boost::interprocess::ipcdetail::, T, time_duration_type) >
-{};
-
-template<class T>
-struct enable_if_ptime_duration
-   : enable_if_c< BOOST_INTRUSIVE_HAS_TYPE(boost::interprocess::ipcdetail::, T, rep_type) >
-{};
-
-template<class T>
-struct enable_if_time_point
-   : enable_if_c< BOOST_INTRUSIVE_HAS_TYPE(boost::interprocess::ipcdetail::, T, clock) >
-{};
-
-template<class T>
-struct enable_if_duration
-   : enable_if_c< BOOST_INTRUSIVE_HAS_TYPE(boost::interprocess::ipcdetail::, T, rep) >
-{};
-
-#if defined(BOOST_INTERPROCESS_HAS_REENTRANT_STD_FUNCTIONS)
-
-   inline std::tm* interprocess_gmtime(const std::time_t* t, std::tm* result)
-   {
-      // gmtime_r() not in namespace std???
-      #if defined(__VMS) && __INITIAL_POINTER_SIZE == 64
-         std::tm tmp;
-         if(!gmtime_r(t,&tmp))
-            result = 0;
-         else
-            *result = tmp;
-      #else
-         result = gmtime_r(t, result);
-      #endif
-      return result;
-   }
-
-#else // BOOST_DATE_TIME_HAS_REENTRANT_STD_FUNCTIONS
-
-   #if defined(__clang__) // Clang has to be checked before MSVC
-   #  pragma clang diagnostic push
-   #  pragma clang diagnostic ignored "-Wdeprecated-declarations"
-   #elif (defined(_MSC_VER) && (_MSC_VER >= 1400))
-   #  pragma warning(push) // preserve warning settings
-   #  pragma warning(disable : 4996) // disable depricated localtime/gmtime warning on vc8
-   #endif
-
-   inline std::tm* interprocess_gmtime(const std::time_t* t, std::tm* result)
-   {
-      result = std::gmtime(t);
-      return result;
-   }
-
-   #if defined(__clang__) // Clang has to be checked before MSVC
-   #  pragma clang diagnostic pop
-   #elif (defined(_MSC_VER) && (_MSC_VER >= 1400))
-   #  pragma warning(pop) // restore warnings to previous state
-   #endif
-
-#endif // BOOST_DATE_TIME_HAS_REENTRANT_STD_FUNCTIONS
-
-#if defined(BOOST_HAS_FTIME)
-/*!
-* The function converts file_time into number of microseconds elapsed since 1970-Jan-01
-*
-* \note Only dates after 1970-Jan-01 are supported. Dates before will be wrapped.
-*/
-inline boost::uint64_t file_time_to_microseconds(const boost::winapi::FILETIME_ & ft)
-{
-   // shift is difference between 1970-Jan-01 & 1601-Jan-01
-   // in 100-nanosecond units
-   const boost::uint64_t shift = 116444736000000000ULL; // (27111902 << 32) + 3577643008
-
-   // 100-nanos since 1601-Jan-01
-   boost::uint64_t ft_as_integer = (static_cast< boost::uint64_t >(ft.dwHighDateTime) << 32) | static_cast< boost::uint64_t >(ft.dwLowDateTime);
-
-   ft_as_integer -= shift; // filetime is now 100-nanos since 1970-Jan-01
-   return (ft_as_integer / 10U); // truncate to microseconds
-}
-#endif
-
-class ustime;
-
-class usduration
-{
-   public:
-   friend class ustime;
-
-   explicit usduration(boost::uint64_t microsecs)
-      : m_microsecs(microsecs)
-   {}
-
-   boost::uint64_t get_microsecs() const
-   {  return m_microsecs;  }
-
-   bool operator < (const usduration &other) const
-   {  return m_microsecs < other.m_microsecs; }
-
-   bool operator > (const usduration &other) const
-   {  return m_microsecs > other.m_microsecs; }
-
-   bool operator <= (const usduration &other) const
-   {  return m_microsecs <= other.m_microsecs; }
-
-   bool operator >= (const usduration &other) const
-   {  return m_microsecs >= other.m_microsecs; }
-
-   private:
-   boost::uint64_t m_microsecs;
-};
-
-class ustime
-{
-   public:
-   explicit ustime(boost::uint64_t microsecs)
-      : m_microsecs(microsecs)
-   {}
-
-   ustime &operator += (const usduration &other)
-   {  m_microsecs += other.m_microsecs; return *this; }
-
-   ustime operator + (const usduration &other)
-   {  ustime r(*this); r += other; return r; }
-
-   ustime &operator -= (const usduration &other)
-   {  m_microsecs -= other.m_microsecs; return *this; }
-
-   ustime operator - (const usduration &other)
-   {  ustime r(*this); r -= other; return r; }
-
-   friend usduration operator - (const ustime &l, const ustime &r)
-   {  return usduration(l.m_microsecs - r.m_microsecs); }
-
-   bool operator < (const ustime &other) const
-   {  return m_microsecs < other.m_microsecs; }
-
-   bool operator > (const ustime &other) const
-   {  return m_microsecs > other.m_microsecs; }
-
-   bool operator <= (const ustime &other) const
-   {  return m_microsecs <= other.m_microsecs; }
-
-   bool operator >= (const ustime &other) const
-   {  return m_microsecs >= other.m_microsecs; }
-
-   boost::uint64_t get_microsecs() const
-   {  return m_microsecs;  }
-
-   private:
-   boost::uint64_t m_microsecs;
-};
-
-inline usduration usduration_milliseconds(boost::uint64_t millisec)
-{  return usduration(millisec*1000u);   }
-
-inline usduration usduration_seconds(boost::uint64_t sec)
-{  return usduration(sec*uint64_t(1000000u));   }
-
-template<class TimeType, class Enable = void>
-class microsec_clock;
-
-template<class TimeType>
-class microsec_clock<TimeType, typename enable_if_ptime<TimeType>::type>
-{
-   private:
-   typedef typename TimeType::date_type date_type;
-   typedef typename TimeType::time_duration_type time_duration_type;
-   typedef typename time_duration_type::rep_type resolution_traits_type;
-   public:
-
-   static TimeType universal_time()
-   {
-      #ifdef BOOST_HAS_GETTIMEOFDAY
-         timeval tv;
-         gettimeofday(&tv, 0); //gettimeofday does not support TZ adjust on Linux.
-         std::time_t t = tv.tv_sec;
-         boost::uint32_t sub_sec = static_cast<boost::uint32_t>(tv.tv_usec);
-      #elif defined(BOOST_HAS_FTIME)
-         boost::winapi::FILETIME_ ft;
-         boost::winapi::GetSystemTimeAsFileTime(&ft);
-         boost::uint64_t micros = file_time_to_microseconds(ft); // it will not wrap, since ft is the current time
-                                                                  // and cannot be before 1970-Jan-01
-         std::time_t t = static_cast<std::time_t>(micros / 1000000UL); // seconds since epoch
-         // microseconds -- static casts suppress warnings
-         boost::uint32_t sub_sec = static_cast<boost::uint32_t>(micros % 1000000UL);
-      #else
-         #error "Unsupported date-time error: neither gettimeofday nor FILETIME support is detected"
-      #endif
-
-      std::tm curr;
-      std::tm* curr_ptr = interprocess_gmtime(&t, &curr);
-      date_type d(static_cast< typename date_type::year_type::value_type >(curr_ptr->tm_year + 1900),
-                  static_cast< typename date_type::month_type::value_type >(curr_ptr->tm_mon + 1),
-                  static_cast< typename date_type::day_type::value_type >(curr_ptr->tm_mday));
-
-      //The following line will adjust the fractional second tick in terms
-      //of the current time system.  For example, if the time system
-      //doesn't support fractional seconds then res_adjust returns 0
-      //and all the fractional seconds return 0.
-      unsigned adjust = static_cast< unsigned >(resolution_traits_type::res_adjust() / 1000000);
-
-      time_duration_type td(static_cast< typename time_duration_type::hour_type >(curr_ptr->tm_hour),
-                              static_cast< typename time_duration_type::min_type >(curr_ptr->tm_min),
-                              static_cast< typename time_duration_type::sec_type >(curr_ptr->tm_sec),
-                              static_cast< typename time_duration_type::fractional_seconds_type >(sub_sec * adjust)
-                           );
-      return TimeType(d,td);
-   }
-};
-
-template<>
-class microsec_clock<ustime>
-{
-   public:
-   static ustime universal_time()
-   {
-      #ifdef BOOST_HAS_GETTIMEOFDAY
-         timeval tv;
-         gettimeofday(&tv, 0); //gettimeofday does not support TZ adjust on Linux.
-         boost::uint64_t micros = boost::uint64_t(tv.tv_sec)*1000000;
-         micros += (boost::uint64_t)tv.tv_usec;
-      #elif defined(BOOST_HAS_FTIME)
-         boost::winapi::FILETIME_ ft;
-         boost::winapi::GetSystemTimeAsFileTime(&ft);
-         boost::uint64_t micros = file_time_to_microseconds(ft); // it will not wrap, since ft is the current time
-                                                                  // and cannot be before 1970-Jan-01
-      #else
-         #error "Unsupported date-time error: neither gettimeofday nor FILETIME support is detected"
-      #endif
-      return ustime(micros);
-   }
-};
-
-template<class TimePoint>
-class microsec_clock<TimePoint, typename enable_if_time_point<TimePoint>::type>
-{
-   public:
-   static TimePoint universal_time()
-   {  return TimePoint::clock::now();  }
-};
-
-
-template<class TimePoint>
-inline TimePoint delay_ms(unsigned msecs, typename enable_if_ptime<TimePoint>::type* = 0)
-{
-   typedef typename TimePoint::time_duration_type time_duration_type;
-   typedef typename time_duration_type::rep_type resolution_traits_type;
-
-   time_duration_type td(msecs*1000*resolution_traits_type::res_adjust());
-
-   TimePoint tp(microsec_clock<TimePoint>::universal_time());
-   return (tp += td);
-}
-
-template<class TimePoint>
-inline bool is_pos_infinity(const TimePoint &abs_time, typename enable_if_ptime<TimePoint>::type* = 0)
-{
-   return abs_time.is_pos_infinity();
-}
-
-template<class TimePoint>
-inline bool is_pos_infinity(const TimePoint &, typename disable_if_ptime<TimePoint>::type* = 0)
-{
-   return false;
-}
-
-/*
-template<class Duration>
-inline ustime duration_to_timepoint(const Duration &dur, typename enable_if_ptime<Duration>::type* = 0)
-{
-   return dur.is_pos_infinity();
-}
-
-template<class Duration>
-inline bool duration_to_timepoint(const Duration &, typename disable_if_ptime<Duration>::type* = 0)
-{
-   return false;
-}
-*/
-
-// duration_to_milliseconds
-
-template<class Duration>
-inline boost::uint64_t duration_to_milliseconds(const Duration &abs_time, typename enable_if_ptime_duration<Duration>::type* = 0)
-{
-   return static_cast<boost::uint64_t>(abs_time.total_milliseconds());
-}
-
-template<class Duration>
-inline boost::uint64_t duration_to_milliseconds(const Duration &d, typename enable_if_duration<Duration>::type* = 0)
-{
-   const double factor = double(Duration::period::num)*1000.0/double(Duration::period::den);
-   return static_cast<boost::uint64_t>(double(d.count())*factor);
-}
-
-inline boost::uint64_t duration_to_milliseconds(const usduration &d)
-{
-   return d.get_microsecs()/1000;
-}
-
-// duration_to_usduration
-
-template<class Duration>
-inline usduration duration_to_usduration(const Duration &d, typename enable_if_ptime_duration<Duration>::type* = 0)
-{
-   return usduration(static_cast<boost::uint64_t>(d.total_microseconds()));
-}
-
-template<class Duration>
-inline usduration duration_to_usduration(const Duration &d, typename enable_if_duration<Duration>::type* = 0)
-{
-   const double factor = double(Duration::period::num)*1000000.0/double(Duration::period::den);
-   return usduration(static_cast<boost::uint64_t>(double(d.count())*factor));
-}
-
-// duration_to_ustime
-
-template<class Duration>
-inline ustime duration_to_ustime(const Duration &d)
-{
-   return microsec_clock<ustime>::universal_time() + (duration_to_usduration)(d);
-}
-
-
-}  //namespace ipcdetail {
-}  //namespace interprocess {
-}  //namespace boost {
-
-#include <boost/interprocess/detail/config_end.hpp>
-
-#endif   //#ifndef BOOST_INTERPROCESS_DETAIL_TIMED_UTILS_HPP
-
diff --git a/src/boost/interprocess/detail/transform_iterator.hpp b/src/boost/interprocess/detail/transform_iterator.hpp
deleted file mode 100644
index d409b523..00000000
--- a/src/boost/interprocess/detail/transform_iterator.hpp
+++ /dev/null
@@ -1,44 +0,0 @@
-//////////////////////////////////////////////////////////////////////////////
-//
-// (C) Copyright Ion Gaztanaga 2005-2015.
-// (C) Copyright Gennaro Prota 2003 - 2004.
-//
-// Distributed under the Boost 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/interprocess for documentation.
-//
-//////////////////////////////////////////////////////////////////////////////
-
-#ifndef BOOST_INTERPROCESS_DETAIL_TRANSFORM_ITERATORS_HPP
-#define BOOST_INTERPROCESS_DETAIL_TRANSFORM_ITERATORS_HPP
-
-#ifndef BOOST_CONFIG_HPP
-#  include <boost/config.hpp>
-#endif
-#
-#if defined(BOOST_HAS_PRAGMA_ONCE)
-#  pragma once
-#endif
-
-#include <boost/interprocess/detail/config_begin.hpp>
-#include <boost/interprocess/detail/workaround.hpp>
-
-// interprocess
-#include <boost/interprocess/interprocess_fwd.hpp>
-// container/detail
-#include <boost/container/detail/transform_iterator.hpp>
-
-namespace boost {
-namespace interprocess {
-
-using boost::container::make_transform_iterator;
-using boost::container::transform_iterator;
-
-}  //namespace interprocess {
-}  //namespace boost {
-
-#include <boost/interprocess/detail/config_end.hpp>
-
-#endif   //#ifndef BOOST_INTERPROCESS_DETAIL_TRANSFORM_ITERATORS_HPP
diff --git a/src/boost/interprocess/detail/type_traits.hpp b/src/boost/interprocess/detail/type_traits.hpp
deleted file mode 100644
index 5765c888..00000000
--- a/src/boost/interprocess/detail/type_traits.hpp
+++ /dev/null
@@ -1,162 +0,0 @@
-//////////////////////////////////////////////////////////////////////////////
-// (C) Copyright John Maddock 2000.
-// (C) Copyright Ion Gaztanaga 2005-2012.
-//
-// Distributed under the Boost 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/interprocess for documentation.
-//
-//////////////////////////////////////////////////////////////////////////////
-
-#ifndef BOOST_INTERPROCESS_DETAIL_TYPE_TRAITS_HPP
-#define BOOST_INTERPROCESS_DETAIL_TYPE_TRAITS_HPP
-
-#ifndef BOOST_CONFIG_HPP
-#  include <boost/config.hpp>
-#endif
-#
-#if defined(BOOST_HAS_PRAGMA_ONCE)
-#  pragma once
-#endif
-
-#include <boost/interprocess/detail/config_begin.hpp>
-
-namespace boost {
-namespace interprocess {
-namespace ipcdetail {
-
-struct nat{};
-
-template<class T>
-struct remove_reference
-{
-   typedef T type;
-};
-
-template<class T>
-struct remove_reference<T&>
-{
-   typedef T type;
-};
-
-template<class T>
-struct is_reference
-{
-   static const bool value = false;
-};
-
-template<class T>
-struct is_reference<T&>
-{
-   static const bool value = true;
-};
-
-template<class T>
-struct is_pointer
-{
-   static const bool value = false;
-};
-
-template<class T>
-struct is_pointer<T*>
-{
-   static const bool value = true;
-};
-
-template <typename T>
-struct add_reference
-{
-    typedef T& type;
-};
-
-template<class T>
-struct add_reference<T&>
-{
-    typedef T& type;
-};
-
-template<>
-struct add_reference<void>
-{
-    typedef nat &type;
-};
-
-template<>
-struct add_reference<const void>
-{
-    typedef const nat &type;
-};
-
-template <class T>
-struct add_const_reference
-{  typedef const T &type;   };
-
-template <class T>
-struct add_const_reference<T&>
-{  typedef T& type;   };
-
-template<class T>
-struct remove_const
-{
-   typedef T type;
-};
-
-template<class T>
-struct remove_const<const T>
-{
-   typedef T type;
-};
-
-template<class T>
-struct remove_volatile
-{
-   typedef T type;
-};
-
-template<class T>
-struct remove_volatile<volatile T>
-{
-   typedef T type;
-};
-
-template<class T>
-struct remove_const_volatile
-{
-   typedef typename remove_const<typename remove_volatile<T>::type>::type type;
-};
-
-template <typename T, typename U>
-struct is_same
-{
-   typedef char yes_type;
-   struct no_type
-   {
-      char padding[8];
-   };
-
-   template <typename V>
-   static yes_type is_same_tester(V*, V*);
-   static no_type is_same_tester(...);
-
-   static T *t;
-   static U *u;
-
-   static const bool value = sizeof(yes_type) == sizeof(is_same_tester(t,u));
-};
-
-template<class T, class U>
-struct is_cv_same
-{
-   static const bool value = is_same< typename remove_const_volatile<T>::type
-                                    , typename remove_const_volatile<U>::type >::value;
-};
-
-} // namespace ipcdetail
-}  //namespace interprocess {
-}  //namespace boost {
-
-#include <boost/interprocess/detail/config_end.hpp>
-
-#endif   //#ifndef BOOST_INTERPROCESS_DETAIL_TYPE_TRAITS_HPP
diff --git a/src/boost/interprocess/detail/utilities.hpp b/src/boost/interprocess/detail/utilities.hpp
deleted file mode 100644
index 247dff1e..00000000
--- a/src/boost/interprocess/detail/utilities.hpp
+++ /dev/null
@@ -1,213 +0,0 @@
-//////////////////////////////////////////////////////////////////////////////
-//
-// (C) Copyright Ion Gaztanaga 2005-2015.
-// (C) Copyright Gennaro Prota 2003 - 2004.
-//
-// Distributed under the Boost 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/interprocess for documentation.
-//
-//////////////////////////////////////////////////////////////////////////////
-
-#ifndef BOOST_INTERPROCESS_DETAIL_UTILITIES_HPP
-#define BOOST_INTERPROCESS_DETAIL_UTILITIES_HPP
-
-#ifndef BOOST_CONFIG_HPP
-#  include <boost/config.hpp>
-#endif
-#
-#if defined(BOOST_HAS_PRAGMA_ONCE)
-#  pragma once
-#endif
-
-#include <boost/interprocess/detail/config_begin.hpp>
-#include <boost/interprocess/detail/workaround.hpp>
-
-#include <boost/interprocess/interprocess_fwd.hpp>
-#include <boost/move/utility_core.hpp>
-#include <boost/interprocess/detail/min_max.hpp>
-#include <boost/interprocess/detail/type_traits.hpp>
-#include <boost/interprocess/detail/mpl.hpp>
-#include <boost/intrusive/pointer_traits.hpp>
-#include <boost/move/utility_core.hpp>
-#include <boost/static_assert.hpp>
-#include <boost/cstdint.hpp>
-#include <climits>
-
-namespace boost {
-namespace interprocess {
-namespace ipcdetail {
-
-template <class T>
-inline T* to_raw_pointer(T* p)
-{  return p; }
-
-template <class Pointer>
-inline typename boost::intrusive::pointer_traits<Pointer>::element_type*
-to_raw_pointer(const Pointer &p)
-{  return boost::interprocess::ipcdetail::to_raw_pointer(p.operator->());  }
-
-//Rounds "orig_size" by excess to round_to bytes
-template<class SizeType>
-inline SizeType get_rounded_size(SizeType orig_size, SizeType round_to)
-{
-   return ((orig_size-1)/round_to+1)*round_to;
-}
-
-//Truncates "orig_size" to a multiple of "multiple" bytes.
-template<class SizeType>
-inline SizeType get_truncated_size(SizeType orig_size, SizeType multiple)
-{
-   return orig_size/multiple*multiple;
-}
-
-//Rounds "orig_size" by excess to round_to bytes. round_to must be power of two
-template<class SizeType>
-inline SizeType get_rounded_size_po2(SizeType orig_size, SizeType round_to)
-{
-   return ((orig_size-1)&(~(round_to-1))) + round_to;
-}
-
-//Truncates "orig_size" to a multiple of "multiple" bytes. multiple must be power of two
-template<class SizeType>
-inline SizeType get_truncated_size_po2(SizeType orig_size, SizeType multiple)
-{
-   return (orig_size & (~(multiple-1)));
-}
-
-template <std::size_t OrigSize, std::size_t RoundTo>
-struct ct_rounded_size
-{
-   BOOST_STATIC_ASSERT((RoundTo != 0));
-   static const std::size_t intermediate_value = (OrigSize-1)/RoundTo+1;
-   BOOST_STATIC_ASSERT(intermediate_value <= std::size_t(-1)/RoundTo);
-   static const std::size_t value = intermediate_value*RoundTo;
-};
-
-// Gennaro Prota wrote this. Thanks!
-template <std::size_t p, std::size_t n = 4>
-struct ct_max_pow2_less
-{
-   static const std::size_t c = 2*n < p;
-
-   static const std::size_t value =
-         c ? (ct_max_pow2_less< c*p, 2*c*n>::value) : n;
-};
-
-template <>
-struct ct_max_pow2_less<0, 0>
-{
-   static const std::size_t value = 0;
-};
-
-}  //namespace ipcdetail {
-
-//!Trait class to detect if an index is a node
-//!index. This allows more efficient operations
-//!when deallocating named objects.
-template <class Index>
-struct is_node_index
-{
-   static const bool value = false;
-};
-
-//!Trait class to detect if an index is an intrusive
-//!index. This will embed the derivation hook in each
-//!allocation header, to provide memory for the intrusive
-//!container.
-template <class Index>
-struct is_intrusive_index
-{
-   static const bool value = false;
-};
-
-template <typename T>
-BOOST_INTERPROCESS_FORCEINLINE T* addressof(T& v)
-{
-  return reinterpret_cast<T*>(
-       &const_cast<char&>(reinterpret_cast<const volatile char &>(v)));
-}
-
-template<class SizeType>
-struct sqrt_size_type_max
-{
-   static const SizeType value = (SizeType(1) << (sizeof(SizeType)*(CHAR_BIT/2)))-1;
-};
-
-template<class SizeType>
-inline bool multiplication_overflows(SizeType a, SizeType b)
-{
-   const SizeType sqrt_size_max = sqrt_size_type_max<SizeType>::value;
-   return   //Fast runtime check
-         (  (a | b) > sqrt_size_max &&
-            //Slow division check
-            b && a > SizeType(-1)/b
-         );
-}
-
-template<std::size_t SztSizeOfType, class SizeType>
-BOOST_INTERPROCESS_FORCEINLINE bool size_overflows(SizeType count)
-{
-   //Compile time-check
-   BOOST_STATIC_ASSERT(SztSizeOfType <= SizeType(-1));
-   //Runtime check
-   return multiplication_overflows(SizeType(SztSizeOfType), count);
-}
-
-template<class RawPointer, class OffsetType>
-class pointer_offset_caster;
-
-template<class T, class OffsetType>
-class pointer_offset_caster<T*, OffsetType>
-{
-   public:
-   BOOST_INTERPROCESS_FORCEINLINE explicit pointer_offset_caster(OffsetType off)
-      : m_offset(off)
-   {}
-
-   BOOST_INTERPROCESS_FORCEINLINE explicit pointer_offset_caster(const volatile T *p)
-      : m_offset(reinterpret_cast<OffsetType>(p))
-   {}
-
-   BOOST_INTERPROCESS_FORCEINLINE OffsetType offset() const
-   {   return m_offset;   }
-
-   BOOST_INTERPROCESS_FORCEINLINE T* pointer() const
-   {   return reinterpret_cast<T*>(m_offset);   }
-
-   private:
-   OffsetType m_offset;
-};
-
-
-template<class SizeType>
-inline bool sum_overflows(SizeType a, SizeType b)
-{  return SizeType(-1) - a < b;  }
-
-//Anti-exception node eraser
-template<class Cont>
-class value_eraser
-{
-   public:
-   value_eraser(Cont & cont, typename Cont::iterator it)
-      : m_cont(cont), m_index_it(it), m_erase(true){}
-   ~value_eraser()
-   {  if(m_erase) m_cont.erase(m_index_it);  }
-
-   BOOST_INTERPROCESS_FORCEINLINE void release() {  m_erase = false;  }
-
-   private:
-   Cont                   &m_cont;
-   typename Cont::iterator m_index_it;
-   bool                    m_erase;
-};
-
-}  //namespace interprocess {
-}  //namespace boost {
-
-#include <boost/interprocess/detail/config_end.hpp>
-
-#endif   //#ifndef BOOST_INTERPROCESS_DETAIL_UTILITIES_HPP
-
diff --git a/src/boost/interprocess/detail/variadic_templates_tools.hpp b/src/boost/interprocess/detail/variadic_templates_tools.hpp
deleted file mode 100644
index 936f702b..00000000
--- a/src/boost/interprocess/detail/variadic_templates_tools.hpp
+++ /dev/null
@@ -1,35 +0,0 @@
-//////////////////////////////////////////////////////////////////////////////
-//
-// (C) Copyright Ion Gaztanaga 2008-2012. Distributed under the Boost
-// 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/interprocess for documentation.
-//
-//////////////////////////////////////////////////////////////////////////////
-
-#ifndef BOOST_INTERPROCESS_DETAIL_VARIADIC_TEMPLATES_TOOLS_HPP
-#define BOOST_INTERPROCESS_DETAIL_VARIADIC_TEMPLATES_TOOLS_HPP
-
-#ifndef BOOST_CONFIG_HPP
-#  include <boost/config.hpp>
-#endif
-#
-#if defined(BOOST_HAS_PRAGMA_ONCE)
-#  pragma once
-#endif
-
-#include <boost/container/detail/variadic_templates_tools.hpp>
-
-namespace boost {
-namespace interprocess {
-namespace ipcdetail {
-
-using boost::container::dtl::tuple;
-using boost::container::dtl::build_number_seq;
-using boost::container::dtl::index_tuple;
-using boost::container::dtl::get;
-
-}}}   //namespace boost { namespace interprocess { namespace ipcdetail {
-
-#endif   //#ifndef BOOST_INTERPROCESS_DETAIL_VARIADIC_TEMPLATES_TOOLS_HPP
diff --git a/src/boost/interprocess/detail/win32_api.hpp b/src/boost/interprocess/detail/win32_api.hpp
deleted file mode 100644
index 3967b0b2..00000000
--- a/src/boost/interprocess/detail/win32_api.hpp
+++ /dev/null
@@ -1,1891 +0,0 @@
-//////////////////////////////////////////////////////////////////////////////
-//
-// (C) Copyright Ion Gaztanaga 2005-2015. Distributed under the Boost
-// 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/interprocess for documentation.
-//
-//////////////////////////////////////////////////////////////////////////////
-
-#ifndef BOOST_INTERPROCESS_WIN32_API_HPP
-#define BOOST_INTERPROCESS_WIN32_API_HPP
-
-#ifndef BOOST_CONFIG_HPP
-#  include <boost/config.hpp>
-#endif
-#
-#if defined(BOOST_HAS_PRAGMA_ONCE)
-#  pragma once
-#endif
-
-#include <boost/interprocess/detail/config_begin.hpp>
-#include <boost/interprocess/detail/workaround.hpp>
-#include <boost/cstdint.hpp>
-#include <cstddef>
-#include <cstring>
-#include <cstdlib>
-#include <cstdio>
-
-#include <boost/assert.hpp>
-#include <string>
-#include <vector>
-
-#ifdef BOOST_USE_WINDOWS_H
-#include <windows.h>
-#endif
-
-#if defined(_MSC_VER)
-#  pragma once
-#  pragma comment( lib, "Advapi32.lib" )
-#  pragma comment( lib, "oleaut32.lib" )
-#  pragma comment( lib, "Ole32.lib" )
-#endif
-
-#if defined (BOOST_INTERPROCESS_WINDOWS)
-#  include <cstdarg>
-#  include <boost/detail/interlocked.hpp>
-#else
-# error "This file can only be included in Windows OS"
-#endif
-
-//////////////////////////////////////////////////////////////////////////////
-//
-// Declaration of Windows structures or typedefs if BOOST_USE_WINDOWS_H is used
-//
-//////////////////////////////////////////////////////////////////////////////
-
-
-#if defined(BOOST_GCC)
-//Ignore -pedantic errors here (anonymous structs, etc.)
-#  if (BOOST_GCC >= 40600)
-#     pragma GCC diagnostic push
-#     if (BOOST_GCC >= 40800)
-#        pragma GCC diagnostic ignored "-Wpedantic"
-#     else
-#        pragma GCC diagnostic ignored "-pedantic"
-#     endif
-#     pragma GCC diagnostic ignored "-Wnon-virtual-dtor"
-#  else
-#     pragma GCC system_header
-#  endif
-//When loading DLLs we have no option but reinterpret casting function types  
-#  if (BOOST_GCC >= 80000)
-#        pragma GCC diagnostic ignored "-Wcast-function-type"
-#  endif
-#endif
-
-
-//#define BOOST_INTERPROCESS_BOOTSTAMP_IS_EVENTLOG_BASED
-//#define BOOST_INTERPROCESS_BOOTSTAMP_IS_SESSION_MANAGER_BASED
-
-#ifdef BOOST_INTERPROCESS_BOOTSTAMP_IS_EVENTLOG_BASED
-#  define BOOST_INTERPROCESS_BOOTSTAMP_IS_EVENTLOG_BASED_VALUE 1 
-#else
-#  define BOOST_INTERPROCESS_BOOTSTAMP_IS_EVENTLOG_BASED_VALUE 0
-#endif
-
-#ifdef BOOST_INTERPROCESS_BOOTSTAMP_IS_SESSION_MANAGER_BASED
-#  define BOOST_INTERPROCESS_BOOTSTAMP_IS_SESSION_MANAGER_BASED_VALUE 1 
-#else
-#  define BOOST_INTERPROCESS_BOOTSTAMP_IS_SESSION_MANAGER_BASED_VALUE 0
-#endif
-
-#define BOOST_INTERPROCESS_BOOTSTAMP_VALUE_SUM \
-   (BOOST_INTERPROCESS_BOOTSTAMP_IS_EVENTLOG_BASED_VALUE + \
-    BOOST_INTERPROCESS_BOOTSTAMP_IS_SESSION_MANAGER_BASED_VALUE)
-
-#if 1 < BOOST_INTERPROCESS_BOOTSTAMP_VALUE_SUM
-#  error "Only one of \
-          BOOST_INTERPROCESS_BOOTSTAMP_IS_SESSION_MANAGER_BASED and \
-          BOOST_INTERPROCESS_BOOTSTAMP_IS_EVENTLOG_BASED can be defined"
-#endif
-
-#if 0 == BOOST_INTERPROCESS_BOOTSTAMP_VALUE_SUM
-#  define BOOST_INTERPROCESS_BOOTSTAMP_IS_SESSION_MANAGER_BASED
-#endif
-
-
-namespace boost  {
-namespace interprocess  {
-namespace winapi {
-
-//Own defines
-static const unsigned long MaxPath           = 260;
-
-//////////////////////////////////////////////////////////////////////////////
-//
-// Nt native structures
-//
-//////////////////////////////////////////////////////////////////////////////
-
-struct interprocess_semaphore_basic_information
-{
-   unsigned long count;      // current semaphore count
-   unsigned long limit;      // max semaphore count
-};
-
-struct interprocess_section_basic_information
-{
-  void *          base_address;
-  unsigned long   section_attributes;
-  __int64         section_size;
-};
-
-struct file_rename_information_t {
-   int Replace;
-   void *RootDir;
-   unsigned long FileNameLength;
-   wchar_t FileName[1];
-};
-
-struct unicode_string_t {
-   unsigned short Length;
-   unsigned short MaximumLength;
-   wchar_t *Buffer;
-};
-
-struct object_attributes_t {
-   unsigned long Length;
-   void * RootDirectory;
-   unicode_string_t *ObjectName;
-   unsigned long Attributes;
-   void *SecurityDescriptor;
-   void *SecurityQualityOfService;
-};
-
-struct io_status_block_t {
-   union {
-      long Status;
-      void *Pointer;
-   };
-
-   unsigned long *Information;
-};
-
-union system_timeofday_information
-{
-   struct data_t
-   {
-      __int64 liKeBootTime;
-      __int64 liKeSystemTime;
-      __int64 liExpTimeZoneBias;
-      unsigned long uCurrentTimeZoneId;
-      unsigned long dwReserved;
-      ::boost::ulong_long_type ullBootTimeBias;
-      ::boost::ulong_long_type ullSleepTimeBias;
-   } data;
-   unsigned char Reserved1[sizeof(data_t)];
-};
-
-static const long BootstampLength            = sizeof(__int64);
-static const long BootAndSystemstampLength   = sizeof(__int64)*2;
-static const long SystemTimeOfDayInfoLength  = sizeof(system_timeofday_information::data_t);
-
-struct object_name_information_t
-{
-   unicode_string_t Name;
-   wchar_t NameBuffer[1];
-};
-
-enum file_information_class_t {
-   file_directory_information = 1,
-   file_full_directory_information,
-   file_both_directory_information,
-   file_basic_information,
-   file_standard_information,
-   file_internal_information,
-   file_ea_information,
-   file_access_information,
-   file_name_information,
-   file_rename_information,
-   file_link_information,
-   file_names_information,
-   file_disposition_information,
-   file_position_information,
-   file_full_ea_information,
-   file_mode_information,
-   file_alignment_information,
-   file_all_information,
-   file_allocation_information,
-   file_end_of_file_information,
-   file_alternate_name_information,
-   file_stream_information,
-   file_pipe_information,
-   file_pipe_local_information,
-   file_pipe_remote_information,
-   file_mailslot_query_information,
-   file_mailslot_set_information,
-   file_compression_information,
-   file_copy_on_write_information,
-   file_completion_information,
-   file_move_cluster_information,
-   file_quota_information,
-   file_reparse_point_information,
-   file_network_open_information,
-   file_object_id_information,
-   file_tracking_information,
-   file_ole_directory_information,
-   file_content_index_information,
-   file_inherit_content_index_information,
-   file_ole_information,
-   file_maximum_information
-};
-
-enum semaphore_information_class {
-   semaphore_basic_information = 0
-};
-
-
-enum system_information_class {
-   system_basic_information = 0,
-   system_performance_information = 2,
-   system_time_of_day_information = 3,
-   system_process_information = 5,
-   system_processor_performance_information = 8,
-   system_interrupt_information = 23,
-   system_exception_information = 33,
-   system_registry_quota_information = 37,
-   system_lookaside_information = 45
-};
-
-enum object_information_class
-{
-   object_basic_information,
-   object_name_information,
-   object_type_information,
-   object_all_information,
-   object_data_information
-};
-
-enum section_information_class
-{
-   section_basic_information,
-   section_image_information
-};
-
-}  //namespace winapi {
-}  //namespace interprocess  {
-}  //namespace boost  {
-
-
-//////////////////////////////////////////////////////////////////////////////
-//
-// Forward declaration of winapi
-//
-//////////////////////////////////////////////////////////////////////////////
-
-#include <boost/winapi/get_current_process_id.hpp>
-#include <boost/winapi/get_current_thread_id.hpp>
-#include <boost/winapi/get_current_process.hpp>
-#include <boost/winapi/get_process_times.hpp>
-#include <boost/winapi/error_codes.hpp>
-#include <boost/winapi/thread.hpp>
-#include <boost/winapi/system.hpp>
-#include <boost/winapi/time.hpp>
-#include <boost/winapi/timers.hpp>
-#include <boost/winapi/get_last_error.hpp>
-#include <boost/winapi/handles.hpp>
-#include <boost/winapi/file_management.hpp>
-#include <boost/winapi/mutex.hpp>
-#include <boost/winapi/wait.hpp>
-#include <boost/winapi/file_mapping.hpp>
-#include <boost/winapi/semaphore.hpp>
-#include <boost/winapi/system.hpp>
-#include <boost/winapi/error_handling.hpp>
-#include <boost/winapi/local_memory.hpp>
-#include <boost/winapi/directory_management.hpp>
-#include <boost/winapi/security.hpp>
-#include <boost/winapi/dll.hpp>
-#include <boost/winapi/basic_types.hpp>
-
-//This should go in winapi's basic_types.hpp 
-namespace boost {
-namespace ipwinapiext {
-typedef boost::winapi::LONG_ LSTATUS;
-
-typedef boost::winapi::DWORD_ (__stdcall *LPTHREAD_START_ROUTINE_)
-   (boost::winapi::LPVOID_ lpThreadParameter);
-
-
-//#ifndef BOOST_USE_WINDOWS_H
-//typedef boost::winapi::LARGE_INTEGER_ LARGE_INTEGER_EXT;
-//#else
-//typedef LARGE_INTEGER LARGE_INTEGER_EXT;
-//#endif
-
-}} //namespace boost::ipwinapiext
-
-#ifndef BOOST_USE_WINDOWS_H
-
-extern "C" {
-
-//Error handling
-BOOST_SYMBOL_IMPORT BOOST_WINAPI_DETAIL_VOID BOOST_WINAPI_WINAPI_CC SetLastError(boost::winapi::DWORD_ dwErrCode);
-
-//File management
-BOOST_SYMBOL_IMPORT boost::winapi::DWORD_ BOOST_WINAPI_WINAPI_CC GetFileType(boost::winapi::HANDLE_ hTemplateFile);
-BOOST_SYMBOL_IMPORT boost::winapi::BOOL_ BOOST_WINAPI_WINAPI_CC FlushFileBuffers(boost::winapi::HANDLE_ hFile);
-
-//threading
-
-BOOST_SYMBOL_IMPORT boost::winapi::HANDLE_ BOOST_WINAPI_WINAPI_CC CreateThread
-   ( ::_SECURITY_ATTRIBUTES* lpThreadAttributes
-   , boost::winapi::SIZE_T_ dwStackSize
-   , boost::ipwinapiext::LPTHREAD_START_ROUTINE_ lpStartAddress
-   , boost::winapi::LPVOID_ lpParameter
-   , boost::winapi::DWORD_ dwCreationFlags
-   , boost::winapi::LPDWORD_ lpThreadId
-   );
-
-//Virtual Memory
-BOOST_SYMBOL_IMPORT boost::winapi::BOOL_ BOOST_WINAPI_WINAPI_CC VirtualLock(boost::winapi::LPVOID_ lpAddress, boost::winapi::SIZE_T_ dwSize);
-BOOST_SYMBOL_IMPORT boost::winapi::BOOL_ BOOST_WINAPI_WINAPI_CC VirtualUnlock(boost::winapi::LPVOID_ lpAddress, boost::winapi::SIZE_T_ dwSize);
-BOOST_SYMBOL_IMPORT boost::winapi::BOOL_ BOOST_WINAPI_WINAPI_CC VirtualProtect( boost::winapi::LPVOID_ lpAddress, boost::winapi::SIZE_T_ dwSize
-                                                                              , boost::winapi::DWORD_ flNewProtect, boost::winapi::PDWORD_ lpflOldProtect);
-//registry.hpp
-BOOST_WINAPI_DETAIL_DECLARE_HANDLE(HKEY);
-
-
-BOOST_SYMBOL_IMPORT boost::ipwinapiext::LSTATUS BOOST_WINAPI_WINAPI_CC RegOpenKeyExA
-   (::HKEY hKey, const char *lpSubKey, boost::winapi::DWORD_ ulOptions, boost::winapi::DWORD_ samDesired, ::HKEY *phkResult);
-BOOST_SYMBOL_IMPORT boost::ipwinapiext::LSTATUS BOOST_WINAPI_WINAPI_CC RegOpenKeyExW
-   (::HKEY hKey, const wchar_t *lpSubKey, boost::winapi::DWORD_ ulOptions, boost::winapi::DWORD_ samDesired, ::HKEY *phkResult);
-BOOST_SYMBOL_IMPORT boost::ipwinapiext::LSTATUS BOOST_WINAPI_WINAPI_CC RegQueryValueExA
-   (::HKEY hKey, const char *lpValueName, boost::winapi::DWORD_ *lpReserved, boost::winapi::DWORD_ *lpType, boost::winapi::BYTE_ *lpData, boost::winapi::DWORD_ *lpcbData);
-BOOST_SYMBOL_IMPORT boost::ipwinapiext::LSTATUS BOOST_WINAPI_WINAPI_CC RegQueryValueExW
-   (::HKEY hKey, const wchar_t *lpValueName, boost::winapi::DWORD_ *lpReserved, boost::winapi::DWORD_ *lpType, boost::winapi::BYTE_ *lpData, boost::winapi::DWORD_ *lpcbData);
-BOOST_SYMBOL_IMPORT boost::ipwinapiext::LSTATUS BOOST_WINAPI_WINAPI_CC RegCloseKey(::HKEY hKey);
-
-
-//Event Log
-BOOST_SYMBOL_IMPORT boost::winapi::HANDLE_ BOOST_WINAPI_WINAPI_CC OpenEventLogA(const char* lpUNCServerName, const char* lpSourceName);
-BOOST_SYMBOL_IMPORT boost::winapi::HANDLE_ BOOST_WINAPI_WINAPI_CC OpenEventLogW(const wchar_t* lpUNCServerName, const wchar_t* lpSourceName);
-BOOST_SYMBOL_IMPORT boost::winapi::BOOL_   BOOST_WINAPI_WINAPI_CC CloseEventLog(boost::winapi::HANDLE_ hEventLog);
-BOOST_SYMBOL_IMPORT boost::winapi::BOOL_   BOOST_WINAPI_WINAPI_CC ReadEventLogA
-   ( boost::winapi::HANDLE_ hEventLog, boost::winapi::DWORD_ dwReadFlags, boost::winapi::DWORD_ dwRecordOffset, void* lpBuffer
-   , boost::winapi::DWORD_ nNumberOfBytesToRead, boost::winapi::DWORD_ *pnBytesRead, boost::winapi::DWORD_ *pnMinNumberOfBytesNeeded);
-BOOST_SYMBOL_IMPORT boost::winapi::BOOL_   BOOST_WINAPI_WINAPI_CC ReadEventLogW
-   ( boost::winapi::HANDLE_ hEventLog, boost::winapi::DWORD_ dwReadFlags, boost::winapi::DWORD_ dwRecordOffset, void* lpBuffer
-   , boost::winapi::DWORD_ nNumberOfBytesToRead, boost::winapi::DWORD_ *pnBytesRead, boost::winapi::DWORD_ *pnMinNumberOfBytesNeeded); 
-
-}  //extern "C" {
-
-#endif   //#ifndef BOOST_USE_WINDOWS_H
-
-namespace boost {
-namespace ipwinapiext {
-
-typedef ::HKEY HKEY_;
-
-#if BOOST_WINAPI_PARTITION_APP_SYSTEM
-
-//Threads
-BOOST_FORCEINLINE boost::winapi::HANDLE_ CreateThread
-   ( boost::winapi::SECURITY_ATTRIBUTES_* lpThreadAttributes
-   , boost::winapi::SIZE_T_ dwStackSize
-   , boost::ipwinapiext::LPTHREAD_START_ROUTINE_ lpStartAddress
-   , boost::winapi::LPVOID_ lpParameter
-   , boost::winapi::DWORD_ dwCreationFlags
-   , boost::winapi::LPDWORD_ lpThreadId
-)
-{
-   return ::CreateThread( reinterpret_cast< ::_SECURITY_ATTRIBUTES* >(lpThreadAttributes)
-                        , dwStackSize, lpStartAddress
-                        , lpParameter, dwCreationFlags, lpThreadId);
-}
-
-//Error handling
-BOOST_FORCEINLINE BOOST_WINAPI_DETAIL_VOID SetLastError(boost::winapi::DWORD_ dwErrCode)
-{  ::SetLastError(dwErrCode); }
-
-//File management
-BOOST_FORCEINLINE boost::winapi::DWORD_ GetFileType(boost::winapi::HANDLE_ hTemplateFile)
-{  return ::GetFileType(hTemplateFile);   }
-
-BOOST_FORCEINLINE boost::winapi::BOOL_ FlushFileBuffers(boost::winapi::HANDLE_ hFile)
-{  return ::FlushFileBuffers(hFile);   }
-
-//Virtual Memory
-BOOST_FORCEINLINE boost::winapi::BOOL_ VirtualLock(boost::winapi::LPVOID_ lpAddress, boost::winapi::SIZE_T_ dwSize)
-{  return ::VirtualLock(lpAddress, dwSize);  }
-
-BOOST_FORCEINLINE boost::winapi::BOOL_ VirtualUnlock(boost::winapi::LPVOID_ lpAddress, boost::winapi::SIZE_T_ dwSize)
-{  return ::VirtualUnlock(lpAddress, dwSize);   }
-
-BOOST_FORCEINLINE boost::winapi::BOOL_ VirtualProtect( boost::winapi::LPVOID_ lpAddress, boost::winapi::SIZE_T_ dwSize
-                                                     , boost::winapi::DWORD_ flNewProtect, boost::winapi::PDWORD_ lpflOldProtect)
-{  return ::VirtualProtect(lpAddress, dwSize, flNewProtect, lpflOldProtect);  }
-
-//registry.hpp
-BOOST_FORCEINLINE boost::ipwinapiext::LSTATUS RegOpenKeyExA
-   (boost::ipwinapiext::HKEY_ hKey, const char *lpSubKey, boost::winapi::DWORD_ ulOptions, boost::winapi::DWORD_ samDesired, boost::ipwinapiext::HKEY_ *phkResult)
-{
-   return ::RegOpenKeyExA(reinterpret_cast< ::HKEY >(hKey), lpSubKey, ulOptions, samDesired, reinterpret_cast< ::HKEY* >(phkResult));
-}
-
-BOOST_FORCEINLINE boost::ipwinapiext::LSTATUS RegOpenKeyExW
-   (boost::ipwinapiext::HKEY_ hKey, const wchar_t *lpSubKey, boost::winapi::DWORD_ ulOptions, boost::winapi::DWORD_ samDesired, boost::ipwinapiext::HKEY_ *phkResult)
-{
-   return ::RegOpenKeyExW(reinterpret_cast< ::HKEY >(hKey), lpSubKey, ulOptions, samDesired, reinterpret_cast< ::HKEY* >(phkResult));
-}
-
-BOOST_FORCEINLINE boost::ipwinapiext::LSTATUS RegQueryValueExA
-   (boost::ipwinapiext::HKEY_ hKey, const char *lpValueName, boost::winapi::DWORD_ *lpReserved, boost::winapi::DWORD_ *lpType, boost::winapi::BYTE_ *lpData, boost::winapi::DWORD_ *lpcbData)
-{
-   return ::RegQueryValueExA(reinterpret_cast< ::HKEY >(hKey), lpValueName, lpReserved, lpType, lpData, lpcbData);
-}
-
-BOOST_FORCEINLINE boost::ipwinapiext::LSTATUS RegQueryValueExW
-   (boost::ipwinapiext::HKEY_ hKey, const wchar_t *lpValueName, boost::winapi::DWORD_ *lpReserved, boost::winapi::DWORD_ *lpType, boost::winapi::BYTE_ *lpData, boost::winapi::DWORD_ *lpcbData)
-{
-   return ::RegQueryValueExW(reinterpret_cast< ::HKEY >(hKey), lpValueName, lpReserved, lpType, lpData, lpcbData);
-}
-
-BOOST_FORCEINLINE boost::ipwinapiext::LSTATUS RegCloseKey(boost::ipwinapiext::HKEY_ hKey)
-{
-   return ::RegCloseKey(reinterpret_cast< ::HKEY >(hKey));
-}
-
-BOOST_FORCEINLINE void GetSystemInfo(boost::winapi::LPSYSTEM_INFO_ lpSystemInfo)
-{  return ::GetSystemInfo(reinterpret_cast< ::_SYSTEM_INFO* >(lpSystemInfo));   }
-
-#endif   //BOOST_WINAPI_PARTITION_APP_SYSTEM
-
-}  //namespace ipwinapiext {
-}  //namespace boost {
-
-namespace boost  {
-namespace interprocess  {
-namespace winapi {
-
-typedef boost::winapi::SYSTEM_INFO_ interprocess_system_info;
-typedef boost::winapi::OVERLAPPED_ interprocess_overlapped;
-typedef boost::winapi::FILETIME_ interprocess_filetime;
-typedef boost::winapi::WIN32_FIND_DATAA_ win32_find_data_a;
-typedef boost::winapi::WIN32_FIND_DATAW_ win32_find_data_w;
-typedef boost::winapi::SECURITY_ATTRIBUTES_ interprocess_security_attributes;
-typedef boost::winapi::SECURITY_DESCRIPTOR_ interprocess_security_descriptor;
-typedef boost::winapi::BY_HANDLE_FILE_INFORMATION_ interprocess_by_handle_file_information;
-typedef boost::winapi::HMODULE_ hmodule;
-typedef boost::ipwinapiext::HKEY_ hkey;
-typedef boost::winapi::FARPROC_ farproc_t;
-
-//ntdll.dll
-typedef long (__stdcall *NtDeleteFile_t)(object_attributes_t *ObjectAttributes);
-typedef long (__stdcall *NtSetInformationFile_t)(void *FileHandle, io_status_block_t *IoStatusBlock, void *FileInformation, unsigned long Length, int FileInformationClass );
-typedef long (__stdcall *NtOpenFile)(void **FileHandle, unsigned long DesiredAccess, object_attributes_t *ObjectAttributes
-                                    , io_status_block_t *IoStatusBlock, unsigned long ShareAccess, unsigned long Length, unsigned long OpenOptions);
-typedef long (__stdcall *NtQuerySystemInformation_t)(int, void*, unsigned long, unsigned long *);
-typedef long (__stdcall *NtQueryObject_t)(void*, object_information_class, void *, unsigned long, unsigned long *);
-typedef long (__stdcall *NtQuerySemaphore_t)(void*, unsigned int info_class, interprocess_semaphore_basic_information *pinfo, unsigned int info_size, unsigned int *ret_len);
-typedef long (__stdcall *NtQuerySection_t)(void*, section_information_class, interprocess_section_basic_information *pinfo, unsigned long info_size, unsigned long *ret_len);
-typedef long (__stdcall *NtQueryInformationFile_t)(void *,io_status_block_t *,void *, long, int);
-typedef long (__stdcall *NtOpenFile_t)(void*,unsigned long ,object_attributes_t*,io_status_block_t*,unsigned long,unsigned long);
-typedef long (__stdcall *NtClose_t) (void*);
-typedef long (__stdcall *NtQueryTimerResolution_t) (unsigned long* LowestResolution, unsigned long* HighestResolution, unsigned long* CurrentResolution);
-typedef long (__stdcall *NtSetTimerResolution_t) (unsigned long RequestedResolution, int Set, unsigned long* ActualResolution);
-
-}  //namespace winapi {
-}  //namespace interprocess  {
-}  //namespace boost  {
-
-//////////////////////////////////////////////////////////////////////////////
-//
-// Forward declaration of constants
-//
-//////////////////////////////////////////////////////////////////////////////
-
-namespace boost {
-namespace interprocess {
-namespace winapi {
-
-//Some used constants
-static const unsigned long infinite_time        = 0xFFFFFFFF;
-static const unsigned long error_already_exists = 183L;
-static const unsigned long error_invalid_handle = 6L;
-static const unsigned long error_sharing_violation = 32L;
-static const unsigned long error_file_not_found = 2u;
-static const unsigned long error_no_more_files  = 18u;
-static const unsigned long error_not_locked     = 158L;
-//Retries in CreateFile, see http://support.microsoft.com/kb/316609
-static const unsigned long error_sharing_violation_tries = 3L;
-static const unsigned long error_sharing_violation_sleep_ms = 250L;
-static const unsigned long error_file_too_large = 223L;
-static const unsigned long error_insufficient_buffer = 122L;
-static const unsigned long error_handle_eof = 38L;
-static const unsigned long semaphore_all_access = (0x000F0000L)|(0x00100000L)|0x3;
-static const unsigned long mutex_all_access     = (0x000F0000L)|(0x00100000L)|0x0001;
-
-static const unsigned long page_readonly        = 0x02;
-static const unsigned long page_readwrite       = 0x04;
-static const unsigned long page_writecopy       = 0x08;
-static const unsigned long page_noaccess        = 0x01;
-
-static const unsigned long standard_rights_required   = 0x000F0000L;
-static const unsigned long section_query              = 0x0001;
-static const unsigned long section_map_write          = 0x0002;
-static const unsigned long section_map_read           = 0x0004;
-static const unsigned long section_map_execute        = 0x0008;
-static const unsigned long section_extend_size        = 0x0010;
-static const unsigned long section_all_access         = standard_rights_required |
-                                                        section_query            |
-                                                        section_map_write        |
-                                                        section_map_read         |
-                                                        section_map_execute      |
-                                                        section_extend_size;
-
-static const unsigned long file_map_copy        = section_query;
-static const unsigned long file_map_write       = section_map_write;
-static const unsigned long file_map_read        = section_map_read;
-static const unsigned long file_map_all_access  = section_all_access;
-static const unsigned long delete_access = 0x00010000L;
-static const unsigned long file_flag_backup_semantics = 0x02000000;
-static const long file_flag_delete_on_close = 0x04000000;
-
-//Native API constants
-static const unsigned long file_open_for_backup_intent = 0x00004000;
-static const int file_share_valid_flags = 0x00000007;
-static const long file_delete_on_close = 0x00001000L;
-static const long obj_case_insensitive = 0x00000040L;
-static const long delete_flag = 0x00010000L;
-
-static const unsigned long movefile_copy_allowed            = 0x02;
-static const unsigned long movefile_delay_until_reboot      = 0x04;
-static const unsigned long movefile_replace_existing        = 0x01;
-static const unsigned long movefile_write_through           = 0x08;
-static const unsigned long movefile_create_hardlink         = 0x10;
-static const unsigned long movefile_fail_if_not_trackable   = 0x20;
-
-static const unsigned long file_share_read      = 0x00000001;
-static const unsigned long file_share_write     = 0x00000002;
-static const unsigned long file_share_delete    = 0x00000004;
-
-static const unsigned long file_attribute_readonly    = 0x00000001;
-static const unsigned long file_attribute_hidden      = 0x00000002;
-static const unsigned long file_attribute_system      = 0x00000004;
-static const unsigned long file_attribute_directory   = 0x00000010;
-static const unsigned long file_attribute_archive     = 0x00000020;
-static const unsigned long file_attribute_device      = 0x00000040;
-static const unsigned long file_attribute_normal      = 0x00000080;
-static const unsigned long file_attribute_temporary   = 0x00000100;
-
-static const unsigned long generic_read         = 0x80000000L;
-static const unsigned long generic_write        = 0x40000000L;
-
-static const unsigned long wait_object_0        = 0;
-static const unsigned long wait_abandoned       = 0x00000080L;
-static const unsigned long wait_timeout         = 258L;
-static const unsigned long wait_failed          = (unsigned long)0xFFFFFFFF;
-
-static const unsigned long duplicate_close_source  = (unsigned long)0x00000001;
-static const unsigned long duplicate_same_access   = (unsigned long)0x00000002;
-
-static const unsigned long format_message_allocate_buffer
-   = (unsigned long)0x00000100;
-static const unsigned long format_message_ignore_inserts
-   = (unsigned long)0x00000200;
-static const unsigned long format_message_from_string
-   = (unsigned long)0x00000400;
-static const unsigned long format_message_from_hmodule
-   = (unsigned long)0x00000800;
-static const unsigned long format_message_from_system
-   = (unsigned long)0x00001000;
-static const unsigned long format_message_argument_array
-   = (unsigned long)0x00002000;
-static const unsigned long format_message_max_width_mask
-   = (unsigned long)0x000000FF;
-static const unsigned long lang_neutral         = (unsigned long)0x00;
-static const unsigned long sublang_default      = (unsigned long)0x01;
-static const unsigned long invalid_file_size    = (unsigned long)0xFFFFFFFF;
-static const unsigned long invalid_file_attributes =  ((unsigned long)-1);
-static       void * const  invalid_handle_value = ((void*)(long)(-1));
-
-static const unsigned long file_type_char    =  0x0002L;
-static const unsigned long file_type_disk    =  0x0001L;
-static const unsigned long file_type_pipe    =  0x0003L;
-static const unsigned long file_type_remote  =  0x8000L;
-static const unsigned long file_type_unknown =  0x0000L;
-
-static const unsigned long create_new        = 1;
-static const unsigned long create_always     = 2;
-static const unsigned long open_existing     = 3;
-static const unsigned long open_always       = 4;
-static const unsigned long truncate_existing = 5;
-
-static const unsigned long file_begin     = 0;
-static const unsigned long file_current   = 1;
-static const unsigned long file_end       = 2;
-
-static const unsigned long lockfile_fail_immediately  = 1;
-static const unsigned long lockfile_exclusive_lock    = 2;
-static const unsigned long error_lock_violation       = 33;
-static const unsigned long security_descriptor_revision = 1;
-
-const unsigned long max_record_buffer_size = 0x10000L;   // 64K
-const unsigned long max_path = 260;
-
-//Keys
-static const  hkey hkey_local_machine = (hkey)(unsigned long*)(long)(0x80000002);
-static unsigned long key_query_value    = 0x0001;
-
-// Registry types
-#define reg_none                       ( 0 )   // No value type
-#define reg_sz                         ( 1 )   // Unicode nul terminated string
-#define reg_expand_sz                  ( 2 )   // Unicode nul terminated string
-                                               // (with environment variable references)
-#define reg_binary                     ( 3 )   // Free form binary
-#define reg_dword                      ( 4 )   // 32-bit number
-#define reg_dword_little_endian        ( 4 )   // 32-bit number (same as REG_DWORD)
-#define reg_dword_big_endian           ( 5 )   // 32-bit number
-#define reg_link                       ( 6 )   // Symbolic Link (unicode)
-#define reg_multi_sz                   ( 7 )   // Multiple Unicode strings
-#define reg_resource_list              ( 8 )   // Resource list in the resource map
-#define reg_full_resource_descriptor   ( 9 )  // Resource list in the hardware description
-#define reg_resource_requirements_list ( 10 )
-#define reg_qword                      ( 11 )  // 64-bit number
-#define reg_qword_little_endian        ( 11 )  // 64-bit number (same as reg_qword)
-
-
-}  //namespace winapi {
-}  //namespace interprocess  {
-}  //namespace boost  {
-
-
-namespace boost {
-namespace interprocess {
-namespace winapi {
-
-inline unsigned long get_last_error()
-{  return GetLastError();  }
-
-inline void set_last_error(unsigned long err)
-{  return SetLastError(err);  }
-
-inline unsigned long format_message
-   (unsigned long dwFlags, const void *lpSource,
-    unsigned long dwMessageId, unsigned long dwLanguageId,
-    char *lpBuffer, unsigned long nSize, std::va_list *Arguments)
-{
-   return FormatMessageA
-      (dwFlags, lpSource, dwMessageId, dwLanguageId, lpBuffer, nSize, Arguments);
-}
-
-//And now, wrapper functions
-inline void * local_free(void *hmem)
-{  return LocalFree(hmem); }
-
-inline unsigned long make_lang_id(unsigned long p, unsigned long s)
-{  
-   const unsigned short s_us = (unsigned short)s;
-   const unsigned short p_us = (unsigned short)p;
-   return (unsigned long)((s_us << 10) | p_us);
-}
-
-inline void sched_yield()
-{
-   if(!SwitchToThread()){
-      Sleep(0);
-   }
-}
-
-inline void sleep_tick()
-{  Sleep(1);   }
-
-inline void sleep(unsigned long ms)
-{  Sleep(ms);  }
-
-inline unsigned long get_current_thread_id()
-{  return GetCurrentThreadId();  }
-
-inline bool get_process_times
-   ( void *hProcess, interprocess_filetime* lpCreationTime
-   , interprocess_filetime *lpExitTime, interprocess_filetime *lpKernelTime
-   , interprocess_filetime *lpUserTime )
-{  return 0 != GetProcessTimes(hProcess, lpCreationTime, lpExitTime, lpKernelTime, lpUserTime); }
-
-inline unsigned long get_current_process_id()
-{  return GetCurrentProcessId();  }
-
-inline bool close_handle(void* handle)
-{  return CloseHandle(handle) != 0;   }
-
-inline void * find_first_file(const char *lpFileName, win32_find_data_a *lpFindFileData)
-{  return FindFirstFileA(lpFileName, lpFindFileData);   }
-
-inline void * find_first_file(const wchar_t *lpFileName, win32_find_data_w *lpFindFileData)
-{  return FindFirstFileW(lpFileName, lpFindFileData);   }
-
-inline bool find_next_file(void *hFindFile, win32_find_data_a *lpFindFileData)
-{  return FindNextFileA(hFindFile, lpFindFileData) != 0;   }
-
-inline bool find_next_file(void *hFindFile, win32_find_data_w *lpFindFileData)
-{  return FindNextFileW(hFindFile, lpFindFileData) != 0;   }
-
-inline bool find_close(void *handle)
-{  return FindClose(handle) != 0;   }
-
-inline bool duplicate_current_process_handle
-   (void *hSourceHandle, void **lpTargetHandle)
-{
-   return 0 != DuplicateHandle
-      ( GetCurrentProcess(),  hSourceHandle,    GetCurrentProcess()
-      , lpTargetHandle,       0,                0
-      , duplicate_same_access);
-}
-
-inline unsigned long get_file_type(void *hFile)
-{
-   return GetFileType(hFile);
-}
-
-/*
-inline void get_system_time_as_file_time(interprocess_filetime *filetime)
-{  GetSystemTimeAsFileTime(filetime);  }
-
-inline bool file_time_to_local_file_time
-   (const interprocess_filetime *in, const interprocess_filetime *out)
-{  return 0 != FileTimeToLocalFileTime(in, out);  }
-*/
-inline void *open_or_create_mutex(const char *name, bool initial_owner, interprocess_security_attributes *attr)
-{  return CreateMutexA(attr, (int)initial_owner, name);  }
-
-inline void *open_or_create_mutex(const wchar_t *name, bool initial_owner, interprocess_security_attributes *attr)
-{  return CreateMutexW(attr, (int)initial_owner, name);  }
-
-inline unsigned long wait_for_single_object(void *handle, unsigned long time)
-{  return WaitForSingleObject(handle, time); }
-
-inline int release_mutex(void *handle)
-{  return ReleaseMutex(handle);  }
-
-inline int unmap_view_of_file(void *address)
-{  return UnmapViewOfFile(address); }
-
-inline void *open_or_create_semaphore(const char *name, long initial_count, long maximum_count, interprocess_security_attributes *attr)
-{  return CreateSemaphoreA(attr, initial_count, maximum_count, name);  }
-
-inline void *open_or_create_semaphore(const wchar_t *name, long initial_count, long maximum_count, interprocess_security_attributes *attr)
-{  return CreateSemaphoreW(attr, initial_count, maximum_count, name);  }
-
-inline void *open_semaphore(const char *name)
-{  return OpenSemaphoreA(semaphore_all_access, 0, name);  }
-
-inline void *open_semaphore(const wchar_t *name)
-{  return OpenSemaphoreW(semaphore_all_access, 0, name);  }
-
-inline int release_semaphore(void *handle, long release_count, long *prev_count)
-{  return ReleaseSemaphore(handle, release_count, prev_count); }
-
-class interprocess_all_access_security
-{
-   interprocess_security_attributes sa;
-   interprocess_security_descriptor sd;
-   bool initialized;
-
-   public:
-   interprocess_all_access_security()
-      : initialized(false)
-   {
-      if(!boost::winapi::InitializeSecurityDescriptor(&sd, security_descriptor_revision))
-         return;
-      if(!boost::winapi::SetSecurityDescriptorDacl(&sd, true, 0, false))
-         return;
-      sa.lpSecurityDescriptor = &sd;
-      sa.nLength = sizeof(interprocess_security_attributes);
-      sa.bInheritHandle = false;
-      initialized = true;
-   }
-
-   interprocess_security_attributes *get_attributes()
-   {  return &sa; }
-};
-
-inline void * create_file_mapping (void * handle, unsigned long access, ::boost::ulong_long_type file_offset, const char * name, interprocess_security_attributes *psec)
-{
-   const boost::winapi::DWORD_ high_size = boost::winapi::DWORD_(file_offset >> 32);
-   const boost::winapi::DWORD_ low_size  = boost::winapi::DWORD_(file_offset);
-   return CreateFileMappingA (handle, psec, access, high_size, low_size, name);
-}
-
-inline void * create_file_mapping (void * handle, unsigned long access, ::boost::ulong_long_type file_offset, const wchar_t * name, interprocess_security_attributes *psec)
-{
-   const boost::winapi::DWORD_ high_size = boost::winapi::DWORD_(file_offset >> 32);
-   const boost::winapi::DWORD_ low_size  = boost::winapi::DWORD_(file_offset);
-   return CreateFileMappingW (handle, psec, access, high_size, low_size, name);
-}
-
-inline void * open_file_mapping (unsigned long access, const char *name)
-{  return OpenFileMappingA (access, 0, name);   }
-
-inline void * open_file_mapping (unsigned long access, const wchar_t *name)
-{  return OpenFileMappingW (access, 0, name);   }
-
-inline void *map_view_of_file_ex(void *handle, unsigned long file_access, ::boost::ulong_long_type offset, std::size_t numbytes, void *base_addr)
-{
-   const boost::winapi::DWORD_ offset_low  = boost::winapi::DWORD_(offset & ((::boost::ulong_long_type)0xFFFFFFFF));
-   const boost::winapi::DWORD_ offset_high = boost::winapi::DWORD_(offset >> 32);
-   return MapViewOfFileEx(handle, file_access, offset_high, offset_low, numbytes, base_addr);
-}
-
-template<class CharT>
-inline void *create_file(const CharT *name, unsigned long access, unsigned long creation_flags, unsigned long attributes, interprocess_security_attributes *psec)
-{
-   for (unsigned int attempt(0); attempt < error_sharing_violation_tries; ++attempt){
-      void * const handle = boost::winapi::create_file(name, access,
-                                        file_share_read | file_share_write | file_share_delete,
-                                        psec, creation_flags, attributes, 0);
-      bool const invalid(invalid_handle_value == handle);
-      if (!invalid){
-         return handle;
-      }
-      if (error_sharing_violation != get_last_error()){
-         return handle;
-      }
-      sleep(error_sharing_violation_sleep_ms);
-   }
-   return invalid_handle_value;
-}
-
-inline void get_system_info(interprocess_system_info *info)
-{  boost::ipwinapiext::GetSystemInfo(info); }
-
-inline bool flush_view_of_file(void *base_addr, std::size_t numbytes)
-{  return 0 != boost::winapi::FlushViewOfFile(base_addr, numbytes); }
-
-inline bool virtual_unlock(void *base_addr, std::size_t numbytes)
-{  return 0 != boost::ipwinapiext::VirtualUnlock(base_addr, numbytes); }
-
-inline bool virtual_protect(void *base_addr, std::size_t numbytes, unsigned long flNewProtect, unsigned long &lpflOldProtect)
-{  return 0 != boost::ipwinapiext::VirtualProtect(base_addr, numbytes, flNewProtect, &lpflOldProtect); }
-
-inline bool flush_file_buffers(void *handle)
-{  return 0 != boost::ipwinapiext::FlushFileBuffers(handle); }
-
-inline bool get_file_size(void *handle, __int64 &size)
-{  return 0 != boost::winapi::GetFileSizeEx(handle, (boost::winapi::LARGE_INTEGER_*)&size);  }
-
-template<class CharT>
-inline bool create_directory(const CharT *name)
-{
-   interprocess_all_access_security sec;
-   return 0 != boost::winapi::create_directory(name, sec.get_attributes());
-}
-
-template<class CharT>
-inline bool remove_directory(const CharT *lpPathName)
-{  return 0 != boost::winapi::remove_directory(lpPathName);   }
-
-template<class CharT>
-inline unsigned long get_temp_path(unsigned long length, CharT *buffer)
-{  return boost::winapi::get_temp_path(length, buffer);   }
-
-inline int set_end_of_file(void *handle)
-{  return 0 != boost::winapi::SetEndOfFile(handle);   }
-
-inline bool set_file_pointer(void *handle, __int64 distance, __int64 *new_file_pointer, unsigned long move_method)
-{
-   boost::winapi::LONG_ highPart = boost::winapi::LONG_(distance >> 32u);
-   boost::winapi::DWORD_ r = boost::winapi::SetFilePointer(handle, (long)distance, &highPart, move_method);
-   bool br = r != boost::winapi::INVALID_SET_FILE_POINTER_ || boost::winapi::GetLastError() != 0;
-   if (br && new_file_pointer){
-      *new_file_pointer = (__int64)r + ((__int64)highPart << 32);
-   }
-
-   return br;
-}
-
-inline bool lock_file_ex(void *hnd, unsigned long flags, unsigned long reserved, unsigned long size_low, unsigned long size_high, interprocess_overlapped *overlapped)
-{  return 0 != boost::winapi::LockFileEx(hnd, flags, reserved, size_low, size_high, overlapped); }
-
-inline bool unlock_file_ex(void *hnd, unsigned long reserved, unsigned long size_low, unsigned long size_high, interprocess_overlapped *overlapped)
-{  return 0 != boost::winapi::UnlockFileEx(hnd, reserved, size_low, size_high, overlapped);  }
-
-inline bool write_file(void *hnd, const void *buffer, unsigned long bytes_to_write, unsigned long *bytes_written, interprocess_overlapped* overlapped)
-{  return 0 != boost::winapi::WriteFile(hnd, buffer, bytes_to_write, bytes_written, overlapped);  }
-
-inline bool read_file(void *hnd, void *buffer, unsigned long bytes_to_read, unsigned long *bytes_read, interprocess_overlapped* overlapped)
-{  return 0 != boost::winapi::ReadFile(hnd, buffer, bytes_to_read, bytes_read, overlapped);  }
-
-inline bool get_file_information_by_handle(void *hnd, interprocess_by_handle_file_information *info)
-{  return 0 != boost::winapi::GetFileInformationByHandle(hnd, info);  }
-
-inline long interlocked_increment(long volatile *addr)
-{  return BOOST_INTERLOCKED_INCREMENT(const_cast<long*>(addr));  }
-
-inline long interlocked_decrement(long volatile *addr)
-{  return BOOST_INTERLOCKED_DECREMENT(const_cast<long*>(addr));  }
-
-inline long interlocked_compare_exchange(long volatile *addr, long val1, long val2)
-{  return BOOST_INTERLOCKED_COMPARE_EXCHANGE(const_cast<long*>(addr), val1, val2);  }
-
-inline long interlocked_exchange_add(long volatile* addend, long value)
-{  return BOOST_INTERLOCKED_EXCHANGE_ADD(const_cast<long*>(addend), value);  }
-
-inline long interlocked_exchange(long volatile* addend, long value)
-{  return BOOST_INTERLOCKED_EXCHANGE(const_cast<long*>(addend), value);  }
-
-//Forward functions
-inline hmodule load_library(const char *name)
-{  return boost::winapi::LoadLibraryA(name); }
-
-inline bool free_library(hmodule module)
-{  return 0 != boost::winapi::FreeLibrary(module); }
-
-inline farproc_t get_proc_address(hmodule module, const char *name)
-{  return boost::winapi::GetProcAddress(module, name); }
-
-inline void *get_current_process()
-{  return boost::winapi::GetCurrentProcess();  }
-
-inline hmodule get_module_handle(const char *name)
-{  return boost::winapi::GetModuleHandleA(name); }
-
-inline long reg_open_key_ex(hkey hKey, const char *lpSubKey, unsigned long ulOptions, unsigned long samDesired, hkey *phkResult)
-{  return boost::ipwinapiext::RegOpenKeyExA(hKey, lpSubKey, ulOptions, samDesired, phkResult); }
-
-inline long reg_open_key_ex(hkey hKey, const wchar_t *lpSubKey, unsigned long ulOptions, unsigned long samDesired, hkey *phkResult)
-{  return boost::ipwinapiext::RegOpenKeyExW(hKey, lpSubKey, ulOptions, samDesired, phkResult); }
-
-
-inline long reg_query_value_ex(hkey hKey, const char *lpValueName, unsigned long*lpReserved, unsigned long*lpType, unsigned char *lpData, unsigned long*lpcbData)
-{  return boost::ipwinapiext::RegQueryValueExA(hKey, lpValueName, lpReserved, lpType, lpData, lpcbData); }
-
-inline long reg_query_value_ex(hkey hKey, const wchar_t *lpValueName, unsigned long*lpReserved, unsigned long*lpType, unsigned char *lpData, unsigned long*lpcbData)
-{  return boost::ipwinapiext::RegQueryValueExW(hKey, lpValueName, lpReserved, lpType, lpData, lpcbData); }
-
-inline long reg_close_key(hkey hKey)
-{  return boost::ipwinapiext::RegCloseKey(hKey); }
-
-inline void initialize_object_attributes
-( object_attributes_t *pobject_attr, unicode_string_t *name
- , unsigned long attr, void *rootdir, void *security_descr)
-
-{
-   pobject_attr->Length = sizeof(object_attributes_t);
-   pobject_attr->RootDirectory = rootdir;
-   pobject_attr->Attributes = attr;
-   pobject_attr->ObjectName = name;
-   pobject_attr->SecurityDescriptor = security_descr;
-   pobject_attr->SecurityQualityOfService = 0;
-}
-
-inline void rtl_init_empty_unicode_string(unicode_string_t *ucStr, wchar_t *buf, unsigned short bufSize)
-{
-   ucStr->Buffer = buf;
-   ucStr->Length = 0;
-   ucStr->MaximumLength = bufSize;
-}
-
-//A class that locates and caches loaded DLL function addresses.
-template<int Dummy>
-struct function_address_holder
-{
-   enum  { NtSetInformationFile
-         , NtQuerySystemInformation
-         , NtQueryObject
-         , NtQuerySemaphore
-         , NtQuerySection
-         , NtOpenFile
-         , NtClose
-         , NtQueryTimerResolution
-         , NumFunction
-         };
-   enum { NtDll_dll, Kernel32_dll, NumModule };
-
-   private:
-   static const char *FunctionNames[NumFunction];
-   static const char *ModuleNames[NumModule];
-   static farproc_t FunctionAddresses[NumFunction];
-   static unsigned int FunctionModules[NumFunction];
-   static volatile long FunctionStates[NumFunction];
-   static hmodule ModuleAddresses[NumModule];
-   static volatile long ModuleStates[NumModule];
-
-   static hmodule get_module_from_id(unsigned int id)
-   {
-      BOOST_ASSERT(id < (unsigned int)NumModule);
-      hmodule addr = get_module_handle(ModuleNames[id]);
-      BOOST_ASSERT(addr);
-      return addr;
-   }
-
-   static hmodule get_module(const unsigned int id)
-   {
-      BOOST_ASSERT(id < (unsigned int)NumModule);
-      for(unsigned i = 0; ModuleStates[id] < 2; ++i){
-         if(interlocked_compare_exchange(&ModuleStates[id], 1, 0) == 0){
-            ModuleAddresses[id] = get_module_from_id(id);
-            interlocked_increment(&ModuleStates[id]);
-            break;
-         }
-         else if(i & 1){
-            sched_yield();
-         }
-         else{
-            sleep_tick();
-         }
-      }
-      return ModuleAddresses[id];
-   }
-
-   static farproc_t get_address_from_dll(const unsigned int id)
-   {
-      BOOST_ASSERT(id < (unsigned int)NumFunction);
-      farproc_t addr = get_proc_address(get_module(FunctionModules[id]), FunctionNames[id]);
-      BOOST_ASSERT(addr);
-      return addr;
-   }
-
-   public:
-   static farproc_t get(const unsigned int id)
-   {
-      BOOST_ASSERT(id < (unsigned int)NumFunction);
-      for(unsigned i = 0; FunctionStates[id] < 2; ++i){
-         if(interlocked_compare_exchange(&FunctionStates[id], 1, 0) == 0){
-            FunctionAddresses[id] = get_address_from_dll(id);
-            interlocked_increment(&FunctionStates[id]);
-            break;
-         }
-         else if(i & 1){
-            sched_yield();
-         }
-         else{
-            sleep_tick();
-         }
-      }
-      return FunctionAddresses[id];
-   }
-};
-
-template<int Dummy>
-const char *function_address_holder<Dummy>::FunctionNames[function_address_holder<Dummy>::NumFunction] =
-{
-   "NtSetInformationFile",
-   "NtQuerySystemInformation",
-   "NtQueryObject",
-   "NtQuerySemaphore",
-   "NtQuerySection",
-   "NtOpenFile",
-   "NtClose",
-   "NtQueryTimerResolution",
-};
-
-template<int Dummy>
-unsigned int function_address_holder<Dummy>::FunctionModules[function_address_holder<Dummy>::NumFunction] =
-{
-   NtDll_dll,
-   NtDll_dll,
-   NtDll_dll,
-   NtDll_dll,
-   NtDll_dll,
-   NtDll_dll,
-   NtDll_dll,
-   NtDll_dll,
-};
-
-template<int Dummy>
-const char *function_address_holder<Dummy>::ModuleNames[function_address_holder<Dummy>::NumModule] =
-{
-   "ntdll.dll"//, "kernel32.dll"
-};
-
-
-template<int Dummy>
-farproc_t function_address_holder<Dummy>::FunctionAddresses[function_address_holder<Dummy>::NumFunction];
-
-template<int Dummy>
-volatile long function_address_holder<Dummy>::FunctionStates[function_address_holder<Dummy>::NumFunction];
-
-template<int Dummy>
-hmodule function_address_holder<Dummy>::ModuleAddresses[function_address_holder<Dummy>::NumModule];
-
-template<int Dummy>
-volatile long function_address_holder<Dummy>::ModuleStates[function_address_holder<Dummy>::NumModule];
-
-
-struct dll_func
-   : public function_address_holder<0>
-{};
-
-//Complex winapi based functions...
-struct library_unloader
-{
-   hmodule lib_;
-   library_unloader(hmodule module) : lib_(module){}
-   ~library_unloader(){ free_library(lib_);  }
-};
-
-
-inline bool get_system_time_of_day_information(system_timeofday_information &info)
-{
-   NtQuerySystemInformation_t pNtQuerySystemInformation = reinterpret_cast<NtQuerySystemInformation_t>
-         (dll_func::get(dll_func::NtQuerySystemInformation));
-   unsigned long res;
-   long status = pNtQuerySystemInformation(system_time_of_day_information, &info, sizeof(info), &res);
-   if(status){
-      return false;
-   }
-   return true;
-}
-
-inline bool get_boot_time(unsigned char (&bootstamp) [BootstampLength])
-{
-   system_timeofday_information info;
-   bool ret = get_system_time_of_day_information(info);
-   if(!ret){
-      return false;
-   }
-   std::memcpy(&bootstamp[0], &info.Reserved1, sizeof(bootstamp));
-   return true;
-}
-
-inline bool get_boot_and_system_time(unsigned char (&bootsystemstamp) [BootAndSystemstampLength])
-{
-   system_timeofday_information info;
-   bool ret = get_system_time_of_day_information(info);
-   if(!ret){
-      return false;
-   }
-   std::memcpy(&bootsystemstamp[0], &info.Reserved1, sizeof(bootsystemstamp));
-   return true;
-}
-
-//Writes the hexadecimal value of the buffer, in the wide character string.
-//str must be twice length
-inline void buffer_to_wide_str(const void *buf, std::size_t length, wchar_t *str)
-{
-   const wchar_t Characters [] =
-      { L'0', L'1', L'2', L'3', L'4', L'5', L'6', L'7'
-      , L'8', L'9', L'A', L'B', L'C', L'D', L'E', L'F' };
-   std::size_t char_counter = 0;
-   const char *chbuf = static_cast<const char *>(buf);
-   for(std::size_t i = 0; i != length; ++i){
-      str[char_counter++] = Characters[(chbuf[i]&0xF0)>>4];
-      str[char_counter++] = Characters[(chbuf[i]&0x0F)];
-   }
-}
-
-//Writes the hexadecimal value of the buffer, in the narrow character string.
-//str must be twice length
-inline void buffer_to_narrow_str(const void *buf, std::size_t length, char *str)
-{
-   const char Characters [] =
-      { '0', '1', '2', '3', '4', '5', '6', '7'
-      , '8', '9', 'A', 'B', 'C', 'D', 'E', 'F' };
-   std::size_t char_counter = 0;
-   const char *chbuf = static_cast<const char *>(buf);
-   for(std::size_t i = 0; i != length; ++i){
-      str[char_counter++] = Characters[(chbuf[i]&0xF0)>>4];
-      str[char_counter++] = Characters[(chbuf[i]&0x0F)];
-   }
-}
-
-inline bool get_boot_time_str(char *bootstamp_str, std::size_t &s)
-   //will write BootstampLength chars
-{
-   if(s < (BootstampLength*2))
-      return false;
-   system_timeofday_information info;
-   bool ret = get_system_time_of_day_information(info);
-   if(!ret){
-      return false;
-   }
-
-   buffer_to_narrow_str(info.Reserved1, BootstampLength, bootstamp_str);
-   s = BootstampLength*2;
-   return true;
-}
-
-inline bool get_boot_and_system_time_wstr(wchar_t *bootsystemstamp, std::size_t &s)
-   //will write BootAndSystemstampLength chars
-{
-   if(s < (BootAndSystemstampLength*2))
-      return false;
-   system_timeofday_information info;
-   bool ret = get_system_time_of_day_information(info);
-   if(!ret){
-      return false;
-   }
-
-   buffer_to_wide_str(&info.Reserved1[0], BootAndSystemstampLength, bootsystemstamp);
-   s = BootAndSystemstampLength*2;
-   return true;
-}
-
-class handle_closer
-{
-   void *handle_;
-   handle_closer(const handle_closer &);
-   handle_closer& operator=(const handle_closer &);
-   public:
-   explicit handle_closer(void *handle) : handle_(handle){}
-   ~handle_closer()
-   {  close_handle(handle_);  }
-};
-
-union ntquery_mem_t
-{
-   object_name_information_t name;
-   struct ren_t
-   {
-      file_rename_information_t info;
-      wchar_t buf[1];
-   } ren;
-};
-
-class nt_query_mem_deleter
-{
-   static const std::size_t rename_offset = offsetof(ntquery_mem_t, ren.info.FileName) -
-      offsetof(ntquery_mem_t, name.Name.Buffer);
-   //                                           Timestamp                      process id              atomic count
-   static const std::size_t rename_suffix =
-      (SystemTimeOfDayInfoLength + sizeof(unsigned long) + sizeof(boost::winapi::DWORD_))*2;
-
-   public:
-   explicit nt_query_mem_deleter(std::size_t object_name_info_size)
-      : m_size(object_name_info_size + rename_offset + rename_suffix)
-      , m_buf(new char [m_size])
-   {}
-
-   ~nt_query_mem_deleter()
-   {
-      delete[]m_buf;
-   }
-
-   void realloc_mem(std::size_t num_bytes)
-   {
-      num_bytes += rename_suffix + rename_offset;
-      char *buf = m_buf;
-      m_buf = new char[num_bytes];
-      delete[]buf;
-      m_size = num_bytes;
-   }
-
-   ntquery_mem_t *query_mem() const
-   {  return static_cast<ntquery_mem_t *>(static_cast<void*>(m_buf));  }
-
-   unsigned long object_name_information_size() const
-   {
-      return static_cast<unsigned long>(m_size - rename_offset - SystemTimeOfDayInfoLength*2);
-   }
-
-   std::size_t file_rename_information_size() const
-   {  return static_cast<unsigned long>(m_size);  }
-
-   private:
-   std::size_t m_size;
-   char *m_buf;
-};
-
-class c_heap_deleter
-{
-   public:
-   explicit c_heap_deleter(std::size_t size)
-      : m_buf(::malloc(size))
-   {}
-
-   ~c_heap_deleter()
-   {
-      if(m_buf) ::free(m_buf);
-   }
-
-   void realloc_mem(std::size_t num_bytes)
-   {
-      void *oldBuf = m_buf;
-      m_buf = ::realloc(m_buf, num_bytes);
-      if (!m_buf){
-         free(oldBuf);
-      }
-   }
-
-   void *get() const
-   {  return m_buf;  }
-
-   private:
-   void *m_buf;
-};
-
-template<class CharT>
-inline bool unlink_file(const CharT *filename)
-{
-   //Don't try to optimize doing a DeleteFile first
-   //as there are interactions with permissions and
-   //in-use files.
-   //
-   //if(!delete_file(filename)){
-   //   (...)
-   //
-
-   //This functions tries to emulate UNIX unlink semantics in windows.
-   //
-   //- Open the file and mark the handle as delete-on-close
-   //- Rename the file to an arbitrary name based on a random number
-   //- Close the handle. If there are no file users, it will be deleted.
-   //  Otherwise it will be used by already connected handles but the
-   //  file name can't be used to open this file again
-   BOOST_TRY{
-      NtSetInformationFile_t pNtSetInformationFile =
-         reinterpret_cast<NtSetInformationFile_t>(dll_func::get(dll_func::NtSetInformationFile));
-
-      NtQueryObject_t pNtQueryObject = reinterpret_cast<NtQueryObject_t>(dll_func::get(dll_func::NtQueryObject));
-
-      //First step: Obtain a handle to the file using Win32 rules. This resolves relative paths
-      void *fh = create_file(filename, generic_read | delete_access, open_existing, 0, 0);
-      if(fh == invalid_handle_value){
-         return false;
-      }
-
-      handle_closer h_closer(fh);
-      {
-         //Obtain name length
-         unsigned long size;
-         const std::size_t initial_string_mem = 512u;
-
-         nt_query_mem_deleter nt_query_mem(sizeof(ntquery_mem_t)+initial_string_mem);
-         //Obtain file name with guessed length
-         if(pNtQueryObject(fh, object_name_information, nt_query_mem.query_mem(), nt_query_mem.object_name_information_size(), &size)){
-            //Obtain file name with exact length buffer
-            nt_query_mem.realloc_mem(size);
-            if(pNtQueryObject(fh, object_name_information, nt_query_mem.query_mem(), nt_query_mem.object_name_information_size(), &size)){
-               return false;
-            }
-         }
-         ntquery_mem_t *pmem = nt_query_mem.query_mem();
-         file_rename_information_t *pfri = &pmem->ren.info;
-         const std::size_t RenMaxNumChars =
-            std::size_t(((char*)(pmem) + nt_query_mem.file_rename_information_size()) - (char*)&pmem->ren.info.FileName[0])/sizeof(wchar_t);
-
-         //Copy filename to the rename member
-         std::memmove(pmem->ren.info.FileName, pmem->name.Name.Buffer, pmem->name.Name.Length);
-         std::size_t filename_string_length = pmem->name.Name.Length/sizeof(wchar_t);
-
-         //Search '\\' character to replace from it
-         for(std::size_t i = filename_string_length; i != 0; --filename_string_length){
-            if(pmem->ren.info.FileName[--i] == L'\\')
-               break;
-         }
-
-         //Add random number
-         std::size_t s = RenMaxNumChars - filename_string_length;
-         if(!get_boot_and_system_time_wstr(&pfri->FileName[filename_string_length], s)){
-            return false;
-         }
-         filename_string_length += s;
-
-         //Sometimes the precission of the timestamp is not enough and we need to add another random number.
-         //The process id (to exclude concurrent processes) and an atomic count (to exclude concurrent threads).
-         //should be enough
-         const unsigned long pid = get_current_process_id();
-         buffer_to_wide_str(&pid, sizeof(pid), &pfri->FileName[filename_string_length]);
-         filename_string_length += sizeof(pid)*2;
-
-         static volatile boost::uint32_t u32_count = 0;
-         interlocked_decrement(reinterpret_cast<volatile long*>(&u32_count));
-         buffer_to_wide_str(const_cast<const boost::uint32_t *>(&u32_count), sizeof(boost::uint32_t), &pfri->FileName[filename_string_length]);
-         filename_string_length += sizeof(boost::uint32_t)*2;
-
-         //Fill rename information (FileNameLength is in bytes)
-         pfri->FileNameLength = static_cast<unsigned long>(sizeof(wchar_t)*(filename_string_length));
-         pfri->Replace = 1;
-         pfri->RootDir = 0;
-
-         //Cange the name of the in-use file...
-         io_status_block_t io;
-         if(0 != pNtSetInformationFile(fh, &io, pfri, nt_query_mem.file_rename_information_size(), file_rename_information)){
-            return false;
-         }
-      }
-      //...and mark it as delete-on-close
-      {
-         //Don't use pNtSetInformationFile with file_disposition_information as it can return STATUS_CANNOT_DELETE
-         //if the file is still mapped. Reopen it with NtOpenFile and file_delete_on_close
-         NtOpenFile_t pNtOpenFile = reinterpret_cast<NtOpenFile_t>(dll_func::get(dll_func::NtOpenFile));
-         NtClose_t pNtClose = reinterpret_cast<NtClose_t>(dll_func::get(dll_func::NtClose));
-         const wchar_t empty_str [] = L"";
-         unicode_string_t ustring = { sizeof(empty_str) - sizeof (wchar_t)   //length in bytes without null
-                                    , sizeof(empty_str)   //total size in bytes of memory allocated for Buffer.
-                                    , const_cast<wchar_t*>(empty_str)
-                                    };
-         object_attributes_t object_attr;
-         initialize_object_attributes(&object_attr, &ustring, 0, fh, 0);
-         void* fh2 = 0;
-         io_status_block_t io;
-         pNtOpenFile( &fh2, delete_flag, &object_attr, &io
-                    , file_share_read | file_share_write | file_share_delete, file_delete_on_close);
-         pNtClose(fh2);
-         //Even if NtOpenFile fails, the file was renamed and the original no longer exists, so return a success status
-         return true;
-      }
-   }
-   BOOST_CATCH(...){
-      return false;
-   } BOOST_CATCH_END
-   return true;
-}
-
-struct reg_closer
-{
-   hkey key_;
-   reg_closer(hkey key) : key_(key){}
-   ~reg_closer(){ reg_close_key(key_);  }
-};
-
-template <class CharT>
-inline bool get_registry_value_buffer(hkey key_type, const CharT *subkey_name, const CharT *value_name, void *buf, std::size_t &buflen)
-{
-   bool bret = false;
-   hkey key;
-   if (reg_open_key_ex( key_type
-                     , subkey_name
-                     , 0
-                     , key_query_value
-                     , &key) == 0){
-      reg_closer key_closer(key);
-
-      //Obtain the value
-      unsigned long size = buflen;
-      unsigned long type;
-      buflen = 0;
-      bret = 0 == reg_query_value_ex( key, value_name, 0, &type, (unsigned char*)buf, &size);
-      if(bret)
-         buflen = (std::size_t)size;
-   }
-   return bret;
-}
-
-template<class CharT>
-inline bool get_registry_value_string(hkey key_type, const CharT *subkey_name, const CharT *value_name, std::basic_string<CharT> &s)
-{
-   bool bret = false;
-   s.clear();
-   hkey key;
-   if (reg_open_key_ex( key_type
-                     , subkey_name
-                     , 0
-                     , key_query_value
-                     , &key) == 0){
-      reg_closer key_closer(key);
-
-      //Obtain the value
-      unsigned long size;
-      unsigned long type;
-      long err = reg_query_value_ex( key, value_name, 0, &type, 0, &size);
-      if((reg_sz == type || reg_expand_sz == type) && !err){
-         //Size includes terminating NULL
-         s.resize(size/sizeof(CharT));
-         err = reg_query_value_ex( key, value_name, 0, &type, (unsigned char*)(&s[0]), &size);
-         if(!err){
-            s.erase(s.end()-1);
-            bret = true;
-         }
-         (void)err;
-      }
-   }
-   return bret;
-}
-
-template<class CharT>
-inline void get_shared_documents_folder(std::basic_string<CharT> &s)
-{
-   get_registry_value_string( hkey_local_machine
-                            , "SOFTWARE\\Microsoft\\Windows\\CurrentVersion\\Explorer\\Shell Folders"
-                            , "Common AppData"
-                            , s);
-}
-
-inline void get_shared_documents_folder(std::wstring &s)
-{
-   get_registry_value_string( hkey_local_machine
-                            , L"SOFTWARE\\Microsoft\\Windows\\CurrentVersion\\Explorer\\Shell Folders"
-                            , L"Common AppData"
-                            , s);
-}
-
-template<class CharT>
-inline void get_registry_value(const CharT *folder, const CharT *value_key, std::vector<unsigned char> &s)
-{
-   s.clear();
-   hkey key;
-   if (reg_open_key_ex( hkey_local_machine
-                     , folder
-                     , 0
-                     , key_query_value
-                     , &key) == 0){
-      reg_closer key_closer(key);
-
-      //Obtain the value
-      unsigned long size;
-      unsigned long type;
-      const char *const reg_value = value_key;
-      //long err = (*pRegQueryValue)( key, reg_value, 0, &type, 0, &size);
-      long err = reg_query_value_ex( key, reg_value, 0, &type, 0, &size);
-      if(!err){
-         //Size includes terminating NULL
-         s.resize(size);
-         //err = (*pRegQueryValue)( key, reg_value, 0, &type, (unsigned char*)(&s[0]), &size);
-         err = reg_query_value_ex( key, reg_value, 0, &type, (unsigned char*)(&s[0]), &size);
-         if(!err)
-            s.erase(s.end()-1);
-         (void)err;
-      }
-   }
-}
-
-inline bool is_directory(const char *path)
-{
-   unsigned long attrib = GetFileAttributesA(path);
-
-   return (attrib != invalid_file_attributes &&
-           (attrib & file_attribute_directory));
-}
-
-inline bool get_file_mapping_size(void *file_mapping_hnd, __int64 &size)
-{
-   NtQuerySection_t pNtQuerySection =
-      reinterpret_cast<NtQuerySection_t>(dll_func::get(dll_func::NtQuerySection));
-   //Obtain file name
-   interprocess_section_basic_information info;
-   long ntstatus =
-      pNtQuerySection(file_mapping_hnd, section_basic_information, &info, sizeof(info), 0);
-   size = info.section_size;
-   return !ntstatus;
-}
-
-inline bool get_semaphore_info(void *handle, long &count, long &limit)
-{
-   winapi::interprocess_semaphore_basic_information info;
-   winapi::NtQuerySemaphore_t pNtQuerySemaphore =
-         reinterpret_cast<winapi::NtQuerySemaphore_t>(dll_func::get(winapi::dll_func::NtQuerySemaphore));
-   unsigned int ret_len;
-   long status = pNtQuerySemaphore(handle, winapi::semaphore_basic_information, &info, sizeof(info), &ret_len);
-   count = (long)info.count;
-   limit = (long)info.limit;
-   return !status;
-}
-
-inline bool query_timer_resolution(unsigned long *lowres, unsigned long *highres, unsigned long *curres)
-{
-   winapi::NtQueryTimerResolution_t pNtQueryTimerResolution =
-         reinterpret_cast<winapi::NtQueryTimerResolution_t>(dll_func::get(winapi::dll_func::NtQueryTimerResolution));
-   return !pNtQueryTimerResolution(lowres, highres, curres);
-}
-
-inline bool query_performance_counter(__int64 *lpPerformanceCount)
-{
-   return 0 != boost::winapi::QueryPerformanceCounter(reinterpret_cast<boost::winapi::LARGE_INTEGER_*>(lpPerformanceCount));
-}
-
-inline bool query_performance_frequency(__int64 *lpFrequency)
-{
-   return 0 != boost::winapi::QueryPerformanceFrequency(reinterpret_cast<boost::winapi::LARGE_INTEGER_*>(lpFrequency));
-}
-
-inline unsigned long get_tick_count()
-{  return GetTickCount();  }
-
-
-template<class CharT>
-struct winapi_traits;
-
-template<>
-struct winapi_traits<char>
-{
-   static int cmp(const char *a, const char *b)
-   {  return std::strcmp(a, b); }
-};
-
-template<>
-struct winapi_traits<wchar_t>
-{
-   static int cmp(const wchar_t *a, const wchar_t *b)
-   {  return std::wcscmp(a, b); }
-};
-
-
-#if defined(BOOST_INTERPROCESS_BOOTSTAMP_IS_SESSION_MANAGER_BASED)
-
-
-inline bool get_last_bootup_time(std::string &stamp)
-{
-   unsigned dword_val = 0;
-   std::size_t dword_size = sizeof(dword_val);
-   bool b_ret = get_registry_value_buffer( hkey_local_machine
-      , "SYSTEM\\CurrentControlSet\\Control\\Session Manager\\Memory Management\\PrefetchParameters"
-      , "BootId", &dword_val, dword_size);
-   if (b_ret)
-   {
-      char dword_str[sizeof(dword_val)*2u+1];
-      buffer_to_narrow_str(&dword_val, dword_size, dword_str);
-      dword_str[sizeof(dword_val)*2] = '\0';
-      stamp = dword_str;
-
-      b_ret = get_registry_value_buffer( hkey_local_machine
-         , "SYSTEM\\CurrentControlSet\\Control\\Session Manager\\Power"
-         , "HybridBootAnimationTime", &dword_val, dword_size);
-      //Old Windows versions have no HybridBootAnimationTime
-      if(b_ret)
-      {
-         buffer_to_narrow_str(&dword_val, dword_size, dword_str);
-         dword_str[sizeof(dword_val)*2] = '\0';
-         stamp += "_";
-         stamp += dword_str;
-      }
-      b_ret = true;
-   }
-   return b_ret;
-}
-
-inline bool get_last_bootup_time(std::wstring &stamp)
-{
-   unsigned dword_val = 0;
-   std::size_t dword_size = sizeof(dword_val);
-   bool b_ret = get_registry_value_buffer( hkey_local_machine
-      , L"SYSTEM\\CurrentControlSet\\Control\\Session Manager\\Memory Management\\PrefetchParameters"
-      , L"BootId", &dword_val, dword_size);
-   if (b_ret)
-   {
-      wchar_t dword_str[sizeof(dword_val)*2u+1];
-      buffer_to_wide_str(&dword_val, dword_size, dword_str);
-      dword_str[sizeof(dword_val)*2] = L'\0';
-      stamp = dword_str;
-
-      b_ret = get_registry_value_buffer( hkey_local_machine
-         , L"SYSTEM\\CurrentControlSet\\Control\\Session Manager\\Power"
-         , L"HybridBootAnimationTime", &dword_val, dword_size);
-      //Old Windows versions have no HybridBootAnimationTime
-      if(b_ret)
-      {
-         buffer_to_wide_str(&dword_val, dword_size, dword_str);
-         dword_str[sizeof(dword_val)*2] = L'\0';
-         stamp += L"_";
-         stamp += dword_str;
-      }
-      b_ret = true;
-   }
-   return b_ret;
-}
-
-#elif defined(BOOST_INTERPROCESS_BOOTSTAMP_IS_EVENTLOG_BASED)
-
-static const unsigned long eventlog_sequential_read = 0x0001;
-static const unsigned long eventlog_backwards_read  = 0x0008;
-
-struct interprocess_eventlogrecord
-{
-    unsigned long  Length;        // Length of full record
-    unsigned long  Reserved;      // Used by the service
-    unsigned long  RecordNumber;  // Absolute record number
-    unsigned long  TimeGenerated; // Seconds since 1-1-1970
-    unsigned long  TimeWritten;   // Seconds since 1-1-1970
-    unsigned long  EventID;
-    unsigned short EventType;
-    unsigned short NumStrings;
-    unsigned short EventCategory;
-    unsigned short ReservedFlags; // For use with paired events (auditing)
-    unsigned long  ClosingRecordNumber; // For use with paired events (auditing)
-    unsigned long  StringOffset;  // Offset from beginning of record
-    unsigned long  UserSidLength;
-    unsigned long  UserSidOffset;
-    unsigned long  DataLength;
-    unsigned long  DataOffset;    // Offset from beginning of record
-    //
-    // Then follow:
-    //
-    // wchar_t SourceName[]
-    // wchar_t Computername[]
-    // SID   UserSid
-    // wchar_t Strings[]
-    // BYTE  Data[]
-    // CHAR  Pad[]
-    // unsigned long Length;
-    //
-};
-
-class eventlog_handle_closer
-{
-   void *handle_;
-   eventlog_handle_closer(const handle_closer &);
-   eventlog_handle_closer& operator=(const eventlog_handle_closer &);
-   public:
-   explicit eventlog_handle_closer(void *handle) : handle_(handle){}
-   ~eventlog_handle_closer()
-   {  CloseEventLog(handle_);  }
-};
-
-// Loop through the buffer and obtain the contents of the
-// requested record in the buffer.
-template<class CharT>
-inline bool find_record_in_buffer( const void* pBuffer, unsigned long dwBytesRead, const CharT *provider_name
-                                 , unsigned int id_to_find, interprocess_eventlogrecord *&pevent_log_record)
-{
-   const unsigned char * pRecord = static_cast<const unsigned char*>(pBuffer);
-   const unsigned char * pEndOfRecords = pRecord + dwBytesRead;
-
-   while (pRecord < pEndOfRecords){
-      interprocess_eventlogrecord *pTypedRecord = (interprocess_eventlogrecord*)(void*)pRecord;
-      // Check provider, written at the end of the fixed-part of the record
-
-      if (0 == winapi_traits<CharT>::cmp(provider_name, (CharT*)(void*)(pRecord + sizeof(interprocess_eventlogrecord))))
-      {
-         // Check event id
-         if(id_to_find == (pTypedRecord->EventID & 0xFFFF)){
-            pevent_log_record = pTypedRecord;
-            return true;
-         }
-      }
-
-      pRecord += pTypedRecord->Length;
-   }
-   pevent_log_record = 0;
-   return false;
-}
-
-//Obtains the bootup time from the System Event Log,
-//event ID == 6005 (event log started).
-//Adapted from http://msdn.microsoft.com/en-us/library/windows/desktop/bb427356.aspx
-inline bool get_last_bootup_time(std::string &stamp)
-{
-   const char *source_name = "System";
-   const char *provider_name = "EventLog";
-   const unsigned short event_id = 6005u;
-
-   unsigned long status = 0;
-   unsigned long dwBytesToRead = 0;
-   unsigned long dwBytesRead = 0;
-   unsigned long dwMinimumBytesToRead = 0;
-
-   // The source name (provider) must exist as a subkey of Application.
-   void *hEventLog = OpenEventLogA(0, source_name);
-   if (hEventLog){
-      eventlog_handle_closer hnd_closer(hEventLog); (void)hnd_closer;
-      // Allocate an initial block of memory used to read event records. The number
-      // of records read into the buffer will vary depending on the size of each event.
-      // The size of each event will vary based on the size of the user-defined
-      // data included with each event, the number and length of insertion
-      // strings, and other data appended to the end of the event record.
-      dwBytesToRead = max_record_buffer_size;
-      c_heap_deleter heap_deleter(dwBytesToRead);
-
-      // Read blocks of records until you reach the end of the log or an
-      // error occurs. The records are read from newest to oldest. If the buffer
-      // is not big enough to hold a complete event record, reallocate the buffer.
-      if (heap_deleter.get() != 0){
-         while (0 == status){
-            if (!ReadEventLogA(hEventLog,
-                  eventlog_sequential_read | eventlog_backwards_read,
-                  0,
-                  heap_deleter.get(),
-                  dwBytesToRead,
-                  &dwBytesRead,
-                  &dwMinimumBytesToRead)) {
-               status = get_last_error();
-               if (error_insufficient_buffer == status) {
-                  status = 0;
-                  dwBytesToRead = dwMinimumBytesToRead;
-                  heap_deleter.realloc_mem(dwMinimumBytesToRead);
-                  if (!heap_deleter.get()){
-                     return false;
-                  }
-               }
-               else{  //Not found or EOF
-                  return false;
-               }
-            }
-            else
-            {
-               interprocess_eventlogrecord *pTypedRecord;
-               // Print the contents of each record in the buffer.
-               if(find_record_in_buffer(heap_deleter.get(), dwBytesRead, provider_name, event_id, pTypedRecord)){
-                  char stamp_str[sizeof(unsigned long)*3+1];
-                  std::sprintf(&stamp_str[0], "%u", ((unsigned int)pTypedRecord->TimeGenerated));
-                  stamp = stamp_str;
-                  break;
-               }
-            }
-         }
-      }
-   }
-   return true;
-}
-
-
-inline bool get_last_bootup_time(std::wstring &stamp)
-{
-   const wchar_t *source_name = L"System";
-   const wchar_t *provider_name = L"EventLog";
-   const unsigned short event_id = 6005u;
-
-   unsigned long status = 0;
-   unsigned long dwBytesToRead = 0;
-   unsigned long dwBytesRead = 0;
-   unsigned long dwMinimumBytesToRead = 0;
-
-   // The source name (provider) must exist as a subkey of Application.
-   void *hEventLog = OpenEventLogW(0, source_name);
-   if (hEventLog){
-      eventlog_handle_closer hnd_closer(hEventLog); (void)hnd_closer;
-      // Allocate an initial block of memory used to read event records. The number
-      // of records read into the buffer will vary depending on the size of each event.
-      // The size of each event will vary based on the size of the user-defined
-      // data included with each event, the number and length of insertion
-      // strings, and other data appended to the end of the event record.
-      dwBytesToRead = max_record_buffer_size;
-      c_heap_deleter heap_deleter(dwBytesToRead);
-
-      // Read blocks of records until you reach the end of the log or an
-      // error occurs. The records are read from newest to oldest. If the buffer
-      // is not big enough to hold a complete event record, reallocate the buffer.
-      if (heap_deleter.get() != 0){
-         while (0 == status){
-            if (!ReadEventLogW(hEventLog,
-                  eventlog_sequential_read | eventlog_backwards_read,
-                  0,
-                  heap_deleter.get(),
-                  dwBytesToRead,
-                  &dwBytesRead,
-                  &dwMinimumBytesToRead)) {
-               status = get_last_error();
-               if (error_insufficient_buffer == status) {
-                  status = 0;
-                  dwBytesToRead = dwMinimumBytesToRead;
-                  heap_deleter.realloc_mem(dwMinimumBytesToRead);
-                  if (!heap_deleter.get()){
-                     return false;
-                  }
-               }
-               else{  //Not found or EOF
-                  return false;
-               }
-            }
-            else
-            {
-               interprocess_eventlogrecord *pTypedRecord;
-               // Print the contents of each record in the buffer.
-               if(find_record_in_buffer(heap_deleter.get(), dwBytesRead, provider_name, event_id, pTypedRecord)){
-                  wchar_t stamp_str[sizeof(unsigned long)*3+1];
-                  std::swprintf(&stamp_str[0], L"%u", ((unsigned int)pTypedRecord->TimeGenerated));
-                  stamp = stamp_str;
-                  break;
-               }
-            }
-         }
-      }
-   }
-   return true;
-}
-
-#endif   //BOOST_INTERPROCESS_BOOTSTAMP_IS_EVENTLOG_BASED
-
-
-}  //namespace winapi
-}  //namespace interprocess
-}  //namespace boost
-
-#if defined(BOOST_GCC) && (BOOST_GCC >= 40600)
-#  pragma GCC diagnostic pop
-#endif
-
-#include <boost/interprocess/detail/config_end.hpp>
-
-#endif //#ifdef BOOST_INTERPROCESS_WIN32_API_HPP
diff --git a/src/boost/interprocess/detail/windows_intermodule_singleton.hpp b/src/boost/interprocess/detail/windows_intermodule_singleton.hpp
deleted file mode 100644
index 67ce199b..00000000
--- a/src/boost/interprocess/detail/windows_intermodule_singleton.hpp
+++ /dev/null
@@ -1,315 +0,0 @@
-//////////////////////////////////////////////////////////////////////////////
-//
-// (C) Copyright Ion Gaztanaga 2009-2012. Distributed under the Boost
-// 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/interprocess for documentation.
-//
-//////////////////////////////////////////////////////////////////////////////
-
-#ifndef BOOST_INTERPROCESS_WINDOWS_INTERMODULE_SINGLETON_HPP
-#define BOOST_INTERPROCESS_WINDOWS_INTERMODULE_SINGLETON_HPP
-
-#ifndef BOOST_CONFIG_HPP
-#  include <boost/config.hpp>
-#endif
-#
-#if defined(BOOST_HAS_PRAGMA_ONCE)
-#pragma once
-#endif
-
-#include <boost/interprocess/detail/config_begin.hpp>
-#include <boost/interprocess/detail/workaround.hpp>
-#include <boost/container/string.hpp>
-
-#if !defined(BOOST_INTERPROCESS_WINDOWS)
-   #error "This header can't be included from non-windows operating systems"
-#endif
-
-#include <boost/assert.hpp>
-#include <boost/interprocess/detail/intermodule_singleton_common.hpp>
-#include <boost/interprocess/sync/windows/winapi_semaphore_wrapper.hpp>
-#include <boost/interprocess/sync/windows/winapi_mutex_wrapper.hpp>
-#include <boost/interprocess/sync/scoped_lock.hpp>
-#include <boost/cstdint.hpp>
-#include <string>
-#include <boost/container/map.hpp>
-
-namespace boost{
-namespace interprocess{
-namespace ipcdetail{
-
-namespace intermodule_singleton_helpers {
-
-//This global map will be implemented using 3 sync primitives:
-//
-//1)  A named mutex that will implement global mutual exclusion between
-//    threads from different modules/dlls
-//
-//2)  A semaphore that will act as a global counter for modules attached to the global map
-//    so that the global map can be destroyed when the last module is detached.
-//
-//3)  A semaphore that will be hacked to hold the address of a heap-allocated map in the
-//    max and current semaphore count.
-class windows_semaphore_based_map
-{
-   typedef boost::container::map<boost::container::string, ref_count_ptr> map_type;
-
-   public:
-   windows_semaphore_based_map()
-   {
-      map_type *m = new map_type;
-      boost::uint32_t initial_count = 0;
-      boost::uint32_t max_count = 0;
-
-      //Windows user address space sizes:
-      //32 bit windows: [32 bit processes] 2GB or 3GB (31/32 bits)
-      //64 bit windows: [32 bit processes] 2GB or 4GB (31/32 bits)
-      //                [64 bit processes] 2GB or 8TB (31/43 bits)
-      //
-      //Windows semaphores use 'long' parameters (32 bits in LLP64 data model) and
-      //those values can't be negative, so we have 31 bits to store something
-      //in max_count and initial count parameters.
-      //Also, max count must be bigger than 0 and bigger or equal than initial count.
-      if(sizeof(void*) == sizeof(boost::uint32_t)){
-         //This means that for 32 bit processes, a semaphore count (31 usable bits) is
-         //enough to store 4 byte aligned memory (4GB -> 32 bits - 2 bits = 30 bits).
-         //The max count will hold the pointer value and current semaphore count
-         //will be zero.
-         //
-         //Relying in UB with a cast through union, but all known windows compilers
-         //accept this (C11 also accepts this).
-         union caster_union
-         {
-            void *addr;
-            boost::uint32_t addr_uint32;
-         } caster;
-         caster.addr = m;
-         //memory is at least 4 byte aligned in windows
-         BOOST_ASSERT((caster.addr_uint32 & boost::uint32_t(3)) == 0);
-         max_count = caster.addr_uint32 >> 2;
-      }
-      else if(sizeof(void*) == sizeof(boost::uint64_t)){
-         //Relying in UB with a cast through union, but all known windows compilers
-         //accept this (C11 accepts this).
-         union caster_union
-         {
-            void *addr;
-            boost::uint64_t addr_uint64;
-         } caster;
-         caster.addr = m;
-         //We'll encode the address using 30 bits in each 32 bit high and low parts.
-         //High part will be the sem max count, low part will be the sem initial count.
-         //(restrictions: max count > 0, initial count >= 0 and max count >= initial count):
-         //
-         // - Low part will be shifted two times (4 byte alignment) so that top
-         //   two bits are cleared (the top one for sign, the next one to
-         //   assure low part value is always less than the high part value.
-         // - The top bit of the high part will be cleared and the next bit will be 1
-         //   (so high part is always bigger than low part due to the quasi-top bit).
-         //
-         //   This means that the addresses we can store must be 4 byte aligned
-         //   and less than 1 ExbiBytes ( 2^60 bytes, ~1 ExaByte). User-level address space in Windows 64
-         //   is much less than this (8TB, 2^43 bytes): "1 EByte (or it was 640K?) ought to be enough for anybody" ;-).
-         caster.addr = m;
-         BOOST_ASSERT((caster.addr_uint64 & boost::uint64_t(3)) == 0);
-         max_count = boost::uint32_t(caster.addr_uint64 >> 32);
-         initial_count = boost::uint32_t(caster.addr_uint64);
-         initial_count = initial_count/4;
-         //Make sure top two bits are zero
-         BOOST_ASSERT((max_count & boost::uint32_t(0xC0000000)) == 0);
-         //Set quasi-top bit
-         max_count |= boost::uint32_t(0x40000000);
-      }
-      bool created = false;
-      const permissions & perm = permissions();
-      std::string pid_creation_time, name;
-      get_pid_creation_time_str(pid_creation_time);
-      name = "bipc_gmap_sem_lock_";
-      name += pid_creation_time;
-      bool success = m_mtx_lock.open_or_create(name.c_str(), perm);
-      name = "bipc_gmap_sem_count_";
-      name += pid_creation_time;
-      scoped_lock<winapi_mutex_wrapper> lck(m_mtx_lock);
-      {
-         success = success && m_sem_count.open_or_create
-            ( name.c_str(), static_cast<long>(0), winapi_semaphore_wrapper::MaxCount, perm, created);
-         name = "bipc_gmap_sem_map_";
-         name += pid_creation_time;
-         success = success && m_sem_map.open_or_create
-            (name.c_str(), (long)initial_count, (long)max_count, perm, created);
-         if(!success){
-            delete m;
-            //winapi_xxx wrappers do the cleanup...
-            throw int(0);
-         }
-         if(!created){
-            delete m;
-         }
-         else{
-            BOOST_ASSERT(&get_map_unlocked() == m);
-         }
-         m_sem_count.post();
-      }
-   }
-
-   map_type &get_map_unlocked()
-   {
-      if(sizeof(void*) == sizeof(boost::uint32_t)){
-         union caster_union
-         {
-            void *addr;
-            boost::uint32_t addr_uint32;
-         } caster;
-         caster.addr = 0;
-         caster.addr_uint32 = boost::uint32_t(m_sem_map.limit());
-         caster.addr_uint32 = caster.addr_uint32 << 2u;
-         return *static_cast<map_type*>(caster.addr);
-      }
-      else{
-         union caster_union
-         {
-            void *addr;
-            boost::uint64_t addr_uint64;
-         } caster;
-         boost::uint32_t max_count(boost::uint32_t(m_sem_map.limit()))
-                       , initial_count(boost::uint32_t(m_sem_map.value()));
-         //Clear quasi-top bit
-         max_count &= boost::uint32_t(0xBFFFFFFF);
-         caster.addr_uint64 = max_count;
-         caster.addr_uint64 =  caster.addr_uint64 << 32u;
-         caster.addr_uint64 |= boost::uint64_t(initial_count) << 2;
-         return *static_cast<map_type*>(caster.addr);
-      }
-   }
-
-   ref_count_ptr *find(const char *name)
-   {
-      scoped_lock<winapi_mutex_wrapper> lck(m_mtx_lock);
-      map_type &map = this->get_map_unlocked();
-      map_type::iterator it = map.find(boost::container::string(name));
-      if(it != map.end()){
-         return &it->second;
-      }
-      else{
-         return 0;
-      }
-   }
-
-   ref_count_ptr * insert(const char *name, const ref_count_ptr &ref)
-   {
-      scoped_lock<winapi_mutex_wrapper> lck(m_mtx_lock);
-      map_type &map = this->get_map_unlocked();
-      map_type::iterator it = map.insert(map_type::value_type(boost::container::string(name), ref)).first;
-      return &it->second;
-   }
-
-   bool erase(const char *name)
-   {
-      scoped_lock<winapi_mutex_wrapper> lck(m_mtx_lock);
-      map_type &map = this->get_map_unlocked();
-      return map.erase(boost::container::string(name)) != 0;
-   }
-
-   template<class F>
-   void atomic_func(F &f)
-   {
-      scoped_lock<winapi_mutex_wrapper> lck(m_mtx_lock);
-      f();
-   }
-
-   ~windows_semaphore_based_map()
-   {
-      scoped_lock<winapi_mutex_wrapper> lck(m_mtx_lock);
-      m_sem_count.wait();
-      if(0 == m_sem_count.value()){
-         map_type &map = this->get_map_unlocked();
-         BOOST_ASSERT(map.empty());
-         delete &map;
-      }
-      //First close sems to protect this with the external mutex
-      m_sem_map.close();
-      m_sem_count.close();
-      //Once scoped_lock unlocks the mutex, the destructor will close the handle...
-   }
-
-   private:
-   winapi_mutex_wrapper     m_mtx_lock;
-   winapi_semaphore_wrapper m_sem_map;
-   winapi_semaphore_wrapper m_sem_count;
-};
-
-template<>
-struct thread_safe_global_map_dependant<windows_semaphore_based_map>
-{
-   static void apply_gmem_erase_logic(const char *, const char *){}
-
-   static bool remove_old_gmem()
-   { return true; }
-
-   struct lock_file_logic
-   {
-      lock_file_logic(windows_semaphore_based_map &)
-         : retry_with_new_map(false)
-      {}
-
-      void operator()(void){}
-      bool retry() const { return retry_with_new_map; }
-      private:
-      const bool retry_with_new_map;
-   };
-
-   static void construct_map(void *addr)
-   {
-      ::new (addr)windows_semaphore_based_map;
-   }
-
-   struct unlink_map_logic
-   {
-      unlink_map_logic(windows_semaphore_based_map &)
-      {}
-      void operator()(){}
-   };
-
-   static ref_count_ptr *find(windows_semaphore_based_map &map, const char *name)
-   {
-      return map.find(name);
-   }
-
-   static ref_count_ptr * insert(windows_semaphore_based_map &map, const char *name, const ref_count_ptr &ref)
-   {
-      return map.insert(name, ref);
-   }
-
-   static bool erase(windows_semaphore_based_map &map, const char *name)
-   {
-      return map.erase(name);
-   }
-
-   template<class F>
-   static void atomic_func(windows_semaphore_based_map &map, F &f)
-   {
-      map.atomic_func(f);
-   }
-};
-
-}  //namespace intermodule_singleton_helpers {
-
-template<typename C, bool LazyInit = true, bool Phoenix = false>
-class windows_intermodule_singleton
-   : public intermodule_singleton_impl
-      < C
-      , LazyInit
-      , Phoenix
-      , intermodule_singleton_helpers::windows_semaphore_based_map
-      >
-{};
-
-}  //namespace ipcdetail{
-}  //namespace interprocess{
-}  //namespace boost{
-
-#include <boost/interprocess/detail/config_end.hpp>
-
-#endif   //#ifndef BOOST_INTERPROCESS_WINDOWS_INTERMODULE_SINGLETON_HPP
diff --git a/src/boost/interprocess/detail/workaround.hpp b/src/boost/interprocess/detail/workaround.hpp
deleted file mode 100644
index 01b6c6eb..00000000
--- a/src/boost/interprocess/detail/workaround.hpp
+++ /dev/null
@@ -1,262 +0,0 @@
-//////////////////////////////////////////////////////////////////////////////
-//
-// (C) Copyright Ion Gaztanaga 2005-2015. Distributed under the Boost
-// 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/interprocess for documentation.
-//
-//////////////////////////////////////////////////////////////////////////////
-
-#ifndef BOOST_INTERPROCESS_DETAIL_WORKAROUND_HPP
-#define BOOST_INTERPROCESS_DETAIL_WORKAROUND_HPP
-
-#ifndef BOOST_CONFIG_HPP
-#  include <boost/config.hpp>
-#endif
-#
-#if defined(BOOST_HAS_PRAGMA_ONCE)
-#  pragma once
-#endif
-
-#if defined(BOOST_INTERPROCESS_FORCE_NATIVE_EMULATION) && defined(BOOST_INTERPROCESS_FORCE_GENERIC_EMULATION) 
-#error "BOOST_INTERPROCESS_FORCE_NATIVE_EMULATION && BOOST_INTERPROCESS_FORCE_GENERIC_EMULATION can't be defined at the same time"
-#endif
-
-//#define BOOST_INTERPROCESS_FORCE_NATIVE_EMULATION
-
-#if defined(_WIN32) || defined(__WIN32__) || defined(WIN32)
-   #define BOOST_INTERPROCESS_WINDOWS
-   #if !defined(BOOST_INTERPROCESS_FORCE_NATIVE_EMULATION) && !defined(BOOST_INTERPROCESS_FORCE_GENERIC_EMULATION)
-      #define BOOST_INTERPROCESS_FORCE_GENERIC_EMULATION
-   #endif
-   #define BOOST_INTERPROCESS_HAS_KERNEL_BOOTTIME
-#else
-   #include <unistd.h>
-
-   //////////////////////////////////////////////////////
-   //Check for XSI shared memory objects. They are available in nearly all UNIX platforms
-   //////////////////////////////////////////////////////
-   #if !defined(__QNXNTO__) && !defined(__ANDROID__) && !defined(__HAIKU__) && !(__VXWORKS__)
-      #define BOOST_INTERPROCESS_XSI_SHARED_MEMORY_OBJECTS
-   #endif
-
-   //////////////////////////////////////////////////////
-   // From SUSv3/UNIX 98, pthread_mutexattr_settype is mandatory
-   //////////////////////////////////////////////////////
-   #if defined(_XOPEN_UNIX) && ((_XOPEN_VERSION + 0) >= 500)
-      #define BOOST_INTERPROCESS_POSIX_RECURSIVE_MUTEXES
-   #endif
-
-   //////////////////////////////////////////////////////
-   // _POSIX_THREAD_PROCESS_SHARED (POSIX.1b/POSIX.4)
-   //////////////////////////////////////////////////////
-   #if defined(_POSIX_THREAD_PROCESS_SHARED) && ((_POSIX_THREAD_PROCESS_SHARED + 0) > 0)
-      //Cygwin defines _POSIX_THREAD_PROCESS_SHARED but does not implement it.
-      #if defined(__CYGWIN__)
-         #define BOOST_INTERPROCESS_BUGGY_POSIX_PROCESS_SHARED
-      #elif defined(__APPLE__)
-         //The pthreads implementation of darwin stores a pointer to a mutex inside the condition
-         //structure so real sharing between processes is broken. See:
-         //https://opensource.apple.com/source/libpthread/libpthread-301.30.1/src/pthread_cond.c.auto.html
-         //in method pthread_cond_wait
-         #define BOOST_INTERPROCESS_BUGGY_POSIX_PROCESS_SHARED
-      #endif
-
-      //If buggy _POSIX_THREAD_PROCESS_SHARED is detected avoid using it
-      #if defined(BOOST_INTERPROCESS_BUGGY_POSIX_PROCESS_SHARED)
-         #undef BOOST_INTERPROCESS_BUGGY_POSIX_PROCESS_SHARED
-      #else
-         #define BOOST_INTERPROCESS_POSIX_PROCESS_SHARED
-      #endif
-   #endif
-
-   //////////////////////////////////////////////////////
-   //    BOOST_INTERPROCESS_POSIX_ROBUST_MUTEXES
-   //////////////////////////////////////////////////////
-   #if (_XOPEN_SOURCE >= 700 || _POSIX_C_SOURCE >= 200809L)
-      #define BOOST_INTERPROCESS_POSIX_ROBUST_MUTEXES
-   #endif
-
-   //////////////////////////////////////////////////////
-   // _POSIX_SHARED_MEMORY_OBJECTS (POSIX.1b/POSIX.4)
-   //////////////////////////////////////////////////////
-   #if ( defined(_POSIX_SHARED_MEMORY_OBJECTS) && ((_POSIX_SHARED_MEMORY_OBJECTS + 0) > 0) ) ||\
-         (defined(__vms) && __CRTL_VER >= 70200000)
-      #define BOOST_INTERPROCESS_POSIX_SHARED_MEMORY_OBJECTS
-      //Some systems have filesystem-based resources, so the
-      //portable "/shmname" format does not work due to permission issues
-      //For those systems we need to form a path to a temporary directory:
-      //          hp-ux               tru64               vms               freebsd
-      #if defined(__hpux) || defined(__osf__) || defined(__vms) || (defined(__FreeBSD__) && (__FreeBSD__ < 7))
-         #define BOOST_INTERPROCESS_FILESYSTEM_BASED_POSIX_SHARED_MEMORY
-      //Some systems have "jailed" environments where shm usage is restricted at runtime
-      //and temporary file based shm is possible in those executions.
-      #elif defined(__FreeBSD__)
-         #define BOOST_INTERPROCESS_RUNTIME_FILESYSTEM_BASED_POSIX_SHARED_MEMORY
-      #endif
-   #endif
-
-   //////////////////////////////////////////////////////
-   // _POSIX_MAPPED_FILES (POSIX.1b/POSIX.4)
-   //////////////////////////////////////////////////////
-   #if defined(_POSIX_MAPPED_FILES) && ((_POSIX_MAPPED_FILES + 0) > 0)
-      #define BOOST_INTERPROCESS_POSIX_MAPPED_FILES
-   #endif
-
-   //////////////////////////////////////////////////////
-   // _POSIX_SEMAPHORES (POSIX.1b/POSIX.4)
-   //////////////////////////////////////////////////////
-   #if ( defined(_POSIX_SEMAPHORES) && ((_POSIX_SEMAPHORES + 0) > 0) ) ||\
-       ( defined(__FreeBSD__) && (__FreeBSD__ >= 4)) || \
-         defined(__APPLE__)
-      #define BOOST_INTERPROCESS_POSIX_NAMED_SEMAPHORES
-      //MacOsX declares _POSIX_SEMAPHORES but sem_init returns ENOSYS
-      #if !defined(__APPLE__)
-         #define BOOST_INTERPROCESS_POSIX_UNNAMED_SEMAPHORES
-      #endif
-      #if defined(__osf__) || defined(__vms)
-         #define BOOST_INTERPROCESS_FILESYSTEM_BASED_POSIX_SEMAPHORES
-      #endif
-   #endif
-
-   //////////////////////////////////////////////////////
-   // _POSIX_BARRIERS (SUSv3/Unix03)
-   //////////////////////////////////////////////////////
-   #if defined(_POSIX_BARRIERS) && ((_POSIX_BARRIERS + 0) >= 200112L)
-      #define BOOST_INTERPROCESS_POSIX_BARRIERS
-   #endif
-
-   //////////////////////////////////////////////////////
-   // _POSIX_TIMEOUTS (SUSv3/Unix03)
-   //////////////////////////////////////////////////////
-   #if defined(_POSIX_TIMEOUTS) && ((_POSIX_TIMEOUTS + 0L) >= 200112L)
-      #define BOOST_INTERPROCESS_POSIX_TIMEOUTS
-   #endif
-
-   //////////////////////////////////////////////////////
-   // Detect BSD derivatives to detect sysctl
-   //////////////////////////////////////////////////////
-   #if defined(__FreeBSD__) || defined(__NetBSD__) || defined(__OpenBSD__) || defined(__APPLE__)
-      #define BOOST_INTERPROCESS_BSD_DERIVATIVE
-      //Some *BSD systems (OpenBSD & NetBSD) need sys/param.h before sys/sysctl.h, whereas
-      //others (FreeBSD & Darwin) need sys/types.h
-      #include <sys/types.h>
-      #include <sys/param.h>
-      #include <sys/sysctl.h>
-      #if defined(CTL_KERN) && defined (KERN_BOOTTIME)
-         //#define BOOST_INTERPROCESS_HAS_KERNEL_BOOTTIME
-      #endif
-   #endif
-
-   //////////////////////////////////////////////////////
-   //64 bit offset
-   //////////////////////////////////////////////////////
-   #if (defined (_V6_ILP32_OFFBIG)  &&(_V6_ILP32_OFFBIG   - 0 > 0)) ||\
-       (defined (_V6_LP64_OFF64)    &&(_V6_LP64_OFF64     - 0 > 0)) ||\
-       (defined (_V6_LPBIG_OFFBIG)  &&(_V6_LPBIG_OFFBIG   - 0 > 0)) ||\
-       (defined (_XBS5_ILP32_OFFBIG)&&(_XBS5_ILP32_OFFBIG - 0 > 0)) ||\
-       (defined (_XBS5_LP64_OFF64)  &&(_XBS5_LP64_OFF64   - 0 > 0)) ||\
-       (defined (_XBS5_LPBIG_OFFBIG)&&(_XBS5_LPBIG_OFFBIG - 0 > 0)) ||\
-       (defined (_FILE_OFFSET_BITS) &&(_FILE_OFFSET_BITS  - 0 >= 64))||\
-       (defined (_FILE_OFFSET_BITS) &&(_FILE_OFFSET_BITS  - 0 >= 64))
-      #define BOOST_INTERPROCESS_UNIX_64_BIT_OR_BIGGER_OFF_T
-   #endif
-
-   //////////////////////////////////////////////////////
-   //posix_fallocate
-   //////////////////////////////////////////////////////
-   #if (_XOPEN_SOURCE >= 600 || _POSIX_C_SOURCE >= 200112L)
-   #define BOOST_INTERPROCESS_POSIX_FALLOCATE
-   #endif
-
-#endif   //!defined(BOOST_INTERPROCESS_WINDOWS)
-
-#if defined(BOOST_INTERPROCESS_WINDOWS) || defined(BOOST_INTERPROCESS_POSIX_MAPPED_FILES)
-#  define BOOST_INTERPROCESS_MAPPED_FILES
-#endif
-
-//Now declare some Boost.Interprocess features depending on the implementation
-#if defined(BOOST_INTERPROCESS_POSIX_NAMED_SEMAPHORES) && !defined(BOOST_INTERPROCESS_POSIX_SEMAPHORES_NO_UNLINK)
-   #define BOOST_INTERPROCESS_NAMED_MUTEX_USES_POSIX_SEMAPHORES
-   #define BOOST_INTERPROCESS_NAMED_SEMAPHORE_USES_POSIX_SEMAPHORES
-#endif
-
-#if    !defined(BOOST_NO_CXX11_RVALUE_REFERENCES) && !defined(BOOST_NO_CXX11_VARIADIC_TEMPLATES)
-   #define BOOST_INTERPROCESS_PERFECT_FORWARDING
-#endif
-
-// Timeout duration use if BOOST_INTERPROCESS_ENABLE_TIMEOUT_WHEN_LOCKING is set
-#ifndef BOOST_INTERPROCESS_TIMEOUT_WHEN_LOCKING_DURATION_MS
-   #define BOOST_INTERPROCESS_TIMEOUT_WHEN_LOCKING_DURATION_MS 10000
-#endif
-
-
-// Max open or create tries with managed memory segments
-#ifndef BOOST_INTERPROCESS_MANAGED_OPEN_OR_CREATE_INITIALIZE_MAX_TRIES
-   #define BOOST_INTERPROCESS_MANAGED_OPEN_OR_CREATE_INITIALIZE_MAX_TRIES 20u
-#endif
-
-// Maximum timeout in seconds with open or create tries with managed memory segments
-// waiting the creator to initialize the shared memory
-#ifndef BOOST_INTERPROCESS_MANAGED_OPEN_OR_CREATE_INITIALIZE_TIMEOUT_SEC
-   #define BOOST_INTERPROCESS_MANAGED_OPEN_OR_CREATE_INITIALIZE_TIMEOUT_SEC 300u
-#endif
-
-//Other switches
-//BOOST_INTERPROCESS_MSG_QUEUE_USES_CIRC_INDEX
-//message queue uses a circular queue as index instead of an array (better performance)
-//Boost version < 1.52 uses an array, so undef this if you want to communicate
-//with processes compiled with those versions.
-#define BOOST_INTERPROCESS_MSG_QUEUE_CIRCULAR_INDEX
-
-//Macros for documentation purposes. For code, expands to the argument
-#define BOOST_INTERPROCESS_IMPDEF(TYPE) TYPE
-#define BOOST_INTERPROCESS_SEEDOC(TYPE) TYPE
-#define BOOST_INTERPROCESS_DOC1ST(TYPE1, TYPE2) TYPE2
-#define BOOST_INTERPROCESS_I ,
-#define BOOST_INTERPROCESS_DOCIGN(T1) T1
-
-//#define BOOST_INTERPROCESS_DISABLE_FORCEINLINE
-
-#if defined(BOOST_INTERPROCESS_DISABLE_FORCEINLINE)
-   #define BOOST_INTERPROCESS_FORCEINLINE inline
-#elif defined(BOOST_INTERPROCESS_FORCEINLINE_IS_BOOST_FORCELINE)
-   #define BOOST_INTERPROCESS_FORCEINLINE BOOST_FORCEINLINE
-#elif defined(BOOST_MSVC) && (_MSC_VER < 1900 || defined(_DEBUG))
-   //"__forceinline" and MSVC seems to have some bugs in old versions and in debug mode
-   #define BOOST_INTERPROCESS_FORCEINLINE inline
-#elif defined(BOOST_GCC) && (__GNUC__ <= 5)
-   //Older GCCs have problems with forceinline
-   #define BOOST_INTERPROCESS_FORCEINLINE inline
-#else
-   #define BOOST_INTERPROCESS_FORCEINLINE BOOST_FORCEINLINE
-#endif
-
-#ifdef BOOST_WINDOWS
-
-#define BOOST_INTERPROCESS_WCHAR_NAMED_RESOURCES
-
-#ifdef __clang__
-   #define BOOST_INTERPROCESS_DISABLE_DEPRECATED_WARNING _Pragma("clang diagnostic push") \
-                                                         _Pragma("clang diagnostic ignored \"-Wdeprecated-declarations\"")
-   #define BOOST_INTERPROCESS_RESTORE_WARNING            _Pragma("clang diagnostic pop")
-#else // __clang__
-   #define BOOST_INTERPROCESS_DISABLE_DEPRECATED_WARNING __pragma(warning(push)) \
-                                                         __pragma(warning(disable : 4996))
-   #define BOOST_INTERPROCESS_RESTORE_WARNING            __pragma(warning(pop))
-#endif // __clang__
-
-#endif
-
-#if defined(BOOST_HAS_THREADS) 
-#  if defined(_MSC_VER) || defined(__MWERKS__) || defined(__MINGW32__) ||  defined(__BORLANDC__)
-     //no reentrant posix functions (eg: localtime_r)
-#  elif (!defined(__hpux) || (defined(__hpux) && defined(_REENTRANT)))
-#   define BOOST_INTERPROCESS_HAS_REENTRANT_STD_FUNCTIONS
-#  endif
-#endif
-
-#include <boost/core/no_exceptions_support.hpp>
-
-#endif   //#ifndef BOOST_INTERPROCESS_DETAIL_WORKAROUND_HPP
diff --git a/src/boost/interprocess/errors.hpp b/src/boost/interprocess/errors.hpp
deleted file mode 100644
index 95bca55a..00000000
--- a/src/boost/interprocess/errors.hpp
+++ /dev/null
@@ -1,246 +0,0 @@
-//////////////////////////////////////////////////////////////////////////////
-//
-// (C) Copyright Ion Gaztanaga 2005-2012. Distributed under the Boost
-// 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/interprocess for documentation.
-//
-// Parts of this code are taken from boost::filesystem library
-//
-//////////////////////////////////////////////////////////////////////////////
-//
-//  Copyright (C) 2002 Beman Dawes
-//  Copyright (C) 2001 Dietmar Kuehl
-//  Use, modification, and distribution is subject to the Boost Software
-//  License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy
-//  at http://www.boost.org/LICENSE_1_0.txt)
-//
-//  See library home page at http://www.boost.org/libs/filesystem
-//
-//////////////////////////////////////////////////////////////////////////////
-
-
-#ifndef BOOST_INTERPROCESS_ERRORS_HPP
-#define BOOST_INTERPROCESS_ERRORS_HPP
-
-#ifndef BOOST_CONFIG_HPP
-#  include <boost/config.hpp>
-#endif
-#
-#if defined(BOOST_HAS_PRAGMA_ONCE)
-#  pragma once
-#endif
-
-#include <boost/interprocess/detail/config_begin.hpp>
-#include <boost/interprocess/detail/workaround.hpp>
-#include <string>
-
-#if defined (BOOST_INTERPROCESS_WINDOWS)
-#  include <boost/interprocess/detail/win32_api.hpp>
-#else
-#  ifdef BOOST_HAS_UNISTD_H
-#    include <cerrno>         //Errors
-#    include <cstring>        //strerror
-#  else  //ifdef BOOST_HAS_UNISTD_H
-#    error Unknown platform
-#  endif //ifdef BOOST_HAS_UNISTD_H
-#endif   //#if defined (BOOST_INTERPROCESS_WINDOWS)
-
-//!\file
-//!Describes the error numbering of interprocess classes
-
-namespace boost {
-namespace interprocess {
-#if !defined(BOOST_INTERPROCESS_DOXYGEN_INVOKED)
-inline int system_error_code() // artifact of POSIX and WINDOWS error reporting
-{
-   #if defined (BOOST_INTERPROCESS_WINDOWS)
-   return (int)winapi::get_last_error();
-   #else
-   return errno; // GCC 3.1 won't accept ::errno
-   #endif
-}
-
-
-#if defined (BOOST_INTERPROCESS_WINDOWS)
-inline void fill_system_message(int sys_err_code, std::string &str)
-{
-   void *lpMsgBuf;
-   unsigned long ret = winapi::format_message(
-      winapi::format_message_allocate_buffer |
-      winapi::format_message_from_system |
-      winapi::format_message_ignore_inserts,
-      0,
-      (unsigned long)sys_err_code,
-      winapi::make_lang_id(winapi::lang_neutral, winapi::sublang_default), // Default language
-      reinterpret_cast<char *>(&lpMsgBuf),
-      0,
-      0
-   );
-   if (ret != 0){
-      str += static_cast<const char*>(lpMsgBuf);
-      winapi::local_free( lpMsgBuf ); // free the buffer
-      while ( str.size()
-         && (str[str.size()-1] == '\n' || str[str.size()-1] == '\r') )
-         str.erase( str.size()-1 );
-   }
-   else{
-      str += "WinApi FormatMessage returned error";
-   }
-}
-# else
-inline void fill_system_message( int system_error, std::string &str)
-{  str = std::strerror(system_error);  }
-# endif
-#endif   //#ifndef BOOST_INTERPROCESS_DOXYGEN_INVOKED
-
-enum error_code_t
-{
-   no_error = 0,
-   system_error,     // system generated error; if possible, is translated
-                     // to one of the more specific errors below.
-   other_error,      // library generated error
-   security_error,   // includes access rights, permissions failures
-   read_only_error,
-   io_error,
-   path_error,
-   not_found_error,
-//   not_directory_error,
-   busy_error,       // implies trying again might succeed
-   already_exists_error,
-   not_empty_error,
-   is_directory_error,
-   out_of_space_error,
-   out_of_memory_error,
-   out_of_resource_error,
-   lock_error,
-   sem_error,
-   mode_error,
-   size_error,
-   corrupted_error,
-   not_such_file_or_directory,
-   invalid_argument,
-   timeout_when_locking_error,
-   timeout_when_waiting_error,
-   owner_dead_error,
-   not_recoverable
-};
-
-typedef int    native_error_t;
-
-#if !defined(BOOST_INTERPROCESS_DOXYGEN_INVOKED)
-struct ec_xlate
-{
-   native_error_t sys_ec;
-   error_code_t   ec;
-};
-
-static const ec_xlate ec_table[] =
-{
-   #if defined (BOOST_INTERPROCESS_WINDOWS)
-   { /*ERROR_ACCESS_DENIED*/5L, security_error },
-   { /*ERROR_INVALID_ACCESS*/12L, security_error },
-   { /*ERROR_SHARING_VIOLATION*/32L, security_error },
-   { /*ERROR_LOCK_VIOLATION*/33L, security_error },
-   { /*ERROR_LOCKED*/212L, security_error },
-   { /*ERROR_NOACCESS*/998L, security_error },
-   { /*ERROR_WRITE_PROTECT*/19L, read_only_error },
-   { /*ERROR_NOT_READY*/21L, io_error },
-   { /*ERROR_SEEK*/25L, io_error },
-   { /*ERROR_READ_FAULT*/30L, io_error },
-   { /*ERROR_WRITE_FAULT*/29L, io_error },
-   { /*ERROR_CANTOPEN*/1011L, io_error },
-   { /*ERROR_CANTREAD*/1012L, io_error },
-   { /*ERROR_CANTWRITE*/1013L, io_error },
-   { /*ERROR_DIRECTORY*/267L, path_error },
-   { /*ERROR_INVALID_NAME*/123L, path_error },
-   { /*ERROR_FILE_NOT_FOUND*/2L, not_found_error },
-   { /*ERROR_PATH_NOT_FOUND*/3L, not_found_error },
-   { /*ERROR_DEV_NOT_EXIST*/55L, not_found_error },
-   { /*ERROR_DEVICE_IN_USE*/2404L, busy_error },
-   { /*ERROR_OPEN_FILES*/2401L, busy_error },
-   { /*ERROR_BUSY_DRIVE*/142L, busy_error },
-   { /*ERROR_BUSY*/170L, busy_error },
-   { /*ERROR_FILE_EXISTS*/80L, already_exists_error },
-   { /*ERROR_ALREADY_EXISTS*/183L, already_exists_error },
-   { /*ERROR_DIR_NOT_EMPTY*/145L, not_empty_error },
-   { /*ERROR_HANDLE_DISK_FULL*/39L, out_of_space_error },
-   { /*ERROR_DISK_FULL*/112L, out_of_space_error },
-   { /*ERROR_OUTOFMEMORY*/14L, out_of_memory_error },
-   { /*ERROR_NOT_ENOUGH_MEMORY*/8L, out_of_memory_error },
-   { /*ERROR_TOO_MANY_OPEN_FILES*/4L, out_of_resource_error },
-   { /*ERROR_INVALID_ADDRESS*/487L, busy_error }
-   #else    //#if defined (BOOST_INTERPROCESS_WINDOWS)
-   { EACCES, security_error },
-   { EROFS, read_only_error },
-   { EIO, io_error },
-   { ENAMETOOLONG, path_error },
-   { ENOENT, not_found_error },
-   //    { ENOTDIR, not_directory_error },
-   { EAGAIN, busy_error },
-   { EBUSY, busy_error },
-   { ETXTBSY, busy_error },
-   { EEXIST, already_exists_error },
-   { ENOTEMPTY, not_empty_error },
-   { EISDIR, is_directory_error },
-   { ENOSPC, out_of_space_error },
-   { ENOMEM, out_of_memory_error },
-   { EMFILE, out_of_resource_error },
-   { ENOENT, not_such_file_or_directory },
-   { EINVAL, invalid_argument }
-   #endif   //#if defined (BOOST_INTERPROCESS_WINDOWS)
-};
-
-inline error_code_t lookup_error(native_error_t err)
-{
-   const ec_xlate *cur  = &ec_table[0],
-                  *end  = cur + sizeof(ec_table)/sizeof(ec_xlate);
-   for  (;cur != end; ++cur ){
-      if ( err == cur->sys_ec ) return cur->ec;
-   }
-   return system_error; // general system error code
-}
-
-struct error_info
-{
-   error_info(error_code_t ec = other_error )
-      :  m_nat(0), m_ec(ec)
-   {}
-
-   error_info(native_error_t sys_err_code)
-      :  m_nat(sys_err_code), m_ec(lookup_error(sys_err_code))
-   {}
-
-   error_info & operator =(error_code_t ec)
-   {
-      m_nat = 0;
-      m_ec = ec;
-      return *this;
-   }
-
-   error_info & operator =(native_error_t sys_err_code)
-   {
-      m_nat = sys_err_code;
-      m_ec = lookup_error(sys_err_code);
-      return *this;
-   }
-
-   native_error_t get_native_error()const
-   {  return m_nat;  }
-
-   error_code_t   get_error_code()const
-   {  return m_ec;  }
-
-   private:
-   native_error_t m_nat;
-   error_code_t   m_ec;
-};
-#endif   //#ifndef BOOST_INTERPROCESS_DOXYGEN_INVOKED
-
-}  // namespace interprocess {
-}  // namespace boost
-
-#include <boost/interprocess/detail/config_end.hpp>
-
-#endif // BOOST_INTERPROCESS_ERRORS_HPP
diff --git a/src/boost/interprocess/exceptions.hpp b/src/boost/interprocess/exceptions.hpp
deleted file mode 100644
index 3eeb9f6e..00000000
--- a/src/boost/interprocess/exceptions.hpp
+++ /dev/null
@@ -1,111 +0,0 @@
-//////////////////////////////////////////////////////////////////////////////
-//
-// (C) Copyright Ion Gaztanaga 2005-2015. Distributed under the Boost
-// 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/interprocess for documentation.
-//
-//////////////////////////////////////////////////////////////////////////////
-
-#ifndef BOOST_INTERPROCESS_EXCEPTIONS_HPP
-#define BOOST_INTERPROCESS_EXCEPTIONS_HPP
-
-#ifndef BOOST_CONFIG_HPP
-#  include <boost/config.hpp>
-#endif
-#
-#if defined(BOOST_HAS_PRAGMA_ONCE)
-#  pragma once
-#endif
-
-#include <boost/interprocess/detail/config_begin.hpp>
-#include <boost/interprocess/detail/workaround.hpp>
-#include <boost/interprocess/errors.hpp>
-#include <stdexcept>
-
-//!\file
-//!Describes exceptions thrown by interprocess classes
-
-namespace boost {
-
-namespace interprocess {
-
-//!This class is the base class of all exceptions
-//!thrown by boost::interprocess
-class BOOST_SYMBOL_VISIBLE interprocess_exception : public std::exception
-{
-   public:
-   interprocess_exception(const char *err) BOOST_NOEXCEPT
-      :  m_err(other_error)
-   {
-      BOOST_TRY   {  m_str = err; }
-      BOOST_CATCH(...) {} BOOST_CATCH_END
-   }
-
-   interprocess_exception(const error_info &err_info, const char *str = 0)
-      :  m_err(err_info)
-   {
-      BOOST_TRY{
-         if(m_err.get_native_error() != 0){
-            fill_system_message(m_err.get_native_error(), m_str);
-         }
-         else if(str){
-            m_str = str;
-         }
-         else{
-            m_str = "boost::interprocess_exception::library_error";
-         }
-      }
-      BOOST_CATCH(...){} BOOST_CATCH_END
-   }
-
-   ~interprocess_exception() BOOST_NOEXCEPT_OR_NOTHROW BOOST_OVERRIDE {}
-
-   const char * what() const BOOST_NOEXCEPT_OR_NOTHROW BOOST_OVERRIDE
-   {  return m_str.c_str();  }
-
-   native_error_t get_native_error() const BOOST_NOEXCEPT { return m_err.get_native_error(); }
-
-   // Note: a value of other_error implies a library (rather than system) error
-   error_code_t   get_error_code()  const BOOST_NOEXCEPT { return m_err.get_error_code(); }
-
-   #if !defined(BOOST_INTERPROCESS_DOXYGEN_INVOKED)
-   private:
-   error_info        m_err;
-   std::string       m_str;
-   #endif   //#ifndef BOOST_INTERPROCESS_DOXYGEN_INVOKED
-};
-
-//!This is the exception thrown by shared interprocess_mutex family when a deadlock situation
-//!is detected or when using a interprocess_condition the interprocess_mutex is not locked
-class BOOST_SYMBOL_VISIBLE lock_exception : public interprocess_exception
-{
-   public:
-   lock_exception(error_code_t err = lock_error) BOOST_NOEXCEPT
-      :  interprocess_exception(err)
-   {}
-
-   const char* what() const BOOST_NOEXCEPT_OR_NOTHROW BOOST_OVERRIDE
-   {  return "boost::interprocess::lock_exception";  }
-};
-
-
-//!This exception is thrown when a memory request can't be
-//!fulfilled.
-class BOOST_SYMBOL_VISIBLE bad_alloc : public interprocess_exception
-{
- public:
-   bad_alloc() : interprocess_exception("::boost::interprocess::bad_alloc") {}
-
-   const char* what() const BOOST_NOEXCEPT_OR_NOTHROW BOOST_OVERRIDE
-   {  return "boost::interprocess::bad_alloc";  }
-};
-
-}  // namespace interprocess {
-
-}  // namespace boost
-
-#include <boost/interprocess/detail/config_end.hpp>
-
-#endif // BOOST_INTERPROCESS_EXCEPTIONS_HPP
diff --git a/src/boost/interprocess/indexes/iset_index.hpp b/src/boost/interprocess/indexes/iset_index.hpp
deleted file mode 100644
index ffaa24fa..00000000
--- a/src/boost/interprocess/indexes/iset_index.hpp
+++ /dev/null
@@ -1,158 +0,0 @@
-//////////////////////////////////////////////////////////////////////////////
-//
-// (C) Copyright Ion Gaztanaga 2005-2012. Distributed under the Boost
-// 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/interprocess for documentation.
-//
-//////////////////////////////////////////////////////////////////////////////
-
-#ifndef BOOST_INTERPROCESS_ISET_INDEX_HPP
-#define BOOST_INTERPROCESS_ISET_INDEX_HPP
-
-#ifndef BOOST_CONFIG_HPP
-#  include <boost/config.hpp>
-#endif
-#
-#if defined(BOOST_HAS_PRAGMA_ONCE)
-#  pragma once
-#endif
-
-#include <boost/interprocess/detail/config_begin.hpp>
-#include <boost/interprocess/detail/workaround.hpp>
-
-#include <boost/intrusive/detail/minimal_pair_header.hpp>
-#include <boost/interprocess/detail/utilities.hpp>
-#include <boost/intrusive/detail/minimal_pair_header.hpp>         //std::pair
-#include <boost/intrusive/detail/minimal_less_equal_header.hpp>   //std::less
-#include <boost/container/detail/minimal_char_traits_header.hpp>  //std::char_traits
-#include <boost/intrusive/set.hpp>
-
-//!\file
-//!Describes index adaptor of boost::intrusive::set container, to use it
-//!as name/shared memory index
-
-namespace boost {
-namespace interprocess {
-
-#if !defined(BOOST_INTERPROCESS_DOXYGEN_INVOKED)
-
-//!Helper class to define typedefs from IndexTraits
-template <class MapConfig>
-struct iset_index_aux
-{
-   typedef typename
-      MapConfig::segment_manager_base                          segment_manager_base;
-
-   typedef typename
-      segment_manager_base::void_pointer                       void_pointer;
-   typedef typename bi::make_set_base_hook
-      < bi::void_pointer<void_pointer>
-      , bi::optimize_size<true>
-      >::type                                                  derivation_hook;
-
-   typedef typename MapConfig::template
-      intrusive_value_type<derivation_hook>::type              value_type;
-   typedef std::less<value_type>                               value_compare;
-   typedef typename bi::make_set
-      < value_type
-      , bi::base_hook<derivation_hook>
-      >::type                                                  index_t;
-};
-#endif   //#ifndef BOOST_INTERPROCESS_DOXYGEN_INVOKED
-
-//!Index type based in boost::intrusive::set.
-//!Just derives from boost::intrusive::set
-//!and defines the interface needed by managed memory segments*/
-template <class MapConfig>
-class iset_index
-   //Derive class from map specialization
-   :  public iset_index_aux<MapConfig>::index_t
-{
-   #if !defined(BOOST_INTERPROCESS_DOXYGEN_INVOKED)
-   typedef iset_index_aux<MapConfig>                     index_aux;
-   typedef typename index_aux::index_t                   index_type;
-   typedef typename MapConfig::
-      intrusive_compare_key_type                         intrusive_compare_key_type;
-   typedef typename MapConfig::char_type                 char_type;
-   #endif   //#ifndef BOOST_INTERPROCESS_DOXYGEN_INVOKED
-
-   public:
-   typedef typename index_type::iterator                 iterator;
-   typedef typename index_type::const_iterator           const_iterator;
-   typedef typename index_type::insert_commit_data       insert_commit_data;
-   typedef typename index_type::value_type               value_type;
-
-   #if !defined(BOOST_INTERPROCESS_DOXYGEN_INVOKED)
-   private:
-
-   struct intrusive_key_value_less
-   {
-      bool operator()(const intrusive_compare_key_type &i, const value_type &b) const
-      {
-         std::size_t blen = b.name_length();
-         return (i.m_len < blen) ||
-                  (i.m_len == blen &&
-                  std::char_traits<char_type>::compare
-                     (i.mp_str, b.name(), i.m_len) < 0);
-      }
-
-      bool operator()(const value_type &b, const intrusive_compare_key_type &i) const
-      {
-         std::size_t blen = b.name_length();
-         return (blen < i.m_len) ||
-                  (blen == i.m_len &&
-                  std::char_traits<char_type>::compare
-                     (b.name(), i.mp_str, i.m_len) < 0);
-      }
-   };
-
-   #endif   //#ifndef BOOST_INTERPROCESS_DOXYGEN_INVOKED
-
-   public:
-
-   //!Constructor. Takes a pointer to the
-   //!segment manager. Can throw
-   iset_index(typename MapConfig::segment_manager_base *)
-      : index_type(/*typename index_aux::value_compare()*/)
-   {}
-
-   //!This reserves memory to optimize the insertion of n
-   //!elements in the index
-   void reserve(typename MapConfig::segment_manager_base::size_type)
-   {  /*Does nothing, map has not reserve or rehash*/  }
-
-   //!This frees all unnecessary memory
-   void shrink_to_fit()
-   {  /*Does nothing, this intrusive index does not allocate memory;*/   }
-
-   iterator find(const intrusive_compare_key_type &key)
-   {  return index_type::find(key, intrusive_key_value_less());  }
-
-   const_iterator find(const intrusive_compare_key_type &key) const
-   {  return index_type::find(key, intrusive_key_value_less());  }
-
-   std::pair<iterator, bool>insert_check
-      (const intrusive_compare_key_type &key, insert_commit_data &commit_data)
-   {  return index_type::insert_check(key, intrusive_key_value_less(), commit_data); }
-};
-
-#if !defined(BOOST_INTERPROCESS_DOXYGEN_INVOKED)
-
-//!Trait class to detect if an index is an intrusive
-//!index.
-template<class MapConfig>
-struct is_intrusive_index
-   <boost::interprocess::iset_index<MapConfig> >
-{
-   static const bool value = true;
-};
-#endif   //#ifndef BOOST_INTERPROCESS_DOXYGEN_INVOKED
-
-}  //namespace interprocess {
-}  //namespace boost
-
-#include <boost/interprocess/detail/config_end.hpp>
-
-#endif   //#ifndef BOOST_INTERPROCESS_ISET_INDEX_HPP
diff --git a/src/boost/interprocess/interprocess_fwd.hpp b/src/boost/interprocess/interprocess_fwd.hpp
deleted file mode 100644
index 882256e9..00000000
--- a/src/boost/interprocess/interprocess_fwd.hpp
+++ /dev/null
@@ -1,516 +0,0 @@
-//////////////////////////////////////////////////////////////////////////////
-//
-// (C) Copyright Ion Gaztanaga 2005-2012. Distributed under the Boost
-// 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/interprocess for documentation.
-//
-//////////////////////////////////////////////////////////////////////////////
-
-#ifndef BOOST_INTERPROCESS_FWD_HPP
-#define BOOST_INTERPROCESS_FWD_HPP
-
-#ifndef BOOST_CONFIG_HPP
-#  include <boost/config.hpp>
-#endif
-#ifndef BOOST_CSTDINT_HPP
-#  include <boost/cstdint.hpp>
-#endif
-#
-#if defined(BOOST_HAS_PRAGMA_ONCE)
-#  pragma once
-#endif
-
-#include <boost/interprocess/detail/std_fwd.hpp>
-
-//! \file
-//! This header file forward declares the basic interprocess types:
-//!   - boost::interprocess::offset_ptr;
-//!   - boost::interprocess::permissions;
-//!   - boost::interprocess::mapped_region;
-//!   - boost::interprocess::file_mapping;
-//!   - boost::interprocess::shared_memory_object;
-//!   - boost::interprocess::windows_shared_memory;
-//!   - boost::interprocess::xsi_shared_memory;
-//!
-//! The following synchronization mechanisms and locks:
-//!   - boost::interprocess::null_mutex;
-//!   - boost::interprocess::interprocess_mutex;
-//!   - boost::interprocess::interprocess_recursive_mutex;
-//!   - boost::interprocess::interprocess_semaphore;
-//!   - boost::interprocess::named_mutex;
-//!   - boost::interprocess::named_recursive_mutex;
-//!   - boost::interprocess::named_semaphore;
-//!   - boost::interprocess::interprocess_sharable_mutex;
-//!   - boost::interprocess::interprocess_condition;
-//!   - boost::interprocess::scoped_lock;
-//!   - boost::interprocess::sharable_lock;
-//!   - boost::interprocess::upgradable_lock;
-//!
-//! The following mutex families:
-//!   - boost::interprocess::mutex_family;
-//!   - boost::interprocess::null_mutex_family;
-//!
-//! The following allocators:
-//!   - boost::interprocess::allocator;
-//!   - boost::interprocess::node_allocator;
-//!   - boost::interprocess::private_node_allocator;
-//!   - boost::interprocess::cached_node_allocator;
-//!   - boost::interprocess::adaptive_pool;
-//!   - boost::interprocess::private_adaptive_pool;
-//!   - boost::interprocess::cached_adaptive_pool;
-//!
-//! The following allocation algorithms:
-//!   - boost::interprocess::simple_seq_fit;
-//!   - boost::interprocess::rbtree_best_fit;
-//!
-//! The following index types:
-//!   - boost::interprocess::flat_map_index;
-//!   - boost::interprocess::iset_index;
-//!   - boost::interprocess::iunordered_set_index;
-//!   - boost::interprocess::map_index;
-//!   - boost::interprocess::null_index;
-//!   - boost::interprocess::unordered_map_index;
-//!
-//! The following managed memory types:
-//!   - boost::interprocess::segment_manager;
-//!   - boost::interprocess::basic_managed_external_buffer
-//!   - boost::interprocess::managed_external_buffer
-//!   - boost::interprocess::wmanaged_external_buffer
-//!   - boost::interprocess::basic_managed_shared_memory
-//!   - boost::interprocess::managed_shared_memory
-//!   - boost::interprocess::wmanaged_shared_memory
-//!   - boost::interprocess::basic_managed_windows_shared_memory
-//!   - boost::interprocess::managed_windows_shared_memory
-//!   - boost::interprocess::wmanaged_windows_shared_memory
-//!   - boost::interprocess::basic_managed_xsi_shared_memory
-//!   - boost::interprocess::managed_xsi_shared_memory
-//!   - boost::interprocess::wmanaged_xsi_shared_memory
-//!   - boost::interprocess::fixed_managed_shared_memory
-//!   - boost::interprocess::wfixed_managed_shared_memory
-//!   - boost::interprocess::basic_managed_heap_memory
-//!   - boost::interprocess::managed_heap_memory
-//!   - boost::interprocess::wmanaged_heap_memory
-//!   - boost::interprocess::basic_managed_mapped_file
-//!   - boost::interprocess::managed_mapped_file
-//!   - boost::interprocess::wmanaged_mapped_file
-//!
-//! The following exception types:
-//!   - boost::interprocess::interprocess_exception
-//!   - boost::interprocess::lock_exception
-//!   - boost::interprocess::bad_alloc
-//!
-//! The following stream types:
-//!   - boost::interprocess::basic_bufferbuf
-//!   - boost::interprocess::basic_ibufferstream
-//!   - boost::interprocess::basic_obufferstream
-//!   - boost::interprocess::basic_bufferstream
-//!   - boost::interprocess::basic_vectorbuf
-//!   - boost::interprocess::basic_ivectorstream
-//!   - boost::interprocess::basic_ovectorstream
-//!   - boost::interprocess::basic_vectorstream
-//!
-//! The following smart pointer types:
-//!   - boost::interprocess::scoped_ptr
-//!   - boost::interprocess::intrusive_ptr
-//!   - boost::interprocess::shared_ptr
-//!   - boost::interprocess::weak_ptr
-//!
-//! The following interprocess communication types:
-//!   - boost::interprocess::message_queue_t;
-//!   - boost::interprocess::message_queue;
-
-#include <boost/interprocess/detail/config_begin.hpp>
-#include <boost/interprocess/detail/workaround.hpp>
-
-#if !defined(BOOST_INTERPROCESS_DOXYGEN_INVOKED)
-
-#include <cstddef>
-
-//////////////////////////////////////////////////////////////////////////////
-//                        Standard predeclarations
-//////////////////////////////////////////////////////////////////////////////
-
-namespace boost{  namespace intrusive{ }  }
-namespace boost{  namespace interprocess{ namespace bi = boost::intrusive; }  }
-
-namespace boost { namespace interprocess {
-
-//////////////////////////////////////////////////////////////////////////////
-//                            permissions
-//////////////////////////////////////////////////////////////////////////////
-
-class permissions;
-
-//////////////////////////////////////////////////////////////////////////////
-//                            shared_memory
-//////////////////////////////////////////////////////////////////////////////
-
-class shared_memory_object;
-
-#if defined (BOOST_INTERPROCESS_WINDOWS)
-class windows_shared_memory;
-#endif   //#if defined (BOOST_INTERPROCESS_WINDOWS)
-
-#if defined(BOOST_INTERPROCESS_XSI_SHARED_MEMORY_OBJECTS)
-class xsi_shared_memory;
-#endif   //#if defined (BOOST_INTERPROCESS_WINDOWS)
-
-//////////////////////////////////////////////////////////////////////////////
-//              file mapping / mapped region
-//////////////////////////////////////////////////////////////////////////////
-
-class file_mapping;
-class mapped_region;
-
-//////////////////////////////////////////////////////////////////////////////
-//                               Mutexes
-//////////////////////////////////////////////////////////////////////////////
-
-class null_mutex;
-
-class interprocess_mutex;
-class interprocess_recursive_mutex;
-
-class named_mutex;
-class named_recursive_mutex;
-
-class interprocess_semaphore;
-class named_semaphore;
-
-//////////////////////////////////////////////////////////////////////////////
-//                         Mutex families
-//////////////////////////////////////////////////////////////////////////////
-
-struct mutex_family;
-struct null_mutex_family;
-
-//////////////////////////////////////////////////////////////////////////////
-//                   Other synchronization classes
-//////////////////////////////////////////////////////////////////////////////
-
-class interprocess_sharable_mutex;
-class interprocess_condition;
-
-//////////////////////////////////////////////////////////////////////////////
-//                              Locks
-//////////////////////////////////////////////////////////////////////////////
-
-template <class Mutex>
-class scoped_lock;
-
-template <class SharableMutex>
-class sharable_lock;
-
-template <class UpgradableMutex>
-class upgradable_lock;
-
-//////////////////////////////////////////////////////////////////////////////
-//                      STL compatible allocators
-//////////////////////////////////////////////////////////////////////////////
-
-template<class T, class SegmentManager>
-class allocator;
-
-template<class T, class SegmentManager, std::size_t NodesPerBlock = 64>
-class node_allocator;
-
-template<class T, class SegmentManager, std::size_t NodesPerBlock = 64>
-class private_node_allocator;
-
-template<class T, class SegmentManager, std::size_t NodesPerBlock = 64>
-class cached_node_allocator;
-
-template< class T, class SegmentManager, std::size_t NodesPerBlock = 64
-        , std::size_t MaxFreeBlocks = 2, unsigned char OverheadPercent = 5 >
-class adaptive_pool;
-
-template< class T, class SegmentManager, std::size_t NodesPerBlock = 64
-        , std::size_t MaxFreeBlocks = 2, unsigned char OverheadPercent = 5 >
-class private_adaptive_pool;
-
-template< class T, class SegmentManager, std::size_t NodesPerBlock = 64
-        , std::size_t MaxFreeBlocks = 2, unsigned char OverheadPercent = 5 >
-class cached_adaptive_pool;
-
-
-//////////////////////////////////////////////////////////////////////////////
-//                            offset_ptr
-//////////////////////////////////////////////////////////////////////////////
-
-static const std::size_t offset_type_alignment = 0;
-
-#if !defined(BOOST_INTERPROCESS_DOXYGEN_INVOKED)
-#  ifdef BOOST_HAS_INTPTR_T
-      using ::boost::uintptr_t;
-#  else
-      typedef std::size_t uintptr_t;
-#  endif
-#endif
-
-template < class T, class DifferenceType = std::ptrdiff_t
-         , class OffsetType = uintptr_t, std::size_t Alignment = offset_type_alignment>
-class offset_ptr;
-
-//////////////////////////////////////////////////////////////////////////////
-//                    Memory allocation algorithms
-//////////////////////////////////////////////////////////////////////////////
-
-//Single segment memory allocation algorithms
-template<class MutexFamily, class VoidMutex = offset_ptr<void> >
-class simple_seq_fit;
-
-template<class MutexFamily, class VoidMutex = offset_ptr<void>, std::size_t MemAlignment = 0>
-class rbtree_best_fit;
-
-//////////////////////////////////////////////////////////////////////////////
-//                         Index Types
-//////////////////////////////////////////////////////////////////////////////
-
-template<class IndexConfig> class flat_map_index;
-template<class IndexConfig> class iset_index;
-template<class IndexConfig> class iunordered_set_index;
-template<class IndexConfig> class map_index;
-template<class IndexConfig> class null_index;
-template<class IndexConfig> class unordered_map_index;
-
-//////////////////////////////////////////////////////////////////////////////
-//                         Segment manager
-//////////////////////////////////////////////////////////////////////////////
-
-template <class CharType
-         ,class MemoryAlgorithm
-         ,template<class IndexConfig> class IndexType>
-class segment_manager;
-
-//////////////////////////////////////////////////////////////////////////////
-//                  External buffer managed memory classes
-//////////////////////////////////////////////////////////////////////////////
-
-template <class CharType
-         ,class MemoryAlgorithm
-         ,template<class IndexConfig> class IndexType>
-class basic_managed_external_buffer;
-
-typedef basic_managed_external_buffer
-   <char
-   ,rbtree_best_fit<null_mutex_family>
-   ,iset_index>
-managed_external_buffer;
-
-typedef basic_managed_external_buffer
-   <wchar_t
-   ,rbtree_best_fit<null_mutex_family>
-   ,iset_index>
-wmanaged_external_buffer;
-
-//////////////////////////////////////////////////////////////////////////////
-//                      managed memory classes
-//////////////////////////////////////////////////////////////////////////////
-
-template <class CharType
-         ,class MemoryAlgorithm
-         ,template<class IndexConfig> class IndexType>
-class basic_managed_shared_memory;
-
-typedef basic_managed_shared_memory
-   <char
-   ,rbtree_best_fit<mutex_family>
-   ,iset_index>
-managed_shared_memory;
-
-typedef basic_managed_shared_memory
-   <wchar_t
-   ,rbtree_best_fit<mutex_family>
-   ,iset_index>
-wmanaged_shared_memory;
-
-
-//////////////////////////////////////////////////////////////////////////////
-//                      Windows shared memory managed memory classes
-//////////////////////////////////////////////////////////////////////////////
-
-#if defined (BOOST_INTERPROCESS_WINDOWS)
-
-template <class CharType
-         ,class MemoryAlgorithm
-         ,template<class IndexConfig> class IndexType>
-class basic_managed_windows_shared_memory;
-
-typedef basic_managed_windows_shared_memory
-   <char
-   ,rbtree_best_fit<mutex_family>
-   ,iset_index>
-managed_windows_shared_memory;
-
-typedef basic_managed_windows_shared_memory
-   <wchar_t
-   ,rbtree_best_fit<mutex_family>
-   ,iset_index>
-wmanaged_windows_shared_memory;
-
-#endif   //#if defined (BOOST_INTERPROCESS_WINDOWS)
-
-#if defined(BOOST_INTERPROCESS_XSI_SHARED_MEMORY_OBJECTS)
-
-template <class CharType
-         ,class MemoryAlgorithm
-         ,template<class IndexConfig> class IndexType>
-class basic_managed_xsi_shared_memory;
-
-typedef basic_managed_xsi_shared_memory
-   <char
-   ,rbtree_best_fit<mutex_family>
-   ,iset_index>
-managed_xsi_shared_memory;
-
-typedef basic_managed_xsi_shared_memory
-   <wchar_t
-   ,rbtree_best_fit<mutex_family>
-   ,iset_index>
-wmanaged_xsi_shared_memory;
-
-#endif //#if defined(BOOST_INTERPROCESS_XSI_SHARED_MEMORY_OBJECTS)
-
-//////////////////////////////////////////////////////////////////////////////
-//                      Fixed address shared memory
-//////////////////////////////////////////////////////////////////////////////
-
-typedef basic_managed_shared_memory
-   <char
-   ,rbtree_best_fit<mutex_family, void*>
-   ,iset_index>
-fixed_managed_shared_memory;
-
-typedef basic_managed_shared_memory
-   <wchar_t
-   ,rbtree_best_fit<mutex_family, void*>
-   ,iset_index>
-wfixed_managed_shared_memory;
-
-//////////////////////////////////////////////////////////////////////////////
-//                      Heap memory managed memory classes
-//////////////////////////////////////////////////////////////////////////////
-
-template
-   <class CharType
-   ,class MemoryAlgorithm
-   ,template<class IndexConfig> class IndexType>
-class basic_managed_heap_memory;
-
-typedef basic_managed_heap_memory
-   <char
-   ,rbtree_best_fit<null_mutex_family>
-   ,iset_index>
-managed_heap_memory;
-
-typedef basic_managed_heap_memory
-   <wchar_t
-   ,rbtree_best_fit<null_mutex_family>
-   ,iset_index>
-wmanaged_heap_memory;
-
-//////////////////////////////////////////////////////////////////////////////
-//                         Mapped file managed memory classes
-//////////////////////////////////////////////////////////////////////////////
-
-template
-   <class CharType
-   ,class MemoryAlgorithm
-   ,template<class IndexConfig> class IndexType>
-class basic_managed_mapped_file;
-
-typedef basic_managed_mapped_file
-   <char
-   ,rbtree_best_fit<mutex_family>
-   ,iset_index>
-managed_mapped_file;
-
-typedef basic_managed_mapped_file
-   <wchar_t
-   ,rbtree_best_fit<mutex_family>
-   ,iset_index>
-wmanaged_mapped_file;
-
-//////////////////////////////////////////////////////////////////////////////
-//                            Exceptions
-//////////////////////////////////////////////////////////////////////////////
-
-class interprocess_exception;
-class lock_exception;
-class bad_alloc;
-
-//////////////////////////////////////////////////////////////////////////////
-//                            Bufferstream
-//////////////////////////////////////////////////////////////////////////////
-
-//bufferstream
-template <class CharT
-         ,class CharTraits = std::char_traits<CharT> >
-class basic_bufferbuf;
-
-template <class CharT
-         ,class CharTraits = std::char_traits<CharT> >
-class basic_ibufferstream;
-
-template <class CharT
-         ,class CharTraits = std::char_traits<CharT> >
-class basic_obufferstream;
-
-template <class CharT
-         ,class CharTraits = std::char_traits<CharT> >
-class basic_bufferstream;
-
-//////////////////////////////////////////////////////////////////////////////
-//                            Vectorstream
-//////////////////////////////////////////////////////////////////////////////
-
-template <class CharVector
-         ,class CharTraits = std::char_traits<typename CharVector::value_type> >
-class basic_vectorbuf;
-
-template <class CharVector
-         ,class CharTraits = std::char_traits<typename CharVector::value_type> >
-class basic_ivectorstream;
-
-template <class CharVector
-         ,class CharTraits = std::char_traits<typename CharVector::value_type> >
-class basic_ovectorstream;
-
-template <class CharVector
-         ,class CharTraits = std::char_traits<typename CharVector::value_type> >
-class basic_vectorstream;
-
-//////////////////////////////////////////////////////////////////////////////
-//                             Smart pointers
-//////////////////////////////////////////////////////////////////////////////
-
-template<class T, class Deleter>
-class scoped_ptr;
-
-template<class T, class VoidPointer>
-class intrusive_ptr;
-
-template<class T, class VoidAllocator, class Deleter>
-class shared_ptr;
-
-template<class T, class VoidAllocator, class Deleter>
-class weak_ptr;
-
-//////////////////////////////////////////////////////////////////////////////
-//                                  IPC
-//////////////////////////////////////////////////////////////////////////////
-
-template<class VoidPointer>
-class message_queue_t;
-
-typedef message_queue_t<offset_ptr<void> > message_queue;
-
-}}  //namespace boost { namespace interprocess {
-
-#endif   //#if !defined(BOOST_INTERPROCESS_DOXYGEN_INVOKED)
-
-#include <boost/interprocess/detail/config_end.hpp>
-
-#endif //#ifndef BOOST_INTERPROCESS_FWD_HPP
diff --git a/src/boost/interprocess/mapped_region.hpp b/src/boost/interprocess/mapped_region.hpp
deleted file mode 100644
index 1ef28452..00000000
--- a/src/boost/interprocess/mapped_region.hpp
+++ /dev/null
@@ -1,922 +0,0 @@
-//////////////////////////////////////////////////////////////////////////////
-//
-// (C) Copyright Ion Gaztanaga 2005-2012. Distributed under the Boost
-// 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/interprocess for documentation.
-//
-//////////////////////////////////////////////////////////////////////////////
-
-#ifndef BOOST_INTERPROCESS_MAPPED_REGION_HPP
-#define BOOST_INTERPROCESS_MAPPED_REGION_HPP
-
-#ifndef BOOST_CONFIG_HPP
-#  include <boost/config.hpp>
-#endif
-#
-#if defined(BOOST_HAS_PRAGMA_ONCE)
-#  pragma once
-#endif
-
-#include <boost/interprocess/detail/config_begin.hpp>
-#include <boost/interprocess/detail/workaround.hpp>
-
-#include <boost/interprocess/interprocess_fwd.hpp>
-#include <boost/interprocess/exceptions.hpp>
-#include <boost/move/utility_core.hpp>
-#include <boost/interprocess/detail/utilities.hpp>
-#include <boost/interprocess/detail/os_file_functions.hpp>
-#include <string>
-#include <boost/cstdint.hpp>
-#include <boost/assert.hpp>
-#include <boost/move/adl_move_swap.hpp>
-
-//Some Unixes use caddr_t instead of void * in madvise
-//              SunOS                                 Tru64                               HP-UX                    AIX
-#if defined(sun) || defined(__sun) || defined(__osf__) || defined(__osf) || defined(_hpux) || defined(hpux) || defined(_AIX)
-#define BOOST_INTERPROCESS_MADVISE_USES_CADDR_T
-#include <sys/types.h>
-#endif
-
-//A lot of UNIXes have destructive semantics for MADV_DONTNEED, so
-//we need to be careful to allow it.
-#if defined(__FreeBSD__) || defined(__OpenBSD__) || defined(__NetBSD__) || defined(__APPLE__)
-#define BOOST_INTERPROCESS_MADV_DONTNEED_HAS_NONDESTRUCTIVE_SEMANTICS
-#endif
-
-#if defined (BOOST_INTERPROCESS_WINDOWS)
-#  include <boost/interprocess/detail/win32_api.hpp>
-#else
-#  ifdef BOOST_HAS_UNISTD_H
-#    include <fcntl.h>
-#    include <sys/mman.h>     //mmap
-#    include <unistd.h>
-#    include <sys/stat.h>
-#    include <sys/types.h>
-#    if defined(BOOST_INTERPROCESS_XSI_SHARED_MEMORY_OBJECTS)
-#      include <sys/shm.h>      //System V shared memory...
-#    endif
-#    include <boost/assert.hpp>
-#  else
-#    error Unknown platform
-#  endif
-
-#endif   //#if defined (BOOST_INTERPROCESS_WINDOWS)
-
-//!\file
-//!Describes mapped region class
-
-namespace boost {
-namespace interprocess {
-
-#if !defined(BOOST_INTERPROCESS_DOXYGEN_INVOKED)
-
-//Solaris declares madvise only in some configurations but defines MADV_XXX, a bit confusing.
-//Predeclare it here to avoid any compilation error
-#if (defined(sun) || defined(__sun)) && defined(MADV_NORMAL)
-extern "C" int madvise(caddr_t, size_t, int);
-#endif
-
-namespace ipcdetail{ class interprocess_tester; }
-namespace ipcdetail{ class raw_mapped_region_creator; }
-
-#endif   //#ifndef BOOST_INTERPROCESS_DOXYGEN_INVOKED
-
-//!The mapped_region class represents a portion or region created from a
-//!memory_mappable object.
-//!
-//!The OS can map a region bigger than the requested one, as region must
-//!be multiple of the page size, but mapped_region will always refer to
-//!the region specified by the user.
-class mapped_region
-{
-   #if !defined(BOOST_INTERPROCESS_DOXYGEN_INVOKED)
-   //Non-copyable
-   BOOST_MOVABLE_BUT_NOT_COPYABLE(mapped_region)
-   #endif   //#ifndef BOOST_INTERPROCESS_DOXYGEN_INVOKED
-
-   public:
-
-   //!Creates a mapping region of the mapped memory "mapping", starting in
-   //!offset "offset", and the mapping's size will be "size". The mapping
-   //!can be opened for read only, read-write or copy-on-write.
-   //!
-   //!If an address is specified, both the offset and the address must be
-   //!multiples of the page size.
-   //!
-   //!The map is created using "default_map_options". This flag is OS
-   //!dependant and it should not be changed unless the user needs to
-   //!specify special options.
-   //!
-   //!In Windows systems "map_options" is a DWORD value passed as
-   //!"dwDesiredAccess" to "MapViewOfFileEx". If "default_map_options" is passed
-   //!it's initialized to zero. "map_options" is XORed with FILE_MAP_[COPY|READ|WRITE].
-   //!
-   //!In UNIX systems and POSIX mappings "map_options" is an int value passed as "flags"
-   //!to "mmap". If "default_map_options" is specified it's initialized to MAP_NOSYNC
-   //!if that option exists and to zero otherwise. "map_options" XORed with MAP_PRIVATE or MAP_SHARED.
-   //!
-   //!In UNIX systems and XSI mappings "map_options" is an int value passed as "shmflg"
-   //!to "shmat". If "default_map_options" is specified it's initialized to zero.
-   //!"map_options" is XORed with SHM_RDONLY if needed.
-   //!
-   //!The OS could allocate more pages than size/page_size(), but get_address()
-   //!will always return the address passed in this function (if not null) and
-   //!get_size() will return the specified size.
-   template<class MemoryMappable>
-   mapped_region(const MemoryMappable& mapping
-                ,mode_t mode
-                ,offset_t offset = 0
-                ,std::size_t size = 0
-                ,const void *address = 0
-                ,map_options_t map_options = default_map_options);
-
-   //!Default constructor. Address will be 0 (nullptr).
-   //!Size will be 0.
-   //!Does not throw
-   mapped_region() BOOST_NOEXCEPT;
-
-   //!Move constructor. *this will be constructed taking ownership of "other"'s
-   //!region and "other" will be left in default constructor state.
-   mapped_region(BOOST_RV_REF(mapped_region) other)  BOOST_NOEXCEPT
-   #if defined (BOOST_INTERPROCESS_WINDOWS)
-   :  m_base(0), m_size(0)
-   ,  m_page_offset(0)
-   ,  m_mode(read_only)
-   ,  m_file_or_mapping_hnd(ipcdetail::invalid_file())
-   #else
-   :  m_base(0), m_size(0), m_page_offset(0), m_mode(read_only), m_is_xsi(false)
-   #endif
-   {  this->swap(other);   }
-
-   //!Destroys the mapped region.
-   //!Does not throw
-   ~mapped_region();
-
-   //!Move assignment. If *this owns a memory mapped region, it will be
-   //!destroyed and it will take ownership of "other"'s memory mapped region.
-   mapped_region &operator=(BOOST_RV_REF(mapped_region) other) BOOST_NOEXCEPT
-   {
-      mapped_region tmp(boost::move(other));
-      this->swap(tmp);
-      return *this;
-   }
-
-   //!Swaps the mapped_region with another
-   //!mapped region
-   void swap(mapped_region &other) BOOST_NOEXCEPT;
-
-   //!Returns the size of the mapping. Never throws.
-   std::size_t get_size() const BOOST_NOEXCEPT;
-
-   //!Returns the base address of the mapping.
-   //!Never throws.
-   void*       get_address() const BOOST_NOEXCEPT;
-
-   //!Returns the mode of the mapping used to construct the mapped region.
-   //!Never throws.
-   mode_t get_mode() const BOOST_NOEXCEPT;
-
-   //!Flushes to the disk a byte range within the mapped memory.
-   //!If 'async' is true, the function will return before flushing operation is completed
-   //!If 'async' is false, function will return once data has been written into the underlying
-   //!device (i.e., in mapped files OS cached information is written to disk).
-   //!Never throws. Returns false if operation could not be performed.
-   bool flush(std::size_t mapping_offset = 0, std::size_t numbytes = 0, bool async = true);
-
-   //!Shrinks current mapped region. If after shrinking there is no longer need for a previously
-   //!mapped memory page, accessing that page can trigger a segmentation fault.
-   //!Depending on the OS, this operation might fail (XSI shared memory), it can decommit storage
-   //!and free a portion of the virtual address space (e.g.POSIX) or this
-   //!function can release some physical memory without freeing any virtual address space(Windows).
-   //!Returns true on success. Never throws.
-   bool shrink_by(std::size_t bytes, bool from_back = true);
-
-   //!This enum specifies region usage behaviors that an application can specify
-   //!to the mapped region implementation.
-   enum advice_types{
-      //!Specifies that the application has no advice to give on its behavior with respect to
-      //!the region. It is the default characteristic if no advice is given for a range of memory.
-      advice_normal,
-      //!Specifies that the application expects to access the region sequentially from
-      //!lower addresses to higher addresses. The implementation can lower the priority of
-      //!preceding pages within the region once a page have been accessed.
-      advice_sequential,
-      //!Specifies that the application expects to access the region in a random order,
-      //!and prefetching is likely not advantageous.
-      advice_random,
-      //!Specifies that the application expects to access the region in the near future.
-      //!The implementation can prefetch pages of the region.
-      advice_willneed,
-      //!Specifies that the application expects that it will not access the region in the near future.
-      //!The implementation can unload pages within the range to save system resources.
-      advice_dontneed
-   };
-
-   //!Advises the implementation on the expected behavior of the application with respect to the data
-   //!in the region. The implementation may use this information to optimize handling of the region data.
-   //!This function has no effect on the semantics of access to memory in the region, although it may affect
-   //!the performance of access.
-   //!If the advise type is not known to the implementation, the function returns false. True otherwise.
-   bool advise(advice_types advise);
-
-   //!Returns the size of the page. This size is the minimum memory that
-   //!will be used by the system when mapping a memory mappable source and
-   //!will restrict the address and the offset to map.
-   static std::size_t get_page_size() BOOST_NOEXCEPT;
-
-   #if !defined(BOOST_INTERPROCESS_DOXYGEN_INVOKED)
-   private:
-   //!Closes a previously opened memory mapping. Never throws
-   void priv_close();
-
-   void* priv_map_address()  const;
-   std::size_t priv_map_size()  const;
-   bool priv_flush_param_check(std::size_t mapping_offset, void *&addr, std::size_t &numbytes) const;
-   bool priv_shrink_param_check(std::size_t bytes, bool from_back, void *&shrink_page_start, std::size_t &shrink_page_bytes);
-   static void priv_size_from_mapping_size
-      (offset_t mapping_size, offset_t offset, offset_t page_offset, std::size_t &size);
-   static offset_t priv_page_offset_addr_fixup(offset_t page_offset, const void *&addr);
-
-   template<int dummy>
-   struct page_size_holder
-   {
-      static const std::size_t PageSize;
-      static std::size_t get_page_size();
-   };
-
-   void*             m_base;
-   std::size_t       m_size;
-   std::size_t       m_page_offset;
-   mode_t            m_mode;
-   #if defined(BOOST_INTERPROCESS_WINDOWS)
-   file_handle_t     m_file_or_mapping_hnd;
-   #else
-   bool              m_is_xsi;
-   #endif
-
-   friend class ipcdetail::interprocess_tester;
-   friend class ipcdetail::raw_mapped_region_creator;
-   void dont_close_on_destruction();
-   #if defined(BOOST_INTERPROCESS_WINDOWS) && !defined(BOOST_INTERPROCESS_FORCE_GENERIC_EMULATION)
-   template<int Dummy>
-   static void destroy_syncs_in_range(const void *addr, std::size_t size);
-   #endif
-   #endif   //#ifndef BOOST_INTERPROCESS_DOXYGEN_INVOKED
-};
-
-#if !defined(BOOST_INTERPROCESS_DOXYGEN_INVOKED)
-
-inline void swap(mapped_region &x, mapped_region &y) BOOST_NOEXCEPT
-{  x.swap(y);  }
-
-inline mapped_region::~mapped_region()
-{  this->priv_close(); }
-
-inline std::size_t mapped_region::get_size() const BOOST_NOEXCEPT
-{  return m_size; }
-
-inline mode_t mapped_region::get_mode() const BOOST_NOEXCEPT
-{  return m_mode;   }
-
-inline void*    mapped_region::get_address() const BOOST_NOEXCEPT
-{  return m_base; }
-
-inline void*    mapped_region::priv_map_address()  const
-{  return static_cast<char*>(m_base) - m_page_offset; }
-
-inline std::size_t mapped_region::priv_map_size()  const
-{  return m_size + m_page_offset; }
-
-inline bool mapped_region::priv_flush_param_check
-   (std::size_t mapping_offset, void *&addr, std::size_t &numbytes) const
-{
-   //Check some errors
-   if(m_base == 0)
-      return false;
-
-   if(mapping_offset >= m_size || numbytes > (m_size - size_t(mapping_offset))){
-      return false;
-   }
-
-   //Update flush size if the user does not provide it
-   if(numbytes == 0){
-      numbytes = m_size - mapping_offset;
-   }
-   addr = (char*)this->priv_map_address() + mapping_offset;
-   numbytes += m_page_offset;
-   return true;
-}
-
-inline bool mapped_region::priv_shrink_param_check
-   (std::size_t bytes, bool from_back, void *&shrink_page_start, std::size_t &shrink_page_bytes)
-{
-   //Check some errors
-   if(m_base == 0 || bytes > m_size){
-      return false;
-   }
-   else if(bytes == m_size){
-      this->priv_close();
-      return true;
-   }
-   else{
-      const std::size_t page_size = mapped_region::get_page_size();
-      if(from_back){
-         const std::size_t new_pages = (m_size + m_page_offset - bytes - 1)/page_size + 1;
-         shrink_page_start = static_cast<char*>(this->priv_map_address()) + new_pages*page_size;
-         shrink_page_bytes = m_page_offset + m_size - new_pages*page_size;
-         m_size -= bytes;
-      }
-      else{
-         shrink_page_start = this->priv_map_address();
-         m_page_offset += bytes;
-         shrink_page_bytes = (m_page_offset/page_size)*page_size;
-         m_page_offset = m_page_offset % page_size;
-         m_size -= bytes;
-         m_base  = static_cast<char *>(m_base) + bytes;
-         BOOST_ASSERT(shrink_page_bytes%page_size == 0);
-      }
-      return true;
-   }
-}
-
-inline void mapped_region::priv_size_from_mapping_size
-   (offset_t mapping_size, offset_t offset, offset_t page_offset, std::size_t &size)
-{
-   //Check if mapping size fits in the user address space
-   //as offset_t is the maximum file size and it's signed.
-   if(mapping_size < offset ||
-      boost::uintmax_t(mapping_size - (offset - page_offset)) >
-         boost::uintmax_t(std::size_t(-1))){
-      error_info err(size_error);
-      throw interprocess_exception(err);
-   }
-   size = static_cast<std::size_t>(mapping_size - offset);
-}
-
-inline offset_t mapped_region::priv_page_offset_addr_fixup(offset_t offset, const void *&address)
-{
-   //We can't map any offset so we have to obtain system's
-   //memory granularity
-   const std::size_t page_size  = mapped_region::get_page_size();
-
-   //We calculate the difference between demanded and valid offset
-   //(always less than a page in std::size_t, thus, representable by std::size_t)
-   const std::size_t page_offset =
-      static_cast<std::size_t>(offset - (offset / offset_t(page_size)) * offset_t(page_size));
-   //Update the mapping address
-   if(address){
-      address = static_cast<const char*>(address) - page_offset;
-   }
-   return offset_t(page_offset);
-}
-
-#if defined (BOOST_INTERPROCESS_WINDOWS)
-
-inline mapped_region::mapped_region() BOOST_NOEXCEPT
-   :  m_base(0), m_size(0), m_page_offset(0), m_mode(read_only)
-   ,  m_file_or_mapping_hnd(ipcdetail::invalid_file())
-{}
-
-template<int dummy>
-inline std::size_t mapped_region::page_size_holder<dummy>::get_page_size()
-{
-   winapi::interprocess_system_info info;
-   winapi::get_system_info(&info);
-   return std::size_t(info.dwAllocationGranularity);
-}
-
-template<class MemoryMappable>
-inline mapped_region::mapped_region
-   (const MemoryMappable &mapping
-   ,mode_t mode
-   ,offset_t offset
-   ,std::size_t size
-   ,const void *address
-   ,map_options_t map_options)
-   :  m_base(0), m_size(0), m_page_offset(0), m_mode(mode)
-   ,  m_file_or_mapping_hnd(ipcdetail::invalid_file())
-{
-   mapping_handle_t mhandle = mapping.get_mapping_handle();
-   {
-      file_handle_t native_mapping_handle = 0;
-
-      //Set accesses
-      //For "create_file_mapping"
-      unsigned long protection = 0;
-      //For "mapviewoffile"
-      unsigned long map_access = map_options == default_map_options ? 0 : map_options;
-
-      switch(mode)
-      {
-         case read_only:
-         case read_private:
-            protection   |= winapi::page_readonly;
-            map_access   |= winapi::file_map_read;
-         break;
-         case read_write:
-            protection   |= winapi::page_readwrite;
-            map_access   |= winapi::file_map_write;
-         break;
-         case copy_on_write:
-            protection   |= winapi::page_writecopy;
-            map_access   |= winapi::file_map_copy;
-         break;
-         default:
-            {
-               error_info err(mode_error);
-               throw interprocess_exception(err);
-            }
-         break;
-      }
-
-      //For file mapping (including emulated shared memory through temporary files),
-      //the device is a file handle so we need to obtain file's size and call create_file_mapping
-      //to obtain the mapping handle.
-      //For files we don't need the file mapping after mapping the memory, as the file is there
-      //so we'll program the handle close
-      void * handle_to_close = winapi::invalid_handle_value;
-      if(!mhandle.is_shm){
-         //Create mapping handle
-         native_mapping_handle = winapi::create_file_mapping
-            ( ipcdetail::file_handle_from_mapping_handle(mapping.get_mapping_handle())
-            , protection, 0, (char*)0, 0);
-
-         //Check if all is correct
-         if(!native_mapping_handle){
-            error_info err ((int)winapi::get_last_error());
-            throw interprocess_exception(err);
-         }
-         handle_to_close = native_mapping_handle;
-      }
-      else{
-         //For windows_shared_memory the device handle is already a mapping handle
-         //and we need to maintain it
-         native_mapping_handle = mhandle.handle;
-      }
-      //RAII handle close on scope exit
-      const winapi::handle_closer close_handle(handle_to_close);
-      (void)close_handle;
-
-      const offset_t page_offset = priv_page_offset_addr_fixup(offset, address);
-
-      //Obtain mapping size if user provides 0 size
-      if(size == 0){
-         offset_t mapping_size;
-         if(!winapi::get_file_mapping_size(native_mapping_handle, mapping_size)){
-            error_info err((int)winapi::get_last_error());
-            throw interprocess_exception(err);
-         }
-         //This can throw
-         priv_size_from_mapping_size(mapping_size, offset, page_offset, size);
-      }
-
-      //Map with new offsets and size
-      void *base = winapi::map_view_of_file_ex
-                                 (native_mapping_handle,
-                                 map_access,
-                                 ::boost::ulong_long_type(offset - page_offset),
-                                 static_cast<std::size_t>(page_offset + size),
-                                 const_cast<void*>(address));
-      //Check error
-      if(!base){
-         error_info err((int)winapi::get_last_error());
-         throw interprocess_exception(err);
-      }
-
-      //Calculate new base for the user
-      m_base = static_cast<char*>(base) + page_offset;
-      m_page_offset = static_cast<std::size_t>(page_offset);
-      m_size = size;
-   }
-   //Windows shared memory needs the duplication of the handle if we want to
-   //make mapped_region independent from the mappable device
-   //
-   //For mapped files, we duplicate the file handle to be able to FlushFileBuffers
-   if(!winapi::duplicate_current_process_handle(mhandle.handle, &m_file_or_mapping_hnd)){
-      error_info err((int)winapi::get_last_error());
-      this->priv_close();
-      throw interprocess_exception(err);
-   }
-}
-
-inline bool mapped_region::flush(std::size_t mapping_offset, std::size_t numbytes, bool async)
-{
-   void *addr;
-   if(!this->priv_flush_param_check(mapping_offset, addr, numbytes)){
-      return false;
-   }
-   //Flush it all
-   if(!winapi::flush_view_of_file(addr, numbytes)){
-      return false;
-   }
-   //m_file_or_mapping_hnd can be a file handle or a mapping handle.
-   //so flushing file buffers has only sense for files...
-   else if(!async && m_file_or_mapping_hnd != winapi::invalid_handle_value &&
-           winapi::get_file_type(m_file_or_mapping_hnd) == winapi::file_type_disk){
-      return winapi::flush_file_buffers(m_file_or_mapping_hnd);
-   }
-   return true;
-}
-
-inline bool mapped_region::shrink_by(std::size_t bytes, bool from_back)
-{
-   void *shrink_page_start = 0;
-   std::size_t shrink_page_bytes = 0;
-   if(!this->priv_shrink_param_check(bytes, from_back, shrink_page_start, shrink_page_bytes)){
-      return false;
-   }
-   else if(shrink_page_bytes){
-      //In Windows, we can't decommit the storage or release the virtual address space,
-      //the best we can do is try to remove some memory from the process working set.
-      //With a bit of luck we can free some physical memory.
-      unsigned long old_protect_ignored;
-      bool b_ret = winapi::virtual_unlock(shrink_page_start, shrink_page_bytes)
-                           || (winapi::get_last_error() == winapi::error_not_locked);
-      (void)old_protect_ignored;
-      //Change page protection to forbid any further access
-      b_ret = b_ret && winapi::virtual_protect
-         (shrink_page_start, shrink_page_bytes, winapi::page_noaccess, old_protect_ignored);
-      return b_ret;
-   }
-   else{
-      return true;
-   }
-}
-
-inline bool mapped_region::advise(advice_types)
-{
-   //Windows has no madvise/posix_madvise equivalent
-   return false;
-}
-
-inline void mapped_region::priv_close()
-{
-   if(m_base){
-      void *addr = this->priv_map_address();
-      #if !defined(BOOST_INTERPROCESS_FORCE_GENERIC_EMULATION)
-      mapped_region::destroy_syncs_in_range<0>(addr, m_size);
-      #endif
-      winapi::unmap_view_of_file(addr);
-      m_base = 0;
-   }
-   if(m_file_or_mapping_hnd != ipcdetail::invalid_file()){
-      winapi::close_handle(m_file_or_mapping_hnd);
-      m_file_or_mapping_hnd = ipcdetail::invalid_file();
-   }
-}
-
-inline void mapped_region::dont_close_on_destruction()
-{}
-
-#else    //#if defined (BOOST_INTERPROCESS_WINDOWS)
-
-inline mapped_region::mapped_region() BOOST_NOEXCEPT
-   :  m_base(0), m_size(0), m_page_offset(0), m_mode(read_only), m_is_xsi(false)
-{}
-
-template<int dummy>
-inline std::size_t mapped_region::page_size_holder<dummy>::get_page_size()
-{  return std::size_t(sysconf(_SC_PAGESIZE)); }
-
-template<class MemoryMappable>
-inline mapped_region::mapped_region
-   ( const MemoryMappable &mapping
-   , mode_t mode
-   , offset_t offset
-   , std::size_t size
-   , const void *address
-   , map_options_t map_options)
-   : m_base(0), m_size(0), m_page_offset(0), m_mode(mode), m_is_xsi(false)
-{
-   mapping_handle_t map_hnd = mapping.get_mapping_handle();
-
-   //Some systems dont' support XSI shared memory
-   #ifdef BOOST_INTERPROCESS_XSI_SHARED_MEMORY_OBJECTS
-   if(map_hnd.is_xsi){
-      //Get the size
-      ::shmid_ds xsi_ds;
-      int ret = ::shmctl(map_hnd.handle, IPC_STAT, &xsi_ds);
-      if(ret == -1){
-         error_info err(system_error_code());
-         throw interprocess_exception(err);
-      }
-      //Compare sizess
-      if(size == 0){
-         size = (std::size_t)xsi_ds.shm_segsz;
-      }
-      else if(size != (std::size_t)xsi_ds.shm_segsz){
-         error_info err(size_error);
-         throw interprocess_exception(err);
-      }
-      //Calculate flag
-      int flag = map_options == default_map_options ? 0 : map_options;
-      if(m_mode == read_only){
-         flag |= SHM_RDONLY;
-      }
-      else if(m_mode != read_write){
-         error_info err(mode_error);
-         throw interprocess_exception(err);
-      }
-      //Attach memory
-      //Some old shmat implementation take the address as a non-const void pointer
-      //so uncast it to make code portable.
-      void *const final_address = const_cast<void *>(address);
-      void *base = ::shmat(map_hnd.handle, final_address, flag);
-      if(base == (void*)-1){
-         error_info err(system_error_code());
-         throw interprocess_exception(err);
-      }
-      //Update members
-      m_base   = base;
-      m_size   = size;
-      m_mode   = mode;
-      m_page_offset = 0;
-      m_is_xsi = true;
-      return;
-   }
-   #endif   //ifdef BOOST_INTERPROCESS_XSI_SHARED_MEMORY_OBJECTS
-
-   //We calculate the difference between demanded and valid offset
-   const offset_t page_offset = priv_page_offset_addr_fixup(offset, address);
-
-   if(size == 0){
-      struct ::stat buf;
-      if(0 != fstat(map_hnd.handle, &buf)){
-         error_info err(system_error_code());
-         throw interprocess_exception(err);
-      }
-      //This can throw
-      priv_size_from_mapping_size(buf.st_size, offset, page_offset, size);
-   }
-
-   #ifdef MAP_NOSYNC
-      #define BOOST_INTERPROCESS_MAP_NOSYNC MAP_NOSYNC
-   #else
-      #define BOOST_INTERPROCESS_MAP_NOSYNC 0
-   #endif   //MAP_NOSYNC
-
-   //Create new mapping
-   int prot    = 0;
-   int flags   = map_options == default_map_options ? BOOST_INTERPROCESS_MAP_NOSYNC : map_options;
-
-   #undef BOOST_INTERPROCESS_MAP_NOSYNC
-
-   switch(mode)
-   {
-      case read_only:
-         prot  |= PROT_READ;
-         flags |= MAP_SHARED;
-      break;
-
-      case read_private:
-         prot  |= (PROT_READ);
-         flags |= MAP_PRIVATE;
-      break;
-
-      case read_write:
-         prot  |= (PROT_WRITE | PROT_READ);
-         flags |= MAP_SHARED;
-      break;
-
-      case copy_on_write:
-         prot  |= (PROT_WRITE | PROT_READ);
-         flags |= MAP_PRIVATE;
-      break;
-
-      default:
-         {
-            error_info err(mode_error);
-            throw interprocess_exception(err);
-         }
-      break;
-   }
-
-   //Map it to the address space
-   void* base = mmap ( const_cast<void*>(address)
-                     , static_cast<std::size_t>(page_offset) + size
-                     , prot
-                     , flags
-                     , mapping.get_mapping_handle().handle
-                     , offset - page_offset);
-
-   //Check if mapping was successful
-   if(base == MAP_FAILED){
-      error_info err = system_error_code();
-      throw interprocess_exception(err);
-   }
-
-   //Calculate new base for the user
-   m_base = static_cast<char*>(base) + page_offset;
-   m_page_offset = static_cast<std::size_t>(page_offset);
-   m_size   = size;
-
-   //Check for fixed mapping error
-   if(address && (base != address)){
-      error_info err(busy_error);
-      this->priv_close();
-      throw interprocess_exception(err);
-   }
-}
-
-inline bool mapped_region::shrink_by(std::size_t bytes, bool from_back)
-{
-   void *shrink_page_start = 0;
-   std::size_t shrink_page_bytes = 0;
-   if(m_is_xsi || !this->priv_shrink_param_check(bytes, from_back, shrink_page_start, shrink_page_bytes)){
-      return false;
-   }
-   else if(shrink_page_bytes){
-      //In UNIX we can decommit and free virtual address space.
-      return 0 == munmap(shrink_page_start, shrink_page_bytes);
-   }
-   else{
-      return true;
-   }
-}
-
-inline bool mapped_region::flush(std::size_t mapping_offset, std::size_t numbytes, bool async)
-{
-   void *addr;
-   if(m_is_xsi || !this->priv_flush_param_check(mapping_offset, addr, numbytes)){
-      return false;
-   }
-   //Flush it all
-   return msync(addr, numbytes, async ? MS_ASYNC : MS_SYNC) == 0;
-}
-
-inline bool mapped_region::advise(advice_types advice)
-{
-   int unix_advice = 0;
-   //Modes; 0: none, 2: posix, 1: madvise
-   const unsigned int mode_none = 0;
-   const unsigned int mode_padv = 1;
-   const unsigned int mode_madv = 2;
-   // Suppress "unused variable" warnings
-   (void)mode_padv;
-   (void)mode_madv;
-   unsigned int mode = mode_none;
-   //Choose advice either from POSIX (preferred) or native Unix
-   switch(advice){
-      case advice_normal:
-         #if defined(POSIX_MADV_NORMAL)
-         unix_advice = POSIX_MADV_NORMAL;
-         mode = mode_padv;
-         #elif defined(MADV_NORMAL)
-         unix_advice = MADV_NORMAL;
-         mode = mode_madv;
-         #endif
-      break;
-      case advice_sequential:
-         #if defined(POSIX_MADV_SEQUENTIAL)
-         unix_advice = POSIX_MADV_SEQUENTIAL;
-         mode = mode_padv;
-         #elif defined(MADV_SEQUENTIAL)
-         unix_advice = MADV_SEQUENTIAL;
-         mode = mode_madv;
-         #endif
-      break;
-      case advice_random:
-         #if defined(POSIX_MADV_RANDOM)
-         unix_advice = POSIX_MADV_RANDOM;
-         mode = mode_padv;
-         #elif defined(MADV_RANDOM)
-         unix_advice = MADV_RANDOM;
-         mode = mode_madv;
-         #endif
-      break;
-      case advice_willneed:
-         #if defined(POSIX_MADV_WILLNEED)
-         unix_advice = POSIX_MADV_WILLNEED;
-         mode = mode_padv;
-         #elif defined(MADV_WILLNEED)
-         unix_advice = MADV_WILLNEED;
-         mode = mode_madv;
-         #endif
-      break;
-      case advice_dontneed:
-         #if defined(POSIX_MADV_DONTNEED)
-         unix_advice = POSIX_MADV_DONTNEED;
-         mode = mode_padv;
-         #elif defined(MADV_DONTNEED) && defined(BOOST_INTERPROCESS_MADV_DONTNEED_HAS_NONDESTRUCTIVE_SEMANTICS)
-         unix_advice = MADV_DONTNEED;
-         mode = mode_madv;
-         #endif
-      break;
-      default:
-      return false;
-   }
-   switch(mode){
-      #if defined(POSIX_MADV_NORMAL)
-         case mode_padv:
-         return 0 == posix_madvise(this->priv_map_address(), this->priv_map_size(), unix_advice);
-      #endif
-      #if defined(MADV_NORMAL)
-         case mode_madv:
-         return 0 == madvise(
-            #if defined(BOOST_INTERPROCESS_MADVISE_USES_CADDR_T)
-            (caddr_t)
-            #endif
-            this->priv_map_address(), this->priv_map_size(), unix_advice);
-      #endif
-      default:
-      return false;
-
-   }
-}
-
-inline void mapped_region::priv_close()
-{
-   if(m_base != 0){
-      #ifdef BOOST_INTERPROCESS_XSI_SHARED_MEMORY_OBJECTS
-      if(m_is_xsi){
-         int ret = ::shmdt(m_base);
-         BOOST_ASSERT(ret == 0);
-         (void)ret;
-         return;
-      }
-      #endif //#ifdef BOOST_INTERPROCESS_XSI_SHARED_MEMORY_OBJECTS
-      munmap(this->priv_map_address(), this->priv_map_size());
-      m_base = 0;
-   }
-}
-
-inline void mapped_region::dont_close_on_destruction()
-{  m_base = 0;   }
-
-#endif   //#if defined (BOOST_INTERPROCESS_WINDOWS)
-
-template<int dummy>
-const std::size_t mapped_region::page_size_holder<dummy>::PageSize
-   = mapped_region::page_size_holder<dummy>::get_page_size();
-
-inline std::size_t mapped_region::get_page_size() BOOST_NOEXCEPT
-{
-   if(!page_size_holder<0>::PageSize)
-      return page_size_holder<0>::get_page_size();
-   else
-      return page_size_holder<0>::PageSize;
-}
-
-inline void mapped_region::swap(mapped_region &other) BOOST_NOEXCEPT
-{
-   ::boost::adl_move_swap(this->m_base, other.m_base);
-   ::boost::adl_move_swap(this->m_size, other.m_size);
-   ::boost::adl_move_swap(this->m_page_offset, other.m_page_offset);
-   ::boost::adl_move_swap(this->m_mode,  other.m_mode);
-   #if defined (BOOST_INTERPROCESS_WINDOWS)
-   ::boost::adl_move_swap(this->m_file_or_mapping_hnd, other.m_file_or_mapping_hnd);
-   #else
-   ::boost::adl_move_swap(this->m_is_xsi, other.m_is_xsi);
-   #endif
-}
-
-//!No-op functor
-struct null_mapped_region_function
-{
-   bool operator()(void *, std::size_t , bool) const
-      {   return true;   }
-
-   static std::size_t get_min_size()
-   {  return 0;  }
-};
-
-#endif   //#ifndef BOOST_INTERPROCESS_DOXYGEN_INVOKED
-
-}  //namespace interprocess {
-}  //namespace boost {
-
-#include <boost/interprocess/detail/config_end.hpp>
-
-#endif   //BOOST_INTERPROCESS_MAPPED_REGION_HPP
-
-#if !defined(BOOST_INTERPROCESS_DOXYGEN_INVOKED)
-
-#ifndef BOOST_INTERPROCESS_MAPPED_REGION_EXT_HPP
-#define BOOST_INTERPROCESS_MAPPED_REGION_EXT_HPP
-
-#if defined(BOOST_INTERPROCESS_WINDOWS) && !defined(BOOST_INTERPROCESS_FORCE_GENERIC_EMULATION)
-#  include <boost/interprocess/sync/windows/sync_utils.hpp>
-#  include <boost/interprocess/detail/windows_intermodule_singleton.hpp>
-
-namespace boost {
-namespace interprocess {
-
-template<int Dummy>
-inline void mapped_region::destroy_syncs_in_range(const void *addr, std::size_t size)
-{
-   ipcdetail::sync_handles &handles =
-      ipcdetail::windows_intermodule_singleton<ipcdetail::sync_handles>::get();
-   handles.destroy_syncs_in_range(addr, size);
-}
-
-}  //namespace interprocess {
-}  //namespace boost {
-
-#endif   //defined(BOOST_INTERPROCESS_WINDOWS) && !defined(BOOST_INTERPROCESS_FORCE_GENERIC_EMULATION)
-
-#endif   //#ifdef BOOST_INTERPROCESS_MAPPED_REGION_EXT_HPP
-
-#endif   //#if !defined(BOOST_INTERPROCESS_DOXYGEN_INVOKED)
-
diff --git a/src/boost/interprocess/mem_algo/detail/mem_algo_common.hpp b/src/boost/interprocess/mem_algo/detail/mem_algo_common.hpp
deleted file mode 100644
index c036ce94..00000000
--- a/src/boost/interprocess/mem_algo/detail/mem_algo_common.hpp
+++ /dev/null
@@ -1,599 +0,0 @@
-//////////////////////////////////////////////////////////////////////////////
-//
-// (C) Copyright Ion Gaztanaga 2005-2012. Distributed under the Boost
-// 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/interprocess for documentation.
-//
-//////////////////////////////////////////////////////////////////////////////
-
-#ifndef BOOST_INTERPROCESS_DETAIL_MEM_ALGO_COMMON_HPP
-#define BOOST_INTERPROCESS_DETAIL_MEM_ALGO_COMMON_HPP
-
-#ifndef BOOST_CONFIG_HPP
-#  include <boost/config.hpp>
-#endif
-#
-#if defined(BOOST_HAS_PRAGMA_ONCE)
-#  pragma once
-#endif
-
-#include <boost/interprocess/detail/config_begin.hpp>
-#include <boost/interprocess/detail/workaround.hpp>
-
-// interprocess
-#include <boost/interprocess/interprocess_fwd.hpp>
-#include <boost/interprocess/containers/allocation_type.hpp>
-// interprocess/detail
-#include <boost/interprocess/detail/math_functions.hpp>
-#include <boost/interprocess/detail/min_max.hpp>
-#include <boost/interprocess/detail/type_traits.hpp>
-#include <boost/interprocess/detail/utilities.hpp>
-// container/detail
-#include <boost/container/detail/multiallocation_chain.hpp>
-#include <boost/container/detail/placement_new.hpp>
-// move
-#include <boost/move/utility_core.hpp>
-// move/detail
-#include <boost/move/detail/force_ptr.hpp>
-// other boost
-#include <boost/static_assert.hpp>
-#include <boost/assert.hpp>
-
-//!\file
-//!Implements common operations for memory algorithms.
-
-namespace boost {
-namespace interprocess {
-namespace ipcdetail {
-
-template<class VoidPointer>
-class basic_multiallocation_chain
-   : public boost::container::dtl::
-      basic_multiallocation_chain<VoidPointer>
-{
-   BOOST_MOVABLE_BUT_NOT_COPYABLE(basic_multiallocation_chain)
-   typedef boost::container::dtl::
-      basic_multiallocation_chain<VoidPointer> base_t;
-   public:
-
-   basic_multiallocation_chain()
-      :  base_t()
-   {}
-
-   basic_multiallocation_chain(BOOST_RV_REF(basic_multiallocation_chain) other)
-      :  base_t(::boost::move(static_cast<base_t&>(other)))
-   {}
-
-   basic_multiallocation_chain& operator=(BOOST_RV_REF(basic_multiallocation_chain) other)
-   {
-      this->base_t::operator=(::boost::move(static_cast<base_t&>(other)));
-      return *this;
-   }
-
-   void *pop_front()
-   {
-      return boost::interprocess::ipcdetail::to_raw_pointer(this->base_t::pop_front());
-   }
-};
-
-
-//!This class implements several allocation functions shared by different algorithms
-//!(aligned allocation, multiple allocation...).
-template<class MemoryAlgorithm>
-class memory_algorithm_common
-{
-   public:
-   typedef typename MemoryAlgorithm::void_pointer              void_pointer;
-   typedef typename MemoryAlgorithm::block_ctrl                block_ctrl;
-   typedef typename MemoryAlgorithm::multiallocation_chain     multiallocation_chain;
-   typedef memory_algorithm_common<MemoryAlgorithm>            this_type;
-   typedef typename MemoryAlgorithm::size_type                 size_type;
-
-   static const size_type Alignment              = MemoryAlgorithm::Alignment;
-   static const size_type MinBlockUnits          = MemoryAlgorithm::MinBlockUnits;
-   static const size_type AllocatedCtrlBytes     = MemoryAlgorithm::AllocatedCtrlBytes;
-   static const size_type AllocatedCtrlUnits     = MemoryAlgorithm::AllocatedCtrlUnits;
-   static const size_type BlockCtrlBytes         = MemoryAlgorithm::BlockCtrlBytes;
-   static const size_type BlockCtrlUnits         = MemoryAlgorithm::BlockCtrlUnits;
-   static const size_type UsableByPreviousChunk  = MemoryAlgorithm::UsableByPreviousChunk;
-
-   static void assert_alignment(const void *ptr)
-   {  assert_alignment((std::size_t)ptr); }
-
-   static void assert_alignment(size_type uint_ptr)
-   {
-      (void)uint_ptr;
-      BOOST_ASSERT(uint_ptr % Alignment == 0);
-   }
-
-   static bool check_alignment(const void *ptr)
-   {  return (((std::size_t)ptr) % Alignment == 0);   }
-
-   static size_type ceil_units(size_type size)
-   {  return get_rounded_size(size, Alignment)/Alignment; }
-
-   static size_type floor_units(size_type size)
-   {  return size/Alignment;  }
-
-   static size_type multiple_of_units(size_type size)
-   {  return get_rounded_size(size, Alignment);  }
-
-   static void allocate_many
-      (MemoryAlgorithm *memory_algo, size_type elem_bytes, size_type n_elements, multiallocation_chain &chain)
-   {
-      return this_type::priv_allocate_many(memory_algo, &elem_bytes, n_elements, 0, chain);
-   }
-
-   static void deallocate_many(MemoryAlgorithm *memory_algo, multiallocation_chain &chain)
-   {
-      return this_type::priv_deallocate_many(memory_algo, chain);
-   }
-
-   static bool calculate_lcm_and_needs_backwards_lcmed
-      (size_type backwards_multiple, size_type received_size, size_type size_to_achieve,
-      size_type &lcm_out, size_type &needs_backwards_lcmed_out)
-   {
-      // Now calculate lcm_val
-      size_type max = backwards_multiple;
-      size_type min = Alignment;
-      size_type needs_backwards;
-      size_type needs_backwards_lcmed;
-      size_type lcm_val;
-      size_type current_forward;
-      //Swap if necessary
-      if(max < min){
-         size_type tmp = min;
-         min = max;
-         max = tmp;
-      }
-      //Check if it's power of two
-      if((backwards_multiple & (backwards_multiple-1)) == 0){
-         if(0 != (size_to_achieve & ((backwards_multiple-1)))){
-            return false;
-         }
-
-         lcm_val = max;
-         //If we want to use minbytes data to get a buffer between maxbytes
-         //and minbytes if maxbytes can't be achieved, calculate the
-         //biggest of all possibilities
-         current_forward = get_truncated_size_po2(received_size, backwards_multiple);
-         needs_backwards = size_to_achieve - current_forward;
-         BOOST_ASSERT((needs_backwards % backwards_multiple) == 0);
-         needs_backwards_lcmed = get_rounded_size_po2(needs_backwards, lcm_val);
-         lcm_out = lcm_val;
-         needs_backwards_lcmed_out = needs_backwards_lcmed;
-         return true;
-      }
-      //Check if it's multiple of alignment
-      else if((backwards_multiple & (Alignment - 1u)) == 0){
-         lcm_val = backwards_multiple;
-         current_forward = get_truncated_size(received_size, backwards_multiple);
-         //No need to round needs_backwards because backwards_multiple == lcm_val
-         needs_backwards_lcmed = needs_backwards = size_to_achieve - current_forward;
-         BOOST_ASSERT((needs_backwards_lcmed & (Alignment - 1u)) == 0);
-         lcm_out = lcm_val;
-         needs_backwards_lcmed_out = needs_backwards_lcmed;
-         return true;
-      }
-      //Check if it's multiple of the half of the alignmment
-      else if((backwards_multiple & ((Alignment/2u) - 1u)) == 0){
-         lcm_val = backwards_multiple*2u;
-         current_forward = get_truncated_size(received_size, backwards_multiple);
-         needs_backwards_lcmed = needs_backwards = size_to_achieve - current_forward;
-         if(0 != (needs_backwards_lcmed & (Alignment-1)))
-         //while(0 != (needs_backwards_lcmed & (Alignment-1)))
-            needs_backwards_lcmed += backwards_multiple;
-         BOOST_ASSERT((needs_backwards_lcmed % lcm_val) == 0);
-         lcm_out = lcm_val;
-         needs_backwards_lcmed_out = needs_backwards_lcmed;
-         return true;
-      }
-      //Check if it's multiple of the quarter of the alignmment
-      else if((backwards_multiple & ((Alignment/4u) - 1u)) == 0){
-         size_type remainder;
-         lcm_val = backwards_multiple*4u;
-         current_forward = get_truncated_size(received_size, backwards_multiple);
-         needs_backwards_lcmed = needs_backwards = size_to_achieve - current_forward;
-         //while(0 != (needs_backwards_lcmed & (Alignment-1)))
-            //needs_backwards_lcmed += backwards_multiple;
-         if(0 != (remainder = ((needs_backwards_lcmed & (Alignment-1))>>(Alignment/8u)))){
-            if(backwards_multiple & Alignment/2u){
-               needs_backwards_lcmed += (remainder)*backwards_multiple;
-            }
-            else{
-               needs_backwards_lcmed += (4-remainder)*backwards_multiple;
-            }
-         }
-         BOOST_ASSERT((needs_backwards_lcmed % lcm_val) == 0);
-         lcm_out = lcm_val;
-         needs_backwards_lcmed_out = needs_backwards_lcmed;
-         return true;
-      }
-      else{
-         lcm_val = lcm(max, min);
-      }
-      //If we want to use minbytes data to get a buffer between maxbytes
-      //and minbytes if maxbytes can't be achieved, calculate the
-      //biggest of all possibilities
-      current_forward = get_truncated_size(received_size, backwards_multiple);
-      needs_backwards = size_to_achieve - current_forward;
-      BOOST_ASSERT((needs_backwards % backwards_multiple) == 0);
-      needs_backwards_lcmed = get_rounded_size(needs_backwards, lcm_val);
-      lcm_out = lcm_val;
-      needs_backwards_lcmed_out = needs_backwards_lcmed;
-      return true;
-   }
-
-   static void allocate_many
-      ( MemoryAlgorithm *memory_algo
-      , const size_type *elem_sizes
-      , size_type n_elements
-      , size_type sizeof_element
-      , multiallocation_chain &chain)
-   {
-      this_type::priv_allocate_many(memory_algo, elem_sizes, n_elements, sizeof_element, chain);
-   }
-
-   static void* allocate_aligned
-      (MemoryAlgorithm *memory_algo, size_type nbytes, size_type alignment)
-   {
-
-      //Ensure power of 2
-      if ((alignment & (alignment - size_type(1u))) != 0){
-         //Alignment is not power of two
-         BOOST_ASSERT((alignment & (alignment - size_type(1u))) == 0);
-         return 0;
-      }
-
-      size_type real_size = nbytes;
-      if(alignment <= Alignment){
-         void *ignore_reuse = 0;
-         return memory_algo->priv_allocate
-            (boost::interprocess::allocate_new, nbytes, real_size, ignore_reuse);
-      }
-
-      if(nbytes > UsableByPreviousChunk)
-         nbytes -= UsableByPreviousChunk;
-
-      //We can find a aligned portion if we allocate a block that has alignment
-      //nbytes + alignment bytes or more.
-      size_type minimum_allocation = max_value
-         (nbytes + alignment, size_type(MinBlockUnits*Alignment));
-      //Since we will split that block, we must request a bit more memory
-      //if the alignment is near the beginning of the buffer, because otherwise,
-      //there is no space for a new block before the alignment.
-      //
-      //            ____ Aligned here
-      //           |
-      //  -----------------------------------------------------
-      // | MBU |
-      //  -----------------------------------------------------
-      size_type request =
-         minimum_allocation + (2*MinBlockUnits*Alignment - AllocatedCtrlBytes
-         //prevsize - UsableByPreviousChunk
-         );
-
-      //Now allocate the buffer
-      real_size = request;
-      void *ignore_reuse = 0;
-      void *buffer = memory_algo->priv_allocate(boost::interprocess::allocate_new, request, real_size, ignore_reuse);
-      if(!buffer){
-         return 0;
-      }
-      else if ((((std::size_t)(buffer)) % alignment) == 0){
-         //If we are lucky and the buffer is aligned, just split it and
-         //return the high part
-         block_ctrl *first  = memory_algo->priv_get_block(buffer);
-         size_type old_size = first->m_size;
-         const size_type first_min_units =
-            max_value(ceil_units(nbytes) + AllocatedCtrlUnits, size_type(MinBlockUnits));
-         //We can create a new block in the end of the segment
-         if(old_size >= (first_min_units + MinBlockUnits)){
-            block_ctrl *second =  move_detail::force_ptr<block_ctrl*>
-               (reinterpret_cast<char*>(first) + Alignment*first_min_units);
-            first->m_size  = first_min_units & block_ctrl::size_mask;
-            second->m_size = (old_size - first->m_size) & block_ctrl::size_mask;
-            BOOST_ASSERT(second->m_size >= MinBlockUnits);
-            memory_algo->priv_mark_new_allocated_block(first);
-            memory_algo->priv_mark_new_allocated_block(second);
-            memory_algo->priv_deallocate(memory_algo->priv_get_user_buffer(second));
-         }
-         return buffer;
-      }
-
-      //Buffer not aligned, find the aligned part.
-      //
-      //                    ____ Aligned here
-      //                   |
-      //  -----------------------------------------------------
-      // | MBU +more | ACB |
-      //  -----------------------------------------------------
-      char *pos = reinterpret_cast<char*>
-         (reinterpret_cast<std::size_t>(static_cast<char*>(buffer) +
-            //This is the minimum size of (2)
-            (MinBlockUnits*Alignment - AllocatedCtrlBytes) +
-            //This is the next MBU for the aligned memory
-            AllocatedCtrlBytes +
-            //This is the alignment trick
-            alignment - 1) & -alignment);
-
-      //Now obtain the address of the blocks
-      block_ctrl *first  = memory_algo->priv_get_block(buffer);
-      block_ctrl *second = memory_algo->priv_get_block(pos);
-      BOOST_ASSERT(pos <= (reinterpret_cast<char*>(first) + first->m_size*Alignment));
-      BOOST_ASSERT(first->m_size >= 2*MinBlockUnits);
-      BOOST_ASSERT((pos + MinBlockUnits*Alignment - AllocatedCtrlBytes + nbytes*Alignment/Alignment) <=
-             (reinterpret_cast<char*>(first) + first->m_size*Alignment));
-      //Set the new size of the first block
-      size_type old_size = first->m_size;
-      first->m_size = size_type(size_type(reinterpret_cast<char*>(second) - reinterpret_cast<char*>(first))/Alignment
-                        & block_ctrl::size_mask);
-      memory_algo->priv_mark_new_allocated_block(first);
-
-      //Now check if we can create a new buffer in the end
-      //
-      //              __"second" block
-      //             |      __Aligned here
-      //             |     |      __"third" block
-      //  -----------|-----|-----|------------------------------
-      // | MBU +more | ACB | (3) | BCU |
-      //  -----------------------------------------------------
-      //This size will be the minimum size to be able to create a
-      //new block in the end.
-      const size_type second_min_units = max_value(size_type(MinBlockUnits),
-                        ceil_units(nbytes) + AllocatedCtrlUnits );
-
-      //Check if we can create a new block (of size MinBlockUnits) in the end of the segment
-      if((old_size - first->m_size) >= (second_min_units + MinBlockUnits)){
-         //Now obtain the address of the end block
-         block_ctrl *third = new (reinterpret_cast<char*>(second) + Alignment*second_min_units)block_ctrl;
-         second->m_size = second_min_units & block_ctrl::size_mask;
-         third->m_size  = (old_size - first->m_size - second->m_size) & block_ctrl::size_mask;
-         BOOST_ASSERT(third->m_size >= MinBlockUnits);
-         memory_algo->priv_mark_new_allocated_block(second);
-         memory_algo->priv_mark_new_allocated_block(third);
-         memory_algo->priv_deallocate(memory_algo->priv_get_user_buffer(third));
-      }
-      else{
-         second->m_size = (old_size - first->m_size) & block_ctrl::size_mask;
-         BOOST_ASSERT(second->m_size >= MinBlockUnits);
-         memory_algo->priv_mark_new_allocated_block(second);
-      }
-
-      memory_algo->priv_deallocate(memory_algo->priv_get_user_buffer(first));
-      return memory_algo->priv_get_user_buffer(second);
-   }
-
-   static bool try_shrink
-      (MemoryAlgorithm *memory_algo, void *ptr
-      ,const size_type max_size, size_type &received_size)
-   {
-      size_type const preferred_size = received_size;
-      (void)memory_algo;
-      //Obtain the real block
-      block_ctrl *block = memory_algo->priv_get_block(ptr);
-      size_type old_block_units = (size_type)block->m_size;
-
-      //The block must be marked as allocated
-      BOOST_ASSERT(memory_algo->priv_is_allocated_block(block));
-
-      //Check if alignment and block size are right
-      assert_alignment(ptr);
-
-      //Put this to a safe value
-      received_size = (old_block_units - AllocatedCtrlUnits)*Alignment + UsableByPreviousChunk;
-
-      //Now translate it to Alignment units
-      const size_type max_user_units       = floor_units(max_size - UsableByPreviousChunk);
-      const size_type preferred_user_units = ceil_units(preferred_size - UsableByPreviousChunk);
-
-      //Check if rounded max and preferred are possible correct
-      if(max_user_units < preferred_user_units)
-         return false;
-
-      //Check if the block is smaller than the requested minimum
-      size_type old_user_units = old_block_units - AllocatedCtrlUnits;
-
-      if(old_user_units < preferred_user_units)
-         return false;
-
-      //If the block is smaller than the requested minimum
-      if(old_user_units == preferred_user_units)
-         return true;
-
-      size_type shrunk_user_units =
-         ((BlockCtrlUnits - AllocatedCtrlUnits) >= preferred_user_units)
-         ? (BlockCtrlUnits - AllocatedCtrlUnits)
-         : preferred_user_units;
-
-      //Some parameter checks
-      if(max_user_units < shrunk_user_units)
-         return false;
-
-      //We must be able to create at least a new empty block
-      if((old_user_units - shrunk_user_units) < BlockCtrlUnits ){
-         return false;
-      }
-
-      //Update new size
-      received_size = shrunk_user_units*Alignment + UsableByPreviousChunk;
-      return true;
-   }
-
-   static bool shrink
-      (MemoryAlgorithm *memory_algo, void *ptr
-      ,const size_type max_size, size_type &received_size)
-   {
-      size_type const preferred_size = received_size;
-      //Obtain the real block
-      block_ctrl *block = memory_algo->priv_get_block(ptr);
-      size_type old_block_units = (size_type)block->m_size;
-
-      if(!try_shrink(memory_algo, ptr, max_size, received_size)){
-         return false;
-      }
-
-      //Check if the old size was just the shrunk size (no splitting)
-      if((old_block_units - AllocatedCtrlUnits) == ceil_units(preferred_size - UsableByPreviousChunk))
-         return true;
-
-      //Now we can just rewrite the size of the old buffer
-      block->m_size = ((received_size-UsableByPreviousChunk)/Alignment + AllocatedCtrlUnits) & block_ctrl::size_mask;
-      BOOST_ASSERT(block->m_size >= BlockCtrlUnits);
-
-      //We create the new block
-      block_ctrl *new_block = move_detail::force_ptr<block_ctrl*>
-                  (reinterpret_cast<char*>(block) + block->m_size*Alignment);
-      //Write control data to simulate this new block was previously allocated
-      //and deallocate it
-      new_block->m_size = (old_block_units - block->m_size) & block_ctrl::size_mask;
-      BOOST_ASSERT(new_block->m_size >= BlockCtrlUnits);
-      memory_algo->priv_mark_new_allocated_block(block);
-      memory_algo->priv_mark_new_allocated_block(new_block);
-      memory_algo->priv_deallocate(memory_algo->priv_get_user_buffer(new_block));
-      return true;
-   }
-
-   private:
-   static void priv_allocate_many
-      ( MemoryAlgorithm *memory_algo
-      , const size_type *elem_sizes
-      , size_type n_elements
-      , size_type sizeof_element
-      , multiallocation_chain &chain)
-   {
-      //Note: sizeof_element == 0 indicates that we want to
-      //allocate n_elements of the same size "*elem_sizes"
-
-      //Calculate the total size of all requests
-      size_type total_request_units = 0;
-      size_type elem_units = 0;
-      const size_type ptr_size_units = memory_algo->priv_get_total_units(sizeof(void_pointer));
-      if(!sizeof_element){
-         elem_units = memory_algo->priv_get_total_units(*elem_sizes);
-         elem_units = ptr_size_units > elem_units ? ptr_size_units : elem_units;
-         total_request_units = n_elements*elem_units;
-      }
-      else{
-         for(size_type i = 0; i < n_elements; ++i){
-            if(multiplication_overflows(elem_sizes[i], sizeof_element)){
-               total_request_units = 0;
-               break;
-            }
-            elem_units = memory_algo->priv_get_total_units(elem_sizes[i]*sizeof_element);
-            elem_units = ptr_size_units > elem_units ? ptr_size_units : elem_units;
-            if(sum_overflows(total_request_units, elem_units)){
-               total_request_units = 0;
-               break;
-            }
-            total_request_units += elem_units;
-         }
-      }
-
-      if(total_request_units && !multiplication_overflows(total_request_units, Alignment)){
-         size_type low_idx = 0;
-         while(low_idx < n_elements){
-            size_type total_bytes = total_request_units*Alignment - AllocatedCtrlBytes + UsableByPreviousChunk;
-            size_type min_allocation = (!sizeof_element)
-               ?  elem_units
-               :  memory_algo->priv_get_total_units(elem_sizes[low_idx]*sizeof_element);
-            min_allocation = min_allocation*Alignment - AllocatedCtrlBytes + UsableByPreviousChunk;
-
-            size_type received_size = total_bytes;
-            void *ignore_reuse = 0;
-            void *ret = memory_algo->priv_allocate
-               (boost::interprocess::allocate_new, min_allocation, received_size, ignore_reuse);
-            if(!ret){
-               break;
-            }
-
-            block_ctrl *block = memory_algo->priv_get_block(ret);
-            size_type received_units = (size_type)block->m_size;
-            char *block_address = reinterpret_cast<char*>(block);
-
-            size_type total_used_units = 0;
-            while(total_used_units < received_units){
-               if(sizeof_element){
-                  elem_units = memory_algo->priv_get_total_units(elem_sizes[low_idx]*sizeof_element);
-                  elem_units = ptr_size_units > elem_units ? ptr_size_units : elem_units;
-               }
-               if(total_used_units + elem_units > received_units)
-                  break;
-               total_request_units -= elem_units;
-               //This is the position where the new block must be created
-               block_ctrl *new_block = move_detail::force_ptr<block_ctrl*>(block_address);
-               assert_alignment(new_block);
-
-               //The last block should take all the remaining space
-               if((low_idx + 1) == n_elements ||
-                  (total_used_units + elem_units +
-                  ((!sizeof_element)
-                     ? elem_units
-               : max_value(memory_algo->priv_get_total_units(elem_sizes[low_idx+1]*sizeof_element), ptr_size_units))
-                   > received_units)){
-                  //By default, the new block will use the rest of the buffer
-                  new_block->m_size = (received_units - total_used_units) & block_ctrl::size_mask;
-                  memory_algo->priv_mark_new_allocated_block(new_block);
-
-                  //If the remaining units are bigger than needed and we can
-                  //split it obtaining a new free memory block do it.
-                  if((received_units - total_used_units) >= (elem_units + MemoryAlgorithm::BlockCtrlUnits)){
-                     size_type shrunk_request = elem_units*Alignment - AllocatedCtrlBytes + UsableByPreviousChunk;
-                     size_type shrunk_received = shrunk_request;
-                     bool shrink_ok = shrink
-                           (memory_algo
-                           ,memory_algo->priv_get_user_buffer(new_block)
-                           ,shrunk_request
-                           ,shrunk_received);
-                     (void)shrink_ok;
-                     //Shrink must always succeed with passed parameters
-                     BOOST_ASSERT(shrink_ok);
-                     //Some sanity checks
-                     BOOST_ASSERT(shrunk_request == shrunk_received);
-                     BOOST_ASSERT(elem_units == ((shrunk_request-UsableByPreviousChunk)/Alignment + AllocatedCtrlUnits));
-                     //"new_block->m_size" must have been reduced to elem_units by "shrink"
-                     BOOST_ASSERT(new_block->m_size == elem_units);
-                     //Now update the total received units with the reduction
-                     received_units = elem_units + total_used_units;
-                  }
-               }
-               else{
-                  new_block->m_size = elem_units & block_ctrl::size_mask;
-                  memory_algo->priv_mark_new_allocated_block(new_block);
-               }
-
-               block_address += new_block->m_size*Alignment;
-               total_used_units += (size_type)new_block->m_size;
-               //Check we have enough room to overwrite the intrusive pointer
-               BOOST_ASSERT((new_block->m_size*Alignment - AllocatedCtrlUnits) >= sizeof(void_pointer));
-               void_pointer p = ::new(memory_algo->priv_get_user_buffer(new_block), boost_container_new_t())void_pointer(0);
-               chain.push_back(p);
-               ++low_idx;
-            }
-            //Sanity check
-            BOOST_ASSERT(total_used_units == received_units);
-         }
-
-         if(low_idx != n_elements){
-            priv_deallocate_many(memory_algo, chain);
-         }
-      }
-   }
-
-   static void priv_deallocate_many(MemoryAlgorithm *memory_algo, multiallocation_chain &chain)
-   {
-      while(!chain.empty()){
-         memory_algo->priv_deallocate(to_raw_pointer(chain.pop_front()));
-      }
-   }
-};
-
-}  //namespace ipcdetail {
-}  //namespace interprocess {
-}  //namespace boost {
-
-#include <boost/interprocess/detail/config_end.hpp>
-
-#endif   //#ifndef BOOST_INTERPROCESS_DETAIL_MEM_ALGO_COMMON_HPP
diff --git a/src/boost/interprocess/mem_algo/rbtree_best_fit.hpp b/src/boost/interprocess/mem_algo/rbtree_best_fit.hpp
deleted file mode 100644
index d1dd9d12..00000000
--- a/src/boost/interprocess/mem_algo/rbtree_best_fit.hpp
+++ /dev/null
@@ -1,1359 +0,0 @@
-//////////////////////////////////////////////////////////////////////////////
-//
-// (C) Copyright Ion Gaztanaga 2005-2012. Distributed under the Boost
-// 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/interprocess for documentation.
-//
-//////////////////////////////////////////////////////////////////////////////
-
-#ifndef BOOST_INTERPROCESS_MEM_ALGO_RBTREE_BEST_FIT_HPP
-#define BOOST_INTERPROCESS_MEM_ALGO_RBTREE_BEST_FIT_HPP
-
-#ifndef BOOST_CONFIG_HPP
-#  include <boost/config.hpp>
-#endif
-#
-#if defined(BOOST_HAS_PRAGMA_ONCE)
-#  pragma once
-#endif
-
-#include <boost/interprocess/detail/config_begin.hpp>
-#include <boost/interprocess/detail/workaround.hpp>
-
-// interprocess
-#include <boost/interprocess/containers/allocation_type.hpp>
-#include <boost/interprocess/exceptions.hpp>
-#include <boost/interprocess/interprocess_fwd.hpp>
-#include <boost/interprocess/mem_algo/detail/mem_algo_common.hpp>
-#include <boost/interprocess/offset_ptr.hpp>
-#include <boost/interprocess/sync/scoped_lock.hpp>
-// interprocess/detail
-#include <boost/interprocess/detail/min_max.hpp>
-#include <boost/interprocess/detail/math_functions.hpp>
-#include <boost/interprocess/detail/type_traits.hpp>
-#include <boost/interprocess/detail/utilities.hpp>
-// container
-#include <boost/container/detail/multiallocation_chain.hpp>
-// container/detail
-#include <boost/container/detail/placement_new.hpp>
-// move/detail
-#include <boost/move/detail/type_traits.hpp> //make_unsigned, alignment_of
-#include <boost/move/detail/force_ptr.hpp> //make_unsigned, alignment_of
-// intrusive
-#include <boost/intrusive/pointer_traits.hpp>
-#include <boost/intrusive/set.hpp>
-// other boost
-#include <boost/assert.hpp>
-#include <boost/static_assert.hpp>
-// std
-#include <climits>
-#include <cstring>
-
-//#define BOOST_INTERPROCESS_RBTREE_BEST_FIT_ABI_V1_HPP
-//to maintain ABI compatible with the original version
-//ABI had to be updated to fix compatibility issues when
-//sharing shared memory between 32 adn 64 bit processes.
-
-//!\file
-//!Describes a best-fit algorithm based in an intrusive red-black tree used to allocate
-//!objects in shared memory. This class is intended as a base class for single segment
-//!and multi-segment implementations.
-
-namespace boost {
-namespace interprocess {
-
-//!This class implements an algorithm that stores the free nodes in a red-black tree
-//!to have logarithmic search/insert times.
-template<class MutexFamily, class VoidPointer, std::size_t MemAlignment>
-class rbtree_best_fit
-{
-   #if !defined(BOOST_INTERPROCESS_DOXYGEN_INVOKED)
-   //Non-copyable
-   rbtree_best_fit();
-   rbtree_best_fit(const rbtree_best_fit &);
-   rbtree_best_fit &operator=(const rbtree_best_fit &);
-
-   private:
-   struct block_ctrl;
-   typedef typename boost::intrusive::
-      pointer_traits<VoidPointer>::template
-         rebind_pointer<block_ctrl>::type                   block_ctrl_ptr;
-
-   typedef typename boost::intrusive::
-      pointer_traits<VoidPointer>::template
-         rebind_pointer<char>::type                         char_ptr;
-
-   #endif   //#ifndef BOOST_INTERPROCESS_DOXYGEN_INVOKED
-
-   public:
-   //!Shared mutex family used for the rest of the Interprocess framework
-   typedef MutexFamily        mutex_family;
-   //!Pointer type to be used with the rest of the Interprocess framework
-   typedef VoidPointer        void_pointer;
-   typedef ipcdetail::basic_multiallocation_chain<VoidPointer>  multiallocation_chain;
-
-   typedef typename boost::intrusive::pointer_traits<char_ptr>::difference_type difference_type;
-   typedef typename boost::container::dtl::make_unsigned<difference_type>::type     size_type;
-
-   #if !defined(BOOST_INTERPROCESS_DOXYGEN_INVOKED)
-
-   private:
-
-   typedef typename bi::make_set_base_hook
-      < bi::void_pointer<VoidPointer>
-      , bi::optimize_size<true>
-      , bi::link_mode<bi::normal_link> >::type           TreeHook;
-
-   struct SizeHolder
-   {
-      static const size_type size_mask = size_type(-1) >> 2;
-      //!This block's memory size (including block_ctrl
-      //!header) in Alignment units
-      size_type m_prev_size;
-      size_type m_size      :  sizeof(size_type)*CHAR_BIT - 2;
-      size_type m_prev_allocated :  1;
-      size_type m_allocated :  1;
-   };
-
-   //!Block control structure
-   struct block_ctrl
-      :  public SizeHolder, public TreeHook
-   {
-      block_ctrl()
-      {  this->m_size = 0; this->m_allocated = 0, this->m_prev_allocated = 0;  }
-
-      friend bool operator<(const block_ctrl &a, const block_ctrl &b)
-      {  return a.m_size < b.m_size;  }
-      friend bool operator==(const block_ctrl &a, const block_ctrl &b)
-      {  return a.m_size == b.m_size;  }
-   };
-
-   struct size_block_ctrl_compare
-   {
-      bool operator()(size_type size, const block_ctrl &block) const
-      {  return size < block.m_size;  }
-
-      bool operator()(const block_ctrl &block, size_type size) const
-      {  return block.m_size < size;  }
-   };
-
-   //!Shared mutex to protect memory allocate/deallocate
-   typedef typename MutexFamily::mutex_type                       mutex_type;
-   typedef typename bi::make_multiset
-      <block_ctrl, bi::base_hook<TreeHook> >::type                Imultiset;
-
-   typedef typename Imultiset::iterator                           imultiset_iterator;
-   typedef typename Imultiset::const_iterator                     imultiset_const_iterator;
-
-   //!This struct includes needed data and derives from
-   //!mutex_type to allow EBO when using null mutex_type
-   struct header_t : public mutex_type
-   {
-      Imultiset            m_imultiset;
-
-      //!The extra size required by the segment
-      size_type            m_extra_hdr_bytes;
-      //!Allocated bytes for internal checking
-      size_type            m_allocated;
-      //!The size of the memory segment
-      size_type            m_size;
-   }  m_header;
-
-   friend class ipcdetail::memory_algorithm_common<rbtree_best_fit>;
-
-   typedef ipcdetail::memory_algorithm_common<rbtree_best_fit> algo_impl_t;
-
-   public:
-   #endif   //#ifndef BOOST_INTERPROCESS_DOXYGEN_INVOKED
-
-   //!Constructor. "size" is the total size of the managed memory segment,
-   //!"extra_hdr_bytes" indicates the extra bytes beginning in the sizeof(rbtree_best_fit)
-   //!offset that the allocator should not use at all.
-   rbtree_best_fit           (size_type size, size_type extra_hdr_bytes);
-
-   //!Destructor.
-   ~rbtree_best_fit();
-
-   //!Obtains the minimum size needed by the algorithm
-   static size_type get_min_size (size_type extra_hdr_bytes);
-
-   //Functions for single segment management
-
-   //!Allocates bytes, returns 0 if there is not more memory
-   void* allocate             (size_type nbytes);
-
-   #if !defined(BOOST_INTERPROCESS_DOXYGEN_INVOKED)
-
-   //Experimental. Dont' use
-
-   //!Multiple element allocation, same size
-   void allocate_many(size_type elem_bytes, size_type num_elements, multiallocation_chain &chain)
-   {
-      //-----------------------
-      boost::interprocess::scoped_lock<mutex_type> guard(m_header);
-      //-----------------------
-      algo_impl_t::allocate_many(this, elem_bytes, num_elements, chain);
-   }
-
-   //!Multiple element allocation, different size
-   void allocate_many(const size_type *elem_sizes, size_type n_elements, size_type sizeof_element, multiallocation_chain &chain)
-   {
-      //-----------------------
-      boost::interprocess::scoped_lock<mutex_type> guard(m_header);
-      //-----------------------
-      algo_impl_t::allocate_many(this, elem_sizes, n_elements, sizeof_element, chain);
-   }
-
-   //!Multiple element allocation, different size
-   void deallocate_many(multiallocation_chain &chain);
-
-   #endif   //#ifndef BOOST_INTERPROCESS_DOXYGEN_INVOKED
-
-   //!Deallocates previously allocated bytes
-   void   deallocate          (void *addr);
-
-   //!Returns the size of the memory segment
-   size_type get_size()  const;
-
-   //!Returns the number of free bytes of the segment
-   size_type get_free_memory()  const;
-
-   //!Initializes to zero all the memory that's not in use.
-   //!This function is normally used for security reasons.
-   void zero_free_memory();
-
-   //!Increases managed memory in
-   //!extra_size bytes more
-   void grow(size_type extra_size);
-
-   //!Decreases managed memory as much as possible
-   void shrink_to_fit();
-
-   //!Returns true if all allocated memory has been deallocated
-   bool all_memory_deallocated();
-
-   //!Makes an internal sanity check
-   //!and returns true if success
-   bool check_sanity();
-
-   template<class T>
-   T * allocation_command  (boost::interprocess::allocation_type command, size_type limit_size,
-                           size_type &prefer_in_recvd_out_size, T *&reuse);
-
-   void * raw_allocation_command (boost::interprocess::allocation_type command,   size_type limit_object,
-                              size_type &prefer_in_recvd_out_size,
-                              void *&reuse_ptr, size_type sizeof_object = 1);
-
-   //!Returns the size of the buffer previously allocated pointed by ptr
-   size_type size(const void *ptr) const;
-
-   //!Allocates aligned bytes, returns 0 if there is not more memory.
-   //!Alignment must be power of 2
-   void* allocate_aligned     (size_type nbytes, size_type alignment);
-
-   #if !defined(BOOST_INTERPROCESS_DOXYGEN_INVOKED)
-   private:
-   static size_type priv_first_block_offset_from_this(const void *this_ptr, size_type extra_hdr_bytes);
-
-   block_ctrl *priv_first_block();
-
-   block_ctrl *priv_end_block();
-
-   void* priv_allocation_command(boost::interprocess::allocation_type command,   size_type limit_size,
-                        size_type &prefer_in_recvd_out_size, void *&reuse_ptr, size_type sizeof_object);
-
-
-   //!Real allocation algorithm with min allocation option
-   void * priv_allocate( boost::interprocess::allocation_type command
-                       , size_type limit_size, size_type &prefer_in_recvd_out_size
-                       , void *&reuse_ptr, size_type backwards_multiple = 1);
-
-   //!Obtains the block control structure of the user buffer
-   static block_ctrl *priv_get_block(const void *ptr);
-
-   //!Obtains the pointer returned to the user from the block control
-   static void *priv_get_user_buffer(const block_ctrl *block);
-
-   //!Returns the number of total units that a user buffer
-   //!of "userbytes" bytes really occupies (including header)
-   static size_type priv_get_total_units(size_type userbytes);
-
-   //!Real expand function implementation
-   bool priv_expand(void *ptr, const size_type min_size, size_type &prefer_in_recvd_out_size);
-
-   //!Real expand to both sides implementation
-   void* priv_expand_both_sides(boost::interprocess::allocation_type command
-                               ,size_type min_size
-                               ,size_type &prefer_in_recvd_out_size
-                               ,void *reuse_ptr
-                               ,bool only_preferred_backwards
-                               ,size_type backwards_multiple);
-
-   //!Returns true if the previous block is allocated
-   bool priv_is_prev_allocated(block_ctrl *ptr);
-
-   //!Get a pointer of the "end" block from the first block of the segment
-   static block_ctrl * priv_end_block(block_ctrl *first_segment_block);
-
-   //!Get a pointer of the "first" block from the end block of the segment
-   static block_ctrl * priv_first_block(block_ctrl *end_segment_block);
-
-   //!Get poitner of the previous block (previous block must be free)
-   static block_ctrl * priv_prev_block(block_ctrl *ptr);
-
-   //!Get the size in the tail of the previous block
-   static block_ctrl * priv_next_block(block_ctrl *ptr);
-
-   //!Check if this block is free (not allocated)
-   bool priv_is_allocated_block(block_ctrl *ptr);
-
-   //!Marks the block as allocated
-   void priv_mark_as_allocated_block(block_ctrl *ptr);
-
-   //!Marks the block as allocated
-   void priv_mark_new_allocated_block(block_ctrl *ptr)
-   {  return priv_mark_as_allocated_block(ptr); }
-
-   //!Marks the block as allocated
-   void priv_mark_as_free_block(block_ctrl *ptr);
-
-   //!Checks if block has enough memory and splits/unlinks the block
-   //!returning the address to the users
-   void* priv_check_and_allocate(size_type units
-                                ,block_ctrl* block
-                                ,size_type &received_size);
-   //!Real deallocation algorithm
-   void priv_deallocate(void *addr);
-
-   //!Makes a new memory portion available for allocation
-   void priv_add_segment(void *addr, size_type size);
-
-   public:
-
-   static const size_type Alignment = !MemAlignment
-      ? size_type(::boost::container::dtl::alignment_of
-                  < ::boost::container::dtl::max_align_t>::value)
-      : size_type(MemAlignment)
-      ;
-
-   private:
-   //Due to embedded bits in size, Alignment must be at least 4
-   BOOST_STATIC_ASSERT((Alignment >= 4));
-   //Due to rbtree size optimizations, Alignment must have at least pointer alignment
-   BOOST_STATIC_ASSERT((Alignment >= ::boost::container::dtl::alignment_of<void_pointer>::value));
-   static const size_type AlignmentMask = (Alignment - 1);
-   static const size_type BlockCtrlBytes = ipcdetail::ct_rounded_size<sizeof(block_ctrl), Alignment>::value;
-   static const size_type BlockCtrlUnits = BlockCtrlBytes/Alignment;
-   static const size_type AllocatedCtrlBytes  = ipcdetail::ct_rounded_size<sizeof(SizeHolder), Alignment>::value;
-   static const size_type AllocatedCtrlUnits  = AllocatedCtrlBytes/Alignment;
-   static const size_type EndCtrlBlockBytes   = ipcdetail::ct_rounded_size<sizeof(SizeHolder), Alignment>::value;
-   static const size_type EndCtrlBlockUnits   = EndCtrlBlockBytes/Alignment;
-   static const size_type MinBlockUnits       = BlockCtrlUnits;
-   static const size_type UsableByPreviousChunk   = sizeof(size_type);
-
-   //Make sure the maximum alignment is power of two
-   BOOST_STATIC_ASSERT((0 == (Alignment & (Alignment - size_type(1u)))));
-   #endif   //#ifndef BOOST_INTERPROCESS_DOXYGEN_INVOKED
-   public:
-   static const size_type PayloadPerAllocation = AllocatedCtrlBytes - UsableByPreviousChunk;
-};
-
-#if !defined(BOOST_INTERPROCESS_DOXYGEN_INVOKED)
-
-template<class MutexFamily, class VoidPointer, std::size_t MemAlignment>
-inline typename rbtree_best_fit<MutexFamily, VoidPointer, MemAlignment>::size_type
-       rbtree_best_fit<MutexFamily, VoidPointer, MemAlignment>
-   ::priv_first_block_offset_from_this(const void *this_ptr, size_type extra_hdr_bytes)
-{
-   size_type uint_this      = (std::size_t)this_ptr;
-   size_type main_hdr_end   = uint_this + sizeof(rbtree_best_fit) + extra_hdr_bytes;
-   size_type aligned_main_hdr_end = ipcdetail::get_rounded_size(main_hdr_end, Alignment);
-   size_type block1_off = aligned_main_hdr_end -  uint_this;
-   algo_impl_t::assert_alignment(aligned_main_hdr_end);
-   algo_impl_t::assert_alignment(uint_this + block1_off);
-   return block1_off;
-}
-
-template<class MutexFamily, class VoidPointer, std::size_t MemAlignment>
-void rbtree_best_fit<MutexFamily, VoidPointer, MemAlignment>::
-   priv_add_segment(void *addr, size_type segment_size)
-{
-   //Check alignment
-   algo_impl_t::check_alignment(addr);
-   //Check size
-   BOOST_ASSERT(segment_size >= (BlockCtrlBytes + EndCtrlBlockBytes));
-
-   //Initialize the first big block and the "end" node
-   block_ctrl *first_big_block = ::new(addr, boost_container_new_t()) block_ctrl;
-   first_big_block->m_size = (segment_size/Alignment - EndCtrlBlockUnits) & block_ctrl::size_mask;
-   BOOST_ASSERT(first_big_block->m_size >= BlockCtrlUnits);
-
-   //The "end" node is just a node of size 0 with the "end" bit set
-   SizeHolder *end_block =
-      ::new(reinterpret_cast<char*>(addr) + first_big_block->m_size*Alignment, boost_container_new_t()) SizeHolder;
-
-   //This will overwrite the prev part of the "end" node
-   priv_mark_as_free_block (first_big_block);
-   #ifdef BOOST_INTERPROCESS_RBTREE_BEST_FIT_ABI_V1_HPP
-   first_big_block->m_prev_size = end_block->m_size =
-      size_type(reinterpret_cast<char*>(first_big_block) - reinterpret_cast<char*>(end_block))/Alignmen) & block_ctrl::size_mask;
-   #else
-   first_big_block->m_prev_size = end_block->m_size =
-      size_type(reinterpret_cast<char*>(end_block) - reinterpret_cast<char*>(first_big_block))/Alignment & block_ctrl::size_mask;
-   #endif
-   end_block->m_allocated = 1;
-   first_big_block->m_prev_allocated = 1;
-
-   BOOST_ASSERT(priv_next_block(first_big_block) == end_block);
-   BOOST_ASSERT(priv_prev_block((block_ctrl*)end_block) == first_big_block);
-   BOOST_ASSERT(priv_first_block() == first_big_block);
-   BOOST_ASSERT(priv_end_block() == end_block);
-
-   //Some check to validate the algorithm, since it makes some assumptions
-   //to optimize the space wasted in bookkeeping:
-
-   //Check that the sizes of the header are placed before the rbtree
-   BOOST_ASSERT(static_cast<void*>(static_cast<SizeHolder*>(first_big_block))
-          < static_cast<void*>(static_cast<TreeHook*>(first_big_block)));
-   //Insert it in the intrusive containers
-   m_header.m_imultiset.insert(*first_big_block);
-}
-
-template<class MutexFamily, class VoidPointer, std::size_t MemAlignment>
-inline typename rbtree_best_fit<MutexFamily, VoidPointer, MemAlignment>::block_ctrl *
-       rbtree_best_fit<MutexFamily, VoidPointer, MemAlignment>
-   ::priv_first_block()
-{
-   const size_type block1_off = priv_first_block_offset_from_this(this, m_header.m_extra_hdr_bytes);
-   return move_detail::force_ptr<block_ctrl*>(reinterpret_cast<char*>(this) + block1_off);
-}
-
-template<class MutexFamily, class VoidPointer, std::size_t MemAlignment>
-inline typename rbtree_best_fit<MutexFamily, VoidPointer, MemAlignment>::block_ctrl *
-       rbtree_best_fit<MutexFamily, VoidPointer, MemAlignment>
-   ::priv_end_block()
-{
-   const size_type block1_off = priv_first_block_offset_from_this(this, m_header.m_extra_hdr_bytes);
-   const size_type original_first_block_size = (m_header.m_size - block1_off)/Alignment - EndCtrlBlockUnits;
-   block_ctrl *end_block = move_detail::force_ptr<block_ctrl*>
-      (reinterpret_cast<char*>(this) + block1_off + original_first_block_size*Alignment);
-   return end_block;
-}
-
-template<class MutexFamily, class VoidPointer, std::size_t MemAlignment>
-inline rbtree_best_fit<MutexFamily, VoidPointer, MemAlignment>::
-   rbtree_best_fit(size_type segment_size, size_type extra_hdr_bytes)
-{
-   //Initialize the header
-   m_header.m_allocated       = 0;
-   m_header.m_size            = segment_size;
-   m_header.m_extra_hdr_bytes = extra_hdr_bytes;
-
-   //Now write calculate the offset of the first big block that will
-   //cover the whole segment
-   BOOST_ASSERT(get_min_size(extra_hdr_bytes) <= segment_size);
-   size_type block1_off  = priv_first_block_offset_from_this(this, extra_hdr_bytes);
-   priv_add_segment(reinterpret_cast<char*>(this) + block1_off, segment_size - block1_off);
-}
-
-template<class MutexFamily, class VoidPointer, std::size_t MemAlignment>
-inline rbtree_best_fit<MutexFamily, VoidPointer, MemAlignment>::~rbtree_best_fit()
-{
-   //There is a memory leak!
-//   BOOST_ASSERT(m_header.m_allocated == 0);
-//   BOOST_ASSERT(m_header.m_root.m_next->m_next == block_ctrl_ptr(&m_header.m_root));
-}
-
-template<class MutexFamily, class VoidPointer, std::size_t MemAlignment>
-void rbtree_best_fit<MutexFamily, VoidPointer, MemAlignment>::grow(size_type extra_size)
-{
-   //Get the address of the first block
-   block_ctrl *first_block = priv_first_block();
-   block_ctrl *old_end_block = priv_end_block();
-   size_type old_border_offset = (size_type)(reinterpret_cast<char*>(old_end_block) -
-                                    reinterpret_cast<char*>(this)) + EndCtrlBlockBytes;
-
-   //Update managed buffer's size
-   m_header.m_size += extra_size;
-
-   //We need at least MinBlockUnits blocks to create a new block
-   if((m_header.m_size - old_border_offset) < MinBlockUnits){
-      return;
-   }
-
-   //Now create a new block between the old end and the new end
-   size_type align_offset = (m_header.m_size - old_border_offset)/Alignment;
-   block_ctrl *new_end_block = move_detail::force_ptr<block_ctrl*>
-      (reinterpret_cast<char*>(old_end_block) + align_offset*Alignment);
-
-   //the last and first block are special:
-   //new_end_block->m_size & first_block->m_prev_size store the absolute value
-   //between them
-   new_end_block->m_allocated = 1;
-   #ifdef BOOST_INTERPROCESS_RBTREE_BEST_FIT_ABI_V1_HPP
-   new_end_block->m_size      = size_type(reinterpret_cast<char*>(first_block) -
-                                          reinterpret_cast<char*>(new_end_block))/Alignment & block_ctrl::size_mask;
-   #else
-   new_end_block->m_size      = size_type(reinterpret_cast<char*>(new_end_block) -
-                                          reinterpret_cast<char*>(first_block))/Alignment & block_ctrl::size_mask;
-   #endif
-   first_block->m_prev_size = new_end_block->m_size;
-   first_block->m_prev_allocated = 1;
-   BOOST_ASSERT(new_end_block == priv_end_block());
-
-   //The old end block is the new block
-   block_ctrl *new_block = old_end_block;
-   new_block->m_size = size_type(reinterpret_cast<char*>(new_end_block) -
-                                 reinterpret_cast<char*>(new_block))/Alignment & block_ctrl::size_mask;
-   BOOST_ASSERT(new_block->m_size >= BlockCtrlUnits);
-   priv_mark_as_allocated_block(new_block);
-   BOOST_ASSERT(priv_next_block(new_block) == new_end_block);
-
-   m_header.m_allocated += (size_type)new_block->m_size*Alignment;
-
-   //Now deallocate the newly created block
-   this->priv_deallocate(priv_get_user_buffer(new_block));
-}
-
-template<class MutexFamily, class VoidPointer, std::size_t MemAlignment>
-void rbtree_best_fit<MutexFamily, VoidPointer, MemAlignment>::shrink_to_fit()
-{
-   //Get the address of the first block
-   block_ctrl *first_block = priv_first_block();
-   algo_impl_t::assert_alignment(first_block);
-
-   //block_ctrl *old_end_block = priv_end_block(first_block);
-   block_ctrl *old_end_block = priv_end_block();
-   algo_impl_t::assert_alignment(old_end_block);
-   size_type old_end_block_size = old_end_block->m_size;
-
-   void *unique_buffer = 0;
-   block_ctrl *last_block;
-   //Check if no memory is allocated between the first and last block
-   if(priv_next_block(first_block) == old_end_block){
-      //If so check if we can allocate memory
-      size_type ignore_recvd = 0;
-      void *ignore_reuse = 0;
-      unique_buffer = priv_allocate(boost::interprocess::allocate_new, 0, ignore_recvd, ignore_reuse);
-      //If not, return, we can't shrink
-      if(!unique_buffer)
-         return;
-      //If we can, mark the position just after the new allocation as the new end
-      algo_impl_t::assert_alignment(unique_buffer);
-      block_ctrl *unique_block = priv_get_block(unique_buffer);
-      BOOST_ASSERT(priv_is_allocated_block(unique_block));
-      algo_impl_t::assert_alignment(unique_block);
-      last_block = priv_next_block(unique_block);
-      BOOST_ASSERT(!priv_is_allocated_block(last_block));
-      algo_impl_t::assert_alignment(last_block);
-   }
-   else{
-      //If memory is allocated, check if the last block is allocated
-      if(priv_is_prev_allocated(old_end_block))
-         return;
-      //If not, mark last block after the free block
-      last_block = priv_prev_block(old_end_block);
-   }
-
-   size_type last_block_size = last_block->m_size;
-
-   //Erase block from the free tree, since we will erase it
-   m_header.m_imultiset.erase(Imultiset::s_iterator_to(*last_block));
-
-   size_type shrunk_border_offset = (size_type)(reinterpret_cast<char*>(last_block) -
-                                       reinterpret_cast<char*>(this)) + EndCtrlBlockBytes;
-
-   block_ctrl *new_end_block = last_block;
-   algo_impl_t::assert_alignment(new_end_block);
-
-   //Write new end block attributes
-   #ifdef BOOST_INTERPROCESS_RBTREE_BEST_FIT_ABI_V1_HPP
-   new_end_block->m_size = 
-      size_type(reinterpret_cast<char*>(first_block) - reinterpret_cast<char*>(new_end_block))/Alignment & block_ctrl::size_mask;
-   first_block->m_prev_size = new_end_block->m_size;
-   #else
-   new_end_block->m_size =
-      size_type(reinterpret_cast<char*>(new_end_block) - reinterpret_cast<char*>(first_block))/Alignment & block_ctrl::size_mask;
-   first_block->m_prev_size = new_end_block->m_size;
-   #endif
-
-   new_end_block->m_allocated = 1;
-   (void)last_block_size;
-   (void)old_end_block_size;
-   BOOST_ASSERT(new_end_block->m_size == (old_end_block_size - last_block_size));
-
-   //Update managed buffer's size
-   m_header.m_size = shrunk_border_offset & block_ctrl::size_mask;
-   BOOST_ASSERT(priv_end_block() == new_end_block);
-   if(unique_buffer)
-      priv_deallocate(unique_buffer);
-}
-
-template<class MutexFamily, class VoidPointer, std::size_t MemAlignment>
-inline typename rbtree_best_fit<MutexFamily, VoidPointer, MemAlignment>::size_type
-rbtree_best_fit<MutexFamily, VoidPointer, MemAlignment>::get_size()  const
-{  return m_header.m_size;  }
-
-template<class MutexFamily, class VoidPointer, std::size_t MemAlignment>
-typename rbtree_best_fit<MutexFamily, VoidPointer, MemAlignment>::size_type
-rbtree_best_fit<MutexFamily, VoidPointer, MemAlignment>::get_free_memory()  const
-{
-   return m_header.m_size - m_header.m_allocated -
-      priv_first_block_offset_from_this(this, m_header.m_extra_hdr_bytes);
-}
-
-template<class MutexFamily, class VoidPointer, std::size_t MemAlignment>
-typename rbtree_best_fit<MutexFamily, VoidPointer, MemAlignment>::size_type
-rbtree_best_fit<MutexFamily, VoidPointer, MemAlignment>::
-   get_min_size (size_type extra_hdr_bytes)
-{
-   return (algo_impl_t::ceil_units(sizeof(rbtree_best_fit)) +
-           algo_impl_t::ceil_units(extra_hdr_bytes) +
-           MinBlockUnits + EndCtrlBlockUnits)*Alignment;
-}
-
-template<class MutexFamily, class VoidPointer, std::size_t MemAlignment>
-inline bool rbtree_best_fit<MutexFamily, VoidPointer, MemAlignment>::
-    all_memory_deallocated()
-{
-   //-----------------------
-   boost::interprocess::scoped_lock<mutex_type> guard(m_header);
-   //-----------------------
-   size_type block1_off  =
-      priv_first_block_offset_from_this(this, m_header.m_extra_hdr_bytes);
-
-   return m_header.m_allocated == 0 &&
-      m_header.m_imultiset.begin() != m_header.m_imultiset.end() &&
-       (++m_header.m_imultiset.begin()) == m_header.m_imultiset.end()
-       && m_header.m_imultiset.begin()->m_size ==
-         (m_header.m_size - block1_off - EndCtrlBlockBytes)/Alignment;
-}
-
-template<class MutexFamily, class VoidPointer, std::size_t MemAlignment>
-bool rbtree_best_fit<MutexFamily, VoidPointer, MemAlignment>::
-    check_sanity()
-{
-   //-----------------------
-   boost::interprocess::scoped_lock<mutex_type> guard(m_header);
-   //-----------------------
-   imultiset_iterator ib(m_header.m_imultiset.begin()), ie(m_header.m_imultiset.end());
-
-   size_type free_memory = 0;
-
-   //Iterate through all blocks obtaining their size
-   for(; ib != ie; ++ib){
-      free_memory += (size_type)ib->m_size*Alignment;
-      if(!algo_impl_t::check_alignment(&*ib))
-         return false;
-   }
-
-   //Check allocated bytes are less than size
-   if(m_header.m_allocated > m_header.m_size){
-      return false;
-   }
-
-   size_type block1_off  =
-      priv_first_block_offset_from_this(this, m_header.m_extra_hdr_bytes);
-
-   //Check free bytes are less than size
-   if(free_memory > (m_header.m_size - block1_off)){
-      return false;
-   }
-   return true;
-}
-
-template<class MutexFamily, class VoidPointer, std::size_t MemAlignment>
-inline void* rbtree_best_fit<MutexFamily, VoidPointer, MemAlignment>::
-   allocate(size_type nbytes)
-{
-   //-----------------------
-   boost::interprocess::scoped_lock<mutex_type> guard(m_header);
-   //-----------------------
-   size_type ignore_recvd = nbytes;
-   void *ignore_reuse = 0;
-   return priv_allocate(boost::interprocess::allocate_new, nbytes, ignore_recvd, ignore_reuse);
-}
-
-template<class MutexFamily, class VoidPointer, std::size_t MemAlignment>
-inline void* rbtree_best_fit<MutexFamily, VoidPointer, MemAlignment>::
-   allocate_aligned(size_type nbytes, size_type alignment)
-{
-   //-----------------------
-   boost::interprocess::scoped_lock<mutex_type> guard(m_header);
-   //-----------------------
-   return algo_impl_t::allocate_aligned(this, nbytes, alignment);
-}
-
-template<class MutexFamily, class VoidPointer, std::size_t MemAlignment>
-template<class T>
-inline T* rbtree_best_fit<MutexFamily, VoidPointer, MemAlignment>::
-   allocation_command  (boost::interprocess::allocation_type command,   size_type limit_size,
-                        size_type &prefer_in_recvd_out_size, T *&reuse)
-{
-   void* raw_reuse = reuse;
-   void* const ret = priv_allocation_command(command, limit_size, prefer_in_recvd_out_size, raw_reuse, sizeof(T));
-   reuse = static_cast<T*>(raw_reuse);
-   BOOST_ASSERT(0 == ((std::size_t)ret % ::boost::container::dtl::alignment_of<T>::value));
-   return static_cast<T*>(ret);
-}
-
-template<class MutexFamily, class VoidPointer, std::size_t MemAlignment>
-inline void* rbtree_best_fit<MutexFamily, VoidPointer, MemAlignment>::
-   raw_allocation_command  (boost::interprocess::allocation_type command,   size_type limit_objects,
-                        size_type &prefer_in_recvd_out_objects, void *&reuse_ptr, size_type sizeof_object)
-{
-   size_type const preferred_objects = prefer_in_recvd_out_objects;
-   if(!sizeof_object)
-      return reuse_ptr = 0, static_cast<void*>(0);
-   if(command & boost::interprocess::try_shrink_in_place){
-      if(!reuse_ptr)  return static_cast<void*>(0);
-      const bool success = algo_impl_t::try_shrink
-         ( this, reuse_ptr, limit_objects*sizeof_object
-         , prefer_in_recvd_out_objects = preferred_objects*sizeof_object);
-      prefer_in_recvd_out_objects /= sizeof_object;
-      return success ? reuse_ptr : 0;
-   }
-   else{
-      return priv_allocation_command
-         (command, limit_objects, prefer_in_recvd_out_objects, reuse_ptr, sizeof_object);
-   }
-}
-
-
-template<class MutexFamily, class VoidPointer, std::size_t MemAlignment>
-inline void* rbtree_best_fit<MutexFamily, VoidPointer, MemAlignment>::
-   priv_allocation_command (boost::interprocess::allocation_type command,   size_type limit_size,
-                       size_type &prefer_in_recvd_out_size,
-                       void *&reuse_ptr, size_type sizeof_object)
-{
-   void* ret;
-   size_type const preferred_size = prefer_in_recvd_out_size;
-   size_type const max_count = m_header.m_size/sizeof_object;
-   if(limit_size > max_count || preferred_size > max_count){
-      return reuse_ptr = 0, static_cast<void*>(0);
-   }
-   size_type l_size = limit_size*sizeof_object;
-   size_type p_size = preferred_size*sizeof_object;
-   size_type r_size;
-   {
-      //-----------------------
-      boost::interprocess::scoped_lock<mutex_type> guard(m_header);
-      //-----------------------
-      ret = priv_allocate(command, l_size, r_size = p_size, reuse_ptr, sizeof_object);
-   }
-   prefer_in_recvd_out_size = r_size/sizeof_object;
-   return ret;
-}
-
-template<class MutexFamily, class VoidPointer, std::size_t MemAlignment>
-typename rbtree_best_fit<MutexFamily, VoidPointer, MemAlignment>::size_type
-rbtree_best_fit<MutexFamily, VoidPointer, MemAlignment>::
-   size(const void *ptr) const
-{
-   //We need no synchronization since this block's size is not going
-   //to be modified by anyone else
-   //Obtain the real size of the block
-   return ((size_type)priv_get_block(ptr)->m_size - AllocatedCtrlUnits)*Alignment + UsableByPreviousChunk;
-}
-
-template<class MutexFamily, class VoidPointer, std::size_t MemAlignment>
-inline void rbtree_best_fit<MutexFamily, VoidPointer, MemAlignment>::zero_free_memory()
-{
-   //-----------------------
-   boost::interprocess::scoped_lock<mutex_type> guard(m_header);
-   //-----------------------
-   imultiset_iterator ib(m_header.m_imultiset.begin()), ie(m_header.m_imultiset.end());
-
-   //Iterate through all blocks obtaining their size
-   while(ib != ie){
-      //Just clear user the memory part reserved for the user
-      volatile char *ptr = reinterpret_cast<char*>(&*ib) + BlockCtrlBytes;
-      size_type s = (size_type)ib->m_size*Alignment - BlockCtrlBytes;
-      while(s--){
-         *ptr++ = 0;
-      }
-
-      //This surprisingly is optimized out by Visual C++ 7.1 in release mode!
-      //std::memset( reinterpret_cast<char*>(&*ib) + BlockCtrlBytes
-      //           , 0
-      //           , ib->m_size*Alignment - BlockCtrlBytes);
-      ++ib;
-   }
-}
-
-template<class MutexFamily, class VoidPointer, std::size_t MemAlignment>
-void* rbtree_best_fit<MutexFamily, VoidPointer, MemAlignment>::
-   priv_expand_both_sides(boost::interprocess::allocation_type command
-                         ,size_type min_size
-                         ,size_type &prefer_in_recvd_out_size
-                         ,void *reuse_ptr
-                         ,bool only_preferred_backwards
-                         ,size_type backwards_multiple)
-{
-   size_type const preferred_size = prefer_in_recvd_out_size;
-   algo_impl_t::assert_alignment(reuse_ptr);
-   if(command & boost::interprocess::expand_fwd){
-      if(priv_expand(reuse_ptr, min_size, prefer_in_recvd_out_size = preferred_size))
-         return reuse_ptr;
-   }
-   else{
-      prefer_in_recvd_out_size = this->size(reuse_ptr);
-      if(prefer_in_recvd_out_size >= preferred_size || prefer_in_recvd_out_size >= min_size)
-         return reuse_ptr;
-   }
-
-   if(backwards_multiple){
-      BOOST_ASSERT(0 == (min_size       % backwards_multiple));
-      BOOST_ASSERT(0 == (preferred_size % backwards_multiple));
-   }
-
-   if(command & boost::interprocess::expand_bwd){
-      //Obtain the real size of the block
-      block_ctrl *reuse = priv_get_block(reuse_ptr);
-
-      //Sanity check
-      algo_impl_t::assert_alignment(reuse);
-
-      block_ctrl *prev_block;
-
-      //If the previous block is not free, there is nothing to do
-      if(priv_is_prev_allocated(reuse)){
-         return 0;
-      }
-
-      prev_block = priv_prev_block(reuse);
-      BOOST_ASSERT(!priv_is_allocated_block(prev_block));
-
-      //Some sanity checks
-      BOOST_ASSERT(prev_block->m_size == reuse->m_prev_size);
-      algo_impl_t::assert_alignment(prev_block);
-
-      size_type needs_backwards_aligned;
-      size_type lcm;
-      if(!algo_impl_t::calculate_lcm_and_needs_backwards_lcmed
-         ( backwards_multiple
-         , prefer_in_recvd_out_size
-         , only_preferred_backwards ? preferred_size : min_size
-         , lcm, needs_backwards_aligned)){
-         return 0;
-      }
-
-      //Check if previous block has enough size
-      if(size_type(prev_block->m_size*Alignment) >= needs_backwards_aligned){
-         //Now take all next space. This will succeed
-         if(command & boost::interprocess::expand_fwd){
-            size_type received_size2;
-            if(!priv_expand(reuse_ptr, prefer_in_recvd_out_size, received_size2 = prefer_in_recvd_out_size)){
-               BOOST_ASSERT(0);
-            }
-            BOOST_ASSERT(prefer_in_recvd_out_size == received_size2);
-         }
-         //We need a minimum size to split the previous one
-         if(prev_block->m_size >= (needs_backwards_aligned/Alignment + BlockCtrlUnits)){
-            block_ctrl *new_block = move_detail::force_ptr<block_ctrl*>
-               (reinterpret_cast<char*>(reuse) - needs_backwards_aligned);
-
-            //Free old previous buffer
-            new_block->m_size =
-               (AllocatedCtrlUnits + (needs_backwards_aligned + (prefer_in_recvd_out_size - UsableByPreviousChunk))/Alignment) & block_ctrl::size_mask;
-            BOOST_ASSERT(new_block->m_size >= BlockCtrlUnits);
-            priv_mark_as_allocated_block(new_block);
-
-            prev_block->m_size = size_type(reinterpret_cast<char*>(new_block) -
-                                           reinterpret_cast<char*>(prev_block))/Alignment & block_ctrl::size_mask;
-            BOOST_ASSERT(prev_block->m_size >= BlockCtrlUnits);
-            priv_mark_as_free_block(prev_block);
-
-            //Update the old previous block in the free blocks tree
-            //If the new size fulfills tree invariants do nothing,
-            //otherwise erase() + insert()
-            {
-               imultiset_iterator prev_block_it(Imultiset::s_iterator_to(*prev_block));
-               imultiset_iterator was_smaller_it(prev_block_it);
-               if(prev_block_it != m_header.m_imultiset.begin() &&
-                  (--(was_smaller_it = prev_block_it))->m_size > prev_block->m_size){
-                  m_header.m_imultiset.erase(prev_block_it);
-                  m_header.m_imultiset.insert(m_header.m_imultiset.begin(), *prev_block);
-               }
-            }
-
-            prefer_in_recvd_out_size = needs_backwards_aligned + prefer_in_recvd_out_size;
-            m_header.m_allocated += needs_backwards_aligned;
-
-            //Check alignment
-            algo_impl_t::assert_alignment(new_block);
-
-            //If the backwards expansion has remaining bytes in the
-            //first bytes, fill them with a pattern
-            void *p = priv_get_user_buffer(new_block);
-            void *user_ptr = reinterpret_cast<char*>(p);
-            BOOST_ASSERT(size_type(static_cast<char*>(reuse_ptr) - static_cast<char*>(user_ptr)) % backwards_multiple == 0);
-            algo_impl_t::assert_alignment(user_ptr);
-            return user_ptr;
-         }
-         //Check if there is no place to create a new block and
-         //the whole new block is multiple of the backwards expansion multiple
-         else if(prev_block->m_size >= needs_backwards_aligned/Alignment &&
-                 0 == ((prev_block->m_size*Alignment) % lcm)) {
-            //Erase old previous block, since we will change it
-            m_header.m_imultiset.erase(Imultiset::s_iterator_to(*prev_block));
-
-            //Just merge the whole previous block
-            //prev_block->m_size*Alignment is multiple of lcm (and backwards_multiple)
-            prefer_in_recvd_out_size = prefer_in_recvd_out_size + (size_type)prev_block->m_size*Alignment;
-
-            m_header.m_allocated += (size_type)prev_block->m_size*Alignment;
-            //Now update sizes
-            prev_block->m_size = size_type(prev_block->m_size + reuse->m_size) & block_ctrl::size_mask;
-            BOOST_ASSERT(prev_block->m_size >= BlockCtrlUnits);
-            priv_mark_as_allocated_block(prev_block);
-
-            //If the backwards expansion has remaining bytes in the
-            //first bytes, fill them with a pattern
-            void *user_ptr = priv_get_user_buffer(prev_block);
-            BOOST_ASSERT(size_type(static_cast<char*>(reuse_ptr) - static_cast<char*>(user_ptr)) % backwards_multiple == 0);
-            algo_impl_t::assert_alignment(user_ptr);
-            return user_ptr;
-         }
-         else{
-            //Alignment issues
-         }
-      }
-   }
-   return 0;
-}
-
-template<class MutexFamily, class VoidPointer, std::size_t MemAlignment>
-inline void rbtree_best_fit<MutexFamily, VoidPointer, MemAlignment>::
-   deallocate_many(typename rbtree_best_fit<MutexFamily, VoidPointer, MemAlignment>::multiallocation_chain &chain)
-{
-   //-----------------------
-   boost::interprocess::scoped_lock<mutex_type> guard(m_header);
-   //-----------------------
-   algo_impl_t::deallocate_many(this, chain);
-}
-
-template<class MutexFamily, class VoidPointer, std::size_t MemAlignment>
-void * rbtree_best_fit<MutexFamily, VoidPointer, MemAlignment>::
-   priv_allocate(boost::interprocess::allocation_type command
-                ,size_type limit_size
-                ,size_type &prefer_in_recvd_out_size
-                ,void *&reuse_ptr
-               ,size_type backwards_multiple)
-{
-   size_type const preferred_size = prefer_in_recvd_out_size;
-   if(command & boost::interprocess::shrink_in_place){
-      if(!reuse_ptr)  return static_cast<void*>(0);
-      bool success =
-         algo_impl_t::shrink(this, reuse_ptr, limit_size, prefer_in_recvd_out_size = preferred_size);
-      return success ? reuse_ptr : 0;
-   }
-
-   prefer_in_recvd_out_size = 0;
-
-   if(limit_size > preferred_size)
-      return reuse_ptr = 0, static_cast<void*>(0);
-
-   //Number of units to request (including block_ctrl header)
-   size_type preferred_units = priv_get_total_units(preferred_size);
-
-   //Number of units to request (including block_ctrl header)
-   size_type limit_units = priv_get_total_units(limit_size);
-
-   //Expand in place
-   prefer_in_recvd_out_size = preferred_size;
-   if(reuse_ptr && (command & (boost::interprocess::expand_fwd | boost::interprocess::expand_bwd))){
-      void *ret = priv_expand_both_sides
-         (command, limit_size, prefer_in_recvd_out_size, reuse_ptr, true, backwards_multiple);
-      if(ret)
-         return ret;
-   }
-
-   if(command & boost::interprocess::allocate_new){
-      size_block_ctrl_compare comp;
-      imultiset_iterator it(m_header.m_imultiset.lower_bound(preferred_units, comp));
-
-      if(it != m_header.m_imultiset.end()){
-         return reuse_ptr = 0, this->priv_check_and_allocate
-            (preferred_units, ipcdetail::to_raw_pointer(&*it), prefer_in_recvd_out_size);
-      }
-
-      if(it != m_header.m_imultiset.begin()&&
-              (--it)->m_size >= limit_units){
-         return reuse_ptr = 0, this->priv_check_and_allocate
-            (it->m_size, ipcdetail::to_raw_pointer(&*it), prefer_in_recvd_out_size);
-      }
-   }
-
-
-   //Now try to expand both sides with min size
-   if(reuse_ptr && (command & (boost::interprocess::expand_fwd | boost::interprocess::expand_bwd))){
-      return priv_expand_both_sides
-         (command, limit_size, prefer_in_recvd_out_size = preferred_size, reuse_ptr, false, backwards_multiple);
-   }
-   return reuse_ptr = 0, static_cast<void*>(0);
-}
-
-template<class MutexFamily, class VoidPointer, std::size_t MemAlignment>
-inline
-typename rbtree_best_fit<MutexFamily, VoidPointer, MemAlignment>::block_ctrl *
-   rbtree_best_fit<MutexFamily, VoidPointer, MemAlignment>::priv_get_block(const void *ptr)
-{
-   return const_cast<block_ctrl*>
-      (move_detail::force_ptr<const block_ctrl*>
-         (reinterpret_cast<const char*>(ptr) - AllocatedCtrlBytes));
-}
-
-template<class MutexFamily, class VoidPointer, std::size_t MemAlignment>
-inline
-void *rbtree_best_fit<MutexFamily, VoidPointer, MemAlignment>::
-      priv_get_user_buffer(const typename rbtree_best_fit<MutexFamily, VoidPointer, MemAlignment>::block_ctrl *block)
-{  return const_cast<char*>(reinterpret_cast<const char*>(block) + AllocatedCtrlBytes);   }
-
-template<class MutexFamily, class VoidPointer, std::size_t MemAlignment>
-inline typename rbtree_best_fit<MutexFamily, VoidPointer, MemAlignment>::size_type
-rbtree_best_fit<MutexFamily, VoidPointer, MemAlignment>::
-   priv_get_total_units(size_type userbytes)
-{
-   if(userbytes < UsableByPreviousChunk)
-      userbytes = UsableByPreviousChunk;
-   size_type units = ipcdetail::get_rounded_size(userbytes - UsableByPreviousChunk, Alignment)/Alignment + AllocatedCtrlUnits;
-   if(units < BlockCtrlUnits) units = BlockCtrlUnits;
-   return units;
-}
-
-template<class MutexFamily, class VoidPointer, std::size_t MemAlignment>
-bool rbtree_best_fit<MutexFamily, VoidPointer, MemAlignment>::
-   priv_expand (void *ptr, const size_type min_size, size_type &prefer_in_recvd_out_size)
-{
-   size_type const preferred_size = prefer_in_recvd_out_size;
-   //Obtain the real size of the block
-   block_ctrl *block = priv_get_block(ptr);
-   size_type old_block_units = block->m_size;
-
-   //The block must be marked as allocated and the sizes must be equal
-   BOOST_ASSERT(priv_is_allocated_block(block));
-
-   //Put this to a safe value
-   prefer_in_recvd_out_size = (old_block_units - AllocatedCtrlUnits)*Alignment + UsableByPreviousChunk;
-   if(prefer_in_recvd_out_size >= preferred_size || prefer_in_recvd_out_size >= min_size)
-      return true;
-
-   //Now translate it to Alignment units
-   const size_type min_user_units = algo_impl_t::ceil_units(min_size - UsableByPreviousChunk);
-   const size_type preferred_user_units = algo_impl_t::ceil_units(preferred_size - UsableByPreviousChunk);
-
-   //Some parameter checks
-   BOOST_ASSERT(min_user_units <= preferred_user_units);
-
-   block_ctrl *next_block;
-
-   if(priv_is_allocated_block(next_block = priv_next_block(block))){
-      return prefer_in_recvd_out_size >= min_size;
-   }
-   algo_impl_t::assert_alignment(next_block);
-
-   //Is "block" + "next_block" big enough?
-   const size_type merged_units = old_block_units + (size_type)next_block->m_size;
-
-   //Now get the expansion size
-   const size_type merged_user_units = merged_units - AllocatedCtrlUnits;
-
-   if(merged_user_units < min_user_units){
-      prefer_in_recvd_out_size = merged_units*Alignment - UsableByPreviousChunk;
-      return false;
-   }
-
-   //Now get the maximum size the user can allocate
-   size_type intended_user_units = (merged_user_units < preferred_user_units) ?
-      merged_user_units : preferred_user_units;
-
-   //These are total units of the merged block (supposing the next block can be split)
-   const size_type intended_units = AllocatedCtrlUnits + intended_user_units;
-
-   //Check if we can split the next one in two parts
-   if((merged_units - intended_units) >=  BlockCtrlUnits){
-      //This block is bigger than needed, split it in
-      //two blocks, the first one will be merged and
-      //the second's size will be the remaining space
-      BOOST_ASSERT(next_block->m_size == priv_next_block(next_block)->m_prev_size);
-      const size_type rem_units = merged_units - intended_units;
-
-      //Check if we we need to update the old next block in the free blocks tree
-      //If the new size fulfills tree invariants, we just need to replace the node
-      //(the block start has been displaced), otherwise erase() + insert().
-      //
-      //This fixup must be done in two parts, because the new next block might
-      //overwrite the tree hook of the old next block. So we first erase the
-      //old if needed and we'll insert the new one after creating the new next
-      imultiset_iterator old_next_block_it(Imultiset::s_iterator_to(*next_block));
-      m_header.m_imultiset.erase(old_next_block_it);
-
-      //This is the remaining block
-      block_ctrl *rem_block = 
-         ::new(reinterpret_cast<char*>(block) + intended_units*Alignment, boost_container_new_t()) block_ctrl;
-      rem_block->m_size = rem_units & block_ctrl::size_mask;
-      algo_impl_t::assert_alignment(rem_block);
-      BOOST_ASSERT(rem_block->m_size >= BlockCtrlUnits);
-      priv_mark_as_free_block(rem_block);
-      m_header.m_imultiset.insert(*rem_block);
-
-      //Write the new length
-      block->m_size = (intended_user_units + AllocatedCtrlUnits) & block_ctrl::size_mask;
-      BOOST_ASSERT(block->m_size >= BlockCtrlUnits);
-      m_header.m_allocated += (intended_units - old_block_units)*Alignment;
-   }
-   //There is no free space to create a new node: just merge both blocks
-   else{
-      //Now we have to update the data in the tree
-      m_header.m_imultiset.erase(Imultiset::s_iterator_to(*next_block));
-
-      //Write the new length
-      block->m_size = merged_units & block_ctrl::size_mask;
-      BOOST_ASSERT(block->m_size >= BlockCtrlUnits);
-      m_header.m_allocated += (merged_units - old_block_units)*Alignment;
-   }
-   priv_mark_as_allocated_block(block);
-   prefer_in_recvd_out_size = ((size_type)block->m_size - AllocatedCtrlUnits)*Alignment + UsableByPreviousChunk;
-   return true;
-}
-
-template<class MutexFamily, class VoidPointer, std::size_t MemAlignment> inline
-typename rbtree_best_fit<MutexFamily, VoidPointer, MemAlignment>::block_ctrl *
-   rbtree_best_fit<MutexFamily, VoidPointer, MemAlignment>::priv_prev_block
-      (typename rbtree_best_fit<MutexFamily, VoidPointer, MemAlignment>::block_ctrl *ptr)
-{
-   BOOST_ASSERT(!ptr->m_prev_allocated);
-   return move_detail::force_ptr<block_ctrl*>
-      (reinterpret_cast<char*>(ptr) - ptr->m_prev_size*Alignment);
-}
-
-
-
-template<class MutexFamily, class VoidPointer, std::size_t MemAlignment> inline
-typename rbtree_best_fit<MutexFamily, VoidPointer, MemAlignment>::block_ctrl *
-   rbtree_best_fit<MutexFamily, VoidPointer, MemAlignment>::priv_end_block
-      (typename rbtree_best_fit<MutexFamily, VoidPointer, MemAlignment>::block_ctrl *first_segment_block)
-{
-   //The first block's logic is different from the rest of blocks: stores in m_prev_size the absolute
-   //distance with the end block
-   BOOST_ASSERT(first_segment_block->m_prev_allocated);
-   block_ctrl *end_block = move_detail::force_ptr<block_ctrl*>
-      (reinterpret_cast<char*>(first_segment_block) + first_segment_block->m_prev_size*Alignment);
-   (void)end_block;
-   BOOST_ASSERT(end_block->m_allocated == 1);
-   BOOST_ASSERT(end_block->m_size == first_segment_block->m_prev_size);
-   BOOST_ASSERT(end_block > first_segment_block);
-   return end_block;
-}
-
-template<class MutexFamily, class VoidPointer, std::size_t MemAlignment> inline
-typename rbtree_best_fit<MutexFamily, VoidPointer, MemAlignment>::block_ctrl *
-   rbtree_best_fit<MutexFamily, VoidPointer, MemAlignment>::priv_first_block
-      (typename rbtree_best_fit<MutexFamily, VoidPointer, MemAlignment>::block_ctrl *end_segment_block)
-{
-   //The first block's logic is different from the rest of blocks: stores in m_prev_size the absolute
-   //distance with the end block
-   BOOST_ASSERT(end_segment_block->m_allocated);
-   block_ctrl *first_block = move_detail::force_ptr<block_ctrl*>
-      (reinterpret_cast<char*>(end_segment_block) - end_segment_block->m_size*Alignment);
-   (void)first_block;
-   BOOST_ASSERT(first_block->m_prev_allocated == 1);
-   BOOST_ASSERT(first_block->m_prev_size == end_segment_block->m_size);
-   BOOST_ASSERT(end_segment_block > first_block);
-   return first_block;
-}
-
-
-template<class MutexFamily, class VoidPointer, std::size_t MemAlignment> inline
-typename rbtree_best_fit<MutexFamily, VoidPointer, MemAlignment>::block_ctrl *
-   rbtree_best_fit<MutexFamily, VoidPointer, MemAlignment>::priv_next_block
-      (typename rbtree_best_fit<MutexFamily, VoidPointer, MemAlignment>::block_ctrl *ptr)
-{
-   return move_detail::force_ptr<block_ctrl*>
-      (reinterpret_cast<char*>(ptr) + ptr->m_size*Alignment);
-}
-
-template<class MutexFamily, class VoidPointer, std::size_t MemAlignment> inline
-bool rbtree_best_fit<MutexFamily, VoidPointer, MemAlignment>::priv_is_allocated_block
-      (typename rbtree_best_fit<MutexFamily, VoidPointer, MemAlignment>::block_ctrl *block)
-{
-   bool allocated = block->m_allocated != 0;
-   #ifndef NDEBUG
-   if(block != priv_end_block()){
-      block_ctrl *next_block = move_detail::force_ptr<block_ctrl*>
-         (reinterpret_cast<char*>(block) + block->m_size*Alignment);
-      bool next_block_prev_allocated = next_block->m_prev_allocated != 0;
-      (void)next_block_prev_allocated;
-      BOOST_ASSERT(allocated == next_block_prev_allocated);
-   }
-   #endif
-   return allocated;
-}
-
-template<class MutexFamily, class VoidPointer, std::size_t MemAlignment> inline
-bool rbtree_best_fit<MutexFamily, VoidPointer, MemAlignment>::priv_is_prev_allocated
-      (typename rbtree_best_fit<MutexFamily, VoidPointer, MemAlignment>::block_ctrl *block)
-{
-   if(block->m_prev_allocated){
-      return true;
-   }
-   else{
-      #ifndef NDEBUG
-      if(block != priv_first_block()){
-         block_ctrl *prev = priv_prev_block(block);
-         (void)prev;
-         BOOST_ASSERT(!prev->m_allocated);
-         BOOST_ASSERT(prev->m_size == block->m_prev_size);
-      }
-      #endif
-      return false;
-   }
-}
-
-template<class MutexFamily, class VoidPointer, std::size_t MemAlignment> inline
-void rbtree_best_fit<MutexFamily, VoidPointer, MemAlignment>::priv_mark_as_allocated_block
-      (typename rbtree_best_fit<MutexFamily, VoidPointer, MemAlignment>::block_ctrl *block)
-{
-   block->m_allocated = 1;
-   move_detail::force_ptr<block_ctrl*>
-      (reinterpret_cast<char*>(block)+ block->m_size*Alignment)->m_prev_allocated = 1;
-}
-
-template<class MutexFamily, class VoidPointer, std::size_t MemAlignment> inline
-void rbtree_best_fit<MutexFamily, VoidPointer, MemAlignment>::priv_mark_as_free_block
-      (typename rbtree_best_fit<MutexFamily, VoidPointer, MemAlignment>::block_ctrl *block)
-{
-   block->m_allocated = 0;
-   block_ctrl *next_block = priv_next_block(block);
-   next_block->m_prev_allocated = 0;
-   next_block->m_prev_size = block->m_size;
-}
-
-template<class MutexFamily, class VoidPointer, std::size_t MemAlignment> inline
-void* rbtree_best_fit<MutexFamily, VoidPointer, MemAlignment>::priv_check_and_allocate
-   (size_type nunits
-   ,typename rbtree_best_fit<MutexFamily, VoidPointer, MemAlignment>::block_ctrl* block
-   ,size_type &received_size)
-{
-   size_type upper_nunits = nunits + BlockCtrlUnits;
-   imultiset_iterator it_old = Imultiset::s_iterator_to(*block);
-   algo_impl_t::assert_alignment(block);
-
-   if (block->m_size >= upper_nunits){
-      //This block is bigger than needed, split it in
-      //two blocks, the first's size will be "units" and
-      //the second's size "block->m_size-units"
-      size_type block_old_size = block->m_size;
-      block->m_size = nunits & block_ctrl::size_mask;
-      BOOST_ASSERT(block->m_size >= BlockCtrlUnits);
-
-      //This is the remaining block
-      block_ctrl *rem_block =
-         ::new(reinterpret_cast<char*>(block) + Alignment*nunits, boost_container_new_t()) block_ctrl;
-      algo_impl_t::assert_alignment(rem_block);
-      rem_block->m_size = (block_old_size - nunits) & block_ctrl::size_mask;
-      BOOST_ASSERT(rem_block->m_size >= BlockCtrlUnits);
-      priv_mark_as_free_block(rem_block);
-
-      //Now we have to update the data in the tree.
-      //Use the position of the erased one as a hint
-      m_header.m_imultiset.insert(m_header.m_imultiset.erase(it_old), *rem_block);
-   }
-   else if (block->m_size >= nunits){
-      m_header.m_imultiset.erase(it_old);
-   }
-   else{
-      BOOST_ASSERT(0);
-      return 0;
-   }
-   //We need block_ctrl for deallocation stuff, so
-   //return memory user can overwrite
-   m_header.m_allocated += (size_type)block->m_size*Alignment;
-   received_size =  ((size_type)block->m_size - AllocatedCtrlUnits)*Alignment + UsableByPreviousChunk;
-
-   //Mark the block as allocated
-   priv_mark_as_allocated_block(block);
-
-   //Clear the memory occupied by the tree hook, since this won't be
-   //cleared with zero_free_memory
-   TreeHook *t = static_cast<TreeHook*>(block);
-   //Just clear the memory part reserved for the user
-   std::size_t tree_hook_offset_in_block = std::size_t((char*)t - (char*)block);
-   //volatile char *ptr =
-   char *ptr = reinterpret_cast<char*>(block)+tree_hook_offset_in_block;
-   const std::size_t s = BlockCtrlBytes - tree_hook_offset_in_block;
-   std::memset(ptr, 0, s);
-   this->priv_next_block(block)->m_prev_size = 0;
-   return priv_get_user_buffer(block);
-}
-
-template<class MutexFamily, class VoidPointer, std::size_t MemAlignment>
-void rbtree_best_fit<MutexFamily, VoidPointer, MemAlignment>::deallocate(void* addr)
-{
-   if(!addr)   return;
-   //-----------------------
-   boost::interprocess::scoped_lock<mutex_type> guard(m_header);
-   //-----------------------
-   return this->priv_deallocate(addr);
-}
-
-template<class MutexFamily, class VoidPointer, std::size_t MemAlignment>
-void rbtree_best_fit<MutexFamily, VoidPointer, MemAlignment>::priv_deallocate(void* addr)
-{
-   if(!addr)   return;
-
-   block_ctrl *block = priv_get_block(addr);
-
-   //The blocks must be marked as allocated and the sizes must be equal
-   BOOST_ASSERT(priv_is_allocated_block(block));
-
-   //Check if alignment and block size are right
-   algo_impl_t::assert_alignment(addr);
-
-   size_type block_old_size = Alignment*(size_type)block->m_size;
-   BOOST_ASSERT(m_header.m_allocated >= block_old_size);
-
-   //Update used memory count
-   m_header.m_allocated -= block_old_size;
-
-   //The block to insert in the tree
-   block_ctrl *block_to_insert = block;
-
-   //Get the next block
-   block_ctrl *const next_block  = priv_next_block(block);
-   const bool merge_with_prev    = !priv_is_prev_allocated(block);
-   const bool merge_with_next    = !priv_is_allocated_block(next_block);
-
-   //Merge logic. First just update block sizes, then fix free blocks tree
-   if(merge_with_prev || merge_with_next){
-      //Merge if the previous is free
-      if(merge_with_prev){
-         //Get the previous block
-         block_to_insert = priv_prev_block(block);
-         block_to_insert->m_size = size_type(block_to_insert->m_size + block->m_size) & block_ctrl::size_mask;
-         BOOST_ASSERT(block_to_insert->m_size >= BlockCtrlUnits);
-         m_header.m_imultiset.erase(Imultiset::s_iterator_to(*block_to_insert));
-      }
-      //Merge if the next is free
-      if(merge_with_next){
-         block_to_insert->m_size = size_type(block_to_insert->m_size + next_block->m_size) & block_ctrl::size_mask;
-         BOOST_ASSERT(block_to_insert->m_size >= BlockCtrlUnits);
-         const imultiset_iterator next_it = Imultiset::s_iterator_to(*next_block);
-         m_header.m_imultiset.erase(next_it);
-      }
-   }
-   priv_mark_as_free_block(block_to_insert);
-   m_header.m_imultiset.insert(*block_to_insert);
-}
-
-#endif   //#ifndef BOOST_INTERPROCESS_DOXYGEN_INVOKED
-
-}  //namespace interprocess {
-}  //namespace boost {
-
-#include <boost/interprocess/detail/config_end.hpp>
-
-#endif   //#ifndef BOOST_INTERPROCESS_MEM_ALGO_RBTREE_BEST_FIT_HPP
diff --git a/src/boost/interprocess/offset_ptr.hpp b/src/boost/interprocess/offset_ptr.hpp
deleted file mode 100644
index 698e26bf..00000000
--- a/src/boost/interprocess/offset_ptr.hpp
+++ /dev/null
@@ -1,776 +0,0 @@
-//////////////////////////////////////////////////////////////////////////////
-//
-// (C) Copyright Ion Gaztanaga 2005-2015. Distributed under the Boost
-// 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/interprocess for documentation.
-//
-//////////////////////////////////////////////////////////////////////////////
-
-#ifndef BOOST_INTERPROCESS_OFFSET_PTR_HPP
-#define BOOST_INTERPROCESS_OFFSET_PTR_HPP
-
-#ifndef BOOST_CONFIG_HPP
-#  include <boost/config.hpp>
-#endif
-#
-#if defined(BOOST_HAS_PRAGMA_ONCE)
-#  pragma once
-#endif
-
-#include <boost/interprocess/detail/config_begin.hpp>
-#include <boost/interprocess/detail/workaround.hpp>
-
-#include <boost/type_traits/is_convertible.hpp>
-#include <boost/type_traits/is_constructible.hpp>
-#include <boost/type_traits/is_integral.hpp>
-#include <boost/type_traits/is_unsigned.hpp>
-
-#include <boost/interprocess/interprocess_fwd.hpp>
-#include <boost/interprocess/detail/utilities.hpp>
-#include <boost/interprocess/detail/cast_tags.hpp>
-#include <boost/interprocess/detail/mpl.hpp>
-#include <boost/container/detail/type_traits.hpp>  //alignment_of, aligned_storage
-#include <boost/assert.hpp>
-#include <boost/static_assert.hpp>
-#include <iosfwd>
-
-#if defined(BOOST_GCC) && (BOOST_GCC >= 40600)
-#pragma GCC diagnostic push
-#pragma GCC diagnostic ignored "-Wmaybe-uninitialized"
-#endif
-
-
-//!\file
-//!Describes a smart pointer that stores the offset between this pointer and
-//!target pointee, called offset_ptr.
-
-namespace boost {
-
-#if !defined(BOOST_INTERPROCESS_DOXYGEN_INVOKED)
-
-//Predeclarations
-template <class T>
-struct has_trivial_destructor;
-
-#endif   //#if !defined(BOOST_INTERPROCESS_DOXYGEN_INVOKED)
-
-namespace interprocess {
-
-#if !defined(BOOST_INTERPROCESS_DOXYGEN_INVOKED)
-namespace ipcdetail {
-
-   template<class OffsetType, std::size_t OffsetAlignment>
-   union offset_ptr_internal
-   {
-      BOOST_STATIC_ASSERT(sizeof(OffsetType) >= sizeof(uintptr_t));
-      BOOST_STATIC_ASSERT(boost::is_integral<OffsetType>::value && boost::is_unsigned<OffsetType>::value);
-
-      explicit offset_ptr_internal(OffsetType off)
-         : m_offset(off)
-      {}
-
-      OffsetType m_offset; //Distance between this object and pointee address
-
-      typename ::boost::container::dtl::aligned_storage
-         < sizeof(OffsetType)//for offset_type_alignment m_offset will be enough
-         , (OffsetAlignment == offset_type_alignment) ? 1u : OffsetAlignment
-         >::type alignment_helper;
-   };
-
-   //Note: using the address of a local variable to point to another address
-   //is not standard conforming and this can be optimized-away by the compiler.
-   //Non-inlining is a method to remain illegal but correct
-
-   //Undef BOOST_INTERPROCESS_OFFSET_PTR_INLINE_XXX if your compiler can inline
-   //this code without breaking the library
-
-   ////////////////////////////////////////////////////////////////////////
-   //
-   //                      offset_ptr_to_raw_pointer
-   //
-   ////////////////////////////////////////////////////////////////////////
-   #define BOOST_INTERPROCESS_OFFSET_PTR_BRANCHLESS_TO_PTR
-   template <class OffsetType>
-   BOOST_INTERPROCESS_FORCEINLINE void * offset_ptr_to_raw_pointer(const volatile void *this_ptr, OffsetType offset)
-   {
-      typedef pointer_offset_caster<void*, OffsetType> caster_t;
-      #ifndef BOOST_INTERPROCESS_OFFSET_PTR_BRANCHLESS_TO_PTR
-         if(offset == 1){
-            return 0;
-         }
-         else{
-            return caster_t(caster_t(this_ptr).offset() + offset).pointer();
-         }
-      #else
-         OffsetType mask = offset == 1;
-         --mask;
-         OffsetType target_offset = caster_t(this_ptr).offset() + offset;
-         target_offset &= mask;
-         return caster_t(target_offset).pointer();
-      #endif
-   }
-
-   ////////////////////////////////////////////////////////////////////////
-   //
-   //                      offset_ptr_to_offset
-   //
-   ////////////////////////////////////////////////////////////////////////
-   #define BOOST_INTERPROCESS_OFFSET_PTR_BRANCHLESS_TO_OFF
-   template<class OffsetType>
-   BOOST_INTERPROCESS_FORCEINLINE OffsetType offset_ptr_to_offset(const volatile void *ptr, const volatile void *this_ptr)
-   {
-      typedef pointer_offset_caster<void*, OffsetType> caster_t;
-      #ifndef BOOST_INTERPROCESS_OFFSET_PTR_BRANCHLESS_TO_OFF
-         //offset == 1 && ptr != 0 is not legal for this pointer
-         if(!ptr){
-            return 1;
-         }
-         else{
-            OffsetType offset = caster_t(ptr).offset()- caster_t(this_ptr).offset();
-            BOOST_ASSERT(offset != 1);
-            return offset;
-         }
-      #else
-         //const OffsetType other = -OffsetType(ptr != 0);
-         //const OffsetType offset = (caster_t(ptr).offset() - caster_t(this_ptr).offset()) & other;
-         //return offset + OffsetType(!other);
-         //
-         OffsetType offset = caster_t(ptr).offset() - caster_t(this_ptr).offset();
-         --offset;
-         OffsetType mask = ptr == 0;
-         --mask;
-         offset &= mask;
-         return ++offset;
-      #endif
-   }
-
-   ////////////////////////////////////////////////////////////////////////
-   //
-   //                      offset_ptr_to_offset_from_other
-   //
-   ////////////////////////////////////////////////////////////////////////
-   #define BOOST_INTERPROCESS_OFFSET_PTR_BRANCHLESS_TO_OFF_FROM_OTHER
-   template<class OffsetType>
-   BOOST_INTERPROCESS_FORCEINLINE OffsetType offset_ptr_to_offset_from_other
-      (const volatile void *this_ptr, const volatile void *other_ptr, OffsetType other_offset)
-   {
-      typedef pointer_offset_caster<void*, OffsetType> caster_t;
-      #ifndef BOOST_INTERPROCESS_OFFSET_PTR_BRANCHLESS_TO_OFF_FROM_OTHER
-      if(other_offset == 1){
-         return 1;
-      }
-      else{
-         OffsetType offset = caster_t(other_ptr).offset() - caster_t(this_ptr).offset() + other_offset;
-         BOOST_ASSERT(offset != 1);
-         return offset;
-      }
-      #else
-      OffsetType mask = other_offset == 1;
-      --mask;
-      OffsetType offset = caster_t(other_ptr).offset() - caster_t(this_ptr).offset();
-      offset &= mask;
-      return offset + other_offset;
-
-      //OffsetType mask = -OffsetType(other_offset != 1);
-      //OffsetType offset = caster_t(other_ptr).offset() - caster_t(this_ptr).offset();
-      //offset &= mask;
-      //return offset + other_offset;
-      #endif
-   }
-
-   ////////////////////////////////////////////////////////////////////////
-   //
-   // Let's assume cast to void and cv cast don't change any target address
-   //
-   ////////////////////////////////////////////////////////////////////////
-   template<class From, class To>
-   struct offset_ptr_maintains_address
-   {
-      static const bool value =    ipcdetail::is_cv_same<From, To>::value
-                                || ipcdetail::is_cv_same<void, To>::value
-                                || ipcdetail::is_cv_same<char, To>::value
-                                ;
-   };
-
-   template<class From, class To, class Ret = void>
-   struct enable_if_convertible_equal_address
-      : enable_if_c< ::boost::is_convertible<From*, To*>::value
-                     && offset_ptr_maintains_address<From, To>::value
-                  , Ret>
-   {};
-
-   template<class From, class To, class Ret = void>
-   struct enable_if_convertible_unequal_address
-      : enable_if_c< ::boost::is_convertible<From*, To*>::value
-                     && !offset_ptr_maintains_address<From, To>::value
-                   , Ret>
-   {};
-
-}  //namespace ipcdetail {
-#endif   //#ifndef BOOST_INTERPROCESS_DOXYGEN_INVOKED
-
-//!A smart pointer that stores the offset between between the pointer and the
-//!the object it points. This allows offset allows special properties, since
-//!the pointer is independent from the address of the pointee, if the
-//!pointer and the pointee are still separated by the same offset. This feature
-//!converts offset_ptr in a smart pointer that can be placed in shared memory and
-//!memory mapped files mapped in different addresses in every process.
-//!
-//! \tparam PointedType The type of the pointee.
-//! \tparam DifferenceType A signed integer type that can represent the arithmetic operations on the pointer
-//! \tparam OffsetType An unsigned integer type that can represent the
-//!   distance between two pointers reinterpret_cast-ed as unsigned integers. This type
-//!   should be at least of the same size of std::uintptr_t. In some systems it's possible to communicate
-//!   between 32 and 64 bit processes using 64 bit offsets.
-//! \tparam OffsetAlignment Alignment of the OffsetType stored inside. In some systems might be necessary
-//!   to align it to 64 bits in order to communicate 32 and 64 bit processes using 64 bit offsets.
-//!
-//!<b>Note</b>: offset_ptr uses implementation defined properties, present in most platforms, for
-//!performance reasons:
-//!   - Assumes that OffsetType representation of nullptr is (OffsetType)zero.
-//!   - Assumes that incrementing a OffsetType obtained from a pointer is equivalent
-//!     to incrementing the pointer and then converting it back to OffsetType.
-template <class PointedType, class DifferenceType, class OffsetType, std::size_t OffsetAlignment>
-class offset_ptr
-{
-   #if !defined(BOOST_INTERPROCESS_DOXYGEN_INVOKED)
-   typedef offset_ptr<PointedType, DifferenceType, OffsetType, OffsetAlignment>   self_t;
-   void unspecified_bool_type_func() const {}
-   typedef void (self_t::*unspecified_bool_type)() const;
-   #endif   //#ifndef BOOST_INTERPROCESS_DOXYGEN_INVOKED
-
-   public:
-   typedef PointedType                       element_type;
-   typedef PointedType *                     pointer;
-   typedef typename ipcdetail::
-      add_reference<PointedType>::type       reference;
-   typedef typename ipcdetail::
-      remove_volatile<typename ipcdetail::
-         remove_const<PointedType>::type
-            >::type                          value_type;
-   typedef DifferenceType                    difference_type;
-   typedef std::random_access_iterator_tag   iterator_category;
-   typedef OffsetType                        offset_type;
-
-   public:   //Public Functions
-
-   //!Default constructor (null pointer).
-   //!Never throws.
-   BOOST_INTERPROCESS_FORCEINLINE offset_ptr() BOOST_NOEXCEPT
-      : internal(1)
-   {}
-
-   //!Constructor from raw pointer (allows "0" pointer conversion).
-   //!Never throws.
-   BOOST_INTERPROCESS_FORCEINLINE offset_ptr(pointer ptr) BOOST_NOEXCEPT
-      : internal(ipcdetail::offset_ptr_to_offset<OffsetType>(ptr, this))
-   {}
-
-   //!Constructor from other pointer.
-   //!Never throws.
-   template <class T>
-   BOOST_INTERPROCESS_FORCEINLINE offset_ptr( T *ptr
-             , typename ipcdetail::enable_if< ::boost::is_convertible<T*, PointedType*> >::type * = 0) BOOST_NOEXCEPT
-      : internal(ipcdetail::offset_ptr_to_offset<OffsetType>(static_cast<PointedType*>(ptr), this))
-   {}
-
-   //!Constructor from other offset_ptr
-   //!Never throws.
-   BOOST_INTERPROCESS_FORCEINLINE offset_ptr(const offset_ptr& ptr) BOOST_NOEXCEPT
-      : internal(ipcdetail::offset_ptr_to_offset_from_other(this, &ptr, ptr.internal.m_offset))
-   {}
-
-   //!Constructor from other offset_ptr. Only takes part in overload resolution
-   //!if T2* is convertible to PointedType*. Never throws.
-   template<class T2>
-   BOOST_INTERPROCESS_FORCEINLINE offset_ptr( const offset_ptr<T2, DifferenceType, OffsetType, OffsetAlignment> &ptr
-             #ifndef BOOST_INTERPROCESS_DOXYGEN_INVOKED
-             , typename ipcdetail::enable_if_convertible_equal_address<T2, PointedType>::type* = 0
-             #endif
-             ) BOOST_NOEXCEPT
-      : internal(ipcdetail::offset_ptr_to_offset_from_other(this, &ptr, ptr.get_offset()))
-   {}
-
-   #ifndef BOOST_INTERPROCESS_DOXYGEN_INVOKED
-
-   template<class T2>
-   BOOST_INTERPROCESS_FORCEINLINE offset_ptr( const offset_ptr<T2, DifferenceType, OffsetType, OffsetAlignment> &ptr
-             , typename ipcdetail::enable_if_convertible_unequal_address<T2, PointedType>::type* = 0) BOOST_NOEXCEPT
-      : internal(ipcdetail::offset_ptr_to_offset<OffsetType>(static_cast<PointedType*>(ptr.get()), this))
-   {}
-
-   #endif
-
-   //!Constructor from other offset_ptr. Only takes part in overload resolution
-   //!if PointedType* is constructible from T2* other than via a conversion (e.g. cast to a derived class). Never throws.
-   template<class T2>
-   BOOST_INTERPROCESS_FORCEINLINE explicit offset_ptr(const offset_ptr<T2, DifferenceType, OffsetType, OffsetAlignment> &ptr
-             #ifndef BOOST_INTERPROCESS_DOXYGEN_INVOKED
-             , typename ipcdetail::enable_if_c<
-                !::boost::is_convertible<T2*, PointedType*>::value && ::boost::is_constructible<T2*, PointedType*>::value
-             >::type * = 0
-             #endif
-             ) BOOST_NOEXCEPT
-      : internal(ipcdetail::offset_ptr_to_offset<OffsetType>(static_cast<PointedType*>(ptr.get()), this))
-   {}
-
-   //!Emulates static_cast operator.
-   //!Never throws.
-   template<class T2, class P2, class O2, std::size_t A2>
-   BOOST_INTERPROCESS_FORCEINLINE offset_ptr(const offset_ptr<T2, P2, O2, A2> & r, ipcdetail::static_cast_tag) BOOST_NOEXCEPT
-      : internal(ipcdetail::offset_ptr_to_offset<OffsetType>(static_cast<PointedType*>(r.get()), this))
-   {}
-
-   //!Emulates const_cast operator.
-   //!Never throws.
-   template<class T2, class P2, class O2, std::size_t A2>
-   BOOST_INTERPROCESS_FORCEINLINE offset_ptr(const offset_ptr<T2, P2, O2, A2> & r, ipcdetail::const_cast_tag) BOOST_NOEXCEPT
-      : internal(ipcdetail::offset_ptr_to_offset<OffsetType>(const_cast<PointedType*>(r.get()), this))
-   {}
-
-   //!Emulates dynamic_cast operator.
-   //!Never throws.
-   template<class T2, class P2, class O2, std::size_t A2>
-   BOOST_INTERPROCESS_FORCEINLINE offset_ptr(const offset_ptr<T2, P2, O2, A2> & r, ipcdetail::dynamic_cast_tag) BOOST_NOEXCEPT
-      : internal(ipcdetail::offset_ptr_to_offset<OffsetType>(dynamic_cast<PointedType*>(r.get()), this))
-   {}
-
-   //!Emulates reinterpret_cast operator.
-   //!Never throws.
-   template<class T2, class P2, class O2, std::size_t A2>
-   BOOST_INTERPROCESS_FORCEINLINE offset_ptr(const offset_ptr<T2, P2, O2, A2> & r, ipcdetail::reinterpret_cast_tag) BOOST_NOEXCEPT
-      : internal(ipcdetail::offset_ptr_to_offset<OffsetType>(reinterpret_cast<PointedType*>(r.get()), this))
-   {}
-
-   //!Obtains raw pointer from offset.
-   //!Never throws.
-   BOOST_INTERPROCESS_FORCEINLINE pointer get() const BOOST_NOEXCEPT
-   {  return static_cast<pointer>(ipcdetail::offset_ptr_to_raw_pointer(this, this->internal.m_offset));   }
-
-   BOOST_INTERPROCESS_FORCEINLINE offset_type get_offset() const BOOST_NOEXCEPT
-   {  return this->internal.m_offset;  }
-
-   //!Pointer-like -> operator. It can return 0 pointer.
-   //!Never throws.
-   BOOST_INTERPROCESS_FORCEINLINE pointer operator->() const BOOST_NOEXCEPT
-   {  return this->get(); }
-
-   //!Dereferencing operator, if it is a null offset_ptr behavior
-   //!   is undefined. Never throws.
-   BOOST_INTERPROCESS_FORCEINLINE reference operator* () const BOOST_NOEXCEPT
-   {
-      pointer p = this->get();
-      reference r = *p;
-      return r;
-   }
-
-   //!Indexing operator.
-   //!Never throws.
-   BOOST_INTERPROCESS_FORCEINLINE reference operator[](difference_type idx) const BOOST_NOEXCEPT
-   {  return this->get()[idx];  }
-
-   //!Assignment from pointer (saves extra conversion).
-   //!Never throws.
-   BOOST_INTERPROCESS_FORCEINLINE offset_ptr& operator= (pointer from) BOOST_NOEXCEPT
-   {
-      this->internal.m_offset = ipcdetail::offset_ptr_to_offset<OffsetType>(from, this);
-      return *this;
-   }
-
-   //!Assignment from other offset_ptr.
-   //!Never throws.
-   BOOST_INTERPROCESS_FORCEINLINE offset_ptr& operator= (const offset_ptr & ptr) BOOST_NOEXCEPT
-   {
-      this->internal.m_offset = ipcdetail::offset_ptr_to_offset_from_other(this, &ptr, ptr.internal.m_offset);
-      return *this;
-   }
-
-   //!Assignment from related offset_ptr. If pointers of pointee types
-   //!   are assignable, offset_ptrs will be assignable. Never throws.
-   template<class T2> BOOST_INTERPROCESS_FORCEINLINE 
-   #ifndef BOOST_INTERPROCESS_DOXYGEN_INVOKED
-   typename ipcdetail::enable_if_c
-      < ::boost::is_convertible<T2*, PointedType*>::value, offset_ptr&>::type
-   #else
-   offset_ptr&
-   #endif
-      operator= (const offset_ptr<T2, DifferenceType, OffsetType, OffsetAlignment> &ptr) BOOST_NOEXCEPT
-   {
-      this->assign(ptr, ipcdetail::bool_<ipcdetail::offset_ptr_maintains_address<T2, PointedType>::value>());
-      return *this;
-   }
-
-   public:
-
-   //!offset_ptr += difference_type.
-   //!Never throws.
-   BOOST_INTERPROCESS_FORCEINLINE offset_ptr &operator+= (difference_type offset) BOOST_NOEXCEPT
-   {  this->inc_offset(offset * difference_type(sizeof(PointedType)));   return *this;  }
-
-   //!offset_ptr -= difference_type.
-   //!Never throws.
-   BOOST_INTERPROCESS_FORCEINLINE offset_ptr &operator-= (difference_type offset) BOOST_NOEXCEPT
-   {  this->dec_offset(offset * difference_type(sizeof(PointedType)));   return *this;  }
-
-   //!++offset_ptr.
-   //!Never throws.
-   BOOST_INTERPROCESS_FORCEINLINE offset_ptr& operator++ (void) BOOST_NOEXCEPT
-   {  this->inc_offset(difference_type(sizeof(PointedType)));   return *this;  }
-
-   //!offset_ptr++.
-   //!Never throws.
-   BOOST_INTERPROCESS_FORCEINLINE offset_ptr operator++ (int) BOOST_NOEXCEPT
-   {
-      offset_ptr tmp(*this);
-      this->inc_offset(sizeof (PointedType));
-      return tmp;
-   }
-
-   //!--offset_ptr.
-   //!Never throws.
-   BOOST_INTERPROCESS_FORCEINLINE offset_ptr& operator-- (void) BOOST_NOEXCEPT
-   {  this->dec_offset(sizeof (PointedType));   return *this;  }
-
-   //!offset_ptr--.
-   //!Never throws.
-   BOOST_INTERPROCESS_FORCEINLINE offset_ptr operator-- (int) BOOST_NOEXCEPT
-   {
-      offset_ptr tmp(*this);
-      this->dec_offset(sizeof (PointedType));
-      return tmp;
-   }
-
-   //!safe bool conversion operator.
-   //!Never throws.
-   #if defined(BOOST_NO_CXX11_EXPLICIT_CONVERSION_OPERATORS)
-   BOOST_INTERPROCESS_FORCEINLINE operator unspecified_bool_type() const BOOST_NOEXCEPT
-   {  return this->internal.m_offset != 1? &self_t::unspecified_bool_type_func : 0;   }
-   #else
-   explicit operator bool() const BOOST_NOEXCEPT
-   {  return this->internal.m_offset != 1;  }
-   #endif
-   
-   //!Not operator. Not needed in theory, but improves portability.
-   //!Never throws
-   BOOST_INTERPROCESS_FORCEINLINE bool operator! () const BOOST_NOEXCEPT
-   {  return this->internal.m_offset == 1;   }
-
-   //!Compatibility with pointer_traits
-   //!
-   #if defined(BOOST_NO_CXX11_TEMPLATE_ALIASES)
-   template <class U>
-   struct rebind
-   {  typedef offset_ptr<U, DifferenceType, OffsetType, OffsetAlignment> other;  };
-   #else
-   template <class U>
-   using rebind = offset_ptr<U, DifferenceType, OffsetType, OffsetAlignment>;
-   #ifndef BOOST_INTERPROCESS_DOXYGEN_INVOKED
-   typedef offset_ptr<PointedType, DifferenceType, OffsetType, OffsetAlignment> other;
-   #endif //BOOST_INTERPROCESS_DOXYGEN_INVOKED
-   #endif
-
-   //!Compatibility with pointer_traits
-   //!
-   BOOST_INTERPROCESS_FORCEINLINE static offset_ptr pointer_to(reference r) BOOST_NOEXCEPT
-   { return offset_ptr(&r); }
-
-   //!difference_type + offset_ptr
-   //!operation
-   BOOST_INTERPROCESS_FORCEINLINE friend offset_ptr operator+(difference_type diff, offset_ptr right) BOOST_NOEXCEPT
-   {  right += diff;  return right;  }
-
-   //!offset_ptr + difference_type
-   //!operation
-   BOOST_INTERPROCESS_FORCEINLINE friend offset_ptr operator+(offset_ptr left, difference_type diff) BOOST_NOEXCEPT
-   {  left += diff;  return left; }
-
-   //!offset_ptr - diff
-   //!operation
-   BOOST_INTERPROCESS_FORCEINLINE friend offset_ptr operator-(offset_ptr left, difference_type diff) BOOST_NOEXCEPT
-   {  left -= diff;  return left; }
-
-   //!offset_ptr - diff
-   //!operation
-   BOOST_INTERPROCESS_FORCEINLINE friend offset_ptr operator-(difference_type diff, offset_ptr right) BOOST_NOEXCEPT
-   {  right -= diff; return right; }
-
-   //!offset_ptr - offset_ptr
-   //!operation
-   BOOST_INTERPROCESS_FORCEINLINE friend difference_type operator-(const offset_ptr &pt, const offset_ptr &pt2) BOOST_NOEXCEPT
-   {  return difference_type(pt.get()- pt2.get());   }
-
-   //Comparison
-   BOOST_INTERPROCESS_FORCEINLINE friend bool operator== (const offset_ptr &pt1, const offset_ptr &pt2) BOOST_NOEXCEPT
-   {  return pt1.get() == pt2.get();  }
-
-   BOOST_INTERPROCESS_FORCEINLINE friend bool operator!= (const offset_ptr &pt1, const offset_ptr &pt2) BOOST_NOEXCEPT
-   {  return pt1.get() != pt2.get();  }
-
-   BOOST_INTERPROCESS_FORCEINLINE friend bool operator<(const offset_ptr &pt1, const offset_ptr &pt2) BOOST_NOEXCEPT
-   {  return pt1.get() < pt2.get();  }
-
-   BOOST_INTERPROCESS_FORCEINLINE friend bool operator<=(const offset_ptr &pt1, const offset_ptr &pt2) BOOST_NOEXCEPT
-   {  return pt1.get() <= pt2.get();  }
-
-   BOOST_INTERPROCESS_FORCEINLINE friend bool operator>(const offset_ptr &pt1, const offset_ptr &pt2) BOOST_NOEXCEPT
-   {  return pt1.get() > pt2.get();  }
-
-   BOOST_INTERPROCESS_FORCEINLINE friend bool operator>=(const offset_ptr &pt1, const offset_ptr &pt2) BOOST_NOEXCEPT
-   {  return pt1.get() >= pt2.get();  }
-
-   //Comparison to raw ptr to support literal 0
-   BOOST_INTERPROCESS_FORCEINLINE friend bool operator== (pointer pt1, const offset_ptr &pt2) BOOST_NOEXCEPT
-   {  return pt1 == pt2.get();  }
-
-   BOOST_INTERPROCESS_FORCEINLINE friend bool operator!= (pointer pt1, const offset_ptr &pt2) BOOST_NOEXCEPT
-   {  return pt1 != pt2.get();  }
-
-   BOOST_INTERPROCESS_FORCEINLINE friend bool operator<(pointer pt1, const offset_ptr &pt2) BOOST_NOEXCEPT
-   {  return pt1 < pt2.get();  }
-
-   BOOST_INTERPROCESS_FORCEINLINE friend bool operator<=(pointer pt1, const offset_ptr &pt2) BOOST_NOEXCEPT
-   {  return pt1 <= pt2.get();  }
-
-   BOOST_INTERPROCESS_FORCEINLINE friend bool operator>(pointer pt1, const offset_ptr &pt2) BOOST_NOEXCEPT
-   {  return pt1 > pt2.get();  }
-
-   BOOST_INTERPROCESS_FORCEINLINE friend bool operator>=(pointer pt1, const offset_ptr &pt2) BOOST_NOEXCEPT
-   {  return pt1 >= pt2.get();  }
-
-   //Comparison
-   BOOST_INTERPROCESS_FORCEINLINE friend bool operator== (const offset_ptr &pt1, pointer pt2) BOOST_NOEXCEPT
-   {  return pt1.get() == pt2;  }
-
-   BOOST_INTERPROCESS_FORCEINLINE friend bool operator!= (const offset_ptr &pt1, pointer pt2) BOOST_NOEXCEPT
-   {  return pt1.get() != pt2;  }
-
-   BOOST_INTERPROCESS_FORCEINLINE friend bool operator<(const offset_ptr &pt1, pointer pt2) BOOST_NOEXCEPT
-   {  return pt1.get() < pt2;  }
-
-   BOOST_INTERPROCESS_FORCEINLINE friend bool operator<=(const offset_ptr &pt1, pointer pt2) BOOST_NOEXCEPT
-   {  return pt1.get() <= pt2;  }
-
-   BOOST_INTERPROCESS_FORCEINLINE friend bool operator>(const offset_ptr &pt1, pointer pt2) BOOST_NOEXCEPT
-   {  return pt1.get() > pt2;  }
-
-   BOOST_INTERPROCESS_FORCEINLINE friend bool operator>=(const offset_ptr &pt1, pointer pt2) BOOST_NOEXCEPT
-   {  return pt1.get() >= pt2;  }
-
-   BOOST_INTERPROCESS_FORCEINLINE friend void swap(offset_ptr &left, offset_ptr &right) BOOST_NOEXCEPT
-   {
-      pointer ptr = right.get();
-      right = left;
-      left = ptr;
-   }
-
-   private:
-   template<class T2>
-   BOOST_INTERPROCESS_FORCEINLINE void assign(const offset_ptr<T2, DifferenceType, OffsetType, OffsetAlignment> &ptr, ipcdetail::bool_<true>) BOOST_NOEXCEPT
-   {  //no need to pointer adjustment
-      this->internal.m_offset = ipcdetail::offset_ptr_to_offset_from_other<OffsetType>(this, &ptr, ptr.get_offset());
-   }
-
-   template<class T2>
-   BOOST_INTERPROCESS_FORCEINLINE void assign(const offset_ptr<T2, DifferenceType, OffsetType, OffsetAlignment> &ptr, ipcdetail::bool_<false>) BOOST_NOEXCEPT
-   {  //we must convert to raw before calculating the offset
-      this->internal.m_offset = ipcdetail::offset_ptr_to_offset<OffsetType>(static_cast<PointedType*>(ptr.get()), this);
-   }
-
-   #if !defined(BOOST_INTERPROCESS_DOXYGEN_INVOKED)
-   BOOST_INTERPROCESS_FORCEINLINE void inc_offset(DifferenceType bytes) BOOST_NOEXCEPT
-   {  internal.m_offset += OffsetType(bytes);   }
-
-   BOOST_INTERPROCESS_FORCEINLINE void dec_offset(DifferenceType bytes) BOOST_NOEXCEPT
-   {  internal.m_offset -= OffsetType(bytes);   }
-
-   ipcdetail::offset_ptr_internal<OffsetType, OffsetAlignment> internal;
-
-   public:
-   BOOST_INTERPROCESS_FORCEINLINE const OffsetType &priv_offset() const BOOST_NOEXCEPT
-   {  return internal.m_offset;   }
-
-   BOOST_INTERPROCESS_FORCEINLINE       OffsetType &priv_offset() BOOST_NOEXCEPT
-   {  return internal.m_offset;   }
-
-   #endif   //#ifndef BOOST_INTERPROCESS_DOXYGEN_INVOKED
-};
-
-//!operator<<
-//!for offset ptr
-template<class E, class T, class W, class X, class Y, std::size_t Z>
-inline std::basic_ostream<E, T> & operator<<
-   (std::basic_ostream<E, T> & os, offset_ptr<W, X, Y, Z> const & p)
-{  return os << p.get_offset();   }
-
-//!operator>>
-//!for offset ptr
-template<class E, class T, class W, class X, class Y, std::size_t Z>
-inline std::basic_istream<E, T> & operator>>
-   (std::basic_istream<E, T> & is, offset_ptr<W, X, Y, Z> & p)
-{  return is >> p.get_offset();  }
-
-//!Simulation of static_cast between pointers. Never throws.
-template<class T1, class P1, class O1, std::size_t A1, class T2, class P2, class O2, std::size_t A2>
-BOOST_INTERPROCESS_FORCEINLINE boost::interprocess::offset_ptr<T1, P1, O1, A1>
-   static_pointer_cast(const boost::interprocess::offset_ptr<T2, P2, O2, A2> & r) BOOST_NOEXCEPT
-{
-   return boost::interprocess::offset_ptr<T1, P1, O1, A1>
-            (r, boost::interprocess::ipcdetail::static_cast_tag());
-}
-
-//!Simulation of const_cast between pointers. Never throws.
-template<class T1, class P1, class O1, std::size_t A1, class T2, class P2, class O2, std::size_t A2>
-BOOST_INTERPROCESS_FORCEINLINE boost::interprocess::offset_ptr<T1, P1, O1, A1>
-   const_pointer_cast(const boost::interprocess::offset_ptr<T2, P2, O2, A2> & r) BOOST_NOEXCEPT
-{
-   return boost::interprocess::offset_ptr<T1, P1, O1, A1>
-            (r, boost::interprocess::ipcdetail::const_cast_tag());
-}
-
-//!Simulation of dynamic_cast between pointers. Never throws.
-template<class T1, class P1, class O1, std::size_t A1, class T2, class P2, class O2, std::size_t A2>
-BOOST_INTERPROCESS_FORCEINLINE boost::interprocess::offset_ptr<T1, P1, O1, A1>
-   dynamic_pointer_cast(const boost::interprocess::offset_ptr<T2, P2, O2, A2> & r) BOOST_NOEXCEPT
-{
-   return boost::interprocess::offset_ptr<T1, P1, O1, A1>
-            (r, boost::interprocess::ipcdetail::dynamic_cast_tag());
-}
-
-//!Simulation of reinterpret_cast between pointers. Never throws.
-template<class T1, class P1, class O1, std::size_t A1, class T2, class P2, class O2, std::size_t A2>
-BOOST_INTERPROCESS_FORCEINLINE boost::interprocess::offset_ptr<T1, P1, O1, A1>
-   reinterpret_pointer_cast(const boost::interprocess::offset_ptr<T2, P2, O2, A2> & r) BOOST_NOEXCEPT
-{
-   return boost::interprocess::offset_ptr<T1, P1, O1, A1>
-            (r, boost::interprocess::ipcdetail::reinterpret_cast_tag());
-}
-
-}  //namespace interprocess {
-
-#if !defined(BOOST_INTERPROCESS_DOXYGEN_INVOKED)
-
-///has_trivial_destructor<> == true_type specialization for optimizations
-template <class T, class P, class O, std::size_t A>
-struct has_trivial_destructor< ::boost::interprocess::offset_ptr<T, P, O, A> >
-{
-   static const bool value = true;
-};
-
-namespace move_detail {
-
-///has_trivial_destructor<> == true_type specialization for optimizations
-template <class T, class P, class O, std::size_t A>
-struct is_trivially_destructible< ::boost::interprocess::offset_ptr<T, P, O, A> >
-{
-   static const bool value = true;
-};
-
-}  //namespace move_detail {
-
-namespace interprocess {
-
-//!to_raw_pointer() enables boost::mem_fn to recognize offset_ptr.
-//!Never throws.
-template <class T, class P, class O, std::size_t A>
-BOOST_INTERPROCESS_FORCEINLINE T * to_raw_pointer(boost::interprocess::offset_ptr<T, P, O, A> const & p) BOOST_NOEXCEPT
-{  return ipcdetail::to_raw_pointer(p);   }
-
-}  //namespace interprocess
-
-
-#endif   //#ifndef BOOST_INTERPROCESS_DOXYGEN_INVOKED
-}  //namespace boost {
-
-#if !defined(BOOST_INTERPROCESS_DOXYGEN_INVOKED)
-
-namespace boost{
-
-//This is to support embedding a bit in the pointer
-//for intrusive containers, saving space
-namespace intrusive {
-
-//Predeclaration to avoid including header
-template<class VoidPointer, std::size_t N>
-struct max_pointer_plus_bits;
-
-template<std::size_t OffsetAlignment, class P, class O, std::size_t A>
-struct max_pointer_plus_bits<boost::interprocess::offset_ptr<void, P, O, A>, OffsetAlignment>
-{
-   //The offset ptr can embed one bit less than the alignment since it
-   //uses offset == 1 to store the null pointer.
-   static const std::size_t value = ::boost::interprocess::ipcdetail::ls_zeros<OffsetAlignment>::value - 1;
-};
-
-//Predeclaration
-template<class Pointer, std::size_t NumBits>
-struct pointer_plus_bits;
-
-template<class T, class P, class O, std::size_t A, std::size_t NumBits>
-struct pointer_plus_bits<boost::interprocess::offset_ptr<T, P, O, A>, NumBits>
-{
-   typedef boost::interprocess::offset_ptr<T, P, O, A>      pointer;
-   //Bits are stored in the lower bits of the pointer except the LSB,
-   //because this bit is used to represent the null pointer.
-   static const O Mask = ((static_cast<O>(1) << NumBits) - static_cast<O>(1)) << 1;
-   BOOST_STATIC_ASSERT(0 ==(Mask&1));
-
-   //We must ALWAYS take argument "n" by reference as a copy of a null pointer
-   //with a bit (e.g. offset == 3) would be incorrectly copied and interpreted as non-null.
-
-   BOOST_INTERPROCESS_FORCEINLINE static pointer get_pointer(const pointer &n) BOOST_NOEXCEPT
-   {
-      pointer p;
-      O const tmp_off = n.priv_offset() & ~Mask;
-      p.priv_offset() = boost::interprocess::ipcdetail::offset_ptr_to_offset_from_other(&p, &n, tmp_off);
-      return p;
-   }
-
-   BOOST_INTERPROCESS_FORCEINLINE static void set_pointer(pointer &n, const pointer &p) BOOST_NOEXCEPT
-   {
-      BOOST_ASSERT(0 == (get_bits)(p));
-      O const stored_bits = n.priv_offset() & Mask;
-      n = p;
-      n.priv_offset() |= stored_bits;
-   }
-
-   BOOST_INTERPROCESS_FORCEINLINE static std::size_t get_bits(const pointer &n) BOOST_NOEXCEPT
-   {
-      return std::size_t((n.priv_offset() & Mask) >> 1u);
-   }
-
-   BOOST_INTERPROCESS_FORCEINLINE static void set_bits(pointer &n, std::size_t const b) BOOST_NOEXCEPT
-   {
-      BOOST_ASSERT(b < (std::size_t(1) << NumBits));
-      O tmp = n.priv_offset();
-      tmp &= ~Mask;
-      tmp |= O(b << 1u);
-      n.priv_offset() = tmp;
-   }
-};
-
-}  //namespace intrusive
-
-//Predeclaration
-template<class T, class U>
-struct pointer_to_other;
-
-//Backwards compatibility with pointer_to_other
-template <class PointedType, class DifferenceType, class OffsetType, std::size_t OffsetAlignment, class U>
-struct pointer_to_other
-   < ::boost::interprocess::offset_ptr<PointedType, DifferenceType, OffsetType, OffsetAlignment>, U >
-{
-   typedef ::boost::interprocess::offset_ptr<U, DifferenceType, OffsetType, OffsetAlignment> type;
-};
-
-}  //namespace boost{
-#endif   //#ifndef BOOST_INTERPROCESS_DOXYGEN_INVOKED
-
-#include <boost/interprocess/detail/config_end.hpp>
-
-#if defined(BOOST_GCC) && (BOOST_GCC >= 40600)
-#pragma GCC diagnostic pop
-#endif
-
-#endif //#ifndef BOOST_INTERPROCESS_OFFSET_PTR_HPP
diff --git a/src/boost/interprocess/permissions.hpp b/src/boost/interprocess/permissions.hpp
deleted file mode 100644
index 0b21a685..00000000
--- a/src/boost/interprocess/permissions.hpp
+++ /dev/null
@@ -1,136 +0,0 @@
-//////////////////////////////////////////////////////////////////////////////
-//
-// (C) Copyright Ion Gaztanaga 2005-2012. Distributed under the Boost
-// 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/interprocess for documentation.
-//
-//////////////////////////////////////////////////////////////////////////////
-
-#ifndef BOOST_INTERPROCESS_PERMISSIONS_HPP
-#define BOOST_INTERPROCESS_PERMISSIONS_HPP
-
-#if !defined(BOOST_INTERPROCESS_DOXYGEN_INVOKED)
-
-#ifndef BOOST_CONFIG_HPP
-#  include <boost/config.hpp>
-#endif
-#
-#if defined(BOOST_HAS_PRAGMA_ONCE)
-#  pragma once
-#endif
-
-#include <boost/interprocess/detail/config_begin.hpp>
-#include <boost/interprocess/detail/workaround.hpp>
-#include <boost/interprocess/interprocess_fwd.hpp>
-
-#if defined(BOOST_INTERPROCESS_WINDOWS)
-
-#include <boost/interprocess/detail/win32_api.hpp>
-
-#else
-
-#include <sys/stat.h>
-
-#endif
-
-#endif   //#ifndef BOOST_INTERPROCESS_DOXYGEN_INVOKED
-
-//!\file
-//!Describes permissions class
-
-namespace boost {
-namespace interprocess {
-
-#if !defined(BOOST_INTERPROCESS_DOXYGEN_INVOKED)
-
-#if defined(BOOST_INTERPROCESS_WINDOWS)
-
-namespace ipcdetail {
-
-template <int Dummy>
-struct unrestricted_permissions_holder
-{
-   static winapi::interprocess_all_access_security unrestricted;
-};
-
-template<int Dummy>
-winapi::interprocess_all_access_security unrestricted_permissions_holder<Dummy>::unrestricted;
-
-}  //namespace ipcdetail {
-
-#endif   //defined BOOST_INTERPROCESS_WINDOWS
-
-#endif   //#ifndef BOOST_INTERPROCESS_DOXYGEN_INVOKED
-
-//!The permissions class represents permissions to be set to shared memory or
-//!files, that can be constructed form usual permission representations:
-//!a SECURITY_ATTRIBUTES pointer in windows or ORed rwx chmod integer in UNIX.
-class permissions
-{
-   #if !defined(BOOST_INTERPROCESS_DOXYGEN_INVOKED)
-
-   #if defined(BOOST_INTERPROCESS_WINDOWS)
-   typedef void*  os_permissions_type;
-   #else
-   typedef ::mode_t    os_permissions_type;
-   #endif
-   os_permissions_type  m_perm;
-
-   #endif   //#ifndef BOOST_INTERPROCESS_DOXYGEN_INVOKED
-
-   public:
-   //!Constructs a permissions object from a user provided os-dependent
-   //!permissions.
-   permissions(os_permissions_type type) BOOST_NOEXCEPT
-      : m_perm(type)
-   {}
-
-   //!Constructs a default permissions object:
-   //!A null security attributes pointer for windows or 0644
-   //!for UNIX.
-   permissions() BOOST_NOEXCEPT
-   {  set_default(); }
-
-   //!Sets permissions to default values:
-   //!A null security attributes pointer for windows or 0644
-   //!for UNIX.
-   void set_default() BOOST_NOEXCEPT
-   {
-      #if defined (BOOST_INTERPROCESS_WINDOWS)
-      m_perm = 0;
-      #else
-      m_perm = 0644;
-      #endif
-   }
-
-   //!Sets permissions to unrestricted access:
-   //!A null DACL for windows or 0666 for UNIX.
-   void set_unrestricted() BOOST_NOEXCEPT
-   {
-      #if defined (BOOST_INTERPROCESS_WINDOWS)
-      m_perm = &ipcdetail::unrestricted_permissions_holder<0>::unrestricted;
-      #else
-      m_perm = 0666;
-      #endif
-   }
-
-   //!Sets permissions from a user provided os-dependent
-   //!permissions.
-   void set_permissions(os_permissions_type perm) BOOST_NOEXCEPT
-   {  m_perm = perm; }
-
-   //!Returns stored os-dependent
-   //!permissions
-   os_permissions_type get_permissions() const BOOST_NOEXCEPT
-   {  return m_perm; }
-};
-
-}  //namespace interprocess {
-}  //namespace boost {
-
-#include <boost/interprocess/detail/config_end.hpp>
-
-#endif   //BOOST_INTERPROCESS_PERMISSIONS_HPP
-
diff --git a/src/boost/interprocess/segment_manager.hpp b/src/boost/interprocess/segment_manager.hpp
deleted file mode 100644
index 983b0f15..00000000
--- a/src/boost/interprocess/segment_manager.hpp
+++ /dev/null
@@ -1,1359 +0,0 @@
-//////////////////////////////////////////////////////////////////////////////
-//
-// (C) Copyright Ion Gaztanaga 2005-2012. Distributed under the Boost
-// 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/interprocess for documentation.
-//
-//////////////////////////////////////////////////////////////////////////////
-
-#ifndef BOOST_INTERPROCESS_SEGMENT_MANAGER_HPP
-#define BOOST_INTERPROCESS_SEGMENT_MANAGER_HPP
-
-#ifndef BOOST_CONFIG_HPP
-#  include <boost/config.hpp>
-#endif
-#
-#if defined(BOOST_HAS_PRAGMA_ONCE)
-#  pragma once
-#endif
-
-#include <boost/interprocess/detail/config_begin.hpp>
-#include <boost/interprocess/detail/workaround.hpp>
-
-#include <boost/core/no_exceptions_support.hpp>
-#include <boost/interprocess/detail/type_traits.hpp>
-
-#include <boost/interprocess/detail/transform_iterator.hpp>
-
-#include <boost/interprocess/detail/mpl.hpp>
-#include <boost/interprocess/detail/nothrow.hpp>
-#include <boost/interprocess/detail/segment_manager_helper.hpp>
-#include <boost/interprocess/detail/named_proxy.hpp>
-#include <boost/interprocess/detail/utilities.hpp>
-#include <boost/interprocess/offset_ptr.hpp>
-#include <boost/interprocess/indexes/iset_index.hpp>
-#include <boost/interprocess/exceptions.hpp>
-#include <boost/interprocess/allocators/allocator.hpp>
-#include <boost/interprocess/smart_ptr/deleter.hpp>
-#include <boost/move/utility_core.hpp>
-#include <boost/interprocess/sync/scoped_lock.hpp>
-// container/detail
-#include <boost/container/detail/minimal_char_traits_header.hpp>
-#include <boost/container/detail/placement_new.hpp>
-// std
-#include <cstddef>   //std::size_t
-#include <boost/intrusive/detail/minimal_pair_header.hpp>
-#include <boost/assert.hpp>
-#ifndef BOOST_NO_EXCEPTIONS
-#include <exception>
-#endif
-
-//!\file
-//!Describes the object placed in a memory segment that provides
-//!named object allocation capabilities for single-segment and
-//!multi-segment allocations.
-
-namespace boost{
-namespace interprocess{
-
-//!This object is the public base class of segment manager.
-//!This class only depends on the memory allocation algorithm
-//!and implements all the allocation features not related
-//!to named or unique objects.
-//!
-//!Storing a reference to segment_manager forces
-//!the holder class to be dependent on index types and character types.
-//!When such dependence is not desirable and only anonymous and raw
-//!allocations are needed, segment_manager_base is the correct answer.
-template<class MemoryAlgorithm>
-class segment_manager_base
-   :  private MemoryAlgorithm
-{
-   public:
-   typedef segment_manager_base<MemoryAlgorithm> segment_manager_base_type;
-   typedef typename MemoryAlgorithm::void_pointer  void_pointer;
-   typedef typename MemoryAlgorithm::mutex_family  mutex_family;
-   typedef MemoryAlgorithm memory_algorithm;
-
-   #if !defined(BOOST_INTERPROCESS_DOXYGEN_INVOKED)
-
-   //Experimental. Don't use
-   typedef typename MemoryAlgorithm::multiallocation_chain    multiallocation_chain;
-   typedef typename MemoryAlgorithm::difference_type  difference_type;
-   typedef typename MemoryAlgorithm::size_type        size_type;
-
-   #endif   //#ifndef BOOST_INTERPROCESS_DOXYGEN_INVOKED
-
-   //!This constant indicates the payload size
-   //!associated with each allocation of the memory algorithm
-   static const size_type PayloadPerAllocation = MemoryAlgorithm::PayloadPerAllocation;
-
-   //!Constructor of the segment_manager_base
-   //!
-   //!"size" is the size of the memory segment where
-   //!the basic segment manager is being constructed.
-   //!
-   //!"reserved_bytes" is the number of bytes
-   //!after the end of the memory algorithm object itself
-   //!that the memory algorithm will exclude from
-   //!dynamic allocation
-   //!
-   //!Can throw
-   segment_manager_base(size_type sz, size_type reserved_bytes)
-      :  MemoryAlgorithm(sz, reserved_bytes)
-   {
-      BOOST_ASSERT((sizeof(segment_manager_base<MemoryAlgorithm>) == sizeof(MemoryAlgorithm)));
-   }
-
-   //!Returns the size of the memory
-   //!segment
-   size_type get_size() const
-   {  return MemoryAlgorithm::get_size();  }
-
-   //!Returns the number of free bytes of the memory
-   //!segment
-   size_type get_free_memory() const
-   {  return MemoryAlgorithm::get_free_memory();  }
-
-   //!Obtains the minimum size needed by
-   //!the segment manager
-   static size_type get_min_size (size_type size)
-   {  return MemoryAlgorithm::get_min_size(size);  }
-
-   //!Allocates nbytes bytes. This function is only used in
-   //!single-segment management. Never throws
-   void * allocate (size_type nbytes, const std::nothrow_t &)
-   {  return MemoryAlgorithm::allocate(nbytes);   }
-
-   //!Returns a reference to the internal memory algorithm.
-   //!This function is useful for custom memory algorithms that
-   //!need additional configuration options after construction. Never throws.
-   //!This function should be only used by advanced users.
-   MemoryAlgorithm &get_memory_algorithm()
-   {  return static_cast<MemoryAlgorithm&>(*this);   }
-
-   //!Returns a const reference to the internal memory algorithm.
-   //!This function is useful for custom memory algorithms that
-   //!need additional configuration options after construction. Never throws.
-   //!This function should be only used by advanced users.
-   const MemoryAlgorithm &get_memory_algorithm() const
-   {  return static_cast<const MemoryAlgorithm&>(*this);   }
-
-   #if !defined(BOOST_INTERPROCESS_DOXYGEN_INVOKED)
-
-   //Experimental. Dont' use.
-   //!Allocates n_elements of elem_bytes bytes.
-   //!Throws bad_alloc on failure. chain.size() is not increased on failure.
-   void allocate_many(size_type elem_bytes, size_type n_elements, multiallocation_chain &chain)
-   {
-      size_type prev_size = chain.size();
-      MemoryAlgorithm::allocate_many(elem_bytes, n_elements, chain);
-      if(!elem_bytes || chain.size() == prev_size){
-         throw bad_alloc();
-      }
-   }
-
-   //!Allocates n_elements, each one of element_lengths[i]*sizeof_element bytes.
-   //!Throws bad_alloc on failure. chain.size() is not increased on failure.
-   void allocate_many(const size_type *element_lengths, size_type n_elements, size_type sizeof_element, multiallocation_chain &chain)
-   {
-      size_type prev_size = chain.size();
-      MemoryAlgorithm::allocate_many(element_lengths, n_elements, sizeof_element, chain);
-      if(!sizeof_element || chain.size() == prev_size){
-         throw bad_alloc();
-      }
-   }
-
-   //!Allocates n_elements of elem_bytes bytes.
-   //!Non-throwing version. chain.size() is not increased on failure.
-   void allocate_many(const std::nothrow_t &, size_type elem_bytes, size_type n_elements, multiallocation_chain &chain)
-   {  MemoryAlgorithm::allocate_many(elem_bytes, n_elements, chain); }
-
-   //!Allocates n_elements, each one of
-   //!element_lengths[i]*sizeof_element bytes.
-   //!Non-throwing version. chain.size() is not increased on failure.
-   void allocate_many(const std::nothrow_t &, const size_type *elem_sizes, size_type n_elements, size_type sizeof_element, multiallocation_chain &chain)
-   {  MemoryAlgorithm::allocate_many(elem_sizes, n_elements, sizeof_element, chain); }
-
-   //!Deallocates all elements contained in chain.
-   //!Never throws.
-   void deallocate_many(multiallocation_chain &chain)
-   {  MemoryAlgorithm::deallocate_many(chain); }
-
-   #endif   //#ifndef BOOST_INTERPROCESS_DOXYGEN_INVOKED
-
-   //!Allocates nbytes bytes. Throws boost::interprocess::bad_alloc
-   //!on failure
-   void * allocate(size_type nbytes)
-   {
-      void * ret = MemoryAlgorithm::allocate(nbytes);
-      if(!ret)
-         throw bad_alloc();
-      return ret;
-   }
-
-   //!Allocates nbytes bytes. This function is only used in
-   //!single-segment management. Never throws
-   void * allocate_aligned (size_type nbytes, size_type alignment, const std::nothrow_t &)
-   {  return MemoryAlgorithm::allocate_aligned(nbytes, alignment);   }
-
-   //!Allocates nbytes bytes. This function is only used in
-   //!single-segment management. Throws bad_alloc when fails
-   void * allocate_aligned(size_type nbytes, size_type alignment)
-   {
-      void * ret = MemoryAlgorithm::allocate_aligned(nbytes, alignment);
-      if(!ret)
-         throw bad_alloc();
-      return ret;
-   }
-
-   #if !defined(BOOST_INTERPROCESS_DOXYGEN_INVOKED)
-
-   template<class T>
-   T *allocation_command  (boost::interprocess::allocation_type command, size_type limit_size,
-                           size_type &prefer_in_recvd_out_size, T *&reuse)
-   {
-      T *ret = MemoryAlgorithm::allocation_command
-         (command | boost::interprocess::nothrow_allocation, limit_size, prefer_in_recvd_out_size, reuse);
-      if(!(command & boost::interprocess::nothrow_allocation) && !ret)
-         throw bad_alloc();
-      return ret;
-   }
-
-   void *raw_allocation_command  (boost::interprocess::allocation_type command,   size_type limit_objects,
-                           size_type &prefer_in_recvd_out_size, void *&reuse, size_type sizeof_object = 1)
-   {
-      void *ret = MemoryAlgorithm::raw_allocation_command
-         ( command | boost::interprocess::nothrow_allocation, limit_objects,
-           prefer_in_recvd_out_size, reuse, sizeof_object);
-      if(!(command & boost::interprocess::nothrow_allocation) && !ret)
-         throw bad_alloc();
-      return ret;
-   }
-
-   #endif   //#ifndef BOOST_INTERPROCESS_DOXYGEN_INVOKED
-
-   //!Deallocates the bytes allocated with allocate/allocate_many()
-   //!pointed by addr
-   void   deallocate          (void *addr)
-   {  MemoryAlgorithm::deallocate(addr);   }
-
-   //!Increases managed memory in extra_size bytes more. This only works
-   //!with single-segment management.
-   void grow(size_type extra_size)
-   {  MemoryAlgorithm::grow(extra_size);   }
-
-   //!Decreases managed memory to the minimum. This only works
-   //!with single-segment management.
-   void shrink_to_fit()
-   {  MemoryAlgorithm::shrink_to_fit();   }
-
-   //!Returns the result of "all_memory_deallocated()" function
-   //!of the used memory algorithm
-   bool all_memory_deallocated()
-   {   return MemoryAlgorithm::all_memory_deallocated(); }
-
-   //!Returns the result of "check_sanity()" function
-   //!of the used memory algorithm
-   bool check_sanity()
-   {   return MemoryAlgorithm::check_sanity(); }
-
-   //!Writes to zero free memory (memory not yet allocated)
-   //!of the memory algorithm
-   void zero_free_memory()
-   {   MemoryAlgorithm::zero_free_memory(); }
-
-   //!Returns the size of the buffer previously allocated pointed by ptr
-   size_type size(const void *ptr) const
-   {   return MemoryAlgorithm::size(ptr); }
-
-   #if !defined(BOOST_INTERPROCESS_DOXYGEN_INVOKED)
-   protected:
-   void * prot_anonymous_construct
-      (size_type num, bool dothrow, ipcdetail::in_place_interface &table)
-   {
-      typedef ipcdetail::block_header<size_type> block_header_t;
-      block_header_t block_info (  size_type(table.size*num)
-                                 , size_type(table.alignment)
-                                 , anonymous_type
-                                 , 1
-                                 , 0);
-
-      //Allocate memory
-      void *ptr_struct = this->allocate(block_info.total_size(), nothrow<>::get());
-
-      //Check if there is enough memory
-      if(!ptr_struct){
-         if(dothrow){
-            throw bad_alloc();
-         }
-         else{
-            return 0;
-         }
-      }
-
-      //Build scoped ptr to avoid leaks with constructor exception
-      ipcdetail::mem_algo_deallocator<MemoryAlgorithm> mem(ptr_struct, *this);
-
-      //Now construct the header
-      block_header_t * hdr = ::new(ptr_struct, boost_container_new_t()) block_header_t(block_info);
-      void *ptr = 0; //avoid gcc warning
-      ptr = hdr->value();
-
-      //Now call constructors
-      ipcdetail::array_construct(ptr, num, table);
-
-      //All constructors successful, we don't want erase memory
-      mem.release();
-      return ptr;
-   }
-
-   //!Calls the destructor and makes an anonymous deallocate
-   void prot_anonymous_destroy(const void *object, ipcdetail::in_place_interface &table)
-   {
-
-      //Get control data from associated with this object
-      typedef ipcdetail::block_header<size_type> block_header_t;
-      block_header_t *ctrl_data = block_header_t::block_header_from_value(object, table.size, table.alignment);
-
-      //-------------------------------
-      //scoped_lock<rmutex> guard(m_header);
-      //-------------------------------
-
-      if(ctrl_data->alloc_type() != anonymous_type){
-         //This is not an anonymous object, the pointer is wrong!
-         BOOST_ASSERT(0);
-      }
-
-      //Call destructors and free memory
-      //Build scoped ptr to avoid leaks with destructor exception
-      std::size_t destroyed = 0;
-     table.destroy_n(const_cast<void*>(object), ctrl_data->m_value_bytes/table.size, destroyed);
-      this->deallocate(ctrl_data);
-   }
-   #endif   //#ifndef BOOST_INTERPROCESS_DOXYGEN_INVOKED
-};
-
-//!This object is placed in the beginning of memory segment and
-//!implements the allocation (named or anonymous) of portions
-//!of the segment. This object contains two indexes that
-//!maintain an association between a name and a portion of the segment.
-//!
-//!The first index contains the mappings for normal named objects using the
-//!char type specified in the template parameter.
-//!
-//!The second index contains the association for unique instances. The key will
-//!be the const char * returned from type_info.name() function for the unique
-//!type to be constructed.
-//!
-//!segment_manager<CharType, MemoryAlgorithm, IndexType> inherits publicly
-//!from segment_manager_base<MemoryAlgorithm> and inherits from it
-//!many public functions related to anonymous object and raw memory allocation.
-//!See segment_manager_base reference to know about those functions.
-template<class CharType
-        ,class MemoryAlgorithm
-        ,template<class IndexConfig> class IndexType>
-class segment_manager
-   :  public segment_manager_base<MemoryAlgorithm>
-{
-   #if !defined(BOOST_INTERPROCESS_DOXYGEN_INVOKED)
-   //Non-copyable
-   segment_manager();
-   segment_manager(const segment_manager &);
-   segment_manager &operator=(const segment_manager &);
-   typedef segment_manager_base<MemoryAlgorithm> segment_manager_base_t;
-   #endif   //#ifndef BOOST_INTERPROCESS_DOXYGEN_INVOKED
-
-   public:
-   typedef MemoryAlgorithm                                  memory_algorithm;
-   typedef typename segment_manager_base_t::void_pointer    void_pointer;
-   typedef typename segment_manager_base_t::size_type       size_type;
-   typedef typename segment_manager_base_t::difference_type difference_type;
-   typedef CharType                                         char_type;
-
-   typedef segment_manager_base<MemoryAlgorithm>   segment_manager_base_type;
-
-   static const size_type PayloadPerAllocation = segment_manager_base_t::PayloadPerAllocation;
-
-   #if !defined(BOOST_INTERPROCESS_DOXYGEN_INVOKED)
-   private:
-   typedef ipcdetail::block_header<size_type> block_header_t;
-   typedef ipcdetail::index_config<CharType, MemoryAlgorithm>  index_config_named;
-   typedef ipcdetail::index_config<char, MemoryAlgorithm>      index_config_unique;
-   typedef IndexType<index_config_named>                    index_type;
-   typedef ipcdetail::bool_<is_intrusive_index<index_type>::value >    is_intrusive_t;
-   typedef ipcdetail::bool_<is_node_index<index_type>::value>          is_node_index_t;
-
-   public:
-   typedef IndexType<index_config_named>                    named_index_t;
-   typedef IndexType<index_config_unique>                   unique_index_t;
-   typedef ipcdetail::char_ptr_holder<CharType>                char_ptr_holder_t;
-   typedef ipcdetail::segment_manager_iterator_transform
-      <typename named_index_t::const_iterator
-      ,is_intrusive_index<index_type>::value>   named_transform;
-
-   typedef ipcdetail::segment_manager_iterator_transform
-      <typename unique_index_t::const_iterator
-      ,is_intrusive_index<index_type>::value>   unique_transform;
-   #endif   //#ifndef BOOST_INTERPROCESS_DOXYGEN_INVOKED
-
-   typedef typename segment_manager_base_t::mutex_family       mutex_family;
-
-   typedef transform_iterator
-      <typename named_index_t::const_iterator, named_transform> const_named_iterator;
-   typedef transform_iterator
-      <typename unique_index_t::const_iterator, unique_transform> const_unique_iterator;
-
-   #if !defined(BOOST_INTERPROCESS_DOXYGEN_INVOKED)
-
-   //!Constructor proxy object definition helper class
-   template<class T>
-   struct construct_proxy
-   {
-      typedef ipcdetail::named_proxy<segment_manager, T, false>   type;
-   };
-
-   //!Constructor proxy object definition helper class
-   template<class T>
-   struct construct_iter_proxy
-   {
-      typedef ipcdetail::named_proxy<segment_manager, T, true>   type;
-   };
-
-   #endif   //#ifndef BOOST_INTERPROCESS_DOXYGEN_INVOKED
-
-   //!Constructor of the segment manager
-   //!"size" is the size of the memory segment where
-   //!the segment manager is being constructed.
-   //!Can throw
-   explicit segment_manager(size_type segment_size)
-      :  segment_manager_base_t(segment_size, priv_get_reserved_bytes())
-      ,  m_header(static_cast<segment_manager_base_t*>(get_this_pointer()))
-   {
-      (void) anonymous_instance;   (void) unique_instance;
-      //Check EBO is applied, it's required
-      const void * const this_addr = this;
-      const void *const segm_addr  = static_cast<segment_manager_base_t*>(this);
-      (void)this_addr;  (void)segm_addr;
-      BOOST_ASSERT( this_addr == segm_addr);
-      const std::size_t void_ptr_alignment = boost::move_detail::alignment_of<void_pointer>::value; (void)void_ptr_alignment;
-      BOOST_ASSERT((0 == (std::size_t)this_addr % boost::move_detail::alignment_of<segment_manager>::value));
-   }
-
-   //!Tries to find a previous named/unique allocation. Returns the address
-   //!and the object count. On failure the first member of the
-   //!returned pair is 0.
-   template <class T>
-   std::pair<T*, size_type> find  (char_ptr_holder_t name)
-   {  return this->priv_find_impl<T>(name, true);  }
-
-   //!Tries to find a previous named/unique allocation. Returns the address
-   //!and the object count. On failure the first member of the
-   //!returned pair is 0. This search is not mutex-protected!
-   //!Use it only inside atomic_func() calls, where the internal mutex
-   //!is guaranteed to be locked.
-   template <class T>
-   std::pair<T*, size_type> find_no_lock  (char_ptr_holder_t name)
-   {  return this->priv_find_impl<T>(name, false);  }
-
-   //!Returns throwing "construct" proxy
-   //!object
-   template <class T>
-   typename construct_proxy<T>::type
-      construct(char_ptr_holder_t name)
-   {  return typename construct_proxy<T>::type (this, name, false, true);  }
-
-   //!Returns throwing "search or construct" proxy
-   //!object
-   template <class T>
-   typename construct_proxy<T>::type find_or_construct(char_ptr_holder_t name)
-   {  return typename construct_proxy<T>::type (this, name, true, true);  }
-
-   //!Returns no throwing "construct" proxy
-   //!object
-   template <class T>
-   typename construct_proxy<T>::type
-      construct(char_ptr_holder_t name, const std::nothrow_t &)
-   {  return typename construct_proxy<T>::type (this, name, false, false);  }
-
-   //!Returns no throwing "search or construct"
-   //!proxy object
-   template <class T>
-   typename construct_proxy<T>::type
-      find_or_construct(char_ptr_holder_t name, const std::nothrow_t &)
-   {  return typename construct_proxy<T>::type (this, name, true, false);  }
-
-   //!Returns throwing "construct from iterators" proxy object
-   template <class T>
-   typename construct_iter_proxy<T>::type
-      construct_it(char_ptr_holder_t name)
-   {  return typename construct_iter_proxy<T>::type (this, name, false, true);  }
-
-   //!Returns throwing "search or construct from iterators"
-   //!proxy object
-   template <class T>
-   typename construct_iter_proxy<T>::type
-      find_or_construct_it(char_ptr_holder_t name)
-   {  return typename construct_iter_proxy<T>::type (this, name, true, true);  }
-
-   //!Returns no throwing "construct from iterators"
-   //!proxy object
-   template <class T>
-   typename construct_iter_proxy<T>::type
-      construct_it(char_ptr_holder_t name, const std::nothrow_t &)
-   {  return typename construct_iter_proxy<T>::type (this, name, false, false);  }
-
-   //!Returns no throwing "search or construct from iterators"
-   //!proxy object
-   template <class T>
-   typename construct_iter_proxy<T>::type
-      find_or_construct_it(char_ptr_holder_t name, const std::nothrow_t &)
-   {  return typename construct_iter_proxy<T>::type (this, name, true, false);  }
-
-   //!Calls object function blocking recursive interprocess_mutex and guarantees that
-   //!no new named_alloc or destroy will be executed by any process while
-   //!executing the object function call
-   template <class Func>
-   void atomic_func(Func &f)
-   {  scoped_lock<rmutex> guard(m_header);  f();  }
-
-   //!Tries to calls a functor guaranteeing that no new construction, search or
-   //!destruction will be executed by any process while executing the object
-   //!function call. If the atomic function can't be immediatelly executed
-   //!because the internal mutex is already locked, returns false.
-   //!If the functor throws, this function throws.
-   template <class Func>
-   bool try_atomic_func(Func &f)
-   {
-      scoped_lock<rmutex> guard(m_header, try_to_lock);
-      if(guard){
-         f();
-         return true;
-      }
-      else{
-         return false;
-      }
-   }
-
-   //!Destroys a previously created named/unique instance.
-   //!Returns false if the object was not present.
-   template <class T>
-   bool destroy(char_ptr_holder_t name)
-   {
-      BOOST_ASSERT(!name.is_anonymous());
-      ipcdetail::placement_destroy<T> dtor;
-
-      if(name.is_unique()){
-         return this->priv_generic_named_destroy<char>
-            ( typeid(T).name(), m_header.m_unique_index , dtor, is_intrusive_t());
-      }
-      else{
-         return this->priv_generic_named_destroy<CharType>
-            ( name.get(), m_header.m_named_index, dtor, is_intrusive_t());
-      }
-   }
-
-   //!Destroys an anonymous, unique or named object
-   //!using its address
-   template <class T>
-   void destroy_ptr(const T *p)
-   {
-      //If T is void transform it to char
-      typedef typename ipcdetail::char_if_void<T>::type data_t;
-      ipcdetail::placement_destroy<data_t> dtor;
-      priv_destroy_ptr(p, dtor);
-   }
-
-   //!Returns the name of an object created with construct/find_or_construct
-   //!functions. Does not throw
-   template<class T>
-   static const CharType *get_instance_name(const T *ptr)
-   { return priv_get_instance_name(block_header_t::block_header_from_value(ptr));  }
-
-   //!Returns the length of an object created with construct/find_or_construct
-   //!functions. Does not throw.
-   template<class T>
-   static size_type get_instance_length(const T *ptr)
-   {  return priv_get_instance_length(block_header_t::block_header_from_value(ptr), sizeof(T));  }
-
-   //!Returns is the the name of an object created with construct/find_or_construct
-   //!functions. Does not throw
-   template<class T>
-   static instance_type get_instance_type(const T *ptr)
-   {  return priv_get_instance_type(block_header_t::block_header_from_value(ptr));  }
-
-   //!Preallocates needed index resources to optimize the
-   //!creation of "num" named objects in the managed memory segment.
-   //!Can throw boost::interprocess::bad_alloc if there is no enough memory.
-   void reserve_named_objects(size_type num)
-   {
-      //-------------------------------
-      scoped_lock<rmutex> guard(m_header);
-      //-------------------------------
-      m_header.m_named_index.reserve(num);
-   }
-
-   //!Preallocates needed index resources to optimize the
-   //!creation of "num" unique objects in the managed memory segment.
-   //!Can throw boost::interprocess::bad_alloc if there is no enough memory.
-   void reserve_unique_objects(size_type num)
-   {
-      //-------------------------------
-      scoped_lock<rmutex> guard(m_header);
-      //-------------------------------
-      m_header.m_unique_index.reserve(num);
-   }
-
-   //!Calls shrink_to_fit in both named and unique object indexes
-   //!to try to free unused memory from those indexes.
-   void shrink_to_fit_indexes()
-   {
-      //-------------------------------
-      scoped_lock<rmutex> guard(m_header);
-      //-------------------------------
-      m_header.m_named_index.shrink_to_fit();
-      m_header.m_unique_index.shrink_to_fit();
-   }
-
-   //!Returns the number of named objects stored in
-   //!the segment.
-   size_type get_num_named_objects()
-   {
-      //-------------------------------
-      scoped_lock<rmutex> guard(m_header);
-      //-------------------------------
-      return m_header.m_named_index.size();
-   }
-
-   //!Returns the number of unique objects stored in
-   //!the segment.
-   size_type get_num_unique_objects()
-   {
-      //-------------------------------
-      scoped_lock<rmutex> guard(m_header);
-      //-------------------------------
-      return m_header.m_unique_index.size();
-   }
-
-   //!Obtains the minimum size needed by the
-   //!segment manager
-   static size_type get_min_size()
-   {  return segment_manager_base_t::get_min_size(priv_get_reserved_bytes());  }
-
-   //!Returns a constant iterator to the beginning of the information about
-   //!the named allocations performed in this segment manager
-   const_named_iterator named_begin() const
-   {
-      return (make_transform_iterator)
-         (m_header.m_named_index.begin(), named_transform());
-   }
-
-   //!Returns a constant iterator to the end of the information about
-   //!the named allocations performed in this segment manager
-   const_named_iterator named_end() const
-   {
-      return (make_transform_iterator)
-         (m_header.m_named_index.end(), named_transform());
-   }
-
-   //!Returns a constant iterator to the beginning of the information about
-   //!the unique allocations performed in this segment manager
-   const_unique_iterator unique_begin() const
-   {
-      return (make_transform_iterator)
-         (m_header.m_unique_index.begin(), unique_transform());
-   }
-
-   //!Returns a constant iterator to the end of the information about
-   //!the unique allocations performed in this segment manager
-   const_unique_iterator unique_end() const
-   {
-      return (make_transform_iterator)
-         (m_header.m_unique_index.end(), unique_transform());
-   }
-
-   //!This is the default allocator to allocate types T
-   //!from this managed segment
-   template<class T>
-   struct allocator
-   {
-      typedef boost::interprocess::allocator<T, segment_manager> type;
-   };
-
-   //!Returns an instance of the default allocator for type T
-   //!initialized that allocates memory from this segment manager.
-   template<class T>
-   typename allocator<T>::type
-      get_allocator()
-   {   return typename allocator<T>::type(this); }
-
-   //!This is the default deleter to delete types T
-   //!from this managed segment.
-   template<class T>
-   struct deleter
-   {
-      typedef boost::interprocess::deleter<T, segment_manager> type;
-   };
-
-   //!Returns an instance of the default deleter for type T
-   //!that will delete an object constructed in this segment manager.
-   template<class T>
-   typename deleter<T>::type
-      get_deleter()
-   {   return typename deleter<T>::type(this); }
-
-   #if !defined(BOOST_INTERPROCESS_DOXYGEN_INVOKED)
-
-   //!Generic named/anonymous new function. Offers all the possibilities,
-   //!such as throwing, search before creating, and the constructor is
-   //!encapsulated in an object function.
-   template<class T>
-   T *generic_construct(const CharType *name,
-                        size_type num,
-                         bool try2find,
-                         bool dothrow,
-                         ipcdetail::in_place_interface &table)
-   {
-      return static_cast<T*>
-         (priv_generic_construct(name, num, try2find, dothrow, table));
-   }
-
-   private:
-   //!Tries to find a previous named allocation. Returns the address
-   //!and the object count. On failure the first member of the
-   //!returned pair is 0.
-   template <class T>
-   std::pair<T*, size_type> priv_find_impl (const CharType* name, bool lock)
-   {
-      //The name can't be null, no anonymous object can be found by name
-      BOOST_ASSERT(name != 0);
-      ipcdetail::placement_destroy<T> table;
-      size_type sz;
-      void *ret;
-
-      if(name == reinterpret_cast<const CharType*>(-1)){
-         ret = priv_generic_find<char> (typeid(T).name(), m_header.m_unique_index, table, sz, is_intrusive_t(), lock);
-      }
-      else{
-         ret = priv_generic_find<CharType> (name, m_header.m_named_index, table, sz, is_intrusive_t(), lock);
-      }
-      return std::pair<T*, size_type>(static_cast<T*>(ret), sz);
-   }
-
-   //!Tries to find a previous unique allocation. Returns the address
-   //!and the object count. On failure the first member of the
-   //!returned pair is 0.
-   template <class T>
-   std::pair<T*, size_type> priv_find_impl (const ipcdetail::unique_instance_t* name, bool lock)
-   {
-      ipcdetail::placement_destroy<T> table;
-      size_type size;
-      void *ret = priv_generic_find<char>(name, m_header.m_unique_index, table, size, is_intrusive_t(), lock);
-      return std::pair<T*, size_type>(static_cast<T*>(ret), size);
-   }
-
-   void *priv_generic_construct
-      (const CharType *name, size_type num, bool try2find, bool dothrow, ipcdetail::in_place_interface &table)
-   {
-      void *ret;
-      //Security overflow check
-      if(num > ((std::size_t)-1)/table.size){
-         if(dothrow)
-            throw bad_alloc();
-         else
-            return 0;
-      }
-      if(name == 0){
-         ret = this->prot_anonymous_construct(num, dothrow, table);
-      }
-      else if(name == reinterpret_cast<const CharType*>(-1)){
-         ret = this->priv_generic_named_construct<char>
-            (unique_type, table.type_name, num, try2find, dothrow, table, m_header.m_unique_index, is_intrusive_t());
-      }
-      else{
-         ret = this->priv_generic_named_construct<CharType>
-            (named_type, name, num, try2find, dothrow, table, m_header.m_named_index, is_intrusive_t());
-      }
-      return ret;
-   }
-
-   void priv_destroy_ptr(const void *ptr, ipcdetail::in_place_interface &dtor)
-   {
-      block_header_t *ctrl_data = block_header_t::block_header_from_value(ptr, dtor.size, dtor.alignment);
-      switch(ctrl_data->alloc_type()){
-         case anonymous_type:
-            this->prot_anonymous_destroy(ptr, dtor);
-         break;
-
-         case named_type:
-            this->priv_generic_named_destroy<CharType>
-               (ctrl_data, m_header.m_named_index, dtor, is_node_index_t());
-         break;
-
-         case unique_type:
-            this->priv_generic_named_destroy<char>
-               (ctrl_data, m_header.m_unique_index, dtor, is_node_index_t());
-         break;
-
-         default:
-            //This type is unknown, bad pointer passed to this function!
-            BOOST_ASSERT(0);
-         break;
-      }
-   }
-
-   //!Returns the name of an object created with construct/find_or_construct
-   //!functions. Does not throw
-   static const CharType *priv_get_instance_name(block_header_t *ctrl_data)
-   {
-      boost::interprocess::allocation_type type = ctrl_data->alloc_type();
-      if(type == anonymous_type){
-         BOOST_ASSERT((type == anonymous_type && ctrl_data->m_num_char == 0) ||
-                (type == unique_type    && ctrl_data->m_num_char != 0) );
-         return 0;
-      }
-      CharType *name = static_cast<CharType*>(ctrl_data->template name<CharType>());
-
-      //Sanity checks
-      BOOST_ASSERT(ctrl_data->sizeof_char() == sizeof(CharType));
-      BOOST_ASSERT(ctrl_data->m_num_char == std::char_traits<CharType>::length(name));
-      return name;
-   }
-
-   static size_type priv_get_instance_length(block_header_t *ctrl_data, size_type sizeofvalue)
-   {
-      //Get header
-      BOOST_ASSERT((ctrl_data->value_bytes() %sizeofvalue) == 0);
-      return ctrl_data->value_bytes()/sizeofvalue;
-   }
-
-   //!Returns is the the name of an object created with construct/find_or_construct
-   //!functions. Does not throw
-   static instance_type priv_get_instance_type(block_header_t *ctrl_data)
-   {
-      //Get header
-      BOOST_ASSERT((instance_type)ctrl_data->alloc_type() < max_allocation_type);
-      return (instance_type)ctrl_data->alloc_type();
-   }
-
-   static size_type priv_get_reserved_bytes()
-   {
-      //Get the number of bytes until the end of (*this)
-      //beginning in the end of the segment_manager_base_t base.
-      return sizeof(segment_manager) - sizeof(segment_manager_base_t);
-   }
-
-   template <class CharT>
-   void *priv_generic_find
-      (const CharT* name,
-       IndexType<ipcdetail::index_config<CharT, MemoryAlgorithm> > &index,
-       ipcdetail::in_place_interface &table,
-       size_type &length, ipcdetail::true_ is_intrusive, bool use_lock)
-   {
-      (void)is_intrusive;
-      typedef IndexType<ipcdetail::index_config<CharT, MemoryAlgorithm> >         index_type_t;
-      typedef typename index_type_t::iterator           index_it;
-
-      //-------------------------------
-      scoped_lock<rmutex> guard(priv_get_lock(use_lock));
-      //-------------------------------
-      //Find name in index
-      ipcdetail::intrusive_compare_key<CharT> key
-         (name, std::char_traits<CharT>::length(name));
-      index_it it = index.find(key);
-
-      //Initialize return values
-      void *ret_ptr  = 0;
-      length         = 0;
-
-      //If found, assign values
-      if(it != index.end()){
-         //Get header
-         block_header_t *ctrl_data = it->get_block_header();
-
-         //Sanity check
-         BOOST_ASSERT((ctrl_data->m_value_bytes % table.size) == 0);
-         BOOST_ASSERT(ctrl_data->sizeof_char() == sizeof(CharT));
-         ret_ptr  = ctrl_data->value();
-         length  = ctrl_data->m_value_bytes/table.size;
-      }
-      return ret_ptr;
-   }
-
-   template <class CharT>
-   void *priv_generic_find
-      (const CharT* name,
-       IndexType<ipcdetail::index_config<CharT, MemoryAlgorithm> > &index,
-       ipcdetail::in_place_interface &table,
-       size_type &length, ipcdetail::false_ is_intrusive, bool use_lock)
-   {
-      (void)is_intrusive;
-      typedef IndexType<ipcdetail::index_config<CharT, MemoryAlgorithm> >      char_aware_index_type;
-      typedef typename char_aware_index_type::key_type        key_type;
-      typedef typename char_aware_index_type::iterator        index_it;
-
-      //-------------------------------
-      scoped_lock<rmutex> guard(priv_get_lock(use_lock));
-      //-------------------------------
-      //Find name in index
-      index_it it = index.find(key_type(name, std::char_traits<CharT>::length(name)));
-
-      //Initialize return values
-      void *ret_ptr  = 0;
-      length         = 0;
-
-      //If found, assign values
-      if(it != index.end()){
-         //Get header
-         block_header_t *ctrl_data = reinterpret_cast<block_header_t*>
-                                    (ipcdetail::to_raw_pointer(it->second.m_ptr));
-
-         //Sanity check
-         BOOST_ASSERT((ctrl_data->m_value_bytes % table.size) == 0);
-         BOOST_ASSERT(ctrl_data->sizeof_char() == sizeof(CharT));
-         ret_ptr  = ctrl_data->value();
-         length  = ctrl_data->m_value_bytes/table.size;
-      }
-      return ret_ptr;
-   }
-
-   template <class CharT>
-   bool priv_generic_named_destroy
-     (block_header_t *block_header,
-      IndexType<ipcdetail::index_config<CharT, MemoryAlgorithm> > &index,
-      ipcdetail::in_place_interface &table, ipcdetail::true_ is_node_index)
-   {
-      (void)is_node_index;
-      typedef typename IndexType<ipcdetail::index_config<CharT, MemoryAlgorithm> >::iterator index_it;
-
-      index_it *ihdr = block_header_t::template to_first_header<index_it>(block_header);
-      return this->priv_generic_named_destroy_impl<CharT>(*ihdr, index, table);
-   }
-
-   template <class CharT>
-   bool priv_generic_named_destroy
-     (block_header_t *block_header,
-      IndexType<ipcdetail::index_config<CharT, MemoryAlgorithm> > &index,
-      ipcdetail::in_place_interface &table,
-      ipcdetail::false_ is_node_index)
-   {
-      (void)is_node_index;
-      CharT *name = static_cast<CharT*>(block_header->template name<CharT>());
-      return this->priv_generic_named_destroy<CharT>(name, index, table, is_intrusive_t());
-   }
-
-   template <class CharT>
-   bool priv_generic_named_destroy(const CharT *name,
-                                   IndexType<ipcdetail::index_config<CharT, MemoryAlgorithm> > &index,
-                                   ipcdetail::in_place_interface &table, ipcdetail::true_ is_intrusive_index)
-   {
-      (void)is_intrusive_index;
-      typedef IndexType<ipcdetail::index_config<CharT, MemoryAlgorithm> >         index_type_t;
-      typedef typename index_type_t::iterator           index_it;
-      typedef typename index_type_t::value_type         intrusive_value_type;
-
-      //-------------------------------
-      scoped_lock<rmutex> guard(m_header);
-      //-------------------------------
-      //Find name in index
-      ipcdetail::intrusive_compare_key<CharT> key
-         (name, std::char_traits<CharT>::length(name));
-      index_it it = index.find(key);
-
-      //If not found, return false
-      if(it == index.end()){
-         //This name is not present in the index, wrong pointer or name!
-         //BOOST_ASSERT(0);
-         return false;
-      }
-
-      block_header_t *ctrl_data = it->get_block_header();
-      intrusive_value_type *iv = intrusive_value_type::get_intrusive_value_type(ctrl_data);
-      void *memory = iv;
-      void *values = ctrl_data->value();
-      std::size_t num = ctrl_data->m_value_bytes/table.size;
-
-      //Sanity check
-      BOOST_ASSERT((ctrl_data->m_value_bytes % table.size) == 0);
-      BOOST_ASSERT(sizeof(CharT) == ctrl_data->sizeof_char());
-
-      //Erase node from index
-      index.erase(it);
-
-      //Destroy the headers
-      ctrl_data->~block_header_t();
-      iv->~intrusive_value_type();
-
-      //Call destructors and free memory
-      std::size_t destroyed;
-      table.destroy_n(values, num, destroyed);
-      this->deallocate(memory);
-      return true;
-   }
-
-   template <class CharT>
-   bool priv_generic_named_destroy(const CharT *name,
-                                   IndexType<ipcdetail::index_config<CharT, MemoryAlgorithm> > &index,
-                                   ipcdetail::in_place_interface &table,
-                                   ipcdetail::false_ is_intrusive_index)
-   {
-      (void)is_intrusive_index;
-      typedef IndexType<ipcdetail::index_config<CharT, MemoryAlgorithm> >            char_aware_index_type;
-      typedef typename char_aware_index_type::iterator              index_it;
-      typedef typename char_aware_index_type::key_type              key_type;
-
-      //-------------------------------
-      scoped_lock<rmutex> guard(m_header);
-      //-------------------------------
-      //Try to find the name in the index
-      index_it it = index.find(key_type (name,
-                                     std::char_traits<CharT>::length(name)));
-
-      //If not found, return false
-      if(it == index.end()){
-         //This name is not present in the index, wrong pointer or name!
-         //BOOST_ASSERT(0);
-         return false;
-      }
-      return this->priv_generic_named_destroy_impl<CharT>(it, index, table);
-   }
-
-   template <class CharT>
-   bool priv_generic_named_destroy_impl
-      (const typename IndexType<ipcdetail::index_config<CharT, MemoryAlgorithm> >::iterator &it,
-      IndexType<ipcdetail::index_config<CharT, MemoryAlgorithm> > &index,
-      ipcdetail::in_place_interface &table)
-   {
-      typedef IndexType<ipcdetail::index_config<CharT, MemoryAlgorithm> >      char_aware_index_type;
-      typedef typename char_aware_index_type::iterator        index_it;
-
-      //Get allocation parameters
-      block_header_t *ctrl_data = reinterpret_cast<block_header_t*>
-                                 (ipcdetail::to_raw_pointer(it->second.m_ptr));
-      char *stored_name       = static_cast<char*>(static_cast<void*>(const_cast<CharT*>(it->first.name())));
-      (void)stored_name;
-
-      //Check if the distance between the name pointer and the memory pointer
-      //is correct (this can detect incorrect type in destruction)
-      std::size_t num = ctrl_data->m_value_bytes/table.size;
-      void *values = ctrl_data->value();
-
-      //Sanity check
-      BOOST_ASSERT((ctrl_data->m_value_bytes % table.size) == 0);
-      BOOST_ASSERT(static_cast<void*>(stored_name) == static_cast<void*>(ctrl_data->template name<CharT>()));
-      BOOST_ASSERT(sizeof(CharT) == ctrl_data->sizeof_char());
-
-      //Erase node from index
-      index.erase(it);
-
-      //Destroy the header
-      ctrl_data->~block_header_t();
-
-      void *memory;
-      if(is_node_index_t::value){
-         index_it *ihdr = block_header_t::template
-            to_first_header<index_it>(ctrl_data);
-         ihdr->~index_it();
-         memory = ihdr;
-      }
-      else{
-         memory = ctrl_data;
-      }
-
-      //Call destructors and free memory
-      std::size_t destroyed;
-      table.destroy_n(values, num, destroyed);
-      this->deallocate(memory);
-      return true;
-   }
-
-   template<class CharT>
-   void * priv_generic_named_construct
-      (unsigned char type, const CharT *name, size_type num, bool try2find,
-      bool dothrow, ipcdetail::in_place_interface &table, 
-      IndexType<ipcdetail::index_config<CharT, MemoryAlgorithm> > &index, ipcdetail::true_ is_intrusive)
-   {
-      (void)is_intrusive;
-     std::size_t namelen  = std::char_traits<CharT>::length(name);
-
-      block_header_t block_info ( size_type(table.size*num)
-                                 , size_type(table.alignment)
-                                 , type
-                                 , sizeof(CharT)
-                                 , namelen);
-
-      typedef IndexType<ipcdetail::index_config<CharT, MemoryAlgorithm> >            index_type_t;
-      typedef typename index_type_t::iterator              index_it;
-      typedef std::pair<index_it, bool>                  index_ib;
-
-      //-------------------------------
-      scoped_lock<rmutex> guard(m_header);
-      //-------------------------------
-      //Insert the node. This can throw.
-      //First, we want to know if the key is already present before
-      //we allocate any memory, and if the key is not present, we
-      //want to allocate all memory in a single buffer that will
-      //contain the name and the user buffer.
-      //
-      //Since equal_range(key) + insert(hint, value) approach is
-      //quite inefficient in container implementations
-      //(they re-test if the position is correct), I've chosen
-      //to insert the node, do an ugly un-const cast and modify
-      //the key (which is a smart pointer) to an equivalent one
-      index_ib insert_ret;
-
-      typename index_type_t::insert_commit_data   commit_data;
-      typedef typename index_type_t::value_type   intrusive_value_type;
-
-      BOOST_TRY{
-         ipcdetail::intrusive_compare_key<CharT> key(name, namelen);
-         insert_ret = index.insert_check(key, commit_data);
-      }
-      //Ignore exceptions
-      BOOST_CATCH(...){
-         if(dothrow)
-            BOOST_RETHROW
-         return 0;
-      }
-      BOOST_CATCH_END
-
-      index_it it = insert_ret.first;
-
-      //If found and this is find or construct, return data
-      //else return null
-      if(!insert_ret.second){
-         if(try2find){
-            return it->get_block_header()->value();
-         }
-         if(dothrow){
-            throw interprocess_exception(already_exists_error);
-         }
-         else{
-            return 0;
-         }
-      }
-
-      //Allocates buffer for name + data, this can throw (it hurts)
-      void *buffer_ptr;
-
-      //Check if there is enough memory
-      if(dothrow){
-         buffer_ptr = this->allocate
-            (block_info.template total_size_with_header<intrusive_value_type>());
-      }
-      else{
-         buffer_ptr = this->allocate
-            (block_info.template total_size_with_header<intrusive_value_type>(), nothrow<>::get());
-         if(!buffer_ptr)
-            return 0;
-      }
-
-      //Now construct the intrusive hook plus the header
-      intrusive_value_type * intrusive_hdr = ::new(buffer_ptr, boost_container_new_t()) intrusive_value_type();
-      block_header_t * hdr = ::new(intrusive_hdr->get_block_header(), boost_container_new_t())block_header_t(block_info);
-      void *ptr = 0; //avoid gcc warning
-      ptr = hdr->value();
-
-      //Copy name to memory segment and insert data
-      CharT *name_ptr = static_cast<CharT *>(hdr->template name<CharT>());
-      std::char_traits<CharT>::copy(name_ptr, name, namelen+1);
-
-      BOOST_TRY{
-         //Now commit the insertion using previous context data
-         it = index.insert_commit(*intrusive_hdr, commit_data);
-      }
-      //Ignore exceptions
-      BOOST_CATCH(...){
-         if(dothrow)
-            BOOST_RETHROW
-         return 0;
-      }
-      BOOST_CATCH_END
-
-      //Avoid constructions if constructor is trivial
-      //Build scoped ptr to avoid leaks with constructor exception
-      ipcdetail::mem_algo_deallocator<segment_manager_base_type> mem
-         (buffer_ptr, *static_cast<segment_manager_base_type*>(this));
-
-      //Initialize the node value_eraser to erase inserted node
-      //if something goes wrong. This will be executed *before*
-      //the memory allocation as the intrusive value is built in that
-      //memory
-      value_eraser<index_type_t> v_eraser(index, it);
-
-      //Construct array, this can throw
-      ipcdetail::array_construct(ptr, num, table);
-
-      //Release rollbacks since construction was successful
-      v_eraser.release();
-      mem.release();
-      return ptr;
-   }
-
-   //!Generic named new function for
-   //!named functions
-   template<class CharT>
-   void * priv_generic_named_construct
-      (unsigned char type, const CharT *name, size_type num, bool try2find, bool dothrow,
-      ipcdetail::in_place_interface &table, 
-      IndexType<ipcdetail::index_config<CharT, MemoryAlgorithm> > &index, ipcdetail::false_ is_intrusive)
-   {
-      (void)is_intrusive;
-      std::size_t namelen  = std::char_traits<CharT>::length(name);
-
-      block_header_t block_info ( size_type(table.size*num)
-                                 , size_type(table.alignment)
-                                 , type
-                                 , sizeof(CharT)
-                                 , namelen);
-
-      typedef IndexType<ipcdetail::index_config<CharT, MemoryAlgorithm> >            index_type_t;
-      typedef typename index_type_t::key_type              key_type;
-      typedef typename index_type_t::mapped_type           mapped_type;
-      typedef typename index_type_t::value_type            value_type;
-      typedef typename index_type_t::iterator              index_it;
-      typedef std::pair<index_it, bool>                  index_ib;
-
-      //-------------------------------
-      scoped_lock<rmutex> guard(m_header);
-      //-------------------------------
-      //Insert the node. This can throw.
-      //First, we want to know if the key is already present before
-      //we allocate any memory, and if the key is not present, we
-      //want to allocate all memory in a single buffer that will
-      //contain the name and the user buffer.
-      //
-      //Since equal_range(key) + insert(hint, value) approach is
-      //quite inefficient in container implementations
-      //(they re-test if the position is correct), I've chosen
-      //to insert the node, do an ugly un-const cast and modify
-      //the key (which is a smart pointer) to an equivalent one
-      index_ib insert_ret;
-      BOOST_TRY{
-         insert_ret = index.insert(value_type(key_type (name, namelen), mapped_type(0)));
-      }
-      //Ignore exceptions
-      BOOST_CATCH(...){
-         if(dothrow)
-            BOOST_RETHROW;
-         return 0;
-      }
-      BOOST_CATCH_END
-
-      index_it it = insert_ret.first;
-
-      //If found and this is find or construct, return data
-      //else return null
-      if(!insert_ret.second){
-         if(try2find){
-            block_header_t *hdr = static_cast<block_header_t*>
-               (ipcdetail::to_raw_pointer(it->second.m_ptr));
-            return hdr->value();
-         }
-         return 0;
-      }
-      //Initialize the node value_eraser to erase inserted node
-      //if something goes wrong
-      value_eraser<index_type_t> v_eraser(index, it);
-
-      //Allocates buffer for name + data, this can throw (it hurts)
-      void *buffer_ptr;
-      block_header_t * hdr;
-
-      //Allocate and construct the headers
-      if(is_node_index_t::value){
-         size_type total_size = block_info.template total_size_with_header<index_it>();
-         if(dothrow){
-            buffer_ptr = this->allocate(total_size);
-         }
-         else{
-            buffer_ptr = this->allocate(total_size, nothrow<>::get());
-            if(!buffer_ptr)
-               return 0;
-         }
-         index_it *idr = ::new(buffer_ptr, boost_container_new_t()) index_it(it);
-         hdr = block_header_t::template from_first_header<index_it>(idr);
-      }
-      else{
-         if(dothrow){
-            buffer_ptr = this->allocate(block_info.total_size());
-         }
-         else{
-            buffer_ptr = this->allocate(block_info.total_size(), nothrow<>::get());
-            if(!buffer_ptr)
-               return 0;
-         }
-         hdr = static_cast<block_header_t*>(buffer_ptr);
-      }
-
-      hdr = ::new(hdr, boost_container_new_t())block_header_t(block_info);
-      void *ptr = 0; //avoid gcc warning
-      ptr = hdr->value();
-
-      //Copy name to memory segment and insert data
-      CharT *name_ptr = static_cast<CharT *>(hdr->template name<CharT>());
-      std::char_traits<CharT>::copy(name_ptr, name, namelen+1);
-
-      //Do the ugly cast, please mama, forgive me!
-      //This new key points to an identical string, so it must have the
-      //same position than the overwritten key according to the predicate
-      const_cast<key_type &>(it->first).name(name_ptr);
-      it->second.m_ptr  = hdr;
-
-      //Build scoped ptr to avoid leaks with constructor exception
-      ipcdetail::mem_algo_deallocator<segment_manager_base_type> mem
-         (buffer_ptr, *static_cast<segment_manager_base_type*>(this));
-
-      //Construct array, this can throw
-      ipcdetail::array_construct(ptr, num, table);
-
-      //All constructors successful, we don't want to release memory
-      mem.release();
-
-      //Release node v_eraser since construction was successful
-      v_eraser.release();
-      return ptr;
-   }
-
-   private:
-   //!Returns the this pointer
-   segment_manager *get_this_pointer()
-   {  return this;  }
-
-   typedef typename MemoryAlgorithm::mutex_family::recursive_mutex_type   rmutex;
-
-   scoped_lock<rmutex> priv_get_lock(bool use_lock)
-   {
-      scoped_lock<rmutex> local(m_header, defer_lock);
-      if(use_lock){
-         local.lock();
-      }
-      return scoped_lock<rmutex>(boost::move(local));
-   }
-
-   //!This struct includes needed data and derives from
-   //!rmutex to allow EBO when using null interprocess_mutex
-   struct header_t
-      :  public rmutex
-   {
-      named_index_t           m_named_index;
-      unique_index_t          m_unique_index;
-
-      header_t(segment_manager_base_t *segment_mngr_base)
-         :  m_named_index (segment_mngr_base)
-         ,  m_unique_index(segment_mngr_base)
-      {}
-   }  m_header;
-
-   #endif   //#ifndef BOOST_INTERPROCESS_DOXYGEN_INVOKED
-};
-
-
-}} //namespace boost { namespace interprocess
-
-#include <boost/interprocess/detail/config_end.hpp>
-
-#endif //#ifndef BOOST_INTERPROCESS_SEGMENT_MANAGER_HPP
-
diff --git a/src/boost/interprocess/shared_memory_object.hpp b/src/boost/interprocess/shared_memory_object.hpp
deleted file mode 100644
index 2d429efc..00000000
--- a/src/boost/interprocess/shared_memory_object.hpp
+++ /dev/null
@@ -1,514 +0,0 @@
-//////////////////////////////////////////////////////////////////////////////
-//
-// (C) Copyright Ion Gaztanaga 2005-2012. Distributed under the Boost
-// 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/interprocess for documentation.
-//
-//////////////////////////////////////////////////////////////////////////////
-
-#ifndef BOOST_INTERPROCESS_SHARED_MEMORY_OBJECT_HPP
-#define BOOST_INTERPROCESS_SHARED_MEMORY_OBJECT_HPP
-
-#ifndef BOOST_CONFIG_HPP
-#  include <boost/config.hpp>
-#endif
-#
-#if defined(BOOST_HAS_PRAGMA_ONCE)
-#  pragma once
-#endif
-
-#include <boost/interprocess/detail/config_begin.hpp>
-#include <boost/interprocess/detail/workaround.hpp>
-#include <boost/interprocess/creation_tags.hpp>
-#include <boost/interprocess/exceptions.hpp>
-#include <boost/move/utility_core.hpp>
-#include <boost/interprocess/interprocess_fwd.hpp>
-#include <boost/interprocess/exceptions.hpp>
-#include <boost/interprocess/detail/os_file_functions.hpp>
-#include <boost/interprocess/detail/shared_dir_helpers.hpp>
-#include <boost/interprocess/detail/char_wchar_holder.hpp>
-#include <boost/interprocess/permissions.hpp>
-#include <boost/move/adl_move_swap.hpp>
-#include <cstddef>
-
-#if defined(BOOST_INTERPROCESS_POSIX_SHARED_MEMORY_OBJECTS)
-#  include <string>
-#  include <fcntl.h>        //posix_fallocate, O_CREAT, O_*...
-#  include <sys/mman.h>     //shm_xxx
-#  include <unistd.h>       //ftruncate, close
-#  include <sys/stat.h>     //mode_t, S_IRWXG, S_IRWXO, S_IRWXU,
-#  if defined(BOOST_INTERPROCESS_RUNTIME_FILESYSTEM_BASED_POSIX_SHARED_MEMORY)
-#     if defined(__FreeBSD__)
-#        include <sys/sysctl.h>
-#     endif
-#  endif
-#else
-//
-#endif
-
-//!\file
-//!Describes a shared memory object management class.
-
-namespace boost {
-namespace interprocess {
-
-//!A class that wraps a shared memory mapping that can be used to
-//!create mapped regions from the mapped files
-class shared_memory_object
-{
-   #if !defined(BOOST_INTERPROCESS_DOXYGEN_INVOKED)
-   //Non-copyable and non-assignable
-   BOOST_MOVABLE_BUT_NOT_COPYABLE(shared_memory_object)
-   #endif   //#ifndef BOOST_INTERPROCESS_DOXYGEN_INVOKED
-
-   public:
-   //!Default constructor. Represents an empty shared_memory_object.
-   shared_memory_object() BOOST_NOEXCEPT;
-
-   //!Creates a shared memory object with name "name" and mode "mode", with the access mode "mode"
-   //!If the file previously exists, throws an error.*/
-   shared_memory_object(create_only_t, const char *name, mode_t mode, const permissions &perm = permissions())
-   {  this->priv_open_or_create(ipcdetail::DoCreate, name, mode, perm);  }
-
-   //!Tries to create a shared memory object with name "name" and mode "mode", with the
-   //!access mode "mode". If the file previously exists, it tries to open it with mode "mode".
-   //!Otherwise throws an error.
-   shared_memory_object(open_or_create_t, const char *name, mode_t mode, const permissions &perm = permissions())
-   {  this->priv_open_or_create(ipcdetail::DoOpenOrCreate, name, mode, perm);  }
-
-   //!Tries to open a shared memory object with name "name", with the access mode "mode".
-   //!If the file does not previously exist, it throws an error.
-   shared_memory_object(open_only_t, const char *name, mode_t mode)
-   {  this->priv_open_or_create(ipcdetail::DoOpen, name, mode, permissions());  }
-
-   #if defined(BOOST_INTERPROCESS_WCHAR_NAMED_RESOURCES) || defined(BOOST_INTERPROCESS_DOXYGEN_INVOKED)
-
-   //!Creates a shared memory object with name "name" and mode "mode", with the access mode "mode"
-   //!If the file previously exists, throws an error.
-   //! 
-   //!Note: This function is only available on operating systems with
-   //!      native wchar_t APIs (e.g. Windows).
-   shared_memory_object(create_only_t, const wchar_t*name, mode_t mode, const permissions &perm = permissions())
-   {  this->priv_open_or_create(ipcdetail::DoCreate, name, mode, perm);  }
-
-   //!Tries to create a shared memory object with name "name" and mode "mode", with the
-   //!access mode "mode". If the file previously exists, it tries to open it with mode "mode".
-   //!Otherwise throws an error.
-   //! 
-   //!Note: This function is only available on operating systems with
-   //!      native wchar_t APIs (e.g. Windows).
-   shared_memory_object(open_or_create_t, const wchar_t*name, mode_t mode, const permissions &perm = permissions())
-   {  this->priv_open_or_create(ipcdetail::DoOpenOrCreate, name, mode, perm);  }
-
-   //!Tries to open a shared memory object with name "name", with the access mode "mode".
-   //!If the file does not previously exist, it throws an error.
-   //! 
-   //!Note: This function is only available on operating systems with
-   //!      native wchar_t APIs (e.g. Windows).
-   shared_memory_object(open_only_t, const wchar_t*name, mode_t mode)
-   {  this->priv_open_or_create(ipcdetail::DoOpen, name, mode, permissions());  }
-
-   #endif //defined(BOOST_INTERPROCESS_WCHAR_NAMED_RESOURCES) || defined(BOOST_INTERPROCESS_DOXYGEN_INVOKED)
-
-   //!Moves the ownership of "moved"'s shared memory object to *this.
-   //!After the call, "moved" does not represent any shared memory object.
-   //!Does not throw
-   shared_memory_object(BOOST_RV_REF(shared_memory_object) moved) BOOST_NOEXCEPT
-      :  m_handle(file_handle_t(ipcdetail::invalid_file()))
-      ,  m_mode(read_only)
-   {  this->swap(moved);   }
-
-   //!Moves the ownership of "moved"'s shared memory to *this.
-   //!After the call, "moved" does not represent any shared memory.
-   //!Does not throw
-   shared_memory_object &operator=(BOOST_RV_REF(shared_memory_object) moved) BOOST_NOEXCEPT
-   {
-      shared_memory_object tmp(boost::move(moved));
-      this->swap(tmp);
-      return *this;
-   }
-
-   //!Swaps the shared_memory_objects. Does not throw
-   void swap(shared_memory_object &moved) BOOST_NOEXCEPT;
-
-   //!Erases a shared memory object from the system.
-   //!Returns false on error. Never throws
-   static bool remove(const char *name);
-
-   #if defined(BOOST_INTERPROCESS_WCHAR_NAMED_RESOURCES) || defined(BOOST_INTERPROCESS_DOXYGEN_INVOKED)
-
-   //!Erases a shared memory object from the system.
-   //!Returns false on error. Never throws
-   //! 
-   //!Note: This function is only available on operating systems with
-   //!      native wchar_t APIs (e.g. Windows).
-   static bool remove(const wchar_t *name);
-
-   #endif //defined(BOOST_INTERPROCESS_WCHAR_NAMED_RESOURCES) || defined(BOOST_INTERPROCESS_DOXYGEN_INVOKED)
-
-   //!Sets the size of the shared memory mapping
-   void truncate(offset_t length);
-
-   //!Destroys *this and indicates that the calling process is finished using
-   //!the resource. All mapped regions are still
-   //!valid after destruction. The destructor function will deallocate
-   //!any system resources allocated by the system for use by this process for
-   //!this resource. The resource can still be opened again calling
-   //!the open constructor overload. To erase the resource from the system
-   //!use remove().
-   ~shared_memory_object();
-
-   //!Returns the name of the shared memory object.
-   const char *get_name() const BOOST_NOEXCEPT;
-
-   //!Returns true if the size of the shared memory object
-   //!can be obtained and writes the size in the passed reference
-   bool get_size(offset_t &size) const BOOST_NOEXCEPT;
-
-   //!Returns access mode
-   mode_t get_mode() const BOOST_NOEXCEPT;
-
-   //!Returns mapping handle. Never throws.
-   mapping_handle_t get_mapping_handle() const BOOST_NOEXCEPT;
-
-   #if !defined(BOOST_INTERPROCESS_DOXYGEN_INVOKED)
-   private:
-
-   //!Closes a previously opened file mapping. Never throws.
-   void priv_close();
-
-   //!Opens or creates a shared memory object.
-   template<class CharT>
-   bool priv_open_or_create(ipcdetail::create_enum_t type, const CharT *filename, mode_t mode, const permissions &perm);
-
-   file_handle_t     m_handle;
-   mode_t            m_mode;
-   char_wchar_holder m_filename;
-   #endif   //#ifndef BOOST_INTERPROCESS_DOXYGEN_INVOKED
-};
-
-#if !defined(BOOST_INTERPROCESS_DOXYGEN_INVOKED)
-
-inline shared_memory_object::shared_memory_object() BOOST_NOEXCEPT
-   :  m_handle(file_handle_t(ipcdetail::invalid_file()))
-   ,  m_mode(read_only)
-{}
-
-inline shared_memory_object::~shared_memory_object()
-{  this->priv_close(); }
-
-
-inline const char *shared_memory_object::get_name() const BOOST_NOEXCEPT
-{  return m_filename.getn(); }
-
-inline bool shared_memory_object::get_size(offset_t &size) const BOOST_NOEXCEPT
-{  return ipcdetail::get_file_size((file_handle_t)m_handle, size);  }
-
-inline void shared_memory_object::swap(shared_memory_object &other) BOOST_NOEXCEPT
-{
-   boost::adl_move_swap(m_handle, other.m_handle);
-   boost::adl_move_swap(m_mode,   other.m_mode);
-   m_filename.swap(other.m_filename);
-}
-
-inline mapping_handle_t shared_memory_object::get_mapping_handle() const BOOST_NOEXCEPT
-{
-   return ipcdetail::mapping_handle_from_file_handle(m_handle);
-}
-
-inline mode_t shared_memory_object::get_mode() const BOOST_NOEXCEPT
-{  return m_mode; }
-
-#if !defined(BOOST_INTERPROCESS_POSIX_SHARED_MEMORY_OBJECTS)
-
-template<class CharT>
-inline bool shared_memory_object::priv_open_or_create
-   (ipcdetail::create_enum_t type, const CharT *filename, mode_t mode, const permissions &perm)
-{
-   m_filename = filename;
-   std::basic_string<CharT> shmfile;
-   ipcdetail::create_shared_dir_cleaning_old_and_get_filepath(filename, shmfile);
-
-   //Set accesses
-   if (mode != read_write && mode != read_only){
-      error_info err = other_error;
-      throw interprocess_exception(err);
-   }
-
-   switch(type){
-      case ipcdetail::DoOpen:
-         m_handle = ipcdetail::open_existing_file(shmfile.c_str(), mode, true);
-      break;
-      case ipcdetail::DoCreate:
-         m_handle = ipcdetail::create_new_file(shmfile.c_str(), mode, perm, true);
-      break;
-      case ipcdetail::DoOpenOrCreate:
-         m_handle = ipcdetail::create_or_open_file(shmfile.c_str(), mode, perm, true);
-      break;
-      default:
-         {
-            error_info err = other_error;
-            throw interprocess_exception(err);
-         }
-   }
-
-   //Check for error
-   if(m_handle == ipcdetail::invalid_file()){
-      error_info err = system_error_code();
-      this->priv_close();
-      throw interprocess_exception(err);
-   }
-
-   m_mode = mode;
-   return true;
-}
-
-#if defined(BOOST_INTERPROCESS_WCHAR_NAMED_RESOURCES)
-
-inline bool shared_memory_object::remove(const wchar_t *filename)
-{
-   BOOST_TRY{
-      //Make sure a temporary path is created for shared memory
-      std::wstring shmfile;
-      ipcdetail::shared_filepath(filename, shmfile);
-      return ipcdetail::delete_file(shmfile.c_str());
-   }
-   BOOST_CATCH(...){
-      return false;
-   } BOOST_CATCH_END
-}
-
-#endif
-
-inline bool shared_memory_object::remove(const char *filename)
-{
-   BOOST_TRY{
-      //Make sure a temporary path is created for shared memory
-      std::string shmfile;
-      ipcdetail::shared_filepath(filename, shmfile);
-      return ipcdetail::delete_file(shmfile.c_str());
-   }
-   BOOST_CATCH(...){
-      return false;
-   } BOOST_CATCH_END
-}
-
-inline void shared_memory_object::truncate(offset_t length)
-{
-   if(!ipcdetail::truncate_file(m_handle, (std::size_t)length)){
-      error_info err = system_error_code();
-      throw interprocess_exception(err);
-   }
-}
-
-inline void shared_memory_object::priv_close()
-{
-   if(m_handle != ipcdetail::invalid_file()){
-      ipcdetail::close_file(m_handle);
-      m_handle = ipcdetail::invalid_file();
-   }
-}
-
-#else //!defined(BOOST_INTERPROCESS_POSIX_SHARED_MEMORY_OBJECTS)
-
-namespace shared_memory_object_detail {
-
-#ifdef BOOST_INTERPROCESS_RUNTIME_FILESYSTEM_BASED_POSIX_SHARED_MEMORY
-
-#if defined(__FreeBSD__)
-
-inline bool use_filesystem_based_posix()
-{
-   int jailed = 0;
-   std::size_t len = sizeof(jailed);
-   ::sysctlbyname("security.jail.jailed", &jailed, &len, NULL, 0);
-   return jailed != 0;
-}
-
-#else
-#error "Not supported platform for BOOST_INTERPROCESS_RUNTIME_FILESYSTEM_BASED_POSIX_SHARED_MEMORY"
-#endif
-
-#endif
-
-}  //shared_memory_object_detail
-
-template<class CharT>
-inline bool shared_memory_object::priv_open_or_create
-   (ipcdetail::create_enum_t type,
-    const CharT *filename,
-    mode_t mode, const permissions &perm)
-{
-   #if defined(BOOST_INTERPROCESS_FILESYSTEM_BASED_POSIX_SHARED_MEMORY)
-   const bool add_leading_slash = false;
-   #elif defined(BOOST_INTERPROCESS_RUNTIME_FILESYSTEM_BASED_POSIX_SHARED_MEMORY)
-   const bool add_leading_slash = !shared_memory_object_detail::use_filesystem_based_posix();
-   #else
-   const bool add_leading_slash = true;
-   #endif
-   std::basic_string<CharT> fname;
-   if(add_leading_slash){
-      ipcdetail::add_leading_slash(filename, fname);
-   }
-   else{
-      ipcdetail::create_shared_dir_cleaning_old_and_get_filepath(filename, fname);
-   }
-
-   //Create new mapping
-   int oflag = 0;
-   if(mode == read_only){
-      oflag |= O_RDONLY;
-   }
-   else if(mode == read_write){
-      oflag |= O_RDWR;
-   }
-   else{
-      error_info err(mode_error);
-      throw interprocess_exception(err);
-   }
-   ::mode_t unix_perm = perm.get_permissions();
-
-   switch(type){
-      case ipcdetail::DoOpen:
-      {
-         //No oflag addition
-         m_handle = shm_open(fname.c_str(), oflag, unix_perm);
-      }
-      break;
-      case ipcdetail::DoCreate:
-      {
-         oflag |= (O_CREAT | O_EXCL);
-         m_handle = shm_open(fname.c_str(), oflag, unix_perm);
-         if(m_handle >= 0){
-            ::fchmod(m_handle, unix_perm);
-         }
-      }
-      break;
-      case ipcdetail::DoOpenOrCreate:
-      {
-         //We need a create/open loop to change permissions correctly using fchmod, since
-         //with "O_CREAT" only we don't know if we've created or opened the shm.
-         while(true){
-            //Try to create shared memory
-            m_handle = shm_open(fname.c_str(), oflag | (O_CREAT | O_EXCL), unix_perm);
-            //If successful change real permissions
-            if(m_handle >= 0){
-               ::fchmod(m_handle, unix_perm);
-            }
-            //If already exists, try to open
-            else if(errno == EEXIST){
-               m_handle = shm_open(fname.c_str(), oflag, unix_perm);
-               //If open fails and errno tells the file does not exist
-               //(shm was removed between creation and opening tries), just retry
-               if(m_handle < 0 && errno == ENOENT){
-                  continue;
-               }
-            }
-            //Exit retries
-            break;
-         }
-      }
-      break;
-      default:
-      {
-         error_info err = other_error;
-         throw interprocess_exception(err);
-      }
-   }
-
-   //Check for error
-   if(m_handle < 0){
-      error_info err = errno;
-      this->priv_close();
-      throw interprocess_exception(err);
-   }
-
-   m_filename = filename;
-   m_mode = mode;
-   return true;
-}
-
-inline bool shared_memory_object::remove(const char *filename)
-{
-   BOOST_TRY{
-      std::string filepath;
-      #if defined(BOOST_INTERPROCESS_FILESYSTEM_BASED_POSIX_SHARED_MEMORY)
-      const bool add_leading_slash = false;
-      #elif defined(BOOST_INTERPROCESS_RUNTIME_FILESYSTEM_BASED_POSIX_SHARED_MEMORY)
-      const bool add_leading_slash = !shared_memory_object_detail::use_filesystem_based_posix();
-      #else
-      const bool add_leading_slash = true;
-      #endif
-      if(add_leading_slash){
-         ipcdetail::add_leading_slash(filename, filepath);
-      }
-      else{
-         ipcdetail::shared_filepath(filename, filepath);
-      }
-      return 0 == shm_unlink(filepath.c_str());
-   }
-   BOOST_CATCH(...){
-      return false;
-   } BOOST_CATCH_END
-}
-
-inline void shared_memory_object::truncate(offset_t length)
-{
-   #ifdef BOOST_INTERPROCESS_POSIX_FALLOCATE
-   int ret = EINTR;
-   while (EINTR == ret) {
-      ret = posix_fallocate(m_handle, 0, length);
-   }
-
-   if (ret && ret != EOPNOTSUPP && ret != ENODEV){
-      error_info err(ret);
-      throw interprocess_exception(err);
-   }
-   //ftruncate fallback
-   #endif //BOOST_INTERPROCESS_POSIX_FALLOCATE
-
-   handle_eintr:
-   if (0 != ftruncate(m_handle, length)){
-      if (errno == EINTR)
-         goto handle_eintr;
-      error_info err(system_error_code());
-      throw interprocess_exception(err);
-   }
-}
-
-inline void shared_memory_object::priv_close()
-{
-   if(m_handle != -1){
-      ::close(m_handle);
-      m_handle = -1;
-   }
-}
-
-#endif
-
-//!A class that stores the name of a shared memory
-//!and calls shared_memory_object::remove(name) in its destructor
-//!Useful to remove temporary shared memory objects in the presence
-//!of exceptions
-class remove_shared_memory_on_destroy
-{
-   const char * m_name;
-   public:
-   remove_shared_memory_on_destroy(const char *name)
-      :  m_name(name)
-   {}
-
-   ~remove_shared_memory_on_destroy()
-   {  shared_memory_object::remove(m_name);  }
-};
-
-#endif   //#ifndef BOOST_INTERPROCESS_DOXYGEN_INVOKED
-
-}  //namespace interprocess {
-}  //namespace boost {
-
-#include <boost/interprocess/detail/config_end.hpp>
-
-#endif   //BOOST_INTERPROCESS_SHARED_MEMORY_OBJECT_HPP
diff --git a/src/boost/interprocess/smart_ptr/deleter.hpp b/src/boost/interprocess/smart_ptr/deleter.hpp
deleted file mode 100644
index bc0f8c8a..00000000
--- a/src/boost/interprocess/smart_ptr/deleter.hpp
+++ /dev/null
@@ -1,68 +0,0 @@
-//////////////////////////////////////////////////////////////////////////////
-//
-// (C) Copyright Ion Gaztanaga 2007-2012.
-//
-// Distributed under the Boost 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/interprocess for documentation.
-//
-//////////////////////////////////////////////////////////////////////////////
-
-#ifndef BOOST_INTERPROCESS_DELETER_HPP
-#define BOOST_INTERPROCESS_DELETER_HPP
-
-#ifndef BOOST_CONFIG_HPP
-#  include <boost/config.hpp>
-#endif
-#
-#if defined(BOOST_HAS_PRAGMA_ONCE)
-#  pragma once
-#endif
-
-#include <boost/interprocess/detail/config_begin.hpp>
-#include <boost/interprocess/interprocess_fwd.hpp>
-#include <boost/interprocess/detail/utilities.hpp>
-#include <boost/intrusive/pointer_traits.hpp>
-
-//!\file
-//!Describes the functor to delete objects from the segment.
-
-namespace boost {
-namespace interprocess {
-
-//!A deleter that uses the segment manager's destroy_ptr
-//!function to destroy the passed pointer resource.
-//!
-//!This deleter is used
-template<class T, class SegmentManager>
-class deleter
-{
-   public:
-   typedef typename boost::intrusive::
-      pointer_traits<typename SegmentManager::void_pointer>::template
-         rebind_pointer<T>::type                pointer;
-
-   private:
-   typedef typename boost::intrusive::
-      pointer_traits<pointer>::template
-         rebind_pointer<SegmentManager>::type                segment_manager_pointer;
-
-   segment_manager_pointer mp_mngr;
-
-   public:
-   deleter(segment_manager_pointer pmngr) BOOST_NOEXCEPT
-      :  mp_mngr(pmngr)
-   {}
-
-   void operator()(const pointer &p)
-   {  mp_mngr->destroy_ptr(ipcdetail::to_raw_pointer(p));   }
-};
-
-}  //namespace interprocess {
-}  //namespace boost {
-
-#include <boost/interprocess/detail/config_end.hpp>
-
-#endif   //#ifndef BOOST_INTERPROCESS_DELETER_HPP
diff --git a/src/boost/interprocess/streams/bufferstream.hpp b/src/boost/interprocess/streams/bufferstream.hpp
deleted file mode 100644
index 51987233..00000000
--- a/src/boost/interprocess/streams/bufferstream.hpp
+++ /dev/null
@@ -1,491 +0,0 @@
-//////////////////////////////////////////////////////////////////////////////
-//
-// (C) Copyright Ion Gaztanaga 2005-2012. Distributed under the Boost
-// 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/interprocess for documentation.
-//
-//////////////////////////////////////////////////////////////////////////////
-//
-// This file comes from SGI's sstream file. Modified by Ion Gaztanaga 2005-2012.
-// Changed internal SGI string to a buffer. Added efficient
-// internal buffer get/set/swap functions, so that we can obtain/establish the
-// internal buffer without any reallocation or copy. Kill those temporaries!
-///////////////////////////////////////////////////////////////////////////////
-/*
- * Copyright (c) 1998
- * Silicon Graphics Computer Systems, Inc.
- *
- * Permission to use, copy, modify, distribute and sell this software
- * and its documentation for any purpose is hereby granted without fee,
- * provided that the above copyright notice appear in all copies and
- * that both that copyright notice and this permission notice appear
- * in supporting documentation.  Silicon Graphics makes no
- * representations about the suitability of this software for any
- * purpose.  It is provided "as is" without express or implied warranty.
- */
-
-//!\file
-//!This file defines basic_bufferbuf, basic_ibufferstream,
-//!basic_obufferstream, and basic_bufferstream classes. These classes
-//!represent streamsbufs and streams whose sources or destinations
-//!are fixed size character buffers.
-
-#ifndef BOOST_INTERPROCESS_BUFFERSTREAM_HPP
-#define BOOST_INTERPROCESS_BUFFERSTREAM_HPP
-
-#ifndef BOOST_CONFIG_HPP
-#  include <boost/config.hpp>
-#endif
-#
-#if defined(BOOST_HAS_PRAGMA_ONCE)
-#  pragma once
-#endif
-
-#include <boost/interprocess/detail/config_begin.hpp>
-#include <boost/interprocess/detail/workaround.hpp>
-
-#include <iosfwd>
-#include <ios>
-#include <istream>
-#include <ostream>
-#include <string>    // char traits
-#include <cstddef>   // ptrdiff_t
-#include <boost/assert.hpp>
-#include <boost/interprocess/interprocess_fwd.hpp>
-
-namespace boost {  namespace interprocess {
-
-//!A streambuf class that controls the transmission of elements to and from
-//!a basic_xbufferstream. The elements are transmitted from a to a fixed
-//!size buffer
-template <class CharT, class CharTraits>
-class basic_bufferbuf
-   : public std::basic_streambuf<CharT, CharTraits>
-{
-   public:
-   typedef CharT                                         char_type;
-   typedef typename CharTraits::int_type                 int_type;
-   typedef typename CharTraits::pos_type                 pos_type;
-   typedef typename CharTraits::off_type                 off_type;
-   typedef CharTraits                                    traits_type;
-   typedef std::basic_streambuf<char_type, traits_type>  basic_streambuf_t;
-
-   public:
-   //!Constructor.
-   //!Does not throw.
-   explicit basic_bufferbuf(std::ios_base::openmode mode
-                            = std::ios_base::in | std::ios_base::out)
-      :  basic_streambuf_t(), m_mode(mode), m_buffer(0), m_length(0)
-      {}
-
-   //!Constructor. Assigns formatting buffer.
-   //!Does not throw.
-   explicit basic_bufferbuf(CharT *buf, std::size_t length,
-                            std::ios_base::openmode mode
-                              = std::ios_base::in | std::ios_base::out)
-      :  basic_streambuf_t(), m_mode(mode), m_buffer(buf), m_length(length)
-      {  this->set_pointers();   }
-
-   virtual ~basic_bufferbuf() BOOST_OVERRIDE {}
-
-   public:
-   //!Returns the pointer and size of the internal buffer.
-   //!Does not throw.
-   std::pair<CharT *, std::size_t> buffer() const
-      { return std::pair<CharT *, std::size_t>(m_buffer, m_length); }
-
-   //!Sets the underlying buffer to a new value
-   //!Does not throw.
-   void buffer(CharT *buf, std::size_t length)
-      {  m_buffer = buf;   m_length = length;   this->set_pointers();   }
-
-   #if !defined(BOOST_INTERPROCESS_DOXYGEN_INVOKED)
-   private:
-   void set_pointers()
-   {
-      // The initial read position is the beginning of the buffer.
-      if(m_mode & std::ios_base::in)
-         this->setg(m_buffer, m_buffer, m_buffer + m_length);
-
-      // The initial write position is the beginning of the buffer.
-      if(m_mode & std::ios_base::out)
-         this->setp(m_buffer, m_buffer + m_length);
-   }
-
-   protected:
-   virtual int_type underflow() BOOST_OVERRIDE
-   {
-      // Precondition: gptr() >= egptr(). Returns a character, if available.
-      return this->gptr() != this->egptr() ?
-         CharTraits::to_int_type(*this->gptr()) : CharTraits::eof();
-   }
-
-   virtual int_type pbackfail(int_type c = CharTraits::eof()) BOOST_OVERRIDE
-   {
-      if(this->gptr() != this->eback()) {
-         if(!CharTraits::eq_int_type(c, CharTraits::eof())) {
-            if(CharTraits::eq(CharTraits::to_char_type(c), this->gptr()[-1])) {
-               this->gbump(-1);
-               return c;
-            }
-            else if(m_mode & std::ios_base::out) {
-               this->gbump(-1);
-               *this->gptr() = CharTraits::to_char_type(c);
-               return c;
-            }
-            else
-               return CharTraits::eof();
-         }
-         else {
-            this->gbump(-1);
-            return CharTraits::not_eof(c);
-         }
-      }
-      else
-         return CharTraits::eof();
-   }
-
-   virtual int_type overflow(int_type c = CharTraits::eof()) BOOST_OVERRIDE
-   {
-      if(m_mode & std::ios_base::out) {
-         if(!CharTraits::eq_int_type(c, CharTraits::eof())) {
-//            if(!(m_mode & std::ios_base::in)) {
-//               if(this->pptr() != this->epptr()) {
-//                  *this->pptr() = CharTraits::to_char_type(c);
-//                  this->pbump(1);
-//                  return c;
-//               }
-//               else
-//                  return CharTraits::eof();
-//            }
-//            else {
-               if(this->pptr() == this->epptr()) {
-                  //We can't append to a static buffer
-                  return CharTraits::eof();
-               }
-               else {
-                  *this->pptr() = CharTraits::to_char_type(c);
-                  this->pbump(1);
-                  return c;
-               }
-//            }
-         }
-         else  // c is EOF, so we don't have to do anything
-            return CharTraits::not_eof(c);
-      }
-      else     // Overflow always fails if it's read-only.
-         return CharTraits::eof();
-   }
-
-   virtual pos_type seekoff(off_type off, std::ios_base::seekdir dir,
-                              std::ios_base::openmode mode
-                                 = std::ios_base::in | std::ios_base::out) BOOST_OVERRIDE
-   {
-      bool in  = false;
-      bool out = false;
-
-      const std::ios_base::openmode inout =
-         std::ios_base::in | std::ios_base::out;
-
-      if((mode & inout) == inout) {
-         if(dir == std::ios_base::beg || dir == std::ios_base::end)
-            in = out = true;
-      }
-      else if(mode & std::ios_base::in)
-         in = true;
-      else if(mode & std::ios_base::out)
-         out = true;
-
-      if(!in && !out)
-         return pos_type(off_type(-1));
-      else if((in  && (!(m_mode & std::ios_base::in) || (off != 0 && this->gptr() == 0) )) ||
-               (out && (!(m_mode & std::ios_base::out) || (off != 0 && this->pptr() == 0))))
-         return pos_type(off_type(-1));
-
-      std::streamoff newoff;
-      switch(dir) {
-         case std::ios_base::beg:
-            newoff = 0;
-         break;
-         case std::ios_base::end:
-            newoff = static_cast<std::streamoff>(m_length);
-         break;
-         case std::ios_base::cur:
-            newoff = in ? static_cast<std::streamoff>(this->gptr() - this->eback())
-                        : static_cast<std::streamoff>(this->pptr() - this->pbase());
-         break;
-         default:
-            return pos_type(off_type(-1));
-      }
-
-      off += newoff;
-
-      if(in) {
-         std::ptrdiff_t n = this->egptr() - this->eback();
-
-         if(off < 0 || off > n)
-            return pos_type(off_type(-1));
-         else
-            this->setg(this->eback(), this->eback() + off, this->eback() + n);
-      }
-
-      if(out) {
-         std::ptrdiff_t n = this->epptr() - this->pbase();
-
-         if(off < 0 || off > n)
-            return pos_type(off_type(-1));
-         else {
-            this->setp(this->pbase(), this->pbase() + n);
-            this->pbump(static_cast<int>(off));
-         }
-      }
-
-      return pos_type(off);
-   }
-
-   virtual pos_type seekpos(pos_type pos, std::ios_base::openmode mode
-                                 = std::ios_base::in | std::ios_base::out) BOOST_OVERRIDE
-   {  return seekoff(pos - pos_type(off_type(0)), std::ios_base::beg, mode);  }
-
-   private:
-   std::ios_base::openmode m_mode;
-   CharT *                 m_buffer;
-   std::size_t             m_length;
-   #endif   //#ifndef BOOST_INTERPROCESS_DOXYGEN_INVOKED
-};
-
-//!A basic_istream class that uses a fixed size character buffer
-//!as its formatting buffer.
-template <class CharT, class CharTraits>
-class basic_ibufferstream :
-   #if !defined(BOOST_INTERPROCESS_DOXYGEN_INVOKED)
-   private basic_bufferbuf<CharT, CharTraits>,
-   #endif   //#ifndef BOOST_INTERPROCESS_DOXYGEN_INVOKED
-   public std::basic_istream<CharT, CharTraits>
-{
-   public:                         // Typedefs
-   typedef typename std::basic_ios
-      <CharT, CharTraits>::char_type          char_type;
-   typedef typename std::basic_ios<char_type, CharTraits>::int_type     int_type;
-   typedef typename std::basic_ios<char_type, CharTraits>::pos_type     pos_type;
-   typedef typename std::basic_ios<char_type, CharTraits>::off_type     off_type;
-   typedef typename std::basic_ios<char_type, CharTraits>::traits_type  traits_type;
-
-   #if !defined(BOOST_INTERPROCESS_DOXYGEN_INVOKED)
-   private:
-   typedef basic_bufferbuf<CharT, CharTraits>         bufferbuf_t;
-   typedef std::basic_ios<char_type, CharTraits>      basic_ios_t;
-   typedef std::basic_istream<char_type, CharTraits>  basic_streambuf_t;
-   bufferbuf_t &       get_buf()      {  return *this;  }
-   const bufferbuf_t & get_buf() const{  return *this;  }
-   #endif   //#ifndef BOOST_INTERPROCESS_DOXYGEN_INVOKED
-
-   public:
-   //!Constructor.
-   //!Does not throw.
-   basic_ibufferstream(std::ios_base::openmode mode = std::ios_base::in)
-      :  //basic_ios_t() is called first (lefting it uninitialized) as it's a
-         //virtual base of basic_istream. The class will be initialized when
-         //basic_istream is constructed calling basic_ios_t::init().
-         //As bufferbuf_t's constructor does not throw there is no risk of
-         //calling the basic_ios_t's destructor without calling basic_ios_t::init()
-        bufferbuf_t(mode | std::ios_base::in)
-      , basic_streambuf_t(this)
-      {}
-
-   //!Constructor. Assigns formatting buffer.
-   //!Does not throw.
-   basic_ibufferstream(const CharT *buf, std::size_t length,
-                       std::ios_base::openmode mode = std::ios_base::in)
-      :  //basic_ios_t() is called first (lefting it uninitialized) as it's a
-         //virtual base of basic_istream. The class will be initialized when
-         //basic_istream is constructed calling basic_ios_t::init().
-         //As bufferbuf_t's constructor does not throw there is no risk of
-         //calling the basic_ios_t's destructor without calling basic_ios_t::init()
-        bufferbuf_t(const_cast<CharT*>(buf), length, mode | std::ios_base::in)
-      , basic_streambuf_t(this)
-      {}
-
-   ~basic_ibufferstream(){}
-
-   public:
-   //!Returns the address of the stored
-   //!stream buffer.
-   basic_bufferbuf<CharT, CharTraits>* rdbuf() const
-      { return const_cast<basic_bufferbuf<CharT, CharTraits>*>(&get_buf()); }
-
-   //!Returns the pointer and size of the internal buffer.
-   //!Does not throw.
-   std::pair<const CharT *, std::size_t> buffer() const
-      { return get_buf().buffer(); }
-
-   //!Sets the underlying buffer to a new value. Resets
-   //!stream position. Does not throw.
-   void buffer(const CharT *buf, std::size_t length)
-      {  get_buf().buffer(const_cast<CharT*>(buf), length);  }
-};
-
-//!A basic_ostream class that uses a fixed size character buffer
-//!as its formatting buffer.
-template <class CharT, class CharTraits>
-class basic_obufferstream :
-   #if !defined(BOOST_INTERPROCESS_DOXYGEN_INVOKED)
-   private basic_bufferbuf<CharT, CharTraits>,
-   #endif   //#ifndef BOOST_INTERPROCESS_DOXYGEN_INVOKED
-   public std::basic_ostream<CharT, CharTraits>
-{
-   public:
-   typedef typename std::basic_ios
-      <CharT, CharTraits>::char_type          char_type;
-   typedef typename std::basic_ios<char_type, CharTraits>::int_type     int_type;
-   typedef typename std::basic_ios<char_type, CharTraits>::pos_type     pos_type;
-   typedef typename std::basic_ios<char_type, CharTraits>::off_type     off_type;
-   typedef typename std::basic_ios<char_type, CharTraits>::traits_type  traits_type;
-
-   #if !defined(BOOST_INTERPROCESS_DOXYGEN_INVOKED)
-   private:
-   typedef basic_bufferbuf<CharT, CharTraits>         bufferbuf_t;
-   typedef std::basic_ios<char_type, CharTraits>      basic_ios_t;
-   typedef std::basic_ostream<char_type, CharTraits>  basic_ostream_t;
-   bufferbuf_t &       get_buf()      {  return *this;  }
-   const bufferbuf_t & get_buf() const{  return *this;  }
-   #endif   //#ifndef BOOST_INTERPROCESS_DOXYGEN_INVOKED
-
-   public:
-   //!Constructor.
-   //!Does not throw.
-   basic_obufferstream(std::ios_base::openmode mode = std::ios_base::out)
-      :  //basic_ios_t() is called first (lefting it uninitialized) as it's a
-         //virtual base of basic_istream. The class will be initialized when
-         //basic_istream is constructed calling basic_ios_t::init().
-         //As bufferbuf_t's constructor does not throw there is no risk of
-         //calling the basic_ios_t's destructor without calling basic_ios_t::init()
-         bufferbuf_t(mode | std::ios_base::out)
-      ,  basic_ostream_t(this)
-      {}
-
-   //!Constructor. Assigns formatting buffer.
-   //!Does not throw.
-   basic_obufferstream(CharT *buf, std::size_t length,
-                       std::ios_base::openmode mode = std::ios_base::out)
-      :  //basic_ios_t() is called first (lefting it uninitialized) as it's a
-         //virtual base of basic_istream. The class will be initialized when
-         //basic_istream is constructed calling basic_ios_t::init().
-         //As bufferbuf_t's constructor does not throw there is no risk of
-         //calling the basic_ios_t's destructor without calling basic_ios_t::init()
-         bufferbuf_t(buf, length, mode | std::ios_base::out)
-      ,  basic_ostream_t(this)
-      {}
-
-   ~basic_obufferstream(){}
-
-   public:
-   //!Returns the address of the stored
-   //!stream buffer.
-   basic_bufferbuf<CharT, CharTraits>* rdbuf() const
-      { return const_cast<basic_bufferbuf<CharT, CharTraits>*>(&get_buf()); }
-
-   //!Returns the pointer and size of the internal buffer.
-   //!Does not throw.
-   std::pair<CharT *, std::size_t> buffer() const
-      { return get_buf().buffer(); }
-
-   //!Sets the underlying buffer to a new value. Resets
-   //!stream position. Does not throw.
-   void buffer(CharT *buf, std::size_t length)
-      {  get_buf().buffer(buf, length);  }
-};
-
-
-//!A basic_iostream class that uses a fixed size character buffer
-//!as its formatting buffer.
-template <class CharT, class CharTraits>
-class basic_bufferstream :
-   #if !defined(BOOST_INTERPROCESS_DOXYGEN_INVOKED)
-   private basic_bufferbuf<CharT, CharTraits>,
-   #endif   //#ifndef BOOST_INTERPROCESS_DOXYGEN_INVOKED
-   public std::basic_iostream<CharT, CharTraits>
-{
-   public:                         // Typedefs
-   typedef typename std::basic_ios
-      <CharT, CharTraits>::char_type          char_type;
-   typedef typename std::basic_ios<char_type, CharTraits>::int_type     int_type;
-   typedef typename std::basic_ios<char_type, CharTraits>::pos_type     pos_type;
-   typedef typename std::basic_ios<char_type, CharTraits>::off_type     off_type;
-   typedef typename std::basic_ios<char_type, CharTraits>::traits_type  traits_type;
-
-   #if !defined(BOOST_INTERPROCESS_DOXYGEN_INVOKED)
-   private:
-   typedef basic_bufferbuf<CharT, CharTraits>         bufferbuf_t;
-   typedef std::basic_ios<char_type, CharTraits>      basic_ios_t;
-   typedef std::basic_iostream<char_type, CharTraits> basic_iostream_t;
-   bufferbuf_t &       get_buf()      {  return *this;  }
-   const bufferbuf_t & get_buf() const{  return *this;  }
-   #endif   //#ifndef BOOST_INTERPROCESS_DOXYGEN_INVOKED
-
-   public:
-   //!Constructor.
-   //!Does not throw.
-   basic_bufferstream(std::ios_base::openmode mode
-                      = std::ios_base::in | std::ios_base::out)
-      :  //basic_ios_t() is called first (lefting it uninitialized) as it's a
-         //virtual base of basic_istream. The class will be initialized when
-         //basic_istream is constructed calling basic_ios_t::init().
-         //As bufferbuf_t's constructor does not throw there is no risk of
-         //calling the basic_ios_t's destructor without calling basic_ios_t::init()
-         bufferbuf_t(mode)
-      ,  basic_iostream_t(this)
-      {}
-
-   //!Constructor. Assigns formatting buffer.
-   //!Does not throw.
-   basic_bufferstream(CharT *buf, std::size_t length,
-                      std::ios_base::openmode mode
-                        = std::ios_base::in | std::ios_base::out)
-      :  //basic_ios_t() is called first (lefting it uninitialized) as it's a
-         //virtual base of basic_istream. The class will be initialized when
-         //basic_istream is constructed calling basic_ios_t::init().
-         //As bufferbuf_t's constructor does not throw there is no risk of
-         //calling the basic_ios_t's destructor without calling basic_ios_t::init()
-         bufferbuf_t(buf, length, mode)
-      ,  basic_iostream_t(this)
-      {}
-
-   ~basic_bufferstream(){}
-
-   public:
-   //!Returns the address of the stored
-   //!stream buffer.
-   basic_bufferbuf<CharT, CharTraits>* rdbuf() const
-      { return const_cast<basic_bufferbuf<CharT, CharTraits>*>(&get_buf()); }
-
-   //!Returns the pointer and size of the internal buffer.
-   //!Does not throw.
-   std::pair<CharT *, std::size_t> buffer() const
-      { return get_buf().buffer(); }
-
-   //!Sets the underlying buffer to a new value. Resets
-   //!stream position. Does not throw.
-   void buffer(CharT *buf, std::size_t length)
-      {  get_buf().buffer(buf, length);  }
-};
-
-//Some typedefs to simplify usage
-typedef basic_bufferbuf<char>        bufferbuf;
-typedef basic_bufferstream<char>     bufferstream;
-typedef basic_ibufferstream<char>    ibufferstream;
-typedef basic_obufferstream<char>    obufferstream;
-
-typedef basic_bufferbuf<wchar_t>     wbufferbuf;
-typedef basic_bufferstream<wchar_t>  wbufferstream;
-typedef basic_ibufferstream<wchar_t> wibufferstream;
-typedef basic_obufferstream<wchar_t> wobufferstream;
-
-
-}} //namespace boost {  namespace interprocess {
-
-#include <boost/interprocess/detail/config_end.hpp>
-
-#endif /* BOOST_INTERPROCESS_BUFFERSTREAM_HPP */
diff --git a/src/boost/interprocess/sync/detail/common_algorithms.hpp b/src/boost/interprocess/sync/detail/common_algorithms.hpp
deleted file mode 100644
index 3cb1d1a1..00000000
--- a/src/boost/interprocess/sync/detail/common_algorithms.hpp
+++ /dev/null
@@ -1,98 +0,0 @@
-//////////////////////////////////////////////////////////////////////////////
-//
-// (C) Copyright Ion Gaztanaga 2012-2013. Distributed under the Boost
-// 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/interprocess for documentation.
-//
-//////////////////////////////////////////////////////////////////////////////
-
-#ifndef BOOST_INTERPROCESS_SYNC_DETAIL_COMMON_ALGORITHMS_HPP
-#define BOOST_INTERPROCESS_SYNC_DETAIL_COMMON_ALGORITHMS_HPP
-
-#ifndef BOOST_CONFIG_HPP
-#  include <boost/config.hpp>
-#endif
-#
-#if defined(BOOST_HAS_PRAGMA_ONCE)
-#  pragma once
-#endif
-
-#include <boost/interprocess/detail/config_begin.hpp>
-#include <boost/interprocess/detail/workaround.hpp>
-
-#include <boost/interprocess/sync/spin/wait.hpp>
-#include <boost/interprocess/detail/timed_utils.hpp>
-
-namespace boost {
-namespace interprocess {
-namespace ipcdetail {
-
-template<class MutexType, class TimePoint>
-bool try_based_timed_lock(MutexType &m, const TimePoint &abs_time)
-{
-   //Same as lock()
-   if(is_pos_infinity(abs_time)){
-      m.lock();
-      return true;
-   }
-   //Always try to lock to achieve POSIX guarantees:
-   // "Under no circumstance shall the function fail with a timeout if the mutex
-   //  can be locked immediately. The validity of the abs_timeout parameter need not
-   //  be checked if the mutex can be locked immediately."
-   else if(m.try_lock()){
-      return true;
-   }
-   else{
-      spin_wait swait;
-      while(microsec_clock<TimePoint>::universal_time() < abs_time){
-         if(m.try_lock()){
-            return true;
-         }
-         swait.yield();
-      }
-      return false;
-   }
-}
-
-template<class MutexType>
-void try_based_lock(MutexType &m)
-{
-   if(!m.try_lock()){
-      spin_wait swait;
-      do{
-         if(m.try_lock()){
-            break;
-         }
-         else{
-            swait.yield();
-         }
-      }
-      while(1);
-   }
-}
-
-template<class MutexType>
-void timeout_when_locking_aware_lock(MutexType &m)
-{
-   #ifdef BOOST_INTERPROCESS_ENABLE_TIMEOUT_WHEN_LOCKING
-      if (!m.timed_lock(microsec_clock<ustime>::universal_time()
-           + usduration_milliseconds(BOOST_INTERPROCESS_TIMEOUT_WHEN_LOCKING_DURATION_MS)))
-      {
-         throw interprocess_exception(timeout_when_locking_error
-                                     , "Interprocess mutex timeout when locking. Possible deadlock: "
-                                       "owner died without unlocking?");
-      }
-   #else
-      m.lock();
-   #endif
-}
-
-}  //namespace ipcdetail
-}  //namespace interprocess
-}  //namespace boost
-
-#include <boost/interprocess/detail/config_end.hpp>
-
-#endif   //BOOST_INTERPROCESS_SYNC_DETAIL_COMMON_ALGORITHMS_HPP
diff --git a/src/boost/interprocess/sync/lock_options.hpp b/src/boost/interprocess/sync/lock_options.hpp
deleted file mode 100644
index a79159a4..00000000
--- a/src/boost/interprocess/sync/lock_options.hpp
+++ /dev/null
@@ -1,55 +0,0 @@
-//////////////////////////////////////////////////////////////////////////////
-//
-// (C) Copyright Ion Gaztanaga 2005-2012. Distributed under the Boost
-// 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/interprocess for documentation.
-//
-//////////////////////////////////////////////////////////////////////////////
-
-#ifndef BOOST_INTERPROCESS_LOCK_OPTIONS_HPP
-#define BOOST_INTERPROCESS_LOCK_OPTIONS_HPP
-
-#ifndef BOOST_CONFIG_HPP
-#  include <boost/config.hpp>
-#endif
-#
-#if defined(BOOST_HAS_PRAGMA_ONCE)
-#  pragma once
-#endif
-
-#include <boost/interprocess/detail/config_begin.hpp>
-#include <boost/interprocess/detail/workaround.hpp>
-
-//!\file
-//!Describes the lock options with associated with interprocess_mutex lock constructors.
-
-namespace boost {
-namespace interprocess {
-
-//!Type to indicate to a mutex lock constructor that must not lock the mutex.
-struct defer_lock_type{};
-//!Type to indicate to a mutex lock constructor that must try to lock the mutex.
-struct try_to_lock_type {};
-//!Type to indicate to a mutex lock constructor that the mutex is already locked.
-struct accept_ownership_type{};
-
-//!An object indicating that the locking
-//!must be deferred.
-static const defer_lock_type      defer_lock      = defer_lock_type();
-
-//!An object indicating that a try_lock()
-//!operation must be executed.
-static const try_to_lock_type     try_to_lock    = try_to_lock_type();
-
-//!An object indicating that the ownership of lockable
-//!object must be accepted by the new owner.
-static const accept_ownership_type  accept_ownership = accept_ownership_type();
-
-} // namespace interprocess {
-} // namespace boost{
-
-#include <boost/interprocess/detail/config_end.hpp>
-
-#endif // BOOST_INTERPROCESS_LOCK_OPTIONS_HPP
diff --git a/src/boost/interprocess/sync/scoped_lock.hpp b/src/boost/interprocess/sync/scoped_lock.hpp
deleted file mode 100644
index 35e1cc4c..00000000
--- a/src/boost/interprocess/sync/scoped_lock.hpp
+++ /dev/null
@@ -1,410 +0,0 @@
-//////////////////////////////////////////////////////////////////////////////
-//
-// (C) Copyright Ion Gaztanaga 2005-2012. Distributed under the Boost
-// 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/interprocess for documentation.
-//
-//////////////////////////////////////////////////////////////////////////////
-//
-// This interface is inspired by Howard Hinnant's lock proposal.
-// http://home.twcny.rr.com/hinnant/cpp_extensions/threads_move.html
-//
-//////////////////////////////////////////////////////////////////////////////
-
-#ifndef BOOST_INTERPROCESS_SCOPED_LOCK_HPP
-#define BOOST_INTERPROCESS_SCOPED_LOCK_HPP
-
-#ifndef BOOST_CONFIG_HPP
-#  include <boost/config.hpp>
-#endif
-#
-#if defined(BOOST_HAS_PRAGMA_ONCE)
-#  pragma once
-#endif
-
-#include <boost/interprocess/detail/config_begin.hpp>
-#include <boost/interprocess/detail/workaround.hpp>
-#include <boost/interprocess/interprocess_fwd.hpp>
-#include <boost/interprocess/sync/lock_options.hpp>
-#include <boost/interprocess/exceptions.hpp>
-#include <boost/interprocess/detail/mpl.hpp>
-#include <boost/interprocess/detail/type_traits.hpp>
-#include <boost/move/utility_core.hpp>
-#include <boost/interprocess/detail/simple_swap.hpp>
-
-//!\file
-//!Describes the scoped_lock class.
-
-namespace boost {
-namespace interprocess {
-
-
-//!scoped_lock is meant to carry out the tasks for locking, unlocking, try-locking
-//!and timed-locking (recursive or not) for the Mutex. The Mutex need not supply all
-//!of this functionality. If the client of scoped_lock<Mutex> does not use
-//!functionality which the Mutex does not supply, no harm is done. Mutex ownership
-//!transfer is supported through the syntax of move semantics. Ownership transfer
-//!is allowed both by construction and assignment. The scoped_lock does not support
-//!copy semantics. A compile time error results if copy construction or copy
-//!assignment is attempted. Mutex ownership can also be moved from an
-//!upgradable_lock and sharable_lock via constructor. In this role, scoped_lock
-//!shares the same functionality as a write_lock.
-template <class Mutex>
-class scoped_lock
-{
-   #if !defined(BOOST_INTERPROCESS_DOXYGEN_INVOKED)
-   private:
-   typedef scoped_lock<Mutex> this_type;
-   BOOST_MOVABLE_BUT_NOT_COPYABLE(scoped_lock)
-   typedef bool this_type::*unspecified_bool_type;
-   #endif   //#ifndef BOOST_INTERPROCESS_DOXYGEN_INVOKED
-   public:
-
-   typedef Mutex mutex_type;
-
-   //!Effects: Default constructs a scoped_lock.
-   //!Postconditions: owns() == false and mutex() == 0.
-   scoped_lock() BOOST_NOEXCEPT
-      : mp_mutex(0), m_locked(false)
-   {}
-
-   //!Effects: m.lock().
-   //!Postconditions: owns() == true and mutex() == &m.
-   //!Notes: The constructor will take ownership of the mutex. If another thread
-   //!   already owns the mutex, this thread will block until the mutex is released.
-   //!   Whether or not this constructor handles recursive locking depends upon the mutex.
-   explicit scoped_lock(mutex_type& m)
-      : mp_mutex(&m), m_locked(false)
-   {  mp_mutex->lock();   m_locked = true;  }
-
-   //!Postconditions: owns() == false, and mutex() == &m.
-   //!Notes: The constructor will not take ownership of the mutex. There is no effect
-   //!   required on the referenced mutex.
-   scoped_lock(mutex_type& m, defer_lock_type)
-      : mp_mutex(&m), m_locked(false)
-   {}
-
-   //!Postconditions: owns() == true, and mutex() == &m.
-   //!Notes: The constructor will suppose that the mutex is already locked. There
-   //!   is no effect required on the referenced mutex.
-   scoped_lock(mutex_type& m, accept_ownership_type)
-      : mp_mutex(&m), m_locked(true)
-   {}
-
-   //!Effects: m.try_lock().
-   //!Postconditions: mutex() == &m. owns() == the return value of the
-   //!   m.try_lock() executed within the constructor.
-   //!Notes: The constructor will take ownership of the mutex if it can do
-   //!   so without waiting. Whether or not this constructor handles recursive
-   //!   locking depends upon the mutex. If the mutex_type does not support try_lock,
-   //!   this constructor will fail at compile time if instantiated, but otherwise
-   //!   have no effect.
-   scoped_lock(mutex_type& m, try_to_lock_type)
-      : mp_mutex(&m), m_locked(mp_mutex->try_lock())
-   {}
-
-   //!Effects: m.timed_lock(abs_time).
-   //!Postconditions: mutex() == &m. owns() == the return value of the
-   //!   m.timed_lock(abs_time) executed within the constructor.
-   //!Notes: The constructor will take ownership of the mutex if it can do
-   //!   it until abs_time is reached. Whether or not this constructor
-   //!   handles recursive locking depends upon the mutex. If the mutex_type
-   //!   does not support try_lock, this constructor will fail at compile
-   //!   time if instantiated, but otherwise have no effect.
-   template<class TimePoint>
-   scoped_lock(mutex_type& m, const TimePoint& abs_time)
-      : mp_mutex(&m), m_locked(mp_mutex->timed_lock(abs_time))
-   {}
-
-   //!Postconditions: mutex() == the value scop.mutex() had before the
-   //!   constructor executes. s1.mutex() == 0. owns() == the value of
-   //!   scop.owns() before the constructor executes. scop.owns().
-   //!Notes: If the scop scoped_lock owns the mutex, ownership is moved
-   //!   to thisscoped_lock with no blocking. If the scop scoped_lock does not
-   //!   own the mutex, then neither will this scoped_lock. Only a moved
-   //!   scoped_lock's will match this signature. An non-moved scoped_lock
-   //!   can be moved with the expression: "boost::move(lock);". This
-   //!   constructor does not alter the state of the mutex, only potentially
-   //!   who owns it.
-   scoped_lock(BOOST_RV_REF(scoped_lock) scop) BOOST_NOEXCEPT
-      : mp_mutex(0), m_locked(scop.owns())
-   {  mp_mutex = scop.release(); }
-
-   //!Effects: If upgr.owns() then calls unlock_upgradable_and_lock() on the
-   //!   referenced mutex. upgr.release() is called.
-   //!Postconditions: mutex() == the value upgr.mutex() had before the construction.
-   //!   upgr.mutex() == 0. owns() == upgr.owns() before the construction.
-   //!   upgr.owns() == false after the construction.
-   //!Notes: If upgr is locked, this constructor will lock this scoped_lock while
-   //!   unlocking upgr. If upgr is unlocked, then this scoped_lock will be
-   //!   unlocked as well. Only a moved upgradable_lock's will match this
-   //!   signature. An non-moved upgradable_lock can be moved with
-   //!   the expression: "boost::move(lock);" This constructor may block if
-   //!   other threads hold a sharable_lock on this mutex (sharable_lock's can
-   //!   share ownership with an upgradable_lock).
-   template<class T>
-   explicit scoped_lock(BOOST_RV_REF(upgradable_lock<T>) upgr
-      , typename ipcdetail::enable_if< ipcdetail::is_same<T, Mutex> >::type * = 0)
-      : mp_mutex(0), m_locked(false)
-   {
-      upgradable_lock<mutex_type> &u_lock = upgr;
-      if(u_lock.owns()){
-         u_lock.mutex()->unlock_upgradable_and_lock();
-         m_locked = true;
-      }
-      mp_mutex = u_lock.release();
-   }
-
-   //!Effects: If upgr.owns() then calls try_unlock_upgradable_and_lock() on the
-   //!referenced mutex:
-   //!   a)if try_unlock_upgradable_and_lock() returns true then mutex() obtains
-   //!      the value from upgr.release() and owns() is set to true.
-   //!   b)if try_unlock_upgradable_and_lock() returns false then upgr is
-   //!      unaffected and this scoped_lock construction as the same effects as
-   //!      a default construction.
-   //!   c)Else upgr.owns() is false. mutex() obtains the value from upgr.release()
-   //!      and owns() is set to false
-   //!Notes: This construction will not block. It will try to obtain mutex
-   //!   ownership from upgr immediately, while changing the lock type from a
-   //!   "read lock" to a "write lock". If the "read lock" isn't held in the
-   //!   first place, the mutex merely changes type to an unlocked "write lock".
-   //!   If the "read lock" is held, then mutex transfer occurs only if it can
-   //!   do so in a non-blocking manner.
-   template<class T>
-   scoped_lock(BOOST_RV_REF(upgradable_lock<T>) upgr, try_to_lock_type
-         , typename ipcdetail::enable_if< ipcdetail::is_same<T, Mutex> >::type * = 0)
-      : mp_mutex(0), m_locked(false)
-   {
-      upgradable_lock<mutex_type> &u_lock = upgr;
-      if(u_lock.owns()){
-         if((m_locked = u_lock.mutex()->try_unlock_upgradable_and_lock()) == true){
-            mp_mutex = u_lock.release();
-         }
-      }
-      else{
-         u_lock.release();
-      }
-   }
-
-   //!Effects: If upgr.owns() then calls timed_unlock_upgradable_and_lock(abs_time)
-   //!   on the referenced mutex:
-   //!   a)if timed_unlock_upgradable_and_lock(abs_time) returns true then mutex()
-   //!      obtains the value from upgr.release() and owns() is set to true.
-   //!   b)if timed_unlock_upgradable_and_lock(abs_time) returns false then upgr
-   //!      is unaffected and this scoped_lock construction as the same effects
-   //!      as a default construction.
-   //!   c)Else upgr.owns() is false. mutex() obtains the value from upgr.release()
-   //!      and owns() is set to false
-   //!Notes: This construction will not block. It will try to obtain mutex ownership
-   //!   from upgr immediately, while changing the lock type from a "read lock" to a
-   //!   "write lock". If the "read lock" isn't held in the first place, the mutex
-   //!   merely changes type to an unlocked "write lock". If the "read lock" is held,
-   //!   then mutex transfer occurs only if it can do so in a non-blocking manner.
-   template<class T, class TimePoint>
-   scoped_lock(BOOST_RV_REF(upgradable_lock<T>) upgr, const TimePoint &abs_time
-               , typename ipcdetail::enable_if< ipcdetail::is_same<T, Mutex> >::type * = 0)
-      : mp_mutex(0), m_locked(false)
-   {
-      upgradable_lock<mutex_type> &u_lock = upgr;
-      if(u_lock.owns()){
-         if((m_locked = u_lock.mutex()->timed_unlock_upgradable_and_lock(abs_time)) == true){
-            mp_mutex = u_lock.release();
-         }
-      }
-      else{
-         u_lock.release();
-      }
-   }
-
-   //!Effects: If shar.owns() then calls try_unlock_sharable_and_lock() on the
-   //!referenced mutex.
-   //!   a)if try_unlock_sharable_and_lock() returns true then mutex() obtains
-   //!      the value from shar.release() and owns() is set to true.
-   //!   b)if try_unlock_sharable_and_lock() returns false then shar is
-   //!      unaffected and this scoped_lock construction has the same
-   //!      effects as a default construction.
-   //!   c)Else shar.owns() is false. mutex() obtains the value from
-   //!      shar.release() and owns() is set to false
-   //!Notes: This construction will not block. It will try to obtain mutex
-   //!   ownership from shar immediately, while changing the lock type from a
-   //!   "read lock" to a "write lock". If the "read lock" isn't held in the
-   //!   first place, the mutex merely changes type to an unlocked "write lock".
-   //!   If the "read lock" is held, then mutex transfer occurs only if it can
-   //!   do so in a non-blocking manner.
-   template<class T>
-   scoped_lock(BOOST_RV_REF(sharable_lock<T>) shar, try_to_lock_type
-      , typename ipcdetail::enable_if< ipcdetail::is_same<T, Mutex> >::type * = 0)
-      : mp_mutex(0), m_locked(false)
-   {
-      sharable_lock<mutex_type> &s_lock = shar;
-      if(s_lock.owns()){
-         if((m_locked = s_lock.mutex()->try_unlock_sharable_and_lock()) == true){
-            mp_mutex = s_lock.release();
-         }
-      }
-      else{
-         s_lock.release();
-      }
-   }
-
-   //!Effects: if (owns()) mp_mutex->unlock().
-   //!Notes: The destructor behavior ensures that the mutex lock is not leaked.*/
-   ~scoped_lock()
-   {
-      BOOST_TRY{  if(m_locked && mp_mutex)   mp_mutex->unlock();  }
-      BOOST_CATCH(...){} BOOST_CATCH_END
-   }
-
-   //!Effects: If owns() before the call, then unlock() is called on mutex().
-   //!   *this gets the state of scop and scop gets set to a default constructed state.
-   //!Notes: With a recursive mutex it is possible that both this and scop own
-   //!   the same mutex before the assignment. In this case, this will own the
-   //!   mutex after the assignment (and scop will not), but the mutex's lock
-   //!   count will be decremented by one.
-   scoped_lock &operator=(BOOST_RV_REF(scoped_lock) scop)
-   {
-      if(this->owns())
-         this->unlock();
-      m_locked = scop.owns();
-      mp_mutex = scop.release();
-      return *this;
-   }
-
-   //!Effects: If mutex() == 0 or if already locked, throws a lock_exception()
-   //!   exception. Calls lock() on the referenced mutex.
-   //!Postconditions: owns() == true.
-   //!Notes: The scoped_lock changes from a state of not owning the mutex, to
-   //!   owning the mutex, blocking if necessary.
-   void lock()
-   {
-      if(!mp_mutex || m_locked)
-         throw lock_exception();
-      mp_mutex->lock();
-      m_locked = true;
-   }
-
-   //!Effects: If mutex() == 0 or if already locked, throws a lock_exception()
-   //!   exception. Calls try_lock() on the referenced mutex.
-   //!Postconditions: owns() == the value returned from mutex()->try_lock().
-   //!Notes: The scoped_lock changes from a state of not owning the mutex, to
-   //!   owning the mutex, but only if blocking was not required. If the
-   //!   mutex_type does not support try_lock(), this function will fail at
-   //!   compile time if instantiated, but otherwise have no effect.*/
-   bool try_lock()
-   {
-      if(!mp_mutex || m_locked)
-         throw lock_exception();
-      m_locked = mp_mutex->try_lock();
-      return m_locked;
-   }
-
-   //!Effects: If mutex() == 0 or if already locked, throws a lock_exception()
-   //!   exception. Calls timed_lock(abs_time) on the referenced mutex.
-   //!Postconditions: owns() == the value returned from mutex()-> timed_lock(abs_time).
-   //!Notes: The scoped_lock changes from a state of not owning the mutex, to
-   //!   owning the mutex, but only if it can obtain ownership by the specified
-   //!   time. If the mutex_type does not support timed_lock (), this function
-   //!   will fail at compile time if instantiated, but otherwise have no effect.*/
-   template<class TimePoint>
-   bool timed_lock(const TimePoint& abs_time)
-   {
-      if(!mp_mutex || m_locked)
-         throw lock_exception();
-      m_locked = mp_mutex->timed_lock(abs_time);
-      return m_locked;
-   }
-
-   //!Effects: If mutex() == 0 or if already locked, throws a lock_exception()
-   //!   exception. Calls try_lock_until(abs_time) on the referenced mutex.
-   //!Postconditions: owns() == the value returned from mutex()-> timed_lock(abs_time).
-   //!Notes: The scoped_lock changes from a state of not owning the mutex, to
-   //!   owning the mutex, but only if it can obtain ownership by the specified
-   //!   time. If the mutex_type does not support timed_lock (), this function
-   //!   will fail at compile time if instantiated, but otherwise have no effect.*/
-   template<class TimePoint>
-   bool try_lock_until(const TimePoint& abs_time)
-   {
-      if(!mp_mutex || m_locked)
-         throw lock_exception();
-      m_locked = mp_mutex->try_lock_until(abs_time);
-      return m_locked;
-   }
-
-   //!Effects: If mutex() == 0 or if already locked, throws a lock_exception()
-   //!   exception. Calls try_lock_until(abs_time) on the referenced mutex.
-   //!Postconditions: owns() == the value returned from mutex()-> timed_lock(abs_time).
-   //!Notes: The scoped_lock changes from a state of not owning the mutex, to
-   //!   owning the mutex, but only if it can obtain ownership by the specified
-   //!   time. If the mutex_type does not support timed_lock (), this function
-   //!   will fail at compile time if instantiated, but otherwise have no effect.*/
-   template<class Duration>
-   bool try_lock_for(const Duration& dur)
-   {
-      if(!mp_mutex || m_locked)
-         throw lock_exception();
-      m_locked = mp_mutex->try_lock_for(dur);
-      return m_locked;
-   }
-
-   //!Effects: If mutex() == 0 or if not locked, throws a lock_exception()
-   //!   exception. Calls unlock() on the referenced mutex.
-   //!Postconditions: owns() == false.
-   //!Notes: The scoped_lock changes from a state of owning the mutex, to not
-   //!   owning the mutex.*/
-   void unlock()
-   {
-      if(!mp_mutex || !m_locked)
-         throw lock_exception();
-      mp_mutex->unlock();
-      m_locked = false;
-   }
-
-   //!Effects: Returns true if this scoped_lock has acquired
-   //!the referenced mutex.
-   bool owns() const BOOST_NOEXCEPT
-   {  return m_locked && mp_mutex;  }
-
-   //!Conversion to bool.
-   //!Returns owns().
-   operator unspecified_bool_type() const BOOST_NOEXCEPT
-   {  return m_locked? &this_type::m_locked : 0;   }
-
-   //!Effects: Returns a pointer to the referenced mutex, or 0 if
-   //!there is no mutex to reference.
-   mutex_type* mutex() const BOOST_NOEXCEPT
-   {  return  mp_mutex;  }
-
-   //!Effects: Returns a pointer to the referenced mutex, or 0 if there is no
-   //!   mutex to reference.
-   //!Postconditions: mutex() == 0 and owns() == false.
-   mutex_type* release() BOOST_NOEXCEPT
-   {
-      mutex_type *mut = mp_mutex;
-      mp_mutex = 0;
-      m_locked = false;
-      return mut;
-   }
-
-   //!Effects: Swaps state with moved lock.
-   //!Throws: Nothing.
-   void swap( scoped_lock<mutex_type> &other) BOOST_NOEXCEPT
-   {
-      (simple_swap)(mp_mutex, other.mp_mutex);
-      (simple_swap)(m_locked, other.m_locked);
-   }
-
-   #if !defined(BOOST_INTERPROCESS_DOXYGEN_INVOKED)
-   private:
-   mutex_type *mp_mutex;
-   bool        m_locked;
-   #endif   //#ifndef BOOST_INTERPROCESS_DOXYGEN_INVOKED
-};
-
-} // namespace interprocess
-} // namespace boost
-
-#include <boost/interprocess/detail/config_end.hpp>
-
-#endif // BOOST_INTERPROCESS_SCOPED_LOCK_HPP
diff --git a/src/boost/interprocess/sync/spin/mutex.hpp b/src/boost/interprocess/sync/spin/mutex.hpp
deleted file mode 100644
index ce9f87fe..00000000
--- a/src/boost/interprocess/sync/spin/mutex.hpp
+++ /dev/null
@@ -1,116 +0,0 @@
-//////////////////////////////////////////////////////////////////////////////
-//
-// (C) Copyright Ion Gaztanaga 2005-2012. Distributed under the Boost
-// 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/interprocess for documentation.
-//
-//////////////////////////////////////////////////////////////////////////////
-
-#ifndef BOOST_INTERPROCESS_DETAIL_SPIN_MUTEX_HPP
-#define BOOST_INTERPROCESS_DETAIL_SPIN_MUTEX_HPP
-
-#ifndef BOOST_CONFIG_HPP
-#  include <boost/config.hpp>
-#endif
-#
-#if defined(BOOST_HAS_PRAGMA_ONCE)
-#  pragma once
-#endif
-
-#include <boost/interprocess/detail/config_begin.hpp>
-#include <boost/interprocess/detail/workaround.hpp>
-#include <boost/assert.hpp>
-#include <boost/interprocess/detail/atomic.hpp>
-#include <boost/cstdint.hpp>
-#include <boost/interprocess/detail/os_thread_functions.hpp>
-#include <boost/interprocess/sync/detail/common_algorithms.hpp>
-
-namespace boost {
-namespace interprocess {
-namespace ipcdetail {
-
-class spin_mutex
-{
-   spin_mutex(const spin_mutex &);
-   spin_mutex &operator=(const spin_mutex &);
-   public:
-
-   spin_mutex();
-   ~spin_mutex();
-
-   void lock();
-   bool try_lock();
-   template<class TimePoint>
-   bool timed_lock(const TimePoint &abs_time);
-
-   template<class TimePoint> bool try_lock_until(const TimePoint &abs_time)
-   {  return this->timed_lock(abs_time);  }
-
-   template<class Duration>  bool try_lock_for(const Duration &dur)
-   {  return this->timed_lock(duration_to_ustime(dur)); }
-
-   void unlock();
-   void take_ownership(){}
-   private:
-   volatile boost::uint32_t m_s;
-
-   struct common_lock_wrapper
-   {
-      common_lock_wrapper(spin_mutex &sp)
-         : m_sp(sp)
-      {}
-
-      void lock()
-      {
-         ipcdetail::try_based_lock(m_sp);
-      }
-
-      template<class TimePoint>
-      bool timed_lock(const TimePoint &abs_time)
-      {  return m_sp.timed_lock(abs_time);   }
-
-      spin_mutex &m_sp;
-   };
-};
-
-inline spin_mutex::spin_mutex()
-   : m_s(0)
-{
-   //Note that this class is initialized to zero.
-   //So zeroed memory can be interpreted as an
-   //initialized mutex
-}
-
-inline spin_mutex::~spin_mutex()
-{
-   //Trivial destructor
-}
-
-inline void spin_mutex::lock(void)
-{
-   common_lock_wrapper clw(*this);
-   ipcdetail::timeout_when_locking_aware_lock(clw);
-}
-
-inline bool spin_mutex::try_lock(void)
-{
-   boost::uint32_t prev_s = ipcdetail::atomic_cas32(const_cast<boost::uint32_t*>(&m_s), 1, 0);
-   return m_s == 1 && prev_s == 0;
-}
-
-template<class TimePoint>
-inline bool spin_mutex::timed_lock(const TimePoint &abs_time)
-{  return ipcdetail::try_based_timed_lock(*this, abs_time); }
-
-inline void spin_mutex::unlock(void)
-{  ipcdetail::atomic_cas32(const_cast<boost::uint32_t*>(&m_s), 0, 1);   }
-
-}  //namespace ipcdetail {
-}  //namespace interprocess {
-}  //namespace boost {
-
-#include <boost/interprocess/detail/config_end.hpp>
-
-#endif   //BOOST_INTERPROCESS_DETAIL_SPIN_MUTEX_HPP
diff --git a/src/boost/interprocess/sync/spin/recursive_mutex.hpp b/src/boost/interprocess/sync/spin/recursive_mutex.hpp
deleted file mode 100644
index 3a9e94a9..00000000
--- a/src/boost/interprocess/sync/spin/recursive_mutex.hpp
+++ /dev/null
@@ -1,184 +0,0 @@
-//////////////////////////////////////////////////////////////////////////////
-//
-// (C) Copyright Ion Gaztanaga 2005-2012. Distributed under the Boost
-// 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/interprocess for documentation.
-//
-//////////////////////////////////////////////////////////////////////////////
-//
-// Parts of the pthread code come from Boost Threads code:
-//
-//////////////////////////////////////////////////////////////////////////////
-//
-// Copyright (C) 2001-2003
-// William E. Kempf
-//
-// Permission to use, copy, modify, distribute and sell this software
-// and its documentation for any purpose is hereby granted without fee,
-// provided that the above copyright notice appear in all copies and
-// that both that copyright notice and this permission notice appear
-// in supporting documentation.  William E. Kempf makes no representations
-// about the suitability of this software for any purpose.
-// It is provided "as is" without express or implied warranty.
-//////////////////////////////////////////////////////////////////////////////
-
-#ifndef BOOST_INTERPROCESS_DETAIL_SPIN_RECURSIVE_MUTEX_HPP
-#define BOOST_INTERPROCESS_DETAIL_SPIN_RECURSIVE_MUTEX_HPP
-
-#ifndef BOOST_CONFIG_HPP
-#  include <boost/config.hpp>
-#endif
-#
-#if defined(BOOST_HAS_PRAGMA_ONCE)
-#  pragma once
-#endif
-
-#include <boost/interprocess/detail/config_begin.hpp>
-#include <boost/interprocess/detail/workaround.hpp>
-
-#include <boost/interprocess/detail/os_thread_functions.hpp>
-#include <boost/interprocess/exceptions.hpp>
-#include <boost/interprocess/detail/atomic.hpp>
-#include <boost/cstdint.hpp>
-#include <boost/interprocess/detail/os_thread_functions.hpp>
-#include <boost/interprocess/sync/spin/mutex.hpp>
-#include <boost/assert.hpp>
-
-namespace boost {
-namespace interprocess {
-namespace ipcdetail {
-
-class spin_recursive_mutex
-{
-   spin_recursive_mutex(const spin_recursive_mutex &);
-   spin_recursive_mutex &operator=(const spin_recursive_mutex &);
-   public:
-
-   spin_recursive_mutex();
-   ~spin_recursive_mutex();
-
-   void lock();
-   bool try_lock();
-   template<class TimePoint>
-   bool timed_lock(const TimePoint &abs_time);
-
-   template<class TimePoint> bool try_lock_until(const TimePoint &abs_time)
-   {  return this->timed_lock(abs_time);  }
-
-   template<class Duration>  bool try_lock_for(const Duration &dur)
-   {  return this->timed_lock(duration_to_ustime(dur)); }
-
-   void unlock();
-   void take_ownership();
-   private:
-   spin_mutex     m_mutex;
-   unsigned int   m_nLockCount;
-   volatile ipcdetail::OS_systemwide_thread_id_t   m_nOwner;
-   volatile boost::uint32_t m_s;
-};
-
-inline spin_recursive_mutex::spin_recursive_mutex()
-   : m_nLockCount(0), m_nOwner(ipcdetail::get_invalid_systemwide_thread_id()){}
-
-inline spin_recursive_mutex::~spin_recursive_mutex(){}
-
-inline void spin_recursive_mutex::lock()
-{
-   typedef ipcdetail::OS_systemwide_thread_id_t handle_t;
-   const handle_t thr_id(ipcdetail::get_current_systemwide_thread_id());
-   handle_t old_id;
-   ipcdetail::systemwide_thread_id_copy(m_nOwner, old_id);
-   if(ipcdetail::equal_systemwide_thread_id(thr_id , old_id)){
-      if((unsigned int)(m_nLockCount+1) == 0){
-         //Overflow, throw an exception
-         throw interprocess_exception("boost::interprocess::spin_recursive_mutex recursive lock overflow");
-      }
-      ++m_nLockCount;
-   }
-   else{
-      m_mutex.lock();
-      ipcdetail::systemwide_thread_id_copy(thr_id, m_nOwner);
-      m_nLockCount = 1;
-   }
-}
-
-inline bool spin_recursive_mutex::try_lock()
-{
-   typedef ipcdetail::OS_systemwide_thread_id_t handle_t;
-   handle_t thr_id(ipcdetail::get_current_systemwide_thread_id());
-   handle_t old_id;
-   ipcdetail::systemwide_thread_id_copy(m_nOwner, old_id);
-   if(ipcdetail::equal_systemwide_thread_id(thr_id , old_id)) {  // we own it
-      if((unsigned int)(m_nLockCount+1) == 0){
-         //Overflow, throw an exception
-         throw interprocess_exception("boost::interprocess::spin_recursive_mutex recursive lock overflow");
-      }
-      ++m_nLockCount;
-      return true;
-   }
-   if(m_mutex.try_lock()){
-      ipcdetail::systemwide_thread_id_copy(thr_id, m_nOwner);
-      m_nLockCount = 1;
-      return true;
-   }
-   return false;
-}
-
-template<class TimePoint>
-inline bool spin_recursive_mutex::timed_lock(const TimePoint &abs_time)
-{
-   typedef ipcdetail::OS_systemwide_thread_id_t handle_t;
-   const handle_t thr_id(ipcdetail::get_current_systemwide_thread_id());
-   handle_t old_id;
-   ipcdetail::systemwide_thread_id_copy(m_nOwner, old_id);
-   if(ipcdetail::equal_systemwide_thread_id(thr_id , old_id)) {  // we own it
-      if((unsigned int)(m_nLockCount+1) == 0){
-         //Overflow, throw an exception
-         throw interprocess_exception("boost::interprocess::spin_recursive_mutex recursive lock overflow");
-      }
-      ++m_nLockCount;
-      return true;
-   }
-   //m_mutex supports abs_time so no need to check it
-   if(m_mutex.timed_lock(abs_time)){
-      ipcdetail::systemwide_thread_id_copy(thr_id, m_nOwner);
-      m_nLockCount = 1;
-      return true;
-   }
-   return false;
-}
-
-inline void spin_recursive_mutex::unlock()
-{
-   typedef ipcdetail::OS_systemwide_thread_id_t handle_t;
-   handle_t old_id;
-   ipcdetail::systemwide_thread_id_copy(m_nOwner, old_id);
-   const handle_t thr_id(ipcdetail::get_current_systemwide_thread_id());
-   (void)old_id;
-   (void)thr_id;
-   BOOST_ASSERT(ipcdetail::equal_systemwide_thread_id(thr_id, old_id));
-   --m_nLockCount;
-   if(!m_nLockCount){
-      const handle_t new_id(ipcdetail::get_invalid_systemwide_thread_id());
-      ipcdetail::systemwide_thread_id_copy(new_id, m_nOwner);
-      m_mutex.unlock();
-   }
-}
-
-inline void spin_recursive_mutex::take_ownership()
-{
-   typedef ipcdetail::OS_systemwide_thread_id_t handle_t;
-   this->m_nLockCount = 1;
-   const handle_t thr_id(ipcdetail::get_current_systemwide_thread_id());
-   ipcdetail::systemwide_thread_id_copy(thr_id, m_nOwner);
-}
-
-}  //namespace ipcdetail {
-}  //namespace interprocess {
-}  //namespace boost {
-
-#include <boost/interprocess/detail/config_end.hpp>
-
-#endif   //BOOST_INTERPROCESS_DETAIL_SPIN_RECURSIVE_MUTEX_HPP
diff --git a/src/boost/interprocess/sync/spin/wait.hpp b/src/boost/interprocess/sync/spin/wait.hpp
deleted file mode 100644
index 984f91ad..00000000
--- a/src/boost/interprocess/sync/spin/wait.hpp
+++ /dev/null
@@ -1,185 +0,0 @@
-//////////////////////////////////////////////////////////////////////////////
-//
-// (C) Copyright Peter Dimov 2008.
-// (C) Copyright Ion Gaztanaga 2013-2013. Distributed under the Boost
-// 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/interprocess for documentation.
-//
-//////////////////////////////////////////////////////////////////////////////
-
-//Parts of this file come from boost/smart_ptr/detail/yield_k.hpp
-//Many thanks to Peter Dimov.
-
-#ifndef BOOST_INTERPROCESS_SYNC_WAIT_HPP_INCLUDED
-#define BOOST_INTERPROCESS_SYNC_WAIT_HPP_INCLUDED
-
-#ifndef BOOST_CONFIG_HPP
-#  include <boost/config.hpp>
-#endif
-#
-#if defined(BOOST_HAS_PRAGMA_ONCE)
-# pragma once
-#endif
-
-#include <boost/interprocess/detail/config_begin.hpp>
-#include <boost/interprocess/detail/workaround.hpp>
-#include <boost/interprocess/detail/os_thread_functions.hpp>
-
-//#define BOOST_INTERPROCESS_SPIN_WAIT_DEBUG
-#ifdef BOOST_INTERPROCESS_SPIN_WAIT_DEBUG
-#include <iostream>
-#endif
-
-// BOOST_INTERPROCESS_SMT_PAUSE
-
-#if defined(_MSC_VER) && ( defined(_M_IX86) || defined(_M_X64) )
-
-extern "C" void _mm_pause();
-#pragma intrinsic( _mm_pause )
-
-#define BOOST_INTERPROCESS_SMT_PAUSE _mm_pause();
-
-#elif defined(__GNUC__) && ( defined(__i386__) || defined(__x86_64__) ) && !defined(_CRAYC)
-
-#define BOOST_INTERPROCESS_SMT_PAUSE __asm__ __volatile__( "rep; nop" : : : "memory" );
-
-#endif
-
-namespace boost{
-namespace interprocess{
-namespace ipcdetail {
-
-template<int Dummy = 0>
-class num_core_holder
-{
-   public:
-   static unsigned int get()
-   {
-      if(!num_cores){
-         return ipcdetail::get_num_cores();
-      }
-      else{
-         return num_cores;
-      }
-   }
-
-   private:
-   static unsigned int num_cores;
-};
-
-template<int Dummy>
-unsigned int num_core_holder<Dummy>::num_cores = ipcdetail::get_num_cores();
-
-}  //namespace ipcdetail {
-
-class spin_wait
-{
-   public:
-
-   static const unsigned int nop_pause_limit = 32u;
-   spin_wait()
-      : m_count_start(), m_ul_yield_only_counts(), m_k()
-   {}
-
-   #ifdef BOOST_INTERPROCESS_SPIN_WAIT_DEBUG
-   ~spin_wait()
-   {
-      if(m_k){
-         std::cout << "final m_k: " << m_k
-                   << " system tick(us): " << ipcdetail::get_system_tick_us() << std::endl;
-      }
-   }
-   #endif
-
-   unsigned int count() const
-   {  return m_k;  }
-
-   void yield()
-   {
-      //Lazy initialization of limits
-      if( !m_k){
-         this->init_limits();
-      }
-      //Nop tries
-      if( m_k < (nop_pause_limit >> 2) ){
-
-      }
-      //Pause tries if the processor supports it
-      #if defined(BOOST_INTERPROCESS_SMT_PAUSE)
-      else if( m_k < nop_pause_limit ){
-         BOOST_INTERPROCESS_SMT_PAUSE
-      }
-      #endif
-      //Yield/Sleep strategy
-      else{
-         //Lazy initialization of tick information
-         if(m_k == nop_pause_limit){
-            this->init_tick_info();
-         }
-         else if( this->yield_or_sleep() ){
-            ipcdetail::thread_yield();
-         }
-         else{
-            ipcdetail::thread_sleep_tick();
-         }
-      }
-      ++m_k;
-   }
-
-   void reset()
-   {
-      m_k = 0u;
-   }
-
-   private:
-
-   void init_limits()
-   {
-      unsigned int num_cores = ipcdetail::num_core_holder<0>::get();
-      m_k = num_cores > 1u ? 0u : nop_pause_limit;
-   }
-
-   void init_tick_info()
-   {
-      m_ul_yield_only_counts = ipcdetail::get_system_tick_in_highres_counts();
-      m_count_start = ipcdetail::get_current_system_highres_count();
-   }
-
-   //Returns true if yield must be called, false is sleep must be called
-   bool yield_or_sleep()
-   {
-      if(!m_ul_yield_only_counts){  //If yield-only limit was reached then yield one in every two tries
-         return (m_k & 1u) != 0;
-      }
-      else{ //Try to see if we've reched yield-only time limit
-         const ipcdetail::OS_highres_count_t now = ipcdetail::get_current_system_highres_count();
-         const ipcdetail::OS_highres_count_t elapsed = ipcdetail::system_highres_count_subtract(now, m_count_start);
-         if(!ipcdetail::system_highres_count_less_ul(elapsed, m_ul_yield_only_counts)){
-            #ifdef BOOST_INTERPROCESS_SPIN_WAIT_DEBUG
-            std::cout << "elapsed!\n"
-                      << "  m_ul_yield_only_counts: " << m_ul_yield_only_counts
-                     << " system tick(us): " << ipcdetail::get_system_tick_us() << '\n'
-                      << "  m_k: " << m_k << " elapsed counts: ";
-                     ipcdetail::ostream_highres_count(std::cout, elapsed) << std::endl;
-            #endif
-            //Yield-only time reached, now it's time to sleep
-            m_ul_yield_only_counts = 0ul;
-            return false;
-         }
-      }
-      return true;   //Otherwise yield
-   }
-
-   ipcdetail::OS_highres_count_t m_count_start;
-   unsigned long m_ul_yield_only_counts;
-   unsigned int  m_k;
-};
-
-} // namespace interprocess
-} // namespace boost
-
-#include <boost/interprocess/detail/config_end.hpp>
-
-#endif // #ifndef BOOST_INTERPROCESS_SYNC_WAIT_HPP_INCLUDED
diff --git a/src/boost/interprocess/sync/windows/sync_utils.hpp b/src/boost/interprocess/sync/windows/sync_utils.hpp
deleted file mode 100644
index 04106318..00000000
--- a/src/boost/interprocess/sync/windows/sync_utils.hpp
+++ /dev/null
@@ -1,275 +0,0 @@
-//////////////////////////////////////////////////////////////////////////////
-//
-// (C) Copyright Ion Gaztanaga 2005-2012. Distributed under the Boost
-// 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/interprocess for documentation.
-//
-//////////////////////////////////////////////////////////////////////////////
-
-#ifndef BOOST_INTERPROCESS_DETAIL_SYNC_UTILS_HPP
-#define BOOST_INTERPROCESS_DETAIL_SYNC_UTILS_HPP
-
-#ifndef BOOST_CONFIG_HPP
-#  include <boost/config.hpp>
-#endif
-#
-#if defined(BOOST_HAS_PRAGMA_ONCE)
-#  pragma once
-#endif
-
-#include <boost/interprocess/detail/config_begin.hpp>
-#include <boost/interprocess/detail/workaround.hpp>
-#include <boost/interprocess/detail/win32_api.hpp>
-#include <boost/interprocess/sync/spin/mutex.hpp>
-#include <boost/interprocess/exceptions.hpp>
-#include <boost/interprocess/sync/scoped_lock.hpp>
-#include <boost/interprocess/sync/windows/winapi_semaphore_wrapper.hpp>
-#include <boost/interprocess/sync/windows/winapi_mutex_wrapper.hpp>
-
-//Shield against external warnings
-#include <boost/interprocess/detail/config_external_begin.hpp>
-#include <boost/unordered/unordered_map.hpp>
-#include <boost/interprocess/detail/config_external_end.hpp>
-#include <boost/container/flat_map.hpp>
-
-#include <cstddef>
-
-namespace boost {
-namespace interprocess {
-namespace ipcdetail {
-
-inline bool bytes_to_str(const void *mem, const std::size_t mem_length, char *out_str, std::size_t &out_length)
-{
-   const std::size_t need_mem = mem_length*2+1;
-   if(out_length < need_mem){
-      out_length = need_mem;
-      return false;
-   }
-
-   const char Characters [] =
-      { '0', '1', '2', '3', '4', '5', '6', '7'
-      , '8', '9', 'A', 'B', 'C', 'D', 'E', 'F' };
-
-   std::size_t char_counter = 0;
-   const char *buf = (const char *)mem;
-   for(std::size_t i = 0; i != mem_length; ++i){
-      out_str[char_counter++] = Characters[(buf[i]&0xF0)>>4];
-      out_str[char_counter++] = Characters[(buf[i]&0x0F)];
-   }
-   out_str[char_counter] = 0;
-   return true;
-}
-
-inline bool bytes_to_str(const void *mem, const std::size_t mem_length, wchar_t *out_str, std::size_t &out_length)
-{
-   const std::size_t need_mem = mem_length*2+1;
-   if(out_length < need_mem){
-      out_length = need_mem;
-      return false;
-   }
-
-   const wchar_t Characters [] =
-      { L'0', L'1', L'2', L'3', L'4', L'5', L'6', L'7'
-      , L'8', L'9', L'A', L'B', L'C', L'D', L'E', L'F' };
-
-   std::size_t char_counter = 0;
-   const char *buf = (const char *)mem;
-   for(std::size_t i = 0; i != mem_length; ++i){
-      out_str[char_counter++] = Characters[(buf[i]&0xF0)>>4];
-      out_str[char_counter++] = Characters[(buf[i]&0x0F)];
-   }
-   out_str[char_counter] = 0;
-   return true;
-}
-
-class sync_id
-{
-   public:
-   typedef __int64 internal_type;
-   sync_id()
-   {  winapi::query_performance_counter(&rand_);  }
-
-   explicit sync_id(internal_type val)
-   {  rand_ = val;  }
-
-   const internal_type &internal_pod() const
-   {  return rand_;  }
-
-   internal_type &internal_pod()
-   {  return rand_;  }
-
-   friend std::size_t hash_value(const sync_id &m)
-   {  return boost::hash_value(m.rand_);  }
-
-   friend bool operator==(const sync_id &l, const sync_id &r)
-   {  return l.rand_ == r.rand_;  }
-
-   private:
-   internal_type rand_;
-};
-
-class sync_handles
-{
-   public:
-   enum type { MUTEX, SEMAPHORE };
-
-   private:
-
-   //key: id -> mapped: HANDLE. Hash map to allow efficient sync operations
-   typedef boost::unordered_map<sync_id, void*> umap_type;
-   //key: ordered address of the sync type -> iterator from umap_type. Ordered map to allow closing handles when unmapping
-   typedef boost::container::flat_map<const void*, umap_type::iterator> map_type;
-   static const std::size_t LengthOfGlobal = sizeof("Global\\boost.ipc")-1;
-   static const std::size_t StrSize        = LengthOfGlobal + (sizeof(sync_id)*2+1);
-   typedef char NameBuf[StrSize];
-
-   void fill_name(NameBuf &name, const sync_id &id)
-   {
-      const char *n = "Global\\boost.ipc";
-      std::size_t i = 0;
-      do{
-         name[i] = n[i];
-         ++i;
-      } while(n[i]);
-      std::size_t len = sizeof(NameBuf) - LengthOfGlobal;
-      bytes_to_str(&id.internal_pod(), sizeof(id.internal_pod()), &name[LengthOfGlobal], len);
-   }
-
-   void throw_if_error(void *hnd_val)
-   {
-      if(!hnd_val){
-         error_info err(static_cast<int>(winapi::get_last_error()));
-         throw interprocess_exception(err);
-      }
-   }
-
-   void* open_or_create_semaphore(const sync_id &id, unsigned int initial_count)
-   {
-      NameBuf name;
-      fill_name(name, id);
-      permissions unrestricted_security;
-      unrestricted_security.set_unrestricted();
-      winapi_semaphore_wrapper sem_wrapper;
-      bool created;
-      sem_wrapper.open_or_create
-         (name, (long)initial_count, winapi_semaphore_wrapper::MaxCount, unrestricted_security, created);
-      throw_if_error(sem_wrapper.handle());
-      return sem_wrapper.release();
-   }
-
-   void* open_or_create_mutex(const sync_id &id)
-   {
-      NameBuf name;
-      fill_name(name, id);
-      permissions unrestricted_security;
-      unrestricted_security.set_unrestricted();
-      winapi_mutex_wrapper mtx_wrapper;
-      mtx_wrapper.open_or_create(name, unrestricted_security);
-      throw_if_error(mtx_wrapper.handle());
-      return mtx_wrapper.release();
-   }
-
-   public:
-   sync_handles()
-      : num_handles_()
-   {}
-
-   ~sync_handles()
-   {
-      BOOST_ASSERT(num_handles_ == 0); //Sanity check that handle we don't leak handles
-   }
-
-   void *obtain_mutex(const sync_id &id, const void *mapping_address, bool *popen_created = 0)
-   {
-      umap_type::value_type v(id, (void*)0);
-      scoped_lock<spin_mutex> lock(mtx_);
-      umap_type::iterator it = umap_.insert(v).first;
-      void *&hnd_val = it->second;
-      if(!hnd_val){
-         BOOST_ASSERT(map_.find(mapping_address) == map_.end());
-         map_[mapping_address] = it;
-         hnd_val = open_or_create_mutex(id);
-         if(popen_created) *popen_created = true;
-         ++num_handles_;
-      }
-      else if(popen_created){
-         BOOST_ASSERT(map_.find(mapping_address) != map_.end());
-         *popen_created = false;
-      }
-
-      return hnd_val;
-   }
-
-   void *obtain_semaphore(const sync_id &id, const void *mapping_address, unsigned int initial_count, bool *popen_created = 0)
-   {
-      umap_type::value_type v(id, (void*)0);
-      scoped_lock<spin_mutex> lock(mtx_);
-      umap_type::iterator it = umap_.insert(v).first;
-      void *&hnd_val = it->second;
-      if(!hnd_val){
-         BOOST_ASSERT(map_.find(mapping_address) == map_.end());
-         map_[mapping_address] = it;
-         hnd_val = open_or_create_semaphore(id, initial_count);
-         if(popen_created) *popen_created = true;
-         ++num_handles_;
-      }
-      else if(popen_created){
-         BOOST_ASSERT(map_.find(mapping_address) != map_.end());
-         *popen_created = false;
-      }
-      return hnd_val;
-   }
-
-   void destroy_handle(const sync_id &id, const void *mapping_address)
-   {
-      scoped_lock<spin_mutex> lock(mtx_);
-      umap_type::iterator it = umap_.find(id);
-      umap_type::iterator itend = umap_.end();
-
-      if(it != itend){
-         winapi::close_handle(it->second);
-         --num_handles_;
-         std::size_t i = map_.erase(mapping_address);
-         (void)i;
-         BOOST_ASSERT(i == 1);   //The entry should be there
-         umap_.erase(it);
-      }
-   }
-
-   void destroy_syncs_in_range(const void *addr, std::size_t size)
-   {
-      const void *low_id(addr);
-      const void *hig_id(static_cast<const char*>(addr)+size);
-      scoped_lock<spin_mutex> lock(mtx_);
-      map_type::iterator itlow(map_.lower_bound(low_id)),
-                         ithig(map_.lower_bound(hig_id)),
-                         it(itlow);
-      for (; it != ithig; ++it){
-         umap_type::iterator uit = it->second; 
-         void * const hnd = uit->second;
-         umap_.erase(uit);
-         int ret = winapi::close_handle(hnd);
-         --num_handles_;
-         BOOST_ASSERT(ret != 0); (void)ret;  //Sanity check that handle was ok
-      }
-
-      map_.erase(itlow, ithig);
-   }
-
-   private:
-   spin_mutex mtx_;
-   umap_type umap_;
-   map_type map_;
-   std::size_t num_handles_;
-};
-
-
-}  //namespace ipcdetail {
-}  //namespace interprocess {
-}  //namespace boost {
-
-#include <boost/interprocess/detail/config_end.hpp>
-
-#endif   //BOOST_INTERPROCESS_DETAIL_SYNC_UTILS_HPP
diff --git a/src/boost/interprocess/sync/windows/winapi_mutex_wrapper.hpp b/src/boost/interprocess/sync/windows/winapi_mutex_wrapper.hpp
deleted file mode 100644
index 487571a5..00000000
--- a/src/boost/interprocess/sync/windows/winapi_mutex_wrapper.hpp
+++ /dev/null
@@ -1,135 +0,0 @@
- //////////////////////////////////////////////////////////////////////////////
-//
-// (C) Copyright Ion Gaztanaga 2011-2012. Distributed under the Boost
-// 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/interprocess for documentation.
-//
-//////////////////////////////////////////////////////////////////////////////
-
-#ifndef BOOST_INTERPROCESS_DETAIL_WINAPI_MUTEX_WRAPPER_HPP
-#define BOOST_INTERPROCESS_DETAIL_WINAPI_MUTEX_WRAPPER_HPP
-
-#ifndef BOOST_CONFIG_HPP
-#  include <boost/config.hpp>
-#endif
-#
-#if defined(BOOST_HAS_PRAGMA_ONCE)
-#  pragma once
-#endif
-
-#include <boost/interprocess/detail/config_begin.hpp>
-#include <boost/interprocess/detail/workaround.hpp>
-#include <boost/interprocess/creation_tags.hpp>
-#include <boost/interprocess/permissions.hpp>
-#include <boost/interprocess/detail/win32_api.hpp>
-#include <boost/interprocess/sync/windows/winapi_wrapper_common.hpp>
-#include <boost/interprocess/errors.hpp>
-#include <boost/interprocess/exceptions.hpp>
-#include <limits>
-
-namespace boost {
-namespace interprocess {
-namespace ipcdetail {
-
-class winapi_mutex_functions
-{
-   #if !defined(BOOST_INTERPROCESS_DOXYGEN_INVOKED)
-
-   //Non-copyable
-   winapi_mutex_functions(const winapi_mutex_functions &);
-   winapi_mutex_functions &operator=(const winapi_mutex_functions &);
-   #endif   //#ifndef BOOST_INTERPROCESS_DOXYGEN_INVOKED
-
-   public:
-   winapi_mutex_functions(void *mtx_hnd)
-      : m_mtx_hnd(mtx_hnd)
-   {}
-
-   void unlock()
-   {  winapi::release_mutex(m_mtx_hnd);   }
-
-   void lock()
-   {  return winapi_wrapper_wait_for_single_object(m_mtx_hnd);  }
-
-   bool try_lock()
-   {  return winapi_wrapper_try_wait_for_single_object(m_mtx_hnd);  }
-
-   template<class TimePoint>
-   bool timed_lock(const TimePoint &abs_time)
-   {  return winapi_wrapper_timed_wait_for_single_object(m_mtx_hnd, abs_time);  }
-
-   #if !defined(BOOST_INTERPROCESS_DOXYGEN_INVOKED)
-   protected:
-   void *m_mtx_hnd;
-   #endif   //#ifndef BOOST_INTERPROCESS_DOXYGEN_INVOKED
-};
-
-//Swappable mutex wrapper
-class winapi_mutex_wrapper
-   : public winapi_mutex_functions
-{
-   #if !defined(BOOST_INTERPROCESS_DOXYGEN_INVOKED)
-
-   //Non-copyable
-   winapi_mutex_wrapper(const winapi_mutex_wrapper &);
-   winapi_mutex_wrapper &operator=(const winapi_mutex_wrapper &);
-   #endif   //#ifndef BOOST_INTERPROCESS_DOXYGEN_INVOKED
-
-   //Note that Windows API does not return winapi::invalid_handle_value
-   //when failing to create/open a mutex, but a nullptr
-
-   public:
-   winapi_mutex_wrapper(void *mtx_hnd = 0)
-      : winapi_mutex_functions(mtx_hnd)
-   {}
-
-   ~winapi_mutex_wrapper()
-   {  this->close(); }
-
-   void *release()
-   {
-      void *hnd = m_mtx_hnd;
-      m_mtx_hnd = 0;
-      return hnd;
-   }
-
-   void *handle() const
-   {  return m_mtx_hnd; }
-
-   template<class CharT>
-   bool open_or_create(const CharT *name, const permissions &perm)
-   {
-      if(m_mtx_hnd == 0){
-         m_mtx_hnd = winapi::open_or_create_mutex
-            ( name
-            , false
-            , (winapi::interprocess_security_attributes*)perm.get_permissions()
-            );
-         return m_mtx_hnd != 0;
-      }
-      else{
-         return false;
-      }
-   }
-
-   void close()
-   {
-      if(m_mtx_hnd != 0){
-         winapi::close_handle(m_mtx_hnd);
-         m_mtx_hnd = 0;
-      }
-   }
-
-   void swap(winapi_mutex_wrapper &other)
-   {  void *tmp = m_mtx_hnd; m_mtx_hnd = other.m_mtx_hnd; other.m_mtx_hnd = tmp;   }
-};
-
-}  //namespace ipcdetail {
-}  //namespace interprocess {
-}  //namespace boost {
-
-#include <boost/interprocess/detail/config_end.hpp>
-
-#endif   //BOOST_INTERPROCESS_DETAIL_WINAPI_MUTEX_WRAPPER_HPP
diff --git a/src/boost/interprocess/sync/windows/winapi_semaphore_wrapper.hpp b/src/boost/interprocess/sync/windows/winapi_semaphore_wrapper.hpp
deleted file mode 100644
index b8580486..00000000
--- a/src/boost/interprocess/sync/windows/winapi_semaphore_wrapper.hpp
+++ /dev/null
@@ -1,169 +0,0 @@
- //////////////////////////////////////////////////////////////////////////////
-//
-// (C) Copyright Ion Gaztanaga 2011-2012. Distributed under the Boost
-// 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/interprocess for documentation.
-//
-//////////////////////////////////////////////////////////////////////////////
-
-#ifndef BOOST_INTERPROCESS_DETAIL_WINAPI_SEMAPHORE_WRAPPER_HPP
-#define BOOST_INTERPROCESS_DETAIL_WINAPI_SEMAPHORE_WRAPPER_HPP
-
-#ifndef BOOST_CONFIG_HPP
-#  include <boost/config.hpp>
-#endif
-#
-#if defined(BOOST_HAS_PRAGMA_ONCE)
-#  pragma once
-#endif
-
-#include <boost/interprocess/detail/config_begin.hpp>
-#include <boost/interprocess/detail/workaround.hpp>
-#include <boost/interprocess/creation_tags.hpp>
-#include <boost/interprocess/permissions.hpp>
-#include <boost/interprocess/detail/win32_api.hpp>
-#include <boost/interprocess/sync/windows/winapi_wrapper_common.hpp>
-#include <boost/interprocess/errors.hpp>
-#include <boost/interprocess/exceptions.hpp>
-#include <limits>
-
-namespace boost {
-namespace interprocess {
-namespace ipcdetail {
-
-class winapi_semaphore_functions
-{
-   #if !defined(BOOST_INTERPROCESS_DOXYGEN_INVOKED)
-
-   //Non-copyable
-   winapi_semaphore_functions(const winapi_semaphore_functions &);
-   winapi_semaphore_functions &operator=(const winapi_semaphore_functions &);
-   #endif   //#ifndef BOOST_INTERPROCESS_DOXYGEN_INVOKED
-
-   public:
-   winapi_semaphore_functions(void *hnd)
-      : m_sem_hnd(hnd)
-   {}
-
-   void post(long count = 1)
-   {
-      long prev_count;
-      winapi::release_semaphore(m_sem_hnd, count, &prev_count);
-   }
-
-   void wait()
-   {  return winapi_wrapper_wait_for_single_object(m_sem_hnd);  }
-
-   bool try_wait()
-   {  return winapi_wrapper_try_wait_for_single_object(m_sem_hnd);  }
-
-   template<class TimePoint>
-   bool timed_wait(const TimePoint &abs_time)
-   {  return winapi_wrapper_timed_wait_for_single_object(m_sem_hnd, abs_time);  }
-
-   long value() const
-   {
-      long l_count, l_limit;
-      if(!winapi::get_semaphore_info(m_sem_hnd, l_count, l_limit))
-         return 0;
-      return l_count;
-   }
-
-   long limit() const
-   {
-      long l_count, l_limit;
-      if(!winapi::get_semaphore_info(m_sem_hnd, l_count, l_limit))
-         return 0;
-      return l_limit;
-   }
-
-   #if !defined(BOOST_INTERPROCESS_DOXYGEN_INVOKED)
-   protected:
-   void *m_sem_hnd;
-   #endif   //#ifndef BOOST_INTERPROCESS_DOXYGEN_INVOKED
-};
-
-
-//Swappable semaphore wrapper
-class winapi_semaphore_wrapper
-   : public winapi_semaphore_functions
-{
-   winapi_semaphore_wrapper(const winapi_semaphore_wrapper &);
-   winapi_semaphore_wrapper &operator=(const winapi_semaphore_wrapper &);
-
-   public:
-
-   //Long is 32 bits in windows
-   static const long MaxCount = long(0x7FFFFFFF);
-
-   winapi_semaphore_wrapper(void *hnd = winapi::invalid_handle_value)
-      : winapi_semaphore_functions(hnd)
-   {}
-
-   ~winapi_semaphore_wrapper()
-   {  this->close(); }
-
-   void *release()
-   {
-      void *hnd = m_sem_hnd;
-      m_sem_hnd = winapi::invalid_handle_value;
-      return hnd;
-   }
-
-   void *handle() const
-   {  return m_sem_hnd; }
-
-   template <class CharT>
-   bool open_or_create( const CharT *name
-                      , long sem_count
-                      , long max_count
-                      , const permissions &perm
-                      , bool &created)
-   {
-      if(m_sem_hnd == winapi::invalid_handle_value){
-         m_sem_hnd = winapi::open_or_create_semaphore
-            ( name
-            , sem_count
-            , max_count
-            , (winapi::interprocess_security_attributes*)perm.get_permissions()
-            );
-         created = winapi::get_last_error() != winapi::error_already_exists;
-         return m_sem_hnd != winapi::invalid_handle_value;
-      }
-      else{
-         return false;
-      }
-   }
-
-   bool open_semaphore(const char *name)
-   {
-      if(m_sem_hnd == winapi::invalid_handle_value){
-         m_sem_hnd = winapi::open_semaphore(name);
-         return m_sem_hnd != winapi::invalid_handle_value;
-      }
-      else{
-         return false;
-      }
-   }
-
-   void close()
-   {
-      if(m_sem_hnd != winapi::invalid_handle_value){
-         winapi::close_handle(m_sem_hnd);
-         m_sem_hnd = winapi::invalid_handle_value;
-      }
-   }
-
-   void swap(winapi_semaphore_wrapper &other)
-   {  void *tmp = m_sem_hnd; m_sem_hnd = other.m_sem_hnd; other.m_sem_hnd = tmp;   }
-};
-
-}  //namespace ipcdetail {
-}  //namespace interprocess {
-}  //namespace boost {
-
-#include <boost/interprocess/detail/config_end.hpp>
-
-#endif   //BOOST_INTERPROCESS_DETAIL_WINAPI_SEMAPHORE_WRAPPER_HPP
diff --git a/src/boost/interprocess/sync/windows/winapi_wrapper_common.hpp b/src/boost/interprocess/sync/windows/winapi_wrapper_common.hpp
deleted file mode 100644
index 60794903..00000000
--- a/src/boost/interprocess/sync/windows/winapi_wrapper_common.hpp
+++ /dev/null
@@ -1,87 +0,0 @@
- //////////////////////////////////////////////////////////////////////////////
-//
-// (C) Copyright Ion Gaztanaga 2011-2012. Distributed under the Boost
-// 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/interprocess for documentation.
-//
-//////////////////////////////////////////////////////////////////////////////
-
-#ifndef BOOST_INTERPROCESS_DETAIL_WINAPI_WRAPPER_COMMON_HPP
-#define BOOST_INTERPROCESS_DETAIL_WINAPI_WRAPPER_COMMON_HPP
-
-#ifndef BOOST_CONFIG_HPP
-#  include <boost/config.hpp>
-#endif
-#
-#if defined(BOOST_HAS_PRAGMA_ONCE)
-#  pragma once
-#endif
-
-#include <boost/interprocess/detail/config_begin.hpp>
-#include <boost/interprocess/detail/workaround.hpp>
-#include <boost/interprocess/detail/win32_api.hpp>
-#include <boost/interprocess/errors.hpp>
-#include <boost/interprocess/exceptions.hpp>
-#include <boost/interprocess/detail/timed_utils.hpp>
-#include <limits>
-
-namespace boost {
-namespace interprocess {
-namespace ipcdetail {
-
-inline bool do_winapi_wait(void *handle, unsigned long dwMilliseconds)
-{
-   unsigned long ret = winapi::wait_for_single_object(handle, dwMilliseconds);
-   if(ret == winapi::wait_object_0){
-      return true;
-   }
-   else if(ret == winapi::wait_timeout){
-      return false;
-   }
-   else if(ret == winapi::wait_abandoned){ //Special case for orphaned mutexes
-      winapi::release_mutex(handle);
-      throw interprocess_exception(owner_dead_error);
-   }
-   else{
-      error_info err = system_error_code();
-      throw interprocess_exception(err);
-   }
-}
-
-template<class TimePoint>
-inline bool winapi_wrapper_timed_wait_for_single_object(void *handle, const TimePoint &abs_time)
-{
-   //Windows uses relative wait times so check for negative waits
-   //and implement as 0 wait to allow try-semantics as POSIX mandates.
-   unsigned long time_ms = 0u;
-   if (ipcdetail::is_pos_infinity(abs_time)){
-      time_ms = winapi::infinite_time;
-   }
-   else {
-      const TimePoint cur_time = microsec_clock<TimePoint>::universal_time();
-      if(abs_time > cur_time){
-         time_ms = static_cast<unsigned long>(duration_to_milliseconds(abs_time - cur_time));
-      }
-   }
-   return do_winapi_wait(handle, time_ms);
-}
-
-inline void winapi_wrapper_wait_for_single_object(void *handle)
-{
-   (void)do_winapi_wait(handle, winapi::infinite_time);
-}
-
-inline bool winapi_wrapper_try_wait_for_single_object(void *handle)
-{
-   return do_winapi_wait(handle, 0u);
-}
-
-}  //namespace ipcdetail {
-}  //namespace interprocess {
-}  //namespace boost {
-
-#include <boost/interprocess/detail/config_end.hpp>
-
-#endif   //BOOST_INTERPROCESS_DETAIL_WINAPI_WRAPPER_COMMON_HPP
diff --git a/src/boost/intrusive/avl_set_hook.hpp b/src/boost/intrusive/avl_set_hook.hpp
deleted file mode 100644
index 18713036..00000000
--- a/src/boost/intrusive/avl_set_hook.hpp
+++ /dev/null
@@ -1,293 +0,0 @@
-/////////////////////////////////////////////////////////////////////////////
-//
-// (C) Copyright Ion Gaztanaga 2007-2013
-//
-// Distributed under the Boost 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/intrusive for documentation.
-//
-/////////////////////////////////////////////////////////////////////////////
-
-#ifndef BOOST_INTRUSIVE_AVL_SET_HOOK_HPP
-#define BOOST_INTRUSIVE_AVL_SET_HOOK_HPP
-
-#include <boost/intrusive/detail/config_begin.hpp>
-#include <boost/intrusive/intrusive_fwd.hpp>
-
-#include <boost/intrusive/detail/avltree_node.hpp>
-#include <boost/intrusive/avltree_algorithms.hpp>
-#include <boost/intrusive/options.hpp>
-#include <boost/intrusive/detail/generic_hook.hpp>
-
-#if defined(BOOST_HAS_PRAGMA_ONCE)
-#  pragma once
-#endif
-
-namespace boost {
-namespace intrusive {
-
-//! Helper metafunction to define a \c avl_set_base_hook that yields to the same
-//! type when the same options (either explicitly or implicitly) are used.
-#if defined(BOOST_INTRUSIVE_DOXYGEN_INVOKED) || defined(BOOST_INTRUSIVE_VARIADIC_TEMPLATES)
-template<class ...Options>
-#else
-template<class O1 = void, class O2 = void, class O3 = void, class O4 = void>
-#endif
-struct make_avl_set_base_hook
-{
-   /// @cond
-   typedef typename pack_options
-      #if !defined(BOOST_INTRUSIVE_VARIADIC_TEMPLATES)
-      <hook_defaults, O1, O2, O3, O4>
-      #else
-      <hook_defaults, Options...>
-      #endif
-      ::type packed_options;
-
-   typedef generic_hook
-   < AvlTreeAlgorithms
-   , avltree_node_traits<typename packed_options::void_pointer, packed_options::optimize_size>
-   , typename packed_options::tag
-   , packed_options::link_mode
-   , AvlTreeBaseHookId
-   > implementation_defined;
-   /// @endcond
-   typedef implementation_defined type;
-};
-
-//! Derive a class from avl_set_base_hook in order to store objects in
-//! in an avl_set/avl_multiset. avl_set_base_hook holds the data necessary to maintain
-//! the avl_set/avl_multiset and provides an appropriate value_traits class for avl_set/avl_multiset.
-//!
-//! The hook admits the following options: \c tag<>, \c void_pointer<>,
-//! \c link_mode<> and \c optimize_size<>.
-//!
-//! \c tag<> defines a tag to identify the node.
-//! The same tag value can be used in different classes, but if a class is
-//! derived from more than one \c list_base_hook, then each \c list_base_hook needs its
-//! unique tag.
-//!
-//! \c void_pointer<> is the pointer type that will be used internally in the hook
-//! and the container configured to use this hook.
-//!
-//! \c link_mode<> will specify the linking mode of the hook (\c normal_link,
-//! \c auto_unlink or \c safe_link).
-//!
-//! \c optimize_size<> will tell the hook to optimize the hook for size instead
-//! of speed.
-#if defined(BOOST_INTRUSIVE_DOXYGEN_INVOKED) || defined(BOOST_INTRUSIVE_VARIADIC_TEMPLATES)
-template<class ...Options>
-#else
-template<class O1, class O2, class O3, class O4>
-#endif
-class avl_set_base_hook
-   :  public make_avl_set_base_hook
-      #if !defined(BOOST_INTRUSIVE_VARIADIC_TEMPLATES)
-      <O1, O2, O3, O4>
-      #else
-      <Options...>
-      #endif
-      ::type
-{
-   #if defined(BOOST_INTRUSIVE_DOXYGEN_INVOKED)
-   public:
-   //! <b>Effects</b>: If link_mode is \c auto_unlink or \c safe_link
-   //!   initializes the node to an unlinked state.
-   //!
-   //! <b>Throws</b>: Nothing.
-   avl_set_base_hook();
-
-   //! <b>Effects</b>: If link_mode is \c auto_unlink or \c safe_link
-   //!   initializes the node to an unlinked state. The argument is ignored.
-   //!
-   //! <b>Throws</b>: Nothing.
-   //!
-   //! <b>Rationale</b>: Providing a copy-constructor
-   //!   makes classes using the hook STL-compliant without forcing the
-   //!   user to do some additional work. \c swap can be used to emulate
-   //!   move-semantics.
-   avl_set_base_hook(const avl_set_base_hook& );
-
-   //! <b>Effects</b>: Empty function. The argument is ignored.
-   //!
-   //! <b>Throws</b>: Nothing.
-   //!
-   //! <b>Rationale</b>: Providing an assignment operator
-   //!   makes classes using the hook STL-compliant without forcing the
-   //!   user to do some additional work. \c swap can be used to emulate
-   //!   move-semantics.
-   avl_set_base_hook& operator=(const avl_set_base_hook& );
-
-   //! <b>Effects</b>: If link_mode is \c normal_link, the destructor does
-   //!   nothing (ie. no code is generated). If link_mode is \c safe_link and the
-   //!   object is stored in a set an assertion is raised. If link_mode is
-   //!   \c auto_unlink and \c is_linked() is true, the node is unlinked.
-   //!
-   //! <b>Throws</b>: Nothing.
-   ~avl_set_base_hook();
-
-   //! <b>Effects</b>: Swapping two nodes swaps the position of the elements
-   //!   related to those nodes in one or two containers. That is, if the node
-   //!   this is part of the element e1, the node x is part of the element e2
-   //!   and both elements are included in the containers s1 and s2, then after
-   //!   the swap-operation e1 is in s2 at the position of e2 and e2 is in s1
-   //!   at the position of e1. If one element is not in a container, then
-   //!   after the swap-operation the other element is not in a container.
-   //!   Iterators to e1 and e2 related to those nodes are invalidated.
-   //!
-   //! <b>Complexity</b>: Constant
-   //!
-   //! <b>Throws</b>: Nothing.
-   void swap_nodes(avl_set_base_hook &other);
-
-   //! <b>Precondition</b>: link_mode must be \c safe_link or \c auto_unlink.
-   //!
-   //! <b>Returns</b>: true, if the node belongs to a container, false
-   //!   otherwise. This function can be used to test whether \c set::iterator_to
-   //!   will return a valid iterator.
-   //!
-   //! <b>Complexity</b>: Constant
-   bool is_linked() const;
-
-   //! <b>Effects</b>: Removes the node if it's inserted in a container.
-   //!   This function is only allowed if link_mode is \c auto_unlink.
-   //!
-   //! <b>Throws</b>: Nothing.
-   void unlink();
-   #endif
-};
-
-//! Helper metafunction to define a \c avl_set_member_hook that yields to the same
-//! type when the same options (either explicitly or implicitly) are used.
-#if defined(BOOST_INTRUSIVE_DOXYGEN_INVOKED) || defined(BOOST_INTRUSIVE_VARIADIC_TEMPLATES)
-template<class ...Options>
-#else
-template<class O1 = void, class O2 = void, class O3 = void, class O4 = void>
-#endif
-struct make_avl_set_member_hook
-{
-   /// @cond
-   typedef typename pack_options
-      #if !defined(BOOST_INTRUSIVE_VARIADIC_TEMPLATES)
-      <hook_defaults, O1, O2, O3, O4>
-      #else
-      <hook_defaults, Options...>
-      #endif
-      ::type packed_options;
-
-   typedef generic_hook
-   < AvlTreeAlgorithms
-   , avltree_node_traits<typename packed_options::void_pointer, packed_options::optimize_size>
-   , member_tag
-   , packed_options::link_mode
-   , NoBaseHookId
-   > implementation_defined;
-   /// @endcond
-   typedef implementation_defined type;
-};
-
-//! Put a public data member avl_set_member_hook in order to store objects of this class in
-//! an avl_set/avl_multiset. avl_set_member_hook holds the data necessary for maintaining the
-//! avl_set/avl_multiset and provides an appropriate value_traits class for avl_set/avl_multiset.
-//!
-//! The hook admits the following options: \c void_pointer<>,
-//! \c link_mode<> and \c optimize_size<>.
-//!
-//! \c void_pointer<> is the pointer type that will be used internally in the hook
-//! and the container configured to use this hook.
-//!
-//! \c link_mode<> will specify the linking mode of the hook (\c normal_link,
-//! \c auto_unlink or \c safe_link).
-//!
-//! \c optimize_size<> will tell the hook to optimize the hook for size instead
-//! of speed.
-#if defined(BOOST_INTRUSIVE_DOXYGEN_INVOKED) || defined(BOOST_INTRUSIVE_VARIADIC_TEMPLATES)
-template<class ...Options>
-#else
-template<class O1, class O2, class O3, class O4>
-#endif
-class avl_set_member_hook
-   :  public make_avl_set_member_hook
-      #if !defined(BOOST_INTRUSIVE_VARIADIC_TEMPLATES)
-      <O1, O2, O3, O4>
-      #else
-      <Options...>
-      #endif
-      ::type
-{
-   #if defined(BOOST_INTRUSIVE_DOXYGEN_INVOKED)
-   public:
-   //! <b>Effects</b>: If link_mode is \c auto_unlink or \c safe_link
-   //!   initializes the node to an unlinked state.
-   //!
-   //! <b>Throws</b>: Nothing.
-   avl_set_member_hook();
-
-   //! <b>Effects</b>: If link_mode is \c auto_unlink or \c safe_link
-   //!   initializes the node to an unlinked state. The argument is ignored.
-   //!
-   //! <b>Throws</b>: Nothing.
-   //!
-   //! <b>Rationale</b>: Providing a copy-constructor
-   //!   makes classes using the hook STL-compliant without forcing the
-   //!   user to do some additional work. \c swap can be used to emulate
-   //!   move-semantics.
-   avl_set_member_hook(const avl_set_member_hook& );
-
-   //! <b>Effects</b>: Empty function. The argument is ignored.
-   //!
-   //! <b>Throws</b>: Nothing.
-   //!
-   //! <b>Rationale</b>: Providing an assignment operator
-   //!   makes classes using the hook STL-compliant without forcing the
-   //!   user to do some additional work. \c swap can be used to emulate
-   //!   move-semantics.
-   avl_set_member_hook& operator=(const avl_set_member_hook& );
-
-   //! <b>Effects</b>: If link_mode is \c normal_link, the destructor does
-   //!   nothing (ie. no code is generated). If link_mode is \c safe_link and the
-   //!   object is stored in a set an assertion is raised. If link_mode is
-   //!   \c auto_unlink and \c is_linked() is true, the node is unlinked.
-   //!
-   //! <b>Throws</b>: Nothing.
-   ~avl_set_member_hook();
-
-   //! <b>Effects</b>: Swapping two nodes swaps the position of the elements
-   //!   related to those nodes in one or two containers. That is, if the node
-   //!   this is part of the element e1, the node x is part of the element e2
-   //!   and both elements are included in the containers s1 and s2, then after
-   //!   the swap-operation e1 is in s2 at the position of e2 and e2 is in s1
-   //!   at the position of e1. If one element is not in a container, then
-   //!   after the swap-operation the other element is not in a container.
-   //!   Iterators to e1 and e2 related to those nodes are invalidated.
-   //!
-   //! <b>Complexity</b>: Constant
-   //!
-   //! <b>Throws</b>: Nothing.
-   void swap_nodes(avl_set_member_hook &other);
-
-   //! <b>Precondition</b>: link_mode must be \c safe_link or \c auto_unlink.
-   //!
-   //! <b>Returns</b>: true, if the node belongs to a container, false
-   //!   otherwise. This function can be used to test whether \c set::iterator_to
-   //!   will return a valid iterator.
-   //!
-   //! <b>Complexity</b>: Constant
-   bool is_linked() const;
-
-   //! <b>Effects</b>: Removes the node if it's inserted in a container.
-   //!   This function is only allowed if link_mode is \c auto_unlink.
-   //!
-   //! <b>Throws</b>: Nothing.
-   void unlink();
-   #endif
-};
-
-} //namespace intrusive
-} //namespace boost
-
-#include <boost/intrusive/detail/config_end.hpp>
-
-#endif //BOOST_INTRUSIVE_AVL_SET_HOOK_HPP
diff --git a/src/boost/intrusive/avltree.hpp b/src/boost/intrusive/avltree.hpp
deleted file mode 100644
index 747d41cc..00000000
--- a/src/boost/intrusive/avltree.hpp
+++ /dev/null
@@ -1,588 +0,0 @@
-/////////////////////////////////////////////////////////////////////////////
-//
-// (C) Copyright Ion Gaztanaga 2007-2013
-//
-// Distributed under the Boost 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/intrusive for documentation.
-//
-/////////////////////////////////////////////////////////////////////////////
-#ifndef BOOST_INTRUSIVE_AVLTREE_HPP
-#define BOOST_INTRUSIVE_AVLTREE_HPP
-
-#include <boost/intrusive/detail/config_begin.hpp>
-#include <boost/intrusive/intrusive_fwd.hpp>
-#include <cstddef>
-#include <boost/intrusive/detail/minimal_less_equal_header.hpp>
-#include <boost/intrusive/detail/minimal_pair_header.hpp>
-
-#include <boost/static_assert.hpp>
-#include <boost/intrusive/avl_set_hook.hpp>
-#include <boost/intrusive/detail/avltree_node.hpp>
-#include <boost/intrusive/bstree.hpp>
-#include <boost/intrusive/detail/tree_node.hpp>
-#include <boost/intrusive/detail/ebo_functor_holder.hpp>
-#include <boost/intrusive/detail/mpl.hpp>
-#include <boost/intrusive/pointer_traits.hpp>
-#include <boost/intrusive/detail/get_value_traits.hpp>
-#include <boost/intrusive/avltree_algorithms.hpp>
-#include <boost/intrusive/link_mode.hpp>
-#include <boost/move/utility_core.hpp>
-
-#if defined(BOOST_HAS_PRAGMA_ONCE)
-#  pragma once
-#endif
-
-namespace boost {
-namespace intrusive {
-
-/// @cond
-
-struct default_avltree_hook_applier
-{  template <class T> struct apply{ typedef typename T::default_avltree_hook type;  };  };
-
-template<>
-struct is_default_hook_tag<default_avltree_hook_applier>
-{  static const bool value = true;  };
-
-struct avltree_defaults
-   : bstree_defaults
-{
-   typedef default_avltree_hook_applier proto_value_traits;
-};
-
-/// @endcond
-
-//! The class template avltree is an intrusive AVL tree container, that
-//! is used to construct intrusive avl_set and avl_multiset containers.
-//! The no-throw guarantee holds only, if the key_compare object
-//! doesn't throw.
-//!
-//! The template parameter \c T is the type to be managed by the container.
-//! The user can specify additional options and if no options are provided
-//! default options are used.
-//!
-//! The container supports the following options:
-//! \c base_hook<>/member_hook<>/value_traits<>,
-//! \c constant_time_size<>, \c size_type<> and
-//! \c compare<>.
-#if defined(BOOST_INTRUSIVE_DOXYGEN_INVOKED)
-template<class T, class ...Options>
-#else
-template<class ValueTraits, class VoidOrKeyOfValue, class VoidOrKeyComp, class SizeType, bool ConstantTimeSize, typename HeaderHolder>
-#endif
-class avltree_impl
-   /// @cond
-   :  public bstree_impl<ValueTraits, VoidOrKeyOfValue, VoidOrKeyComp, SizeType, ConstantTimeSize, AvlTreeAlgorithms, HeaderHolder>
-   /// @endcond
-{
-   public:
-   typedef ValueTraits value_traits;
-   /// @cond
-   typedef bstree_impl< ValueTraits, VoidOrKeyOfValue, VoidOrKeyComp, SizeType
-                      , ConstantTimeSize, AvlTreeAlgorithms
-                      , HeaderHolder>                                tree_type;
-   typedef tree_type                                                 implementation_defined;
-   /// @endcond
-
-   typedef typename implementation_defined::pointer                  pointer;
-   typedef typename implementation_defined::const_pointer            const_pointer;
-   typedef typename implementation_defined::value_type               value_type;
-   typedef typename implementation_defined::key_type                 key_type;
-   typedef typename implementation_defined::key_of_value             key_of_value;
-   typedef typename implementation_defined::reference                reference;
-   typedef typename implementation_defined::const_reference          const_reference;
-   typedef typename implementation_defined::difference_type          difference_type;
-   typedef typename implementation_defined::size_type                size_type;
-   typedef typename implementation_defined::value_compare            value_compare;
-   typedef typename implementation_defined::key_compare              key_compare;
-   typedef typename implementation_defined::iterator                 iterator;
-   typedef typename implementation_defined::const_iterator           const_iterator;
-   typedef typename implementation_defined::reverse_iterator         reverse_iterator;
-   typedef typename implementation_defined::const_reverse_iterator   const_reverse_iterator;
-   typedef typename implementation_defined::node_traits              node_traits;
-   typedef typename implementation_defined::node                     node;
-   typedef typename implementation_defined::node_ptr                 node_ptr;
-   typedef typename implementation_defined::const_node_ptr           const_node_ptr;
-   typedef typename implementation_defined::node_algorithms          node_algorithms;
-
-   static const bool constant_time_size = implementation_defined::constant_time_size;
-   /// @cond
-   private:
-
-   //noncopyable
-   BOOST_MOVABLE_BUT_NOT_COPYABLE(avltree_impl)
-
-   /// @endcond
-
-   public:
-
-   typedef typename implementation_defined::insert_commit_data insert_commit_data;
-
-   //! @copydoc ::boost::intrusive::bstree::bstree()
-   avltree_impl()
-      :  tree_type()
-   {}
-
-   //! @copydoc ::boost::intrusive::bstree::bstree(const key_compare &,const value_traits &)
-   explicit avltree_impl( const key_compare &cmp, const value_traits &v_traits = value_traits())
-      :  tree_type(cmp, v_traits)
-   {}
-
-   //! @copydoc ::boost::intrusive::bstree::bstree(bool,Iterator,Iterator,const key_compare &,const value_traits &)
-   template<class Iterator>
-   avltree_impl( bool unique, Iterator b, Iterator e
-              , const key_compare &cmp     = key_compare()
-              , const value_traits &v_traits = value_traits())
-      : tree_type(unique, b, e, cmp, v_traits)
-   {}
-
-   //! @copydoc ::boost::intrusive::bstree::bstree(bstree &&)
-   avltree_impl(BOOST_RV_REF(avltree_impl) x)
-      :  tree_type(BOOST_MOVE_BASE(tree_type, x))
-   {}
-
-   //! @copydoc ::boost::intrusive::bstree::operator=(bstree &&)
-   avltree_impl& operator=(BOOST_RV_REF(avltree_impl) x)
-   {  return static_cast<avltree_impl&>(tree_type::operator=(BOOST_MOVE_BASE(tree_type, x))); }
-
-   #ifdef BOOST_INTRUSIVE_DOXYGEN_INVOKED
-
-   //! @copydoc ::boost::intrusive::bstree::~bstree()
-   ~avltree_impl();
-
-   //! @copydoc ::boost::intrusive::bstree::begin()
-   iterator begin() BOOST_NOEXCEPT;
-
-   //! @copydoc ::boost::intrusive::bstree::begin()const
-   const_iterator begin() const BOOST_NOEXCEPT;
-
-   //! @copydoc ::boost::intrusive::bstree::cbegin()const
-   const_iterator cbegin() const BOOST_NOEXCEPT;
-
-   //! @copydoc ::boost::intrusive::bstree::end()
-   iterator end() BOOST_NOEXCEPT;
-
-   //! @copydoc ::boost::intrusive::bstree::end()const
-   const_iterator end() const BOOST_NOEXCEPT;
-
-   //! @copydoc ::boost::intrusive::bstree::cend()const
-   const_iterator cend() const BOOST_NOEXCEPT;
-
-   //! @copydoc ::boost::intrusive::bstree::rbegin()
-   reverse_iterator rbegin() BOOST_NOEXCEPT;
-
-   //! @copydoc ::boost::intrusive::bstree::rbegin()const
-   const_reverse_iterator rbegin() const BOOST_NOEXCEPT;
-
-   //! @copydoc ::boost::intrusive::bstree::crbegin()const
-   const_reverse_iterator crbegin() const BOOST_NOEXCEPT;
-
-   //! @copydoc ::boost::intrusive::bstree::rend()
-   reverse_iterator rend() BOOST_NOEXCEPT;
-
-   //! @copydoc ::boost::intrusive::bstree::rend()const
-   const_reverse_iterator rend() const BOOST_NOEXCEPT;
-
-   //! @copydoc ::boost::intrusive::bstree::crend()const
-   const_reverse_iterator crend() const BOOST_NOEXCEPT;
-
-   //! @copydoc ::boost::intrusive::bstree::root()
-   iterator root() BOOST_NOEXCEPT;
-
-   //! @copydoc ::boost::intrusive::bstree::root()const
-   const_iterator root() const BOOST_NOEXCEPT;
-
-   //! @copydoc ::boost::intrusive::bstree::croot()const
-   const_iterator croot() const BOOST_NOEXCEPT;
-
-   //! @copydoc ::boost::intrusive::bstree::container_from_end_iterator(iterator)
-   static avltree_impl &container_from_end_iterator(iterator end_iterator) BOOST_NOEXCEPT;
-
-   //! @copydoc ::boost::intrusive::bstree::container_from_end_iterator(const_iterator)
-   static const avltree_impl &container_from_end_iterator(const_iterator end_iterator) BOOST_NOEXCEPT;
-
-   //! @copydoc ::boost::intrusive::bstree::container_from_iterator(iterator)
-   static avltree_impl &container_from_iterator(iterator it) BOOST_NOEXCEPT;
-
-   //! @copydoc ::boost::intrusive::bstree::container_from_iterator(const_iterator)
-   static const avltree_impl &container_from_iterator(const_iterator it) BOOST_NOEXCEPT;
-
-   //! @copydoc ::boost::intrusive::bstree::key_comp()const
-   key_compare key_comp() const;
-
-   //! @copydoc ::boost::intrusive::bstree::value_comp()const
-   value_compare value_comp() const;
-
-   //! @copydoc ::boost::intrusive::bstree::empty()const
-   bool empty() const BOOST_NOEXCEPT;
-
-   //! @copydoc ::boost::intrusive::bstree::size()const
-   size_type size() const BOOST_NOEXCEPT;
-
-   //! @copydoc ::boost::intrusive::bstree::swap
-   void swap(avltree_impl& other);
-
-   //! @copydoc ::boost::intrusive::bstree::clone_from(const bstree&,Cloner,Disposer)
-   template <class Cloner, class Disposer>
-   void clone_from(const avltree_impl &src, Cloner cloner, Disposer disposer);
-
-   #else //BOOST_INTRUSIVE_DOXYGEN_INVOKED
-
-   using tree_type::clone_from;
-
-   #endif   //#ifdef BOOST_INTRUSIVE_DOXYGEN_INVOKED
-
-   //! @copydoc ::boost::intrusive::bstree::clone_from(bstree&&,Cloner,Disposer)
-   template <class Cloner, class Disposer>
-   void clone_from(BOOST_RV_REF(avltree_impl) src, Cloner cloner, Disposer disposer)
-   {  tree_type::clone_from(BOOST_MOVE_BASE(tree_type, src), cloner, disposer);  }
-
-   #ifdef BOOST_INTRUSIVE_DOXYGEN_INVOKED
-
-   //! @copydoc ::boost::intrusive::bstree::insert_equal(reference)
-   iterator insert_equal(reference value);
-
-   //! @copydoc ::boost::intrusive::bstree::insert_equal(const_iterator,reference)
-   iterator insert_equal(const_iterator hint, reference value);
-
-   //! @copydoc ::boost::intrusive::bstree::insert_equal(Iterator,Iterator)
-   template<class Iterator>
-   void insert_equal(Iterator b, Iterator e);
-
-   //! @copydoc ::boost::intrusive::bstree::insert_unique(reference)
-   std::pair<iterator, bool> insert_unique(reference value);
-
-   //! @copydoc ::boost::intrusive::bstree::insert_unique(const_iterator,reference)
-   iterator insert_unique(const_iterator hint, reference value);
-
-   //! @copydoc ::boost::intrusive::bstree::insert_unique_check(const KeyType&,KeyTypeKeyCompare,insert_commit_data&)
-   template<class KeyType, class KeyTypeKeyCompare>
-   std::pair<iterator, bool> insert_unique_check
-      (const KeyType &key, KeyTypeKeyCompare comp, insert_commit_data &commit_data);
-
-   //! @copydoc ::boost::intrusive::bstree::insert_unique_check(const_iterator,const KeyType&,KeyTypeKeyCompare,insert_commit_data&)
-   template<class KeyType, class KeyTypeKeyCompare>
-   std::pair<iterator, bool> insert_unique_check
-      (const_iterator hint, const KeyType &key
-      ,KeyTypeKeyCompare comp, insert_commit_data &commit_data);
-
-   //! @copydoc ::boost::intrusive::bstree::insert_unique_check(const key_type&,insert_commit_data&)
-   std::pair<iterator, bool> insert_unique_check
-      (const key_type &key, insert_commit_data &commit_data);
-
-   //! @copydoc ::boost::intrusive::bstree::insert_unique_check(const_iterator,const key_type&,insert_commit_data&)
-   std::pair<iterator, bool> insert_unique_check
-      (const_iterator hint, const key_type &key, insert_commit_data &commit_data);
-
-   //! @copydoc ::boost::intrusive::bstree::insert_unique_commit
-   iterator insert_unique_commit(reference value, const insert_commit_data &commit_data) BOOST_NOEXCEPT;
-
-   //! @copydoc ::boost::intrusive::bstree::insert_unique(Iterator,Iterator)
-   template<class Iterator>
-   void insert_unique(Iterator b, Iterator e);
-
-   //! @copydoc ::boost::intrusive::bstree::insert_before
-   iterator insert_before(const_iterator pos, reference value) BOOST_NOEXCEPT;
-
-   //! @copydoc ::boost::intrusive::bstree::push_back
-   void push_back(reference value) BOOST_NOEXCEPT;
-
-   //! @copydoc ::boost::intrusive::bstree::push_front
-   void push_front(reference value) BOOST_NOEXCEPT;
-
-   //! @copydoc ::boost::intrusive::bstree::erase(const_iterator)
-   iterator erase(const_iterator i) BOOST_NOEXCEPT;
-
-   //! @copydoc ::boost::intrusive::bstree::erase(const_iterator,const_iterator)
-   iterator erase(const_iterator b, const_iterator e) BOOST_NOEXCEPT;
-
-   //! @copydoc ::boost::intrusive::bstree::erase(const key_type &)
-   size_type erase(const key_type &key);
-
-   //! @copydoc ::boost::intrusive::bstree::erase(const KeyType&,KeyTypeKeyCompare)
-   template<class KeyType, class KeyTypeKeyCompare>
-   size_type erase(const KeyType& key, KeyTypeKeyCompare comp);
-
-   //! @copydoc ::boost::intrusive::bstree::erase_and_dispose(const_iterator,Disposer)
-   template<class Disposer>
-   iterator erase_and_dispose(const_iterator i, Disposer disposer) BOOST_NOEXCEPT;
-
-   //! @copydoc ::boost::intrusive::bstree::erase_and_dispose(const_iterator,const_iterator,Disposer)
-   template<class Disposer>
-   iterator erase_and_dispose(const_iterator b, const_iterator e, Disposer disposer) BOOST_NOEXCEPT;
-
-   //! @copydoc ::boost::intrusive::bstree::erase_and_dispose(const key_type &, Disposer)
-   template<class Disposer>
-   size_type erase_and_dispose(const key_type &key, Disposer disposer);
-
-   //! @copydoc ::boost::intrusive::bstree::erase_and_dispose(const KeyType&,KeyTypeKeyCompare,Disposer)
-   template<class KeyType, class KeyTypeKeyCompare, class Disposer>
-   size_type erase_and_dispose(const KeyType& key, KeyTypeKeyCompare comp, Disposer disposer);
-
-   //! @copydoc ::boost::intrusive::bstree::clear
-   void clear() BOOST_NOEXCEPT;
-
-   //! @copydoc ::boost::intrusive::bstree::clear_and_dispose
-   template<class Disposer>
-   void clear_and_dispose(Disposer disposer) BOOST_NOEXCEPT;
-
-   //! @copydoc ::boost::intrusive::bstree::count(const key_type &ke)const
-   size_type count(const key_type &key) const;
-
-   //! @copydoc ::boost::intrusive::bstree::count(const KeyType&,KeyTypeKeyCompare)const
-   template<class KeyType, class KeyTypeKeyCompare>
-   size_type count(const KeyType& key, KeyTypeKeyCompare comp) const;
-
-   //! @copydoc ::boost::intrusive::bstree::lower_bound(const key_type &)
-   iterator lower_bound(const key_type &key);
-
-   //! @copydoc ::boost::intrusive::bstree::lower_bound(const KeyType&,KeyTypeKeyCompare)
-   template<class KeyType, class KeyTypeKeyCompare>
-   iterator lower_bound(const KeyType& key, KeyTypeKeyCompare comp);
-
-   //! @copydoc ::boost::intrusive::bstree::lower_bound(const key_type &)const
-   const_iterator lower_bound(const key_type &key) const;
-
-   //! @copydoc ::boost::intrusive::bstree::lower_bound(const KeyType&,KeyTypeKeyCompare)const
-   template<class KeyType, class KeyTypeKeyCompare>
-   const_iterator lower_bound(const KeyType& key, KeyTypeKeyCompare comp) const;
-
-   //! @copydoc ::boost::intrusive::bstree::upper_bound(const key_type &key)
-   iterator upper_bound(const key_type &key);
-
-   //! @copydoc ::boost::intrusive::bstree::upper_bound(const KeyType&,KeyTypeKeyCompare)
-   template<class KeyType, class KeyTypeKeyCompare>
-   iterator upper_bound(const KeyType& key, KeyTypeKeyCompare comp);
-
-   //! @copydoc ::boost::intrusive::bstree::upper_bound(const key_type &)const
-   const_iterator upper_bound(const key_type &key) const;
-
-   //! @copydoc ::boost::intrusive::bstree::upper_bound(const KeyType&,KeyTypeKeyCompare)const
-   template<class KeyType, class KeyTypeKeyCompare>
-   const_iterator upper_bound(const KeyType& key, KeyTypeKeyCompare comp) const;
-
-   //! @copydoc ::boost::intrusive::bstree::find(const key_type &)
-   iterator find(const key_type &key);
-
-   //! @copydoc ::boost::intrusive::bstree::find(const KeyType&,KeyTypeKeyCompare)
-   template<class KeyType, class KeyTypeKeyCompare>
-   iterator find(const KeyType& key, KeyTypeKeyCompare comp);
-
-   //! @copydoc ::boost::intrusive::bstree::find(const key_type &)const
-   const_iterator find(const key_type &key) const;
-
-   //! @copydoc ::boost::intrusive::bstree::find(const KeyType&,KeyTypeKeyCompare)const
-   template<class KeyType, class KeyTypeKeyCompare>
-   const_iterator find(const KeyType& key, KeyTypeKeyCompare comp) const;
-
-   //! @copydoc ::boost::intrusive::bstree::equal_range(const key_type &)
-   std::pair<iterator,iterator> equal_range(const key_type &key);
-
-   //! @copydoc ::boost::intrusive::bstree::equal_range(const KeyType&,KeyTypeKeyCompare)
-   template<class KeyType, class KeyTypeKeyCompare>
-   std::pair<iterator,iterator> equal_range(const KeyType& key, KeyTypeKeyCompare comp);
-
-   //! @copydoc ::boost::intrusive::bstree::equal_range(const key_type &)const
-   std::pair<const_iterator, const_iterator>
-      equal_range(const key_type &key) const;
-
-   //! @copydoc ::boost::intrusive::bstree::equal_range(const KeyType&,KeyTypeKeyCompare)const
-   template<class KeyType, class KeyTypeKeyCompare>
-   std::pair<const_iterator, const_iterator>
-      equal_range(const KeyType& key, KeyTypeKeyCompare comp) const;
-
-   //! @copydoc ::boost::intrusive::bstree::bounded_range(const key_type &,const key_type &,bool,bool)
-   std::pair<iterator,iterator> bounded_range
-      (const key_type &lower, const key_type &upper_key, bool left_closed, bool right_closed);
-
-   //! @copydoc ::boost::intrusive::bstree::bounded_range(const KeyType&,const KeyType&,KeyTypeKeyCompare,bool,bool)
-   template<class KeyType, class KeyTypeKeyCompare>
-   std::pair<iterator,iterator> bounded_range
-      (const KeyType& lower_key, const KeyType& upper_key, KeyTypeKeyCompare comp, bool left_closed, bool right_closed);
-
-   //! @copydoc ::boost::intrusive::bstree::bounded_range(const key_type &,const key_type &,bool,bool)const
-   std::pair<const_iterator, const_iterator>
-      bounded_range(const key_type &lower_key, const key_type &upper_key, bool left_closed, bool right_closed) const;
-
-   //! @copydoc ::boost::intrusive::bstree::bounded_range(const KeyType&,const KeyType&,KeyTypeKeyCompare,bool,bool)const
-   template<class KeyType, class KeyTypeKeyCompare>
-   std::pair<const_iterator, const_iterator> bounded_range
-         (const KeyType& lower_key, const KeyType& upper_key, KeyTypeKeyCompare comp, bool left_closed, bool right_closed) const;
-
-   //! @copydoc ::boost::intrusive::bstree::s_iterator_to(reference)
-   static iterator s_iterator_to(reference value) BOOST_NOEXCEPT;
-
-   //! @copydoc ::boost::intrusive::bstree::s_iterator_to(const_reference)
-   static const_iterator s_iterator_to(const_reference value) BOOST_NOEXCEPT;
-
-   //! @copydoc ::boost::intrusive::bstree::iterator_to(reference)
-   iterator iterator_to(reference value) BOOST_NOEXCEPT;
-
-   //! @copydoc ::boost::intrusive::bstree::iterator_to(const_reference)const
-   const_iterator iterator_to(const_reference value) const BOOST_NOEXCEPT;
-
-   //! @copydoc ::boost::intrusive::bstree::init_node(reference)
-   static void init_node(reference value) BOOST_NOEXCEPT;
-
-   //! @copydoc ::boost::intrusive::bstree::unlink_leftmost_without_rebalance
-   pointer unlink_leftmost_without_rebalance() BOOST_NOEXCEPT;
-
-   //! @copydoc ::boost::intrusive::bstree::replace_node
-   void replace_node(iterator replace_this, reference with_this) BOOST_NOEXCEPT;
-
-   //! @copydoc ::boost::intrusive::bstree::remove_node
-   void remove_node(reference value) BOOST_NOEXCEPT;
-
-   //! @copydoc ::boost::intrusive::bstree::merge_unique(bstree<T, Options2...>&)
-   template<class T, class ...Options2>
-   void merge_unique(avltree<T, Options2...> &);
-
-   //! @copydoc ::boost::intrusive::bstree::merge_equal(bstree<T, Options2...>&)
-   template<class T, class ...Options2>
-   void merge_equal(avltree<T, Options2...> &);
-
-   friend bool operator< (const avltree_impl &x, const avltree_impl &y);
-
-   friend bool operator==(const avltree_impl &x, const avltree_impl &y);
-
-   friend bool operator!= (const avltree_impl &x, const avltree_impl &y);
-
-   friend bool operator>(const avltree_impl &x, const avltree_impl &y);
-
-   friend bool operator<=(const avltree_impl &x, const avltree_impl &y);
-
-   friend bool operator>=(const avltree_impl &x, const avltree_impl &y);
-
-   friend void swap(avltree_impl &x, avltree_impl &y);
-   #endif   //#ifdef BOOST_INTRUSIVE_DOXYGEN_INVOKED
-};
-
-
-//! Helper metafunction to define a \c avltree that yields to the same type when the
-//! same options (either explicitly or implicitly) are used.
-#if defined(BOOST_INTRUSIVE_DOXYGEN_INVOKED) || defined(BOOST_INTRUSIVE_VARIADIC_TEMPLATES)
-template<class T, class ...Options>
-#else
-template<class T, class O1 = void, class O2 = void
-                , class O3 = void, class O4 = void
-                , class O5 = void, class O6 = void>
-#endif
-struct make_avltree
-{
-   /// @cond
-   typedef typename pack_options
-      < avltree_defaults,
-      #if !defined(BOOST_INTRUSIVE_VARIADIC_TEMPLATES)
-      O1, O2, O3, O4, O5, O6
-      #else
-      Options...
-      #endif
-      >::type packed_options;
-
-   typedef typename detail::get_value_traits
-      <T, typename packed_options::proto_value_traits>::type value_traits;
-
-   typedef avltree_impl
-         < value_traits
-         , typename packed_options::key_of_value
-         , typename packed_options::compare
-         , typename packed_options::size_type
-         , packed_options::constant_time_size
-         , typename packed_options::header_holder_type
-         > implementation_defined;
-   /// @endcond
-   typedef implementation_defined type;
-};
-
-
-#ifndef BOOST_INTRUSIVE_DOXYGEN_INVOKED
-
-#if !defined(BOOST_INTRUSIVE_VARIADIC_TEMPLATES)
-template<class T, class O1, class O2, class O3, class O4, class O5, class O6>
-#else
-template<class T, class ...Options>
-#endif
-class avltree
-   :  public make_avltree<T,
-      #if !defined(BOOST_INTRUSIVE_VARIADIC_TEMPLATES)
-      O1, O2, O3, O4, O5, O6
-      #else
-      Options...
-      #endif
-      >::type
-{
-   typedef typename make_avltree
-      <T,
-      #if !defined(BOOST_INTRUSIVE_VARIADIC_TEMPLATES)
-      O1, O2, O3, O4, O5, O6
-      #else
-      Options...
-      #endif
-      >::type   Base;
-   BOOST_MOVABLE_BUT_NOT_COPYABLE(avltree)
-
-   public:
-   typedef typename Base::key_compare        key_compare;
-   typedef typename Base::value_traits       value_traits;
-   typedef typename Base::iterator           iterator;
-   typedef typename Base::const_iterator     const_iterator;
-   typedef typename Base::reverse_iterator           reverse_iterator;
-   typedef typename Base::const_reverse_iterator     const_reverse_iterator;
-
-   //Assert if passed value traits are compatible with the type
-   BOOST_STATIC_ASSERT((detail::is_same<typename value_traits::value_type, T>::value));
-
-   BOOST_INTRUSIVE_FORCEINLINE avltree()
-      :  Base()
-   {}
-
-   BOOST_INTRUSIVE_FORCEINLINE explicit avltree( const key_compare &cmp, const value_traits &v_traits = value_traits())
-      :  Base(cmp, v_traits)
-   {}
-
-   template<class Iterator>
-   BOOST_INTRUSIVE_FORCEINLINE avltree( bool unique, Iterator b, Iterator e
-         , const key_compare &cmp = key_compare()
-         , const value_traits &v_traits = value_traits())
-      :  Base(unique, b, e, cmp, v_traits)
-   {}
-
-   BOOST_INTRUSIVE_FORCEINLINE avltree(BOOST_RV_REF(avltree) x)
-      :  Base(BOOST_MOVE_BASE(Base, x))
-   {}
-
-   BOOST_INTRUSIVE_FORCEINLINE avltree& operator=(BOOST_RV_REF(avltree) x)
-   {  return static_cast<avltree &>(this->Base::operator=(BOOST_MOVE_BASE(Base, x)));  }
-
-   template <class Cloner, class Disposer>
-   BOOST_INTRUSIVE_FORCEINLINE void clone_from(const avltree &src, Cloner cloner, Disposer disposer)
-   {  Base::clone_from(src, cloner, disposer);  }
-
-   template <class Cloner, class Disposer>
-   BOOST_INTRUSIVE_FORCEINLINE void clone_from(BOOST_RV_REF(avltree) src, Cloner cloner, Disposer disposer)
-   {  Base::clone_from(BOOST_MOVE_BASE(Base, src), cloner, disposer);  }
-
-   BOOST_INTRUSIVE_FORCEINLINE static avltree &container_from_end_iterator(iterator end_iterator) BOOST_NOEXCEPT
-   {  return static_cast<avltree &>(Base::container_from_end_iterator(end_iterator));   }
-
-   BOOST_INTRUSIVE_FORCEINLINE static const avltree &container_from_end_iterator(const_iterator end_iterator) BOOST_NOEXCEPT
-   {  return static_cast<const avltree &>(Base::container_from_end_iterator(end_iterator));   }
-
-   BOOST_INTRUSIVE_FORCEINLINE static avltree &container_from_iterator(iterator it) BOOST_NOEXCEPT
-   {  return static_cast<avltree &>(Base::container_from_iterator(it));   }
-
-   BOOST_INTRUSIVE_FORCEINLINE static const avltree &container_from_iterator(const_iterator it) BOOST_NOEXCEPT
-   {  return static_cast<const avltree &>(Base::container_from_iterator(it));   }
-};
-
-#endif
-
-} //namespace intrusive
-} //namespace boost
-
-#include <boost/intrusive/detail/config_end.hpp>
-
-#endif //BOOST_INTRUSIVE_AVLTREE_HPP
diff --git a/src/boost/intrusive/avltree_algorithms.hpp b/src/boost/intrusive/avltree_algorithms.hpp
deleted file mode 100644
index 0fd158d5..00000000
--- a/src/boost/intrusive/avltree_algorithms.hpp
+++ /dev/null
@@ -1,727 +0,0 @@
-/////////////////////////////////////////////////////////////////////////////
-//
-// (C) Copyright Daniel K. O. 2005.
-// (C) Copyright Ion Gaztanaga 2007-2014
-//
-// Distributed under the Boost 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/intrusive for documentation.
-//
-/////////////////////////////////////////////////////////////////////////////
-
-#ifndef BOOST_INTRUSIVE_AVLTREE_ALGORITHMS_HPP
-#define BOOST_INTRUSIVE_AVLTREE_ALGORITHMS_HPP
-
-#include <boost/intrusive/detail/config_begin.hpp>
-#include <boost/intrusive/intrusive_fwd.hpp>
-
-#include <cstddef>
-
-#include <boost/intrusive/detail/assert.hpp>
-#include <boost/intrusive/detail/algo_type.hpp>
-#include <boost/intrusive/detail/ebo_functor_holder.hpp>
-#include <boost/intrusive/bstree_algorithms.hpp>
-
-#if defined(BOOST_HAS_PRAGMA_ONCE)
-#  pragma once
-#endif
-
-
-namespace boost {
-namespace intrusive {
-
-/// @cond
-
-template<class NodeTraits, class F>
-struct avltree_node_cloner
-   //Use public inheritance to avoid MSVC bugs with closures
-   :  public detail::ebo_functor_holder<F>
-{
-   typedef typename NodeTraits::node_ptr  node_ptr;
-   typedef detail::ebo_functor_holder<F>  base_t;
-
-   BOOST_INTRUSIVE_FORCEINLINE avltree_node_cloner(F f)
-      :  base_t(f)
-   {}
-
-   node_ptr operator()(node_ptr p)
-   {
-      node_ptr n = base_t::get()(p);
-      NodeTraits::set_balance(n, NodeTraits::get_balance(p));
-      return n;
-   }
-
-   node_ptr operator()(node_ptr p) const
-   {
-      node_ptr n = base_t::get()(p);
-      NodeTraits::set_balance(n, NodeTraits::get_balance(p));
-      return n;
-   }
-};
-
-namespace detail {
-
-template<class ValueTraits, class NodePtrCompare, class ExtraChecker>
-struct avltree_node_checker
-      : public bstree_node_checker<ValueTraits, NodePtrCompare, ExtraChecker>
-{
-   typedef bstree_node_checker<ValueTraits, NodePtrCompare, ExtraChecker> base_checker_t;
-   typedef ValueTraits                             value_traits;
-   typedef typename value_traits::node_traits      node_traits;
-   typedef typename node_traits::const_node_ptr    const_node_ptr;
-
-   struct return_type
-         : public base_checker_t::return_type
-   {
-      return_type() : height(0) {}
-      int height;
-   };
-
-   avltree_node_checker(const NodePtrCompare& comp, ExtraChecker extra_checker)
-      : base_checker_t(comp, extra_checker)
-   {}
-
-   void operator () (const_node_ptr p,
-                     const return_type& check_return_left, const return_type& check_return_right,
-                     return_type& check_return)
-   {
-      const int height_diff = check_return_right.height - check_return_left.height; (void)height_diff;
-      BOOST_INTRUSIVE_INVARIANT_ASSERT(
-         (height_diff == -1 && node_traits::get_balance(p) == node_traits::negative()) ||
-         (height_diff ==  0 && node_traits::get_balance(p) == node_traits::zero()) ||
-         (height_diff ==  1 && node_traits::get_balance(p) == node_traits::positive())
-      );
-      check_return.height = 1 +
-         (check_return_left.height > check_return_right.height ? check_return_left.height : check_return_right.height);
-      base_checker_t::operator()(p, check_return_left, check_return_right, check_return);
-   }
-};
-
-} // namespace detail
-
-/// @endcond
-
-//! avltree_algorithms is configured with a NodeTraits class, which encapsulates the
-//! information about the node to be manipulated. NodeTraits must support the
-//! following interface:
-//!
-//! <b>Typedefs</b>:
-//!
-//! <tt>node</tt>: The type of the node that forms the binary search tree
-//!
-//! <tt>node_ptr</tt>: A pointer to a node
-//!
-//! <tt>const_node_ptr</tt>: A pointer to a const node
-//!
-//! <tt>balance</tt>: The type of the balance factor
-//!
-//! <b>Static functions</b>:
-//!
-//! <tt>static node_ptr get_parent(const_node_ptr n);</tt>
-//!
-//! <tt>static void set_parent(node_ptr n, node_ptr parent);</tt>
-//!
-//! <tt>static node_ptr get_left(const_node_ptr n);</tt>
-//!
-//! <tt>static void set_left(node_ptr n, node_ptr left);</tt>
-//!
-//! <tt>static node_ptr get_right(const_node_ptr n);</tt>
-//!
-//! <tt>static void set_right(node_ptr n, node_ptr right);</tt>
-//!
-//! <tt>static balance get_balance(const_node_ptr n);</tt>
-//!
-//! <tt>static void set_balance(node_ptr n, balance b);</tt>
-//!
-//! <tt>static balance negative();</tt>
-//!
-//! <tt>static balance zero();</tt>
-//!
-//! <tt>static balance positive();</tt>
-template<class NodeTraits>
-class avltree_algorithms
-   #ifndef BOOST_INTRUSIVE_DOXYGEN_INVOKED
-   : public bstree_algorithms<NodeTraits>
-   #endif
-{
-   public:
-   typedef typename NodeTraits::node            node;
-   typedef NodeTraits                           node_traits;
-   typedef typename NodeTraits::node_ptr        node_ptr;
-   typedef typename NodeTraits::const_node_ptr  const_node_ptr;
-   typedef typename NodeTraits::balance         balance;
-
-   /// @cond
-   private:
-   typedef bstree_algorithms<NodeTraits>  bstree_algo;
-
-   /// @endcond
-
-   public:
-   //! This type is the information that will be
-   //! filled by insert_unique_check
-   typedef typename bstree_algo::insert_commit_data insert_commit_data;
-
-   #ifdef BOOST_INTRUSIVE_DOXYGEN_INVOKED
-
-   //! @copydoc ::boost::intrusive::bstree_algorithms::get_header(const_node_ptr)
-   static node_ptr get_header(const_node_ptr n) BOOST_NOEXCEPT;
-
-   //! @copydoc ::boost::intrusive::bstree_algorithms::begin_node
-   static node_ptr begin_node(const_node_ptr header) BOOST_NOEXCEPT;
-
-   //! @copydoc ::boost::intrusive::bstree_algorithms::end_node
-   static node_ptr end_node(const_node_ptr header) BOOST_NOEXCEPT;
-
-   //! @copydoc ::boost::intrusive::bstree_algorithms::swap_tree
-   static void swap_tree(node_ptr header1, node_ptr header2) BOOST_NOEXCEPT;
-
-   #endif   //#ifdef BOOST_INTRUSIVE_DOXYGEN_INVOKED
-
-   //! @copydoc ::boost::intrusive::bstree_algorithms::swap_nodes(node_ptr,node_ptr)
-   static void swap_nodes(node_ptr node1, node_ptr node2) BOOST_NOEXCEPT
-   {
-      if(node1 == node2)
-         return;
-
-      node_ptr header1(bstree_algo::get_header(node1)), header2(bstree_algo::get_header(node2));
-      swap_nodes(node1, header1, node2, header2);
-   }
-
-   //! @copydoc ::boost::intrusive::bstree_algorithms::swap_nodes(node_ptr,node_ptr,node_ptr,node_ptr)
-   static void swap_nodes(node_ptr node1, node_ptr header1, node_ptr node2, node_ptr header2) BOOST_NOEXCEPT
-   {
-      if(node1 == node2)   return;
-
-      bstree_algo::swap_nodes(node1, header1, node2, header2);
-      //Swap balance
-      balance c = NodeTraits::get_balance(node1);
-      NodeTraits::set_balance(node1, NodeTraits::get_balance(node2));
-      NodeTraits::set_balance(node2, c);
-   }
-
-   //! @copydoc ::boost::intrusive::bstree_algorithms::replace_node(node_ptr,node_ptr)
-   static void replace_node(node_ptr node_to_be_replaced, node_ptr new_node) BOOST_NOEXCEPT
-   {
-      if(node_to_be_replaced == new_node)
-         return;
-      replace_node(node_to_be_replaced, bstree_algo::get_header(node_to_be_replaced), new_node);
-   }
-
-   //! @copydoc ::boost::intrusive::bstree_algorithms::replace_node(node_ptr,node_ptr,node_ptr)
-   static void replace_node(node_ptr node_to_be_replaced, node_ptr header, node_ptr new_node) BOOST_NOEXCEPT
-   {
-      bstree_algo::replace_node(node_to_be_replaced, header, new_node);
-      NodeTraits::set_balance(new_node, NodeTraits::get_balance(node_to_be_replaced));
-   }
-
-   //! @copydoc ::boost::intrusive::bstree_algorithms::unlink(node_ptr)
-   static void unlink(node_ptr n) BOOST_NOEXCEPT
-   {
-      node_ptr x = NodeTraits::get_parent(n);
-      if(x){
-         while(!is_header(x))
-            x = NodeTraits::get_parent(x);
-         erase(x, n);
-      }
-   }
-
-   #ifdef BOOST_INTRUSIVE_DOXYGEN_INVOKED
-   //! @copydoc ::boost::intrusive::bstree_algorithms::unlink_leftmost_without_rebalance
-   static node_ptr unlink_leftmost_without_rebalance(node_ptr header) BOOST_NOEXCEPT;
-
-   //! @copydoc ::boost::intrusive::bstree_algorithms::unique(const_node_ptr)
-   static bool unique(const_node_ptr n) BOOST_NOEXCEPT;
-
-   //! @copydoc ::boost::intrusive::bstree_algorithms::size(const_node_ptr)
-   static std::size_t size(const_node_ptr header) BOOST_NOEXCEPT;
-
-   //! @copydoc ::boost::intrusive::bstree_algorithms::next_node(node_ptr)
-   static node_ptr next_node(node_ptr n) BOOST_NOEXCEPT;
-
-   //! @copydoc ::boost::intrusive::bstree_algorithms::prev_node(node_ptr)
-   static node_ptr prev_node(node_ptr n) BOOST_NOEXCEPT;
-
-   //! @copydoc ::boost::intrusive::bstree_algorithms::init(node_ptr)
-   static void init(node_ptr n) BOOST_NOEXCEPT;
-   #endif   //#ifdef BOOST_INTRUSIVE_DOXYGEN_INVOKED
-
-   //! <b>Requires</b>: header must not be part of any tree.
-   //!
-   //! <b>Effects</b>: Initializes the header to represent an empty tree.
-   //!   unique(header) == true.
-   //!
-   //! <b>Complexity</b>: Constant.
-   //!
-   //! <b>Throws</b>: Nothing.
-   //!
-   //! <b>Nodes</b>: If header is inserted in a tree, this function corrupts the tree.
-   static void init_header(node_ptr header) BOOST_NOEXCEPT
-   {
-      bstree_algo::init_header(header);
-      NodeTraits::set_balance(header, NodeTraits::zero());
-   }
-
-   //! @copydoc ::boost::intrusive::bstree_algorithms::erase(node_ptr,node_ptr)
-   static node_ptr erase(node_ptr header, node_ptr z) BOOST_NOEXCEPT
-   {
-      typename bstree_algo::data_for_rebalance info;
-      bstree_algo::erase(header, z, info);
-      rebalance_after_erasure(header, z, info);
-      return z;
-   }
-
-   //! @copydoc ::boost::intrusive::bstree_algorithms::transfer_unique
-   template<class NodePtrCompare>
-   static bool transfer_unique
-      (node_ptr header1, NodePtrCompare comp, node_ptr header2, node_ptr z)
-   {
-      typename bstree_algo::data_for_rebalance info;
-      bool const transferred = bstree_algo::transfer_unique(header1, comp, header2, z, info);
-      if(transferred){
-         rebalance_after_erasure(header2, z, info);
-         rebalance_after_insertion(header1, z);
-      }
-      return transferred;
-   }
-
-   //! @copydoc ::boost::intrusive::bstree_algorithms::transfer_equal
-   template<class NodePtrCompare>
-   static void transfer_equal
-      (node_ptr header1, NodePtrCompare comp, node_ptr header2, node_ptr z)
-   {
-      typename bstree_algo::data_for_rebalance info;
-      bstree_algo::transfer_equal(header1, comp, header2, z, info);
-      rebalance_after_erasure(header2, z, info);
-      rebalance_after_insertion(header1, z);
-   }
-
-   //! @copydoc ::boost::intrusive::bstree_algorithms::clone(const_node_ptr,node_ptr,Cloner,Disposer)
-   template <class Cloner, class Disposer>
-   static void clone
-      (const_node_ptr source_header, node_ptr target_header, Cloner cloner, Disposer disposer)
-   {
-      avltree_node_cloner<NodeTraits, Cloner> new_cloner(cloner);
-      bstree_algo::clone(source_header, target_header, new_cloner, disposer);
-   }
-
-   #ifdef BOOST_INTRUSIVE_DOXYGEN_INVOKED
-   //! @copydoc ::boost::intrusive::bstree_algorithms::clear_and_dispose(node_ptr,Disposer)
-   template<class Disposer>
-   static void clear_and_dispose(node_ptr header, Disposer disposer) BOOST_NOEXCEPT;
-
-   //! @copydoc ::boost::intrusive::bstree_algorithms::lower_bound(const_node_ptr,const KeyType&,KeyNodePtrCompare)
-   template<class KeyType, class KeyNodePtrCompare>
-   static node_ptr lower_bound
-      (const_node_ptr header, const KeyType &key, KeyNodePtrCompare comp);
-
-   //! @copydoc ::boost::intrusive::bstree_algorithms::upper_bound(const_node_ptr,const KeyType&,KeyNodePtrCompare)
-   template<class KeyType, class KeyNodePtrCompare>
-   static node_ptr upper_bound
-      (const_node_ptr header, const KeyType &key, KeyNodePtrCompare comp);
-
-   //! @copydoc ::boost::intrusive::bstree_algorithms::find(const_node_ptr,const KeyType&,KeyNodePtrCompare)
-   template<class KeyType, class KeyNodePtrCompare>
-   static node_ptr find
-      (const_node_ptr header, const KeyType &key, KeyNodePtrCompare comp);
-
-   //! @copydoc ::boost::intrusive::bstree_algorithms::equal_range(const_node_ptr,const KeyType&,KeyNodePtrCompare)
-   template<class KeyType, class KeyNodePtrCompare>
-   static std::pair<node_ptr, node_ptr> equal_range
-      (const_node_ptr header, const KeyType &key, KeyNodePtrCompare comp);
-
-   //! @copydoc ::boost::intrusive::bstree_algorithms::bounded_range(const_node_ptr,const KeyType&,const KeyType&,KeyNodePtrCompare,bool,bool)
-   template<class KeyType, class KeyNodePtrCompare>
-   static std::pair<node_ptr, node_ptr> bounded_range
-      (const_node_ptr header, const KeyType &lower_key, const KeyType &upper_key, KeyNodePtrCompare comp
-      , bool left_closed, bool right_closed);
-
-   //! @copydoc ::boost::intrusive::bstree_algorithms::count(const_node_ptr,const KeyType&,KeyNodePtrCompare)
-   template<class KeyType, class KeyNodePtrCompare>
-   static std::size_t count(const_node_ptr header, const KeyType &key, KeyNodePtrCompare comp);
-
-   #endif   //#ifdef BOOST_INTRUSIVE_DOXYGEN_INVOKED
-
-   //! @copydoc ::boost::intrusive::bstree_algorithms::insert_equal_upper_bound(node_ptr,node_ptr,NodePtrCompare)
-   template<class NodePtrCompare>
-   static node_ptr insert_equal_upper_bound
-      (node_ptr h, node_ptr new_node, NodePtrCompare comp)
-   {
-      bstree_algo::insert_equal_upper_bound(h, new_node, comp);
-      rebalance_after_insertion(h, new_node);
-      return new_node;
-   }
-
-   //! @copydoc ::boost::intrusive::bstree_algorithms::insert_equal_lower_bound(node_ptr,node_ptr,NodePtrCompare)
-   template<class NodePtrCompare>
-   static node_ptr insert_equal_lower_bound
-      (node_ptr h, node_ptr new_node, NodePtrCompare comp)
-   {
-      bstree_algo::insert_equal_lower_bound(h, new_node, comp);
-      rebalance_after_insertion(h, new_node);
-      return new_node;
-   }
-
-   //! @copydoc ::boost::intrusive::bstree_algorithms::insert_equal(node_ptr,node_ptr,node_ptr,NodePtrCompare)
-   template<class NodePtrCompare>
-   static node_ptr insert_equal
-      (node_ptr header, node_ptr hint, node_ptr new_node, NodePtrCompare comp)
-   {
-      bstree_algo::insert_equal(header, hint, new_node, comp);
-      rebalance_after_insertion(header, new_node);
-      return new_node;
-   }
-
-   //! @copydoc ::boost::intrusive::bstree_algorithms::insert_before(node_ptr,node_ptr,node_ptr)
-   static node_ptr insert_before
-      (node_ptr header, node_ptr pos, node_ptr new_node) BOOST_NOEXCEPT
-   {
-      bstree_algo::insert_before(header, pos, new_node);
-      rebalance_after_insertion(header, new_node);
-      return new_node;
-   }
-
-   //! @copydoc ::boost::intrusive::bstree_algorithms::push_back(node_ptr,node_ptr)
-   static void push_back(node_ptr header, node_ptr new_node) BOOST_NOEXCEPT
-   {
-      bstree_algo::push_back(header, new_node);
-      rebalance_after_insertion(header, new_node);
-   }
-
-   //! @copydoc ::boost::intrusive::bstree_algorithms::push_front(node_ptr,node_ptr)
-   static void push_front(node_ptr header, node_ptr new_node) BOOST_NOEXCEPT
-   {
-      bstree_algo::push_front(header, new_node);
-      rebalance_after_insertion(header, new_node);
-   }
-
-   #ifdef BOOST_INTRUSIVE_DOXYGEN_INVOKED
-   //! @copydoc ::boost::intrusive::bstree_algorithms::insert_unique_check(const_node_ptr,const KeyType&,KeyNodePtrCompare,insert_commit_data&)
-   template<class KeyType, class KeyNodePtrCompare>
-   static std::pair<node_ptr, bool> insert_unique_check
-      (const_node_ptr header,  const KeyType &key
-      ,KeyNodePtrCompare comp, insert_commit_data &commit_data);
-
-   //! @copydoc ::boost::intrusive::bstree_algorithms::insert_unique_check(const_node_ptr,node_ptr,const KeyType&,KeyNodePtrCompare,insert_commit_data&)
-   template<class KeyType, class KeyNodePtrCompare>
-   static std::pair<node_ptr, bool> insert_unique_check
-      (const_node_ptr header, node_ptr hint, const KeyType &key
-      ,KeyNodePtrCompare comp, insert_commit_data &commit_data);
-   #endif   //#ifdef BOOST_INTRUSIVE_DOXYGEN_INVOKED
-
-   //! @copydoc ::boost::intrusive::bstree_algorithms::insert_unique_commit(node_ptr,node_ptr,const insert_commit_data &)
-   static void insert_unique_commit
-      (node_ptr header, node_ptr new_value, const insert_commit_data &commit_data) BOOST_NOEXCEPT
-   {
-      bstree_algo::insert_unique_commit(header, new_value, commit_data);
-      rebalance_after_insertion(header, new_value);
-   }
-
-   //! @copydoc ::boost::intrusive::bstree_algorithms::is_header
-   static bool is_header(const_node_ptr p) BOOST_NOEXCEPT
-   {  return NodeTraits::get_balance(p) == NodeTraits::zero() && bstree_algo::is_header(p);  }
-
-
-   /// @cond
-   static bool verify(node_ptr header)
-   {
-      std::size_t height;
-      std::size_t count;
-      return verify_recursion(NodeTraits::get_parent(header), count, height);
-   }
-
-   private:
-
-   static bool verify_recursion(node_ptr n, std::size_t &count, std::size_t &height)
-   {
-      if (!n){
-         count = 0;
-         height = 0;
-         return true;
-      }
-      std::size_t leftcount, rightcount;
-      std::size_t leftheight, rightheight;
-      if(!verify_recursion(NodeTraits::get_left (n), leftcount,  leftheight) ||
-         !verify_recursion(NodeTraits::get_right(n), rightcount, rightheight) ){
-         return false;
-      }
-      count = 1u + leftcount + rightcount;
-      height = 1u + (leftheight > rightheight ? leftheight : rightheight);
-
-      //If equal height, balance must be zero
-      if(rightheight == leftheight){
-         if(NodeTraits::get_balance(n) != NodeTraits::zero()){
-            BOOST_ASSERT(0);
-            return false;
-         }
-      }
-      //If right is taller than left, then the difference must be at least 1 and the balance positive
-      else if(rightheight > leftheight){
-         if(rightheight - leftheight > 1 ){
-            BOOST_ASSERT(0);
-            return false;
-         }
-         else if(NodeTraits::get_balance(n) != NodeTraits::positive()){
-            BOOST_ASSERT(0);
-            return false;
-         }
-      }
-      //If left is taller than right, then the difference must be at least 1 and the balance negative
-      else{
-         if(leftheight - rightheight > 1 ){
-            BOOST_ASSERT(0);
-            return false;
-         }
-         else if(NodeTraits::get_balance(n) != NodeTraits::negative()){
-            BOOST_ASSERT(0);
-            return false;
-         }
-      }
-      return true;
-   }
-
-   static void rebalance_after_erasure
-      ( node_ptr header, node_ptr z, const typename bstree_algo::data_for_rebalance &info) BOOST_NOEXCEPT
-   {
-      if(info.y != z){
-         NodeTraits::set_balance(info.y, NodeTraits::get_balance(z));
-      }
-      //Rebalance avltree
-      rebalance_after_erasure_restore_invariants(header, info.x, info.x_parent);
-   }
-
-   static void rebalance_after_erasure_restore_invariants(node_ptr header, node_ptr x, node_ptr x_parent) BOOST_NOEXCEPT
-   {
-      for ( node_ptr root = NodeTraits::get_parent(header)
-          ; x != root
-          ; root = NodeTraits::get_parent(header), x_parent = NodeTraits::get_parent(x)) {
-         const balance x_parent_balance = NodeTraits::get_balance(x_parent);
-         //Don't cache x_is_leftchild or similar because x can be null and
-         //equal to both x_parent_left and x_parent_right
-         const node_ptr x_parent_left (NodeTraits::get_left(x_parent));
-         const node_ptr x_parent_right(NodeTraits::get_right(x_parent));
-
-         if(x_parent_balance == NodeTraits::zero()){
-            NodeTraits::set_balance( x_parent, x == x_parent_right ? NodeTraits::negative() : NodeTraits::positive() );
-            break;       // the height didn't change, let's stop here
-         }
-         else if(x_parent_balance == NodeTraits::negative()){
-            if (x == x_parent_left) {  ////x is left child or x and sibling are null
-               NodeTraits::set_balance(x_parent, NodeTraits::zero()); // balanced
-               x = x_parent;
-            }
-            else {
-               // x is right child (x_parent_left is the left child)
-               BOOST_INTRUSIVE_INVARIANT_ASSERT(x_parent_left);
-               if (NodeTraits::get_balance(x_parent_left) == NodeTraits::positive()) {
-                  // x_parent_left MUST have a right child
-                  BOOST_INTRUSIVE_INVARIANT_ASSERT(NodeTraits::get_right(x_parent_left));
-                  x = avl_rotate_left_right(x_parent, x_parent_left, header);
-               }
-               else {
-                  avl_rotate_right(x_parent, x_parent_left, header);
-                  x = x_parent_left;
-               }
-
-               // if changed from negative to NodeTraits::positive(), no need to check above
-               if (NodeTraits::get_balance(x) == NodeTraits::positive()){
-                  break;
-               }
-            }
-         }
-         else if(x_parent_balance == NodeTraits::positive()){
-            if (x == x_parent_right) { //x is right child or x and sibling are null
-               NodeTraits::set_balance(x_parent, NodeTraits::zero()); // balanced
-               x = x_parent;
-            }
-            else {
-               // x is left child (x_parent_right is the right child)
-               BOOST_INTRUSIVE_INVARIANT_ASSERT(x_parent_right);
-               if (NodeTraits::get_balance(x_parent_right) == NodeTraits::negative()) {
-                  // x_parent_right MUST have then a left child
-                  BOOST_INTRUSIVE_INVARIANT_ASSERT(NodeTraits::get_left(x_parent_right));
-                  x = avl_rotate_right_left(x_parent, x_parent_right, header);
-               }
-               else {
-                  avl_rotate_left(x_parent, x_parent_right, header);
-                  x = x_parent_right;
-               }
-               // if changed from NodeTraits::positive() to negative, no need to check above
-               if (NodeTraits::get_balance(x) == NodeTraits::negative()){
-                  break;
-               }
-            }
-         }
-         else{
-            BOOST_INTRUSIVE_INVARIANT_ASSERT(false);  // never reached
-         }
-      }
-   }
-
-   static void rebalance_after_insertion(node_ptr header, node_ptr x) BOOST_NOEXCEPT
-   {
-      NodeTraits::set_balance(x, NodeTraits::zero());
-      // Rebalance.
-      for(node_ptr root = NodeTraits::get_parent(header); x != root; root = NodeTraits::get_parent(header)){
-         node_ptr const x_parent(NodeTraits::get_parent(x));
-         node_ptr const x_parent_left(NodeTraits::get_left(x_parent));
-         const balance x_parent_balance = NodeTraits::get_balance(x_parent);
-         const bool x_is_leftchild(x == x_parent_left);
-         if(x_parent_balance == NodeTraits::zero()){
-            // if x is left, parent will have parent->bal_factor = negative
-            // else, parent->bal_factor = NodeTraits::positive()
-            NodeTraits::set_balance( x_parent, x_is_leftchild ? NodeTraits::negative() : NodeTraits::positive()  );
-            x = x_parent;
-         }
-         else if(x_parent_balance == NodeTraits::positive()){
-            // if x is a left child, parent->bal_factor = zero
-            if (x_is_leftchild)
-               NodeTraits::set_balance(x_parent, NodeTraits::zero());
-            else{        // x is a right child, needs rebalancing
-               if (NodeTraits::get_balance(x) == NodeTraits::negative())
-                  avl_rotate_right_left(x_parent, x, header);
-               else
-                  avl_rotate_left(x_parent, x, header);
-            }
-            break;
-         }
-         else if(x_parent_balance == NodeTraits::negative()){
-            // if x is a left child, needs rebalancing
-            if (x_is_leftchild) {
-               if (NodeTraits::get_balance(x) == NodeTraits::positive())
-                  avl_rotate_left_right(x_parent, x, header);
-               else
-                  avl_rotate_right(x_parent, x, header);
-            }
-            else
-               NodeTraits::set_balance(x_parent, NodeTraits::zero());
-            break;
-         }
-         else{
-            BOOST_INTRUSIVE_INVARIANT_ASSERT(false);  // never reached
-         }
-      }
-   }
-
-   static void left_right_balancing(node_ptr a, node_ptr b, node_ptr c) BOOST_NOEXCEPT
-   {
-      // balancing...
-      const balance c_balance = NodeTraits::get_balance(c);
-      const balance zero_balance = NodeTraits::zero();
-      const balance posi_balance = NodeTraits::positive();
-      const balance nega_balance = NodeTraits::negative();
-      NodeTraits::set_balance(c, zero_balance);
-      if(c_balance == nega_balance){
-         NodeTraits::set_balance(a, posi_balance);
-         NodeTraits::set_balance(b, zero_balance);
-      }
-      else if(c_balance == zero_balance){
-         NodeTraits::set_balance(a, zero_balance);
-         NodeTraits::set_balance(b, zero_balance);
-      }
-      else if(c_balance == posi_balance){
-         NodeTraits::set_balance(a, zero_balance);
-         NodeTraits::set_balance(b, nega_balance);
-      }
-      else{
-         BOOST_INTRUSIVE_INVARIANT_ASSERT(false); // never reached
-      }
-   }
-
-   static node_ptr avl_rotate_left_right(const node_ptr a, const node_ptr a_oldleft, node_ptr hdr) BOOST_NOEXCEPT
-   {  // [note: 'a_oldleft' is 'b']
-      //             |                               |         //
-      //             a(-2)                           c         //
-      //            / \                             / \        //
-      //           /   \        ==>                /   \       //
-      //      (pos)b    [g]                       b     a      //
-      //          / \                            / \   / \     //
-      //        [d]  c                         [d]  e f  [g]   //
-      //            / \                                        //
-      //           e   f                                       //
-      const node_ptr c = NodeTraits::get_right(a_oldleft);
-      bstree_algo::rotate_left_no_parent_fix(a_oldleft, c);
-      //No need to link c with a [NodeTraits::set_parent(c, a) + NodeTraits::set_left(a, c)]
-      //as c is not root and another rotation is coming
-      bstree_algo::rotate_right(a, c, NodeTraits::get_parent(a), hdr);
-      left_right_balancing(a, a_oldleft, c);
-      return c;
-   }
-
-   static node_ptr avl_rotate_right_left(const node_ptr a, const node_ptr a_oldright, node_ptr hdr) BOOST_NOEXCEPT
-   {  // [note: 'a_oldright' is 'b']
-      //              |                               |           //
-      //              a(pos)                          c           //
-      //             / \                             / \          //
-      //            /   \                           /   \         //
-      //          [d]   b(neg)         ==>         a     b        //
-      //               / \                        / \   / \       //
-      //              c  [g]                    [d] e  f  [g]     //
-      //             / \                                          //
-      //            e   f                                         //
-      const node_ptr c (NodeTraits::get_left(a_oldright));
-      bstree_algo::rotate_right_no_parent_fix(a_oldright, c);
-      //No need to link c with a [NodeTraits::set_parent(c, a) + NodeTraits::set_right(a, c)]
-      //as c is not root and another rotation is coming.
-      bstree_algo::rotate_left(a, c, NodeTraits::get_parent(a), hdr);
-      left_right_balancing(a_oldright, a, c);
-      return c;
-   }
-
-   static void avl_rotate_left(node_ptr x, node_ptr x_oldright, node_ptr hdr) BOOST_NOEXCEPT
-   {
-      bstree_algo::rotate_left(x, x_oldright, NodeTraits::get_parent(x), hdr);
-
-      // reset the balancing factor
-      if (NodeTraits::get_balance(x_oldright) == NodeTraits::positive()) {
-         NodeTraits::set_balance(x, NodeTraits::zero());
-         NodeTraits::set_balance(x_oldright, NodeTraits::zero());
-      }
-      else {        // this doesn't happen during insertions
-         NodeTraits::set_balance(x, NodeTraits::positive());
-         NodeTraits::set_balance(x_oldright, NodeTraits::negative());
-      }
-   }
-
-   static void avl_rotate_right(node_ptr x, node_ptr x_oldleft, node_ptr hdr) BOOST_NOEXCEPT
-   {
-      bstree_algo::rotate_right(x, x_oldleft, NodeTraits::get_parent(x), hdr);
-
-      // reset the balancing factor
-      if (NodeTraits::get_balance(x_oldleft) == NodeTraits::negative()) {
-         NodeTraits::set_balance(x, NodeTraits::zero());
-         NodeTraits::set_balance(x_oldleft, NodeTraits::zero());
-      }
-      else {        // this doesn't happen during insertions
-         NodeTraits::set_balance(x, NodeTraits::negative());
-         NodeTraits::set_balance(x_oldleft, NodeTraits::positive());
-      }
-   }
-
-   /// @endcond
-};
-
-/// @cond
-
-template<class NodeTraits>
-struct get_algo<AvlTreeAlgorithms, NodeTraits>
-{
-   typedef avltree_algorithms<NodeTraits> type;
-};
-
-template <class ValueTraits, class NodePtrCompare, class ExtraChecker>
-struct get_node_checker<AvlTreeAlgorithms, ValueTraits, NodePtrCompare, ExtraChecker>
-{
-   typedef detail::avltree_node_checker<ValueTraits, NodePtrCompare, ExtraChecker> type;
-};
-
-/// @endcond
-
-} //namespace intrusive
-} //namespace boost
-
-#include <boost/intrusive/detail/config_end.hpp>
-
-#endif //BOOST_INTRUSIVE_AVLTREE_ALGORITHMS_HPP
diff --git a/src/boost/intrusive/bs_set_hook.hpp b/src/boost/intrusive/bs_set_hook.hpp
deleted file mode 100644
index a64c15ac..00000000
--- a/src/boost/intrusive/bs_set_hook.hpp
+++ /dev/null
@@ -1,288 +0,0 @@
-/////////////////////////////////////////////////////////////////////////////
-//
-// (C) Copyright Ion Gaztanaga 2007-2013
-//
-// Distributed under the Boost 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/intrusive for documentation.
-//
-/////////////////////////////////////////////////////////////////////////////
-
-#ifndef BOOST_INTRUSIVE_BS_SET_HOOK_HPP
-#define BOOST_INTRUSIVE_BS_SET_HOOK_HPP
-
-#include <boost/intrusive/detail/config_begin.hpp>
-#include <boost/intrusive/intrusive_fwd.hpp>
-
-#include <boost/intrusive/detail/tree_node.hpp>
-#include <boost/intrusive/bstree_algorithms.hpp>
-#include <boost/intrusive/options.hpp>
-#include <boost/intrusive/detail/generic_hook.hpp>
-
-#if defined(BOOST_HAS_PRAGMA_ONCE)
-#  pragma once
-#endif
-
-namespace boost {
-namespace intrusive {
-
-//! Helper metafunction to define a \c bs_set_base_hook that yields to the same
-//! type when the same options (either explicitly or implicitly) are used.
-#if defined(BOOST_INTRUSIVE_DOXYGEN_INVOKED) || defined(BOOST_INTRUSIVE_VARIADIC_TEMPLATES)
-template<class ...Options>
-#else
-template<class O1 = void, class O2 = void, class O3 = void>
-#endif
-struct make_bs_set_base_hook
-{
-   /// @cond
-   typedef typename pack_options
-   #if !defined(BOOST_INTRUSIVE_VARIADIC_TEMPLATES)
-      < hook_defaults, O1, O2, O3>
-   #else
-      < hook_defaults, Options...>
-   #endif
-   ::type packed_options;
-
-   typedef generic_hook
-   < BsTreeAlgorithms
-   , tree_node_traits<typename packed_options::void_pointer>
-   , typename packed_options::tag
-   , packed_options::link_mode
-   , BsTreeBaseHookId
-   > implementation_defined;
-   /// @endcond
-   typedef implementation_defined type;
-};
-
-//! Derive a class from bs_set_base_hook in order to store objects in
-//! in a bs_set/bs_multiset. bs_set_base_hook holds the data necessary to maintain
-//! the bs_set/bs_multiset and provides an appropriate value_traits class for bs_set/bs_multiset.
-//!
-//! The hook admits the following options: \c tag<>, \c void_pointer<>,
-//! \c link_mode<>.
-//!
-//! \c tag<> defines a tag to identify the node.
-//! The same tag value can be used in different classes, but if a class is
-//! derived from more than one \c list_base_hook, then each \c list_base_hook needs its
-//! unique tag.
-//!
-//! \c void_pointer<> is the pointer type that will be used internally in the hook
-//! and the container configured to use this hook.
-//!
-//! \c link_mode<> will specify the linking mode of the hook (\c normal_link,
-//! \c auto_unlink or \c safe_link).
-#if defined(BOOST_INTRUSIVE_DOXYGEN_INVOKED) || defined(BOOST_INTRUSIVE_VARIADIC_TEMPLATES)
-template<class ...Options>
-#else
-template<class O1, class O2, class O3>
-#endif
-class bs_set_base_hook
-   :  public make_bs_set_base_hook
-   #if !defined(BOOST_INTRUSIVE_VARIADIC_TEMPLATES)
-      <O1, O2, O3>
-   #else
-      <Options...>
-   #endif
-   ::type
-
-{
-   #if defined(BOOST_INTRUSIVE_DOXYGEN_INVOKED)
-   public:
-   //! <b>Effects</b>: If link_mode is \c auto_unlink or \c safe_link
-   //!   initializes the node to an unlinked state.
-   //!
-   //! <b>Throws</b>: Nothing.
-   bs_set_base_hook();
-
-   //! <b>Effects</b>: If link_mode is \c auto_unlink or \c safe_link
-   //!   initializes the node to an unlinked state. The argument is ignored.
-   //!
-   //! <b>Throws</b>: Nothing.
-   //!
-   //! <b>Rationale</b>: Providing a copy-constructor
-   //!   makes classes using the hook STL-compliant without forcing the
-   //!   user to do some additional work. \c swap can be used to emulate
-   //!   move-semantics.
-   bs_set_base_hook(const bs_set_base_hook& );
-
-   //! <b>Effects</b>: Empty function. The argument is ignored.
-   //!
-   //! <b>Throws</b>: Nothing.
-   //!
-   //! <b>Rationale</b>: Providing an assignment operator
-   //!   makes classes using the hook STL-compliant without forcing the
-   //!   user to do some additional work. \c swap can be used to emulate
-   //!   move-semantics.
-   bs_set_base_hook& operator=(const bs_set_base_hook& );
-
-   //! <b>Effects</b>: If link_mode is \c normal_link, the destructor does
-   //!   nothing (ie. no code is generated). If link_mode is \c safe_link and the
-   //!   object is stored in a set an assertion is raised. If link_mode is
-   //!   \c auto_unlink and \c is_linked() is true, the node is unlinked.
-   //!
-   //! <b>Throws</b>: Nothing.
-   ~bs_set_base_hook();
-
-   //! <b>Effects</b>: Swapping two nodes swaps the position of the elements
-   //!   related to those nodes in one or two containers. That is, if the node
-   //!   this is part of the element e1, the node x is part of the element e2
-   //!   and both elements are included in the containers s1 and s2, then after
-   //!   the swap-operation e1 is in s2 at the position of e2 and e2 is in s1
-   //!   at the position of e1. If one element is not in a container, then
-   //!   after the swap-operation the other element is not in a container.
-   //!   Iterators to e1 and e2 related to those nodes are invalidated.
-   //!
-   //! <b>Complexity</b>: Constant
-   //!
-   //! <b>Throws</b>: Nothing.
-   void swap_nodes(bs_set_base_hook &other);
-
-   //! <b>Precondition</b>: link_mode must be \c safe_link or \c auto_unlink.
-   //!
-   //! <b>Returns</b>: true, if the node belongs to a container, false
-   //!   otherwise. This function can be used to test whether \c set::iterator_to
-   //!   will return a valid iterator.
-   //!
-   //! <b>Complexity</b>: Constant
-   bool is_linked() const;
-
-   //! <b>Effects</b>: Removes the node if it's inserted in a container.
-   //!   This function is only allowed if link_mode is \c auto_unlink.
-   //!
-   //! <b>Throws</b>: Nothing.
-   void unlink();
-   #endif
-};
-
-//! Helper metafunction to define a \c bs_set_member_hook that yields to the same
-//! type when the same options (either explicitly or implicitly) are used.
-#if defined(BOOST_INTRUSIVE_DOXYGEN_INVOKED) || defined(BOOST_INTRUSIVE_VARIADIC_TEMPLATES)
-template<class ...Options>
-#else
-template<class O1 = void, class O2 = void, class O3 = void>
-#endif
-struct make_bs_set_member_hook
-{
-   /// @cond
-   typedef typename pack_options
-   #if !defined(BOOST_INTRUSIVE_VARIADIC_TEMPLATES)
-      < hook_defaults, O1, O2, O3>
-   #else
-      < hook_defaults, Options...>
-   #endif
-
-   ::type packed_options;
-
-   typedef generic_hook
-   < BsTreeAlgorithms
-   , tree_node_traits<typename packed_options::void_pointer>
-   , member_tag
-   , packed_options::link_mode
-   , NoBaseHookId
-   > implementation_defined;
-   /// @endcond
-   typedef implementation_defined type;
-};
-
-//! Put a public data member bs_set_member_hook in order to store objects of this class in
-//! a bs_set/bs_multiset. bs_set_member_hook holds the data necessary for maintaining the
-//! bs_set/bs_multiset and provides an appropriate value_traits class for bs_set/bs_multiset.
-//!
-//! The hook admits the following options: \c void_pointer<>, \c link_mode<>.
-//!
-//! \c void_pointer<> is the pointer type that will be used internally in the hook
-//! and the container configured to use this hook.
-//!
-//! \c link_mode<> will specify the linking mode of the hook (\c normal_link,
-//! \c auto_unlink or \c safe_link).
-#if defined(BOOST_INTRUSIVE_DOXYGEN_INVOKED) || defined(BOOST_INTRUSIVE_VARIADIC_TEMPLATES)
-template<class ...Options>
-#else
-template<class O1, class O2, class O3>
-#endif
-class bs_set_member_hook
-   :  public make_bs_set_member_hook
-      #if !defined(BOOST_INTRUSIVE_VARIADIC_TEMPLATES)
-      <O1, O2, O3>
-      #else
-      <Options...>
-      #endif
-      ::type
-{
-   #if defined(BOOST_INTRUSIVE_DOXYGEN_INVOKED)
-   public:
-   //! <b>Effects</b>: If link_mode is \c auto_unlink or \c safe_link
-   //!   initializes the node to an unlinked state.
-   //!
-   //! <b>Throws</b>: Nothing.
-   bs_set_member_hook();
-
-   //! <b>Effects</b>: If link_mode is \c auto_unlink or \c safe_link
-   //!   initializes the node to an unlinked state. The argument is ignored.
-   //!
-   //! <b>Throws</b>: Nothing.
-   //!
-   //! <b>Rationale</b>: Providing a copy-constructor
-   //!   makes classes using the hook STL-compliant without forcing the
-   //!   user to do some additional work. \c swap can be used to emulate
-   //!   move-semantics.
-   bs_set_member_hook(const bs_set_member_hook& );
-
-   //! <b>Effects</b>: Empty function. The argument is ignored.
-   //!
-   //! <b>Throws</b>: Nothing.
-   //!
-   //! <b>Rationale</b>: Providing an assignment operator
-   //!   makes classes using the hook STL-compliant without forcing the
-   //!   user to do some additional work. \c swap can be used to emulate
-   //!   move-semantics.
-   bs_set_member_hook& operator=(const bs_set_member_hook& );
-
-   //! <b>Effects</b>: If link_mode is \c normal_link, the destructor does
-   //!   nothing (ie. no code is generated). If link_mode is \c safe_link and the
-   //!   object is stored in a set an assertion is raised. If link_mode is
-   //!   \c auto_unlink and \c is_linked() is true, the node is unlinked.
-   //!
-   //! <b>Throws</b>: Nothing.
-   ~bs_set_member_hook();
-
-   //! <b>Effects</b>: Swapping two nodes swaps the position of the elements
-   //!   related to those nodes in one or two containers. That is, if the node
-   //!   this is part of the element e1, the node x is part of the element e2
-   //!   and both elements are included in the containers s1 and s2, then after
-   //!   the swap-operation e1 is in s2 at the position of e2 and e2 is in s1
-   //!   at the position of e1. If one element is not in a container, then
-   //!   after the swap-operation the other element is not in a container.
-   //!   Iterators to e1 and e2 related to those nodes are invalidated.
-   //!
-   //! <b>Complexity</b>: Constant
-   //!
-   //! <b>Throws</b>: Nothing.
-   void swap_nodes(bs_set_member_hook &other);
-
-   //! <b>Precondition</b>: link_mode must be \c safe_link or \c auto_unlink.
-   //!
-   //! <b>Returns</b>: true, if the node belongs to a container, false
-   //!   otherwise. This function can be used to test whether \c set::iterator_to
-   //!   will return a valid iterator.
-   //!
-   //! <b>Complexity</b>: Constant
-   bool is_linked() const;
-
-   //! <b>Effects</b>: Removes the node if it's inserted in a container.
-   //!   This function is only allowed if link_mode is \c auto_unlink.
-   //!
-   //! <b>Throws</b>: Nothing.
-   void unlink();
-   #endif
-};
-
-} //namespace intrusive
-} //namespace boost
-
-#include <boost/intrusive/detail/config_end.hpp>
-
-#endif //BOOST_INTRUSIVE_BS_SET_HOOK_HPP
diff --git a/src/boost/intrusive/bstree.hpp b/src/boost/intrusive/bstree.hpp
deleted file mode 100644
index 51687ebd..00000000
--- a/src/boost/intrusive/bstree.hpp
+++ /dev/null
@@ -1,2238 +0,0 @@
-/////////////////////////////////////////////////////////////////////////////
-//
-// (C) Copyright Ion Gaztanaga  2013-2014
-//
-// Distributed under the Boost 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/intrusive for documentation.
-//
-/////////////////////////////////////////////////////////////////////////////
-#ifndef BOOST_INTRUSIVE_BSTREE_HPP
-#define BOOST_INTRUSIVE_BSTREE_HPP
-
-#include <boost/intrusive/detail/config_begin.hpp>
-#include <boost/intrusive/intrusive_fwd.hpp>
-
-#include <boost/intrusive/detail/assert.hpp>
-#include <boost/static_assert.hpp>
-#include <boost/intrusive/intrusive_fwd.hpp>
-#include <boost/intrusive/bs_set_hook.hpp>
-#include <boost/intrusive/detail/tree_node.hpp>
-#include <boost/intrusive/detail/tree_iterator.hpp>
-#include <boost/intrusive/detail/ebo_functor_holder.hpp>
-#include <boost/intrusive/detail/mpl.hpp>
-#include <boost/intrusive/pointer_traits.hpp>
-#include <boost/intrusive/detail/is_stateful_value_traits.hpp>
-#include <boost/intrusive/detail/empty_node_checker.hpp>
-#include <boost/intrusive/detail/default_header_holder.hpp>
-#include <boost/intrusive/detail/reverse_iterator.hpp>
-#include <boost/intrusive/detail/exception_disposer.hpp>
-#include <boost/intrusive/detail/node_cloner_disposer.hpp>
-#include <boost/intrusive/detail/key_nodeptr_comp.hpp>
-#include <boost/intrusive/detail/simple_disposers.hpp>
-#include <boost/intrusive/detail/size_holder.hpp>
-#include <boost/intrusive/detail/algo_type.hpp>
-#include <boost/intrusive/detail/algorithm.hpp>
-#include <boost/intrusive/detail/tree_value_compare.hpp>
-
-#include <boost/intrusive/detail/get_value_traits.hpp>
-#include <boost/intrusive/bstree_algorithms.hpp>
-#include <boost/intrusive/link_mode.hpp>
-#include <boost/intrusive/parent_from_member.hpp>
-#include <boost/move/utility_core.hpp>
-#include <boost/move/adl_move_swap.hpp>
-
-#include <boost/intrusive/detail/minimal_pair_header.hpp>
-#include <cstddef>   //size_t...
-#include <boost/intrusive/detail/minimal_less_equal_header.hpp>//less, equal_to
-
-#if defined(BOOST_HAS_PRAGMA_ONCE)
-#  pragma once
-#endif
-
-namespace boost {
-namespace intrusive {
-
-/// @cond
-
-struct default_bstree_hook_applier
-{  template <class T> struct apply{ typedef typename T::default_bstree_hook type;  };  };
-
-template<>
-struct is_default_hook_tag<default_bstree_hook_applier>
-{  static const bool value = true;  };
-
-struct bstree_defaults
-{
-   typedef default_bstree_hook_applier proto_value_traits;
-   static const bool constant_time_size = true;
-   typedef std::size_t size_type;
-   typedef void compare;
-   typedef void key_of_value;
-   static const bool floating_point = true;  //For sgtree
-   typedef void priority;  //For treap
-   typedef void header_holder_type;
-};
-
-template<class ValueTraits, algo_types AlgoType, typename HeaderHolder>
-struct bstbase3
-{
-   typedef ValueTraits                                               value_traits;
-   typedef typename value_traits::node_traits                        node_traits;
-   typedef typename node_traits::node                                node_type;
-   typedef typename get_algo<AlgoType, node_traits>::type            node_algorithms;
-   typedef typename node_traits::node_ptr                            node_ptr;
-   typedef typename node_traits::const_node_ptr                      const_node_ptr;
-   typedef tree_iterator<value_traits, false>                                                   iterator;
-   typedef tree_iterator<value_traits, true>                                                    const_iterator;
-   typedef boost::intrusive::reverse_iterator<iterator>                                         reverse_iterator;
-   typedef boost::intrusive::reverse_iterator<const_iterator>                                   const_reverse_iterator;
-   typedef BOOST_INTRUSIVE_IMPDEF(typename value_traits::pointer)                               pointer;
-   typedef BOOST_INTRUSIVE_IMPDEF(typename value_traits::const_pointer)                         const_pointer;
-   typedef BOOST_INTRUSIVE_IMPDEF(typename pointer_traits<pointer>::element_type)               value_type;
-   typedef BOOST_INTRUSIVE_IMPDEF(typename pointer_traits<pointer>::reference)                  reference;
-   typedef BOOST_INTRUSIVE_IMPDEF(typename pointer_traits<const_pointer>::reference)            const_reference;
-   typedef BOOST_INTRUSIVE_IMPDEF(typename pointer_traits<const_pointer>::difference_type)      difference_type;
-   typedef typename detail::get_header_holder_type
-      < value_traits,HeaderHolder >::type                                                       header_holder_type;
-
-   static const bool safemode_or_autounlink = is_safe_autounlink<value_traits::link_mode>::value;
-   static const bool stateful_value_traits = detail::is_stateful_value_traits<value_traits>::value;
-   static const bool has_container_from_iterator =
-        detail::is_same< header_holder_type, detail::default_header_holder< node_traits > >::value;
-
-   struct holder_t : public ValueTraits
-   {
-      BOOST_INTRUSIVE_FORCEINLINE explicit holder_t(const ValueTraits &vtraits)
-         : ValueTraits(vtraits)
-      {}
-      header_holder_type root;
-   } holder;
-
-   static bstbase3 &get_tree_base_from_end_iterator(const const_iterator &end_iterator)
-   {
-      BOOST_STATIC_ASSERT(has_container_from_iterator);
-      node_ptr p = end_iterator.pointed_node();
-      header_holder_type* h = header_holder_type::get_holder(p);
-      holder_t *holder = get_parent_from_member<holder_t, header_holder_type>(h, &holder_t::root);
-      bstbase3 *base   = get_parent_from_member<bstbase3, holder_t> (holder, &bstbase3::holder);
-      return *base;
-   }
-
-   BOOST_INTRUSIVE_FORCEINLINE bstbase3(const ValueTraits &vtraits)
-      : holder(vtraits)
-   {
-      node_algorithms::init_header(this->header_ptr());
-   }
-
-   BOOST_INTRUSIVE_FORCEINLINE node_ptr header_ptr()
-   { return holder.root.get_node(); }
-
-   BOOST_INTRUSIVE_FORCEINLINE const_node_ptr header_ptr() const
-   { return holder.root.get_node(); }
-
-   BOOST_INTRUSIVE_FORCEINLINE const value_traits &get_value_traits() const
-   {  return this->holder;  }
-
-   BOOST_INTRUSIVE_FORCEINLINE value_traits &get_value_traits()
-   {  return this->holder;  }
-
-   typedef typename boost::intrusive::value_traits_pointers
-      <ValueTraits>::const_value_traits_ptr const_value_traits_ptr;
-
-   BOOST_INTRUSIVE_FORCEINLINE const_value_traits_ptr priv_value_traits_ptr() const
-   {  return pointer_traits<const_value_traits_ptr>::pointer_to(this->get_value_traits());  }
-
-   BOOST_INTRUSIVE_FORCEINLINE iterator begin() BOOST_NOEXCEPT
-   {  return iterator(node_algorithms::begin_node(this->header_ptr()), this->priv_value_traits_ptr());   }
-
-   BOOST_INTRUSIVE_FORCEINLINE const_iterator begin() const BOOST_NOEXCEPT
-   {  return cbegin();   }
-
-   BOOST_INTRUSIVE_FORCEINLINE const_iterator cbegin() const BOOST_NOEXCEPT
-   {  return const_iterator(node_algorithms::begin_node(this->header_ptr()), this->priv_value_traits_ptr());   }
-
-   BOOST_INTRUSIVE_FORCEINLINE iterator end() BOOST_NOEXCEPT
-   {  return iterator(node_algorithms::end_node(this->header_ptr()), this->priv_value_traits_ptr());   }
-
-   BOOST_INTRUSIVE_FORCEINLINE const_iterator end() const BOOST_NOEXCEPT
-   {  return cend();  }
-
-   BOOST_INTRUSIVE_FORCEINLINE const_iterator cend() const BOOST_NOEXCEPT
-   {  return const_iterator(node_algorithms::end_node(this->header_ptr()), this->priv_value_traits_ptr());   }
-
-   BOOST_INTRUSIVE_FORCEINLINE iterator root()
-   {  return iterator(node_algorithms::root_node(this->header_ptr()), this->priv_value_traits_ptr());   }
-
-   BOOST_INTRUSIVE_FORCEINLINE const_iterator root() const
-   {  return croot();   }
-
-   BOOST_INTRUSIVE_FORCEINLINE const_iterator croot() const
-   {  return const_iterator(node_algorithms::root_node(this->header_ptr()), this->priv_value_traits_ptr());   }
-
-   BOOST_INTRUSIVE_FORCEINLINE reverse_iterator rbegin()
-   {  return reverse_iterator(end());  }
-
-   BOOST_INTRUSIVE_FORCEINLINE const_reverse_iterator rbegin() const
-   {  return const_reverse_iterator(end());  }
-
-   BOOST_INTRUSIVE_FORCEINLINE const_reverse_iterator crbegin() const
-   {  return const_reverse_iterator(end());  }
-
-   BOOST_INTRUSIVE_FORCEINLINE reverse_iterator rend()
-   {  return reverse_iterator(begin());   }
-
-   BOOST_INTRUSIVE_FORCEINLINE const_reverse_iterator rend() const
-   {  return const_reverse_iterator(begin());   }
-
-   BOOST_INTRUSIVE_FORCEINLINE const_reverse_iterator crend() const
-   {  return const_reverse_iterator(begin());   }
-
-   void replace_node(iterator replace_this, reference with_this)
-   {
-      node_algorithms::replace_node( get_value_traits().to_node_ptr(*replace_this)
-                                   , this->header_ptr()
-                                   , get_value_traits().to_node_ptr(with_this));
-      BOOST_IF_CONSTEXPR(safemode_or_autounlink)
-         node_algorithms::init(replace_this.pointed_node());
-   }
-
-   BOOST_INTRUSIVE_FORCEINLINE void rebalance() BOOST_NOEXCEPT
-   {  node_algorithms::rebalance(this->header_ptr()); }
-
-   iterator rebalance_subtree(iterator r) BOOST_NOEXCEPT
-   {  return iterator(node_algorithms::rebalance_subtree(r.pointed_node()), this->priv_value_traits_ptr()); }
-
-   static iterator s_iterator_to(reference value) BOOST_NOEXCEPT
-   {
-      BOOST_STATIC_ASSERT((!stateful_value_traits));
-      return iterator (value_traits::to_node_ptr(value), const_value_traits_ptr());
-   }
-
-   static const_iterator s_iterator_to(const_reference value) BOOST_NOEXCEPT
-   {
-      BOOST_STATIC_ASSERT((!stateful_value_traits));
-      return const_iterator (value_traits::to_node_ptr(*pointer_traits<pointer>::const_cast_from(pointer_traits<const_pointer>::pointer_to(value))), const_value_traits_ptr());
-   }
-
-   iterator iterator_to(reference value) BOOST_NOEXCEPT
-   {  return iterator (this->get_value_traits().to_node_ptr(value), this->priv_value_traits_ptr()); }
-
-   const_iterator iterator_to(const_reference value) const BOOST_NOEXCEPT
-   {  return const_iterator (this->get_value_traits().to_node_ptr(*pointer_traits<pointer>::const_cast_from(pointer_traits<const_pointer>::pointer_to(value))), this->priv_value_traits_ptr()); }
-
-   BOOST_INTRUSIVE_FORCEINLINE static void init_node(reference value)
-   { node_algorithms::init(value_traits::to_node_ptr(value)); }
-
-};
-
-template<class Less, class T>
-struct get_compare
-{
-   typedef Less type;
-};
-
-template<class T>
-struct get_compare<void, T>
-{
-   typedef ::std::less<T> type;
-};
-
-template<class KeyOfValue, class T>
-struct get_key_of_value
-{
-   typedef KeyOfValue type;
-};
-
-template<class T>
-struct get_key_of_value<void, T>
-{
-   typedef ::boost::intrusive::detail::identity<T> type;
-};
-
-template<class ValuePtr, class VoidOrKeyOfValue, class VoidOrKeyComp>
-struct bst_key_types
-{
-   typedef typename
-      boost::movelib::pointer_element<ValuePtr>::type value_type;
-   typedef typename get_key_of_value
-      < VoidOrKeyOfValue, value_type>::type           key_of_value;
-   typedef typename key_of_value::type                key_type;
-   typedef typename get_compare< VoidOrKeyComp
-                      , key_type
-                      >::type                         key_compare;
-   typedef tree_value_compare
-      <ValuePtr, key_compare, key_of_value>           value_compare;
-};
-
-template<class ValueTraits, class VoidOrKeyOfValue, class VoidOrKeyComp, algo_types AlgoType, typename HeaderHolder>
-struct bstbase2
-   //Put the (possibly empty) functor in the first position to get EBO in MSVC
-   //Use public inheritance to avoid MSVC bugs with closures
-   : public detail::ebo_functor_holder
-            < typename bst_key_types
-               < typename ValueTraits::pointer
-               , VoidOrKeyOfValue
-               , VoidOrKeyComp
-               
-               >::value_compare
-            >
-   , public bstbase3<ValueTraits, AlgoType, HeaderHolder>
-{
-   typedef bstbase3<ValueTraits, AlgoType, HeaderHolder>             treeheader_t;
-   typedef bst_key_types< typename ValueTraits::pointer
-                        , VoidOrKeyOfValue
-                        , VoidOrKeyComp>                             key_types;
-   typedef typename treeheader_t::value_traits                       value_traits;
-   typedef typename treeheader_t::node_algorithms                    node_algorithms;
-   typedef typename ValueTraits::value_type                          value_type;
-   typedef typename key_types::key_type                              key_type;
-   typedef typename key_types::key_of_value                          key_of_value;
-   typedef typename key_types::key_compare                           key_compare;
-   typedef typename key_types::value_compare                         value_compare;
-   typedef typename treeheader_t::iterator                           iterator;
-   typedef typename treeheader_t::const_iterator                     const_iterator;
-   typedef typename treeheader_t::node_ptr                           node_ptr;
-   typedef typename treeheader_t::const_node_ptr                     const_node_ptr;
-
-   bstbase2(const key_compare &comp, const ValueTraits &vtraits)
-      : detail::ebo_functor_holder<value_compare>(value_compare(comp)), treeheader_t(vtraits)
-   {}
-
-   const value_compare &get_comp() const
-   {  return this->get();  }
-
-   value_compare &get_comp()
-   {  return this->get();  }
-
-   typedef BOOST_INTRUSIVE_IMPDEF(typename value_traits::pointer)                               pointer;
-   typedef BOOST_INTRUSIVE_IMPDEF(typename value_traits::const_pointer)                         const_pointer;
-   typedef BOOST_INTRUSIVE_IMPDEF(typename pointer_traits<pointer>::reference)                  reference;
-   typedef BOOST_INTRUSIVE_IMPDEF(typename pointer_traits<const_pointer>::reference)            const_reference;
-   typedef BOOST_INTRUSIVE_IMPDEF(typename pointer_traits<const_pointer>::difference_type)      difference_type;
-   typedef typename node_algorithms::insert_commit_data insert_commit_data;
-
-   BOOST_INTRUSIVE_FORCEINLINE value_compare value_comp() const
-   {  return this->get_comp();   }
-
-   BOOST_INTRUSIVE_FORCEINLINE key_compare key_comp() const
-   {  return this->get_comp().key_comp();   }
-
-   //lower_bound
-   BOOST_INTRUSIVE_FORCEINLINE iterator lower_bound(const key_type &key)
-   {  return this->lower_bound(key, this->key_comp());   }
-
-   BOOST_INTRUSIVE_FORCEINLINE const_iterator lower_bound(const key_type &key) const
-   {  return this->lower_bound(key, this->key_comp());   }
-
-   template<class KeyType, class KeyTypeKeyCompare>
-   iterator lower_bound(const KeyType &key, KeyTypeKeyCompare comp)
-   {
-      return iterator(node_algorithms::lower_bound
-         (this->header_ptr(), key, this->key_node_comp(comp)), this->priv_value_traits_ptr());
-   }
-
-   template<class KeyType, class KeyTypeKeyCompare>
-   const_iterator lower_bound(const KeyType &key, KeyTypeKeyCompare comp) const
-   {
-      return const_iterator(node_algorithms::lower_bound
-         (this->header_ptr(), key, this->key_node_comp(comp)), this->priv_value_traits_ptr());
-   }
-
-   //upper_bound
-   BOOST_INTRUSIVE_FORCEINLINE iterator upper_bound(const key_type &key)
-   {  return this->upper_bound(key, this->key_comp());   }
-
-   template<class KeyType, class KeyTypeKeyCompare>
-   iterator upper_bound(const KeyType &key, KeyTypeKeyCompare comp)
-   {
-      return iterator(node_algorithms::upper_bound
-         (this->header_ptr(), key, this->key_node_comp(comp)), this->priv_value_traits_ptr());
-   }
-
-   BOOST_INTRUSIVE_FORCEINLINE const_iterator upper_bound(const key_type &key) const
-   {  return this->upper_bound(key, this->key_comp());   }
-
-   template<class KeyType, class KeyTypeKeyCompare>
-   const_iterator upper_bound(const KeyType &key, KeyTypeKeyCompare comp) const
-   {
-      return const_iterator(node_algorithms::upper_bound
-         (this->header_ptr(), key, this->key_node_comp(comp)), this->priv_value_traits_ptr());
-   }
-
-   template<class KeyTypeKeyCompare>
-   struct key_node_comp_ret
-   {  typedef detail::key_nodeptr_comp<KeyTypeKeyCompare, value_traits, key_of_value> type;  };
-
-   template<class KeyTypeKeyCompare>
-   BOOST_INTRUSIVE_FORCEINLINE typename key_node_comp_ret<KeyTypeKeyCompare>::type key_node_comp(KeyTypeKeyCompare comp) const
-   {
-      return detail::key_nodeptr_comp<KeyTypeKeyCompare, value_traits, key_of_value>(comp, &this->get_value_traits());
-   }
-
-   //find
-   BOOST_INTRUSIVE_FORCEINLINE iterator find(const key_type &key)
-   {  return this->find(key, this->key_comp()); }
-
-   template<class KeyType, class KeyTypeKeyCompare>
-   iterator find(const KeyType &key, KeyTypeKeyCompare comp)
-   {
-      return iterator
-         (node_algorithms::find(this->header_ptr(), key, this->key_node_comp(comp)), this->priv_value_traits_ptr());
-   }
-
-   BOOST_INTRUSIVE_FORCEINLINE const_iterator find(const key_type &key) const
-   {  return this->find(key, this->key_comp()); }
-
-   template<class KeyType, class KeyTypeKeyCompare>
-   const_iterator find(const KeyType &key, KeyTypeKeyCompare comp) const
-   {
-      return const_iterator
-         (node_algorithms::find(this->header_ptr(), key, this->key_node_comp(comp)), this->priv_value_traits_ptr());
-   }
-
-   //equal_range
-   BOOST_INTRUSIVE_FORCEINLINE std::pair<iterator,iterator> equal_range(const key_type &key)
-   {  return this->equal_range(key, this->key_comp());   }
-
-   template<class KeyType, class KeyTypeKeyCompare>
-   std::pair<iterator,iterator> equal_range(const KeyType &key, KeyTypeKeyCompare comp)
-   {
-      std::pair<node_ptr, node_ptr> ret = 
-         node_algorithms::equal_range(this->header_ptr(), key, this->key_node_comp(comp));
-      return std::pair<iterator, iterator>( iterator(ret.first, this->priv_value_traits_ptr())
-                                          , iterator(ret.second, this->priv_value_traits_ptr()));
-   }
-
-   BOOST_INTRUSIVE_FORCEINLINE std::pair<const_iterator, const_iterator>
-      equal_range(const key_type &key) const
-   {  return this->equal_range(key, this->key_comp());   }
-
-   template<class KeyType, class KeyTypeKeyCompare>
-   std::pair<const_iterator, const_iterator>
-      equal_range(const KeyType &key, KeyTypeKeyCompare comp) const
-   {
-      std::pair<node_ptr, node_ptr> ret =
-         node_algorithms::equal_range(this->header_ptr(), key, this->key_node_comp(comp));
-      return std::pair<const_iterator, const_iterator>( const_iterator(ret.first, this->priv_value_traits_ptr())
-                                                      , const_iterator(ret.second, this->priv_value_traits_ptr()));
-   }
-
-   //lower_bound_range
-   BOOST_INTRUSIVE_FORCEINLINE std::pair<iterator,iterator> lower_bound_range(const key_type &key)
-   {  return this->lower_bound_range(key, this->key_comp());   }
-
-   template<class KeyType, class KeyTypeKeyCompare>
-   std::pair<iterator,iterator> lower_bound_range(const KeyType &key, KeyTypeKeyCompare comp)
-   {
-      std::pair<node_ptr, node_ptr> ret =
-         node_algorithms::lower_bound_range(this->header_ptr(), key, this->key_node_comp(comp));
-      return std::pair<iterator, iterator>( iterator(ret.first, this->priv_value_traits_ptr())
-                                          , iterator(ret.second, this->priv_value_traits_ptr()));
-   }
-
-   BOOST_INTRUSIVE_FORCEINLINE std::pair<const_iterator, const_iterator>
-      lower_bound_range(const key_type &key) const
-   {  return this->lower_bound_range(key, this->key_comp());   }
-
-   template<class KeyType, class KeyTypeKeyCompare>
-   std::pair<const_iterator, const_iterator>
-      lower_bound_range(const KeyType &key, KeyTypeKeyCompare comp) const
-   {
-      std::pair<node_ptr, node_ptr> ret =
-         node_algorithms::lower_bound_range(this->header_ptr(), key, this->key_node_comp(comp));
-      return std::pair<const_iterator, const_iterator>( const_iterator(ret.first, this->priv_value_traits_ptr())
-                                                      , const_iterator(ret.second, this->priv_value_traits_ptr()));
-   }
-
-   //bounded_range
-   BOOST_INTRUSIVE_FORCEINLINE std::pair<iterator,iterator> bounded_range
-      (const key_type &lower_key, const key_type &upper_key, bool left_closed, bool right_closed)
-   {  return this->bounded_range(lower_key, upper_key, this->key_comp(), left_closed, right_closed);   }
-
-   template<class KeyType, class KeyTypeKeyCompare>
-   std::pair<iterator,iterator> bounded_range
-      (const KeyType &lower_key, const KeyType &upper_key, KeyTypeKeyCompare comp, bool left_closed, bool right_closed)
-   {
-      std::pair<node_ptr, node_ptr> ret =
-         node_algorithms::bounded_range
-            (this->header_ptr(), lower_key, upper_key, this->key_node_comp(comp), left_closed, right_closed);
-      return std::pair<iterator, iterator>( iterator(ret.first, this->priv_value_traits_ptr())
-                                          , iterator(ret.second, this->priv_value_traits_ptr()));
-   }
-
-   BOOST_INTRUSIVE_FORCEINLINE std::pair<const_iterator,const_iterator> bounded_range
-      (const key_type &lower_key, const key_type &upper_key, bool left_closed, bool right_closed) const
-   {  return this->bounded_range(lower_key, upper_key, this->key_comp(), left_closed, right_closed);   }
-
-   template<class KeyType, class KeyTypeKeyCompare>
-   std::pair<const_iterator,const_iterator> bounded_range
-      (const KeyType &lower_key, const KeyType &upper_key, KeyTypeKeyCompare comp, bool left_closed, bool right_closed) const
-   {
-      std::pair<node_ptr, node_ptr> ret =
-         node_algorithms::bounded_range
-            (this->header_ptr(), lower_key, upper_key, this->key_node_comp(comp), left_closed, right_closed);
-      return std::pair<const_iterator, const_iterator>( const_iterator(ret.first, this->priv_value_traits_ptr())
-                                                      , const_iterator(ret.second, this->priv_value_traits_ptr()));
-   }
-
-   //insert_unique_check
-   BOOST_INTRUSIVE_FORCEINLINE std::pair<iterator, bool> insert_unique_check
-      (const key_type &key, insert_commit_data &commit_data)
-   {  return this->insert_unique_check(key, this->key_comp(), commit_data);   }
-
-   BOOST_INTRUSIVE_FORCEINLINE std::pair<iterator, bool> insert_unique_check
-      (const_iterator hint, const key_type &key, insert_commit_data &commit_data)
-   {  return this->insert_unique_check(hint, key, this->key_comp(), commit_data);   }
-
-   template<class KeyType, class KeyTypeKeyCompare>
-   BOOST_INTRUSIVE_DOC1ST(std::pair<iterator BOOST_INTRUSIVE_I bool>
-      , typename detail::disable_if_convertible
-         <KeyType BOOST_INTRUSIVE_I const_iterator BOOST_INTRUSIVE_I 
-         std::pair<iterator BOOST_INTRUSIVE_I bool> >::type)
-      insert_unique_check
-      (const KeyType &key, KeyTypeKeyCompare comp, insert_commit_data &commit_data)
-   {
-      std::pair<node_ptr, bool> ret =
-         (node_algorithms::insert_unique_check
-            (this->header_ptr(), key, this->key_node_comp(comp), commit_data));
-      return std::pair<iterator, bool>(iterator(ret.first, this->priv_value_traits_ptr()), ret.second);
-   }
-
-   template<class KeyType, class KeyTypeKeyCompare>
-   std::pair<iterator, bool> insert_unique_check
-      (const_iterator hint, const KeyType &key, KeyTypeKeyCompare comp, insert_commit_data &commit_data)
-   {
-      std::pair<node_ptr, bool> ret =
-         (node_algorithms::insert_unique_check
-            (this->header_ptr(), hint.pointed_node(), key, this->key_node_comp(comp), commit_data));
-      return std::pair<iterator, bool>(iterator(ret.first, this->priv_value_traits_ptr()), ret.second);
-   }
-};
-
-//Due to MSVC's EBO implementation, to save space and maintain the ABI, we must put the non-empty size member
-//in the first position, but if size is not going to be stored then we'll use an specialization
-//that doesn't inherit from size_holder
-template<class ValueTraits, class VoidOrKeyOfValue, class VoidOrKeyComp, bool ConstantTimeSize, class SizeType, algo_types AlgoType, typename HeaderHolder>
-struct bstbase_hack
-   : public detail::size_holder<ConstantTimeSize, SizeType>
-   , public bstbase2 < ValueTraits, VoidOrKeyOfValue, VoidOrKeyComp, AlgoType, HeaderHolder>
-{
-   typedef bstbase2< ValueTraits, VoidOrKeyOfValue, VoidOrKeyComp, AlgoType, HeaderHolder> base_type;
-   typedef typename base_type::key_compare         key_compare;
-   typedef typename base_type::value_compare       value_compare;
-   typedef SizeType                                size_type;
-   typedef typename base_type::node_traits         node_traits;
-   typedef typename get_algo
-      <AlgoType, node_traits>::type                algo_type;
-
-   BOOST_INTRUSIVE_FORCEINLINE bstbase_hack(const key_compare & comp, const ValueTraits &vtraits)
-      : base_type(comp, vtraits)
-   {
-      this->sz_traits().set_size(size_type(0));
-   }
-
-   typedef detail::size_holder<ConstantTimeSize, SizeType>     size_traits;
-
-   BOOST_INTRUSIVE_FORCEINLINE size_traits &sz_traits()
-   {  return static_cast<size_traits &>(*this);  }
-
-   BOOST_INTRUSIVE_FORCEINLINE const size_traits &sz_traits() const
-   {  return static_cast<const size_traits &>(*this);  }
-};
-
-//Specialization for ConstantTimeSize == false
-template<class ValueTraits, class VoidOrKeyOfValue, class VoidOrKeyComp, class SizeType, algo_types AlgoType, typename HeaderHolder>
-struct bstbase_hack<ValueTraits, VoidOrKeyOfValue, VoidOrKeyComp, false, SizeType, AlgoType, HeaderHolder>
-   : public bstbase2 < ValueTraits, VoidOrKeyOfValue, VoidOrKeyComp, AlgoType, HeaderHolder>
-{
-   typedef bstbase2< ValueTraits, VoidOrKeyOfValue, VoidOrKeyComp, AlgoType, HeaderHolder> base_type;
-   typedef typename base_type::value_compare       value_compare;
-   typedef typename base_type::key_compare         key_compare;
-   BOOST_INTRUSIVE_FORCEINLINE bstbase_hack(const key_compare & comp, const ValueTraits &vtraits)
-      : base_type(comp, vtraits)
-   {}
-
-   typedef detail::size_holder<false, SizeType>     size_traits;
-
-   BOOST_INTRUSIVE_FORCEINLINE size_traits sz_traits() const
-   {  return size_traits();  }
-};
-
-//This class will
-template<class ValueTraits, class VoidOrKeyOfValue, class VoidOrKeyComp, bool ConstantTimeSize, class SizeType, algo_types AlgoType, typename HeaderHolder>
-struct bstbase
-   : public bstbase_hack< ValueTraits, VoidOrKeyOfValue, VoidOrKeyComp, ConstantTimeSize, SizeType, AlgoType, HeaderHolder>
-{
-   typedef bstbase_hack< ValueTraits, VoidOrKeyOfValue, VoidOrKeyComp, ConstantTimeSize, SizeType, AlgoType, HeaderHolder> base_type;
-   typedef ValueTraits                             value_traits;
-   typedef typename base_type::value_compare       value_compare;
-   typedef typename base_type::key_compare         key_compare;
-   typedef typename base_type::const_reference     const_reference;
-   typedef typename base_type::reference           reference;
-   typedef typename base_type::iterator            iterator;
-   typedef typename base_type::const_iterator      const_iterator;
-   typedef typename base_type::node_traits         node_traits;
-   typedef typename get_algo
-      <AlgoType, node_traits>::type                node_algorithms;
-   typedef SizeType                                size_type;
-
-   BOOST_INTRUSIVE_FORCEINLINE bstbase(const key_compare & comp, const ValueTraits &vtraits)
-      : base_type(comp, vtraits)
-   {}
-
-   //Detach all inserted nodes. This will add exception safety to bstree_impl
-   //constructors inserting elements.
-   ~bstbase()
-   {
-      if(is_safe_autounlink<value_traits::link_mode>::value){
-         node_algorithms::clear_and_dispose
-            ( this->header_ptr()
-            , detail::node_disposer<detail::null_disposer, value_traits, AlgoType>
-               (detail::null_disposer(), &this->get_value_traits()));
-         node_algorithms::init(this->header_ptr());
-      }
-   }
-};
-
-
-/// @endcond
-
-//! The class template bstree is an unbalanced intrusive binary search tree
-//! container. The no-throw guarantee holds only, if the key_compare object
-//! doesn't throw.
-//!
-//! The complexity guarantees only hold if the tree is balanced, logarithmic
-//! complexity would increase to linear if the tree is totally unbalanced.
-//!
-//! The template parameter \c T is the type to be managed by the container.
-//! The user can specify additional options and if no options are provided
-//! default options are used.
-//!
-//! The container supports the following options:
-//! \c base_hook<>/member_hook<>/value_traits<>,
-//! \c constant_time_size<>, \c size_type<> and
-//! \c compare<>.
-#if defined(BOOST_INTRUSIVE_DOXYGEN_INVOKED)
-template<class T, class ...Options>
-#else
-template<class ValueTraits, class VoidOrKeyOfValue, class VoidOrKeyComp, class SizeType, bool ConstantTimeSize, algo_types AlgoType, typename HeaderHolder>
-#endif
-class bstree_impl
-   :  public bstbase<ValueTraits, VoidOrKeyOfValue, VoidOrKeyComp, ConstantTimeSize, SizeType, AlgoType, HeaderHolder>
-{
-   public:
-   /// @cond
-   typedef bstbase<ValueTraits, VoidOrKeyOfValue, VoidOrKeyComp, ConstantTimeSize, SizeType, AlgoType, HeaderHolder> data_type;
-   typedef tree_iterator<ValueTraits, false> iterator_type;
-   typedef tree_iterator<ValueTraits, true>  const_iterator_type;
-   /// @endcond
-
-   typedef BOOST_INTRUSIVE_IMPDEF(ValueTraits)                                                  value_traits;
-   typedef BOOST_INTRUSIVE_IMPDEF(typename value_traits::pointer)                               pointer;
-   typedef BOOST_INTRUSIVE_IMPDEF(typename value_traits::const_pointer)                         const_pointer;
-   typedef BOOST_INTRUSIVE_IMPDEF(typename pointer_traits<pointer>::element_type)               value_type;
-   typedef BOOST_INTRUSIVE_IMPDEF(typename data_type::key_type)                                 key_type;
-   typedef BOOST_INTRUSIVE_IMPDEF(typename data_type::key_of_value)                             key_of_value;
-   typedef BOOST_INTRUSIVE_IMPDEF(typename pointer_traits<pointer>::reference)                  reference;
-   typedef BOOST_INTRUSIVE_IMPDEF(typename pointer_traits<const_pointer>::reference)            const_reference;
-   typedef BOOST_INTRUSIVE_IMPDEF(typename pointer_traits<const_pointer>::difference_type)      difference_type;
-   typedef BOOST_INTRUSIVE_IMPDEF(SizeType)                                                     size_type;
-   typedef BOOST_INTRUSIVE_IMPDEF(typename data_type::value_compare)                            value_compare;
-   typedef BOOST_INTRUSIVE_IMPDEF(typename data_type::key_compare)                              key_compare;
-   typedef BOOST_INTRUSIVE_IMPDEF(iterator_type)                                                iterator;
-   typedef BOOST_INTRUSIVE_IMPDEF(const_iterator_type)                                          const_iterator;
-   typedef BOOST_INTRUSIVE_IMPDEF(boost::intrusive::reverse_iterator<iterator>)                 reverse_iterator;
-   typedef BOOST_INTRUSIVE_IMPDEF(boost::intrusive::reverse_iterator<const_iterator>)           const_reverse_iterator;
-   typedef BOOST_INTRUSIVE_IMPDEF(typename value_traits::node_traits)                           node_traits;
-   typedef BOOST_INTRUSIVE_IMPDEF(typename node_traits::node)                                   node;
-   typedef BOOST_INTRUSIVE_IMPDEF(typename node_traits::node_ptr)                               node_ptr;
-   typedef BOOST_INTRUSIVE_IMPDEF(typename node_traits::const_node_ptr)                         const_node_ptr;
-   /// @cond
-   typedef typename get_algo<AlgoType, node_traits>::type                                       algo_type;
-   /// @endcond
-   typedef BOOST_INTRUSIVE_IMPDEF(algo_type)                                                    node_algorithms;
-
-   static const bool constant_time_size = ConstantTimeSize;
-   static const bool stateful_value_traits = detail::is_stateful_value_traits<value_traits>::value;
-   /// @cond
-   private:
-
-   //noncopyable
-   BOOST_MOVABLE_BUT_NOT_COPYABLE(bstree_impl)
-
-   static const bool safemode_or_autounlink = is_safe_autounlink<value_traits::link_mode>::value;
-
-   //Constant-time size is incompatible with auto-unlink hooks!
-   BOOST_STATIC_ASSERT(!(constant_time_size && ((int)value_traits::link_mode == (int)auto_unlink)));
-
-
-   protected:
-
-
-   /// @endcond
-
-   public:
-
-   typedef typename node_algorithms::insert_commit_data insert_commit_data;
-
-   //! <b>Effects</b>: Constructs an empty container.
-   //!
-   //! <b>Complexity</b>: Constant.
-   //!
-   //! <b>Throws</b>: If value_traits::node_traits::node
-   //!   constructor throws (this does not happen with predefined Boost.Intrusive hooks)
-   //!   or the copy constructor of the key_compare object throws. Basic guarantee.
-   bstree_impl()
-      :  data_type(key_compare(), value_traits())
-   {}
-
-   //! <b>Effects</b>: Constructs an empty container with given comparison and traits.
-   //!
-   //! <b>Complexity</b>: Constant.
-   //!
-   //! <b>Throws</b>: If value_traits::node_traits::node
-   //!   constructor throws (this does not happen with predefined Boost.Intrusive hooks)
-   //!   or the copy constructor of the key_compare object throws. Basic guarantee.
-   explicit bstree_impl( const key_compare &cmp, const value_traits &v_traits = value_traits())
-      :  data_type(cmp, v_traits)
-   {}
-
-   //! <b>Requires</b>: Dereferencing iterator must yield an lvalue of type value_type.
-   //!   cmp must be a comparison function that induces a strict weak ordering.
-   //!
-   //! <b>Effects</b>: Constructs an empty container and inserts elements from
-   //!   [b, e).
-   //!
-   //! <b>Complexity</b>: Linear in N if [b, e) is already sorted using
-   //!   comp and otherwise N * log N, where N is the distance between first and last.
-   //!
-   //! <b>Throws</b>: If value_traits::node_traits::node
-   //!   constructor throws (this does not happen with predefined Boost.Intrusive hooks)
-   //!   or the copy constructor/operator() of the key_compare object throws. Basic guarantee.
-   template<class Iterator>
-   bstree_impl( bool unique, Iterator b, Iterator e
-              , const key_compare &cmp     = key_compare()
-              , const value_traits &v_traits = value_traits())
-      : data_type(cmp, v_traits)
-   {
-      //bstbase releases elements in case of exceptions
-      if(unique)
-         this->insert_unique(b, e);
-      else
-         this->insert_equal(b, e);
-   }
-
-   //! <b>Effects</b>: Constructs a container moving resources from another container.
-   //!   Internal comparison object and value traits are move constructed and
-   //!   nodes belonging to x (except the node representing the "end") are linked to *this.
-   //!
-   //! <b>Complexity</b>: Constant.
-   //!
-   //! <b>Throws</b>: If value_traits::node_traits::node's
-   //!   move constructor throws (this does not happen with predefined Boost.Intrusive hooks)
-   //!   or the move constructor of the comparison objet throws.
-   bstree_impl(BOOST_RV_REF(bstree_impl) x)
-      : data_type(::boost::move(x.get_comp()), ::boost::move(x.get_value_traits()))
-   {
-      this->swap(x);
-   }
-
-   //! <b>Effects</b>: Equivalent to swap
-   //!
-   BOOST_INTRUSIVE_FORCEINLINE bstree_impl& operator=(BOOST_RV_REF(bstree_impl) x)
-   {  this->swap(x); return *this;  }
-
-   #ifdef BOOST_INTRUSIVE_DOXYGEN_INVOKED
-   //! <b>Effects</b>: Detaches all elements from this. The objects in the set
-   //!   are not deleted (i.e. no destructors are called), but the nodes according to
-   //!   the value_traits template parameter are reinitialized and thus can be reused.
-   //!
-   //! <b>Complexity</b>: Linear to elements contained in *this.
-   //!
-   //! <b>Throws</b>: Nothing.
-   ~bstree_impl()
-   {}
-
-   //! <b>Effects</b>: Returns an iterator pointing to the beginning of the container.
-   //!
-   //! <b>Complexity</b>: Constant.
-   //!
-   //! <b>Throws</b>: Nothing.
-   iterator begin() BOOST_NOEXCEPT;
-
-   //! <b>Effects</b>: Returns a const_iterator pointing to the beginning of the container.
-   //!
-   //! <b>Complexity</b>: Constant.
-   //!
-   //! <b>Throws</b>: Nothing.
-   const_iterator begin() const BOOST_NOEXCEPT;
-
-   //! <b>Effects</b>: Returns a const_iterator pointing to the beginning of the container.
-   //!
-   //! <b>Complexity</b>: Constant.
-   //!
-   //! <b>Throws</b>: Nothing.
-   const_iterator cbegin() const BOOST_NOEXCEPT;
-
-   //! <b>Effects</b>: Returns an iterator pointing to the end of the container.
-   //!
-   //! <b>Complexity</b>: Constant.
-   //!
-   //! <b>Throws</b>: Nothing.
-   iterator end() BOOST_NOEXCEPT;
-
-   //! <b>Effects</b>: Returns a const_iterator pointing to the end of the container.
-   //!
-   //! <b>Complexity</b>: Constant.
-   //!
-   //! <b>Throws</b>: Nothing.
-   const_iterator end() const BOOST_NOEXCEPT;
-
-   //! <b>Effects</b>: Returns a const_iterator pointing to the end of the container.
-   //!
-   //! <b>Complexity</b>: Constant.
-   //!
-   //! <b>Throws</b>: Nothing.
-   const_iterator cend() const BOOST_NOEXCEPT;
-
-   //! <b>Effects</b>: Returns a reverse_iterator pointing to the beginning of the
-   //!    reversed container.
-   //!
-   //! <b>Complexity</b>: Constant.
-   //!
-   //! <b>Throws</b>: Nothing.
-   reverse_iterator rbegin() BOOST_NOEXCEPT;
-
-   //! <b>Effects</b>: Returns a const_reverse_iterator pointing to the beginning
-   //!    of the reversed container.
-   //!
-   //! <b>Complexity</b>: Constant.
-   //!
-   //! <b>Throws</b>: Nothing.
-   const_reverse_iterator rbegin() const BOOST_NOEXCEPT;
-
-   //! <b>Effects</b>: Returns a const_reverse_iterator pointing to the beginning
-   //!    of the reversed container.
-   //!
-   //! <b>Complexity</b>: Constant.
-   //!
-   //! <b>Throws</b>: Nothing.
-   const_reverse_iterator crbegin() const BOOST_NOEXCEPT;
-
-   //! <b>Effects</b>: Returns a reverse_iterator pointing to the end
-   //!    of the reversed container.
-   //!
-   //! <b>Complexity</b>: Constant.
-   //!
-   //! <b>Throws</b>: Nothing.
-   reverse_iterator rend() BOOST_NOEXCEPT;
-
-   //! <b>Effects</b>: Returns a const_reverse_iterator pointing to the end
-   //!    of the reversed container.
-   //!
-   //! <b>Complexity</b>: Constant.
-   //!
-   //! <b>Throws</b>: Nothing.
-   const_reverse_iterator rend() const BOOST_NOEXCEPT;
-
-   //! <b>Effects</b>: Returns a const_reverse_iterator pointing to the end
-   //!    of the reversed container.
-   //!
-   //! <b>Complexity</b>: Constant.
-   //!
-   //! <b>Throws</b>: Nothing.
-   const_reverse_iterator crend() const BOOST_NOEXCEPT;
-
-   //! <b>Effects</b>: Returns a iterator pointing to the root node of the container or end() if not present.
-   //!
-   //! <b>Complexity</b>: Constant.
-   //!
-   //! <b>Throws</b>: Nothing.
-   iterator root() BOOST_NOEXCEPT;
-
-   //! <b>Effects</b>: Returns a const_iterator pointing to the root node of the container or cend() if not present.
-   //!
-   //! <b>Complexity</b>: Constant.
-   //!
-   //! <b>Throws</b>: Nothing.
-   const_iterator root() const BOOST_NOEXCEPT;
-
-   //! <b>Effects</b>: Returns a const_iterator pointing to the root node of the container or cend() if not present.
-   //!
-   //! <b>Complexity</b>: Constant.
-   //!
-   //! <b>Throws</b>: Nothing.
-   const_iterator croot() const BOOST_NOEXCEPT;
-
-   #endif   //#ifdef BOOST_INTRUSIVE_DOXYGEN_INVOKED
-
-   //! <b>Precondition</b>: end_iterator must be a valid end iterator
-   //!   of the container.
-   //!
-   //! <b>Effects</b>: Returns a const reference to the container associated to the end iterator
-   //!
-   //! <b>Throws</b>: Nothing.
-   //!
-   //! <b>Complexity</b>: Constant.
-   static bstree_impl &container_from_end_iterator(iterator end_iterator) BOOST_NOEXCEPT
-   {
-      return static_cast<bstree_impl&>
-               (data_type::get_tree_base_from_end_iterator(end_iterator));
-   }
-
-   //! <b>Precondition</b>: end_iterator must be a valid end const_iterator
-   //!   of the container.
-   //!
-   //! <b>Effects</b>: Returns a const reference to the container associated to the iterator
-   //!
-   //! <b>Throws</b>: Nothing.
-   //!
-   //! <b>Complexity</b>: Constant.
-   static const bstree_impl &container_from_end_iterator(const_iterator end_iterator) BOOST_NOEXCEPT
-   {
-      return static_cast<bstree_impl&>
-               (data_type::get_tree_base_from_end_iterator(end_iterator));
-   }
-
-   //! <b>Precondition</b>: it must be a valid iterator
-   //!   of the container.
-   //!
-   //! <b>Effects</b>: Returns a const reference to the container associated to the iterator
-   //!
-   //! <b>Throws</b>: Nothing.
-   //!
-   //! <b>Complexity</b>: Logarithmic.
-   static bstree_impl &container_from_iterator(iterator it) BOOST_NOEXCEPT
-   {  return container_from_end_iterator(it.end_iterator_from_it());   }
-
-   //! <b>Precondition</b>: it must be a valid end const_iterator
-   //!   of container.
-   //!
-   //! <b>Effects</b>: Returns a const reference to the container associated to the end iterator
-   //!
-   //! <b>Throws</b>: Nothing.
-   //!
-   //! <b>Complexity</b>: Logarithmic.
-   static const bstree_impl &container_from_iterator(const_iterator it) BOOST_NOEXCEPT
-   {  return container_from_end_iterator(it.end_iterator_from_it());   }
-
-   #ifdef BOOST_INTRUSIVE_DOXYGEN_INVOKED
-
-   //! <b>Effects</b>: Returns the key_compare object used by the container.
-   //!
-   //! <b>Complexity</b>: Constant.
-   //!
-   //! <b>Throws</b>: If key_compare copy-constructor throws.
-   key_compare key_comp() const;
-
-   //! <b>Effects</b>: Returns the value_compare object used by the container.
-   //!
-   //! <b>Complexity</b>: Constant.
-   //!
-   //! <b>Throws</b>: If value_compare copy-constructor throws.
-   value_compare value_comp() const;
-
-   #endif   //#ifdef BOOST_INTRUSIVE_DOXYGEN_INVOKED
-
-   //! <b>Effects</b>: Returns true if the container is empty.
-   //!
-   //! <b>Complexity</b>: Constant.
-   //!
-   //! <b>Throws</b>: Nothing.
-   bool empty() const BOOST_NOEXCEPT
-   {
-      if(ConstantTimeSize){
-         return !this->data_type::sz_traits().get_size();
-      }
-      else{
-         return algo_type::unique(this->header_ptr());
-      }
-   }
-
-   //! <b>Effects</b>: Returns the number of elements stored in the container.
-   //!
-   //! <b>Complexity</b>: Linear to elements contained in *this
-   //!   if constant-time size option is disabled. Constant time otherwise.
-   //!
-   //! <b>Throws</b>: Nothing.
-   size_type size() const BOOST_NOEXCEPT
-   {
-      BOOST_IF_CONSTEXPR(constant_time_size)
-         return this->sz_traits().get_size();
-      else{
-         return (size_type)node_algorithms::size(this->header_ptr());
-      }
-   }
-
-   //! <b>Effects</b>: Swaps the contents of two containers.
-   //!
-   //! <b>Complexity</b>: Constant.
-   //!
-   //! <b>Throws</b>: If the comparison functor's swap call throws.
-   void swap(bstree_impl& other)
-   {
-      //This can throw
-      ::boost::adl_move_swap(this->get_comp(), other.get_comp());
-      //These can't throw
-      node_algorithms::swap_tree(this->header_ptr(), node_ptr(other.header_ptr()));
-      this->sz_traits().swap(other.sz_traits());
-   }
-
-   //! <b>Requires</b>: Disposer::operator()(pointer) shouldn't throw.
-   //!   Cloner should yield to nodes equivalent to the original nodes.
-   //!
-   //! <b>Effects</b>: Erases all the elements from *this
-   //!   calling Disposer::operator()(pointer), clones all the
-   //!   elements from src calling Cloner::operator()(const_reference )
-   //!   and inserts them on *this. Copies the predicate from the source container.
-   //!
-   //!   If cloner throws, all cloned elements are unlinked and disposed
-   //!   calling Disposer::operator()(pointer).
-   //!
-   //! <b>Complexity</b>: Linear to erased plus inserted elements.
-   //!
-   //! <b>Throws</b>: If cloner throws or predicate copy assignment throws. Basic guarantee.
-   template <class Cloner, class Disposer>
-   void clone_from(const bstree_impl &src, Cloner cloner, Disposer disposer)
-   {
-      this->clear_and_dispose(disposer);
-      if(!src.empty()){
-         detail::exception_disposer<bstree_impl, Disposer>
-            rollback(*this, disposer);
-         node_algorithms::clone
-            (src.header_ptr()
-            ,this->header_ptr()
-            ,detail::node_cloner <Cloner,    value_traits, AlgoType>(cloner,   &this->get_value_traits())
-            ,detail::node_disposer<Disposer, value_traits, AlgoType>(disposer, &this->get_value_traits()));
-         this->sz_traits().set_size(src.sz_traits().get_size());
-         this->get_comp() = src.get_comp();
-         rollback.release();
-      }
-   }
-
-   //! <b>Requires</b>: Disposer::operator()(pointer) shouldn't throw.
-   //!   Cloner should yield to nodes equivalent to the original nodes.
-   //!
-   //! <b>Effects</b>: Erases all the elements from *this
-   //!   calling Disposer::operator()(pointer), clones all the
-   //!   elements from src calling Cloner::operator()(reference)
-   //!   and inserts them on *this. Copies the predicate from the source container.
-   //!
-   //!   If cloner throws, all cloned elements are unlinked and disposed
-   //!   calling Disposer::operator()(pointer).
-   //!
-   //! <b>Complexity</b>: Linear to erased plus inserted elements.
-   //!
-   //! <b>Throws</b>: If cloner throws or predicate copy assignment throws. Basic guarantee.
-   //!
-   //! <b>Note</b>: This version can modify the source container, useful to implement
-   //!    move semantics.
-   template <class Cloner, class Disposer>
-   void clone_from(BOOST_RV_REF(bstree_impl) src, Cloner cloner, Disposer disposer)
-   {
-      this->clear_and_dispose(disposer);
-      if(!src.empty()){
-         detail::exception_disposer<bstree_impl, Disposer>
-            rollback(*this, disposer);
-         node_algorithms::clone
-            (src.header_ptr()
-            ,this->header_ptr()
-            ,detail::node_cloner <Cloner,    value_traits, AlgoType, false>(cloner,   &this->get_value_traits())
-            ,detail::node_disposer<Disposer, value_traits, AlgoType>(disposer, &this->get_value_traits()));
-         this->sz_traits().set_size(src.sz_traits().get_size());
-         this->get_comp() = src.get_comp();
-         rollback.release();
-      }
-   }
-
-   //! <b>Requires</b>: value must be an lvalue
-   //!
-   //! <b>Effects</b>: Inserts value into the container before the upper bound.
-   //!
-   //! <b>Complexity</b>: Average complexity for insert element is at
-   //!   most logarithmic.
-   //!
-   //! <b>Throws</b>: If the internal key_compare ordering function throws. Strong guarantee.
-   //!
-   //! <b>Note</b>: Does not affect the validity of iterators and references.
-   //!   No copy-constructors are called.
-   iterator insert_equal(reference value)
-   {
-      node_ptr to_insert(this->get_value_traits().to_node_ptr(value));
-      BOOST_INTRUSIVE_SAFE_HOOK_DEFAULT_ASSERT(!safemode_or_autounlink || node_algorithms::unique(to_insert));
-      iterator ret(node_algorithms::insert_equal_upper_bound
-         (this->header_ptr(), to_insert, this->key_node_comp(this->key_comp())), this->priv_value_traits_ptr());
-      this->sz_traits().increment();
-      return ret;
-   }
-
-   //! <b>Requires</b>: value must be an lvalue, and "hint" must be
-   //!   a valid iterator.
-   //!
-   //! <b>Effects</b>: Inserts x into the container, using "hint" as a hint to
-   //!   where it will be inserted. If "hint" is the upper_bound
-   //!   the insertion takes constant time (two comparisons in the worst case)
-   //!
-   //! <b>Complexity</b>: Logarithmic in general, but it is amortized
-   //!   constant time if t is inserted immediately before hint.
-   //!
-   //! <b>Throws</b>: If the internal key_compare ordering function throws. Strong guarantee.
-   //!
-   //! <b>Note</b>: Does not affect the validity of iterators and references.
-   //!   No copy-constructors are called.
-   iterator insert_equal(const_iterator hint, reference value)
-   {
-      node_ptr to_insert(this->get_value_traits().to_node_ptr(value));
-      BOOST_INTRUSIVE_SAFE_HOOK_DEFAULT_ASSERT(!safemode_or_autounlink || node_algorithms::unique(to_insert));
-      iterator ret(node_algorithms::insert_equal
-         (this->header_ptr(), hint.pointed_node(), to_insert, this->key_node_comp(this->key_comp())), this->priv_value_traits_ptr());
-      this->sz_traits().increment();
-      return ret;
-   }
-
-   //! <b>Requires</b>: Dereferencing iterator must yield an lvalue
-   //!   of type value_type.
-   //!
-   //! <b>Effects</b>: Inserts a each element of a range into the container
-   //!   before the upper bound of the key of each element.
-   //!
-   //! <b>Complexity</b>: Insert range is in general O(N * log(N)), where N is the
-   //!   size of the range. However, it is linear in N if the range is already sorted
-   //!   by value_comp().
-   //!
-   //! <b>Throws</b>: If the comparison functor call throws.
-   //!
-   //! <b>Note</b>: Does not affect the validity of iterators and references.
-   //!   No copy-constructors are called.
-   template<class Iterator>
-   void insert_equal(Iterator b, Iterator e)
-   {
-      iterator iend(this->end());
-      for (; b != e; ++b)
-         this->insert_equal(iend, *b);
-   }
-
-   //! <b>Requires</b>: value must be an lvalue
-   //!
-   //! <b>Effects</b>: Inserts value into the container if the value
-   //!   is not already present.
-   //!
-   //! <b>Complexity</b>: Average complexity for insert element is at
-   //!   most logarithmic.
-   //!
-   //! <b>Throws</b>: If the comparison functor call throws.
-   //!
-   //! <b>Note</b>: Does not affect the validity of iterators and references.
-   //!   No copy-constructors are called.
-   std::pair<iterator, bool> insert_unique(reference value)
-   {
-      insert_commit_data commit_data;
-      std::pair<node_ptr, bool> ret =
-         (node_algorithms::insert_unique_check
-            (this->header_ptr(), key_of_value()(value), this->key_node_comp(this->key_comp()), commit_data));
-      return std::pair<iterator, bool>
-         ( ret.second ? this->insert_unique_commit(value, commit_data)
-                      : iterator(ret.first, this->priv_value_traits_ptr())
-         , ret.second);
-   }
-
-   //! <b>Requires</b>: value must be an lvalue, and "hint" must be
-   //!   a valid iterator
-   //!
-   //! <b>Effects</b>: Tries to insert x into the container, using "hint" as a hint
-   //!   to where it will be inserted.
-   //!
-   //! <b>Complexity</b>: Logarithmic in general, but it is amortized
-   //!   constant time (two comparisons in the worst case)
-   //!   if t is inserted immediately before hint.
-   //!
-   //! <b>Throws</b>: If the comparison functor call throws.
-   //!
-   //! <b>Note</b>: Does not affect the validity of iterators and references.
-   //!   No copy-constructors are called.
-   iterator insert_unique(const_iterator hint, reference value)
-   {
-      insert_commit_data commit_data;
-      std::pair<node_ptr, bool> ret =
-         (node_algorithms::insert_unique_check
-            (this->header_ptr(), hint.pointed_node(), key_of_value()(value), this->key_node_comp(this->key_comp()), commit_data));
-      return ret.second ? this->insert_unique_commit(value, commit_data)
-                        : iterator(ret.first, this->priv_value_traits_ptr());
-   }
-
-   //! <b>Requires</b>: Dereferencing iterator must yield an lvalue
-   //!   of type value_type.
-   //!
-   //! <b>Effects</b>: Tries to insert each element of a range into the container.
-   //!
-   //! <b>Complexity</b>: Insert range is in general O(N * log(N)), where N is the
-   //!   size of the range. However, it is linear in N if the range is already sorted
-   //!   by value_comp().
-   //!
-   //! <b>Throws</b>: If the comparison functor call throws.
-   //!
-   //! <b>Note</b>: Does not affect the validity of iterators and references.
-   //!   No copy-constructors are called.
-   template<class Iterator>
-   void insert_unique(Iterator b, Iterator e)
-   {
-      if(this->empty()){
-         iterator iend(this->end());
-         for (; b != e; ++b)
-            this->insert_unique(iend, *b);
-      }
-      else{
-         for (; b != e; ++b)
-            this->insert_unique(*b);
-      }
-   }
-
-   #ifdef BOOST_INTRUSIVE_DOXYGEN_INVOKED
-
-   //! <b>Effects</b>: Checks if a value can be inserted in the container, using
-   //!   a user provided key instead of the value itself.
-   //!
-   //! <b>Returns</b>: If there is an equivalent value
-   //!   returns a pair containing an iterator to the already present value
-   //!   and false. If the value can be inserted returns true in the returned
-   //!   pair boolean and fills "commit_data" that is meant to be used with
-   //!   the "insert_commit" function.
-   //!
-   //! <b>Complexity</b>: Average complexity is at most logarithmic.
-   //!
-   //! <b>Throws</b>: If the comp ordering function throws. Strong guarantee.
-   std::pair<iterator, bool> insert_unique_check(const key_type &key, insert_commit_data &commit_data);
-
-   //! <b>Effects</b>: Checks if a value can be inserted in the container, using
-   //!   a user provided key instead of the value itself, using "hint"
-   //!   as a hint to where it will be inserted.
-   //!
-   //! <b>Returns</b>: If there is an equivalent value
-   //!   returns a pair containing an iterator to the already present value
-   //!   and false. If the value can be inserted returns true in the returned
-   //!   pair boolean and fills "commit_data" that is meant to be used with
-   //!   the "insert_commit" function.
-   //!
-   //! <b>Complexity</b>: Logarithmic in general, but it's amortized
-   //!   constant time if t is inserted immediately before hint.
-   //!
-   //! <b>Throws</b>: If the comp ordering function throws. Strong guarantee.
-   std::pair<iterator, bool> insert_unique_check(const_iterator hint, const key_type &key, insert_commit_data &commit_data);
-
-   //! <b>Requires</b>: comp must be a comparison function that induces
-   //!   the same strict weak ordering as key_compare. The difference is that
-   //!   comp compares an arbitrary key with the contained values.
-   //!
-   //! <b>Effects</b>: Checks if a value can be inserted in the container, using
-   //!   a user provided key instead of the value itself.
-   //!
-   //! <b>Returns</b>: If there is an equivalent value
-   //!   returns a pair containing an iterator to the already present value
-   //!   and false. If the value can be inserted returns true in the returned
-   //!   pair boolean and fills "commit_data" that is meant to be used with
-   //!   the "insert_commit" function.
-   //!
-   //! <b>Complexity</b>: Average complexity is at most logarithmic.
-   //!
-   //! <b>Throws</b>: If the comp ordering function throws. Strong guarantee.
-   //!
-   //! <b>Notes</b>: This function is used to improve performance when constructing
-   //!   a value_type is expensive: if there is an equivalent value
-   //!   the constructed object must be discarded. Many times, the part of the
-   //!   node that is used to impose the order is much cheaper to construct
-   //!   than the value_type and this function offers the possibility to use that
-   //!   part to check if the insertion will be successful.
-   //!
-   //!   If the check is successful, the user can construct the value_type and use
-   //!   "insert_commit" to insert the object in constant-time. This gives a total
-   //!   logarithmic complexity to the insertion: check(O(log(N)) + commit(O(1)).
-   //!
-   //!   "commit_data" remains valid for a subsequent "insert_commit" only if no more
-   //!   objects are inserted or erased from the container.
-   template<class KeyType, class KeyTypeKeyCompare>
-   std::pair<iterator, bool> insert_unique_check
-      (const KeyType &key, KeyTypeKeyCompare comp, insert_commit_data &commit_data);
-
-   //! <b>Requires</b>: comp must be a comparison function that induces
-   //!   the same strict weak ordering as key_compare. The difference is that
-   //!   comp compares an arbitrary key with the contained values.
-   //!
-   //! <b>Effects</b>: Checks if a value can be inserted in the container, using
-   //!   a user provided key instead of the value itself, using "hint"
-   //!   as a hint to where it will be inserted.
-   //!
-   //! <b>Returns</b>: If there is an equivalent value
-   //!   returns a pair containing an iterator to the already present value
-   //!   and false. If the value can be inserted returns true in the returned
-   //!   pair boolean and fills "commit_data" that is meant to be used with
-   //!   the "insert_commit" function.
-   //!
-   //! <b>Complexity</b>: Logarithmic in general, but it's amortized
-   //!   constant time if t is inserted immediately before hint.
-   //!
-   //! <b>Throws</b>: If the comp ordering function throws. Strong guarantee.
-   //!
-   //! <b>Notes</b>: This function is used to improve performance when constructing
-   //!   a value_type is expensive: if there is an equivalent value
-   //!   the constructed object must be discarded. Many times, the part of the
-   //!   constructing that is used to impose the order is much cheaper to construct
-   //!   than the value_type and this function offers the possibility to use that key
-   //!   to check if the insertion will be successful.
-   //!
-   //!   If the check is successful, the user can construct the value_type and use
-   //!   "insert_commit" to insert the object in constant-time. This can give a total
-   //!   constant-time complexity to the insertion: check(O(1)) + commit(O(1)).
-   //!
-   //!   "commit_data" remains valid for a subsequent "insert_commit" only if no more
-   //!   objects are inserted or erased from the container.
-   template<class KeyType, class KeyTypeKeyCompare>
-   std::pair<iterator, bool> insert_unique_check
-      (const_iterator hint, const KeyType &key
-      ,KeyTypeKeyCompare comp, insert_commit_data &commit_data);
-
-   #endif   //#ifdef BOOST_INTRUSIVE_DOXYGEN_INVOKED
-
-   //! <b>Requires</b>: value must be an lvalue of type value_type. commit_data
-   //!   must have been obtained from a previous call to "insert_check".
-   //!   No objects should have been inserted or erased from the container between
-   //!   the "insert_check" that filled "commit_data" and the call to "insert_commit".
-   //!
-   //! <b>Effects</b>: Inserts the value in the container using the information obtained
-   //!   from the "commit_data" that a previous "insert_check" filled.
-   //!
-   //! <b>Returns</b>: An iterator to the newly inserted object.
-   //!
-   //! <b>Complexity</b>: Constant time.
-   //!
-   //! <b>Throws</b>: Nothing.
-   //!
-   //! <b>Notes</b>: This function has only sense if a "insert_check" has been
-   //!   previously executed to fill "commit_data". No value should be inserted or
-   //!   erased between the "insert_check" and "insert_commit" calls.
-   iterator insert_unique_commit(reference value, const insert_commit_data &commit_data) BOOST_NOEXCEPT
-   {
-      node_ptr to_insert(this->get_value_traits().to_node_ptr(value));
-      BOOST_INTRUSIVE_SAFE_HOOK_DEFAULT_ASSERT(!safemode_or_autounlink || node_algorithms::unique(to_insert));
-
-      #if !(defined(BOOST_DISABLE_ASSERTS) || ( defined(BOOST_ENABLE_ASSERT_DEBUG_HANDLER) && defined(NDEBUG) ))
-      //Test insertion position is correct
-      iterator p(commit_data.node, this->priv_value_traits_ptr());
-      if(!commit_data.link_left){
-         ++p;
-      }
-      //Check if the insertion point is correct to detect wrong
-      //uses insert_unique_check
-      BOOST_ASSERT(( p == this->end()   || !this->get_comp()(*p, value)   ));
-      BOOST_ASSERT(( p == this->begin() || !this->get_comp()(value, *--p) ));
-      #endif
-
-      node_algorithms::insert_unique_commit
-               (this->header_ptr(), to_insert, commit_data);
-      this->sz_traits().increment();
-      return iterator(to_insert, this->priv_value_traits_ptr());
-   }
-
-   //! <b>Requires</b>: value must be an lvalue, "pos" must be
-   //!   a valid iterator (or end) and must be the succesor of value
-   //!   once inserted according to the predicate
-   //!
-   //! <b>Effects</b>: Inserts x into the container before "pos".
-   //!
-   //! <b>Complexity</b>: Constant time.
-   //!
-   //! <b>Throws</b>: Nothing.
-   //!
-   //! <b>Note</b>: This function does not check preconditions so if "pos" is not
-   //! the successor of "value" container ordering invariant will be broken.
-   //! This is a low-level function to be used only for performance reasons
-   //! by advanced users.
-   iterator insert_before(const_iterator pos, reference value) BOOST_NOEXCEPT
-   {
-      node_ptr to_insert(this->get_value_traits().to_node_ptr(value));
-      BOOST_INTRUSIVE_SAFE_HOOK_DEFAULT_ASSERT(!safemode_or_autounlink || node_algorithms::unique(to_insert));
-      this->sz_traits().increment();
-      return iterator(node_algorithms::insert_before
-         (this->header_ptr(), pos.pointed_node(), to_insert), this->priv_value_traits_ptr());
-   }
-
-   //! <b>Requires</b>: value must be an lvalue, and it must be no less
-   //!   than the greatest inserted key
-   //!
-   //! <b>Effects</b>: Inserts x into the container in the last position.
-   //!
-   //! <b>Complexity</b>: Constant time.
-   //!
-   //! <b>Throws</b>: Nothing.
-   //!
-   //! <b>Note</b>: This function does not check preconditions so if value is
-   //!   less than the greatest inserted key container ordering invariant will be broken.
-   //!   This function is slightly more efficient than using "insert_before".
-   //!   This is a low-level function to be used only for performance reasons
-   //!   by advanced users.
-   void push_back(reference value) BOOST_NOEXCEPT
-   {
-      node_ptr to_insert(this->get_value_traits().to_node_ptr(value));
-      BOOST_INTRUSIVE_SAFE_HOOK_DEFAULT_ASSERT(!safemode_or_autounlink || node_algorithms::unique(to_insert));
-      this->sz_traits().increment();
-      node_algorithms::push_back(this->header_ptr(), to_insert);
-   }
-
-   //! <b>Requires</b>: value must be an lvalue, and it must be no greater
-   //!   than the minimum inserted key
-   //!
-   //! <b>Effects</b>: Inserts x into the container in the first position.
-   //!
-   //! <b>Complexity</b>: Constant time.
-   //!
-   //! <b>Throws</b>: Nothing.
-   //!
-   //! <b>Note</b>: This function does not check preconditions so if value is
-   //!   greater than the minimum inserted key container ordering invariant will be broken.
-   //!   This function is slightly more efficient than using "insert_before".
-   //!   This is a low-level function to be used only for performance reasons
-   //!   by advanced users.
-   void push_front(reference value) BOOST_NOEXCEPT
-   {
-      node_ptr to_insert(this->get_value_traits().to_node_ptr(value));
-      BOOST_INTRUSIVE_SAFE_HOOK_DEFAULT_ASSERT(!safemode_or_autounlink || node_algorithms::unique(to_insert));
-      this->sz_traits().increment();
-      node_algorithms::push_front(this->header_ptr(), to_insert);
-   }
-
-   //! <b>Effects</b>: Erases the element pointed to by i.
-   //!
-   //! <b>Complexity</b>: Average complexity for erase element is constant time.
-   //!
-   //! <b>Throws</b>: Nothing.
-   //!
-   //! <b>Note</b>: Invalidates the iterators (but not the references)
-   //!    to the erased elements. No destructors are called.
-   iterator erase(const_iterator i) BOOST_NOEXCEPT
-   {
-      const_iterator ret(i);
-      ++ret;
-      node_ptr to_erase(i.pointed_node());
-      BOOST_INTRUSIVE_SAFE_HOOK_DEFAULT_ASSERT(!safemode_or_autounlink || !node_algorithms::unique(to_erase));
-      node_algorithms::erase(this->header_ptr(), to_erase);
-      this->sz_traits().decrement();
-      BOOST_IF_CONSTEXPR(safemode_or_autounlink)
-         node_algorithms::init(to_erase);
-      return ret.unconst();
-   }
-
-   //! <b>Effects</b>: Erases the range pointed to by b end e.
-   //!
-   //! <b>Complexity</b>: Average complexity for erase range is at most
-   //!   O(log(size() + N)), where N is the number of elements in the range.
-   //!
-   //! <b>Throws</b>: Nothing.
-   //!
-   //! <b>Note</b>: Invalidates the iterators (but not the references)
-   //!    to the erased elements. No destructors are called.
-   iterator erase(const_iterator b, const_iterator e) BOOST_NOEXCEPT
-   {  size_type n;   return this->private_erase(b, e, n);   }
-
-   //! <b>Effects</b>: Erases all the elements with the given value.
-   //!
-   //! <b>Returns</b>: The number of erased elements.
-   //!
-   //! <b>Complexity</b>: O(log(size() + N).
-   //!
-   //! <b>Throws</b>: Nothing.
-   //!
-   //! <b>Note</b>: Invalidates the iterators (but not the references)
-   //!    to the erased elements. No destructors are called.
-   size_type erase(const key_type &key) BOOST_NOEXCEPT
-   {  return this->erase(key, this->key_comp());   }
-
-   //! <b>Requires</b>: key is a value such that `*this` is partitioned with respect to
-   //!   comp(nk, key) and !comp(key, nk), with comp(nk, key) implying !comp(key, nk),
-   //!   with nk the key_type of a value_type inserted into `*this`.
-   //!
-   //! <b>Effects</b>: Erases all the elements with the given key.
-   //!   according to the comparison functor "comp".
-   //!
-   //! <b>Returns</b>: The number of erased elements.
-   //!
-   //! <b>Complexity</b>: O(log(size() + N).
-   //!
-   //! <b>Throws</b>: Nothing.
-   //!
-   //! <b>Note</b>: Invalidates the iterators (but not the references)
-   //!    to the erased elements. No destructors are called.
-   template<class KeyType, class KeyTypeKeyCompare>
-   BOOST_INTRUSIVE_DOC1ST(size_type
-      , typename detail::disable_if_convertible<KeyTypeKeyCompare BOOST_INTRUSIVE_I const_iterator BOOST_INTRUSIVE_I size_type>::type)
-      erase(const KeyType& key, KeyTypeKeyCompare comp)
-   {
-      std::pair<iterator,iterator> p = this->equal_range(key, comp);
-      size_type n;
-      this->private_erase(p.first, p.second, n);
-      return n;
-   }
-
-   //! <b>Requires</b>: Disposer::operator()(pointer) shouldn't throw.
-   //!
-   //! <b>Effects</b>: Erases the element pointed to by i.
-   //!   Disposer::operator()(pointer) is called for the removed element.
-   //!
-   //! <b>Complexity</b>: Average complexity for erase element is constant time.
-   //!
-   //! <b>Throws</b>: Nothing.
-   //!
-   //! <b>Note</b>: Invalidates the iterators
-   //!    to the erased elements.
-   template<class Disposer>
-   iterator erase_and_dispose(const_iterator i, Disposer disposer) BOOST_NOEXCEPT
-   {
-      node_ptr to_erase(i.pointed_node());
-      iterator ret(this->erase(i));
-      disposer(this->get_value_traits().to_value_ptr(to_erase));
-      return ret;
-   }
-
-   //! <b>Requires</b>: Disposer::operator()(pointer) shouldn't throw.
-   //!
-   //! <b>Effects</b>: Erases all the elements with the given value.
-   //!   Disposer::operator()(pointer) is called for the removed elements.
-   //!
-   //! <b>Returns</b>: The number of erased elements.
-   //!
-   //! <b>Complexity</b>: O(log(size() + N).
-   //!
-   //! <b>Throws</b>: Nothing.
-   //!
-   //! <b>Note</b>: Invalidates the iterators (but not the references)
-   //!    to the erased elements. No destructors are called.
-   template<class Disposer>
-   size_type erase_and_dispose(const key_type &key, Disposer disposer)
-   {
-      std::pair<iterator,iterator> p = this->equal_range(key);
-      size_type n;
-      this->private_erase(p.first, p.second, n, disposer);
-      return n;
-   }
-
-   //! <b>Requires</b>: Disposer::operator()(pointer) shouldn't throw.
-   //!
-   //! <b>Effects</b>: Erases the range pointed to by b end e.
-   //!   Disposer::operator()(pointer) is called for the removed elements.
-   //!
-   //! <b>Complexity</b>: Average complexity for erase range is at most
-   //!   O(log(size() + N)), where N is the number of elements in the range.
-   //!
-   //! <b>Throws</b>: Nothing.
-   //!
-   //! <b>Note</b>: Invalidates the iterators
-   //!    to the erased elements.
-   template<class Disposer>
-   iterator erase_and_dispose(const_iterator b, const_iterator e, Disposer disposer) BOOST_NOEXCEPT
-   {  size_type n;   return this->private_erase(b, e, n, disposer);   }
-
-   //! <b>Requires</b>: key is a value such that `*this` is partitioned with respect to
-   //!   comp(nk, key) and !comp(key, nk), with comp(nk, key) implying !comp(key, nk)
-   //!   and nk the key_type of a value_type inserted into `*this`.
-   //!
-   //! <b>Requires</b>: Disposer::operator()(pointer) shouldn't throw.
-   //!
-   //! <b>Effects</b>: Erases all the elements with the given key.
-   //!   according to the comparison functor "comp".
-   //!   Disposer::operator()(pointer) is called for the removed elements.
-   //!
-   //! <b>Returns</b>: The number of erased elements.
-   //!
-   //! <b>Complexity</b>: O(log(size() + N).
-   //!
-   //! <b>Throws</b>: Nothing.
-   //!
-   //! <b>Note</b>: Invalidates the iterators
-   //!    to the erased elements.
-   template<class KeyType, class KeyTypeKeyCompare, class Disposer>
-   BOOST_INTRUSIVE_DOC1ST(size_type
-      , typename detail::disable_if_convertible<KeyTypeKeyCompare BOOST_INTRUSIVE_I const_iterator BOOST_INTRUSIVE_I size_type>::type)
-      erase_and_dispose(const KeyType& key, KeyTypeKeyCompare comp, Disposer disposer)
-   {
-      std::pair<iterator,iterator> p = this->equal_range(key, comp);
-      size_type n;
-      this->private_erase(p.first, p.second, n, disposer);
-      return n;
-   }
-
-   //! <b>Effects</b>: Erases all of the elements.
-   //!
-   //! <b>Complexity</b>: Linear to the number of elements on the container.
-   //!   if it's a safe-mode or auto-unlink value_type. Constant time otherwise.
-   //!
-   //! <b>Throws</b>: Nothing.
-   //!
-   //! <b>Note</b>: Invalidates the iterators (but not the references)
-   //!    to the erased elements. No destructors are called.
-   void clear() BOOST_NOEXCEPT
-   {
-      BOOST_IF_CONSTEXPR(safemode_or_autounlink){
-         this->clear_and_dispose(detail::null_disposer());
-      }
-      else{
-         node_algorithms::init_header(this->header_ptr());
-         this->sz_traits().set_size(0);
-      }
-   }
-
-   //! <b>Effects</b>: Erases all of the elements calling disposer(p) for
-   //!   each node to be erased.
-   //! <b>Complexity</b>: Average complexity for is at most O(log(size() + N)),
-   //!   where N is the number of elements in the container.
-   //!
-   //! <b>Throws</b>: Nothing.
-   //!
-   //! <b>Note</b>: Invalidates the iterators (but not the references)
-   //!    to the erased elements. Calls N times to disposer functor.
-   template<class Disposer>
-   void clear_and_dispose(Disposer disposer) BOOST_NOEXCEPT
-   {
-      node_algorithms::clear_and_dispose(this->header_ptr()
-         , detail::node_disposer<Disposer, value_traits, AlgoType>(disposer, &this->get_value_traits()));
-      node_algorithms::init_header(this->header_ptr());
-      this->sz_traits().set_size(0);
-   }
-
-   //! <b>Effects</b>: Returns the number of contained elements with the given value
-   //!
-   //! <b>Complexity</b>: Logarithmic to the number of elements contained plus lineal
-   //!   to number of objects with the given value.
-   //!
-   //! <b>Throws</b>: If `key_compare` throws.
-   size_type count(const key_type &key) const
-   {  return size_type(this->count(key, this->key_comp()));   }
-
-   //! <b>Requires</b>: key is a value such that `*this` is partitioned with respect to
-   //!   comp(nk, key) and !comp(key, nk), with comp(nk, key) implying !comp(key, nk),
-   //!   and nk the key_type of a value_type inserted into `*this`.
-   //!
-   //! <b>Effects</b>: Returns the number of contained elements with the given key
-   //!
-   //! <b>Complexity</b>: Logarithmic to the number of elements contained plus lineal
-   //!   to number of objects with the given key.
-   //!
-   //! <b>Throws</b>: If `comp` throws.
-   template<class KeyType, class KeyTypeKeyCompare>
-   size_type count(const KeyType &key, KeyTypeKeyCompare comp) const
-   {
-      std::pair<const_iterator, const_iterator> ret = this->equal_range(key, comp);
-      size_type n = 0;
-      for(; ret.first != ret.second; ++ret.first){ ++n; }
-      return n;
-   }
-
-   #if !defined(BOOST_INTRUSIVE_DOXYGEN_INVOKED)
-
-   //Add non-const overloads to theoretically const members
-   //as some algorithms have different behavior when non-const versions are used (like splay trees).
-   size_type count(const key_type &key)
-   {  return size_type(this->count(key, this->key_comp()));   }
-
-   template<class KeyType, class KeyTypeKeyCompare>
-   size_type count(const KeyType &key, KeyTypeKeyCompare comp)
-   {
-      std::pair<const_iterator, const_iterator> ret = this->equal_range(key, comp);
-      size_type n = 0;
-      for(; ret.first != ret.second; ++ret.first){ ++n; }
-      return n;
-   }
-
-   #else //defined(BOOST_INTRUSIVE_DOXYGEN_INVOKED)
-
-   //! <b>Effects</b>: Returns an iterator to the first element whose
-   //!   key is not less than k or end() if that element does not exist.
-   //!
-   //! <b>Complexity</b>: Logarithmic.
-   //!
-   //! <b>Throws</b>: If `key_compare` throws.
-   iterator lower_bound(const key_type &key);
-
-   //! <b>Effects</b>: Returns an iterator to the first element whose
-   //!   key is not less than k or end() if that element does not exist.
-   //!
-   //! <b>Complexity</b>: Logarithmic.
-   //!
-   //! <b>Throws</b>: If `key_compare` throws.
-   const_iterator lower_bound(const key_type &key) const;
-
-   //! @copydoc ::boost::intrusive::bstree::lower_bound(const key_type &)
-   template<class KeyType, class KeyTypeKeyCompare>
-   iterator lower_bound(const KeyType &key, KeyTypeKeyCompare comp);
-
-   //! @copydoc ::boost::intrusive::bstree::lower_bound(const KeyType&,KeyTypeKeyCompare)
-   template<class KeyType, class KeyTypeKeyCompare>
-   const_iterator lower_bound(const KeyType &key, KeyTypeKeyCompare comp) const;
-
-   //! <b>Effects</b>: Returns an iterator to the first element whose
-   //!   key is greater than k or end() if that element does not exist.
-   //!
-   //! <b>Complexity</b>: Logarithmic.
-   //!
-   //! <b>Throws</b>: If `key_compare` throws.
-   iterator upper_bound(const key_type &key);
-
-   //! <b>Requires</b>: key is a value such that `*this` is partitioned with respect to
-   //!   !comp(key, nk), with nk the key_type of a value_type inserted into `*this`.
-   //!
-   //! <b>Effects</b>: Returns an iterator to the first element whose
-   //!   key is greater than k according to comp or end() if that element
-   //!   does not exist.
-   //!
-   //! <b>Complexity</b>: Logarithmic.
-   //!
-   //! <b>Throws</b>: If `comp` throws.
-   template<class KeyType, class KeyTypeKeyCompare>
-   iterator upper_bound(const KeyType &key, KeyTypeKeyCompare comp);
-
-   //! @copydoc ::boost::intrusive::bstree::upper_bound(const key_type &)
-   const_iterator upper_bound(const key_type &key) const;
-
-   //! @copydoc ::boost::intrusive::bstree::upper_bound(const KeyType&,KeyTypeKeyCompare)
-   template<class KeyType, class KeyTypeKeyCompare>
-   const_iterator upper_bound(const KeyType &key, KeyTypeKeyCompare comp) const;
-
-   //! <b>Effects</b>: Finds an iterator to the first element whose key is
-   //!   k or end() if that element does not exist.
-   //!
-   //! <b>Complexity</b>: Logarithmic.
-   //!
-   //! <b>Throws</b>: If `key_compare` throws.
-   iterator find(const key_type &key);
-
-   //! <b>Requires</b>: key is a value such that `*this` is partitioned with respect to
-   //!   comp(nk, key) and !comp(key, nk), with comp(nk, key) implying !comp(key, nk),
-   //!   and nk the key_type of a value_type inserted into `*this`.
-   //!
-   //! <b>Effects</b>: Finds an iterator to the first element whose key is
-   //!   k or end() if that element does not exist.
-   //!
-   //! <b>Complexity</b>: Logarithmic.
-   //!
-   //! <b>Throws</b>: If `comp` throws.
-   template<class KeyType, class KeyTypeKeyCompare>
-   iterator find(const KeyType &key, KeyTypeKeyCompare comp);
-
-   //! @copydoc ::boost::intrusive::bstree::find(const key_type &)
-   const_iterator find(const key_type &key) const;
-
-   //! @copydoc ::boost::intrusive::bstree::find(const KeyType&,KeyTypeKeyCompare)
-   template<class KeyType, class KeyTypeKeyCompare>
-   const_iterator find(const KeyType &key, KeyTypeKeyCompare comp) const;
-
-   //! <b>Effects</b>: Finds a range containing all elements whose key is k or
-   //!   an empty range that indicates the position where those elements would be
-   //!   if they there is no elements with key k.
-   //!
-   //! <b>Complexity</b>: Logarithmic.
-   //!
-   //! <b>Throws</b>: If `key_compare` throws.
-   std::pair<iterator,iterator> equal_range(const key_type &key);
-
-   //! <b>Requires</b>: key is a value such that `*this` is partitioned with respect to
-   //!   comp(nk, key) and !comp(key, nk), with comp(nk, key) implying !comp(key, nk),
-   //!   with nk the key_type of a value_type inserted into `*this`.
-   //!
-   //! <b>Effects</b>: Finds a range containing all elements whose key is k or
-   //!   an empty range that indicates the position where those elements would be
-   //!   if they there is no elements with key k.
-   //!
-   //! <b>Complexity</b>: Logarithmic.
-   //!
-   //! <b>Throws</b>: If `comp` throws.
-   template<class KeyType, class KeyTypeKeyCompare>
-   std::pair<iterator,iterator> equal_range(const KeyType &key, KeyTypeKeyCompare comp);
-
-   //! @copydoc ::boost::intrusive::bstree::equal_range(const key_type &)
-   std::pair<const_iterator, const_iterator> equal_range(const key_type &key) const;
-
-   //! @copydoc ::boost::intrusive::bstree::equal_range(const KeyType&,KeyTypeKeyCompare)
-   template<class KeyType, class KeyTypeKeyCompare>
-   std::pair<const_iterator, const_iterator>
-      equal_range(const KeyType &key, KeyTypeKeyCompare comp) const;
-
-   //! <b>Requires</b>:
-   //!   `upper_key` shall not precede `lower_key` according to key_compare.
-   //!   [key_comp()(upper_key, lower_key) shall be false]
-   //!
-   //!   If `lower_key` is equivalent to `upper_key`
-   //!   [!key_comp()(upper_key, lower_key) && !key_comp()(lower_key, upper_key)] then
-   //!   ('left_closed' || 'right_closed') must be false.
-   //!
-   //! <b>Effects</b>: Returns an a pair with the following criteria:
-   //!
-   //!   first = lower_bound(lower_key) if left_closed, upper_bound(lower_key) otherwise
-   //!
-   //!   second = upper_bound(upper_key) if right_closed, lower_bound(upper_key) otherwise
-   //!
-   //! <b>Complexity</b>: Logarithmic.
-   //!
-   //! <b>Throws</b>: If `key_compare` throws.
-   //!
-   //! <b>Note</b>: This function can be more efficient than calling upper_bound
-   //!   and lower_bound for lower_value and upper_value.
-   //!
-   //! <b>Note</b>: Experimental function, the interface might change in future releases.
-   std::pair<iterator,iterator> bounded_range
-      (const key_type &lower_key, const key_type &upper_value, bool left_closed, bool right_closed);
-
-   //! <b>Requires</b>:
-   //!   `lower_key` is a value such that `*this` is partitioned with respect to
-   //!   comp(nk, lower_key) if left_closed is true, with respect to !comp(lower_key, nk) otherwise.
-   //!
-   //! `upper_key` is a value such that `*this` is partitioned with respect to
-   //!   !comp(upper_key, nk) if right_closed is true, with respect to comp(nk, upper_key) otherwise.
-   //!
-   //!   `upper_key` shall not precede `lower_key` according to comp
-   //!   [comp(upper_key, lower_key) shall be false]
-   //!
-   //!   If `lower_key` is equivalent to `upper_key`
-   //!   [!comp(upper_key, lower_key) && !comp(lower_key, upper_key)] then
-   //!   ('left_closed' || 'right_closed') must be false.
-   //!
-   //! <b>Effects</b>: Returns an a pair with the following criteria:
-   //!
-   //!   first = lower_bound(lower_key, comp) if left_closed, upper_bound(lower_key, comp) otherwise
-   //!
-   //!   second = upper_bound(upper_key, comp) if right_closed, lower_bound(upper_key, comp) otherwise
-   //!
-   //! <b>Complexity</b>: Logarithmic.
-   //!
-   //! <b>Throws</b>: If `comp` throws.
-   //!
-   //! <b>Note</b>: This function can be more efficient than calling upper_bound
-   //!   and lower_bound for lower_key and upper_key.
-   //!
-   //! <b>Note</b>: Experimental function, the interface might change in future releases.
-   template<class KeyType, class KeyTypeKeyCompare>
-   std::pair<iterator,iterator> bounded_range
-      (const KeyType &lower_key, const KeyType &upper_key, KeyTypeKeyCompare comp, bool left_closed, bool right_closed);
-   
-   //! @copydoc ::boost::intrusive::bstree::bounded_range(const key_type &,const key_type &,bool,bool)
-   std::pair<const_iterator,const_iterator> bounded_range
-      (const key_type &lower_key, const key_type &upper_key, bool left_closed, bool right_closed) const;
-
-   //! @copydoc ::boost::intrusive::bstree::bounded_range(const KeyType&,const KeyType&,KeyTypeKeyCompare,bool,bool)
-   template<class KeyType, class KeyTypeKeyCompare>
-   std::pair<const_iterator,const_iterator> bounded_range
-      (const KeyType &lower_key, const KeyType &upper_key, KeyTypeKeyCompare comp, bool left_closed, bool right_closed) const;
-
-   //! <b>Requires</b>: value must be an lvalue and shall be in a set of
-   //!   appropriate type. Otherwise the behavior is undefined.
-   //!
-   //! <b>Effects</b>: Returns: a valid iterator i belonging to the set
-   //!   that points to the value
-   //!
-   //! <b>Complexity</b>: Constant.
-   //!
-   //! <b>Throws</b>: Nothing.
-   //!
-   //! <b>Note</b>: This static function is available only if the <i>value traits</i>
-   //!   is stateless.
-   static iterator s_iterator_to(reference value) BOOST_NOEXCEPT;
-
-   //! <b>Requires</b>: value must be an lvalue and shall be in a set of
-   //!   appropriate type. Otherwise the behavior is undefined.
-   //!
-   //! <b>Effects</b>: Returns: a valid const_iterator i belonging to the
-   //!   set that points to the value
-   //!
-   //! <b>Complexity</b>: Constant.
-   //!
-   //! <b>Throws</b>: Nothing.
-   //!
-   //! <b>Note</b>: This static function is available only if the <i>value traits</i>
-   //!   is stateless.
-   static const_iterator s_iterator_to(const_reference value) BOOST_NOEXCEPT;
-
-   //! <b>Requires</b>: value must be an lvalue and shall be in a set of
-   //!   appropriate type. Otherwise the behavior is undefined.
-   //!
-   //! <b>Effects</b>: Returns: a valid iterator i belonging to the set
-   //!   that points to the value
-   //!
-   //! <b>Complexity</b>: Constant.
-   //!
-   //! <b>Throws</b>: Nothing.
-   iterator iterator_to(reference value) BOOST_NOEXCEPT;
-
-   //! <b>Requires</b>: value must be an lvalue and shall be in a set of
-   //!   appropriate type. Otherwise the behavior is undefined.
-   //!
-   //! <b>Effects</b>: Returns: a valid const_iterator i belonging to the
-   //!   set that points to the value
-   //!
-   //! <b>Complexity</b>: Constant.
-   //!
-   //! <b>Throws</b>: Nothing.
-   const_iterator iterator_to(const_reference value) const BOOST_NOEXCEPT;
-
-   //! <b>Requires</b>: value shall not be in a container.
-   //!
-   //! <b>Effects</b>: init_node puts the hook of a value in a well-known default
-   //!   state.
-   //!
-   //! <b>Throws</b>: Nothing.
-   //!
-   //! <b>Complexity</b>: Constant time.
-   //!
-   //! <b>Note</b>: This function puts the hook in the well-known default state
-   //!   used by auto_unlink and safe hooks.
-   static void init_node(reference value) BOOST_NOEXCEPT;
-
-   #endif   //#if defined(BOOST_INTRUSIVE_DOXYGEN_INVOKED)
-
-   //! <b>Effects</b>: Unlinks the leftmost node from the container.
-   //!
-   //! <b>Complexity</b>: Average complexity is constant time.
-   //!
-   //! <b>Throws</b>: Nothing.
-   //!
-   //! <b>Notes</b>: This function breaks the container and the container can
-   //!   only be used for more unlink_leftmost_without_rebalance calls.
-   //!   This function is normally used to achieve a step by step
-   //!   controlled destruction of the container.
-   pointer unlink_leftmost_without_rebalance() BOOST_NOEXCEPT
-   {
-      node_ptr to_be_disposed(node_algorithms::unlink_leftmost_without_rebalance
-                           (this->header_ptr()));
-      if(!to_be_disposed)
-         return 0;
-      this->sz_traits().decrement();
-      BOOST_IF_CONSTEXPR(safemode_or_autounlink)//If this is commented does not work with normal_link
-         node_algorithms::init(to_be_disposed);
-      return this->get_value_traits().to_value_ptr(to_be_disposed);
-   }
-
-   #if defined(BOOST_INTRUSIVE_DOXYGEN_INVOKED)
-
-   //! <b>Requires</b>: replace_this must be a valid iterator of *this
-   //!   and with_this must not be inserted in any container.
-   //!
-   //! <b>Effects</b>: Replaces replace_this in its position in the
-   //!   container with with_this. The container does not need to be rebalanced.
-   //!
-   //! <b>Complexity</b>: Constant.
-   //!
-   //! <b>Throws</b>: Nothing.
-   //!
-   //! <b>Note</b>: This function will break container ordering invariants if
-   //!   with_this is not equivalent to *replace_this according to the
-   //!   ordering rules. This function is faster than erasing and inserting
-   //!   the node, since no rebalancing or comparison is needed.
-   void replace_node(iterator replace_this, reference with_this) BOOST_NOEXCEPT;
-
-   //! <b>Effects</b>: Rebalances the tree.
-   //!
-   //! <b>Throws</b>: Nothing.
-   //!
-   //! <b>Complexity</b>: Linear.
-   void rebalance() BOOST_NOEXCEPT;
-
-   //! <b>Requires</b>: old_root is a node of a tree.
-   //!
-   //! <b>Effects</b>: Rebalances the subtree rooted at old_root.
-   //!
-   //! <b>Returns</b>: The new root of the subtree.
-   //!
-   //! <b>Throws</b>: Nothing.
-   //!
-   //! <b>Complexity</b>: Linear to the elements in the subtree.
-   iterator rebalance_subtree(iterator r) BOOST_NOEXCEPT;
-
-   #endif   //#if defined(BOOST_INTRUSIVE_DOXYGEN_INVOKED)
-
-   //! <b>Effects</b>: removes "value" from the container.
-   //!
-   //! <b>Throws</b>: Nothing.
-   //!
-   //! <b>Complexity</b>: Logarithmic time.
-   //!
-   //! <b>Note</b>: This static function is only usable with non-constant
-   //! time size containers that have stateless comparison functors.
-   //!
-   //! If the user calls
-   //! this function with a constant time size container or stateful comparison
-   //! functor a compilation error will be issued.
-   static void remove_node(reference value) BOOST_NOEXCEPT
-   {
-      BOOST_STATIC_ASSERT((!constant_time_size));
-      node_ptr to_remove(value_traits::to_node_ptr(value));
-      node_algorithms::unlink(to_remove);
-      BOOST_IF_CONSTEXPR(safemode_or_autounlink)
-         node_algorithms::init(to_remove);
-   }
-
-   //! <b>Requires</b>: "source" container's Options can only can differ in the comparison
-   //!   function from *this.
-   //! 
-   //! <b>Effects</b>: Attempts to extract each element in source and insert it into a using
-   //!   the comparison object of *this. If there is an element in a with key equivalent to the
-   //!   key of an element from source, then that element is not extracted from source.
-   //! 
-   //! <b>Postcondition</b>: Pointers and references to the transferred elements of source refer
-   //!   to those same elements but as members of *this. Iterators referring to the transferred
-   //!   elements will continue to refer to their elements, but they now behave as iterators into *this,
-   //!   not into source.
-   //!
-   //! <b>Throws</b>: Nothing unless the comparison object throws.
-   //!
-   //! <b>Complexity</b>: N log(a.size() + N) (N has the value source.size())
-   #if defined(BOOST_INTRUSIVE_DOXYGEN_INVOKED)
-   template<class T, class ...Options2> void merge_unique(bstree<T, Options2...> &);
-   #else
-   template<class Compare2>
-   void merge_unique(bstree_impl
-      <ValueTraits, VoidOrKeyOfValue, Compare2, SizeType, ConstantTimeSize, AlgoType, HeaderHolder> &source)
-   #endif
-   {
-      node_ptr it   (node_algorithms::begin_node(source.header_ptr()))
-             , itend(node_algorithms::end_node  (source.header_ptr()));
-
-      while(it != itend){
-         node_ptr const p(it);
-         BOOST_INTRUSIVE_SAFE_HOOK_DEFAULT_ASSERT(!safemode_or_autounlink || !node_algorithms::unique(p));
-         it = node_algorithms::next_node(it);
-         if( node_algorithms::transfer_unique(this->header_ptr(), this->key_node_comp(this->key_comp()), source.header_ptr(), p) ){
-            source.sz_traits().decrement();
-            this->sz_traits().increment();
-         }
-      }
-   }
-
-   //! <b>Requires</b>: "source" container's Options can only can differ in the comparison
-   //!   function from *this.
-   //! 
-   //! <b>Effects</b>: Extracts each element in source and insert it into a using
-   //!   the comparison object of *this.
-   //! 
-   //! <b>Postcondition</b>: Pointers and references to the transferred elements of source refer
-   //!   to those same elements but as members of *this. Iterators referring to the transferred
-   //!   elements will continue to refer to their elements, but they now behave as iterators into *this,
-   //!   not into source.
-   //!
-   //! <b>Throws</b>: Nothing unless the comparison object throws.
-   //!
-   //! <b>Complexity</b>: N log(a.size() + N) (N has the value source.size())
-   #if defined(BOOST_INTRUSIVE_DOXYGEN_INVOKED)
-   template<class T, class ...Options2> void merge_equal(bstree<T, Options2...> &);
-   #else
-   template<class Compare2>
-   void merge_equal(bstree_impl
-      <ValueTraits, VoidOrKeyOfValue, Compare2, SizeType, ConstantTimeSize, AlgoType, HeaderHolder> &source)
-   #endif
-   {
-      node_ptr it   (node_algorithms::begin_node(source.header_ptr()))
-             , itend(node_algorithms::end_node  (source.header_ptr()));
-
-      while(it != itend){
-         node_ptr const p(it);
-         BOOST_INTRUSIVE_SAFE_HOOK_DEFAULT_ASSERT(!safemode_or_autounlink || !node_algorithms::unique(p));
-         it = node_algorithms::next_node(it);
-         node_algorithms::transfer_equal(this->header_ptr(), this->key_node_comp(this->key_comp()), source.header_ptr(), p);
-         source.sz_traits().decrement();
-         this->sz_traits().increment();
-      }
-   }
-
-   //! <b>Effects</b>: Asserts the integrity of the container with additional checks provided by the user.
-   //!
-   //! <b>Complexity</b>: Linear time.
-   //!
-   //! <b>Note</b>: The method might not have effect when asserts are turned off (e.g., with NDEBUG).
-   //!   Experimental function, interface might change in future versions.
-   template <class ExtraChecker>
-   void check(ExtraChecker extra_checker) const
-   {
-      typedef detail::key_nodeptr_comp<key_compare, value_traits, key_of_value> nodeptr_comp_t;
-      nodeptr_comp_t nodeptr_comp(this->key_comp(), &this->get_value_traits());
-      typedef typename get_node_checker<AlgoType, ValueTraits, nodeptr_comp_t, ExtraChecker>::type node_checker_t;
-      typename node_checker_t::return_type checker_return;
-      node_algorithms::check(this->header_ptr(), node_checker_t(nodeptr_comp, extra_checker), checker_return);
-      BOOST_INTRUSIVE_INVARIANT_ASSERT(!constant_time_size || this->sz_traits().get_size() == checker_return.node_count);
-   }
-
-   //! <b>Effects</b>: Asserts the integrity of the container.
-   //!
-   //! <b>Complexity</b>: Linear time.
-   //!
-   //! <b>Note</b>: The method has no effect when asserts are turned off (e.g., with NDEBUG).
-   //!   Experimental function, interface might change in future versions.
-   void check() const
-   {
-      check(detail::empty_node_checker<ValueTraits>());
-   }
-
-   friend bool operator==(const bstree_impl &x, const bstree_impl &y)
-   {
-      if(constant_time_size && x.size() != y.size()){
-         return false;
-      }
-      return boost::intrusive::algo_equal(x.cbegin(), x.cend(), y.cbegin(), y.cend());
-   }
-
-   friend bool operator!=(const bstree_impl &x, const bstree_impl &y)
-   {  return !(x == y); }
-
-   friend bool operator<(const bstree_impl &x, const bstree_impl &y)
-   {  return ::boost::intrusive::algo_lexicographical_compare(x.begin(), x.end(), y.begin(), y.end());  }
-
-   friend bool operator>(const bstree_impl &x, const bstree_impl &y)
-   {  return y < x;  }
-
-   friend bool operator<=(const bstree_impl &x, const bstree_impl &y)
-   {  return !(x > y);  }
-
-   friend bool operator>=(const bstree_impl &x, const bstree_impl &y)
-   {  return !(x < y);  }
-
-   friend void swap(bstree_impl &x, bstree_impl &y)
-   {  x.swap(y);  }
-
-   /// @cond
-   private:
-   template<class Disposer>
-   iterator private_erase(const_iterator b, const_iterator e, size_type &n, Disposer disposer)
-   {
-      for(n = 0; b != e; ++n)
-        this->erase_and_dispose(b++, disposer);
-      return b.unconst();
-   }
-
-   iterator private_erase(const_iterator b, const_iterator e, size_type &n)
-   {
-      for(n = 0; b != e; ++n)
-        this->erase(b++);
-      return b.unconst();
-   }
-   /// @endcond
-};
-
-//! Helper metafunction to define a \c bstree that yields to the same type when the
-//! same options (either explicitly or implicitly) are used.
-#if defined(BOOST_INTRUSIVE_DOXYGEN_INVOKED) || defined(BOOST_INTRUSIVE_VARIADIC_TEMPLATES)
-template<class T, class ...Options>
-#else
-template<class T, class O1 = void, class O2 = void
-                , class O3 = void, class O4 = void
-                , class O5 = void, class O6 = void>
-#endif
-struct make_bstree
-{
-   /// @cond
-   typedef typename pack_options
-      < bstree_defaults,
-      #if !defined(BOOST_INTRUSIVE_VARIADIC_TEMPLATES)
-      O1, O2, O3, O4, O5, O6
-      #else
-      Options...
-      #endif
-      >::type packed_options;
-
-   typedef typename detail::get_value_traits
-      <T, typename packed_options::proto_value_traits>::type value_traits;
-
-   typedef bstree_impl
-         < value_traits
-         , typename packed_options::key_of_value
-         , typename packed_options::compare
-         , typename packed_options::size_type
-         , packed_options::constant_time_size
-         , BsTreeAlgorithms
-         , typename packed_options::header_holder_type
-         > implementation_defined;
-   /// @endcond
-   typedef implementation_defined type;
-};
-
-
-#ifndef BOOST_INTRUSIVE_DOXYGEN_INVOKED
-
-#if !defined(BOOST_INTRUSIVE_VARIADIC_TEMPLATES)
-template<class T, class O1, class O2, class O3, class O4, class O5, class O6>
-#else
-template<class T, class ...Options>
-#endif
-class bstree
-   :  public make_bstree<T,
-      #if !defined(BOOST_INTRUSIVE_VARIADIC_TEMPLATES)
-      O1, O2, O3, O4, O5, O6
-      #else
-      Options...
-      #endif
-      >::type
-{
-   typedef typename make_bstree
-      <T,
-      #if !defined(BOOST_INTRUSIVE_VARIADIC_TEMPLATES)
-      O1, O2, O3, O4, O5, O6
-      #else
-      Options...
-      #endif
-      >::type   Base;
-   BOOST_MOVABLE_BUT_NOT_COPYABLE(bstree)
-
-   public:
-   typedef typename Base::key_compare        key_compare;
-   typedef typename Base::value_traits       value_traits;
-   typedef typename Base::iterator           iterator;
-   typedef typename Base::const_iterator     const_iterator;
-
-   //Assert if passed value traits are compatible with the type
-   BOOST_STATIC_ASSERT((detail::is_same<typename value_traits::value_type, T>::value));
-
-   BOOST_INTRUSIVE_FORCEINLINE bstree()
-      :  Base()
-   {}
-
-   BOOST_INTRUSIVE_FORCEINLINE explicit bstree( const key_compare &cmp, const value_traits &v_traits = value_traits())
-      :  Base(cmp, v_traits)
-   {}
-
-   template<class Iterator>
-   BOOST_INTRUSIVE_FORCEINLINE bstree( bool unique, Iterator b, Iterator e
-         , const key_compare &cmp = key_compare()
-         , const value_traits &v_traits = value_traits())
-      :  Base(unique, b, e, cmp, v_traits)
-   {}
-
-   BOOST_INTRUSIVE_FORCEINLINE bstree(BOOST_RV_REF(bstree) x)
-      :  Base(BOOST_MOVE_BASE(Base, x))
-   {}
-
-   BOOST_INTRUSIVE_FORCEINLINE bstree& operator=(BOOST_RV_REF(bstree) x)
-   {  return static_cast<bstree &>(this->Base::operator=(BOOST_MOVE_BASE(Base, x)));  }
-
-   template <class Cloner, class Disposer>
-   BOOST_INTRUSIVE_FORCEINLINE void clone_from(const bstree &src, Cloner cloner, Disposer disposer)
-   {  Base::clone_from(src, cloner, disposer);  }
-
-   template <class Cloner, class Disposer>
-   BOOST_INTRUSIVE_FORCEINLINE void clone_from(BOOST_RV_REF(bstree) src, Cloner cloner, Disposer disposer)
-   {  Base::clone_from(BOOST_MOVE_BASE(Base, src), cloner, disposer);  }
-
-   BOOST_INTRUSIVE_FORCEINLINE static bstree &container_from_end_iterator(iterator end_iterator) BOOST_NOEXCEPT
-   {  return static_cast<bstree &>(Base::container_from_end_iterator(end_iterator));   }
-
-   BOOST_INTRUSIVE_FORCEINLINE static const bstree &container_from_end_iterator(const_iterator end_iterator) BOOST_NOEXCEPT
-   {  return static_cast<const bstree &>(Base::container_from_end_iterator(end_iterator));   }
-
-   BOOST_INTRUSIVE_FORCEINLINE static bstree &container_from_iterator(iterator it) BOOST_NOEXCEPT
-   {  return static_cast<bstree &>(Base::container_from_iterator(it));   }
-
-   BOOST_INTRUSIVE_FORCEINLINE static const bstree &container_from_iterator(const_iterator it) BOOST_NOEXCEPT
-   {  return static_cast<const bstree &>(Base::container_from_iterator(it));   }
-};
-
-#endif
-} //namespace intrusive
-} //namespace boost
-
-#include <boost/intrusive/detail/config_end.hpp>
-
-#endif //BOOST_INTRUSIVE_BSTREE_HPP
diff --git a/src/boost/intrusive/bstree_algorithms.hpp b/src/boost/intrusive/bstree_algorithms.hpp
deleted file mode 100644
index 5113a584..00000000
--- a/src/boost/intrusive/bstree_algorithms.hpp
+++ /dev/null
@@ -1,2103 +0,0 @@
-/////////////////////////////////////////////////////////////////////////////
-//
-// (C) Copyright Ion Gaztanaga  2007-2021
-// (C) Copyright Daniel Steck   2021
-//
-// Distributed under the Boost 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/intrusive for documentation.
-//
-/////////////////////////////////////////////////////////////////////////////
-
-#ifndef BOOST_INTRUSIVE_BSTREE_ALGORITHMS_HPP
-#define BOOST_INTRUSIVE_BSTREE_ALGORITHMS_HPP
-
-#include <cstddef>
-#include <boost/intrusive/detail/config_begin.hpp>
-#include <boost/intrusive/intrusive_fwd.hpp>
-#include <boost/intrusive/detail/bstree_algorithms_base.hpp>
-#include <boost/intrusive/detail/assert.hpp>
-#include <boost/intrusive/detail/uncast.hpp>
-#include <boost/intrusive/detail/math.hpp>
-#include <boost/intrusive/detail/algo_type.hpp>
-
-#include <boost/intrusive/detail/minimal_pair_header.hpp>
-
-#if defined(BOOST_HAS_PRAGMA_ONCE)
-#  pragma once
-#endif
-
-namespace boost {
-namespace intrusive {
-
-/// @cond
-
-//! This type is the information that will be filled by insert_unique_check
-template <class NodePtr>
-struct insert_commit_data_t
-{
-   BOOST_INTRUSIVE_FORCEINLINE insert_commit_data_t()
-      : link_left(false), node()
-   {}
-   bool     link_left;
-   NodePtr  node;
-};
-
-template <class NodePtr>
-struct data_for_rebalance_t
-{
-   NodePtr  x;
-   NodePtr  x_parent;
-   NodePtr  y;
-};
-
-namespace detail {
-
-template<class ValueTraits, class NodePtrCompare, class ExtraChecker>
-struct bstree_node_checker
-   : public ExtraChecker
-{
-   typedef ExtraChecker                            base_checker_t;
-   typedef ValueTraits                             value_traits;
-   typedef typename value_traits::node_traits      node_traits;
-   typedef typename node_traits::const_node_ptr    const_node_ptr;
-
-   struct return_type
-      : public base_checker_t::return_type
-   {
-      BOOST_INTRUSIVE_FORCEINLINE return_type()
-         : min_key_node_ptr(const_node_ptr()), max_key_node_ptr(const_node_ptr()), node_count(0)
-      {}
-
-      const_node_ptr min_key_node_ptr;
-      const_node_ptr max_key_node_ptr;
-      size_t   node_count;
-   };
-
-   BOOST_INTRUSIVE_FORCEINLINE bstree_node_checker(const NodePtrCompare& comp, ExtraChecker extra_checker)
-      : base_checker_t(extra_checker), comp_(comp)
-   {}
-
-   void operator () (const_node_ptr p,
-                     const return_type& check_return_left, const return_type& check_return_right,
-                     return_type& check_return)
-   {
-      BOOST_INTRUSIVE_INVARIANT_ASSERT(!check_return_left.max_key_node_ptr || !comp_(p, check_return_left.max_key_node_ptr));
-      BOOST_INTRUSIVE_INVARIANT_ASSERT(!check_return_right.min_key_node_ptr || !comp_(check_return_right.min_key_node_ptr, p));
-      check_return.min_key_node_ptr = node_traits::get_left(p)? check_return_left.min_key_node_ptr : p;
-      check_return.max_key_node_ptr = node_traits::get_right(p)? check_return_right.max_key_node_ptr : p;
-      check_return.node_count = check_return_left.node_count + check_return_right.node_count + 1;
-      base_checker_t::operator()(p, check_return_left, check_return_right, check_return);
-   }
-
-   const NodePtrCompare comp_;
-};
-
-} // namespace detail
-
-/// @endcond
-
-
-
-//!   This is an implementation of a binary search tree.
-//!   A node in the search tree has references to its children and its parent. This
-//!   is to allow traversal of the whole tree from a given node making the
-//!   implementation of iterator a pointer to a node.
-//!   At the top of the tree a node is used specially. This node's parent pointer
-//!   is pointing to the root of the tree. Its left pointer points to the
-//!   leftmost node in the tree and the right pointer to the rightmost one.
-//!   This node is used to represent the end-iterator.
-//!
-//!                                            +---------+
-//!       header------------------------------>|         |
-//!                                            |         |
-//!                   +----------(left)--------|         |--------(right)---------+
-//!                   |                        +---------+                        |
-//!                   |                             |                             |
-//!                   |                             | (parent)                    |
-//!                   |                             |                             |
-//!                   |                             |                             |
-//!                   |                        +---------+                        |
-//!    root of tree ..|......................> |         |                        |
-//!                   |                        |    D    |                        |
-//!                   |                        |         |                        |
-//!                   |                +-------+---------+-------+                |
-//!                   |                |                         |                |
-//!                   |                |                         |                |
-//!                   |                |                         |                |
-//!                   |                |                         |                |
-//!                   |                |                         |                |
-//!                   |          +---------+                 +---------+          |
-//!                   |          |         |                 |         |          |
-//!                   |          |    B    |                 |    F    |          |
-//!                   |          |         |                 |         |          |
-//!                   |       +--+---------+--+           +--+---------+--+       |
-//!                   |       |               |           |               |       |
-//!                   |       |               |           |               |       |
-//!                   |       |               |           |               |       |
-//!                   |   +---+-----+   +-----+---+   +---+-----+   +-----+---+   |
-//!                   +-->|         |   |         |   |         |   |         |<--+
-//!                       |    A    |   |    C    |   |    E    |   |    G    |
-//!                       |         |   |         |   |         |   |         |
-//!                       +---------+   +---------+   +---------+   +---------+
-//!
-//! bstree_algorithms is configured with a NodeTraits class, which encapsulates the
-//! information about the node to be manipulated. NodeTraits must support the
-//! following interface:
-//!
-//! <b>Typedefs</b>:
-//!
-//! <tt>node</tt>: The type of the node that forms the binary search tree
-//!
-//! <tt>node_ptr</tt>: A pointer to a node
-//!
-//! <tt>const_node_ptr</tt>: A pointer to a const node
-//!
-//! <b>Static functions</b>:
-//!
-//! <tt>static node_ptr get_parent(const_node_ptr n);</tt>
-//!
-//! <tt>static void set_parent(node_ptr n, node_ptr parent);</tt>
-//!
-//! <tt>static node_ptr get_left(const_node_ptr n);</tt>
-//!
-//! <tt>static void set_left(node_ptr n, node_ptr left);</tt>
-//!
-//! <tt>static node_ptr get_right(const_node_ptr n);</tt>
-//!
-//! <tt>static void set_right(node_ptr n, node_ptr right);</tt>
-template<class NodeTraits>
-class bstree_algorithms : public bstree_algorithms_base<NodeTraits>
-{
-   public:
-   typedef typename NodeTraits::node            node;
-   typedef NodeTraits                           node_traits;
-   typedef typename NodeTraits::node_ptr        node_ptr;
-   typedef typename NodeTraits::const_node_ptr  const_node_ptr;
-   typedef insert_commit_data_t<node_ptr>       insert_commit_data;
-   typedef data_for_rebalance_t<node_ptr>       data_for_rebalance;
-
-   /// @cond
-   typedef bstree_algorithms<NodeTraits>        this_type;
-   typedef bstree_algorithms_base<NodeTraits>   base_type;
-   private:
-   template<class Disposer>
-   struct dispose_subtree_disposer
-   {
-      BOOST_INTRUSIVE_FORCEINLINE dispose_subtree_disposer(Disposer &disp, node_ptr subtree)
-         : disposer_(&disp), subtree_(subtree)
-      {}
-
-      BOOST_INTRUSIVE_FORCEINLINE void release()
-      {  disposer_ = 0;  }
-
-      BOOST_INTRUSIVE_FORCEINLINE ~dispose_subtree_disposer()
-      {
-         if(disposer_){
-            dispose_subtree(subtree_, *disposer_);
-         }
-      }
-      Disposer *disposer_;
-      const node_ptr subtree_;
-   };
-
-   /// @endcond
-
-   public:
-   //! <b>Requires</b>: 'header' is the header node of a tree.
-   //!
-   //! <b>Effects</b>: Returns the first node of the tree, the header if the tree is empty.
-   //!
-   //! <b>Complexity</b>: Constant time.
-   //!
-   //! <b>Throws</b>: Nothing.
-   BOOST_INTRUSIVE_FORCEINLINE static node_ptr begin_node(const_node_ptr header) BOOST_NOEXCEPT
-   {  return node_traits::get_left(header);   }
-
-   //! <b>Requires</b>: 'header' is the header node of a tree.
-   //!
-   //! <b>Effects</b>: Returns the header of the tree.
-   //!
-   //! <b>Complexity</b>: Constant time.
-   //!
-   //! <b>Throws</b>: Nothing.
-   BOOST_INTRUSIVE_FORCEINLINE static node_ptr end_node(const_node_ptr header) BOOST_NOEXCEPT
-   {  return detail::uncast(header);   }
-
-   //! <b>Requires</b>: 'header' is the header node of a tree.
-   //!
-   //! <b>Effects</b>: Returns the root of the tree if any, header otherwise
-   //!
-   //! <b>Complexity</b>: Constant time.
-   //!
-   //! <b>Throws</b>: Nothing.
-   BOOST_INTRUSIVE_FORCEINLINE static node_ptr root_node(const_node_ptr header) BOOST_NOEXCEPT
-   {
-      node_ptr p = node_traits::get_parent(header);
-      return p ? p : detail::uncast(header);
-   }
-
-   //! <b>Requires</b>: 'n' is a node of the tree or a node initialized
-   //!   by init(...) or init_node.
-   //!
-   //! <b>Effects</b>: Returns true if the node is initialized by init() or init_node().
-   //!
-   //! <b>Complexity</b>: Constant time.
-   //!
-   //! <b>Throws</b>: Nothing.
-   BOOST_INTRUSIVE_FORCEINLINE static bool unique(const_node_ptr n) BOOST_NOEXCEPT
-   { return !NodeTraits::get_parent(n); }
-
-   #if defined(BOOST_INTRUSIVE_DOXYGEN_INVOKED)
-   //! <b>Requires</b>: 'n' is a node of the tree or a header node.
-   //!
-   //! <b>Effects</b>: Returns the header of the tree.
-   //!
-   //! <b>Complexity</b>: Logarithmic.
-   //!
-   //! <b>Throws</b>: Nothing.
-   static node_ptr get_header(const_node_ptr n);
-   #endif
-
-   //! <b>Requires</b>: node1 and node2 can't be header nodes
-   //!  of two trees.
-   //!
-   //! <b>Effects</b>: Swaps two nodes. After the function node1 will be inserted
-   //!   in the position node2 before the function. node2 will be inserted in the
-   //!   position node1 had before the function.
-   //!
-   //! <b>Complexity</b>: Logarithmic.
-   //!
-   //! <b>Throws</b>: Nothing.
-   //!
-   //! <b>Note</b>: This function will break container ordering invariants if
-   //!   node1 and node2 are not equivalent according to the ordering rules.
-   //!
-   //!Experimental function
-   static void swap_nodes(node_ptr node1, node_ptr node2) BOOST_NOEXCEPT
-   {
-      if(node1 == node2)
-         return;
-
-      node_ptr header1(base_type::get_header(node1)), header2(base_type::get_header(node2));
-      swap_nodes(node1, header1, node2, header2);
-   }
-
-   //! <b>Requires</b>: node1 and node2 can't be header nodes
-   //!  of two trees with header header1 and header2.
-   //!
-   //! <b>Effects</b>: Swaps two nodes. After the function node1 will be inserted
-   //!   in the position node2 before the function. node2 will be inserted in the
-   //!   position node1 had before the function.
-   //!
-   //! <b>Complexity</b>: Constant.
-   //!
-   //! <b>Throws</b>: Nothing.
-   //!
-   //! <b>Note</b>: This function will break container ordering invariants if
-   //!   node1 and node2 are not equivalent according to the ordering rules.
-   //!
-   //!Experimental function
-   static void swap_nodes(node_ptr node1, node_ptr header1, node_ptr node2, node_ptr header2) BOOST_NOEXCEPT
-   {
-      if(node1 == node2)
-         return;
-
-      //node1 and node2 must not be header nodes
-      //BOOST_INTRUSIVE_INVARIANT_ASSERT((header1 != node1 && header2 != node2));
-      if(header1 != header2){
-         //Update header1 if necessary
-         if(node1 == NodeTraits::get_left(header1)){
-            NodeTraits::set_left(header1, node2);
-         }
-
-         if(node1 == NodeTraits::get_right(header1)){
-            NodeTraits::set_right(header1, node2);
-         }
-
-         if(node1 == NodeTraits::get_parent(header1)){
-            NodeTraits::set_parent(header1, node2);
-         }
-
-         //Update header2 if necessary
-         if(node2 == NodeTraits::get_left(header2)){
-            NodeTraits::set_left(header2, node1);
-         }
-
-         if(node2 == NodeTraits::get_right(header2)){
-            NodeTraits::set_right(header2, node1);
-         }
-
-         if(node2 == NodeTraits::get_parent(header2)){
-            NodeTraits::set_parent(header2, node1);
-         }
-      }
-      else{
-         //If both nodes are from the same tree
-         //Update header if necessary
-         if(node1 == NodeTraits::get_left(header1)){
-            NodeTraits::set_left(header1, node2);
-         }
-         else if(node2 == NodeTraits::get_left(header2)){
-            NodeTraits::set_left(header2, node1);
-         }
-
-         if(node1 == NodeTraits::get_right(header1)){
-            NodeTraits::set_right(header1, node2);
-         }
-         else if(node2 == NodeTraits::get_right(header2)){
-            NodeTraits::set_right(header2, node1);
-         }
-
-         if(node1 == NodeTraits::get_parent(header1)){
-            NodeTraits::set_parent(header1, node2);
-         }
-         else if(node2 == NodeTraits::get_parent(header2)){
-            NodeTraits::set_parent(header2, node1);
-         }
-
-         //Adjust data in nodes to be swapped
-         //so that final link swap works as expected
-         if(node1 == NodeTraits::get_parent(node2)){
-            NodeTraits::set_parent(node2, node2);
-
-            if(node2 == NodeTraits::get_right(node1)){
-               NodeTraits::set_right(node1, node1);
-            }
-            else{
-               NodeTraits::set_left(node1, node1);
-            }
-         }
-         else if(node2 == NodeTraits::get_parent(node1)){
-            NodeTraits::set_parent(node1, node1);
-
-            if(node1 == NodeTraits::get_right(node2)){
-               NodeTraits::set_right(node2, node2);
-            }
-            else{
-               NodeTraits::set_left(node2, node2);
-            }
-         }
-      }
-
-      //Now swap all the links
-      node_ptr temp;
-      //swap left link
-      temp = NodeTraits::get_left(node1);
-      NodeTraits::set_left(node1, NodeTraits::get_left(node2));
-      NodeTraits::set_left(node2, temp);
-      //swap right link
-      temp = NodeTraits::get_right(node1);
-      NodeTraits::set_right(node1, NodeTraits::get_right(node2));
-      NodeTraits::set_right(node2, temp);
-      //swap parent link
-      temp = NodeTraits::get_parent(node1);
-      NodeTraits::set_parent(node1, NodeTraits::get_parent(node2));
-      NodeTraits::set_parent(node2, temp);
-
-      //Now adjust child nodes for newly inserted node 1
-      if((temp = NodeTraits::get_left(node1))){
-         NodeTraits::set_parent(temp, node1);
-      }
-      if((temp = NodeTraits::get_right(node1))){
-         NodeTraits::set_parent(temp, node1);
-      }
-      //Now adjust child nodes for newly inserted node 2
-      if((temp = NodeTraits::get_left(node2))){
-         NodeTraits::set_parent(temp, node2);
-      }
-      if((temp = NodeTraits::get_right(node2))){
-         NodeTraits::set_parent(temp, node2);
-      }
-
-      //Finally adjust parent nodes
-      if ((temp = NodeTraits::get_parent(node1)) == NodeTraits::get_parent(node2)) {
-         // special logic for the case where the nodes are siblings
-         const node_ptr left = NodeTraits::get_left(temp);
-         NodeTraits::set_left(temp, NodeTraits::get_right(temp));
-         NodeTraits::set_right(temp, left);
-      } else {
-         if ((temp = NodeTraits::get_parent(node1)) &&
-            //The header has been already updated so avoid it
-            temp != header2) {
-            if (NodeTraits::get_left(temp) == node2) {
-               NodeTraits::set_left(temp, node1);
-            }
-            if (NodeTraits::get_right(temp) == node2) {
-               NodeTraits::set_right(temp, node1);
-            }
-         }
-         if ((temp = NodeTraits::get_parent(node2)) &&
-            //The header has been already updated so avoid it
-            temp != header1) {
-            if (NodeTraits::get_left(temp) == node1) {
-               NodeTraits::set_left(temp, node2);
-            }
-            if (NodeTraits::get_right(temp) == node1) {
-               NodeTraits::set_right(temp, node2);
-            }
-         }
-      }
-   }
-
-   //! <b>Requires</b>: node_to_be_replaced must be inserted in a tree
-   //!   and new_node must not be inserted in a tree.
-   //!
-   //! <b>Effects</b>: Replaces node_to_be_replaced in its position in the
-   //!   tree with new_node. The tree does not need to be rebalanced
-   //!
-   //! <b>Complexity</b>: Logarithmic.
-   //!
-   //! <b>Throws</b>: Nothing.
-   //!
-   //! <b>Note</b>: This function will break container ordering invariants if
-   //!   new_node is not equivalent to node_to_be_replaced according to the
-   //!   ordering rules. This function is faster than erasing and inserting
-   //!   the node, since no rebalancing and comparison is needed. Experimental function
-   BOOST_INTRUSIVE_FORCEINLINE static void replace_node(node_ptr node_to_be_replaced, node_ptr new_node) BOOST_NOEXCEPT
-   {
-      replace_node(node_to_be_replaced, base_type::get_header(node_to_be_replaced), new_node);
-   }
-
-   //! <b>Requires</b>: node_to_be_replaced must be inserted in a tree
-   //!   with header "header" and new_node must not be inserted in a tree.
-   //!
-   //! <b>Effects</b>: Replaces node_to_be_replaced in its position in the
-   //!   tree with new_node. The tree does not need to be rebalanced
-   //!
-   //! <b>Complexity</b>: Constant.
-   //!
-   //! <b>Throws</b>: Nothing.
-   //!
-   //! <b>Note</b>: This function will break container ordering invariants if
-   //!   new_node is not equivalent to node_to_be_replaced according to the
-   //!   ordering rules. This function is faster than erasing and inserting
-   //!   the node, since no rebalancing or comparison is needed. Experimental function
-   static void replace_node(node_ptr node_to_be_replaced, node_ptr header, node_ptr new_node) BOOST_NOEXCEPT
-   {
-      BOOST_ASSERT(node_to_be_replaced != new_node);
-
-      //Update header if necessary
-      if(node_to_be_replaced == NodeTraits::get_left(header)){
-         NodeTraits::set_left(header, new_node);
-      }
-
-      if(node_to_be_replaced == NodeTraits::get_right(header)){
-         NodeTraits::set_right(header, new_node);
-      }
-
-      if(node_to_be_replaced == NodeTraits::get_parent(header)){
-         NodeTraits::set_parent(header, new_node);
-      }
-
-      //Now set data from the original node
-      node_ptr temp;
-      NodeTraits::set_left(new_node, NodeTraits::get_left(node_to_be_replaced));
-      NodeTraits::set_right(new_node, NodeTraits::get_right(node_to_be_replaced));
-      NodeTraits::set_parent(new_node, NodeTraits::get_parent(node_to_be_replaced));
-
-      //Now adjust adjacent nodes for newly inserted node
-      if((temp = NodeTraits::get_left(new_node))){
-         NodeTraits::set_parent(temp, new_node);
-      }
-      if((temp = NodeTraits::get_right(new_node))){
-         NodeTraits::set_parent(temp, new_node);
-      }
-      if((temp = NodeTraits::get_parent(new_node)) &&
-         //The header has been already updated so avoid it
-         temp != header){
-         if(NodeTraits::get_left(temp) == node_to_be_replaced){
-            NodeTraits::set_left(temp, new_node);
-         }
-         if(NodeTraits::get_right(temp) == node_to_be_replaced){
-            NodeTraits::set_right(temp, new_node);
-         }
-      }
-   }
-
-   #if defined(BOOST_INTRUSIVE_DOXYGEN_INVOKED)
-   //! <b>Requires</b>: 'n' is a node from the tree except the header.
-   //!
-   //! <b>Effects</b>: Returns the next node of the tree.
-   //!
-   //! <b>Complexity</b>: Average constant time.
-   //!
-   //! <b>Throws</b>: Nothing.
-   static node_ptr next_node(node_ptr n) BOOST_NOEXCEPT;
-
-   //! <b>Requires</b>: 'n' is a node from the tree except the leftmost node.
-   //!
-   //! <b>Effects</b>: Returns the previous node of the tree.
-   //!
-   //! <b>Complexity</b>: Average constant time.
-   //!
-   //! <b>Throws</b>: Nothing.
-   static node_ptr prev_node(node_ptr n) BOOST_NOEXCEPT;
-
-   //! <b>Requires</b>: 'n' is a node of a tree but not the header.
-   //!
-   //! <b>Effects</b>: Returns the minimum node of the subtree starting at p.
-   //!
-   //! <b>Complexity</b>: Logarithmic to the size of the subtree.
-   //!
-   //! <b>Throws</b>: Nothing.
-   static node_ptr minimum(node_ptr n);
-
-   //! <b>Requires</b>: 'n' is a node of a tree but not the header.
-   //!
-   //! <b>Effects</b>: Returns the maximum node of the subtree starting at p.
-   //!
-   //! <b>Complexity</b>: Logarithmic to the size of the subtree.
-   //!
-   //! <b>Throws</b>: Nothing.
-   static node_ptr maximum(node_ptr n);
-   #endif
-
-   //! <b>Requires</b>: 'n' must not be part of any tree.
-   //!
-   //! <b>Effects</b>: After the function unique(node) == true.
-   //!
-   //! <b>Complexity</b>: Constant.
-   //!
-   //! <b>Throws</b>: Nothing.
-   //!
-   //! <b>Nodes</b>: If node is inserted in a tree, this function corrupts the tree.
-   static void init(node_ptr n) BOOST_NOEXCEPT
-   {
-      NodeTraits::set_parent(n, node_ptr());
-      NodeTraits::set_left(n, node_ptr());
-      NodeTraits::set_right(n, node_ptr());
-   }
-
-   //! <b>Effects</b>: Returns true if node is in the same state as if called init(node)
-   //!
-   //! <b>Complexity</b>: Constant.
-   //!
-   //! <b>Throws</b>: Nothing.
-   static bool inited(const_node_ptr n)
-   {
-      return !NodeTraits::get_parent(n) &&
-             !NodeTraits::get_left(n)   &&
-             !NodeTraits::get_right(n)  ;
-   }
-
-   //! <b>Requires</b>: header must not be part of any tree.
-   //!
-   //! <b>Effects</b>: Initializes the header to represent an empty tree.
-   //!   unique(header) == true.
-   //!
-   //! <b>Complexity</b>: Constant.
-   //!
-   //! <b>Throws</b>: Nothing.
-   //!
-   //! <b>Nodes</b>: If header is inserted in a tree, this function corrupts the tree.
-   static void init_header(node_ptr header) BOOST_NOEXCEPT
-   {
-      NodeTraits::set_parent(header, node_ptr());
-      NodeTraits::set_left(header, header);
-      NodeTraits::set_right(header, header);
-   }
-
-   //! <b>Requires</b>: "disposer" must be an object function
-   //!   taking a node_ptr parameter and shouldn't throw.
-   //!
-   //! <b>Effects</b>: Empties the target tree calling
-   //!   <tt>void disposer::operator()(node_ptr)</tt> for every node of the tree
-   //!    except the header.
-   //!
-   //! <b>Complexity</b>: Linear to the number of element of the source tree plus the.
-   //!   number of elements of tree target tree when calling this function.
-   //!
-   //! <b>Throws</b>: Nothing.
-   template<class Disposer>
-   static void clear_and_dispose(node_ptr header, Disposer disposer) BOOST_NOEXCEPT
-   {
-      node_ptr source_root = NodeTraits::get_parent(header);
-      if(!source_root)
-         return;
-      dispose_subtree(source_root, disposer);
-      init_header(header);
-   }
-
-   //! <b>Requires</b>: header is the header of a tree.
-   //!
-   //! <b>Effects</b>: Unlinks the leftmost node from the tree, and
-   //!   updates the header link to the new leftmost node.
-   //!
-   //! <b>Complexity</b>: Average complexity is constant time.
-   //!
-   //! <b>Throws</b>: Nothing.
-   //!
-   //! <b>Notes</b>: This function breaks the tree and the tree can
-   //!   only be used for more unlink_leftmost_without_rebalance calls.
-   //!   This function is normally used to achieve a step by step
-   //!   controlled destruction of the tree.
-   static node_ptr unlink_leftmost_without_rebalance(node_ptr header) BOOST_NOEXCEPT
-   {
-      node_ptr leftmost = NodeTraits::get_left(header);
-      if (leftmost == header)
-         return node_ptr();
-      node_ptr leftmost_parent(NodeTraits::get_parent(leftmost));
-      node_ptr leftmost_right (NodeTraits::get_right(leftmost));
-      bool is_root = leftmost_parent == header;
-
-      if (leftmost_right){
-         NodeTraits::set_parent(leftmost_right, leftmost_parent);
-         NodeTraits::set_left(header, base_type::minimum(leftmost_right));
-
-         if (is_root)
-            NodeTraits::set_parent(header, leftmost_right);
-         else
-            NodeTraits::set_left(NodeTraits::get_parent(header), leftmost_right);
-      }
-      else if (is_root){
-         NodeTraits::set_parent(header, node_ptr());
-         NodeTraits::set_left(header,  header);
-         NodeTraits::set_right(header, header);
-      }
-      else{
-         NodeTraits::set_left(leftmost_parent, node_ptr());
-         NodeTraits::set_left(header, leftmost_parent);
-      }
-      return leftmost;
-   }
-
-   //! <b>Requires</b>: 'header' the header of the tree.
-   //!
-   //! <b>Effects</b>: Returns the number of nodes of the tree.
-   //!
-   //! <b>Complexity</b>: Linear time.
-   //!
-   //! <b>Throws</b>: Nothing.
-   static std::size_t size(const_node_ptr header) BOOST_NOEXCEPT
-   {
-      node_ptr beg(begin_node(header));
-      node_ptr end(end_node(header));
-      std::size_t i = 0;
-      for(;beg != end; beg = base_type::next_node(beg)) ++i;
-      return i;
-   }
-
-   //! <b>Requires</b>: header1 and header2 must be the header nodes
-   //!  of two trees.
-   //!
-   //! <b>Effects</b>: Swaps two trees. After the function header1 will contain
-   //!   links to the second tree and header2 will have links to the first tree.
-   //!
-   //! <b>Complexity</b>: Constant.
-   //!
-   //! <b>Throws</b>: Nothing.
-   static void swap_tree(node_ptr header1, node_ptr header2) BOOST_NOEXCEPT
-   {
-      if(header1 == header2)
-         return;
-
-      node_ptr tmp;
-
-      //Parent swap
-      tmp = NodeTraits::get_parent(header1);
-      NodeTraits::set_parent(header1, NodeTraits::get_parent(header2));
-      NodeTraits::set_parent(header2, tmp);
-      //Left swap
-      tmp = NodeTraits::get_left(header1);
-      NodeTraits::set_left(header1, NodeTraits::get_left(header2));
-      NodeTraits::set_left(header2, tmp);
-      //Right swap
-      tmp = NodeTraits::get_right(header1);
-      NodeTraits::set_right(header1, NodeTraits::get_right(header2));
-      NodeTraits::set_right(header2, tmp);
-
-      //Now test parent
-      node_ptr h1_parent(NodeTraits::get_parent(header1));
-      if(h1_parent){
-         NodeTraits::set_parent(h1_parent, header1);
-      }
-      else{
-         NodeTraits::set_left(header1, header1);
-         NodeTraits::set_right(header1, header1);
-      }
-
-      node_ptr h2_parent(NodeTraits::get_parent(header2));
-      if(h2_parent){
-         NodeTraits::set_parent(h2_parent, header2);
-      }
-      else{
-         NodeTraits::set_left(header2, header2);
-         NodeTraits::set_right(header2, header2);
-      }
-   }
-
-   #if defined(BOOST_INTRUSIVE_DOXYGEN_INVOKED)
-   //! <b>Requires</b>: p is a node of a tree.
-   //!
-   //! <b>Effects</b>: Returns true if p is the header of the tree.
-   //!
-   //! <b>Complexity</b>: Constant.
-   //!
-   //! <b>Throws</b>: Nothing.
-   static bool is_header(const_node_ptr p) BOOST_NOEXCEPT;
-   #endif
-
-   //! <b>Requires</b>: "header" must be the header node of a tree.
-   //!   KeyNodePtrCompare is a function object that induces a strict weak
-   //!   ordering compatible with the strict weak ordering used to create the
-   //!   the tree. KeyNodePtrCompare can compare KeyType with tree's node_ptrs.
-   //!
-   //! <b>Effects</b>: Returns a node_ptr to the first element that is equivalent to
-   //!   "key" according to "comp" or "header" if that element does not exist.
-   //!
-   //! <b>Complexity</b>: Logarithmic.
-   //!
-   //! <b>Throws</b>: If "comp" throws.
-   template<class KeyType, class KeyNodePtrCompare>
-   static node_ptr find
-      (const_node_ptr header, const KeyType &key, KeyNodePtrCompare comp)
-   {
-      node_ptr end = detail::uncast(header);
-      node_ptr y = lower_bound(header, key, comp);
-      return (y == end || comp(key, y)) ? end : y;
-   }
-
-   //! <b>Requires</b>: "header" must be the header node of a tree.
-   //!   KeyNodePtrCompare is a function object that induces a strict weak
-   //!   ordering compatible with the strict weak ordering used to create the
-   //!   the tree. KeyNodePtrCompare can compare KeyType with tree's node_ptrs.
-   //!   'lower_key' must not be greater than 'upper_key' according to 'comp'. If
-   //!   'lower_key' == 'upper_key', ('left_closed' || 'right_closed') must be true.
-   //!
-   //! <b>Effects</b>: Returns an a pair with the following criteria:
-   //!
-   //!   first = lower_bound(lower_key) if left_closed, upper_bound(lower_key) otherwise
-   //!
-   //!   second = upper_bound(upper_key) if right_closed, lower_bound(upper_key) otherwise
-   //!
-   //! <b>Complexity</b>: Logarithmic.
-   //!
-   //! <b>Throws</b>: If "comp" throws.
-   //!
-   //! <b>Note</b>: This function can be more efficient than calling upper_bound
-   //!   and lower_bound for lower_key and upper_key.
-   //!
-   //! <b>Note</b>: Experimental function, the interface might change.
-   template< class KeyType, class KeyNodePtrCompare>
-   static std::pair<node_ptr, node_ptr> bounded_range
-      ( const_node_ptr header
-      , const KeyType &lower_key
-      , const KeyType &upper_key
-      , KeyNodePtrCompare comp
-      , bool left_closed
-      , bool right_closed)
-   {
-      node_ptr y = detail::uncast(header);
-      node_ptr x = NodeTraits::get_parent(header);
-
-      while(x){
-         //If x is less than lower_key the target
-         //range is on the right part
-         if(comp(x, lower_key)){
-            //Check for invalid input range
-            BOOST_INTRUSIVE_INVARIANT_ASSERT(comp(x, upper_key));
-            x = NodeTraits::get_right(x);
-         }
-         //If the upper_key is less than x, the target
-         //range is on the left part
-         else if(comp(upper_key, x)){
-            y = x;
-            x = NodeTraits::get_left(x);
-         }
-         else{
-            //x is inside the bounded range(lower_key <= x <= upper_key),
-            //so we must split lower and upper searches
-            //
-            //Sanity check: if lower_key and upper_key are equal, then both left_closed and right_closed can't be false
-            BOOST_INTRUSIVE_INVARIANT_ASSERT(left_closed || right_closed || comp(lower_key, x) || comp(x, upper_key));
-            return std::pair<node_ptr,node_ptr>(
-               left_closed
-                  //If left_closed, then comp(x, lower_key) is already the lower_bound
-                  //condition so we save one comparison and go to the next level
-                  //following traditional lower_bound algo
-                  ? lower_bound_loop(NodeTraits::get_left(x), x, lower_key, comp)
-                  //If left-open, comp(x, lower_key) is not the upper_bound algo
-                  //condition so we must recheck current 'x' node with upper_bound algo
-                  : upper_bound_loop(x, y, lower_key, comp)
-            ,
-               right_closed
-                  //If right_closed, then comp(upper_key, x) is already the upper_bound
-                  //condition so we can save one comparison and go to the next level
-                  //following lower_bound algo
-                  ? upper_bound_loop(NodeTraits::get_right(x), y, upper_key, comp)
-                  //If right-open, comp(upper_key, x) is not the lower_bound algo
-                  //condition so we must recheck current 'x' node with lower_bound algo
-                  : lower_bound_loop(x, y, upper_key, comp)
-            );
-         }
-      }
-      return std::pair<node_ptr,node_ptr> (y, y);
-   }
-
-   //! <b>Requires</b>: "header" must be the header node of a tree.
-   //!   KeyNodePtrCompare is a function object that induces a strict weak
-   //!   ordering compatible with the strict weak ordering used to create the
-   //!   the tree. KeyNodePtrCompare can compare KeyType with tree's node_ptrs.
-   //!
-   //! <b>Effects</b>: Returns the number of elements with a key equivalent to "key"
-   //!   according to "comp".
-   //!
-   //! <b>Complexity</b>: Logarithmic.
-   //!
-   //! <b>Throws</b>: If "comp" throws.
-   template<class KeyType, class KeyNodePtrCompare>
-   static std::size_t count
-      (const_node_ptr header, const KeyType &key, KeyNodePtrCompare comp)
-   {
-      std::pair<node_ptr, node_ptr> ret = equal_range(header, key, comp);
-      std::size_t n = 0;
-      while(ret.first != ret.second){
-         ++n;
-         ret.first = base_type::next_node(ret.first);
-      }
-      return n;
-   }
-
-   //! <b>Requires</b>: "header" must be the header node of a tree.
-   //!   KeyNodePtrCompare is a function object that induces a strict weak
-   //!   ordering compatible with the strict weak ordering used to create the
-   //!   the tree. KeyNodePtrCompare can compare KeyType with tree's node_ptrs.
-   //!
-   //! <b>Effects</b>: Returns an a pair of node_ptr delimiting a range containing
-   //!   all elements that are equivalent to "key" according to "comp" or an
-   //!   empty range that indicates the position where those elements would be
-   //!   if there are no equivalent elements.
-   //!
-   //! <b>Complexity</b>: Logarithmic.
-   //!
-   //! <b>Throws</b>: If "comp" throws.
-   template<class KeyType, class KeyNodePtrCompare>
-   BOOST_INTRUSIVE_FORCEINLINE static std::pair<node_ptr, node_ptr> equal_range
-      (const_node_ptr header, const KeyType &key, KeyNodePtrCompare comp)
-   {
-      return bounded_range(header, key, key, comp, true, true);
-   }
-
-   //! <b>Requires</b>: "header" must be the header node of a tree.
-   //!   KeyNodePtrCompare is a function object that induces a strict weak
-   //!   ordering compatible with the strict weak ordering used to create the
-   //!   the tree. KeyNodePtrCompare can compare KeyType with tree's node_ptrs.
-   //!
-   //! <b>Effects</b>: Returns an a pair of node_ptr delimiting a range containing
-   //!   the first element that is equivalent to "key" according to "comp" or an
-   //!   empty range that indicates the position where that element would be
-   //!   if there are no equivalent elements.
-   //!
-   //! <b>Complexity</b>: Logarithmic.
-   //!
-   //! <b>Throws</b>: If "comp" throws.
-   template<class KeyType, class KeyNodePtrCompare>
-   static std::pair<node_ptr, node_ptr> lower_bound_range
-      (const_node_ptr header, const KeyType &key, KeyNodePtrCompare comp)
-   {
-      node_ptr const lb(lower_bound(header, key, comp));
-      std::pair<node_ptr, node_ptr> ret_ii(lb, lb);
-      if(lb != header && !comp(key, lb)){
-         ret_ii.second = base_type::next_node(ret_ii.second);
-      }
-      return ret_ii;
-   }
-
-   //! <b>Requires</b>: "header" must be the header node of a tree.
-   //!   KeyNodePtrCompare is a function object that induces a strict weak
-   //!   ordering compatible with the strict weak ordering used to create the
-   //!   the tree. KeyNodePtrCompare can compare KeyType with tree's node_ptrs.
-   //!
-   //! <b>Effects</b>: Returns a node_ptr to the first element that is
-   //!   not less than "key" according to "comp" or "header" if that element does
-   //!   not exist.
-   //!
-   //! <b>Complexity</b>: Logarithmic.
-   //!
-   //! <b>Throws</b>: If "comp" throws.
-   template<class KeyType, class KeyNodePtrCompare>
-   BOOST_INTRUSIVE_FORCEINLINE static node_ptr lower_bound
-      (const_node_ptr header, const KeyType &key, KeyNodePtrCompare comp)
-   {
-      return lower_bound_loop(NodeTraits::get_parent(header), detail::uncast(header), key, comp);
-   }
-
-   //! <b>Requires</b>: "header" must be the header node of a tree.
-   //!   KeyNodePtrCompare is a function object that induces a strict weak
-   //!   ordering compatible with the strict weak ordering used to create the
-   //!   the tree. KeyNodePtrCompare can compare KeyType with tree's node_ptrs.
-   //!
-   //! <b>Effects</b>: Returns a node_ptr to the first element that is greater
-   //!   than "key" according to "comp" or "header" if that element does not exist.
-   //!
-   //! <b>Complexity</b>: Logarithmic.
-   //!
-   //! <b>Throws</b>: If "comp" throws.
-   template<class KeyType, class KeyNodePtrCompare>
-   BOOST_INTRUSIVE_FORCEINLINE static node_ptr upper_bound
-      (const_node_ptr header, const KeyType &key, KeyNodePtrCompare comp)
-   {
-      return upper_bound_loop(NodeTraits::get_parent(header), detail::uncast(header), key, comp);
-   }
-
-   //! <b>Requires</b>: "header" must be the header node of a tree.
-   //!   "commit_data" must have been obtained from a previous call to
-   //!   "insert_unique_check". No objects should have been inserted or erased
-   //!   from the set between the "insert_unique_check" that filled "commit_data"
-   //!   and the call to "insert_commit".
-   //!
-   //!
-   //! <b>Effects</b>: Inserts new_node in the set using the information obtained
-   //!   from the "commit_data" that a previous "insert_check" filled.
-   //!
-   //! <b>Complexity</b>: Constant time.
-   //!
-   //! <b>Throws</b>: Nothing.
-   //!
-   //! <b>Notes</b>: This function has only sense if a "insert_unique_check" has been
-   //!   previously executed to fill "commit_data". No value should be inserted or
-   //!   erased between the "insert_check" and "insert_commit" calls.
-   BOOST_INTRUSIVE_FORCEINLINE static void insert_unique_commit
-      (node_ptr header, node_ptr new_value, const insert_commit_data &commit_data) BOOST_NOEXCEPT
-   {  return insert_commit(header, new_value, commit_data); }
-
-   //! <b>Requires</b>: "header" must be the header node of a tree.
-   //!   KeyNodePtrCompare is a function object that induces a strict weak
-   //!   ordering compatible with the strict weak ordering used to create the
-   //!   the tree. NodePtrCompare compares KeyType with a node_ptr.
-   //!
-   //! <b>Effects</b>: Checks if there is an equivalent node to "key" in the
-   //!   tree according to "comp" and obtains the needed information to realize
-   //!   a constant-time node insertion if there is no equivalent node.
-   //!
-   //! <b>Returns</b>: If there is an equivalent value
-   //!   returns a pair containing a node_ptr to the already present node
-   //!   and false. If there is not equivalent key can be inserted returns true
-   //!   in the returned pair's boolean and fills "commit_data" that is meant to
-   //!   be used with the "insert_commit" function to achieve a constant-time
-   //!   insertion function.
-   //!
-   //! <b>Complexity</b>: Average complexity is at most logarithmic.
-   //!
-   //! <b>Throws</b>: If "comp" throws.
-   //!
-   //! <b>Notes</b>: This function is used to improve performance when constructing
-   //!   a node is expensive and the user does not want to have two equivalent nodes
-   //!   in the tree: if there is an equivalent value
-   //!   the constructed object must be discarded. Many times, the part of the
-   //!   node that is used to impose the order is much cheaper to construct
-   //!   than the node and this function offers the possibility to use that part
-   //!   to check if the insertion will be successful.
-   //!
-   //!   If the check is successful, the user can construct the node and use
-   //!   "insert_commit" to insert the node in constant-time. This gives a total
-   //!   logarithmic complexity to the insertion: check(O(log(N)) + commit(O(1)).
-   //!
-   //!   "commit_data" remains valid for a subsequent "insert_unique_commit" only
-   //!   if no more objects are inserted or erased from the set.
-   template<class KeyType, class KeyNodePtrCompare>
-   static std::pair<node_ptr, bool> insert_unique_check
-      (const_node_ptr header, const KeyType &key
-      ,KeyNodePtrCompare comp, insert_commit_data &commit_data
-         #ifndef BOOST_INTRUSIVE_DOXYGEN_INVOKED
-         , std::size_t *pdepth = 0
-         #endif
-      )
-   {
-      std::size_t depth = 0;
-      node_ptr h(detail::uncast(header));
-      node_ptr y(h);
-      node_ptr x(NodeTraits::get_parent(y));
-      node_ptr prev = node_ptr();
-
-      //Find the upper bound, cache the previous value and if we should
-      //store it in the left or right node
-      bool left_child = true;
-      while(x){
-         ++depth;
-         y = x;
-         left_child = comp(key, x);
-         x = left_child ?
-               NodeTraits::get_left(x) : (prev = y, NodeTraits::get_right(x));
-      }
-
-      if(pdepth)  *pdepth = depth;
-
-      //Since we've found the upper bound there is no other value with the same key if:
-      //    - There is no previous node
-      //    - The previous node is less than the key
-      const bool not_present = !prev || comp(prev, key);
-      if(not_present){
-         commit_data.link_left = left_child;
-         commit_data.node      = y;
-      }
-      return std::pair<node_ptr, bool>(prev, not_present);
-   }
-
-   //! <b>Requires</b>: "header" must be the header node of a tree.
-   //!   KeyNodePtrCompare is a function object that induces a strict weak
-   //!   ordering compatible with the strict weak ordering used to create the
-   //!   the tree. NodePtrCompare compares KeyType with a node_ptr.
-   //!   "hint" is node from the "header"'s tree.
-   //!
-   //! <b>Effects</b>: Checks if there is an equivalent node to "key" in the
-   //!   tree according to "comp" using "hint" as a hint to where it should be
-   //!   inserted and obtains the needed information to realize
-   //!   a constant-time node insertion if there is no equivalent node.
-   //!   If "hint" is the upper_bound the function has constant time
-   //!   complexity (two comparisons in the worst case).
-   //!
-   //! <b>Returns</b>: If there is an equivalent value
-   //!   returns a pair containing a node_ptr to the already present node
-   //!   and false. If there is not equivalent key can be inserted returns true
-   //!   in the returned pair's boolean and fills "commit_data" that is meant to
-   //!   be used with the "insert_commit" function to achieve a constant-time
-   //!   insertion function.
-   //!
-   //! <b>Complexity</b>: Average complexity is at most logarithmic, but it is
-   //!   amortized constant time if new_node should be inserted immediately before "hint".
-   //!
-   //! <b>Throws</b>: If "comp" throws.
-   //!
-   //! <b>Notes</b>: This function is used to improve performance when constructing
-   //!   a node is expensive and the user does not want to have two equivalent nodes
-   //!   in the tree: if there is an equivalent value
-   //!   the constructed object must be discarded. Many times, the part of the
-   //!   node that is used to impose the order is much cheaper to construct
-   //!   than the node and this function offers the possibility to use that part
-   //!   to check if the insertion will be successful.
-   //!
-   //!   If the check is successful, the user can construct the node and use
-   //!   "insert_commit" to insert the node in constant-time. This gives a total
-   //!   logarithmic complexity to the insertion: check(O(log(N)) + commit(O(1)).
-   //!
-   //!   "commit_data" remains valid for a subsequent "insert_unique_commit" only
-   //!   if no more objects are inserted or erased from the set.
-   template<class KeyType, class KeyNodePtrCompare>
-   static std::pair<node_ptr, bool> insert_unique_check
-      (const_node_ptr header, node_ptr hint, const KeyType &key
-      ,KeyNodePtrCompare comp, insert_commit_data &commit_data
-         #ifndef BOOST_INTRUSIVE_DOXYGEN_INVOKED
-         , std::size_t *pdepth = 0
-         #endif
-      )
-   {
-      //hint must be bigger than the key
-      if(hint == header || comp(key, hint)){
-         node_ptr prev(hint);
-         //Previous value should be less than the key
-         if(hint == begin_node(header) || comp((prev = base_type::prev_node(hint)), key)){
-            commit_data.link_left = unique(header) || !NodeTraits::get_left(hint);
-            commit_data.node      = commit_data.link_left ? hint : prev;
-            if(pdepth){
-               *pdepth = commit_data.node == header ? 0 : depth(commit_data.node) + 1;
-            }
-            return std::pair<node_ptr, bool>(node_ptr(), true);
-         }
-      }
-      //Hint was wrong, use hintless insertion
-      return insert_unique_check(header, key, comp, commit_data, pdepth);
-   }
-
-   //! <b>Requires</b>: "header" must be the header node of a tree.
-   //!   NodePtrCompare is a function object that induces a strict weak
-   //!   ordering compatible with the strict weak ordering used to create the
-   //!   the tree. NodePtrCompare compares two node_ptrs. "hint" is node from
-   //!   the "header"'s tree.
-   //!
-   //! <b>Effects</b>: Inserts new_node into the tree, using "hint" as a hint to
-   //!   where it will be inserted. If "hint" is the upper_bound
-   //!   the insertion takes constant time (two comparisons in the worst case).
-   //!
-   //! <b>Complexity</b>: Logarithmic in general, but it is amortized
-   //!   constant time if new_node is inserted immediately before "hint".
-   //!
-   //! <b>Throws</b>: If "comp" throws.
-   template<class NodePtrCompare>
-   static node_ptr insert_equal
-      (node_ptr h, node_ptr hint, node_ptr new_node, NodePtrCompare comp
-         #ifndef BOOST_INTRUSIVE_DOXYGEN_INVOKED
-         , std::size_t *pdepth = 0
-         #endif
-      )
-   {
-      insert_commit_data commit_data;
-      insert_equal_check(h, hint, new_node, comp, commit_data, pdepth);
-      insert_commit(h, new_node, commit_data);
-      return new_node;
-   }
-
-   //! <b>Requires</b>: "h" must be the header node of a tree.
-   //!   NodePtrCompare is a function object that induces a strict weak
-   //!   ordering compatible with the strict weak ordering used to create the
-   //!   the tree. NodePtrCompare compares two node_ptrs.
-   //!
-   //! <b>Effects</b>: Inserts new_node into the tree before the upper bound
-   //!   according to "comp".
-   //!
-   //! <b>Complexity</b>: Average complexity for insert element is at
-   //!   most logarithmic.
-   //!
-   //! <b>Throws</b>: If "comp" throws.
-   template<class NodePtrCompare>
-   static node_ptr insert_equal_upper_bound
-      (node_ptr h, node_ptr new_node, NodePtrCompare comp
-         #ifndef BOOST_INTRUSIVE_DOXYGEN_INVOKED
-         , std::size_t *pdepth = 0
-         #endif
-      )
-   {
-      insert_commit_data commit_data;
-      insert_equal_upper_bound_check(h, new_node, comp, commit_data, pdepth);
-      insert_commit(h, new_node, commit_data);
-      return new_node;
-   }
-
-   //! <b>Requires</b>: "h" must be the header node of a tree.
-   //!   NodePtrCompare is a function object that induces a strict weak
-   //!   ordering compatible with the strict weak ordering used to create the
-   //!   the tree. NodePtrCompare compares two node_ptrs.
-   //!
-   //! <b>Effects</b>: Inserts new_node into the tree before the lower bound
-   //!   according to "comp".
-   //!
-   //! <b>Complexity</b>: Average complexity for insert element is at
-   //!   most logarithmic.
-   //!
-   //! <b>Throws</b>: If "comp" throws.
-   template<class NodePtrCompare>
-   static node_ptr insert_equal_lower_bound
-      (node_ptr h, node_ptr new_node, NodePtrCompare comp
-         #ifndef BOOST_INTRUSIVE_DOXYGEN_INVOKED
-         , std::size_t *pdepth = 0
-         #endif
-      )
-   {
-      insert_commit_data commit_data;
-      insert_equal_lower_bound_check(h, new_node, comp, commit_data, pdepth);
-      insert_commit(h, new_node, commit_data);
-      return new_node;
-   }
-
-   //! <b>Requires</b>: "header" must be the header node of a tree.
-   //!   "pos" must be a valid iterator or header (end) node.
-   //!   "pos" must be an iterator pointing to the successor to "new_node"
-   //!   once inserted according to the order of already inserted nodes. This function does not
-   //!   check "pos" and this precondition must be guaranteed by the caller.
-   //!
-   //! <b>Effects</b>: Inserts new_node into the tree before "pos".
-   //!
-   //! <b>Complexity</b>: Constant-time.
-   //!
-   //! <b>Throws</b>: Nothing.
-   //!
-   //! <b>Note</b>: If "pos" is not the successor of the newly inserted "new_node"
-   //! tree invariants might be broken.
-   static node_ptr insert_before
-      (node_ptr header, node_ptr pos, node_ptr new_node
-         #ifndef BOOST_INTRUSIVE_DOXYGEN_INVOKED
-         , std::size_t *pdepth = 0
-         #endif
-      ) BOOST_NOEXCEPT
-   {
-      insert_commit_data commit_data;
-      insert_before_check(header, pos, commit_data, pdepth);
-      insert_commit(header, new_node, commit_data);
-      return new_node;
-   }
-
-   //! <b>Requires</b>: "header" must be the header node of a tree.
-   //!   "new_node" must be, according to the used ordering no less than the
-   //!   greatest inserted key.
-   //!
-   //! <b>Effects</b>: Inserts new_node into the tree before "pos".
-   //!
-   //! <b>Complexity</b>: Constant-time.
-   //!
-   //! <b>Throws</b>: Nothing.
-   //!
-   //! <b>Note</b>: If "new_node" is less than the greatest inserted key
-   //! tree invariants are broken. This function is slightly faster than
-   //! using "insert_before".
-   static void push_back
-      (node_ptr header, node_ptr new_node
-         #ifndef BOOST_INTRUSIVE_DOXYGEN_INVOKED
-         , std::size_t *pdepth = 0
-         #endif
-      ) BOOST_NOEXCEPT
-   {
-      insert_commit_data commit_data;
-      push_back_check(header, commit_data, pdepth);
-      insert_commit(header, new_node, commit_data);
-   }
-
-   //! <b>Requires</b>: "header" must be the header node of a tree.
-   //!   "new_node" must be, according to the used ordering, no greater than the
-   //!   lowest inserted key.
-   //!
-   //! <b>Effects</b>: Inserts new_node into the tree before "pos".
-   //!
-   //! <b>Complexity</b>: Constant-time.
-   //!
-   //! <b>Throws</b>: Nothing.
-   //!
-   //! <b>Note</b>: If "new_node" is greater than the lowest inserted key
-   //! tree invariants are broken. This function is slightly faster than
-   //! using "insert_before".
-   static void push_front
-      (node_ptr header, node_ptr new_node
-         #ifndef BOOST_INTRUSIVE_DOXYGEN_INVOKED
-         , std::size_t *pdepth = 0
-         #endif
-      ) BOOST_NOEXCEPT
-   {
-      insert_commit_data commit_data;
-      push_front_check(header, commit_data, pdepth);
-      insert_commit(header, new_node, commit_data);
-   }
-
-   //! <b>Requires</b>: 'n' can't be a header node.
-   //!
-   //! <b>Effects</b>: Calculates the depth of a node: the depth of a
-   //! node is the length (number of edges) of the path from the root
-   //! to that node. (The root node is at depth 0.)
-   //!
-   //! <b>Complexity</b>: Logarithmic to the number of nodes in the tree.
-   //!
-   //! <b>Throws</b>: Nothing.
-   static std::size_t depth(const_node_ptr n) BOOST_NOEXCEPT
-   {
-      std::size_t depth = 0;
-      node_ptr p_parent;
-      while(n != NodeTraits::get_parent(p_parent = NodeTraits::get_parent(n))){
-         ++depth;
-         n = p_parent;
-      }
-      return depth;
-   }
-
-   //! <b>Requires</b>: "cloner" must be a function
-   //!   object taking a node_ptr and returning a new cloned node of it. "disposer" must
-   //!   take a node_ptr and shouldn't throw.
-   //!
-   //! <b>Effects</b>: First empties target tree calling
-   //!   <tt>void disposer::operator()(node_ptr)</tt> for every node of the tree
-   //!    except the header.
-   //!
-   //!   Then, duplicates the entire tree pointed by "source_header" cloning each
-   //!   source node with <tt>node_ptr Cloner::operator()(node_ptr)</tt> to obtain
-   //!   the nodes of the target tree. If "cloner" throws, the cloned target nodes
-   //!   are disposed using <tt>void disposer(node_ptr )</tt>.
-   //!
-   //! <b>Complexity</b>: Linear to the number of element of the source tree plus the
-   //!   number of elements of tree target tree when calling this function.
-   //!
-   //! <b>Throws</b>: If cloner functor throws. If this happens target nodes are disposed.
-   template <class Cloner, class Disposer>
-   static void clone
-      (const_node_ptr source_header, node_ptr target_header, Cloner cloner, Disposer disposer)
-   {
-      if(!unique(target_header)){
-         clear_and_dispose(target_header, disposer);
-      }
-
-      node_ptr leftmost, rightmost;
-      node_ptr new_root = clone_subtree
-         (source_header, target_header, cloner, disposer, leftmost, rightmost);
-
-      //Now update header node
-      NodeTraits::set_parent(target_header, new_root);
-      NodeTraits::set_left  (target_header, leftmost);
-      NodeTraits::set_right (target_header, rightmost);
-   }
-
-   //! <b>Requires</b>: header must be the header of a tree, z a node
-   //!    of that tree and z != header.
-   //!
-   //! <b>Effects</b>: Erases node "z" from the tree with header "header".
-   //!
-   //! <b>Complexity</b>: Amortized constant time.
-   //!
-   //! <b>Throws</b>: Nothing.
-   BOOST_INTRUSIVE_FORCEINLINE static void erase(node_ptr header, node_ptr z) BOOST_NOEXCEPT
-   {
-      data_for_rebalance ignored;
-      erase(header, z, ignored);
-   }
-
-   //! <b>Requires</b>: header1 and header2 must be the headers of trees tree1 and tree2
-   //!   respectively, z a non-header node of tree1. NodePtrCompare is the comparison
-   //!   function of tree1..
-   //!
-   //! <b>Effects</b>: Transfers node "z" from tree1 to tree2 if tree1 does not contain
-   //!   a node that is equivalent to z.
-   //!
-   //! <b>Returns</b>: True if the node was trasferred, false otherwise.
-   //!
-   //! <b>Complexity</b>: Logarithmic.
-   //!
-   //! <b>Throws</b>: If the comparison throws.
-   template<class NodePtrCompare>
-   BOOST_INTRUSIVE_FORCEINLINE static bool transfer_unique
-      (node_ptr header1, NodePtrCompare comp, node_ptr header2, node_ptr z)
-   {
-      data_for_rebalance ignored;
-      return transfer_unique(header1, comp, header2, z, ignored);
-   }
-
-   //! <b>Requires</b>: header1 and header2 must be the headers of trees tree1 and tree2
-   //!   respectively, z a non-header node of tree1. NodePtrCompare is the comparison
-   //!   function of tree1..
-   //!
-   //! <b>Effects</b>: Transfers node "z" from tree1 to tree2.
-   //!
-   //! <b>Complexity</b>: Logarithmic.
-   //!
-   //! <b>Throws</b>: If the comparison throws.
-   template<class NodePtrCompare>
-   BOOST_INTRUSIVE_FORCEINLINE static void transfer_equal
-      (node_ptr header1, NodePtrCompare comp, node_ptr header2, node_ptr z)
-   {
-      data_for_rebalance ignored;
-      transfer_equal(header1, comp, header2, z, ignored);
-   }
-
-   //! <b>Requires</b>: 'n' is a tree node but not the header.
-   //!
-   //! <b>Effects</b>: Unlinks the node and rebalances the tree.
-   //!
-   //! <b>Complexity</b>: Average complexity is constant time.
-   //!
-   //! <b>Throws</b>: Nothing.
-   static void unlink(node_ptr n) BOOST_NOEXCEPT
-   {
-      node_ptr x = NodeTraits::get_parent(n);
-      if(x){
-         while(!base_type::is_header(x))
-            x = NodeTraits::get_parent(x);
-         erase(x, n);
-      }
-   }
-
-   //! <b>Requires</b>: header must be the header of a tree.
-   //!
-   //! <b>Effects</b>: Rebalances the tree.
-   //!
-   //! <b>Throws</b>: Nothing.
-   //!
-   //! <b>Complexity</b>: Linear.
-   static void rebalance(node_ptr header) BOOST_NOEXCEPT
-   {
-      node_ptr root = NodeTraits::get_parent(header);
-      if(root){
-         rebalance_subtree(root);
-      }
-   }
-
-   //! <b>Requires</b>: old_root is a node of a tree. It shall not be null.
-   //!
-   //! <b>Effects</b>: Rebalances the subtree rooted at old_root.
-   //!
-   //! <b>Returns</b>: The new root of the subtree.
-   //!
-   //! <b>Throws</b>: Nothing.
-   //!
-   //! <b>Complexity</b>: Linear.
-   static node_ptr rebalance_subtree(node_ptr old_root) BOOST_NOEXCEPT
-   {
-      //Taken from:
-      //"Tree rebalancing in optimal time and space"
-      //Quentin F. Stout and Bette L. Warren
-
-      //To avoid irregularities in the algorithm (old_root can be a
-      //left or right child or even the root of the tree) just put the
-      //root as the right child of its parent. Before doing this backup
-      //information to restore the original relationship after
-      //the algorithm is applied.
-      node_ptr super_root = NodeTraits::get_parent(old_root);
-      BOOST_INTRUSIVE_INVARIANT_ASSERT(super_root);
-
-      //Get root info
-      node_ptr super_root_right_backup = NodeTraits::get_right(super_root);
-      bool super_root_is_header = NodeTraits::get_parent(super_root) == old_root;
-      bool old_root_is_right  = is_right_child(old_root);
-      NodeTraits::set_right(super_root, old_root);
-
-      std::size_t size;
-      subtree_to_vine(super_root, size);
-      vine_to_subtree(super_root, size);
-      node_ptr new_root = NodeTraits::get_right(super_root);
-
-      //Recover root
-      if(super_root_is_header){
-         NodeTraits::set_right(super_root, super_root_right_backup);
-         NodeTraits::set_parent(super_root, new_root);
-      }
-      else if(old_root_is_right){
-         NodeTraits::set_right(super_root, new_root);
-      }
-      else{
-         NodeTraits::set_right(super_root, super_root_right_backup);
-         NodeTraits::set_left(super_root, new_root);
-      }
-      return new_root;
-   }
-
-   //! <b>Effects</b>: Asserts the integrity of the container with additional checks provided by the user.
-   //!
-   //! <b>Requires</b>: header must be the header of a tree.
-   //!
-   //! <b>Complexity</b>: Linear time.
-   //!
-   //! <b>Note</b>: The method might not have effect when asserts are turned off (e.g., with NDEBUG).
-   //!   Experimental function, interface might change in future versions.
-   template<class Checker>
-   static void check(const_node_ptr header, Checker checker, typename Checker::return_type& checker_return)
-   {
-      const_node_ptr root_node_ptr = NodeTraits::get_parent(header);
-      if (!root_node_ptr){
-         // check left&right header pointers
-         BOOST_INTRUSIVE_INVARIANT_ASSERT(NodeTraits::get_left(header) == header);
-         BOOST_INTRUSIVE_INVARIANT_ASSERT(NodeTraits::get_right(header) == header);
-      }
-      else{
-         // check parent pointer of root node
-         BOOST_INTRUSIVE_INVARIANT_ASSERT(NodeTraits::get_parent(root_node_ptr) == header);
-         // check subtree from root
-         check_subtree(root_node_ptr, checker, checker_return);
-         // check left&right header pointers
-         const_node_ptr p = root_node_ptr;
-         while (NodeTraits::get_left(p)) { p = NodeTraits::get_left(p); }
-         BOOST_INTRUSIVE_INVARIANT_ASSERT(NodeTraits::get_left(header) == p);
-         p = root_node_ptr;
-         while (NodeTraits::get_right(p)) { p = NodeTraits::get_right(p); }
-         BOOST_INTRUSIVE_INVARIANT_ASSERT(NodeTraits::get_right(header) == p);
-      }
-   }
-
-   protected:
-
-   template<class NodePtrCompare>
-   static bool transfer_unique
-      (node_ptr header1, NodePtrCompare comp, node_ptr header2, node_ptr z, data_for_rebalance &info)
-   {
-      insert_commit_data commit_data;
-      bool const transferable = insert_unique_check(header1, z, comp, commit_data).second;
-      if(transferable){
-         erase(header2, z, info);
-         insert_commit(header1, z, commit_data);
-      }
-      return transferable;
-   }
-
-   template<class NodePtrCompare>
-   static void transfer_equal
-      (node_ptr header1, NodePtrCompare comp, node_ptr header2, node_ptr z, data_for_rebalance &info)
-   {
-      insert_commit_data commit_data;
-      insert_equal_upper_bound_check(header1, z, comp, commit_data);
-      erase(header2, z, info);
-      insert_commit(header1, z, commit_data);
-   }
-
-   static void erase(node_ptr header, node_ptr z, data_for_rebalance &info)
-   {
-      node_ptr y(z);
-      node_ptr x;
-      const node_ptr z_left(NodeTraits::get_left(z));
-      const node_ptr z_right(NodeTraits::get_right(z));
-
-      if(!z_left){
-         x = z_right;    // x might be null.
-      }
-      else if(!z_right){ // z has exactly one non-null child. y == z.
-         x = z_left;       // x is not null.
-         BOOST_ASSERT(x);
-      }
-      else{ //make y != z
-         // y = find z's successor
-         y = base_type::minimum(z_right);
-         x = NodeTraits::get_right(y);     // x might be null.
-      }
-
-      node_ptr x_parent;
-      const node_ptr z_parent(NodeTraits::get_parent(z));
-      const bool z_is_leftchild(NodeTraits::get_left(z_parent) == z);
-
-      if(y != z){ //has two children and y is the minimum of z
-         //y is z's successor and it has a null left child.
-         //x is the right child of y (it can be null)
-         //Relink y in place of z and link x with y's old parent
-         NodeTraits::set_parent(z_left, y);
-         NodeTraits::set_left(y, z_left);
-         if(y != z_right){
-            //Link y with the right tree of z
-            NodeTraits::set_right(y, z_right);
-            NodeTraits::set_parent(z_right, y);
-            //Link x with y's old parent (y must be a left child)
-            x_parent = NodeTraits::get_parent(y);
-            BOOST_ASSERT(NodeTraits::get_left(x_parent) == y);
-            if(x)
-               NodeTraits::set_parent(x, x_parent);
-            //Since y was the successor and not the right child of z, it must be a left child
-            NodeTraits::set_left(x_parent, x);
-         }
-         else{ //y was the right child of y so no need to fix x's position
-            x_parent = y;
-         }
-         NodeTraits::set_parent(y, z_parent);
-         this_type::set_child(header, y, z_parent, z_is_leftchild);
-      }
-      else {  // z has zero or one child, x is one child (it can be null)
-         //Just link x to z's parent
-         x_parent = z_parent;
-         if(x)
-            NodeTraits::set_parent(x, z_parent);
-         this_type::set_child(header, x, z_parent, z_is_leftchild);
-
-         //Now update leftmost/rightmost in case z was one of them
-         if(NodeTraits::get_left(header) == z){
-            //z_left must be null because z is the leftmost
-            BOOST_ASSERT(!z_left);
-            NodeTraits::set_left(header, !z_right ?
-               z_parent :  // makes leftmost == header if z == root
-               base_type::minimum(z_right));
-         }
-         if(NodeTraits::get_right(header) == z){
-            //z_right must be null because z is the rightmost
-            BOOST_ASSERT(!z_right);
-            NodeTraits::set_right(header, !z_left ?
-               z_parent :  // makes rightmost == header if z == root
-               base_type::maximum(z_left));
-         }
-      }
-
-      //If z had 0/1 child, y == z and one of its children (and maybe null)
-      //If z had 2 children, y is the successor of z and x is the right child of y
-      info.x = x;
-      info.y = y;
-      //If z had 0/1 child, x_parent is the new parent of the old right child of y (z's successor)
-      //If z had 2 children, x_parent is the new parent of y (z_parent)
-      BOOST_ASSERT(!x || NodeTraits::get_parent(x) == x_parent);
-      info.x_parent = x_parent;
-   }
-
-   //! <b>Requires</b>: 'subtree' is a node of the tree but it's not the header.
-   //!
-   //! <b>Effects</b>: Returns the number of nodes of the subtree.
-   //!
-   //! <b>Complexity</b>: Linear time.
-   //!
-   //! <b>Throws</b>: Nothing.
-   static std::size_t subtree_size(const_node_ptr subtree) BOOST_NOEXCEPT
-   {
-      std::size_t count = 0;
-      if (subtree){
-         node_ptr n = detail::uncast(subtree);
-         node_ptr m = NodeTraits::get_left(n);
-         while(m){
-            n = m;
-            m = NodeTraits::get_left(n);
-         }
-
-         while(1){
-            ++count;
-            node_ptr n_right(NodeTraits::get_right(n));
-            if(n_right){
-               n = n_right;
-               m = NodeTraits::get_left(n);
-               while(m){
-                  n = m;
-                  m = NodeTraits::get_left(n);
-               }
-            }
-            else {
-               do{
-                  if (n == subtree){
-                     return count;
-                  }
-                  m = n;
-                  n = NodeTraits::get_parent(n);
-               }while(NodeTraits::get_left(n) != m);
-            }
-         }
-      }
-      return count;
-   }
-
-   //! <b>Requires</b>: p is a node of a tree.
-   //!
-   //! <b>Effects</b>: Returns true if p is a left child.
-   //!
-   //! <b>Complexity</b>: Constant.
-   //!
-   //! <b>Throws</b>: Nothing.
-   BOOST_INTRUSIVE_FORCEINLINE static bool is_left_child(node_ptr p) BOOST_NOEXCEPT
-   {  return NodeTraits::get_left(NodeTraits::get_parent(p)) == p;  }
-
-   //! <b>Requires</b>: p is a node of a tree.
-   //!
-   //! <b>Effects</b>: Returns true if p is a right child.
-   //!
-   //! <b>Complexity</b>: Constant.
-   //!
-   //! <b>Throws</b>: Nothing.
-   BOOST_INTRUSIVE_FORCEINLINE static bool is_right_child(node_ptr p) BOOST_NOEXCEPT
-   {  return NodeTraits::get_right(NodeTraits::get_parent(p)) == p;  }
-
-   static void insert_before_check
-      (node_ptr header, node_ptr pos
-      , insert_commit_data &commit_data
-         #ifndef BOOST_INTRUSIVE_DOXYGEN_INVOKED
-         , std::size_t *pdepth = 0
-         #endif
-      )
-   {
-      node_ptr prev(pos);
-      if(pos != NodeTraits::get_left(header))
-         prev = base_type::prev_node(pos);
-      bool link_left = unique(header) || !NodeTraits::get_left(pos);
-      commit_data.link_left = link_left;
-      commit_data.node = link_left ? pos : prev;
-      if(pdepth){
-         *pdepth = commit_data.node == header ? 0 : depth(commit_data.node) + 1;
-      }
-   }
-
-   static void push_back_check
-      (node_ptr header, insert_commit_data &commit_data
-         #ifndef BOOST_INTRUSIVE_DOXYGEN_INVOKED
-         , std::size_t *pdepth = 0
-         #endif
-      ) BOOST_NOEXCEPT
-   {
-      node_ptr prev(NodeTraits::get_right(header));
-      if(pdepth){
-         *pdepth = prev == header ? 0 : depth(prev) + 1;
-      }
-      commit_data.link_left = false;
-      commit_data.node = prev;
-   }
-
-   static void push_front_check
-      (node_ptr header, insert_commit_data &commit_data
-         #ifndef BOOST_INTRUSIVE_DOXYGEN_INVOKED
-         , std::size_t *pdepth = 0
-         #endif
-      ) BOOST_NOEXCEPT
-   {
-      node_ptr pos(NodeTraits::get_left(header));
-      if(pdepth){
-         *pdepth = pos == header ? 0 : depth(pos) + 1;
-      }
-      commit_data.link_left = true;
-      commit_data.node = pos;
-   }
-
-   template<class NodePtrCompare>
-   static void insert_equal_check
-      (node_ptr header, node_ptr hint, node_ptr new_node, NodePtrCompare comp
-      , insert_commit_data &commit_data
-      /// @cond
-      , std::size_t *pdepth = 0
-      /// @endcond
-      )
-   {
-      if(hint == header || !comp(hint, new_node)){
-         node_ptr prev(hint);
-         if(hint == NodeTraits::get_left(header) ||
-            !comp(new_node, (prev = base_type::prev_node(hint)))){
-            bool link_left = unique(header) || !NodeTraits::get_left(hint);
-            commit_data.link_left = link_left;
-            commit_data.node = link_left ? hint : prev;
-            if(pdepth){
-               *pdepth = commit_data.node == header ? 0 : depth(commit_data.node) + 1;
-            }
-         }
-         else{
-            insert_equal_upper_bound_check(header, new_node, comp, commit_data, pdepth);
-         }
-      }
-      else{
-         insert_equal_lower_bound_check(header, new_node, comp, commit_data, pdepth);
-      }
-   }
-
-   template<class NodePtrCompare>
-   static void insert_equal_upper_bound_check
-      (node_ptr h, node_ptr new_node, NodePtrCompare comp, insert_commit_data & commit_data, std::size_t *pdepth = 0)
-   {
-      std::size_t depth = 0;
-      node_ptr y(h);
-      node_ptr x(NodeTraits::get_parent(y));
-
-      while(x){
-         ++depth;
-         y = x;
-         x = comp(new_node, x) ?
-               NodeTraits::get_left(x) : NodeTraits::get_right(x);
-      }
-      if(pdepth)  *pdepth = depth;
-      commit_data.link_left = (y == h) || comp(new_node, y);
-      commit_data.node = y;
-   }
-
-   template<class NodePtrCompare>
-   static void insert_equal_lower_bound_check
-      (node_ptr h, node_ptr new_node, NodePtrCompare comp, insert_commit_data & commit_data, std::size_t *pdepth = 0)
-   {
-      std::size_t depth = 0;
-      node_ptr y(h);
-      node_ptr x(NodeTraits::get_parent(y));
-
-      while(x){
-         ++depth;
-         y = x;
-         x = !comp(x, new_node) ?
-               NodeTraits::get_left(x) : NodeTraits::get_right(x);
-      }
-      if(pdepth)  *pdepth = depth;
-      commit_data.link_left = (y == h) || !comp(y, new_node);
-      commit_data.node = y;
-   }
-
-   static void insert_commit
-      (node_ptr header, node_ptr new_node, const insert_commit_data &commit_data) BOOST_NOEXCEPT
-   {
-      //Check if commit_data has not been initialized by a insert_unique_check call.
-      BOOST_INTRUSIVE_INVARIANT_ASSERT(commit_data.node != node_ptr());
-      node_ptr parent_node(commit_data.node);
-      if(parent_node == header){
-         NodeTraits::set_parent(header, new_node);
-         NodeTraits::set_right(header, new_node);
-         NodeTraits::set_left(header, new_node);
-      }
-      else if(commit_data.link_left){
-         NodeTraits::set_left(parent_node, new_node);
-         if(parent_node == NodeTraits::get_left(header))
-             NodeTraits::set_left(header, new_node);
-      }
-      else{
-         NodeTraits::set_right(parent_node, new_node);
-         if(parent_node == NodeTraits::get_right(header))
-             NodeTraits::set_right(header, new_node);
-      }
-      NodeTraits::set_parent(new_node, parent_node);
-      NodeTraits::set_right(new_node, node_ptr());
-      NodeTraits::set_left(new_node, node_ptr());
-   }
-
-   //Fix header and own's parent data when replacing x with own, providing own's old data with parent
-   static void set_child(node_ptr header, node_ptr new_child, node_ptr new_parent, const bool link_left) BOOST_NOEXCEPT
-   {
-      if(new_parent == header)
-         NodeTraits::set_parent(header, new_child);
-      else if(link_left)
-         NodeTraits::set_left(new_parent, new_child);
-      else
-         NodeTraits::set_right(new_parent, new_child);
-   }
-
-   // rotate p to left (no header and p's parent fixup)
-   static void rotate_left_no_parent_fix(node_ptr p, node_ptr p_right) BOOST_NOEXCEPT
-   {
-      node_ptr p_right_left(NodeTraits::get_left(p_right));
-      NodeTraits::set_right(p, p_right_left);
-      if(p_right_left){
-         NodeTraits::set_parent(p_right_left, p);
-      }
-      NodeTraits::set_left(p_right, p);
-      NodeTraits::set_parent(p, p_right);
-   }
-
-   // rotate p to left (with header and p's parent fixup)
-   static void rotate_left(node_ptr p, node_ptr p_right, node_ptr p_parent, node_ptr header) BOOST_NOEXCEPT
-   {
-      const bool p_was_left(NodeTraits::get_left(p_parent) == p);
-      rotate_left_no_parent_fix(p, p_right);
-      NodeTraits::set_parent(p_right, p_parent);
-      set_child(header, p_right, p_parent, p_was_left);
-   }
-
-   // rotate p to right (no header and p's parent fixup)
-   static void rotate_right_no_parent_fix(node_ptr p, node_ptr p_left) BOOST_NOEXCEPT
-   {
-      node_ptr p_left_right(NodeTraits::get_right(p_left));
-      NodeTraits::set_left(p, p_left_right);
-      if(p_left_right){
-         NodeTraits::set_parent(p_left_right, p);
-      }
-      NodeTraits::set_right(p_left, p);
-      NodeTraits::set_parent(p, p_left);
-   }
-
-   // rotate p to right (with header and p's parent fixup)
-   static void rotate_right(node_ptr p, node_ptr p_left, node_ptr p_parent, node_ptr header) BOOST_NOEXCEPT
-   {
-      const bool p_was_left(NodeTraits::get_left(p_parent) == p);
-      rotate_right_no_parent_fix(p, p_left);
-      NodeTraits::set_parent(p_left, p_parent);
-      set_child(header, p_left, p_parent, p_was_left);
-   }
-
-   private:
-
-   static void subtree_to_vine(node_ptr vine_tail, std::size_t &size) BOOST_NOEXCEPT
-   {
-      //Inspired by LibAVL:
-      //It uses a clever optimization for trees with parent pointers.
-      //No parent pointer is updated when transforming a tree to a vine as
-      //most of them will be overriten during compression rotations.
-      //A final pass must be made after the rebalancing to updated those
-      //pointers not updated by tree_to_vine + compression calls
-      std::size_t len = 0;
-      node_ptr remainder = NodeTraits::get_right(vine_tail);
-      while(remainder){
-         node_ptr tempptr = NodeTraits::get_left(remainder);
-         if(!tempptr){   //move vine-tail down one
-            vine_tail = remainder;
-            remainder = NodeTraits::get_right(remainder);
-            ++len;
-         }
-         else{ //rotate
-            NodeTraits::set_left(remainder, NodeTraits::get_right(tempptr));
-            NodeTraits::set_right(tempptr, remainder);
-            remainder = tempptr;
-            NodeTraits::set_right(vine_tail, tempptr);
-         }
-      }
-      size = len;
-   }
-
-   static void compress_subtree(node_ptr scanner, std::size_t count) BOOST_NOEXCEPT
-   {
-      while(count--){   //compress "count" spine nodes in the tree with pseudo-root scanner
-         node_ptr child = NodeTraits::get_right(scanner);
-         node_ptr child_right = NodeTraits::get_right(child);
-         NodeTraits::set_right(scanner, child_right);
-         //Avoid setting the parent of child_right
-         scanner = child_right;
-         node_ptr scanner_left = NodeTraits::get_left(scanner);
-         NodeTraits::set_right(child, scanner_left);
-         if(scanner_left)
-            NodeTraits::set_parent(scanner_left, child);
-         NodeTraits::set_left(scanner, child);
-         NodeTraits::set_parent(child, scanner);
-      }
-   }
-
-   static void vine_to_subtree(node_ptr super_root, std::size_t count) BOOST_NOEXCEPT
-   {
-      const std::size_t one_szt = 1u;
-      std::size_t leaf_nodes = count + one_szt - std::size_t(one_szt << detail::floor_log2(count + one_szt));
-      compress_subtree(super_root, leaf_nodes);  //create deepest leaves
-      std::size_t vine_nodes = count - leaf_nodes;
-      while(vine_nodes > 1){
-         vine_nodes /= 2;
-         compress_subtree(super_root, vine_nodes);
-      }
-
-      //Update parents of nodes still in the in the original vine line
-      //as those have not been updated by subtree_to_vine or compress_subtree
-      for ( node_ptr q = super_root, p = NodeTraits::get_right(super_root)
-          ; p
-          ; q = p, p = NodeTraits::get_right(p)){
-         NodeTraits::set_parent(p, q);
-      }
-   }
-
-   //! <b>Requires</b>: "n" must be a node inserted in a tree.
-   //!
-   //! <b>Effects</b>: Returns a pointer to the header node of the tree.
-   //!
-   //! <b>Complexity</b>: Logarithmic.
-   //!
-   //! <b>Throws</b>: Nothing.
-   static node_ptr get_root(node_ptr n) BOOST_NOEXCEPT
-   {
-      BOOST_INTRUSIVE_INVARIANT_ASSERT((!inited(n)));
-      node_ptr x = NodeTraits::get_parent(n);
-      if(x){
-         while(!base_type::is_header(x)){
-            x = NodeTraits::get_parent(x);
-         }
-         return x;
-      }
-      else{
-         return n;
-      }
-   }
-
-   template <class Cloner, class Disposer>
-   static node_ptr clone_subtree
-      (const_node_ptr source_parent, node_ptr target_parent
-      , Cloner cloner, Disposer disposer
-      , node_ptr &leftmost_out, node_ptr &rightmost_out
-      )
-   {
-      node_ptr target_sub_root = target_parent;
-      node_ptr source_root = NodeTraits::get_parent(source_parent);
-      if(!source_root){
-         leftmost_out = rightmost_out = source_root;
-      }
-      else{
-         //We'll calculate leftmost and rightmost nodes while iterating
-         node_ptr current = source_root;
-         node_ptr insertion_point = target_sub_root = cloner(current);
-
-         //We'll calculate leftmost and rightmost nodes while iterating
-         node_ptr leftmost  = target_sub_root;
-         node_ptr rightmost = target_sub_root;
-
-         //First set the subroot
-         NodeTraits::set_left(target_sub_root, node_ptr());
-         NodeTraits::set_right(target_sub_root, node_ptr());
-         NodeTraits::set_parent(target_sub_root, target_parent);
-
-         dispose_subtree_disposer<Disposer> rollback(disposer, target_sub_root);
-         while(true) {
-            //First clone left nodes
-            if( NodeTraits::get_left(current) &&
-               !NodeTraits::get_left(insertion_point)) {
-               current = NodeTraits::get_left(current);
-               node_ptr temp = insertion_point;
-               //Clone and mark as leaf
-               insertion_point = cloner(current);
-               NodeTraits::set_left  (insertion_point, node_ptr());
-               NodeTraits::set_right (insertion_point, node_ptr());
-               //Insert left
-               NodeTraits::set_parent(insertion_point, temp);
-               NodeTraits::set_left  (temp, insertion_point);
-               //Update leftmost
-               if(rightmost == target_sub_root)
-                  leftmost = insertion_point;
-            }
-            //Then clone right nodes
-            else if( NodeTraits::get_right(current) &&
-                     !NodeTraits::get_right(insertion_point)){
-               current = NodeTraits::get_right(current);
-               node_ptr temp = insertion_point;
-               //Clone and mark as leaf
-               insertion_point = cloner(current);
-               NodeTraits::set_left  (insertion_point, node_ptr());
-               NodeTraits::set_right (insertion_point, node_ptr());
-               //Insert right
-               NodeTraits::set_parent(insertion_point, temp);
-               NodeTraits::set_right (temp, insertion_point);
-               //Update rightmost
-               rightmost = insertion_point;
-            }
-            //If not, go up
-            else if(current == source_root){
-               break;
-            }
-            else{
-               //Branch completed, go up searching more nodes to clone
-               current = NodeTraits::get_parent(current);
-               insertion_point = NodeTraits::get_parent(insertion_point);
-            }
-         }
-         rollback.release();
-         leftmost_out   = leftmost;
-         rightmost_out  = rightmost;
-      }
-      return target_sub_root;
-   }
-
-   template<class Disposer>
-   static void dispose_subtree(node_ptr x, Disposer disposer) BOOST_NOEXCEPT
-   {
-      while (x){
-         node_ptr save(NodeTraits::get_left(x));
-         if (save) {
-            // Right rotation
-            NodeTraits::set_left(x, NodeTraits::get_right(save));
-            NodeTraits::set_right(save, x);
-         }
-         else {
-            save = NodeTraits::get_right(x);
-            init(x);
-            disposer(x);
-         }
-         x = save;
-      }
-   }
-
-   template<class KeyType, class KeyNodePtrCompare>
-   static node_ptr lower_bound_loop
-      (node_ptr x, node_ptr y, const KeyType &key, KeyNodePtrCompare comp)
-   {
-      while(x){
-         if(comp(x, key)){
-            x = NodeTraits::get_right(x);
-         }
-         else{
-            y = x;
-            x = NodeTraits::get_left(x);
-         }
-      }
-      return y;
-   }
-
-   template<class KeyType, class KeyNodePtrCompare>
-   static node_ptr upper_bound_loop
-      (node_ptr x, node_ptr y, const KeyType &key, KeyNodePtrCompare comp)
-   {
-      while(x){
-         if(comp(key, x)){
-            y = x;
-            x = NodeTraits::get_left(x);
-         }
-         else{
-            x = NodeTraits::get_right(x);
-         }
-      }
-      return y;
-   }
-
-   template<class Checker>
-   static void check_subtree(const_node_ptr n, Checker checker, typename Checker::return_type& check_return)
-   {
-      const_node_ptr left = NodeTraits::get_left(n);
-      const_node_ptr right = NodeTraits::get_right(n);
-      typename Checker::return_type check_return_left;
-      typename Checker::return_type check_return_right;
-      if (left)
-      {
-         BOOST_INTRUSIVE_INVARIANT_ASSERT(NodeTraits::get_parent(left) == n);
-         check_subtree(left, checker, check_return_left);
-      }
-      if (right)
-      {
-         BOOST_INTRUSIVE_INVARIANT_ASSERT(NodeTraits::get_parent(right) == n);
-         check_subtree(right, checker, check_return_right);
-      }
-      checker(n, check_return_left, check_return_right, check_return);
-   }
-};
-
-/// @cond
-
-template<class NodeTraits>
-struct get_algo<BsTreeAlgorithms, NodeTraits>
-{
-   typedef bstree_algorithms<NodeTraits> type;
-};
-
-template <class ValueTraits, class NodePtrCompare, class ExtraChecker>
-struct get_node_checker<BsTreeAlgorithms, ValueTraits, NodePtrCompare, ExtraChecker>
-{
-   typedef detail::bstree_node_checker<ValueTraits, NodePtrCompare, ExtraChecker> type;
-};
-
-/// @endcond
-
-}  //namespace intrusive
-}  //namespace boost
-
-#include <boost/intrusive/detail/config_end.hpp>
-
-#endif //BOOST_INTRUSIVE_BSTREE_ALGORITHMS_HPP
diff --git a/src/boost/intrusive/circular_slist_algorithms.hpp b/src/boost/intrusive/circular_slist_algorithms.hpp
deleted file mode 100644
index 5ce4e8cd..00000000
--- a/src/boost/intrusive/circular_slist_algorithms.hpp
+++ /dev/null
@@ -1,475 +0,0 @@
-/////////////////////////////////////////////////////////////////////////////
-//
-// (C) Copyright Olaf Krzikalla 2004-2006.
-// (C) Copyright Ion Gaztanaga  2006-2014
-//
-// Distributed under the Boost 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/intrusive for documentation.
-//
-/////////////////////////////////////////////////////////////////////////////
-
-#ifndef BOOST_INTRUSIVE_CIRCULAR_SLIST_ALGORITHMS_HPP
-#define BOOST_INTRUSIVE_CIRCULAR_SLIST_ALGORITHMS_HPP
-
-#include <cstddef>
-#include <boost/intrusive/detail/config_begin.hpp>
-#include <boost/intrusive/intrusive_fwd.hpp>
-#include <boost/intrusive/detail/common_slist_algorithms.hpp>
-#include <boost/intrusive/detail/uncast.hpp>
-#include <boost/intrusive/detail/algo_type.hpp>
-
-#if defined(BOOST_HAS_PRAGMA_ONCE)
-#  pragma once
-#endif
-
-namespace boost {
-namespace intrusive {
-
-//! circular_slist_algorithms provides basic algorithms to manipulate nodes
-//! forming a circular singly linked list. An empty circular list is formed by a node
-//! whose pointer to the next node points to itself.
-//!
-//! circular_slist_algorithms is configured with a NodeTraits class, which encapsulates the
-//! information about the node to be manipulated. NodeTraits must support the
-//! following interface:
-//!
-//! <b>Typedefs</b>:
-//!
-//! <tt>node</tt>: The type of the node that forms the circular list
-//!
-//! <tt>node_ptr</tt>: A pointer to a node
-//!
-//! <tt>const_node_ptr</tt>: A pointer to a const node
-//!
-//! <b>Static functions</b>:
-//!
-//! <tt>static node_ptr get_next(const_node_ptr n);</tt>
-//!
-//! <tt>static void set_next(node_ptr n, node_ptr next);</tt>
-template<class NodeTraits>
-class circular_slist_algorithms
-   /// @cond
-   : public detail::common_slist_algorithms<NodeTraits>
-   /// @endcond
-{
-   /// @cond
-   typedef detail::common_slist_algorithms<NodeTraits> base_t;
-   /// @endcond
-   public:
-   typedef typename NodeTraits::node            node;
-   typedef typename NodeTraits::node_ptr        node_ptr;
-   typedef typename NodeTraits::const_node_ptr  const_node_ptr;
-   typedef NodeTraits                           node_traits;
-
-   #if defined(BOOST_INTRUSIVE_DOXYGEN_INVOKED)
-
-   //! <b>Effects</b>: Constructs an non-used list element, putting the next
-   //!   pointer to null:
-   //!  <tt>NodeTraits::get_next(this_node) == node_ptr()</tt>
-   //!
-   //! <b>Complexity</b>: Constant
-   //!
-   //! <b>Throws</b>: Nothing.
-   static void init(node_ptr this_node) BOOST_NOEXCEPT;
-
-   //! <b>Requires</b>: this_node must be in a circular list or be an empty circular list.
-   //!
-   //! <b>Effects</b>: Returns true is "this_node" is the only node of a circular list:
-   //!  or it's a not inserted node:
-   //!  <tt>return node_ptr() == NodeTraits::get_next(this_node) || NodeTraits::get_next(this_node) == this_node</tt>
-   //!
-   //! <b>Complexity</b>: Constant
-   //!
-   //! <b>Throws</b>: Nothing.
-   static bool unique(const_node_ptr this_node) BOOST_NOEXCEPT;
-
-   //! <b>Effects</b>: Returns true is "this_node" has the same state as
-   //!  if it was inited using "init(node_ptr)"
-   //!
-   //! <b>Complexity</b>: Constant
-   //!
-   //! <b>Throws</b>: Nothing.
-   static bool inited(const_node_ptr this_node) BOOST_NOEXCEPT;
-
-   //! <b>Requires</b>: prev_node must be in a circular list or be an empty circular list.
-   //!
-   //! <b>Effects</b>: Unlinks the next node of prev_node from the circular list.
-   //!
-   //! <b>Complexity</b>: Constant
-   //!
-   //! <b>Throws</b>: Nothing.
-   static void unlink_after(node_ptr prev_node) BOOST_NOEXCEPT;
-
-   //! <b>Requires</b>: prev_node and last_node must be in a circular list
-   //!  or be an empty circular list.
-   //!
-   //! <b>Effects</b>: Unlinks the range (prev_node, last_node) from the circular list.
-   //!
-   //! <b>Complexity</b>: Constant
-   //!
-   //! <b>Throws</b>: Nothing.
-   static void unlink_after(node_ptr prev_node, node_ptr last_node) BOOST_NOEXCEPT;
-
-   //! <b>Requires</b>: prev_node must be a node of a circular list.
-   //!
-   //! <b>Effects</b>: Links this_node after prev_node in the circular list.
-   //!
-   //! <b>Complexity</b>: Constant
-   //!
-   //! <b>Throws</b>: Nothing.
-   static void link_after(node_ptr prev_node, node_ptr this_node) BOOST_NOEXCEPT;
-
-   //! <b>Requires</b>: b and e must be nodes of the same circular list or an empty range.
-   //!   and p must be a node of a different circular list.
-   //!
-   //! <b>Effects</b>: Removes the nodes from (b, e] range from their circular list and inserts
-   //!   them after p in p's circular list.
-   //!
-   //! <b>Complexity</b>: Constant
-   //!
-   //! <b>Throws</b>: Nothing.
-   static void transfer_after(node_ptr p, node_ptr b, node_ptr e) BOOST_NOEXCEPT;
-   
-   #else
-
-   using base_t::transfer_after;
-
-   #endif   //#if defined(BOOST_INTRUSIVE_DOXYGEN_INVOKED)
-
-   //! <b>Effects</b>: Constructs an empty list, making this_node the only
-   //!   node of the circular list:
-   //!  <tt>NodeTraits::get_next(this_node) == this_node</tt>.
-   //!
-   //! <b>Complexity</b>: Constant
-   //!
-   //! <b>Throws</b>: Nothing.
-   BOOST_INTRUSIVE_FORCEINLINE static void init_header(node_ptr this_node) BOOST_NOEXCEPT
-   {  NodeTraits::set_next(this_node, this_node);  }
-
-   //! <b>Requires</b>: 'p' is the first node of a list.
-   //!
-   //! <b>Effects</b>: Returns a pointer to a node that represents the "end" (one past end) node
-   //!
-   //! <b>Complexity</b>: Constant time.
-   //!
-   //! <b>Throws</b>: Nothing.
-   BOOST_INTRUSIVE_FORCEINLINE static node_ptr end_node(const_node_ptr p) BOOST_NOEXCEPT
-   {  return detail::uncast(p);   }
-
-   //! <b>Effects</b>: Returns true if this_node_points to an empty list.
-   //! 
-   //! <b>Complexity</b>: Constant
-   //!
-   //! <b>Throws</b>: Nothing.
-   BOOST_INTRUSIVE_FORCEINLINE static bool is_empty(const_node_ptr this_node) BOOST_NOEXCEPT
-   {  return NodeTraits::get_next(this_node) == this_node;  }
-
-   //! <b>Effects</b>: Returns true if this_node points to a sentinel node.
-   //! 
-   //! <b>Complexity</b>: Constant
-   //!
-   //! <b>Throws</b>: Nothing.
-   BOOST_INTRUSIVE_FORCEINLINE static bool is_sentinel(const_node_ptr this_node) BOOST_NOEXCEPT
-   {  return NodeTraits::get_next(this_node) == node_ptr();  }
-
-   //! <b>Effects</b>: Marks this node as a "sentinel" node, a special state that is different from "empty",
-   //!                 that can be used to mark a special state of the list
-   //!
-   //! <b>Complexity</b>: Constant
-   //!
-   //! <b>Throws</b>: Nothing.
-   BOOST_INTRUSIVE_FORCEINLINE static void set_sentinel(node_ptr this_node) BOOST_NOEXCEPT
-   {  NodeTraits::set_next(this_node, node_ptr());   }
-
-   //! <b>Requires</b>: this_node and prev_init_node must be in the same circular list.
-   //!
-   //! <b>Effects</b>: Returns the previous node of this_node in the circular list starting.
-   //!   the search from prev_init_node. The first node checked for equality
-   //!   is NodeTraits::get_next(prev_init_node).
-   //!
-   //! <b>Complexity</b>: Linear to the number of elements between prev_init_node and this_node.
-   //!
-   //! <b>Throws</b>: Nothing.
-   BOOST_INTRUSIVE_FORCEINLINE static node_ptr get_previous_node(node_ptr prev_init_node, node_ptr this_node) BOOST_NOEXCEPT
-   {  return base_t::get_previous_node(prev_init_node, this_node);   }
-
-   //! <b>Requires</b>: this_node must be in a circular list or be an empty circular list.
-   //!
-   //! <b>Effects</b>: Returns the previous node of this_node in the circular list.
-   //!
-   //! <b>Complexity</b>: Linear to the number of elements in the circular list.
-   //!
-   //! <b>Throws</b>: Nothing.
-   BOOST_INTRUSIVE_FORCEINLINE static node_ptr get_previous_node(node_ptr this_node) BOOST_NOEXCEPT
-   {  return base_t::get_previous_node(this_node, this_node); }
-
-   //! <b>Requires</b>: this_node must be in a circular list or be an empty circular list.
-   //!
-   //! <b>Effects</b>: Returns the previous node of the previous node of this_node in the circular list.
-   //!
-   //! <b>Complexity</b>: Linear to the number of elements in the circular list.
-   //!
-   //! <b>Throws</b>: Nothing.
-   BOOST_INTRUSIVE_FORCEINLINE static node_ptr get_previous_previous_node(node_ptr this_node) BOOST_NOEXCEPT
-   {  return get_previous_previous_node(this_node, this_node); }
-
-   //! <b>Requires</b>: this_node and p must be in the same circular list.
-   //!
-   //! <b>Effects</b>: Returns the previous node of the previous node of this_node in the
-   //!   circular list starting. the search from p. The first node checked
-   //!   for equality is NodeTraits::get_next((NodeTraits::get_next(p)).
-   //!
-   //! <b>Complexity</b>: Linear to the number of elements in the circular list.
-   //!
-   //! <b>Throws</b>: Nothing.
-   static node_ptr get_previous_previous_node(node_ptr p, node_ptr this_node) BOOST_NOEXCEPT
-   {
-      node_ptr p_next = NodeTraits::get_next(p);
-      node_ptr p_next_next = NodeTraits::get_next(p_next);
-      while (this_node != p_next_next){
-         p = p_next;
-         p_next = p_next_next;
-         p_next_next = NodeTraits::get_next(p_next);
-      }
-      return p;
-   }
-
-   //! <b>Requires</b>: this_node must be in a circular list or be an empty circular list.
-   //!
-   //! <b>Effects</b>: Returns the number of nodes in a circular list. If the circular list
-   //!  is empty, returns 1.
-   //!
-   //! <b>Complexity</b>: Linear
-   //!
-   //! <b>Throws</b>: Nothing.
-   static std::size_t count(const_node_ptr this_node) BOOST_NOEXCEPT
-   {
-      std::size_t result = 0;
-      const_node_ptr p = this_node;
-      do{
-         p = NodeTraits::get_next(p);
-         ++result;
-      } while (p != this_node);
-      return result;
-   }
-
-   //! <b>Requires</b>: this_node must be in a circular list, be an empty circular list or be inited.
-   //!
-   //! <b>Effects</b>: Unlinks the node from the circular list.
-   //!
-   //! <b>Complexity</b>: Linear to the number of elements in the circular list
-   //!
-   //! <b>Throws</b>: Nothing.
-   static void unlink(node_ptr this_node) BOOST_NOEXCEPT
-   {
-      if(NodeTraits::get_next(this_node))
-         base_t::unlink_after(get_previous_node(this_node));
-   }
-
-   //! <b>Requires</b>: nxt_node must be a node of a circular list.
-   //!
-   //! <b>Effects</b>: Links this_node before nxt_node in the circular list.
-   //!
-   //! <b>Complexity</b>: Linear to the number of elements in the circular list.
-   //!
-   //! <b>Throws</b>: Nothing.
-   BOOST_INTRUSIVE_FORCEINLINE static void link_before (node_ptr nxt_node, node_ptr this_node) BOOST_NOEXCEPT
-   {  base_t::link_after(get_previous_node(nxt_node), this_node);   }
-
-   //! <b>Requires</b>: this_node and other_node must be nodes inserted
-   //!  in circular lists or be empty circular lists.
-   //!
-   //! <b>Effects</b>: Swaps the position of the nodes: this_node is inserted in
-   //!   other_nodes position in the second circular list and the other_node is inserted
-   //!   in this_node's position in the first circular list.
-   //!
-   //! <b>Complexity</b>: Linear to number of elements of both lists
-   //!
-   //! <b>Throws</b>: Nothing.
-   static void swap_nodes(node_ptr this_node, node_ptr other_node) BOOST_NOEXCEPT
-   {
-      if (other_node == this_node)
-         return;
-      const node_ptr this_next = NodeTraits::get_next(this_node);
-      const node_ptr other_next = NodeTraits::get_next(other_node);
-      const bool this_null   = !this_next;
-      const bool other_null  = !other_next;
-      const bool this_empty  = this_next == this_node;
-      const bool other_empty = other_next == other_node;
-
-      if(!(other_null || other_empty)){
-         NodeTraits::set_next(this_next == other_node ? other_node : get_previous_node(other_node), this_node );
-      }
-      if(!(this_null | this_empty)){
-         NodeTraits::set_next(other_next == this_node ? this_node  : get_previous_node(this_node), other_node );
-      }
-      NodeTraits::set_next(this_node,  other_empty ? this_node  : (other_next == this_node ? other_node : other_next) );
-      NodeTraits::set_next(other_node, this_empty  ? other_node : (this_next == other_node ? this_node :  this_next ) );
-   }
-
-   //! <b>Effects</b>: Reverses the order of elements in the list.
-   //!
-   //! <b>Throws</b>: Nothing.
-   //!
-   //! <b>Complexity</b>: This function is linear to the contained elements.
-   static void reverse(node_ptr p) BOOST_NOEXCEPT
-   {
-      node_ptr i = NodeTraits::get_next(p), e(p);
-      for (;;) {
-         node_ptr nxt(NodeTraits::get_next(i));
-         if (nxt == e)
-            break;
-         base_t::transfer_after(e, i, nxt);
-      }
-   }
-
-   //! <b>Effects</b>: Moves the node p n positions towards the end of the list.
-   //!
-   //! <b>Returns</b>: The previous node of p after the function if there has been any movement,
-   //!   Null if n leads to no movement.
-   //!
-   //! <b>Throws</b>: Nothing.
-   //!
-   //! <b>Complexity</b>: Linear to the number of elements plus the number moved positions.
-   static node_ptr move_backwards(node_ptr p, std::size_t n) BOOST_NOEXCEPT
-   {
-      //Null shift, nothing to do
-      if(!n) return node_ptr();
-      node_ptr first  = NodeTraits::get_next(p);
-
-      //count() == 1 or 2, nothing to do
-      if(NodeTraits::get_next(first) == p)
-         return node_ptr();
-
-      bool end_found = false;
-      node_ptr new_last = node_ptr();
-
-      //Now find the new last node according to the shift count.
-      //If we find p before finding the new last node
-      //unlink p, shortcut the search now that we know the size of the list
-      //and continue.
-      for(std::size_t i = 1; i <= n; ++i){
-         new_last = first;
-         first = NodeTraits::get_next(first);
-         if(first == p){
-            //Shortcut the shift with the modulo of the size of the list
-            n %= i;
-            if(!n)
-               return node_ptr();
-            i = 0;
-            //Unlink p and continue the new first node search
-            first = NodeTraits::get_next(p);
-            base_t::unlink_after(new_last);
-            end_found = true;
-         }
-      }
-
-      //If the p has not been found in the previous loop, find it
-      //starting in the new first node and unlink it
-      if(!end_found){
-         base_t::unlink_after(base_t::get_previous_node(first, p));
-      }
-
-      //Now link p after the new last node
-      base_t::link_after(new_last, p);
-      return new_last;
-   }
-
-   //! <b>Effects</b>: Moves the node p n positions towards the beginning of the list.
-   //!
-   //! <b>Returns</b>: The previous node of p after the function if there has been any movement,
-   //!   Null if n leads equals to no movement.
-   //!
-   //! <b>Throws</b>: Nothing.
-   //!
-   //! <b>Complexity</b>: Linear to the number of elements plus the number moved positions.
-   static node_ptr move_forward(node_ptr p, std::size_t n) BOOST_NOEXCEPT
-   {
-      //Null shift, nothing to do
-      if(!n) return node_ptr();
-      node_ptr first  = node_traits::get_next(p);
-
-      //count() == 1 or 2, nothing to do
-      if(node_traits::get_next(first) == p) return node_ptr();
-
-      //Iterate until p is found to know where the current last node is.
-      //If the shift count is less than the size of the list, we can also obtain
-      //the position of the new last node after the shift.
-      node_ptr old_last(first), next_to_it, new_last(p);
-      std::size_t distance = 1;
-      while(p != (next_to_it = node_traits::get_next(old_last))){
-         if(++distance > n)
-            new_last = node_traits::get_next(new_last);
-         old_last = next_to_it;
-      }
-      //If the shift was bigger or equal than the size, obtain the equivalent
-      //forward shifts and find the new last node.
-      if(distance <= n){
-         //Now find the equivalent forward shifts.
-         //Shortcut the shift with the modulo of the size of the list
-         std::size_t new_before_last_pos = (distance - (n % distance))% distance;
-         //If the shift is a multiple of the size there is nothing to do
-         if(!new_before_last_pos)   return node_ptr();
-
-         for( new_last = p
-            ; new_before_last_pos--
-            ; new_last = node_traits::get_next(new_last)){
-            //empty
-         }
-      }
-
-      //Now unlink p and link it after the new last node
-      base_t::unlink_after(old_last);
-      base_t::link_after(new_last, p);
-      return new_last;
-   }
-
-   //! <b>Requires</b>: other must be a list and p must be a node of a different list.
-   //!
-   //! <b>Effects</b>: Transfers all nodes from other after p in p's list.
-   //!
-   //! <b>Complexity</b>: Linear
-   //!
-   //! <b>Throws</b>: Nothing.
-   static void transfer_after(node_ptr p, node_ptr other) BOOST_NOEXCEPT
-   {
-      node_ptr other_last((get_previous_node)(other));
-      base_t::transfer_after(p, other, other_last);
-   }
-
-   //! <b>Requires</b>: "disposer" must be an object function
-   //!   taking a node_ptr parameter and shouldn't throw.
-   //!
-   //! <b>Effects</b>: Unlinks all nodes reachable from p (but not p) and calls
-   //!   <tt>void disposer::operator()(node_ptr)</tt> for every node of the list
-   //!    where p is linked.
-   //!
-   //! <b>Returns</b>: The number of disposed nodes
-   //!
-   //! <b>Complexity</b>: Linear to the number of element of the list.
-   //!
-   //! <b>Throws</b>: Nothing.
-   template<class Disposer>
-   BOOST_INTRUSIVE_FORCEINLINE static std::size_t detach_and_dispose(node_ptr p, Disposer disposer) BOOST_NOEXCEPT
-   {  return base_t::unlink_after_and_dispose(p, p, disposer);   }
-};
-
-/// @cond
-
-template<class NodeTraits>
-struct get_algo<CircularSListAlgorithms, NodeTraits>
-{
-   typedef circular_slist_algorithms<NodeTraits> type;
-};
-
-/// @endcond
-
-} //namespace intrusive
-} //namespace boost
-
-#include <boost/intrusive/detail/config_end.hpp>
-
-#endif //BOOST_INTRUSIVE_CIRCULAR_SLIST_ALGORITHMS_HPP
diff --git a/src/boost/intrusive/detail/algo_type.hpp b/src/boost/intrusive/detail/algo_type.hpp
deleted file mode 100644
index 70ec63f5..00000000
--- a/src/boost/intrusive/detail/algo_type.hpp
+++ /dev/null
@@ -1,53 +0,0 @@
-/////////////////////////////////////////////////////////////////////////////
-//
-// (C) Copyright Ion Gaztanaga  2014-2014
-//
-// Distributed under the Boost 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/intrusive for documentation.
-//
-/////////////////////////////////////////////////////////////////////////////
-
-#ifndef BOOST_INTRUSIVE_DETAIL_ALGO_TYPE_HPP
-#define BOOST_INTRUSIVE_DETAIL_ALGO_TYPE_HPP
-
-#ifndef BOOST_CONFIG_HPP
-#  include <boost/config.hpp>
-#endif
-
-#if defined(BOOST_HAS_PRAGMA_ONCE)
-#  pragma once
-#endif
-
-namespace boost {
-namespace intrusive {
-
-enum algo_types
-{
-   CircularListAlgorithms,
-   CircularSListAlgorithms,
-   LinearSListAlgorithms,
-   CommonSListAlgorithms,
-   BsTreeAlgorithms,
-   RbTreeAlgorithms,
-   AvlTreeAlgorithms,
-   SgTreeAlgorithms,
-   SplayTreeAlgorithms,
-   TreapAlgorithms,
-   UnorderedAlgorithms,
-   UnorderedCircularSlistAlgorithms,
-   AnyAlgorithm
-};
-
-template<algo_types AlgoType, class NodeTraits>
-struct get_algo;
-
-template<algo_types AlgoType, class ValueTraits, class NodePtrCompare, class ExtraChecker>
-struct get_node_checker;
-
-} //namespace intrusive
-} //namespace boost
-
-#endif //BOOST_INTRUSIVE_DETAIL_ALGO_TYPE_HPP
diff --git a/src/boost/intrusive/detail/algorithm.hpp b/src/boost/intrusive/detail/algorithm.hpp
deleted file mode 100644
index d2421ffa..00000000
--- a/src/boost/intrusive/detail/algorithm.hpp
+++ /dev/null
@@ -1,90 +0,0 @@
-//////////////////////////////////////////////////////////////////////////////
-//
-// (C) Copyright Ion Gaztanaga 2014-2014.
-//
-// Distributed under the Boost 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/intrusive for documentation.
-//
-//////////////////////////////////////////////////////////////////////////////
-
-#ifndef BOOST_INTRUSIVE_DETAIL_ALGORITHM_HPP
-#define BOOST_INTRUSIVE_DETAIL_ALGORITHM_HPP
-
-#ifndef BOOST_CONFIG_HPP
-#  include <boost/config.hpp>
-#endif
-
-#if defined(BOOST_HAS_PRAGMA_ONCE)
-#  pragma once
-#endif
-
-namespace boost {
-namespace intrusive {
-
-struct algo_pred_equal
-{
-   template<class T>
-   bool operator()(const T &x, const T &y) const
-   {  return x == y;  }
-};
-
-struct algo_pred_less
-{
-   template<class T>
-   bool operator()(const T &x, const T &y) const
-   {  return x < y;  }
-};
-
-template<class InputIt1, class InputIt2, class BinaryPredicate>
-bool algo_equal(InputIt1 first1, InputIt1 last1, InputIt2 first2, BinaryPredicate p)
-{
-    for (; first1 != last1; ++first1, ++first2) {
-        if (!p(*first1, *first2)) {
-            return false;
-        }
-    }
-    return true;
-}
-
-template<class InputIt1, class InputIt2>
-bool algo_equal(InputIt1 first1, InputIt1 last1, InputIt2 first2)
-{  return (algo_equal)(first1, last1, first2, algo_pred_equal());  }
-
-template<class InputIt1, class InputIt2, class BinaryPredicate>
-bool algo_equal(InputIt1 first1, InputIt1 last1, InputIt2 first2, InputIt2 last2, BinaryPredicate pred)
-{
-    for (; first1 != last1 && first2 != last2; ++first1, ++first2)
-        if (!pred(*first1, *first2))
-            return false;
-    return first1 == last1 && first2 == last2;
-}
-
-template<class InputIt1, class InputIt2>
-bool algo_equal(InputIt1 first1, InputIt1 last1, InputIt2 first2, InputIt2 last2)
-{  return (algo_equal)(first1, last1, first2, last2, algo_pred_equal());  }
-
-template <class InputIterator1, class InputIterator2, class BinaryPredicate>
-  bool algo_lexicographical_compare (InputIterator1 first1, InputIterator1 last1,
-                                     InputIterator2 first2, InputIterator2 last2,
-                                     BinaryPredicate pred)
-{
-   while (first1 != last1){
-      if (first2 == last2 || *first2 < *first1) return false;
-      else if (pred(*first1, *first2)) return true;
-      ++first1; ++first2;
-   }
-   return (first2 != last2);
-}
-
-template <class InputIterator1, class InputIterator2>
-  bool algo_lexicographical_compare (InputIterator1 first1, InputIterator1 last1,
-                                     InputIterator2 first2, InputIterator2 last2)
-{  return (algo_lexicographical_compare)(first1, last1, first2, last2, algo_pred_less());  }
-
-}  //namespace intrusive {
-}  //namespace boost {
-
-#endif   //#ifndef BOOST_INTRUSIVE_DETAIL_ALGORITHM_HPP
diff --git a/src/boost/intrusive/detail/array_initializer.hpp b/src/boost/intrusive/detail/array_initializer.hpp
deleted file mode 100644
index 554edadf..00000000
--- a/src/boost/intrusive/detail/array_initializer.hpp
+++ /dev/null
@@ -1,97 +0,0 @@
-/////////////////////////////////////////////////////////////////////////////
-//
-// (C) Copyright Ion Gaztanaga  2014-2014
-//
-// Distributed under the Boost 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/intrusive for documentation.
-//
-/////////////////////////////////////////////////////////////////////////////
-
-#ifndef BOOST_INTRUSIVE_DETAIL_ARRAY_INITIALIZER_HPP
-#define BOOST_INTRUSIVE_DETAIL_ARRAY_INITIALIZER_HPP
-
-#ifndef BOOST_CONFIG_HPP
-#  include <boost/config.hpp>
-#endif
-
-#if defined(BOOST_HAS_PRAGMA_ONCE)
-#  pragma once
-#endif
-
-#include <boost/config.hpp>
-#include <boost/intrusive/detail/workaround.hpp>
-#include <boost/move/detail/placement_new.hpp>
-#include <boost/move/detail/force_ptr.hpp>
-
-namespace boost {
-namespace intrusive {
-namespace detail {
-
-//This is not standard, but should work with all compilers
-union max_align
-{
-   char        char_;
-   short       short_;
-   int         int_;
-   long        long_;
-   #ifdef BOOST_HAS_LONG_LONG
-   ::boost::long_long_type  long_long_;
-   #endif
-   float       float_;
-   double      double_;
-   long double long_double_;
-   void *      void_ptr_;
-};
-
-template<class T, std::size_t N>
-class array_initializer
-{
-   public:
-   template<class CommonInitializer>
-   array_initializer(const CommonInitializer &init)
-   {
-      char *init_buf = (char*)rawbuf;
-      std::size_t i = 0;
-      BOOST_INTRUSIVE_TRY{
-         for(; i != N; ++i){
-            ::new(init_buf, boost_move_new_t()) T(init);
-            init_buf += sizeof(T);
-         }
-      }
-      BOOST_INTRUSIVE_CATCH(...){
-         while(i--){
-            init_buf -= sizeof(T);
-            move_detail::force_ptr<T*>(init_buf)->~T();
-         }
-         BOOST_INTRUSIVE_RETHROW;
-      }
-      BOOST_INTRUSIVE_CATCH_END
-   }
-
-   operator T* ()
-   {  return (T*)(rawbuf);  }
-
-   operator const T*() const
-   {  return (const T*)(rawbuf);  }
-
-   ~array_initializer()
-   {
-      char *init_buf = (char*)rawbuf + N*sizeof(T);
-      for(std::size_t i = 0; i != N; ++i){
-         init_buf -= sizeof(T);
-         move_detail::force_ptr<T*>(init_buf)->~T();
-      }
-   }
-
-   private:
-   detail::max_align rawbuf[(N*sizeof(T)-1)/sizeof(detail::max_align)+1];
-};
-
-}  //namespace detail{
-}  //namespace intrusive{
-}  //namespace boost{
-
-#endif //BOOST_INTRUSIVE_DETAIL_ARRAY_INITIALIZER_HPP
diff --git a/src/boost/intrusive/detail/assert.hpp b/src/boost/intrusive/detail/assert.hpp
deleted file mode 100644
index 7199eb24..00000000
--- a/src/boost/intrusive/detail/assert.hpp
+++ /dev/null
@@ -1,45 +0,0 @@
-/////////////////////////////////////////////////////////////////////////////
-//
-// (C) Copyright Ion Gaztanaga  2006-2013
-//
-// Distributed under the Boost 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/intrusive for documentation.
-//
-/////////////////////////////////////////////////////////////////////////////
-
-#ifndef BOOST_INTRUSIVE_DETAIL_ASSERT_HPP
-#define BOOST_INTRUSIVE_DETAIL_ASSERT_HPP
-
-#ifndef BOOST_CONFIG_HPP
-#  include <boost/config.hpp>
-#endif
-
-#if defined(BOOST_HAS_PRAGMA_ONCE)
-#pragma once
-#endif
-
-#if !defined(BOOST_INTRUSIVE_INVARIANT_ASSERT)
-   #include <boost/assert.hpp>
-   #define BOOST_INTRUSIVE_INVARIANT_ASSERT BOOST_ASSERT
-#elif defined(BOOST_INTRUSIVE_INVARIANT_ASSERT_INCLUDE)
-   #include BOOST_INTRUSIVE_INVARIANT_ASSERT_INCLUDE
-#endif
-
-#if !defined(BOOST_INTRUSIVE_SAFE_HOOK_DEFAULT_ASSERT)
-   #include <boost/assert.hpp>
-   #define BOOST_INTRUSIVE_SAFE_HOOK_DEFAULT_ASSERT BOOST_ASSERT
-#elif defined(BOOST_INTRUSIVE_SAFE_HOOK_DEFAULT_ASSERT_INCLUDE)
-   #include BOOST_INTRUSIVE_SAFE_HOOK_DEFAULT_ASSERT_INCLUDE
-#endif
-
-#if !defined(BOOST_INTRUSIVE_SAFE_HOOK_DESTRUCTOR_ASSERT)
-   #include <boost/assert.hpp>
-   #define BOOST_INTRUSIVE_SAFE_HOOK_DESTRUCTOR_ASSERT BOOST_ASSERT
-#elif defined(BOOST_INTRUSIVE_SAFE_HOOK_DESTRUCTOR_ASSERT_INCLUDE)
-   #include BOOST_INTRUSIVE_SAFE_HOOK_DESTRUCTOR_ASSERT_INCLUDE
-#endif
-
-#endif //BOOST_INTRUSIVE_DETAIL_ASSERT_HPP
diff --git a/src/boost/intrusive/detail/avltree_node.hpp b/src/boost/intrusive/detail/avltree_node.hpp
deleted file mode 100644
index b9c52dca..00000000
--- a/src/boost/intrusive/detail/avltree_node.hpp
+++ /dev/null
@@ -1,193 +0,0 @@
-/////////////////////////////////////////////////////////////////////////////
-//
-// (C) Copyright Ion Gaztanaga 2007-2013
-//
-// Distributed under the Boost 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/intrusive for documentation.
-//
-/////////////////////////////////////////////////////////////////////////////
-
-#ifndef BOOST_INTRUSIVE_AVLTREE_NODE_HPP
-#define BOOST_INTRUSIVE_AVLTREE_NODE_HPP
-
-#ifndef BOOST_CONFIG_HPP
-#  include <boost/config.hpp>
-#endif
-
-#if defined(BOOST_HAS_PRAGMA_ONCE)
-#  pragma once
-#endif
-
-#include <boost/intrusive/detail/config_begin.hpp>
-#include <boost/intrusive/detail/workaround.hpp>
-#include <boost/intrusive/pointer_rebind.hpp>
-#include <boost/intrusive/avltree_algorithms.hpp>
-#include <boost/intrusive/pointer_plus_bits.hpp>
-#include <boost/intrusive/detail/mpl.hpp>
-
-namespace boost {
-namespace intrusive {
-
-/////////////////////////////////////////////////////////////////////////////
-//                                                                         //
-//                Generic node_traits for any pointer type                 //
-//                                                                         //
-/////////////////////////////////////////////////////////////////////////////
-
-//This is the compact representation: 3 pointers
-template<class VoidPointer>
-struct compact_avltree_node
-{
-   typedef typename pointer_rebind<VoidPointer, compact_avltree_node<VoidPointer> >::type       node_ptr;
-   typedef typename pointer_rebind<VoidPointer, const compact_avltree_node<VoidPointer> >::type const_node_ptr;
-   enum balance { negative_t, zero_t, positive_t };
-   node_ptr parent_, left_, right_;
-};
-
-//This is the normal representation: 3 pointers + enum
-template<class VoidPointer>
-struct avltree_node
-{
-   typedef typename pointer_rebind<VoidPointer, avltree_node<VoidPointer> >::type         node_ptr;
-   typedef typename pointer_rebind<VoidPointer, const avltree_node<VoidPointer> >::type   const_node_ptr;
-   enum balance { negative_t, zero_t, positive_t };
-   node_ptr parent_, left_, right_;
-   balance balance_;
-};
-
-//This is the default node traits implementation
-//using a node with 3 generic pointers plus an enum
-template<class VoidPointer>
-struct default_avltree_node_traits_impl
-{
-   typedef avltree_node<VoidPointer>      node;
-   typedef typename node::node_ptr        node_ptr;
-   typedef typename node::const_node_ptr  const_node_ptr;
-
-   typedef typename node::balance balance;
-
-   BOOST_INTRUSIVE_FORCEINLINE static node_ptr get_parent(const_node_ptr n)
-   {  return n->parent_;  }
-
-   BOOST_INTRUSIVE_FORCEINLINE static node_ptr get_parent(node_ptr n)
-   {  return n->parent_;  }
-
-   BOOST_INTRUSIVE_FORCEINLINE static void set_parent(node_ptr n, node_ptr p)
-   {  n->parent_ = p;  }
-
-   BOOST_INTRUSIVE_FORCEINLINE static node_ptr get_left(const_node_ptr n)
-   {  return n->left_;  }
-
-   BOOST_INTRUSIVE_FORCEINLINE static node_ptr get_left(node_ptr n)
-   {  return n->left_;  }
-
-   BOOST_INTRUSIVE_FORCEINLINE static void set_left(node_ptr n, node_ptr l)
-   {  n->left_ = l;  }
-
-   BOOST_INTRUSIVE_FORCEINLINE static node_ptr get_right(const_node_ptr n)
-   {  return n->right_;  }
-
-   BOOST_INTRUSIVE_FORCEINLINE static node_ptr get_right(node_ptr n)
-   {  return n->right_;  }
-
-   BOOST_INTRUSIVE_FORCEINLINE static void set_right(node_ptr n, node_ptr r)
-   {  n->right_ = r;  }
-
-   BOOST_INTRUSIVE_FORCEINLINE static balance get_balance(const_node_ptr n)
-   {  return n->balance_;  }
-
-   BOOST_INTRUSIVE_FORCEINLINE static balance get_balance(node_ptr n)
-   {  return n->balance_;  }
-
-   BOOST_INTRUSIVE_FORCEINLINE static void set_balance(node_ptr n, balance b)
-   {  n->balance_ = b;  }
-
-   BOOST_INTRUSIVE_FORCEINLINE static balance negative()
-   {  return node::negative_t;  }
-
-   BOOST_INTRUSIVE_FORCEINLINE static balance zero()
-   {  return node::zero_t;  }
-
-   BOOST_INTRUSIVE_FORCEINLINE static balance positive()
-   {  return node::positive_t;  }
-};
-
-//This is the compact node traits implementation
-//using a node with 3 generic pointers
-template<class VoidPointer>
-struct compact_avltree_node_traits_impl
-{
-   typedef compact_avltree_node<VoidPointer> node;
-   typedef typename node::node_ptr           node_ptr;
-   typedef typename node::const_node_ptr     const_node_ptr;
-   typedef typename node::balance balance;
-
-   typedef pointer_plus_bits<node_ptr, 2> ptr_bit;
-
-   BOOST_INTRUSIVE_FORCEINLINE static node_ptr get_parent(const_node_ptr n)
-   {  return ptr_bit::get_pointer(n->parent_);  }
-
-   BOOST_INTRUSIVE_FORCEINLINE static void set_parent(node_ptr n, node_ptr p)
-   {  ptr_bit::set_pointer(n->parent_, p);  }
-
-   BOOST_INTRUSIVE_FORCEINLINE static node_ptr get_left(const_node_ptr n)
-   {  return n->left_;  }
-
-   BOOST_INTRUSIVE_FORCEINLINE static void set_left(node_ptr n, node_ptr l)
-   {  n->left_ = l;  }
-
-   BOOST_INTRUSIVE_FORCEINLINE static node_ptr get_right(const_node_ptr n)
-   {  return n->right_;  }
-
-   BOOST_INTRUSIVE_FORCEINLINE static void set_right(node_ptr n, node_ptr r)
-   {  n->right_ = r;  }
-
-   BOOST_INTRUSIVE_FORCEINLINE static balance get_balance(const_node_ptr n)
-   {  return (balance)ptr_bit::get_bits(n->parent_);  }
-
-   BOOST_INTRUSIVE_FORCEINLINE static void set_balance(node_ptr n, balance b)
-   {  ptr_bit::set_bits(n->parent_, (std::size_t)b);  }
-
-   BOOST_INTRUSIVE_FORCEINLINE static balance negative()
-   {  return node::negative_t;  }
-
-   BOOST_INTRUSIVE_FORCEINLINE static balance zero()
-   {  return node::zero_t;  }
-
-   BOOST_INTRUSIVE_FORCEINLINE static balance positive()
-   {  return node::positive_t;  }
-};
-
-//Dispatches the implementation based on the boolean
-template<class VoidPointer, bool Compact>
-struct avltree_node_traits_dispatch
-   :  public default_avltree_node_traits_impl<VoidPointer>
-{};
-
-template<class VoidPointer>
-struct avltree_node_traits_dispatch<VoidPointer, true>
-   :  public compact_avltree_node_traits_impl<VoidPointer>
-{};
-
-//Inherit from rbtree_node_traits_dispatch depending on the embedding capabilities
-template<class VoidPointer, bool OptimizeSize = false>
-struct avltree_node_traits
-   :  public avltree_node_traits_dispatch
-         < VoidPointer
-         , OptimizeSize &&
-            max_pointer_plus_bits
-            < VoidPointer
-            , detail::alignment_of<compact_avltree_node<VoidPointer> >::value
-            >::value >= 2u
-         >
-{};
-
-} //namespace intrusive
-} //namespace boost
-
-#include <boost/intrusive/detail/config_end.hpp>
-
-#endif //BOOST_INTRUSIVE_AVLTREE_NODE_HPP
diff --git a/src/boost/intrusive/detail/bstree_algorithms_base.hpp b/src/boost/intrusive/detail/bstree_algorithms_base.hpp
deleted file mode 100644
index 1dbd491e..00000000
--- a/src/boost/intrusive/detail/bstree_algorithms_base.hpp
+++ /dev/null
@@ -1,182 +0,0 @@
-/////////////////////////////////////////////////////////////////////////////
-//
-// (C) Copyright Ion Gaztanaga  2014-2014
-//
-// Distributed under the Boost 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/intrusive for documentation.
-//
-/////////////////////////////////////////////////////////////////////////////
-
-#ifndef BOOST_INTRUSIVE_BSTREE_ALGORITHMS_BASE_HPP
-#define BOOST_INTRUSIVE_BSTREE_ALGORITHMS_BASE_HPP
-
-#ifndef BOOST_CONFIG_HPP
-#  include <boost/config.hpp>
-#endif
-
-#if defined(BOOST_HAS_PRAGMA_ONCE)
-#  pragma once
-#endif
-
-#include <boost/intrusive/detail/uncast.hpp>
-
-namespace boost {
-namespace intrusive {
-
-template<class NodeTraits>
-class bstree_algorithms_base
-{
-   public:
-   typedef typename NodeTraits::node            node;
-   typedef NodeTraits                           node_traits;
-   typedef typename NodeTraits::node_ptr        node_ptr;
-   typedef typename NodeTraits::const_node_ptr  const_node_ptr;
-
-   //! <b>Requires</b>: 'n' is a node from the tree except the header.
-   //!
-   //! <b>Effects</b>: Returns the next node of the tree.
-   //!
-   //! <b>Complexity</b>: Average constant time.
-   //!
-   //! <b>Throws</b>: Nothing.
-   static node_ptr next_node(node_ptr n) BOOST_NOEXCEPT
-   {
-      node_ptr const n_right(NodeTraits::get_right(n));
-      if(n_right){
-         return minimum(n_right);
-      }
-      else {
-         node_ptr p(NodeTraits::get_parent(n));
-         while(n == NodeTraits::get_right(p)){
-            n = p;
-            p = NodeTraits::get_parent(p);
-         }
-         return NodeTraits::get_right(n) != p ? p : n;
-      }
-   }
-
-   //! <b>Requires</b>: 'n' is a node from the tree except the leftmost node.
-   //!
-   //! <b>Effects</b>: Returns the previous node of the tree.
-   //!
-   //! <b>Complexity</b>: Average constant time.
-   //!
-   //! <b>Throws</b>: Nothing.
-   static node_ptr prev_node(node_ptr n) BOOST_NOEXCEPT
-   {
-      if(is_header(n)){
-         return NodeTraits::get_right(n);
-      }
-      else if(NodeTraits::get_left(n)){
-         return maximum(NodeTraits::get_left(n));
-      }
-      else {
-         node_ptr p(n);
-         node_ptr x = NodeTraits::get_parent(p);
-         while(p == NodeTraits::get_left(x)){
-            p = x;
-            x = NodeTraits::get_parent(x);
-         }
-         return x;
-      }
-   }
-
-   //! <b>Requires</b>: 'n' is a node of a tree but not the header.
-   //!
-   //! <b>Effects</b>: Returns the minimum node of the subtree starting at p.
-   //!
-   //! <b>Complexity</b>: Logarithmic to the size of the subtree.
-   //!
-   //! <b>Throws</b>: Nothing.
-   static node_ptr minimum(node_ptr n)
-   {
-      for(node_ptr p_left = NodeTraits::get_left(n)
-         ;p_left
-         ;p_left = NodeTraits::get_left(n)){
-         n = p_left;
-      }
-      return n;
-   }
-
-   //! <b>Requires</b>: 'n' is a node of a tree but not the header.
-   //!
-   //! <b>Effects</b>: Returns the maximum node of the subtree starting at p.
-   //!
-   //! <b>Complexity</b>: Logarithmic to the size of the subtree.
-   //!
-   //! <b>Throws</b>: Nothing.
-   static node_ptr maximum(node_ptr n)
-   {
-      for(node_ptr p_right = NodeTraits::get_right(n)
-         ;p_right
-         ;p_right = NodeTraits::get_right(n)){
-         n = p_right;
-      }
-      return n;
-   }
-
-   //! <b>Requires</b>: p is a node of a tree.
-   //!
-   //! <b>Effects</b>: Returns true if p is the header of the tree.
-   //!
-   //! <b>Complexity</b>: Constant.
-   //!
-   //! <b>Throws</b>: Nothing.
-   static bool is_header(const_node_ptr p) BOOST_NOEXCEPT
-   {
-      node_ptr p_left (NodeTraits::get_left(p));
-      node_ptr p_right(NodeTraits::get_right(p));
-      if(!NodeTraits::get_parent(p) || //Header condition when empty tree
-         (p_left && p_right &&         //Header always has leftmost and rightmost
-            (p_left == p_right ||      //Header condition when only node
-               (NodeTraits::get_parent(p_left)  != p ||
-                NodeTraits::get_parent(p_right) != p ))
-               //When tree size > 1 headers can't be leftmost's
-               //and rightmost's parent
-          )){
-         return true;
-      }
-      return false;
-   }
-
-   //! <b>Requires</b>: 'n' is a node of the tree or a header node.
-   //!
-   //! <b>Effects</b>: Returns the header of the tree.
-   //!
-   //! <b>Complexity</b>: Logarithmic.
-   //!
-   //! <b>Throws</b>: Nothing.
-   static node_ptr get_header(const_node_ptr n)
-   {
-      node_ptr nn(detail::uncast(n));
-      node_ptr p(NodeTraits::get_parent(n));
-      //If p is null, then nn is the header of an empty tree
-      if(p){
-         //Non-empty tree, check if nn is neither root nor header
-         node_ptr pp(NodeTraits::get_parent(p));
-         //If granparent is not equal to nn, then nn is neither root nor header,
-         //the try the fast path
-         if(nn != pp){
-            do{
-               nn = p;
-               p = pp;
-               pp = NodeTraits::get_parent(pp);
-            }while(nn != pp);
-            nn = p;
-         }
-         //Check if nn is root or header when size() > 0
-         else if(!bstree_algorithms_base::is_header(nn)){
-            nn = p;
-         }
-      }
-      return nn;
-   }
-};
-
-}  //namespace intrusive
-}  //namespace boost
-
-#endif //BOOST_INTRUSIVE_BSTREE_ALGORITHMS_BASE_HPP
diff --git a/src/boost/intrusive/detail/common_slist_algorithms.hpp b/src/boost/intrusive/detail/common_slist_algorithms.hpp
deleted file mode 100644
index 8310231e..00000000
--- a/src/boost/intrusive/detail/common_slist_algorithms.hpp
+++ /dev/null
@@ -1,267 +0,0 @@
-/////////////////////////////////////////////////////////////////////////////
-//
-// (C) Copyright Ion Gaztanaga  2007-2014
-//
-// Distributed under the Boost 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/intrusive for documentation.
-//
-/////////////////////////////////////////////////////////////////////////////
-
-#ifndef BOOST_INTRUSIVE_COMMON_SLIST_ALGORITHMS_HPP
-#define BOOST_INTRUSIVE_COMMON_SLIST_ALGORITHMS_HPP
-
-#ifndef BOOST_CONFIG_HPP
-#  include <boost/config.hpp>
-#endif
-
-#if defined(BOOST_HAS_PRAGMA_ONCE)
-#  pragma once
-#endif
-
-#include <boost/intrusive/intrusive_fwd.hpp>
-#include <boost/intrusive/detail/workaround.hpp>
-#include <boost/intrusive/detail/assert.hpp>
-#include <boost/intrusive/detail/algo_type.hpp>
-#include <cstddef>
-
-namespace boost {
-namespace intrusive {
-namespace detail {
-
-template<class NodeTraits>
-class common_slist_algorithms
-{
-   public:
-   typedef typename NodeTraits::node            node;
-   typedef typename NodeTraits::node_ptr        node_ptr;
-   typedef typename NodeTraits::const_node_ptr  const_node_ptr;
-   typedef NodeTraits                           node_traits;
-
-   static node_ptr get_previous_node(node_ptr p, node_ptr this_node)
-   {
-      for( node_ptr p_next
-         ; this_node != (p_next = NodeTraits::get_next(p))
-         ; p = p_next){
-         //Logic error: possible use of linear lists with
-         //operations only permitted with circular lists
-         BOOST_INTRUSIVE_INVARIANT_ASSERT(p);
-      }
-      return p;
-   }
-
-   BOOST_INTRUSIVE_FORCEINLINE static void init(node_ptr this_node) BOOST_NOEXCEPT
-   {  NodeTraits::set_next(this_node, node_ptr());  }
-
-   static bool unique(const_node_ptr this_node) BOOST_NOEXCEPT
-   {
-      node_ptr next = NodeTraits::get_next(this_node);
-      return !next || next == this_node;
-   }
-
-   BOOST_INTRUSIVE_FORCEINLINE static bool inited(const_node_ptr this_node) BOOST_NOEXCEPT
-   {  return !NodeTraits::get_next(this_node); }
-
-   BOOST_INTRUSIVE_FORCEINLINE static void unlink_after(node_ptr prev_node) BOOST_NOEXCEPT
-   {
-      const_node_ptr this_node(NodeTraits::get_next(prev_node));
-      NodeTraits::set_next(prev_node, NodeTraits::get_next(this_node));
-   }
-
-   BOOST_INTRUSIVE_FORCEINLINE static void unlink_after(node_ptr prev_node, node_ptr last_node) BOOST_NOEXCEPT
-   {  NodeTraits::set_next(prev_node, last_node);  }
-
-   static void link_after(node_ptr prev_node, node_ptr this_node) BOOST_NOEXCEPT
-   {
-      NodeTraits::set_next(this_node, NodeTraits::get_next(prev_node));
-      NodeTraits::set_next(prev_node, this_node);
-   }
-
-   static void incorporate_after(node_ptr bp, node_ptr b, node_ptr be) BOOST_NOEXCEPT
-   {
-      node_ptr p(NodeTraits::get_next(bp));
-      NodeTraits::set_next(bp, b);
-      NodeTraits::set_next(be, p);
-   }
-
-   static void transfer_after(node_ptr bp, node_ptr bb, node_ptr be) BOOST_NOEXCEPT
-   {
-      if (bp != bb && bp != be && bb != be) {
-         node_ptr next_b = NodeTraits::get_next(bb);
-         node_ptr next_e = NodeTraits::get_next(be);
-         node_ptr next_p = NodeTraits::get_next(bp);
-         NodeTraits::set_next(bb, next_e);
-         NodeTraits::set_next(be, next_p);
-         NodeTraits::set_next(bp, next_b);
-      }
-   }
-
-   struct stable_partition_info
-   {
-      std::size_t num_1st_partition;
-      std::size_t num_2nd_partition;
-      node_ptr    beg_2st_partition;
-      node_ptr    new_last_node;
-   };
-
-   template<class Pred>
-   static void stable_partition(node_ptr before_beg, node_ptr end, Pred pred, stable_partition_info &info)
-   {
-      node_ptr bcur = before_beg;
-      node_ptr cur  = node_traits::get_next(bcur);
-      node_ptr new_f = end;
-
-      std::size_t num1 = 0, num2 = 0;
-      while(cur != end){
-         if(pred(cur)){
-            ++num1;
-            bcur = cur;
-            cur  = node_traits::get_next(cur);
-         }
-         else{
-            ++num2;
-            node_ptr last_to_remove = bcur;
-            new_f = cur;
-            bcur = cur;
-            cur  = node_traits::get_next(cur);
-            BOOST_INTRUSIVE_TRY{
-               //Main loop
-               while(cur != end){
-                  if(pred(cur)){ //Might throw
-                     ++num1;
-                     //Process current node
-                     node_traits::set_next(last_to_remove, cur);
-                     last_to_remove = cur;
-                     node_ptr nxt = node_traits::get_next(cur);
-                     node_traits::set_next(bcur, nxt);
-                     cur = nxt;
-                  }
-                  else{
-                     ++num2;
-                     bcur = cur;
-                     cur  = node_traits::get_next(cur);
-                  }
-               }
-            }
-            BOOST_INTRUSIVE_CATCH(...){
-               node_traits::set_next(last_to_remove, new_f);
-               BOOST_INTRUSIVE_RETHROW;
-            }
-            BOOST_INTRUSIVE_CATCH_END
-            node_traits::set_next(last_to_remove, new_f);
-            break;
-         }
-      }
-      info.num_1st_partition = num1;
-      info.num_2nd_partition = num2;
-      info.beg_2st_partition = new_f;
-      info.new_last_node = bcur;
-   }
-
-   //! <b>Requires</b>: f and l must be in a circular list.
-   //!
-   //! <b>Effects</b>: Returns the number of nodes in the range [f, l).
-   //!
-   //! <b>Complexity</b>: Linear
-   //!
-   //! <b>Throws</b>: Nothing.
-   static std::size_t distance(const_node_ptr f, const_node_ptr l) BOOST_NOEXCEPT
-   {
-      const_node_ptr i(f);
-      std::size_t result = 0;
-      while(i != l){
-         i = NodeTraits::get_next(i);
-         ++result;
-      }
-      return result;
-   }
-
-   //! <b>Requires</b>: "disposer" must be an object function
-   //!   taking a node_ptr parameter and shouldn't throw.
-   //!
-   //! <b>Effects</b>: Calls
-   //!   <tt>void disposer::operator()(node_ptr)</tt> for every node of the list
-   //!    [p, e).
-   //!
-   //! <b>Returns</b>: The number of unlinked/disposed nodes
-   //!
-   //! <b>Complexity</b>: Linear to the number of element of the list.
-   //!
-   //! <b>Throws</b>: Nothing.
-   template<class Disposer>
-   static std::size_t unlink_after_and_dispose(node_ptr bb, node_ptr e, Disposer disposer) BOOST_NOEXCEPT
-   {
-      std::size_t n = 0u;
-      node_ptr i = node_traits::get_next(bb);
-      while (i != e) {
-         node_ptr to_erase(i);
-         i = node_traits::get_next(i);
-         disposer(to_erase);
-         ++n;
-      }
-      node_traits::set_next(bb, e);
-      return n;
-   }
-
-   //! <b>Requires</b>: "disposer" must be an object function
-   //!   taking a node_ptr parameter and shouldn't throw.
-   //!
-   //! <b>Effects</b>: Calls
-   //!   <tt>void disposer::operator()(node_ptr)</tt> for every node of the list
-   //!    after p (but not for p). Works for circular or linear lists
-   //!
-   //! <b>Complexity</b>: Linear to the number of element of the list.
-   //!
-   //! <b>Throws</b>: Nothing.
-   template<class Disposer>
-   BOOST_INTRUSIVE_FORCEINLINE static void unlink_after_and_dispose(node_ptr bb, Disposer disposer) BOOST_NOEXCEPT
-   {
-      node_ptr i = node_traits::get_next(bb);
-      node_traits::set_next(bb, node_traits::get_next(i));
-      disposer(i);
-   }
-
-   //! <b>Requires</b>: "disposer" must be an object function
-   //!   taking a node_ptr parameter and shouldn't throw.
-   //!
-   //! <b>Effects</b>: Unlinks all nodes reachable from p (but not p) and calls
-   //!   <tt>void disposer::operator()(node_ptr)</tt> for every node of the list
-   //!    where p is linked.
-   //!
-   //! <b>Complexity</b>: Linear to the number of element of the list.
-   //!
-   //! <b>Throws</b>: Nothing.
-   template<class Disposer>
-   static std::size_t detach_and_dispose(node_ptr p, Disposer disposer) BOOST_NOEXCEPT
-   {
-      std::size_t n = 0;
-      node_ptr i = node_traits::get_next(p);
-      while ( i != p || i != node_ptr() ) {
-         node_ptr to_erase(i);
-         i = node_traits::get_next(i);
-         disposer(to_erase);
-      }
-      node_traits::set_next(p, i);
-      return n;
-   }
-};
-
-/// @endcond
-
-} //namespace detail
-
-/// @cond
-
-template<class NodeTraits>
-struct get_algo<CommonSListAlgorithms, NodeTraits>
-{
-   typedef detail::common_slist_algorithms<NodeTraits> type;
-};
-
-
-} //namespace intrusive
-} //namespace boost
-
-#endif //BOOST_INTRUSIVE_COMMON_SLIST_ALGORITHMS_HPP
diff --git a/src/boost/intrusive/detail/config_begin.hpp b/src/boost/intrusive/detail/config_begin.hpp
deleted file mode 100644
index b261ca91..00000000
--- a/src/boost/intrusive/detail/config_begin.hpp
+++ /dev/null
@@ -1,44 +0,0 @@
-/////////////////////////////////////////////////////////////////////////////
-//
-// (C) Copyright Ion Gaztanaga  2006-2013
-//
-// Distributed under the Boost 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/intrusive for documentation.
-//
-/////////////////////////////////////////////////////////////////////////////
-
-#ifndef BOOST_CONFIG_HPP
-#include <boost/config.hpp>
-#endif
-
-#ifdef BOOST_MSVC
-
-   #pragma warning (push)
-   #pragma warning (disable : 4619) // there is no warning number 'XXXX'
-   #pragma warning (disable : 4275) // non DLL-interface classkey "identifier" used as base for DLL-interface classkey "identifier"
-   #pragma warning (disable : 4251) // "identifier" : class "type" needs to have dll-interface to be used by clients of class "type2"
-   #pragma warning (disable : 4675) // "method" should be declared "static" and have exactly one parameter
-   #pragma warning (disable : 4996) // "function": was declared deprecated
-   #pragma warning (disable : 4503) // "identifier" : decorated name length exceeded, name was truncated
-   #pragma warning (disable : 4284) // odd return type for operator->
-   #pragma warning (disable : 4244) // possible loss of data
-   #pragma warning (disable : 4521) ////Disable "multiple copy constructors specified"
-   #pragma warning (disable : 4127) //conditional expression is constant
-   #pragma warning (disable : 4146) // unary minus operator applied to unsigned type, result still unsigned
-   #pragma warning (disable : 4267) //conversion from 'X' to 'Y', possible loss of data
-   #pragma warning (disable : 4541) //'typeid' used on polymorphic type 'boost::exception' with /GR-
-   #pragma warning (disable : 4512) //'typeid' used on polymorphic type 'boost::exception' with /GR-
-   #pragma warning (disable : 4522) // "class" : multiple assignment operators specified
-   #pragma warning (disable : 4706) //assignment within conditional expression
-   #pragma warning (disable : 4710) // function not inlined
-   #pragma warning (disable : 4714) // "function": marked as __forceinline not inlined
-   #pragma warning (disable : 4711) // function selected for automatic inline expansion
-   #pragma warning (disable : 4786) // identifier truncated in debug info
-   #pragma warning (disable : 4996) // "function": was declared deprecated
-#endif
-
-//#define BOOST_INTRUSIVE_USE_ITERATOR_FACADE
-//#define BOOST_INTRUSIVE_USE_ITERATOR_ENABLE_IF_CONVERTIBLE
diff --git a/src/boost/intrusive/detail/config_end.hpp b/src/boost/intrusive/detail/config_end.hpp
deleted file mode 100644
index a081443e..00000000
--- a/src/boost/intrusive/detail/config_end.hpp
+++ /dev/null
@@ -1,15 +0,0 @@
-/////////////////////////////////////////////////////////////////////////////
-//
-// (C) Copyright Ion Gaztanaga  2006-2013
-//
-// Distributed under the Boost 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/intrusive for documentation.
-//
-/////////////////////////////////////////////////////////////////////////////
-
-#if defined BOOST_MSVC
-   #pragma warning (pop)
-#endif
diff --git a/src/boost/intrusive/detail/default_header_holder.hpp b/src/boost/intrusive/detail/default_header_holder.hpp
deleted file mode 100644
index 42f35d2b..00000000
--- a/src/boost/intrusive/detail/default_header_holder.hpp
+++ /dev/null
@@ -1,70 +0,0 @@
-/////////////////////////////////////////////////////////////////////////////
-//
-// (C) Copyright Ion Gaztanaga  2014-2014
-//
-// Distributed under the Boost 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/intrusive for documentation.
-//
-/////////////////////////////////////////////////////////////////////////////
-
-#ifndef BOOST_INTRUSIVE_DETAIL_DEFAULT_HEADER_HOLDER_HPP
-#define BOOST_INTRUSIVE_DETAIL_DEFAULT_HEADER_HOLDER_HPP
-
-#ifndef BOOST_CONFIG_HPP
-#  include <boost/config.hpp>
-#endif
-
-#if defined(BOOST_HAS_PRAGMA_ONCE)
-#  pragma once
-#endif
-
-#include <boost/intrusive/detail/workaround.hpp>
-#include <boost/intrusive/pointer_traits.hpp>
-#include <boost/move/detail/to_raw_pointer.hpp>
-
-namespace boost {
-namespace intrusive {
-namespace detail {
-
-// trivial header node holder
-template < typename NodeTraits >
-struct default_header_holder : public NodeTraits::node
-{
-   typedef NodeTraits node_traits;
-   typedef typename node_traits::node node;
-   typedef typename node_traits::node_ptr node_ptr;
-   typedef typename node_traits::const_node_ptr const_node_ptr;
-
-   default_header_holder() : node() {}
-
-   BOOST_INTRUSIVE_FORCEINLINE const_node_ptr get_node() const
-   { return pointer_traits< const_node_ptr >::pointer_to(*static_cast< const node* >(this)); }
-
-   BOOST_INTRUSIVE_FORCEINLINE node_ptr get_node()
-   { return pointer_traits< node_ptr >::pointer_to(*static_cast< node* >(this)); }
-
-   // (unsafe) downcast used to implement container-from-iterator
-   BOOST_INTRUSIVE_FORCEINLINE static default_header_holder* get_holder(node_ptr p)
-   { return static_cast< default_header_holder* >(boost::movelib::to_raw_pointer(p)); }
-};
-
-// type function producing the header node holder
-template < typename ValueTraits, typename HeaderHolder >
-struct get_header_holder_type
-{
-   typedef HeaderHolder type;
-};
-template < typename ValueTraits >
-struct get_header_holder_type< ValueTraits, void >
-{
-   typedef default_header_holder< typename ValueTraits::node_traits > type;
-};
-
-} //namespace detail
-} //namespace intrusive
-} //namespace boost
-
-#endif //BOOST_INTRUSIVE_DETAIL_DEFAULT_HEADER_HOLDER_HPP
diff --git a/src/boost/intrusive/detail/ebo_functor_holder.hpp b/src/boost/intrusive/detail/ebo_functor_holder.hpp
deleted file mode 100644
index 88831667..00000000
--- a/src/boost/intrusive/detail/ebo_functor_holder.hpp
+++ /dev/null
@@ -1,292 +0,0 @@
-/////////////////////////////////////////////////////////////////////////////
-//
-// (C) Copyright Joaquin M Lopez Munoz  2006-2013
-// (C) Copyright Ion Gaztanaga          2014-2014
-//
-// Distributed under the Boost 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/intrusive for documentation.
-//
-/////////////////////////////////////////////////////////////////////////////
-
-#ifndef BOOST_INTRUSIVE_DETAIL_EBO_HOLDER_HPP
-#define BOOST_INTRUSIVE_DETAIL_EBO_HOLDER_HPP
-
-#ifndef BOOST_CONFIG_HPP
-#  include <boost/config.hpp>
-#endif
-
-#if defined(BOOST_HAS_PRAGMA_ONCE)
-#  pragma once
-#endif
-
-#include <boost/intrusive/detail/workaround.hpp>
-#include <boost/move/utility_core.hpp>
-
-namespace boost {
-namespace intrusive {
-namespace detail {
-
-#if defined(BOOST_MSVC) || defined(__BORLANDC_)
-#define BOOST_INTRUSIVE_TT_DECL __cdecl
-#else
-#define BOOST_INTRUSIVE_TT_DECL
-#endif
-
-#if defined(_MSC_EXTENSIONS) && !defined(__BORLAND__) && !defined(_WIN64) && !defined(_M_ARM) && !defined(_M_ARM64) && !defined(UNDER_CE)
-#define BOOST_INTRUSIVE_TT_TEST_MSC_FUNC_SIGS
-#endif
-
-template <typename T>
-struct is_unary_or_binary_function_impl
-{  static const bool value = false; };
-
-// see boost ticket #4094
-// avoid duplicate definitions of is_unary_or_binary_function_impl
-#ifndef BOOST_INTRUSIVE_TT_TEST_MSC_FUNC_SIGS
-
-template <typename R>
-struct is_unary_or_binary_function_impl<R (*)()>
-{  static const bool value = true;  };
-
-template <typename R>
-struct is_unary_or_binary_function_impl<R (*)(...)>
-{  static const bool value = true;  };
-
-#else // BOOST_INTRUSIVE_TT_TEST_MSC_FUNC_SIGS
-
-template <typename R>
-struct is_unary_or_binary_function_impl<R (__stdcall*)()>
-{  static const bool value = true;  };
-
-#ifndef _MANAGED
-
-template <typename R>
-struct is_unary_or_binary_function_impl<R (__fastcall*)()>
-{  static const bool value = true;  };
-
-#endif
-
-template <typename R>
-struct is_unary_or_binary_function_impl<R (__cdecl*)()>
-{  static const bool value = true;  };
-
-template <typename R>
-struct is_unary_or_binary_function_impl<R (__cdecl*)(...)>
-{  static const bool value = true;  };
-
-#endif
-
-// see boost ticket #4094
-// avoid duplicate definitions of is_unary_or_binary_function_impl
-#ifndef BOOST_INTRUSIVE_TT_TEST_MSC_FUNC_SIGS
-
-template <typename R, class T0>
-struct is_unary_or_binary_function_impl<R (*)(T0)>
-{  static const bool value = true;  };
-
-template <typename R, class T0>
-struct is_unary_or_binary_function_impl<R (*)(T0...)>
-{  static const bool value = true;  };
-
-#else // BOOST_INTRUSIVE_TT_TEST_MSC_FUNC_SIGS
-
-template <typename R, class T0>
-struct is_unary_or_binary_function_impl<R (__stdcall*)(T0)>
-{  static const bool value = true;  };
-
-#ifndef _MANAGED
-
-template <typename R, class T0>
-struct is_unary_or_binary_function_impl<R (__fastcall*)(T0)>
-{  static const bool value = true;  };
-
-#endif
-
-template <typename R, class T0>
-struct is_unary_or_binary_function_impl<R (__cdecl*)(T0)>
-{  static const bool value = true;  };
-
-template <typename R, class T0>
-struct is_unary_or_binary_function_impl<R (__cdecl*)(T0...)>
-{  static const bool value = true;  };
-
-#endif
-
-// see boost ticket #4094
-// avoid duplicate definitions of is_unary_or_binary_function_impl
-#ifndef BOOST_INTRUSIVE_TT_TEST_MSC_FUNC_SIGS
-
-template <typename R, class T0, class T1>
-struct is_unary_or_binary_function_impl<R (*)(T0, T1)>
-{  static const bool value = true;  };
-
-template <typename R, class T0, class T1>
-struct is_unary_or_binary_function_impl<R (*)(T0, T1...)>
-{  static const bool value = true;  };
-
-#else // BOOST_INTRUSIVE_TT_TEST_MSC_FUNC_SIGS
-
-template <typename R, class T0, class T1>
-struct is_unary_or_binary_function_impl<R (__stdcall*)(T0, T1)>
-{  static const bool value = true;  };
-
-#ifndef _MANAGED
-
-template <typename R, class T0, class T1>
-struct is_unary_or_binary_function_impl<R (__fastcall*)(T0, T1)>
-{  static const bool value = true;  };
-
-#endif
-
-template <typename R, class T0, class T1>
-struct is_unary_or_binary_function_impl<R (__cdecl*)(T0, T1)>
-{  static const bool value = true;  };
-
-template <typename R, class T0, class T1>
-struct is_unary_or_binary_function_impl<R (__cdecl*)(T0, T1...)>
-{  static const bool value = true;  };
-#endif
-
-template <typename T>
-struct is_unary_or_binary_function_impl<T&>
-{  static const bool value = false; };
-
-template<typename T>
-struct is_unary_or_binary_function : is_unary_or_binary_function_impl<T>
-{};
-
-template<typename T, typename Tag = void, bool = is_unary_or_binary_function<T>::value>
-class ebo_functor_holder
-{
-   BOOST_COPYABLE_AND_MOVABLE(ebo_functor_holder)
-
-   public:
-   typedef T functor_type;
-
-   BOOST_INTRUSIVE_FORCEINLINE ebo_functor_holder()
-      : t_()
-   {}
-
-   BOOST_INTRUSIVE_FORCEINLINE explicit ebo_functor_holder(const T &t)
-      : t_(t)
-   {}
-
-   BOOST_INTRUSIVE_FORCEINLINE explicit ebo_functor_holder(BOOST_RV_REF(T) t)
-      : t_(::boost::move(t))
-   {}
-
-   template<class Arg1, class Arg2>
-   BOOST_INTRUSIVE_FORCEINLINE ebo_functor_holder(BOOST_FWD_REF(Arg1) arg1, BOOST_FWD_REF(Arg2) arg2)
-      : t_(::boost::forward<Arg1>(arg1), ::boost::forward<Arg2>(arg2))
-   {}
-
-   BOOST_INTRUSIVE_FORCEINLINE ebo_functor_holder(const ebo_functor_holder &x)
-      : t_(x.t_)
-   {}
-
-   BOOST_INTRUSIVE_FORCEINLINE ebo_functor_holder(BOOST_RV_REF(ebo_functor_holder) x)
-      : t_(x.t_)
-   {}
-
-   BOOST_INTRUSIVE_FORCEINLINE ebo_functor_holder& operator=(BOOST_COPY_ASSIGN_REF(ebo_functor_holder) x)
-   {
-      this->get() = x.get();
-      return *this;
-   }
-
-   BOOST_INTRUSIVE_FORCEINLINE ebo_functor_holder& operator=(BOOST_RV_REF(ebo_functor_holder) x)
-   {
-      this->get() = ::boost::move(x.get());
-      return *this;
-   }
-
-   BOOST_INTRUSIVE_FORCEINLINE ebo_functor_holder& operator=(const T &x)
-   {
-      this->get() = x;
-      return *this;
-   }
-
-   BOOST_INTRUSIVE_FORCEINLINE ebo_functor_holder& operator=(BOOST_RV_REF(T) x)
-   {
-      this->get() = ::boost::move(x);
-      return *this;
-   }
-
-   BOOST_INTRUSIVE_FORCEINLINE T&       get(){return t_;}
-   BOOST_INTRUSIVE_FORCEINLINE const T& get()const{return t_;}
-
-   private:
-   T t_;
-};
-
-template<typename T, typename Tag>
-class ebo_functor_holder<T, Tag, false>
-   :  public T
-{
-   BOOST_COPYABLE_AND_MOVABLE(ebo_functor_holder)
-
-   public:
-   typedef T functor_type;
-
-   BOOST_INTRUSIVE_FORCEINLINE ebo_functor_holder()
-      : T()
-   {}
-
-   BOOST_INTRUSIVE_FORCEINLINE explicit ebo_functor_holder(const T &t)
-      : T(t)
-   {}
-
-   BOOST_INTRUSIVE_FORCEINLINE explicit ebo_functor_holder(BOOST_RV_REF(T) t)
-      : T(::boost::move(t))
-   {}
-
-   template<class Arg1, class Arg2>
-   BOOST_INTRUSIVE_FORCEINLINE ebo_functor_holder(BOOST_FWD_REF(Arg1) arg1, BOOST_FWD_REF(Arg2) arg2)
-      : T(::boost::forward<Arg1>(arg1), ::boost::forward<Arg2>(arg2))
-   {}
-
-   BOOST_INTRUSIVE_FORCEINLINE ebo_functor_holder(const ebo_functor_holder &x)
-      : T(static_cast<const T&>(x))
-   {}
-
-   BOOST_INTRUSIVE_FORCEINLINE ebo_functor_holder(BOOST_RV_REF(ebo_functor_holder) x)
-      : T(BOOST_MOVE_BASE(T, x))
-   {}
-
-   BOOST_INTRUSIVE_FORCEINLINE ebo_functor_holder& operator=(BOOST_COPY_ASSIGN_REF(ebo_functor_holder) x)
-   {
-      const ebo_functor_holder&r = x;
-      this->get() = r;
-      return *this;
-   }
-
-   BOOST_INTRUSIVE_FORCEINLINE ebo_functor_holder& operator=(BOOST_RV_REF(ebo_functor_holder) x)
-   {
-      this->get() = ::boost::move(x.get());
-      return *this;
-   }
-
-   BOOST_INTRUSIVE_FORCEINLINE ebo_functor_holder& operator=(const T &x)
-   {
-      this->get() = x;
-      return *this;
-   }
-
-   BOOST_INTRUSIVE_FORCEINLINE ebo_functor_holder& operator=(BOOST_RV_REF(T) x)
-   {
-      this->get() = ::boost::move(x);
-      return *this;
-   }
-
-   BOOST_INTRUSIVE_FORCEINLINE T&       get(){return *this;}
-   BOOST_INTRUSIVE_FORCEINLINE const T& get()const{return *this;}
-};
-
-}  //namespace detail {
-}  //namespace intrusive {
-}  //namespace boost {
-
-#endif   //#ifndef BOOST_INTRUSIVE_DETAIL_EBO_HOLDER_HPP
diff --git a/src/boost/intrusive/detail/empty_node_checker.hpp b/src/boost/intrusive/detail/empty_node_checker.hpp
deleted file mode 100644
index fbff4b67..00000000
--- a/src/boost/intrusive/detail/empty_node_checker.hpp
+++ /dev/null
@@ -1,44 +0,0 @@
-/////////////////////////////////////////////////////////////////////////////
-//
-// (C) Copyright Ion Gaztanaga  2014-2014
-//
-// Distributed under the Boost 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/intrusive for documentation.
-//
-/////////////////////////////////////////////////////////////////////////////
-
-#ifndef BOOST_INTRUSIVE_DETAIL_EMPTY_NODE_CHECKER_HPP
-#define BOOST_INTRUSIVE_DETAIL_EMPTY_NODE_CHECKER_HPP
-
-#ifndef BOOST_CONFIG_HPP
-#  include <boost/config.hpp>
-#endif
-
-#if defined(BOOST_HAS_PRAGMA_ONCE)
-#  pragma once
-#endif
-
-namespace boost {
-namespace intrusive {
-namespace detail {
-
-template<class ValueTraits>
-struct empty_node_checker
-{
-   typedef ValueTraits                             value_traits;
-   typedef typename value_traits::node_traits      node_traits;
-   typedef typename node_traits::const_node_ptr    const_node_ptr;
-
-   struct return_type {};
-
-   void operator () (const_node_ptr, const return_type&, const return_type&, return_type&) {}
-};
-
-}  //namespace detail{
-}  //namespace intrusive{
-}  //namespace boost{
-
-#endif //BOOST_INTRUSIVE_DETAIL_EMPTY_NODE_CHECKER_HPP
diff --git a/src/boost/intrusive/detail/equal_to_value.hpp b/src/boost/intrusive/detail/equal_to_value.hpp
deleted file mode 100644
index c5d9e530..00000000
--- a/src/boost/intrusive/detail/equal_to_value.hpp
+++ /dev/null
@@ -1,50 +0,0 @@
-/////////////////////////////////////////////////////////////////////////////
-//
-// (C) Copyright Ion Gaztanaga  2014-2014
-//
-// Distributed under the Boost 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/intrusive for documentation.
-//
-/////////////////////////////////////////////////////////////////////////////
-
-#ifndef BOOST_INTRUSIVE_DETAIL_EQUAL_TO_VALUE_HPP
-#define BOOST_INTRUSIVE_DETAIL_EQUAL_TO_VALUE_HPP
-
-#ifndef BOOST_CONFIG_HPP
-#  include <boost/config.hpp>
-#endif
-
-#if defined(BOOST_HAS_PRAGMA_ONCE)
-#  pragma once
-#endif
-
-#include <boost/intrusive/detail/workaround.hpp>
-
-namespace boost {
-namespace intrusive {
-namespace detail {
-
-//This functor compares a stored value
-//and the one passed as an argument
-template<class ConstReference>
-class equal_to_value
-{
-   ConstReference t_;
-
-   public:
-   equal_to_value(ConstReference t)
-      :  t_(t)
-   {}
-
-   BOOST_INTRUSIVE_FORCEINLINE bool operator()(ConstReference t)const
-   {  return t_ == t;   }
-};
-
-}  //namespace detail{
-}  //namespace intrusive{
-}  //namespace boost{
-
-#endif //BOOST_INTRUSIVE_DETAIL_EQUAL_TO_VALUE_HPP
diff --git a/src/boost/intrusive/detail/exception_disposer.hpp b/src/boost/intrusive/detail/exception_disposer.hpp
deleted file mode 100644
index 0e21faeb..00000000
--- a/src/boost/intrusive/detail/exception_disposer.hpp
+++ /dev/null
@@ -1,59 +0,0 @@
-/////////////////////////////////////////////////////////////////////////////
-//
-// (C) Copyright Ion Gaztanaga  2014-2014
-//
-// Distributed under the Boost 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/intrusive for documentation.
-//
-/////////////////////////////////////////////////////////////////////////////
-
-#ifndef BOOST_INTRUSIVE_DETAIL_EXCEPTION_DISPOSER_HPP
-#define BOOST_INTRUSIVE_DETAIL_EXCEPTION_DISPOSER_HPP
-
-#ifndef BOOST_CONFIG_HPP
-#  include <boost/config.hpp>
-#endif
-
-#if defined(BOOST_HAS_PRAGMA_ONCE)
-#  pragma once
-#endif
-
-#include <boost/intrusive/detail/workaround.hpp>
-
-namespace boost {
-namespace intrusive {
-namespace detail {
-
-template<class Container, class Disposer>
-class exception_disposer
-{
-   Container *cont_;
-   Disposer  &disp_;
-
-   exception_disposer(const exception_disposer&);
-   exception_disposer &operator=(const exception_disposer&);
-
-   public:
-   exception_disposer(Container &cont, Disposer &disp)
-      :  cont_(&cont), disp_(disp)
-   {}
-
-   BOOST_INTRUSIVE_FORCEINLINE void release()
-   {  cont_ = 0;  }
-
-   ~exception_disposer()
-   {
-      if(cont_){
-         cont_->clear_and_dispose(disp_);
-      }
-   }
-};
-
-}  //namespace detail{
-}  //namespace intrusive{
-}  //namespace boost{
-
-#endif //BOOST_INTRUSIVE_DETAIL_EXCEPTION_DISPOSER_HPP
diff --git a/src/boost/intrusive/detail/function_detector.hpp b/src/boost/intrusive/detail/function_detector.hpp
deleted file mode 100644
index 5ecaeaf0..00000000
--- a/src/boost/intrusive/detail/function_detector.hpp
+++ /dev/null
@@ -1,92 +0,0 @@
-/////////////////////////////////////////////////////////////////////////////
-//
-// (C) Copyright Ion Gaztanaga  2009-2013.
-//
-// Distributed under the Boost 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/intrusive for documentation.
-//
-/////////////////////////////////////////////////////////////////////////////
-//  This code was modified from the code posted by Alexandre Courpron in his
-//  article "Interface Detection" in The Code Project:
-//  http://www.codeproject.com/KB/architecture/Detector.aspx
-///////////////////////////////////////////////////////////////////////////////
-// Copyright 2007 Alexandre Courpron
-//
-// Permission to use, copy, modify, redistribute and sell this software,
-// provided that this copyright notice appears on all copies of the software.
-///////////////////////////////////////////////////////////////////////////////
-
-#ifndef BOOST_INTRUSIVE_DETAIL_FUNCTION_DETECTOR_HPP
-#define BOOST_INTRUSIVE_DETAIL_FUNCTION_DETECTOR_HPP
-
-#ifndef BOOST_CONFIG_HPP
-#  include <boost/config.hpp>
-#endif
-
-#if defined(BOOST_HAS_PRAGMA_ONCE)
-#  pragma once
-#endif
-
-namespace boost {
-namespace intrusive {
-namespace function_detector {
-
-    typedef char NotFoundType;
-    struct StaticFunctionType { NotFoundType x [2]; };
-    struct NonStaticFunctionType { NotFoundType x [3]; };
-
-    enum
-         { NotFound          = 0,
-           StaticFunction    = sizeof( StaticFunctionType )    - sizeof( NotFoundType ),
-           NonStaticFunction = sizeof( NonStaticFunctionType ) - sizeof( NotFoundType )
-         };
-
-}  //namespace boost {
-}  //namespace intrusive {
-}  //namespace function_detector {
-
-#define BOOST_INTRUSIVE_CREATE_FUNCTION_DETECTOR(Identifier, InstantiationKey) \
-   namespace boost { \
-   namespace intrusive { \
-   namespace function_detector { \
-   template < class T, \
-            class NonStaticType, \
-            class NonStaticConstType, \
-            class StaticType > \
-   class DetectMember_##InstantiationKey_##Identifier { \
-      template < NonStaticType > \
-      struct TestNonStaticNonConst ; \
-      \
-      template < NonStaticConstType > \
-      struct TestNonStaticConst ; \
-      \
-      template < StaticType > \
-      struct TestStatic ; \
-      \
-      template <class U > \
-      static NonStaticFunctionType Test( TestNonStaticNonConst<&U::Identifier>*, int ); \
-      \
-      template <class U > \
-      static NonStaticFunctionType Test( TestNonStaticConst<&U::Identifier>*, int ); \
-      \
-      template <class U> \
-      static StaticFunctionType Test( TestStatic<&U::Identifier>*, int ); \
-      \
-      template <class U> \
-      static NotFoundType Test( ... ); \
-   public : \
-      static const int check = NotFound + (sizeof(Test<T>(0, 0)) - sizeof(NotFoundType));\
-   };\
-}}} //namespace boost::intrusive::function_detector {
-
-#define BOOST_INTRUSIVE_DETECT_FUNCTION(Class, InstantiationKey, ReturnType, Identifier, Params) \
-    ::boost::intrusive::function_detector::DetectMember_##InstantiationKey_##Identifier< Class,\
-                                         ReturnType (Class::*)Params,\
-                                         ReturnType (Class::*)Params const,\
-                                         ReturnType (*)Params \
-                                       >::check
-
-#endif   //@ifndef BOOST_INTRUSIVE_DETAIL_FUNCTION_DETECTOR_HPP
diff --git a/src/boost/intrusive/detail/generic_hook.hpp b/src/boost/intrusive/detail/generic_hook.hpp
deleted file mode 100644
index 6e43f90d..00000000
--- a/src/boost/intrusive/detail/generic_hook.hpp
+++ /dev/null
@@ -1,223 +0,0 @@
-/////////////////////////////////////////////////////////////////////////////
-//
-// (C) Copyright Ion Gaztanaga 2007-2013
-//
-// Distributed under the Boost 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/intrusive for documentation.
-//
-/////////////////////////////////////////////////////////////////////////////
-
-#ifndef BOOST_INTRUSIVE_GENERIC_HOOK_HPP
-#define BOOST_INTRUSIVE_GENERIC_HOOK_HPP
-
-#ifndef BOOST_CONFIG_HPP
-#  include <boost/config.hpp>
-#endif
-
-#if defined(BOOST_HAS_PRAGMA_ONCE)
-#  pragma once
-#endif
-
-#include <boost/intrusive/pointer_traits.hpp>
-#include <boost/intrusive/link_mode.hpp>
-#include <boost/intrusive/detail/mpl.hpp>
-#include <boost/intrusive/detail/assert.hpp>
-#include <boost/intrusive/detail/node_holder.hpp>
-#include <boost/intrusive/detail/algo_type.hpp>
-#include <boost/static_assert.hpp>
-
-namespace boost {
-namespace intrusive {
-
-/// @cond
-
-namespace detail {
-
-template <link_mode_type LinkMode>
-struct link_dispatch
-{};
-
-template<class Hook>
-BOOST_INTRUSIVE_FORCEINLINE void destructor_impl(Hook &hook, detail::link_dispatch<safe_link>)
-{  //If this assertion raises, you might have destroyed an object
-   //while it was still inserted in a container that is alive.
-   //If so, remove the object from the container before destroying it.
-   (void)hook; BOOST_INTRUSIVE_SAFE_HOOK_DESTRUCTOR_ASSERT(!hook.is_linked());
-}
-
-template<class Hook>
-BOOST_INTRUSIVE_FORCEINLINE void destructor_impl(Hook &hook, detail::link_dispatch<auto_unlink>)
-{  hook.unlink();  }
-
-template<class Hook>
-BOOST_INTRUSIVE_FORCEINLINE void destructor_impl(Hook &, detail::link_dispatch<normal_link>)
-{}
-
-}  //namespace detail {
-
-enum base_hook_type
-{  NoBaseHookId
-,  ListBaseHookId
-,  SlistBaseHookId
-,  RbTreeBaseHookId
-,  HashBaseHookId
-,  AvlTreeBaseHookId
-,  BsTreeBaseHookId
-,  TreapTreeBaseHookId
-,  AnyBaseHookId
-};
-
-
-template <class HookTags, unsigned int>
-struct hook_tags_definer{};
-
-template <class HookTags>
-struct hook_tags_definer<HookTags, ListBaseHookId>
-{  typedef HookTags default_list_hook;  };
-
-template <class HookTags>
-struct hook_tags_definer<HookTags, SlistBaseHookId>
-{  typedef HookTags default_slist_hook;  };
-
-template <class HookTags>
-struct hook_tags_definer<HookTags, RbTreeBaseHookId>
-{  typedef HookTags default_rbtree_hook;  };
-
-template <class HookTags>
-struct hook_tags_definer<HookTags, HashBaseHookId>
-{  typedef HookTags default_hashtable_hook;  };
-
-template <class HookTags>
-struct hook_tags_definer<HookTags, AvlTreeBaseHookId>
-{  typedef HookTags default_avltree_hook;  };
-
-template <class HookTags>
-struct hook_tags_definer<HookTags, BsTreeBaseHookId>
-{  typedef HookTags default_bstree_hook;  };
-
-template <class HookTags>
-struct hook_tags_definer<HookTags, AnyBaseHookId>
-{  typedef HookTags default_any_hook;  };
-
-template
-   < class NodeTraits
-   , class Tag
-   , link_mode_type LinkMode
-   , base_hook_type BaseHookType
-   >
-struct hooktags_impl
-{
-   static const link_mode_type link_mode = LinkMode;
-   typedef Tag tag;
-   typedef NodeTraits node_traits;
-   static const bool is_base_hook = !detail::is_same<Tag, member_tag>::value;
-   static const bool safemode_or_autounlink = is_safe_autounlink<link_mode>::value;
-   static const unsigned int type = BaseHookType;
-};
-
-/// @endcond
-
-template
-   < boost::intrusive::algo_types Algo
-   , class NodeTraits
-   , class Tag
-   , link_mode_type LinkMode
-   , base_hook_type BaseHookType
-   >
-class generic_hook
-   /// @cond
-   //If the hook is a base hook, derive generic hook from node_holder
-   //so that a unique base class is created to convert from the node
-   //to the type. This mechanism will be used by bhtraits.
-   //
-   //If the hook is a member hook, generic hook will directly derive
-   //from the hook.
-   : public detail::if_c
-      < detail::is_same<Tag, member_tag>::value
-      , typename NodeTraits::node
-      , node_holder<typename NodeTraits::node, Tag, BaseHookType>
-      >::type
-   //If this is the a default-tagged base hook derive from a class that
-   //will define an special internal typedef. Containers will be able to detect this
-   //special typedef and obtain generic_hook's internal types in order to deduce
-   //value_traits for this hook.
-   , public hook_tags_definer
-      < generic_hook<Algo, NodeTraits, Tag, LinkMode, BaseHookType>
-      , detail::is_same<Tag, dft_tag>::value ? BaseHookType : NoBaseHookId>
-   /// @endcond
-{
-   /// @cond
-   typedef typename get_algo<Algo, NodeTraits>::type  node_algorithms;
-   typedef typename node_algorithms::node             node;
-   typedef typename node_algorithms::node_ptr         node_ptr;
-   typedef typename node_algorithms::const_node_ptr   const_node_ptr;
-
-   public:
-
-   typedef hooktags_impl
-      < NodeTraits
-      , Tag, LinkMode, BaseHookType>                  hooktags;
-
-   BOOST_INTRUSIVE_FORCEINLINE node_ptr this_ptr() BOOST_NOEXCEPT
-   {  return pointer_traits<node_ptr>::pointer_to(static_cast<node&>(*this)); }
-
-   BOOST_INTRUSIVE_FORCEINLINE const_node_ptr this_ptr() const BOOST_NOEXCEPT
-   {  return pointer_traits<const_node_ptr>::pointer_to(static_cast<const node&>(*this)); }
-
-   public:
-   /// @endcond
-
-   BOOST_INTRUSIVE_FORCEINLINE generic_hook() BOOST_NOEXCEPT
-   {
-      if(hooktags::safemode_or_autounlink){
-         node_algorithms::init(this->this_ptr());
-      }
-   }
-
-   BOOST_INTRUSIVE_FORCEINLINE generic_hook(const generic_hook& ) BOOST_NOEXCEPT
-   {
-      if(hooktags::safemode_or_autounlink){
-         node_algorithms::init(this->this_ptr());
-      }
-   }
-
-   BOOST_INTRUSIVE_FORCEINLINE generic_hook& operator=(const generic_hook& ) BOOST_NOEXCEPT
-   {  return *this;  }
-
-   BOOST_INTRUSIVE_FORCEINLINE ~generic_hook()
-   {
-      destructor_impl
-         (*this, detail::link_dispatch<hooktags::link_mode>());
-   }
-
-   BOOST_INTRUSIVE_FORCEINLINE void swap_nodes(generic_hook &other) BOOST_NOEXCEPT
-   {
-      node_algorithms::swap_nodes
-         (this->this_ptr(), other.this_ptr());
-   }
-
-   BOOST_INTRUSIVE_FORCEINLINE bool is_linked() const BOOST_NOEXCEPT
-   {
-      //is_linked() can be only used in safe-mode or auto-unlink
-      BOOST_STATIC_ASSERT(( hooktags::safemode_or_autounlink ));
-      return !node_algorithms::unique(this->this_ptr());
-   }
-
-   BOOST_INTRUSIVE_FORCEINLINE void unlink() BOOST_NOEXCEPT
-   {
-      BOOST_STATIC_ASSERT(( (int)hooktags::link_mode == (int)auto_unlink ));
-      node_ptr n(this->this_ptr());
-      if(!node_algorithms::inited(n)){
-         node_algorithms::unlink(n);
-         node_algorithms::init(n);
-      }
-   }
-};
-
-} //namespace intrusive
-} //namespace boost
-
-#endif //BOOST_INTRUSIVE_GENERIC_HOOK_HPP
diff --git a/src/boost/intrusive/detail/get_value_traits.hpp b/src/boost/intrusive/detail/get_value_traits.hpp
deleted file mode 100644
index 222f8078..00000000
--- a/src/boost/intrusive/detail/get_value_traits.hpp
+++ /dev/null
@@ -1,222 +0,0 @@
-/////////////////////////////////////////////////////////////////////////////
-//
-// (C) Copyright Ion Gaztanaga  2014-2014
-//
-// Distributed under the Boost 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/intrusive for documentation.
-//
-/////////////////////////////////////////////////////////////////////////////
-
-#ifndef BOOST_INTRUSIVE_DETAIL_GET_VALUE_TRAITS_HPP
-#define BOOST_INTRUSIVE_DETAIL_GET_VALUE_TRAITS_HPP
-
-#ifndef BOOST_CONFIG_HPP
-#  include <boost/config.hpp>
-#endif
-
-#if defined(BOOST_HAS_PRAGMA_ONCE)
-#  pragma once
-#endif
-
-#include <boost/intrusive/detail/config_begin.hpp>
-#include <boost/intrusive/detail/mpl.hpp>
-#include <boost/intrusive/detail/hook_traits.hpp>
-
-namespace boost {
-namespace intrusive {
-
-#ifndef BOOST_INTRUSIVE_DOXYGEN_INVOKED
-
-template<class SupposedValueTraits>
-struct is_default_hook_tag
-{  static const bool value = false;  };
-
-namespace detail{
-
-template <class T, class BaseHook>
-struct concrete_hook_base_value_traits
-{
-   typedef typename BaseHook::hooktags tags;
-   typedef bhtraits
-      < T
-      , typename tags::node_traits
-      , tags::link_mode
-      , typename tags::tag
-      , tags::type> type;
-};
-
-template <class BaseHook>
-struct concrete_hook_base_value_traits<void, BaseHook>
-{
-   typedef typename BaseHook::hooktags type;
-};
-
-template <class T, class AnyToSomeHook_ProtoValueTraits>
-struct any_hook_base_value_traits
-{
-   //AnyToSomeHook value_traits derive from a generic_hook
-   //The generic_hook is configured with any_node_traits
-   //and AnyToSomeHook::value_traits with the correct
-   //node traits for the container, so use node_traits
-   //from AnyToSomeHook_ProtoValueTraits and the rest of
-   //elements from the hooktags member of the generic_hook
-
-   typedef typename AnyToSomeHook_ProtoValueTraits::basic_hook_t     basic_hook_t;
-   typedef typename pointer_rebind
-      < typename basic_hook_t::hooktags::node_traits::node_ptr
-      , void>::type                                                  void_pointer;
-   typedef typename AnyToSomeHook_ProtoValueTraits::template
-      node_traits_from_voidptr<void_pointer>::type                   node_traits;
-
-   typedef bhtraits
-      < T
-      , node_traits
-      , basic_hook_t::hooktags::link_mode
-      , typename basic_hook_t::hooktags::tag
-      , basic_hook_t::hooktags::type
-      > type;
-};
-
-template <class AnyToSomeHook_ProtoValueTraits>
-struct any_hook_base_value_traits<void, AnyToSomeHook_ProtoValueTraits>
-{
-   typedef typename AnyToSomeHook_ProtoValueTraits::basic_hook_t     basic_hook_t;
-   typedef typename pointer_rebind
-      < typename basic_hook_t::hooktags::node_traits::node_ptr
-      , void>::type                                                  void_pointer;
-
-   struct type
-   {
-      typedef typename AnyToSomeHook_ProtoValueTraits::template
-         node_traits_from_voidptr<void_pointer>::type                node_traits;
-   };
-};
-
-template<class MemberHook>
-struct get_member_value_traits
-{
-   typedef typename MemberHook::member_value_traits type;
-};
-
-BOOST_INTRUSIVE_INTERNAL_STATIC_BOOL_IS_TRUE(internal_any_hook, is_any_hook)
-BOOST_INTRUSIVE_INTERNAL_STATIC_BOOL_IS_TRUE(internal_base_hook, hooktags::is_base_hook)
-
-template <class T>
-struct internal_member_value_traits
-{
-   template <class U> static yes_type test(...);
-   template <class U> static no_type test(typename U::member_value_traits* = 0);
-   static const bool value = sizeof(test<T>(0)) == sizeof(no_type);
-};
-
-template<class SupposedValueTraits, class T, bool = is_default_hook_tag<SupposedValueTraits>::value>
-struct supposed_value_traits;
-
-template<class T, class BaseHook, bool = internal_any_hook_bool_is_true<BaseHook>::value>
-struct get_base_value_traits;
-
-template<class SupposedValueTraits, class T, bool = internal_base_hook_bool_is_true<SupposedValueTraits>::value>
-struct supposed_base_value_traits;
-
-template<class SupposedValueTraits, bool = internal_member_value_traits<SupposedValueTraits>::value>
-struct supposed_member_value_traits;
-
-template<class SupposedValueTraits, bool = internal_any_hook_bool_is_true<SupposedValueTraits>::value>
-struct any_or_concrete_value_traits;
-
-//Base any hook
-template<class T, class BaseHook>
-struct get_base_value_traits<T, BaseHook, true>
-   : any_hook_base_value_traits<T, BaseHook>
-{};
-
-//Non-any base hook
-template<class T, class BaseHook>
-struct get_base_value_traits<T, BaseHook, false>
-   : concrete_hook_base_value_traits<T, BaseHook>
-{};
-
-//...It's a default hook
-template<class SupposedValueTraits, class T>
-struct supposed_value_traits<SupposedValueTraits, T, true>
-{  typedef typename SupposedValueTraits::template apply<T>::type type;  };
-
-//...Not  a default hook
-template<class SupposedValueTraits, class T>
-struct supposed_value_traits<SupposedValueTraits, T, false>
-{  typedef SupposedValueTraits type;   };
-
-//...It's a base hook
-template<class BaseHook, class T>
-struct supposed_base_value_traits<BaseHook, T, true>
-   : get_base_value_traits<T, BaseHook>
-{};
-
-//...Not a base hook, try if it's a member or value_traits
-template<class SupposedValueTraits, class T>
-struct supposed_base_value_traits<SupposedValueTraits, T, false>
-   : supposed_member_value_traits<SupposedValueTraits>
-{};
-
-//...It's a member hook
-template<class MemberHook>
-struct supposed_member_value_traits<MemberHook, true>
-   : get_member_value_traits<MemberHook>
-{};
-
-//...Not a member hook
-template<class SupposedValueTraits>
-struct supposed_member_value_traits<SupposedValueTraits, false>
-   : any_or_concrete_value_traits<SupposedValueTraits>
-{};
-
-template<class AnyToSomeHook_ProtoValueTraits>
-struct any_or_concrete_value_traits<AnyToSomeHook_ProtoValueTraits, true>
-{
-   //A hook node (non-base, e.g.: member or other value traits
-   typedef typename AnyToSomeHook_ProtoValueTraits::basic_hook_t        basic_hook_t;
-   typedef typename pointer_rebind
-      <typename basic_hook_t::node_ptr, void>::type                     void_pointer;
-   typedef typename AnyToSomeHook_ProtoValueTraits::template
-      node_traits_from_voidptr<void_pointer>::type                      any_node_traits;
-
-   struct type : basic_hook_t
-   {
-      typedef any_node_traits node_traits;
-   };
-};
-
-template<class SupposedValueTraits>
-struct any_or_concrete_value_traits<SupposedValueTraits, false>
-{
-   typedef SupposedValueTraits type;
-};
-
-////////////////////////////////////////
-//  get_value_traits / get_node_traits
-////////////////////////////////////////
-
-template<class T, class SupposedValueTraits>
-struct get_value_traits
-   : supposed_base_value_traits<typename supposed_value_traits<SupposedValueTraits, T>::type, T>
-{};
-
-template<class SupposedValueTraits>
-struct get_node_traits
-{
-   typedef typename get_value_traits<void, SupposedValueTraits>::type::node_traits type;
-};
-
-}  //namespace detail{
-
-#endif   //BOOST_INTRUSIVE_DOXYGEN_INVOKED
-
-}  //namespace intrusive {
-}  //namespace boost {
-
-#include <boost/intrusive/detail/config_end.hpp>
-
-#endif   //#ifndef BOOST_INTRUSIVE_DETAIL_GET_VALUE_TRAITS_HPP
diff --git a/src/boost/intrusive/detail/has_member_function_callable_with.hpp b/src/boost/intrusive/detail/has_member_function_callable_with.hpp
deleted file mode 100644
index 92ef60ee..00000000
--- a/src/boost/intrusive/detail/has_member_function_callable_with.hpp
+++ /dev/null
@@ -1,366 +0,0 @@
-//////////////////////////////////////////////////////////////////////////////
-//
-// (C) Copyright Ion Gaztanaga 2014-2014. Distributed under the Boost
-// 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.
-//
-//////////////////////////////////////////////////////////////////////////////
-
-#ifndef BOOST_INTRUSIVE_HAS_MEMBER_FUNCTION_CALLABLE_WITH_CALLABLE_WITH_HPP
-#define BOOST_INTRUSIVE_HAS_MEMBER_FUNCTION_CALLABLE_WITH_CALLABLE_WITH_HPP
-
-#ifndef BOOST_CONFIG_HPP
-#  include <boost/config.hpp>
-#endif
-
-//In case no decltype and no variadics, mark that we don't support 0 arg calls due to
-//compiler ICE in GCC 3.4/4.0/4.1 and, wrong SFINAE for GCC 4.2/4.3/MSVC10/MSVC11
-#if defined(BOOST_NO_CXX11_DECLTYPE) && defined(BOOST_NO_CXX11_VARIADIC_TEMPLATES)
-#  if defined(BOOST_GCC) && (BOOST_GCC < 40400)
-#     define BOOST_INTRUSIVE_DETAIL_HAS_MEMBER_FUNCTION_CALLABLE_WITH_0_ARGS_UNSUPPORTED
-#  elif defined(BOOST_INTEL) && (BOOST_INTEL < 1200)
-#     define BOOST_INTRUSIVE_DETAIL_HAS_MEMBER_FUNCTION_CALLABLE_WITH_0_ARGS_UNSUPPORTED
-#  elif defined(BOOST_MSVC) && (BOOST_MSVC < 1800)
-#     define BOOST_INTRUSIVE_DETAIL_HAS_MEMBER_FUNCTION_CALLABLE_WITH_0_ARGS_UNSUPPORTED
-#  endif
-#endif   //#if defined(BOOST_NO_CXX11_DECLTYPE) && defined(BOOST_NO_CXX11_VARIADIC_TEMPLATES)
-
-#include <cstddef>
-#include <boost/move/utility_core.hpp>
-#include <boost/move/detail/fwd_macros.hpp>
-
-namespace boost_intrusive_hmfcw {
-
-typedef char yes_type;
-struct no_type{ char dummy[2]; };
-
-struct dont_care
-{
-   dont_care(...);
-};
-
-#if defined(BOOST_NO_CXX11_DECLTYPE)
-
-#if !defined(BOOST_NO_CXX11_VARIADIC_TEMPLATES)
-
-template<class T>
-struct make_dontcare
-{
-   typedef dont_care type;
-};
-
-#endif
-
-struct private_type
-{
-   static private_type p;
-   private_type const &operator,(int) const;
-};
-
-template<typename T>
-no_type is_private_type(T const &);
-yes_type is_private_type(private_type const &);
-
-#endif   //#if defined(BOOST_NO_CXX11_DECLTYPE)
-
-#if defined(BOOST_NO_CXX11_VARIADIC_TEMPLATES) || defined(BOOST_NO_CXX11_DECLTYPE)
-
-template<typename T> struct remove_cv                    {  typedef T type;   };
-template<typename T> struct remove_cv<const T>           {  typedef T type;   };
-template<typename T> struct remove_cv<const volatile T>  {  typedef T type;   };
-template<typename T> struct remove_cv<volatile T>        {  typedef T type;   };
-
-#endif
-
-}  //namespace boost_intrusive_hmfcw {
-
-#endif  //BOOST_INTRUSIVE_HAS_MEMBER_FUNCTION_CALLABLE_WITH_CALLABLE_WITH_HPP
-
-#ifndef BOOST_INTRUSIVE_HAS_MEMBER_FUNCTION_CALLABLE_WITH_FUNCNAME
-   #error "You MUST define BOOST_INTRUSIVE_HAS_MEMBER_FUNCTION_CALLABLE_WITH_FUNCNAME before including this header!"
-#endif
-
-#ifndef BOOST_INTRUSIVE_HAS_MEMBER_FUNCTION_CALLABLE_WITH_MIN
-   #error "You MUST define BOOST_INTRUSIVE_HAS_MEMBER_FUNCTION_CALLABLE_WITH_MIN before including this header!"
-#endif
-
-#ifndef BOOST_INTRUSIVE_HAS_MEMBER_FUNCTION_CALLABLE_WITH_MAX
-   #error "You MUST define BOOST_INTRUSIVE_HAS_MEMBER_FUNCTION_CALLABLE_WITH_MAX before including this header!"
-#endif
-
-#if BOOST_INTRUSIVE_HAS_MEMBER_FUNCTION_CALLABLE_WITH_MAX < BOOST_INTRUSIVE_HAS_MEMBER_FUNCTION_CALLABLE_WITH_MIN
-   #error "BOOST_INTRUSIVE_HAS_MEMBER_FUNCTION_CALLABLE_WITH_MAX value MUST be greater or equal than BOOST_INTRUSIVE_HAS_MEMBER_FUNCTION_CALLABLE_WITH_MIN!"
-#endif
-
-#if BOOST_INTRUSIVE_HAS_MEMBER_FUNCTION_CALLABLE_WITH_MAX == 0
-   #define BOOST_INTRUSIVE_HAS_MEMBER_FUNCTION_CALLABLE_WITH_COMMA_IF
-#else
-   #define BOOST_INTRUSIVE_HAS_MEMBER_FUNCTION_CALLABLE_WITH_COMMA_IF ,
-#endif
-
-#ifndef  BOOST_INTRUSIVE_HAS_MEMBER_FUNCTION_CALLABLE_WITH_NS_BEG
-   #error "BOOST_INTRUSIVE_HAS_MEMBER_FUNCTION_CALLABLE_WITH_NS_BEG not defined!"
-#endif
-
-#ifndef  BOOST_INTRUSIVE_HAS_MEMBER_FUNCTION_CALLABLE_WITH_NS_END
-   #error "BOOST_INTRUSIVE_HAS_MEMBER_FUNCTION_CALLABLE_WITH_NS_END not defined!"
-#endif
-
-BOOST_INTRUSIVE_HAS_MEMBER_FUNCTION_CALLABLE_WITH_NS_BEG
-
-#if !defined(BOOST_NO_CXX11_VARIADIC_TEMPLATES) && !defined(BOOST_NO_CXX11_DECLTYPE)
-   //With decltype and variadic templaes, things are pretty easy
-   template<typename Fun, class ...Args>
-   struct BOOST_MOVE_CAT(has_member_function_callable_with_,BOOST_INTRUSIVE_HAS_MEMBER_FUNCTION_CALLABLE_WITH_FUNCNAME)
-   {
-      template<class U>
-      static decltype(boost::move_detail::declval<U>().
-         BOOST_INTRUSIVE_HAS_MEMBER_FUNCTION_CALLABLE_WITH_FUNCNAME(::boost::move_detail::declval<Args>()...)
-            , boost_intrusive_hmfcw::yes_type()) Test(U* f);
-      template<class U>
-      static boost_intrusive_hmfcw::no_type Test(...);
-      static const bool value = sizeof(Test<Fun>((Fun*)0)) == sizeof(boost_intrusive_hmfcw::yes_type);
-   };
-
-#else //defined(BOOST_NO_CXX11_VARIADIC_TEMPLATES) || defined(BOOST_NO_CXX11_DECLTYPE)
-
-   /////////////////////////////////////////////////////////
-   /////////////////////////////////////////////////////////
-   //
-   //    has_member_function_callable_with_impl_XXX
-   //    declaration, special case and 0 arg specializaton
-   //
-   /////////////////////////////////////////////////////////
-
-   template <typename Type>
-   class BOOST_MOVE_CAT(has_member_function_named_, BOOST_INTRUSIVE_HAS_MEMBER_FUNCTION_CALLABLE_WITH_FUNCNAME)
-   {
-      struct BaseMixin
-      {
-         void BOOST_INTRUSIVE_HAS_MEMBER_FUNCTION_CALLABLE_WITH_FUNCNAME()
-         {} //Some compilers require the definition or linker errors happen
-      };
-
-      struct Base
-         : public boost_intrusive_hmfcw::remove_cv<Type>::type, public BaseMixin
-      {  //Declare the unneeded default constructor as some old compilers wrongly require it with is_convertible
-         Base(){}
-      };
-      template <typename T, T t> class Helper{};
-
-      template <typename U>
-      static boost_intrusive_hmfcw::no_type  deduce
-         (U*, Helper<void (BaseMixin::*)(), &U::BOOST_INTRUSIVE_HAS_MEMBER_FUNCTION_CALLABLE_WITH_FUNCNAME>* = 0);
-      static boost_intrusive_hmfcw::yes_type deduce(...);
-
-      public:
-      static const bool value = sizeof(boost_intrusive_hmfcw::yes_type) == sizeof(deduce((Base*)0));
-   };
-
-   #if !defined(BOOST_NO_CXX11_VARIADIC_TEMPLATES)
-      /////////////////////////////////////////////////////////
-      /////////////////////////////////////////////////////////
-      //
-      //    has_member_function_callable_with_impl_XXX for 1 to N arguments
-      //
-      /////////////////////////////////////////////////////////
-      /////////////////////////////////////////////////////////
-
-      //defined(BOOST_NO_CXX11_DECLTYPE) must be true
-      template<class Fun>
-      struct FunWrapTmpl : Fun
-      {
-         using Fun::BOOST_INTRUSIVE_HAS_MEMBER_FUNCTION_CALLABLE_WITH_FUNCNAME;
-         FunWrapTmpl();
-         template<class ...DontCares>
-         boost_intrusive_hmfcw::private_type BOOST_INTRUSIVE_HAS_MEMBER_FUNCTION_CALLABLE_WITH_FUNCNAME(DontCares...) const;
-      };
-
-      template<typename Fun, bool HasFunc, class ...Args>
-      struct BOOST_MOVE_CAT(has_member_function_callable_with_impl_, BOOST_INTRUSIVE_HAS_MEMBER_FUNCTION_CALLABLE_WITH_FUNCNAME);
-
-      //No BOOST_INTRUSIVE_HAS_MEMBER_FUNCTION_CALLABLE_WITH_FUNCNAME member specialization
-      template<typename Fun, class ...Args>
-      struct BOOST_MOVE_CAT(has_member_function_callable_with_impl_, BOOST_INTRUSIVE_HAS_MEMBER_FUNCTION_CALLABLE_WITH_FUNCNAME)
-         <Fun, false, Args...>
-      {
-         static const bool value = false;
-      };
-
-      template<typename Fun, class ...Args>
-      struct BOOST_MOVE_CAT(has_member_function_callable_with_impl_,BOOST_INTRUSIVE_HAS_MEMBER_FUNCTION_CALLABLE_WITH_FUNCNAME)<Fun, true, Args...>
-      {
-         static bool const value = (sizeof(boost_intrusive_hmfcw::no_type) == sizeof(boost_intrusive_hmfcw::is_private_type
-                                             ( (::boost::move_detail::declval
-                                                   < FunWrapTmpl<Fun> >().
-                                                   BOOST_INTRUSIVE_HAS_MEMBER_FUNCTION_CALLABLE_WITH_FUNCNAME(::boost::move_detail::declval<Args>()...), 0) )
-                                          )
-                                    );
-      };
-
-      template<typename Fun, class ...Args>
-      struct BOOST_MOVE_CAT(has_member_function_callable_with_, BOOST_INTRUSIVE_HAS_MEMBER_FUNCTION_CALLABLE_WITH_FUNCNAME)
-         : public BOOST_MOVE_CAT(has_member_function_callable_with_impl_, BOOST_INTRUSIVE_HAS_MEMBER_FUNCTION_CALLABLE_WITH_FUNCNAME)
-            <Fun
-            , BOOST_MOVE_CAT(has_member_function_named_, BOOST_INTRUSIVE_HAS_MEMBER_FUNCTION_CALLABLE_WITH_FUNCNAME)<Fun>::value
-            , Args...>
-      {};
-   #else //defined(BOOST_NO_CXX11_VARIADIC_TEMPLATES)
-
-      /////////////////////////////////////////////////////////
-      /////////////////////////////////////////////////////////
-      //
-      //    has_member_function_callable_with_impl_XXX specializations
-      //
-      /////////////////////////////////////////////////////////
-
-      template<typename Fun, bool HasFunc BOOST_INTRUSIVE_HAS_MEMBER_FUNCTION_CALLABLE_WITH_COMMA_IF BOOST_MOVE_CAT(BOOST_MOVE_CLASSDFLT,BOOST_INTRUSIVE_HAS_MEMBER_FUNCTION_CALLABLE_WITH_MAX)>
-      struct BOOST_MOVE_CAT(has_member_function_callable_with_impl_, BOOST_INTRUSIVE_HAS_MEMBER_FUNCTION_CALLABLE_WITH_FUNCNAME);
-
-      //No BOOST_INTRUSIVE_HAS_MEMBER_FUNCTION_CALLABLE_WITH_FUNCNAME member specialization
-      template<typename Fun BOOST_INTRUSIVE_HAS_MEMBER_FUNCTION_CALLABLE_WITH_COMMA_IF BOOST_MOVE_CAT(BOOST_MOVE_CLASS,BOOST_INTRUSIVE_HAS_MEMBER_FUNCTION_CALLABLE_WITH_MAX)>
-      struct BOOST_MOVE_CAT(has_member_function_callable_with_impl_, BOOST_INTRUSIVE_HAS_MEMBER_FUNCTION_CALLABLE_WITH_FUNCNAME)
-         <Fun, false BOOST_INTRUSIVE_HAS_MEMBER_FUNCTION_CALLABLE_WITH_COMMA_IF BOOST_MOVE_CAT(BOOST_MOVE_TARG,BOOST_INTRUSIVE_HAS_MEMBER_FUNCTION_CALLABLE_WITH_MAX)>
-      {
-         static const bool value = false;
-      };
-
-      #if BOOST_INTRUSIVE_HAS_MEMBER_FUNCTION_CALLABLE_WITH_MIN == 0
-         //0 arg specialization when BOOST_INTRUSIVE_HAS_MEMBER_FUNCTION_CALLABLE_WITH_FUNCNAME is present
-         #if !defined(BOOST_NO_CXX11_DECLTYPE)
-
-            template<typename Fun>
-            struct BOOST_MOVE_CAT(has_member_function_callable_with_impl_, BOOST_INTRUSIVE_HAS_MEMBER_FUNCTION_CALLABLE_WITH_FUNCNAME)<Fun, true>
-            {
-               template<class U>
-               static decltype(boost::move_detail::declval<U>().BOOST_INTRUSIVE_HAS_MEMBER_FUNCTION_CALLABLE_WITH_FUNCNAME()
-                  , boost_intrusive_hmfcw::yes_type()) Test(U* f);
-
-               template<class U>
-               static boost_intrusive_hmfcw::no_type Test(...);
-               static const bool value = sizeof(Test<Fun>((Fun*)0)) == sizeof(boost_intrusive_hmfcw::yes_type);
-            };
-
-         #else //defined(BOOST_NO_CXX11_DECLTYPE)
-
-            #if !defined(BOOST_INTRUSIVE_DETAIL_HAS_MEMBER_FUNCTION_CALLABLE_WITH_0_ARGS_UNSUPPORTED)
-
-               template<class F, std::size_t N = sizeof(boost::move_detail::declval<F>().BOOST_INTRUSIVE_HAS_MEMBER_FUNCTION_CALLABLE_WITH_FUNCNAME(), 0)>
-               struct BOOST_MOVE_CAT(zeroarg_checker_, BOOST_INTRUSIVE_HAS_MEMBER_FUNCTION_CALLABLE_WITH_FUNCNAME)
-               {  boost_intrusive_hmfcw::yes_type dummy[N ? 1 : 2];   };
-
-               template<typename Fun>
-               struct BOOST_MOVE_CAT(has_member_function_callable_with_impl_, BOOST_INTRUSIVE_HAS_MEMBER_FUNCTION_CALLABLE_WITH_FUNCNAME)<Fun, true>
-               {
-                  template<class U> static BOOST_MOVE_CAT(zeroarg_checker_, BOOST_INTRUSIVE_HAS_MEMBER_FUNCTION_CALLABLE_WITH_FUNCNAME)<U>
-                     Test(BOOST_MOVE_CAT(zeroarg_checker_, BOOST_INTRUSIVE_HAS_MEMBER_FUNCTION_CALLABLE_WITH_FUNCNAME)<U>*);
-                  template<class U> static boost_intrusive_hmfcw::no_type Test(...);
-                  static const bool value = sizeof(Test< Fun >(0)) == sizeof(boost_intrusive_hmfcw::yes_type);
-               };
-
-            #else //defined(BOOST_INTRUSIVE_DETAIL_HAS_MEMBER_FUNCTION_CALLABLE_WITH_0_ARGS_UNSUPPORTED)
-
-               template<typename Fun>
-               struct BOOST_MOVE_CAT(has_member_function_callable_with_impl_, BOOST_INTRUSIVE_HAS_MEMBER_FUNCTION_CALLABLE_WITH_FUNCNAME)<Fun, true>
-               {  //Some compilers gives ICE when instantiating the 0 arg version so it is not supported.
-                  static const bool value = true;
-               };
-
-            #endif//!defined(BOOST_INTRUSIVE_DETAIL_HAS_MEMBER_FUNCTION_CALLABLE_WITH_0_ARGS_UNSUPPORTED)
-         #endif   //!defined(BOOST_NO_CXX11_DECLTYPE)
-      #endif   //#if BOOST_INTRUSIVE_HAS_MEMBER_FUNCTION_CALLABLE_WITH_MIN == 0
-
-      #if BOOST_INTRUSIVE_HAS_MEMBER_FUNCTION_CALLABLE_WITH_MAX > 0
-         //1 to N arg specialization when BOOST_INTRUSIVE_HAS_MEMBER_FUNCTION_CALLABLE_WITH_FUNCNAME is present
-         //Declare some unneeded default constructor as some old compilers wrongly require it with is_convertible
-         #if defined(BOOST_NO_CXX11_DECLTYPE)
-            #define BOOST_INTRUSIVE_HAS_MEMBER_FUNCTION_CALLABLE_WITH_ITERATION(N)\
-            \
-            template<class Fun>\
-            struct BOOST_MOVE_CAT(FunWrap##N, BOOST_INTRUSIVE_HAS_MEMBER_FUNCTION_CALLABLE_WITH_FUNCNAME)\
-               : Fun\
-            {\
-               using Fun::BOOST_INTRUSIVE_HAS_MEMBER_FUNCTION_CALLABLE_WITH_FUNCNAME;\
-               BOOST_MOVE_CAT(FunWrap##N, BOOST_INTRUSIVE_HAS_MEMBER_FUNCTION_CALLABLE_WITH_FUNCNAME)();\
-               boost_intrusive_hmfcw::private_type BOOST_INTRUSIVE_HAS_MEMBER_FUNCTION_CALLABLE_WITH_FUNCNAME\
-                  (BOOST_MOVE_REPEAT##N(boost_intrusive_hmfcw::dont_care)) const;\
-            };\
-            \
-            template<typename Fun, BOOST_MOVE_CLASS##N>\
-            struct BOOST_MOVE_CAT(has_member_function_callable_with_impl_, BOOST_INTRUSIVE_HAS_MEMBER_FUNCTION_CALLABLE_WITH_FUNCNAME)<Fun, true, BOOST_MOVE_TARG##N>\
-            {\
-               static bool const value = (sizeof(boost_intrusive_hmfcw::no_type) == sizeof(boost_intrusive_hmfcw::is_private_type\
-                                                   ( (::boost::move_detail::declval\
-                                                         < BOOST_MOVE_CAT(FunWrap##N, BOOST_INTRUSIVE_HAS_MEMBER_FUNCTION_CALLABLE_WITH_FUNCNAME)<Fun> >().\
-                                                      BOOST_INTRUSIVE_HAS_MEMBER_FUNCTION_CALLABLE_WITH_FUNCNAME(BOOST_MOVE_DECLVAL##N), 0) )\
-                                                )\
-                                          );\
-            };\
-            //
-         #else
-            #define BOOST_INTRUSIVE_HAS_MEMBER_FUNCTION_CALLABLE_WITH_ITERATION(N)\
-            template<typename Fun, BOOST_MOVE_CLASS##N>\
-            struct BOOST_MOVE_CAT(has_member_function_callable_with_impl_, BOOST_INTRUSIVE_HAS_MEMBER_FUNCTION_CALLABLE_WITH_FUNCNAME)\
-               <Fun, true, BOOST_MOVE_TARG##N>\
-            {\
-               template<class U>\
-               static decltype(boost::move_detail::declval<U>().\
-                  BOOST_INTRUSIVE_HAS_MEMBER_FUNCTION_CALLABLE_WITH_FUNCNAME(BOOST_MOVE_DECLVAL##N)\
-                     , boost_intrusive_hmfcw::yes_type()) Test(U* f);\
-               template<class U>\
-               static boost_intrusive_hmfcw::no_type Test(...);\
-               static const bool value = sizeof(Test<Fun>((Fun*)0)) == sizeof(boost_intrusive_hmfcw::yes_type);\
-            };\
-            //
-         #endif
-         ////////////////////////////////////
-         // Build and invoke BOOST_MOVE_ITERATE_NTOM macrofunction, note that N has to be at least 1
-         ////////////////////////////////////
-         #if BOOST_INTRUSIVE_HAS_MEMBER_FUNCTION_CALLABLE_WITH_MIN == 0
-            #define BOOST_INTRUSIVE_HAS_MEMBER_FUNCTION_CALLABLE_WITH_ITERATE_MIN 1
-         #else
-            #define BOOST_INTRUSIVE_HAS_MEMBER_FUNCTION_CALLABLE_WITH_ITERATE_MIN BOOST_INTRUSIVE_HAS_MEMBER_FUNCTION_CALLABLE_WITH_MIN
-         #endif
-         BOOST_MOVE_CAT
-            (BOOST_MOVE_CAT(BOOST_MOVE_CAT(BOOST_MOVE_ITERATE_, BOOST_INTRUSIVE_HAS_MEMBER_FUNCTION_CALLABLE_WITH_ITERATE_MIN), TO)
-            ,BOOST_INTRUSIVE_HAS_MEMBER_FUNCTION_CALLABLE_WITH_MAX)
-               (BOOST_INTRUSIVE_HAS_MEMBER_FUNCTION_CALLABLE_WITH_ITERATION)
-         #undef BOOST_INTRUSIVE_HAS_MEMBER_FUNCTION_CALLABLE_WITH_ITERATION
-         #undef BOOST_INTRUSIVE_HAS_MEMBER_FUNCTION_CALLABLE_WITH_ITERATE_MIN
-         ////////////////////////////////////
-         // End of BOOST_MOVE_ITERATE_NTOM
-         ////////////////////////////////////
-      #endif   //BOOST_INTRUSIVE_HAS_MEMBER_FUNCTION_CALLABLE_WITH_MAX > 0
-
-      /////////////////////////////////////////////////////////
-      /////////////////////////////////////////////////////////
-      //
-      //       has_member_function_callable_with_FUNC
-      //
-      /////////////////////////////////////////////////////////
-      /////////////////////////////////////////////////////////
-
-      //Otherwise use the preprocessor
-      template<typename Fun BOOST_INTRUSIVE_HAS_MEMBER_FUNCTION_CALLABLE_WITH_COMMA_IF BOOST_MOVE_CAT(BOOST_MOVE_CLASSDFLT,BOOST_INTRUSIVE_HAS_MEMBER_FUNCTION_CALLABLE_WITH_MAX)>
-      struct BOOST_MOVE_CAT(has_member_function_callable_with_, BOOST_INTRUSIVE_HAS_MEMBER_FUNCTION_CALLABLE_WITH_FUNCNAME)
-         : public BOOST_MOVE_CAT(has_member_function_callable_with_impl_, BOOST_INTRUSIVE_HAS_MEMBER_FUNCTION_CALLABLE_WITH_FUNCNAME)
-            <Fun
-            , BOOST_MOVE_CAT(has_member_function_named_, BOOST_INTRUSIVE_HAS_MEMBER_FUNCTION_CALLABLE_WITH_FUNCNAME)<Fun>::value
-            BOOST_INTRUSIVE_HAS_MEMBER_FUNCTION_CALLABLE_WITH_COMMA_IF BOOST_MOVE_CAT(BOOST_MOVE_TARG,BOOST_INTRUSIVE_HAS_MEMBER_FUNCTION_CALLABLE_WITH_MAX)>
-      {};
-   #endif   //defined(BOOST_NO_CXX11_VARIADIC_TEMPLATES)
-#endif
-
-BOOST_INTRUSIVE_HAS_MEMBER_FUNCTION_CALLABLE_WITH_NS_END
-
-//Undef local macros
-#undef BOOST_INTRUSIVE_HAS_MEMBER_FUNCTION_CALLABLE_WITH_COMMA_IF
-
-//Undef user defined macros
-#undef BOOST_INTRUSIVE_HAS_MEMBER_FUNCTION_CALLABLE_WITH_FUNCNAME
-#undef BOOST_INTRUSIVE_HAS_MEMBER_FUNCTION_CALLABLE_WITH_MIN
-#undef BOOST_INTRUSIVE_HAS_MEMBER_FUNCTION_CALLABLE_WITH_MAX
-#undef BOOST_INTRUSIVE_HAS_MEMBER_FUNCTION_CALLABLE_WITH_NS_BEG
-#undef BOOST_INTRUSIVE_HAS_MEMBER_FUNCTION_CALLABLE_WITH_NS_END
diff --git a/src/boost/intrusive/detail/hash_combine.hpp b/src/boost/intrusive/detail/hash_combine.hpp
deleted file mode 100644
index f089fb0c..00000000
--- a/src/boost/intrusive/detail/hash_combine.hpp
+++ /dev/null
@@ -1,92 +0,0 @@
-// Copyright 2005-2014 Daniel James.
-// Distributed under the Boost Software License, Version 1.0. (See accompanying
-// file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
-//
-//  Based on Peter Dimov's proposal
-//  http://www.open-std.org/JTC1/SC22/WG21/docs/papers/2005/n1756.pdf
-//  issue 6.18.
-//
-//  This also contains public domain code from MurmurHash. From the
-//  MurmurHash header:
-//
-// MurmurHash3 was written by Austin Appleby, and is placed in the public
-// domain. The author hereby disclaims copyright to this source code.
-//
-// Copyright 2021 Ion Gaztanaga
-// Refactored the original boost/container_hash/hash.hpp to avoid
-// any heavy std header dependencies to just combine two hash
-// values represented in a std::size_t type.
-
-#ifndef BOOST_INTRUSIVE_DETAIL_HASH_COMBINE_HPP
-#define BOOST_INTRUSIVE_DETAIL_HASH_COMBINE_HPP
-
-#ifndef BOOST_CONFIG_HPP
-#  include <boost/config.hpp>
-#endif
-
-#if defined(BOOST_HAS_PRAGMA_ONCE)
-#  pragma once
-#endif
-
-#include <boost/cstdint.hpp>
-
-#if defined(_MSC_VER)
-#  include <stdlib.h>
-#  define BOOST_INTRUSIVE_HASH_ROTL32(x, r) _rotl(x,r)
-#else
-#  define BOOST_INTRUSIVE_HASH_ROTL32(x, r) (x << r) | (x >> (32 - r))
-#endif
-
-namespace boost {
-namespace intrusive {
-namespace detail {
-
-template <typename SizeT>
-inline void hash_combine_size_t(SizeT& seed, SizeT value)
-{
-   seed ^= value + 0x9e3779b9 + (seed<<6) + (seed>>2);
-}
-
-inline void hash_combine_size_t(boost::uint32_t& h1, boost::uint32_t k1)
-{
-   const uint32_t c1 = 0xcc9e2d51;
-   const uint32_t c2 = 0x1b873593;
-
-   k1 *= c1;
-   k1 = BOOST_INTRUSIVE_HASH_ROTL32(k1,15);
-   k1 *= c2;
-
-   h1 ^= k1;
-   h1 = BOOST_INTRUSIVE_HASH_ROTL32(h1,13);
-   h1 = h1*5+0xe6546b64;
-}
-
-
-   // Don't define 64-bit hash combine on platforms without 64 bit integers,
-   // and also not for 32-bit gcc as it warns about the 64-bit constant.
-   #if !defined(BOOST_NO_INT64_T) && \
-       !(defined(__GNUC__) && ULONG_MAX == 0xffffffff)
-   inline void hash_combine_size_t(boost::uint64_t& h, boost::uint64_t k)
-   {
-      const boost::uint64_t m = UINT64_C(0xc6a4a7935bd1e995);
-      const int r = 47;
-
-      k *= m;
-      k ^= k >> r;
-      k *= m;
-
-      h ^= k;
-      h *= m;
-
-      // Completely arbitrary number, to prevent 0's
-      // from hashing to 0.
-      h += 0xe6546b64;
-   }
-
-   #endif // BOOST_NO_INT64_T
-
-}  //namespace detail {
-}  //namespace intrusive {
-}  //namespace boost {
-
-#endif   //BOOST_INTRUSIVE_DETAIL_HASH_COMBINE_HPP
diff --git a/src/boost/intrusive/detail/hook_traits.hpp b/src/boost/intrusive/detail/hook_traits.hpp
deleted file mode 100644
index 06713487..00000000
--- a/src/boost/intrusive/detail/hook_traits.hpp
+++ /dev/null
@@ -1,196 +0,0 @@
-/////////////////////////////////////////////////////////////////////////////
-//
-// (C) Copyright Ion Gaztanaga  2006-2014
-//
-// Distributed under the Boost 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/intrusive for documentation.
-//
-/////////////////////////////////////////////////////////////////////////////
-
-#ifndef BOOST_INTRUSIVE_DETAIL_HOOK_TRAITS_HPP
-#define BOOST_INTRUSIVE_DETAIL_HOOK_TRAITS_HPP
-
-#ifndef BOOST_CONFIG_HPP
-#  include <boost/config.hpp>
-#endif
-
-#if defined(BOOST_HAS_PRAGMA_ONCE)
-#  pragma once
-#endif
-
-#include <boost/intrusive/detail/workaround.hpp>
-#include <boost/intrusive/pointer_traits.hpp>
-#include <boost/intrusive/detail/parent_from_member.hpp>
-#include <boost/intrusive/link_mode.hpp>
-#include <boost/intrusive/detail/mpl.hpp>
-#include <boost/move/detail/to_raw_pointer.hpp>
-#include <boost/intrusive/detail/node_holder.hpp>
-#include <boost/assert.hpp>
-
-namespace boost {
-namespace intrusive {
-
-template<class T, class NodePtr, class Tag, unsigned int Type>
-struct bhtraits_base
-{
-   public:
-   typedef NodePtr                                                   node_ptr;
-   typedef typename pointer_traits<node_ptr>::element_type           node;
-   typedef node_holder<node, Tag, Type>                              node_holder_type;
-   typedef T                                                         value_type;
-   typedef typename pointer_traits<node_ptr>::
-      template rebind_pointer<const node>::type                      const_node_ptr;
-   typedef typename pointer_traits<node_ptr>::
-      template rebind_pointer<T>::type                               pointer;
-   typedef typename pointer_traits<node_ptr>::
-      template rebind_pointer<const T>::type                         const_pointer;
-   //typedef typename pointer_traits<pointer>::reference               reference;
-   //typedef typename pointer_traits<const_pointer>::reference         const_reference;
-   typedef T &                                                       reference;
-   typedef const T &                                                 const_reference;
-   typedef node_holder_type &                                        node_holder_reference;
-   typedef const node_holder_type &                                  const_node_holder_reference;
-   typedef node&                                                     node_reference;
-   typedef const node &                                              const_node_reference;
-
-   BOOST_INTRUSIVE_FORCEINLINE static pointer to_value_ptr(node_ptr n)
-   {
-      pointer p = pointer_traits<pointer>::pointer_to
-         (static_cast<reference>(static_cast<node_holder_reference>(*n)));
-      BOOST_ASSERT(!!p);
-      return p;
-   }
-
-   BOOST_INTRUSIVE_FORCEINLINE static const_pointer to_value_ptr(const_node_ptr n)
-   {
-      const_pointer p = pointer_traits<const_pointer>::pointer_to
-         (static_cast<const_reference>(static_cast<const_node_holder_reference>(*n)));
-      BOOST_ASSERT(!!p);
-      return p;
-   }
-
-   BOOST_INTRUSIVE_FORCEINLINE static node_ptr to_node_ptr(reference value)
-   {
-      node_ptr p = pointer_traits<node_ptr>::pointer_to
-         (static_cast<node_reference>(static_cast<node_holder_reference>(value)));
-      BOOST_ASSERT(!!p);
-      return p;
-   }
-
-   BOOST_INTRUSIVE_FORCEINLINE static const_node_ptr to_node_ptr(const_reference value)
-   {
-      const_node_ptr p = pointer_traits<const_node_ptr>::pointer_to
-         (static_cast<const_node_reference>(static_cast<const_node_holder_reference>(value)));
-      BOOST_ASSERT(!!p);
-      return p;
-   }
-};
-
-template<class T, class NodeTraits, link_mode_type LinkMode, class Tag, unsigned int Type>
-struct bhtraits
-   : public bhtraits_base<T, typename NodeTraits::node_ptr, Tag, Type>
-{
-   static const link_mode_type link_mode = LinkMode;
-   typedef NodeTraits node_traits;
-};
-
-
-template<class T, class Hook, Hook T::* P>
-struct mhtraits
-{
-   public:
-   typedef Hook                                                      hook_type;
-   typedef typename hook_type::hooktags::node_traits                 node_traits;
-   typedef typename node_traits::node                                node;
-   typedef T                                                         value_type;
-   typedef typename node_traits::node_ptr                            node_ptr;
-   typedef typename node_traits::const_node_ptr                      const_node_ptr;
-   typedef typename pointer_traits<node_ptr>::
-      template rebind_pointer<T>::type                               pointer;
-   typedef typename pointer_traits<node_ptr>::
-      template rebind_pointer<const T>::type                         const_pointer;
-   typedef T &                                                       reference;
-   typedef const T &                                                 const_reference;
-   typedef node&                                                     node_reference;
-   typedef const node &                                              const_node_reference;
-   typedef hook_type&                                                hook_reference;
-   typedef const hook_type &                                         const_hook_reference;
-
-   static const link_mode_type link_mode = Hook::hooktags::link_mode;
-
-   BOOST_INTRUSIVE_FORCEINLINE static node_ptr to_node_ptr(reference value)
-   {
-      return pointer_traits<node_ptr>::pointer_to
-         (static_cast<node_reference>(static_cast<hook_reference>(value.*P)));
-   }
-
-   BOOST_INTRUSIVE_FORCEINLINE static const_node_ptr to_node_ptr(const_reference value)
-   {
-      return pointer_traits<const_node_ptr>::pointer_to
-         (static_cast<const_node_reference>(static_cast<const_hook_reference>(value.*P)));
-   }
-
-   BOOST_INTRUSIVE_FORCEINLINE static pointer to_value_ptr(node_ptr n)
-   {
-      return pointer_traits<pointer>::pointer_to
-         (*detail::parent_from_member<T, Hook>
-            (static_cast<Hook*>(boost::movelib::to_raw_pointer(n)), P));
-   }
-
-   BOOST_INTRUSIVE_FORCEINLINE static const_pointer to_value_ptr(const_node_ptr n)
-   {
-      return pointer_traits<const_pointer>::pointer_to
-         (*detail::parent_from_member<T, Hook>
-            (static_cast<const Hook*>(boost::movelib::to_raw_pointer(n)), P));
-   }
-};
-
-
-template<class Functor>
-struct fhtraits
-{
-   public:
-   typedef typename Functor::hook_type                               hook_type;
-   typedef typename Functor::hook_ptr                                hook_ptr;
-   typedef typename Functor::const_hook_ptr                          const_hook_ptr;
-   typedef typename hook_type::hooktags::node_traits                 node_traits;
-   typedef typename node_traits::node                                node;
-   typedef typename Functor::value_type                              value_type;
-   typedef typename node_traits::node_ptr                            node_ptr;
-   typedef typename node_traits::const_node_ptr                      const_node_ptr;
-   typedef typename pointer_traits<node_ptr>::
-      template rebind_pointer<value_type>::type                      pointer;
-   typedef typename pointer_traits<node_ptr>::
-      template rebind_pointer<const value_type>::type                const_pointer;
-   typedef value_type &                                              reference;
-   typedef const value_type &                                        const_reference;
-   static const link_mode_type link_mode = hook_type::hooktags::link_mode;
-
-   static node_ptr to_node_ptr(reference value)
-   {  return static_cast<node*>(boost::movelib::to_raw_pointer(Functor::to_hook_ptr(value)));  }
-
-   static const_node_ptr to_node_ptr(const_reference value)
-   {  return static_cast<const node*>(boost::movelib::to_raw_pointer(Functor::to_hook_ptr(value)));  }
-
-   static pointer to_value_ptr(node_ptr n)
-   {  return Functor::to_value_ptr(to_hook_ptr(n));  }
-
-   static const_pointer to_value_ptr(const_node_ptr n)
-   {  return Functor::to_value_ptr(to_hook_ptr(n));  }
-
-   private:
-   static hook_ptr to_hook_ptr(node_ptr n)
-   {  return hook_ptr(&*static_cast<hook_type*>(&*n));  }
-
-   static const_hook_ptr to_hook_ptr(const_node_ptr n)
-   {  return const_hook_ptr(&*static_cast<const hook_type*>(&*n));  }
-};
-
-
-} //namespace intrusive
-} //namespace boost
-
-#endif //BOOST_INTRUSIVE_DETAIL_HOOK_TRAITS_HPP
diff --git a/src/boost/intrusive/detail/iiterator.hpp b/src/boost/intrusive/detail/iiterator.hpp
deleted file mode 100644
index 5ab1de2b..00000000
--- a/src/boost/intrusive/detail/iiterator.hpp
+++ /dev/null
@@ -1,122 +0,0 @@
-/////////////////////////////////////////////////////////////////////////////
-//
-// (C) Copyright Ion Gaztanaga  2006-2014
-//
-// Distributed under the Boost 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/intrusive for documentation.
-//
-/////////////////////////////////////////////////////////////////////////////
-
-#ifndef BOOST_INTRUSIVE_DETAIL_IITERATOR_HPP
-#define BOOST_INTRUSIVE_DETAIL_IITERATOR_HPP
-
-#ifndef BOOST_CONFIG_HPP
-#  include <boost/config.hpp>
-#endif
-
-#if defined(BOOST_HAS_PRAGMA_ONCE)
-#  pragma once
-#endif
-
-#include <boost/intrusive/detail/workaround.hpp>
-#include <boost/intrusive/detail/iterator.hpp>
-#include <boost/intrusive/pointer_traits.hpp>
-#include <boost/intrusive/detail/mpl.hpp>
-#include <boost/intrusive/detail/is_stateful_value_traits.hpp>
-
-namespace boost {
-namespace intrusive {
-
-template<class ValueTraits>
-struct value_traits_pointers
-{
-   typedef BOOST_INTRUSIVE_OBTAIN_TYPE_WITH_DEFAULT
-      (boost::intrusive::detail::
-      , ValueTraits, value_traits_ptr
-      , typename boost::intrusive::pointer_traits<typename ValueTraits::node_traits::node_ptr>::template
-         rebind_pointer<ValueTraits>::type)   value_traits_ptr;
-
-   typedef typename boost::intrusive::pointer_traits<value_traits_ptr>::template
-      rebind_pointer<ValueTraits const>::type const_value_traits_ptr;
-};
-
-template<class ValueTraits, bool IsConst, class Category>
-struct iiterator
-{
-   typedef ValueTraits                                         value_traits;
-   typedef typename value_traits::node_traits                  node_traits;
-   typedef typename node_traits::node                          node;
-   typedef typename node_traits::node_ptr                      node_ptr;
-   typedef ::boost::intrusive::pointer_traits<node_ptr>        nodepointer_traits_t;
-   typedef typename nodepointer_traits_t::template
-      rebind_pointer<void>::type                               void_pointer;
-   typedef typename ValueTraits::value_type                    value_type;
-   typedef typename ValueTraits::pointer                       nonconst_pointer;
-   typedef typename ValueTraits::const_pointer                 yesconst_pointer;
-   typedef typename ::boost::intrusive::pointer_traits
-      <nonconst_pointer>::reference                            nonconst_reference;
-   typedef typename ::boost::intrusive::pointer_traits
-      <yesconst_pointer>::reference                            yesconst_reference;
-   typedef typename nodepointer_traits_t::difference_type      difference_type;
-   typedef typename detail::if_c
-      <IsConst, yesconst_pointer, nonconst_pointer>::type      pointer;
-   typedef typename detail::if_c
-      <IsConst, yesconst_reference, nonconst_reference>::type  reference;
-   typedef iterator
-         < Category
-         , value_type
-         , difference_type
-         , pointer
-         , reference
-         > iterator_type;
-   typedef typename value_traits_pointers
-      <ValueTraits>::value_traits_ptr                          value_traits_ptr;
-   typedef typename value_traits_pointers
-      <ValueTraits>::const_value_traits_ptr                    const_value_traits_ptr;
-   static const bool stateful_value_traits =
-      detail::is_stateful_value_traits<value_traits>::value;
-};
-
-template<class NodePtr, class StoredPointer, bool StatefulValueTraits = true>
-struct iiterator_members
-{
-
-   BOOST_INTRUSIVE_FORCEINLINE iiterator_members()
-      : nodeptr_()//Value initialization to achieve "null iterators" (N3644)
-   {}
-
-   BOOST_INTRUSIVE_FORCEINLINE iiterator_members(const NodePtr &n_ptr, const StoredPointer &data)
-      :  nodeptr_(n_ptr), ptr_(data)
-   {}
-
-   BOOST_INTRUSIVE_FORCEINLINE StoredPointer get_ptr() const
-   {  return ptr_;  }
-
-   NodePtr nodeptr_;
-   StoredPointer ptr_;
-};
-
-template<class NodePtr, class StoredPointer>
-struct iiterator_members<NodePtr, StoredPointer, false>
-{
-   BOOST_INTRUSIVE_FORCEINLINE iiterator_members()
-      : nodeptr_()//Value initialization to achieve "null iterators" (N3644)
-   {}
-
-   BOOST_INTRUSIVE_FORCEINLINE iiterator_members(const NodePtr &n_ptr, const StoredPointer &)
-      : nodeptr_(n_ptr)
-   {}
-
-   BOOST_INTRUSIVE_FORCEINLINE StoredPointer get_ptr() const
-   {  return StoredPointer();  }
-
-   NodePtr nodeptr_;
-};
-
-} //namespace intrusive
-} //namespace boost
-
-#endif //BOOST_INTRUSIVE_DETAIL_IITERATOR_HPP
diff --git a/src/boost/intrusive/detail/is_stateful_value_traits.hpp b/src/boost/intrusive/detail/is_stateful_value_traits.hpp
deleted file mode 100644
index e43f6d34..00000000
--- a/src/boost/intrusive/detail/is_stateful_value_traits.hpp
+++ /dev/null
@@ -1,81 +0,0 @@
-/////////////////////////////////////////////////////////////////////////////
-//
-// (C) Copyright Ion Gaztanaga  2009-2013.
-//
-// Distributed under the Boost 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/intrusive for documentation.
-//
-/////////////////////////////////////////////////////////////////////////////
-
-#ifndef BOOST_INTRUSIVE_DETAIL_IS_STATEFUL_VALUE_TRAITS_HPP
-#define BOOST_INTRUSIVE_DETAIL_IS_STATEFUL_VALUE_TRAITS_HPP
-
-#ifndef BOOST_CONFIG_HPP
-#  include <boost/config.hpp>
-#endif
-
-#if defined(BOOST_HAS_PRAGMA_ONCE)
-#  pragma once
-#endif
-
-#if defined(_MSC_VER) && (_MSC_VER <= 1310)
-
-#include <boost/intrusive/detail/mpl.hpp>
-
-namespace boost {
-namespace intrusive {
-namespace detail {
-
-template<class ValueTraits>
-struct is_stateful_value_traits
-{
-   static const bool value = !detail::is_empty<ValueTraits>::value;
-};
-
-}}}
-
-#else
-
-#include <boost/intrusive/detail/function_detector.hpp>
-
-BOOST_INTRUSIVE_CREATE_FUNCTION_DETECTOR(to_node_ptr, boost_intrusive)
-BOOST_INTRUSIVE_CREATE_FUNCTION_DETECTOR(to_value_ptr, boost_intrusive)
-
-namespace boost {
-namespace intrusive {
-namespace detail {
-
-template<class ValueTraits>
-struct is_stateful_value_traits
-{
-   typedef typename ValueTraits::node_ptr       node_ptr;
-   typedef typename ValueTraits::pointer        pointer;
-   typedef typename ValueTraits::value_type     value_type;
-   typedef typename ValueTraits::const_node_ptr const_node_ptr;
-   typedef typename ValueTraits::const_pointer  const_pointer;
-
-   typedef ValueTraits value_traits;
-
-   static const bool value =
-      (boost::intrusive::function_detector::NonStaticFunction ==
-         (BOOST_INTRUSIVE_DETECT_FUNCTION(ValueTraits, boost_intrusive, node_ptr, to_node_ptr, (value_type&) )))
-      ||
-      (boost::intrusive::function_detector::NonStaticFunction ==
-         (BOOST_INTRUSIVE_DETECT_FUNCTION(ValueTraits, boost_intrusive, pointer, to_value_ptr, (node_ptr) )))
-      ||
-      (boost::intrusive::function_detector::NonStaticFunction ==
-         (BOOST_INTRUSIVE_DETECT_FUNCTION(ValueTraits, boost_intrusive, const_node_ptr, to_node_ptr, (const value_type&) )))
-      ||
-      (boost::intrusive::function_detector::NonStaticFunction ==
-         (BOOST_INTRUSIVE_DETECT_FUNCTION(ValueTraits, boost_intrusive, const_pointer, to_value_ptr, (const_node_ptr) )))
-      ;
-};
-
-}}}
-
-#endif
-
-#endif   //@ifndef BOOST_INTRUSIVE_DETAIL_IS_STATEFUL_VALUE_TRAITS_HPP
diff --git a/src/boost/intrusive/detail/iterator.hpp b/src/boost/intrusive/detail/iterator.hpp
deleted file mode 100644
index ec91cd4f..00000000
--- a/src/boost/intrusive/detail/iterator.hpp
+++ /dev/null
@@ -1,308 +0,0 @@
-/////////////////////////////////////////////////////////////////////////////
-//
-// (C) Copyright Ion Gaztanaga  2014-2014
-//
-// Distributed under the Boost 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/intrusive for documentation.
-//
-/////////////////////////////////////////////////////////////////////////////
-
-#ifndef BOOST_INTRUSIVE_DETAIL_ITERATOR_HPP
-#define BOOST_INTRUSIVE_DETAIL_ITERATOR_HPP
-
-#ifndef BOOST_CONFIG_HPP
-#  include <boost/config.hpp>
-#endif
-
-#if defined(BOOST_HAS_PRAGMA_ONCE)
-#  pragma once
-#endif
-
-#include <cstddef>
-#include <boost/intrusive/detail/std_fwd.hpp>
-#include <boost/intrusive/detail/workaround.hpp>
-#include <boost/move/detail/iterator_traits.hpp>
-#include <boost/move/detail/meta_utils_core.hpp>
-
-namespace boost{
-namespace iterators{
-
-struct incrementable_traversal_tag;
-struct single_pass_traversal_tag;
-struct forward_traversal_tag;
-struct bidirectional_traversal_tag;
-struct random_access_traversal_tag;
-
-namespace detail{
-
-template <class Category, class Traversal>
-struct iterator_category_with_traversal;
-
-} //namespace boost{
-} //namespace iterators{
-} //namespace detail{
-
-namespace boost {
-namespace intrusive {
-
-using boost::movelib::iterator_traits;
-using boost::movelib::iter_difference;
-using boost::movelib::iter_value;
-using boost::movelib::iter_category;
-using boost::movelib::iter_size;
-
-
-////////////////////
-//    iterator
-////////////////////
-template<class Category, class T, class Difference, class Pointer, class Reference>
-struct iterator
-{
-   typedef Category     iterator_category;
-   typedef T            value_type;
-   typedef Difference   difference_type;
-   typedef Pointer      pointer;
-   typedef Reference    reference;
-};
-
-////////////////////////////////////////////////////////////////////////////////
-//    Conversion from boost::iterator traversals to std tags
-////////////////////////////////////////////////////////////////////////////////
-
-template<class Tag>
-struct get_std_category_from_tag
-{
-   typedef Tag type;
-};
-
-template <class Category>
-struct get_std_category_from_tag
-   <boost::iterators::detail::iterator_category_with_traversal
-      <Category, boost::iterators::incrementable_traversal_tag> >
-{
-   typedef std::input_iterator_tag type;
-};
-
-template <class Category>
-struct get_std_category_from_tag
-   <boost::iterators::detail::iterator_category_with_traversal
-      <Category, boost::iterators::single_pass_traversal_tag> >
-{
-   typedef std::input_iterator_tag type;
-};
-
-template <class Category>
-struct get_std_category_from_tag
-   <boost::iterators::detail::iterator_category_with_traversal
-      <Category, boost::iterators::forward_traversal_tag> >
-{
-   typedef std::input_iterator_tag type;
-};
-
-template <class Category>
-struct get_std_category_from_tag
-   <boost::iterators::detail::iterator_category_with_traversal
-      <Category, boost::iterators::bidirectional_traversal_tag> >
-{
-   typedef std::bidirectional_iterator_tag type;
-};
-
-template <class Category>
-struct get_std_category_from_tag
-   <boost::iterators::detail::iterator_category_with_traversal
-      <Category, boost::iterators::random_access_traversal_tag> >
-{
-   typedef std::random_access_iterator_tag type;
-};
-
-template<class It>
-struct get_std_category_from_it
-   : get_std_category_from_tag< typename boost::intrusive::iter_category<It>::type >
-{};
-
-////////////////////////////////////////
-//    iterator_[dis|en]able_if_tag
-////////////////////////////////////////
-template<class I, class Tag, class R = void>
-struct iterator_enable_if_tag
-   : ::boost::move_detail::enable_if_c
-      < ::boost::move_detail::is_same
-         < typename get_std_category_from_it<I>::type
-         , Tag
-         >::value
-         , R>
-{};
-
-template<class I, class Tag, class R = void>
-struct iterator_disable_if_tag
-   : ::boost::move_detail::enable_if_c
-      < !::boost::move_detail::is_same
-         < typename get_std_category_from_it<I>::type
-         , Tag
-         >::value
-         , R>
-{};
-
-////////////////////////////////////////
-//    iterator_[dis|en]able_if_tag
-////////////////////////////////////////
-template<class I, class Tag, class Tag2, class R = void>
-struct iterator_enable_if_convertible_tag
-   : ::boost::move_detail::enable_if_c
-      < ::boost::move_detail::is_same_or_convertible
-         < typename get_std_category_from_it<I>::type
-         , Tag
-         >::value &&
-        !::boost::move_detail::is_same_or_convertible
-         < typename get_std_category_from_it<I>::type
-         , Tag2
-         >::value
-         , R>
-{};
-
-////////////////////////////////////////
-//    iterator_[dis|en]able_if_tag_difference_type
-////////////////////////////////////////
-template<class I, class Tag>
-struct iterator_enable_if_tag_difference_type
-   : iterator_enable_if_tag<I, Tag, typename boost::intrusive::iter_difference<I>::type>
-{};
-
-template<class I, class Tag>
-struct iterator_disable_if_tag_difference_type
-   : iterator_disable_if_tag<I, Tag, typename boost::intrusive::iter_difference<I>::type>
-{};
-
-////////////////////
-//    advance
-////////////////////
-
-template<class InputIt>
-BOOST_INTRUSIVE_FORCEINLINE typename iterator_enable_if_tag<InputIt, std::input_iterator_tag>::type
-   iterator_advance(InputIt& it, typename iter_difference<InputIt>::type n)
-{
-   while(n--)
-      ++it;
-}
-
-template<class InputIt>
-typename iterator_enable_if_tag<InputIt, std::forward_iterator_tag>::type
-   iterator_advance(InputIt& it, typename iter_difference<InputIt>::type n)
-{
-   while(n--)
-      ++it;
-}
-
-template<class InputIt>
-BOOST_INTRUSIVE_FORCEINLINE typename iterator_enable_if_tag<InputIt, std::bidirectional_iterator_tag>::type
-   iterator_advance(InputIt& it, typename iter_difference<InputIt>::type n)
-{
-   for (; 0 < n; --n)
-      ++it;
-   for (; n < 0; ++n)
-      --it;
-}
-
-template<class InputIt, class Distance>
-BOOST_INTRUSIVE_FORCEINLINE typename iterator_enable_if_tag<InputIt, std::random_access_iterator_tag>::type
-   iterator_advance(InputIt& it, Distance n)
-{
-   it += n;
-}
-
-template<class InputIt, class Distance>
-BOOST_INTRUSIVE_FORCEINLINE typename iterator_enable_if_tag<InputIt, std::random_access_iterator_tag, InputIt>::type
-   make_iterator_advance(InputIt it, Distance n)
-{
-   (iterator_advance)(it, n);
-   return it;
-}
-
-template<class It>
-BOOST_INTRUSIVE_FORCEINLINE 
-   void iterator_uadvance(It& it, typename iter_size<It>::type n)
-{
-   (iterator_advance)(it, (typename iterator_traits<It>::difference_type)n);
-}
-
-template<class It>
-BOOST_INTRUSIVE_FORCEINLINE
-It make_iterator_uadvance(It it, typename iter_size<It>::type n)
-{
-   (iterator_uadvance)(it, n);
-   return it;
-}
-
-////////////////////////////////////////
-//    iterator_distance
-////////////////////////////////////////
-template<class InputIt> inline
-typename iterator_disable_if_tag_difference_type
-   <InputIt, std::random_access_iterator_tag>::type
-      iterator_distance(InputIt first, InputIt last)
-{
-   typename iter_difference<InputIt>::type off = 0;
-   while(first != last){
-      ++off;
-      ++first;
-   }
-   return off;
-}
-
-template<class InputIt>
-BOOST_INTRUSIVE_FORCEINLINE typename iterator_enable_if_tag_difference_type
-   <InputIt, std::random_access_iterator_tag>::type
-      iterator_distance(InputIt first, InputIt last)
-{
-   typename iter_difference<InputIt>::type off = last - first;
-   return off;
-}
-
-////////////////////////////////////////
-//    iterator_udistance
-////////////////////////////////////////
-
-template<class It>
-BOOST_INTRUSIVE_FORCEINLINE typename iter_size<It>::type
-   iterator_udistance(It first, It last)
-{
-   return (typename iter_size<It>::type)(iterator_distance)(first, last);
-}
-
-////////////////////////////////////////
-//    iterator_next
-////////////////////////////////////////
-
-template<class InputIt>
-BOOST_INTRUSIVE_FORCEINLINE InputIt iterator_next(InputIt it, typename iter_difference<InputIt>::type n)
-{
-   (iterator_advance)(it, n);
-   return it;
-}
-
-template<class InputIt>
-BOOST_INTRUSIVE_FORCEINLINE InputIt iterator_unext(InputIt it, typename iterator_traits<InputIt>::size_type n)
-{
-   (iterator_uadvance)(it, n);
-   return it;
-}
-
-////////////////////////////////////////
-// iterator_arrow_result
-////////////////////////////////////////
-
-template<class I>
-BOOST_INTRUSIVE_FORCEINLINE typename iterator_traits<I>::pointer iterator_arrow_result(const I &i)
-{  return i.operator->();  }
-
-template<class T>
-BOOST_INTRUSIVE_FORCEINLINE T * iterator_arrow_result(T *p)
-{  return p;   }
-
-} //namespace intrusive
-} //namespace boost
-
-#endif //BOOST_INTRUSIVE_DETAIL_ITERATOR_HPP
diff --git a/src/boost/intrusive/detail/key_nodeptr_comp.hpp b/src/boost/intrusive/detail/key_nodeptr_comp.hpp
deleted file mode 100644
index 1029a340..00000000
--- a/src/boost/intrusive/detail/key_nodeptr_comp.hpp
+++ /dev/null
@@ -1,125 +0,0 @@
-/////////////////////////////////////////////////////////////////////////////
-//
-// (C) Copyright Ion Gaztanaga  2014-2014
-//
-// Distributed under the Boost 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/intrusive for documentation.
-//
-/////////////////////////////////////////////////////////////////////////////
-
-#ifndef BOOST_INTRUSIVE_DETAIL_KEY_NODEPTR_COMP_HPP
-#define BOOST_INTRUSIVE_DETAIL_KEY_NODEPTR_COMP_HPP
-
-#ifndef BOOST_CONFIG_HPP
-#  include <boost/config.hpp>
-#endif
-
-#if defined(BOOST_HAS_PRAGMA_ONCE)
-#  pragma once
-#endif
-
-#include <boost/intrusive/detail/mpl.hpp>
-#include <boost/intrusive/detail/ebo_functor_holder.hpp>
-#include <boost/intrusive/detail/tree_value_compare.hpp>
-
-
-namespace boost {
-namespace intrusive {
-namespace detail {
-
-template < class KeyTypeKeyCompare
-         , class ValueTraits
-         , class KeyOfValue
-         >
-struct key_nodeptr_comp_types
-{
-   typedef ValueTraits                                   value_traits;
-   typedef typename value_traits::value_type             value_type;
-   typedef typename value_traits::node_ptr               node_ptr;
-   typedef typename value_traits::const_node_ptr         const_node_ptr;
-   typedef typename detail::if_c
-            < detail::is_same<KeyOfValue, void>::value
-            , detail::identity<value_type>
-            , KeyOfValue
-            >::type                                      key_of_value;
-   typedef tree_value_compare
-      <typename ValueTraits::pointer, KeyTypeKeyCompare, key_of_value>      base_t;
-};
-
-//This function object transforms a key comparison type to
-//a function that can compare nodes or nodes with nodes or keys.
-template < class KeyTypeKeyCompare
-         , class ValueTraits
-         , class KeyOfValue = void
-         >
-struct key_nodeptr_comp
-   //Use public inheritance to avoid MSVC bugs with closures
-   :  public key_nodeptr_comp_types<KeyTypeKeyCompare, ValueTraits, KeyOfValue>::base_t
-{
-private:
-   struct sfinae_type;
-
-public:
-   typedef key_nodeptr_comp_types<KeyTypeKeyCompare, ValueTraits, KeyOfValue> types_t;
-   typedef typename types_t::value_traits          value_traits;
-   typedef typename types_t::value_type            value_type;
-   typedef typename types_t::node_ptr              node_ptr;
-   typedef typename types_t::const_node_ptr        const_node_ptr;
-   typedef typename types_t::base_t                base_t;
-   typedef typename types_t::key_of_value          key_of_value;
-
-   template <class P1>
-   struct is_same_or_nodeptr_convertible
-   {
-      static const bool same_type = is_same<P1,const_node_ptr>::value || is_same<P1,node_ptr>::value;
-      static const bool value = same_type || is_convertible<P1, const_node_ptr>::value;
-   };
-
-   BOOST_INTRUSIVE_FORCEINLINE base_t base() const
-   {  return static_cast<const base_t&>(*this); }
-
-   BOOST_INTRUSIVE_FORCEINLINE key_nodeptr_comp(KeyTypeKeyCompare kcomp, const ValueTraits *traits)
-      :  base_t(kcomp), traits_(traits)
-   {}
-
-   //pred(pnode)
-   template<class T1>
-   BOOST_INTRUSIVE_FORCEINLINE bool operator()(const T1 &t1, typename enable_if_c< is_same_or_nodeptr_convertible<T1>::value, sfinae_type* >::type = 0) const
-   {  return base().get()(key_of_value()(*traits_->to_value_ptr(t1)));  }
-
-   //operator() 2 arg
-   //pred(pnode, pnode)
-   template<class T1, class T2>
-   BOOST_INTRUSIVE_FORCEINLINE bool operator()
-      (const T1 &t1, const T2 &t2, typename enable_if_c< is_same_or_nodeptr_convertible<T1>::value && is_same_or_nodeptr_convertible<T2>::value, sfinae_type* >::type = 0) const
-   {  return base()(*traits_->to_value_ptr(t1), *traits_->to_value_ptr(t2));  }
-
-   //pred(pnode, key)
-   template<class T1, class T2>
-   BOOST_INTRUSIVE_FORCEINLINE bool operator()
-      (const T1 &t1, const T2 &t2, typename enable_if_c< is_same_or_nodeptr_convertible<T1>::value && !is_same_or_nodeptr_convertible<T2>::value, sfinae_type* >::type = 0) const
-   {  return base()(*traits_->to_value_ptr(t1), t2);  }
-
-   //pred(key, pnode)
-   template<class T1, class T2>
-   BOOST_INTRUSIVE_FORCEINLINE bool operator()
-      (const T1 &t1, const T2 &t2, typename enable_if_c< !is_same_or_nodeptr_convertible<T1>::value && is_same_or_nodeptr_convertible<T2>::value, sfinae_type* >::type = 0) const
-   {  return base()(t1, *traits_->to_value_ptr(t2));  }
-
-   //pred(key, key)
-   template<class T1, class T2>
-   BOOST_INTRUSIVE_FORCEINLINE bool operator()
-      (const T1 &t1, const T2 &t2, typename enable_if_c< !is_same_or_nodeptr_convertible<T1>::value && !is_same_or_nodeptr_convertible<T2>::value, sfinae_type* >::type = 0) const
-   {  return base()(t1, t2);  }
-
-   const ValueTraits *const traits_;
-};
-
-}  //namespace detail{
-}  //namespace intrusive{
-}  //namespace boost{
-
-#endif //BOOST_INTRUSIVE_DETAIL_KEY_NODEPTR_COMP_HPP
diff --git a/src/boost/intrusive/detail/math.hpp b/src/boost/intrusive/detail/math.hpp
deleted file mode 100644
index ff379f65..00000000
--- a/src/boost/intrusive/detail/math.hpp
+++ /dev/null
@@ -1,242 +0,0 @@
-/////////////////////////////////////////////////////////////////////////////
-//
-// (C) Copyright Ion Gaztanaga  2014-2014
-//
-// Distributed under the Boost 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/intrusive for documentation.
-//
-/////////////////////////////////////////////////////////////////////////////
-
-#ifndef BOOST_INTRUSIVE_DETAIL_MATH_HPP
-#define BOOST_INTRUSIVE_DETAIL_MATH_HPP
-
-#ifndef BOOST_CONFIG_HPP
-#  include <boost/config.hpp>
-#endif
-
-#if defined(BOOST_HAS_PRAGMA_ONCE)
-#  pragma once
-#endif
-
-#include <cstddef>
-#include <climits>
-#include <boost/intrusive/detail/mpl.hpp>
-#include <cstring>
-
-namespace boost {
-namespace intrusive {
-namespace detail {
-
-///////////////////////////
-// floor_log2  Dispatcher
-////////////////////////////
-
-#if defined(_MSC_VER) && (_MSC_VER >= 1300)
-
-   }}} //namespace boost::intrusive::detail
-
-   //Use _BitScanReverseXX intrinsics
-
-   #if defined(_M_X64) || defined(_M_AMD64) || defined(_M_IA64)   //64 bit target
-      #define BOOST_INTRUSIVE_BSR_INTRINSIC_64_BIT
-   #endif
-
-   #ifndef __INTRIN_H_   // Avoid including any windows system header
-      #ifdef __cplusplus
-      extern "C" {
-      #endif // __cplusplus
-
-      #if defined(BOOST_INTRUSIVE_BSR_INTRINSIC_64_BIT)   //64 bit target
-         unsigned char _BitScanReverse64(unsigned long *index, unsigned __int64 mask);
-         #pragma intrinsic(_BitScanReverse64)
-      #else //32 bit target
-         unsigned char _BitScanReverse(unsigned long *index, unsigned long mask);
-         #pragma intrinsic(_BitScanReverse)
-      #endif
-
-      #ifdef __cplusplus
-      }
-      #endif // __cplusplus
-   #endif // __INTRIN_H_
-
-   #ifdef BOOST_INTRUSIVE_BSR_INTRINSIC_64_BIT
-      #define BOOST_INTRUSIVE_BSR_INTRINSIC _BitScanReverse64
-      #undef BOOST_INTRUSIVE_BSR_INTRINSIC_64_BIT
-   #else
-      #define BOOST_INTRUSIVE_BSR_INTRINSIC _BitScanReverse
-   #endif
-
-   namespace boost {
-   namespace intrusive {
-   namespace detail {
-
-   inline std::size_t floor_log2 (std::size_t x)
-   {
-      unsigned long log2;
-      BOOST_INTRUSIVE_BSR_INTRINSIC( &log2, x );
-      return static_cast<std::size_t>(log2);
-   }
-
-   #undef BOOST_INTRUSIVE_BSR_INTRINSIC
-
-#elif defined(__GNUC__) && ((__GNUC__ >= 4) || (__GNUC__ == 3 && __GNUC_MINOR__ >= 4)) //GCC >=3.4
-
-   //Compile-time error in case of missing specialization
-   template<class Uint>
-   struct builtin_clz_dispatch;
-
-   #if defined(BOOST_HAS_LONG_LONG)
-   template<>
-   struct builtin_clz_dispatch< ::boost::ulong_long_type >
-   {
-      static ::boost::ulong_long_type call(::boost::ulong_long_type n)
-      {  return (::boost::ulong_long_type)__builtin_clzll(n); }
-   };
-   #endif
-
-   template<>
-   struct builtin_clz_dispatch<unsigned long>
-   {
-      static unsigned long call(unsigned long n)
-      {  return (unsigned long)__builtin_clzl(n); }
-   };
-
-   template<>
-   struct builtin_clz_dispatch<unsigned int>
-   {
-      static unsigned int call(unsigned int n)
-      {  return (unsigned int)__builtin_clz(n); }
-   };
-
-   inline std::size_t floor_log2(std::size_t n)
-   {
-      return sizeof(std::size_t)*CHAR_BIT - std::size_t(1) - builtin_clz_dispatch<std::size_t>::call(n);
-   }
-
-#else //Portable methods
-
-////////////////////////////
-// Generic method
-////////////////////////////
-
-   inline std::size_t floor_log2_get_shift(std::size_t n, true_ )//power of two size_t
-   {  return n >> 1;  }
-
-   inline std::size_t floor_log2_get_shift(std::size_t n, false_ )//non-power of two size_t
-   {  return (n >> 1) + ((n & 1u) & (n != 1)); }
-
-   template<std::size_t N>
-   inline std::size_t floor_log2 (std::size_t x, integral_constant<std::size_t, N>)
-   {
-      const std::size_t Bits = N;
-      const bool Size_t_Bits_Power_2= !(Bits & (Bits-1));
-
-      std::size_t n = x;
-      std::size_t log2 = 0;
-
-      std::size_t remaining_bits = Bits;
-      std::size_t shift = floor_log2_get_shift(remaining_bits, bool_<Size_t_Bits_Power_2>());
-      while(shift){
-         std::size_t tmp = n >> shift;
-         if (tmp){
-            log2 += shift, n = tmp;
-         }
-         shift = floor_log2_get_shift(shift, bool_<Size_t_Bits_Power_2>());
-      }
-
-      return log2;
-   }
-
-   inline std::size_t floor_log2 (std::size_t x)
-   {
-      const std::size_t Bits = sizeof(std::size_t)*CHAR_BIT;
-      return floor_log2(x, integral_constant<std::size_t, Bits>());
-   }
-
-#endif
-
-//Thanks to Laurent de Soras in
-//http://www.flipcode.com/archives/Fast_log_Function.shtml
-inline float fast_log2 (float val)
-{
-   unsigned x;
-   std::memcpy(&x, &val, sizeof(float));
-   const int log_2 = int((x >> 23) & 255) - 128;
-   x &= ~(unsigned(255u) << 23u);
-   x += unsigned(127) << 23u;
-   std::memcpy(&val, &x, sizeof(float));
-   //1+log2(m), m ranging from 1 to 2
-   //3rd degree polynomial keeping first derivate continuity.
-   //For less precision the line can be commented out
-   val = ((-1.f/3.f) * val + 2.f) * val - (2.f/3.f);
-   return val + static_cast<float>(log_2);
-}
-
-inline bool is_pow2(std::size_t x)
-{  return (x & (x-1)) == 0;  }
-
-template<std::size_t N>
-struct static_is_pow2
-{
-   static const bool value = (N & (N-1)) == 0;
-};
-
-inline std::size_t ceil_log2 (std::size_t x)
-{
-   return static_cast<std::size_t>(!(is_pow2)(x)) + floor_log2(x);
-}
-
-inline std::size_t ceil_pow2 (std::size_t x)
-{
-   return std::size_t(1u) << (ceil_log2)(x);
-}
-
-inline std::size_t previous_or_equal_pow2(std::size_t x)
-{
-   return std::size_t(1u) << floor_log2(x);
-}
-
-template<class SizeType, std::size_t N>
-struct numbits_eq
-{
-   static const bool value = sizeof(SizeType)*CHAR_BIT == N;
-};
-
-template<class SizeType, class Enabler = void >
-struct sqrt2_pow_max;
-
-template <class SizeType>
-struct sqrt2_pow_max<SizeType, typename voider<typename enable_if< numbits_eq<SizeType, 32> >::type>::type>
-{
-   static const SizeType value = 0xb504f334;
-   static const std::size_t pow   = 31;
-};
-
-#ifndef BOOST_NO_INT64_T
-
-template <class SizeType>
-struct sqrt2_pow_max<SizeType, typename voider<typename enable_if< numbits_eq<SizeType, 64> >::type>::type>
-{
-   static const SizeType value = 0xb504f333f9de6484ull;
-   static const std::size_t pow   = 63;
-};
-
-#endif   //BOOST_NO_INT64_T
-
-// Returns floor(pow(sqrt(2), x * 2 + 1)).
-// Defined for X from 0 up to the number of bits in size_t minus 1.
-inline std::size_t sqrt2_pow_2xplus1 (std::size_t x)
-{
-   const std::size_t value = (std::size_t)sqrt2_pow_max<std::size_t>::value;
-   const std::size_t pow   = (std::size_t)sqrt2_pow_max<std::size_t>::pow;
-   return (value >> (pow - x)) + 1;
-}
-
-} //namespace detail
-} //namespace intrusive
-} //namespace boost
-
-#endif //BOOST_INTRUSIVE_DETAIL_MATH_HPP
diff --git a/src/boost/intrusive/detail/minimal_less_equal_header.hpp b/src/boost/intrusive/detail/minimal_less_equal_header.hpp
deleted file mode 100644
index 5e8a19de..00000000
--- a/src/boost/intrusive/detail/minimal_less_equal_header.hpp
+++ /dev/null
@@ -1,30 +0,0 @@
-/////////////////////////////////////////////////////////////////////////////
-//
-// (C) Copyright Ion Gaztanaga  2014-2015
-//
-// Distributed under the Boost 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/intrusive for documentation.
-//
-/////////////////////////////////////////////////////////////////////////////
-#ifndef BOOST_INTRUSIVE_DETAIL_MINIMAL_LESS_EQUAL_HEADER_HPP
-#define BOOST_INTRUSIVE_DETAIL_MINIMAL_LESS_EQUAL_HEADER_HPP
-#
-#ifndef BOOST_CONFIG_HPP
-#  include <boost/config.hpp>
-#endif
-#
-#if defined(BOOST_HAS_PRAGMA_ONCE)
-#  pragma once
-#endif
-#
-#//Try to avoid including <functional>, as it's quite big in C++11
-#if defined(BOOST_GNU_STDLIB)
-#  include <bits/stl_function.h>
-#else
-#  include <functional>    //Fallback
-#endif
-#
-#endif //BOOST_INTRUSIVE_DETAIL_MINIMAL_LESS_EQUAL_HEADER_HPP
diff --git a/src/boost/intrusive/detail/minimal_pair_header.hpp b/src/boost/intrusive/detail/minimal_pair_header.hpp
deleted file mode 100644
index 1358a085..00000000
--- a/src/boost/intrusive/detail/minimal_pair_header.hpp
+++ /dev/null
@@ -1,30 +0,0 @@
-/////////////////////////////////////////////////////////////////////////////
-//
-// (C) Copyright Ion Gaztanaga  2014-2015
-//
-// Distributed under the Boost 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/intrusive for documentation.
-//
-/////////////////////////////////////////////////////////////////////////////
-#ifndef BOOST_INTRUSIVE_DETAIL_MINIMAL_PAIR_HEADER_HPP
-#define BOOST_INTRUSIVE_DETAIL_MINIMAL_PAIR_HEADER_HPP
-#
-#if defined(BOOST_HAS_PRAGMA_ONCE)
-#  pragma once
-#endif
-#
-#ifndef BOOST_CONFIG_HPP
-#  include <boost/config.hpp>
-#endif
-#
-#//Try to avoid including <utility>, as it's quite big in C++11
-#if defined(BOOST_GNU_STDLIB)
-#  include <bits/stl_pair.h>
-#else
-#  include <utility>    //Fallback
-#endif
-#
-#endif //BOOST_INTRUSIVE_DETAIL_MINIMAL_PAIR_HEADER_HPP
diff --git a/src/boost/intrusive/detail/mpl.hpp b/src/boost/intrusive/detail/mpl.hpp
deleted file mode 100644
index d86fa4f3..00000000
--- a/src/boost/intrusive/detail/mpl.hpp
+++ /dev/null
@@ -1,217 +0,0 @@
-/////////////////////////////////////////////////////////////////////////////
-//
-// (C) Copyright Ion Gaztanaga        2006-2014
-// (C) Copyright Microsoft Corporation  2014
-//
-// Distributed under the Boost 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/intrusive for documentation.
-//
-/////////////////////////////////////////////////////////////////////////////
-
-#ifndef BOOST_INTRUSIVE_DETAIL_MPL_HPP
-#define BOOST_INTRUSIVE_DETAIL_MPL_HPP
-
-#ifndef BOOST_CONFIG_HPP
-#  include <boost/config.hpp>
-#endif
-
-#if defined(BOOST_HAS_PRAGMA_ONCE)
-#  pragma once
-#endif
-
-#include <boost/intrusive/detail/config_begin.hpp>
-#include <boost/move/detail/type_traits.hpp>
-#include <cstddef>
-
-namespace boost {
-namespace intrusive {
-namespace detail {
-   
-using boost::move_detail::is_same;
-using boost::move_detail::add_const;
-using boost::move_detail::remove_const;
-using boost::move_detail::remove_cv;
-using boost::move_detail::remove_reference;
-using boost::move_detail::add_reference;
-using boost::move_detail::remove_pointer;
-using boost::move_detail::add_pointer;
-using boost::move_detail::true_type;
-using boost::move_detail::false_type;
-using boost::move_detail::voider;
-using boost::move_detail::enable_if_c;
-using boost::move_detail::enable_if;
-using boost::move_detail::disable_if_c;
-using boost::move_detail::disable_if;
-using boost::move_detail::is_convertible;
-using boost::move_detail::if_c;
-using boost::move_detail::if_;
-using boost::move_detail::is_const;
-using boost::move_detail::identity;
-using boost::move_detail::alignment_of;
-using boost::move_detail::is_empty;
-using boost::move_detail::addressof;
-using boost::move_detail::integral_constant;
-using boost::move_detail::enable_if_convertible;
-using boost::move_detail::disable_if_convertible;
-using boost::move_detail::bool_;
-using boost::move_detail::true_;
-using boost::move_detail::false_;
-using boost::move_detail::yes_type;
-using boost::move_detail::no_type;
-using boost::move_detail::apply;
-using boost::move_detail::eval_if_c;
-using boost::move_detail::eval_if;
-using boost::move_detail::unvoid_ref;
-using boost::move_detail::add_const_if_c;
-
-template<std::size_t S>
-struct ls_zeros
-{
-   static const std::size_t value = (S & std::size_t(1)) ? 0 : (1 + ls_zeros<(S>>1u)>::value);
-};
-
-template<>
-struct ls_zeros<0>
-{
-   static const std::size_t value = 0;
-};
-
-template<>
-struct ls_zeros<1>
-{
-   static const std::size_t value = 0;
-};
-
-// Infrastructure for providing a default type for T::TNAME if absent.
-#define BOOST_INTRUSIVE_INSTANTIATE_DEFAULT_TYPE_TMPLT(TNAME)     \
-   template <typename T>                                          \
-   struct boost_intrusive_has_type_ ## TNAME                      \
-   {                                                              \
-      template <typename X>                                       \
-      static char test(int, typename X::TNAME*);                  \
-                                                                  \
-      template <typename X>                                       \
-      static int test(...);                                       \
-                                                                  \
-      static const bool value = (1 == sizeof(test<T>(0, 0)));     \
-   };                                                             \
-                                                                  \
-   template <typename T, typename DefaultType>                    \
-   struct boost_intrusive_default_type_ ## TNAME                  \
-   {                                                              \
-      struct DefaultWrap { typedef DefaultType TNAME; };          \
-                                                                  \
-      typedef typename                                            \
-         ::boost::intrusive::detail::if_c                         \
-            < boost_intrusive_has_type_ ## TNAME<T>::value        \
-            , T, DefaultWrap>::type::TNAME type;                  \
-   };                                                             \
-   //
-
-#define BOOST_INTRUSIVE_OBTAIN_TYPE_WITH_DEFAULT(INSTANTIATION_NS_PREFIX, T, TNAME, TIMPL)   \
-      typename INSTANTIATION_NS_PREFIX                                                       \
-         boost_intrusive_default_type_ ## TNAME< T, TIMPL >::type                            \
-//
-
-#define BOOST_INTRUSIVE_HAS_TYPE(INSTANTIATION_NS_PREFIX, T, TNAME)  \
-      INSTANTIATION_NS_PREFIX                                        \
-         boost_intrusive_has_type_ ## TNAME< T >::value              \
-//
-
-#define BOOST_INTRUSIVE_INSTANTIATE_EVAL_DEFAULT_TYPE_TMPLT(TNAME)\
-   template <typename T, typename DefaultType>                    \
-   struct boost_intrusive_eval_default_type_ ## TNAME             \
-   {                                                              \
-      template <typename X>                                       \
-      static char test(int, typename X::TNAME*);                  \
-                                                                  \
-      template <typename X>                                       \
-      static int test(...);                                       \
-                                                                  \
-      struct DefaultWrap                                          \
-      { typedef typename DefaultType::type TNAME; };              \
-                                                                  \
-      static const bool value = (1 == sizeof(test<T>(0, 0)));     \
-                                                                  \
-      typedef typename                                            \
-         ::boost::intrusive::detail::eval_if_c                    \
-            < value                                               \
-            , ::boost::intrusive::detail::identity<T>             \
-            , ::boost::intrusive::detail::identity<DefaultWrap>   \
-            >::type::TNAME type;                                  \
-   };                                                             \
-//
-
-#define BOOST_INTRUSIVE_OBTAIN_TYPE_WITH_EVAL_DEFAULT(INSTANTIATION_NS_PREFIX, T, TNAME, TIMPL) \
-      typename INSTANTIATION_NS_PREFIX                                                          \
-         boost_intrusive_eval_default_type_ ## TNAME< T, TIMPL >::type                          \
-//
-
-#define BOOST_INTRUSIVE_INTERNAL_STATIC_BOOL_IS_TRUE(TRAITS_PREFIX, TYPEDEF_TO_FIND) \
-template <class T>\
-struct TRAITS_PREFIX##_bool\
-{\
-   template<bool Add>\
-   struct two_or_three {yes_type _[2u + (unsigned)Add];};\
-   template <class U> static yes_type test(...);\
-   template <class U> static two_or_three<U::TYPEDEF_TO_FIND> test (int);\
-   static const std::size_t value = sizeof(test<T>(0));\
-};\
-\
-template <class T>\
-struct TRAITS_PREFIX##_bool_is_true\
-{\
-   static const bool value = TRAITS_PREFIX##_bool<T>::value > sizeof(yes_type)*2;\
-};\
-//
-
-#define BOOST_INTRUSIVE_HAS_STATIC_MEMBER_FUNC_SIGNATURE(TRAITS_NAME, FUNC_NAME) \
-  template <typename U, typename Signature> \
-  class TRAITS_NAME \
-  { \
-  private: \
-  template<Signature> struct helper;\
-  template<typename T> \
-  static ::boost::intrusive::detail::yes_type test(helper<&T::FUNC_NAME>*); \
-  template<typename T> static ::boost::intrusive::detail::no_type test(...); \
-  public: \
-  static const bool value = sizeof(test<U>(0)) == sizeof(::boost::intrusive::detail::yes_type); \
-  }; \
-//
-
-#define BOOST_INTRUSIVE_HAS_MEMBER_FUNC_CALLED(TRAITS_NAME, FUNC_NAME) \
-template <typename Type> \
-struct TRAITS_NAME \
-{ \
-   struct BaseMixin \
-   { \
-      void FUNC_NAME(); \
-   }; \
-   struct Base : public Type, public BaseMixin { Base(); }; \
-   template <typename T, T t> class Helper{}; \
-   template <typename U> \
-   static ::boost::intrusive::detail::no_type  test(U*, Helper<void (BaseMixin::*)(), &U::FUNC_NAME>* = 0); \
-   static ::boost::intrusive::detail::yes_type test(...); \
-   static const bool value = sizeof(::boost::intrusive::detail::yes_type) == sizeof(test((Base*)(0))); \
-};\
-//
-
-#define BOOST_INTRUSIVE_HAS_MEMBER_FUNC_CALLED_IGNORE_SIGNATURE(TRAITS_NAME, FUNC_NAME) \
-BOOST_INTRUSIVE_HAS_MEMBER_FUNC_CALLED(TRAITS_NAME##_ignore_signature, FUNC_NAME) \
-\
-template <typename Type, class> \
-struct TRAITS_NAME \
-   : public TRAITS_NAME##_ignore_signature<Type> \
-{};\
-//
-
-} //namespace detail
-} //namespace intrusive
-} //namespace boost
-
-#include <boost/intrusive/detail/config_end.hpp>
-
-#endif //BOOST_INTRUSIVE_DETAIL_MPL_HPP
diff --git a/src/boost/intrusive/detail/node_cloner_disposer.hpp b/src/boost/intrusive/detail/node_cloner_disposer.hpp
deleted file mode 100644
index 97e8d153..00000000
--- a/src/boost/intrusive/detail/node_cloner_disposer.hpp
+++ /dev/null
@@ -1,105 +0,0 @@
-/////////////////////////////////////////////////////////////////////////////
-//
-// (C) Copyright Ion Gaztanaga  2014-2014
-//
-// Distributed under the Boost 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/intrusive for documentation.
-//
-/////////////////////////////////////////////////////////////////////////////
-
-#ifndef BOOST_INTRUSIVE_DETAIL_NODE_CLONER_DISPOSER_HPP
-#define BOOST_INTRUSIVE_DETAIL_NODE_CLONER_DISPOSER_HPP
-
-#ifndef BOOST_CONFIG_HPP
-#  include <boost/config.hpp>
-#endif
-
-#if defined(BOOST_HAS_PRAGMA_ONCE)
-#  pragma once
-#endif
-
-#include <boost/intrusive/link_mode.hpp>
-#include <boost/intrusive/detail/mpl.hpp>
-#include <boost/intrusive/detail/ebo_functor_holder.hpp>
-#include <boost/intrusive/detail/algo_type.hpp>
-#include <boost/intrusive/detail/assert.hpp>
-
-namespace boost {
-namespace intrusive {
-namespace detail {
-
-template<class F, class ValueTraits, algo_types AlgoType, bool IsConst = true>
-struct node_cloner
-   //Use public inheritance to avoid MSVC bugs with closures
-   :  public ebo_functor_holder<F>
-{
-   typedef ValueTraits                                      value_traits;
-   typedef typename value_traits::node_traits               node_traits;
-   typedef typename node_traits::node_ptr                   node_ptr;
-   typedef ebo_functor_holder<F>                            base_t;
-   typedef typename get_algo< AlgoType
-                            , node_traits>::type            node_algorithms;
-   static const bool safemode_or_autounlink =
-      is_safe_autounlink<value_traits::link_mode>::value;
-   typedef typename value_traits::value_type                value_type;
-   typedef typename value_traits::pointer                   pointer;
-   typedef typename value_traits::const_pointer             const_pointer;
-   typedef typename node_traits::node                       node;
-   typedef typename value_traits::const_node_ptr            const_node_ptr;
-   typedef typename pointer_traits<pointer>::reference      reference;
-   typedef typename pointer_traits
-      <const_pointer>::reference                            const_reference;
-   typedef typename if_c<IsConst, const_reference, reference>::type reference_type;
-
-   node_cloner(F f, const ValueTraits *traits)
-      :  base_t(f), traits_(traits)
-   {}
-
-   // tree-based containers use this method, which is proxy-reference friendly
-   BOOST_INTRUSIVE_FORCEINLINE node_ptr operator()(node_ptr p)
-   {
-      reference_type v = *traits_->to_value_ptr(p);
-      node_ptr n = traits_->to_node_ptr(*base_t::get()(v));
-      //Cloned node must be in default mode if the linking mode requires it
-      BOOST_INTRUSIVE_SAFE_HOOK_DEFAULT_ASSERT(!safemode_or_autounlink || node_algorithms::unique(n));
-      return n;
-   }
-
-   const ValueTraits * const traits_;
-};
-
-template<class F, class ValueTraits, algo_types AlgoType>
-struct node_disposer
-   //Use public inheritance to avoid MSVC bugs with closures
-   :  public ebo_functor_holder<F>
-{
-   typedef ValueTraits                          value_traits;
-   typedef typename value_traits::node_traits   node_traits;
-   typedef typename node_traits::node_ptr       node_ptr;
-   typedef ebo_functor_holder<F>                base_t;
-   typedef typename get_algo< AlgoType
-                            , node_traits>::type   node_algorithms;
-   static const bool safemode_or_autounlink =
-      is_safe_autounlink<value_traits::link_mode>::value;
-
-   BOOST_INTRUSIVE_FORCEINLINE node_disposer(F f, const ValueTraits *cont)
-      :  base_t(f), traits_(cont)
-   {}
-
-   BOOST_INTRUSIVE_FORCEINLINE void operator()(node_ptr p)
-   {
-      BOOST_IF_CONSTEXPR(safemode_or_autounlink)
-         node_algorithms::init(p);
-      base_t::get()(traits_->to_value_ptr(p));
-   }
-   const ValueTraits * const traits_;
-};
-
-}  //namespace detail{
-}  //namespace intrusive{
-}  //namespace boost{
-
-#endif //BOOST_INTRUSIVE_DETAIL_NODE_CLONER_DISPOSER_HPP
diff --git a/src/boost/intrusive/detail/node_holder.hpp b/src/boost/intrusive/detail/node_holder.hpp
deleted file mode 100644
index b8dabef2..00000000
--- a/src/boost/intrusive/detail/node_holder.hpp
+++ /dev/null
@@ -1,35 +0,0 @@
-/////////////////////////////////////////////////////////////////////////////
-//
-// (C) Copyright Ion Gaztanaga  2014-2014
-//
-// Distributed under the Boost 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/intrusive for documentation.
-//
-/////////////////////////////////////////////////////////////////////////////
-
-#ifndef BOOST_INTRUSIVE_DETAIL_NODE_HOLDER_HPP
-#define BOOST_INTRUSIVE_DETAIL_NODE_HOLDER_HPP
-
-#ifndef BOOST_CONFIG_HPP
-#  include <boost/config.hpp>
-#endif
-
-#if defined(BOOST_HAS_PRAGMA_ONCE)
-#  pragma once
-#endif
-
-namespace boost {
-namespace intrusive {
-
-template<class Node, class Tag, unsigned int>
-struct node_holder
-   :  public Node
-{};
-
-}  //namespace intrusive{
-}  //namespace boost{
-
-#endif //BOOST_INTRUSIVE_DETAIL_NODE_HOLDER_HPP
diff --git a/src/boost/intrusive/detail/parent_from_member.hpp b/src/boost/intrusive/detail/parent_from_member.hpp
deleted file mode 100644
index 275229ab..00000000
--- a/src/boost/intrusive/detail/parent_from_member.hpp
+++ /dev/null
@@ -1,121 +0,0 @@
-/////////////////////////////////////////////////////////////////////////////
-//
-// (C) Copyright Ion Gaztanaga  2007-2013
-//
-// Distributed under the Boost 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/intrusive for documentation.
-//
-/////////////////////////////////////////////////////////////////////////////
-#ifndef BOOST_INTRUSIVE_DETAIL_PARENT_FROM_MEMBER_HPP
-#define BOOST_INTRUSIVE_DETAIL_PARENT_FROM_MEMBER_HPP
-
-#ifndef BOOST_CONFIG_HPP
-#  include <boost/config.hpp>
-#endif
-
-#if defined(BOOST_HAS_PRAGMA_ONCE)
-#  pragma once
-#endif
-
-#include <boost/intrusive/detail/config_begin.hpp>
-#include <boost/intrusive/detail/workaround.hpp>
-#include <cstddef>
-
-#if defined(_MSC_VER)
-   #define BOOST_INTRUSIVE_MSVC_ABI_PTR_TO_MEMBER
-   #include <boost/static_assert.hpp>
-#endif
-
-namespace boost {
-namespace intrusive {
-namespace detail {
-
-template<class Parent, class Member>
-BOOST_INTRUSIVE_FORCEINLINE std::ptrdiff_t offset_from_pointer_to_member(const Member Parent::* ptr_to_member)
-{
-   //The implementation of a pointer to member is compiler dependent.
-   #if defined(BOOST_INTRUSIVE_MSVC_ABI_PTR_TO_MEMBER)
-
-   //MSVC compliant compilers use their the first 32 bits as offset (even in 64 bit mode)
-   union caster_union
-   {
-      const Member Parent::* ptr_to_member;
-      int offset;
-   } caster;
-
-   //MSVC ABI can use up to 3 int32 to represent pointer to member data
-   //with virtual base classes, in those cases there is no simple to
-   //obtain the address of the parent. So static assert to avoid runtime errors
-   BOOST_STATIC_ASSERT( sizeof(caster) == sizeof(int) );
-
-   caster.ptr_to_member = ptr_to_member;
-   return std::ptrdiff_t(caster.offset);
-   //Additional info on MSVC behaviour for the future. For 2/3 int ptr-to-member
-   //types dereference seems to be:
-   //
-   // vboffset = [compile_time_offset if 2-int ptr2memb] /
-   //            [ptr2memb.i32[2] if 3-int ptr2memb].
-   // vbtable = *(this + vboffset);
-   // adj = vbtable[ptr2memb.i32[1]];
-   // var = adj + (this + vboffset) + ptr2memb.i32[0];
-   //
-   //To reverse the operation we need to
-   // - obtain vboffset (in 2-int ptr2memb implementation only)
-   // - Go to Parent's vbtable and obtain adjustment at index ptr2memb.i32[1]
-   // - parent = member - adj - vboffset - ptr2memb.i32[0]
-   //
-   //Even accessing to RTTI we might not be able to obtain this information
-   //so anyone who thinks it's possible, please send a patch.
-
-   //This works with gcc, msvc, ac++, ibmcpp
-   #elif defined(__GNUC__)   || defined(__HP_aCC) || defined(BOOST_INTEL) || \
-         defined(__IBMCPP__) || defined(__DECCXX)
-   const Parent * const parent = 0;
-   const char *const member = static_cast<const char*>(static_cast<const void*>(&(parent->*ptr_to_member)));
-   return std::ptrdiff_t(member - static_cast<const char*>(static_cast<const void*>(parent)));
-   #else
-   //This is the traditional C-front approach: __MWERKS__, __DMC__, __SUNPRO_CC
-   union caster_union
-   {
-      const Member Parent::* ptr_to_member;
-      std::ptrdiff_t offset;
-   } caster;
-   caster.ptr_to_member = ptr_to_member;
-   return caster.offset - 1;
-   #endif
-}
-
-template<class Parent, class Member>
-BOOST_INTRUSIVE_FORCEINLINE Parent *parent_from_member(Member *member, const Member Parent::* ptr_to_member)
-{
-   return static_cast<Parent*>
-      (
-         static_cast<void*>
-         (
-            static_cast<char*>(static_cast<void*>(member)) - offset_from_pointer_to_member(ptr_to_member)
-         )
-      );
-}
-
-template<class Parent, class Member>
-BOOST_INTRUSIVE_FORCEINLINE const Parent *parent_from_member(const Member *member, const Member Parent::* ptr_to_member)
-{
-   return static_cast<const Parent*>
-      (
-         static_cast<const void*>
-         (
-            static_cast<const char*>(static_cast<const void*>(member)) - offset_from_pointer_to_member(ptr_to_member)
-         )
-      );
-}
-
-}  //namespace detail {
-}  //namespace intrusive {
-}  //namespace boost {
-
-#include <boost/intrusive/detail/config_end.hpp>
-
-#endif   //#ifndef BOOST_INTRUSIVE_DETAIL_PARENT_FROM_MEMBER_HPP
diff --git a/src/boost/intrusive/detail/rbtree_node.hpp b/src/boost/intrusive/detail/rbtree_node.hpp
deleted file mode 100644
index 07811991..00000000
--- a/src/boost/intrusive/detail/rbtree_node.hpp
+++ /dev/null
@@ -1,205 +0,0 @@
-/////////////////////////////////////////////////////////////////////////////
-//
-// (C) Copyright Olaf Krzikalla 2004-2006.
-// (C) Copyright Ion Gaztanaga  2006-2013.
-//
-// Distributed under the Boost 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/intrusive for documentation.
-//
-/////////////////////////////////////////////////////////////////////////////
-
-#ifndef BOOST_INTRUSIVE_RBTREE_NODE_HPP
-#define BOOST_INTRUSIVE_RBTREE_NODE_HPP
-
-#ifndef BOOST_CONFIG_HPP
-#  include <boost/config.hpp>
-#endif
-
-#if defined(BOOST_HAS_PRAGMA_ONCE)
-#  pragma once
-#endif
-
-#include <boost/intrusive/detail/config_begin.hpp>
-#include <boost/intrusive/detail/workaround.hpp>
-#include <boost/intrusive/pointer_rebind.hpp>
-#include <boost/intrusive/rbtree_algorithms.hpp>
-#include <boost/intrusive/pointer_plus_bits.hpp>
-#include <boost/intrusive/detail/mpl.hpp>
-#include <boost/intrusive/detail/tree_node.hpp>
-
-namespace boost {
-namespace intrusive {
-
-/////////////////////////////////////////////////////////////////////////////
-//                                                                         //
-//                Generic node_traits for any pointer type                 //
-//                                                                         //
-/////////////////////////////////////////////////////////////////////////////
-
-//This is the compact representation: 3 pointers
-template<class VoidPointer>
-struct compact_rbtree_node
-{
-   typedef compact_rbtree_node<VoidPointer> node;
-   typedef typename pointer_rebind<VoidPointer, node >::type         node_ptr;
-   typedef typename pointer_rebind<VoidPointer, const node >::type   const_node_ptr;
-   enum color { red_t, black_t };
-   node_ptr parent_, left_, right_;
-};
-
-//This is the normal representation: 3 pointers + enum
-template<class VoidPointer>
-struct rbtree_node
-{
-   typedef rbtree_node<VoidPointer> node;
-   typedef typename pointer_rebind<VoidPointer, node >::type         node_ptr;
-   typedef typename pointer_rebind<VoidPointer, const node >::type   const_node_ptr;
-
-   enum color { red_t, black_t };
-   node_ptr parent_, left_, right_;
-   color color_;
-};
-
-//This is the default node traits implementation
-//using a node with 3 generic pointers plus an enum
-template<class VoidPointer>
-struct default_rbtree_node_traits_impl
-{
-   typedef rbtree_node<VoidPointer> node;
-   typedef typename node::node_ptr        node_ptr;
-   typedef typename node::const_node_ptr  const_node_ptr;
-
-   typedef typename node::color color;
-
-   BOOST_INTRUSIVE_FORCEINLINE static node_ptr get_parent(const_node_ptr n)
-   {  return n->parent_;  }
-
-   BOOST_INTRUSIVE_FORCEINLINE static node_ptr get_parent(node_ptr n)
-   {  return n->parent_;  }
-
-   BOOST_INTRUSIVE_FORCEINLINE static void set_parent(node_ptr n, node_ptr p)
-   {  n->parent_ = p;  }
-
-   BOOST_INTRUSIVE_FORCEINLINE static node_ptr get_left(const_node_ptr n)
-   {  return n->left_;  }
-
-   BOOST_INTRUSIVE_FORCEINLINE static node_ptr get_left(node_ptr n)
-   {  return n->left_;  }
-
-   BOOST_INTRUSIVE_FORCEINLINE static void set_left(node_ptr n, node_ptr l)
-   {  n->left_ = l;  }
-
-   BOOST_INTRUSIVE_FORCEINLINE static node_ptr get_right(const_node_ptr n)
-   {  return n->right_;  }
-
-   BOOST_INTRUSIVE_FORCEINLINE static node_ptr get_right(node_ptr n)
-   {  return n->right_;  }
-
-   BOOST_INTRUSIVE_FORCEINLINE static void set_right(node_ptr n, node_ptr r)
-   {  n->right_ = r;  }
-
-   BOOST_INTRUSIVE_FORCEINLINE static color get_color(const_node_ptr n)
-   {  return n->color_;  }
-
-   BOOST_INTRUSIVE_FORCEINLINE static color get_color(node_ptr n)
-   {  return n->color_;  }
-
-   BOOST_INTRUSIVE_FORCEINLINE static void set_color(node_ptr n, color c)
-   {  n->color_ = c;  }
-
-   BOOST_INTRUSIVE_FORCEINLINE static color black()
-   {  return node::black_t;  }
-
-   BOOST_INTRUSIVE_FORCEINLINE static color red()
-   {  return node::red_t;  }
-};
-
-//This is the compact node traits implementation
-//using a node with 3 generic pointers
-template<class VoidPointer>
-struct compact_rbtree_node_traits_impl
-{
-   typedef compact_rbtree_node<VoidPointer> node;
-   typedef typename node::node_ptr        node_ptr;
-   typedef typename node::const_node_ptr  const_node_ptr;
-
-   typedef pointer_plus_bits<node_ptr, 1> ptr_bit;
-
-   typedef typename node::color color;
-
-   BOOST_INTRUSIVE_FORCEINLINE static node_ptr get_parent(const_node_ptr n)
-   {  return ptr_bit::get_pointer(n->parent_);  }
-
-   BOOST_INTRUSIVE_FORCEINLINE static node_ptr get_parent(node_ptr n)
-   {  return ptr_bit::get_pointer(n->parent_);  }
-
-   BOOST_INTRUSIVE_FORCEINLINE static void set_parent(node_ptr n, node_ptr p)
-   {  ptr_bit::set_pointer(n->parent_, p);  }
-
-   BOOST_INTRUSIVE_FORCEINLINE static node_ptr get_left(const_node_ptr n)
-   {  return n->left_;  }
-
-   BOOST_INTRUSIVE_FORCEINLINE static node_ptr get_left(node_ptr n)
-   {  return n->left_;  }
-
-   BOOST_INTRUSIVE_FORCEINLINE static void set_left(node_ptr n, node_ptr l)
-   {  n->left_ = l;  }
-
-   BOOST_INTRUSIVE_FORCEINLINE static node_ptr get_right(const_node_ptr n)
-   {  return n->right_;  }
-
-   BOOST_INTRUSIVE_FORCEINLINE static node_ptr get_right(node_ptr n)
-   {  return n->right_;  }
-
-   BOOST_INTRUSIVE_FORCEINLINE static void set_right(node_ptr n, node_ptr r)
-   {  n->right_ = r;  }
-
-   BOOST_INTRUSIVE_FORCEINLINE static color get_color(const_node_ptr n)
-   {  return (color)ptr_bit::get_bits(n->parent_);  }
-
-   BOOST_INTRUSIVE_FORCEINLINE static color get_color(node_ptr n)
-   {  return (color)ptr_bit::get_bits(n->parent_);  }
-
-   BOOST_INTRUSIVE_FORCEINLINE static void set_color(node_ptr n, color c)
-   {  ptr_bit::set_bits(n->parent_, c != 0);  }
-
-   BOOST_INTRUSIVE_FORCEINLINE static color black()
-   {  return node::black_t;  }
-
-   BOOST_INTRUSIVE_FORCEINLINE static color red()
-   {  return node::red_t;  }
-};
-
-//Dispatches the implementation based on the boolean
-template<class VoidPointer, bool Compact>
-struct rbtree_node_traits_dispatch
-   :  public default_rbtree_node_traits_impl<VoidPointer>
-{};
-
-template<class VoidPointer>
-struct rbtree_node_traits_dispatch<VoidPointer, true>
-   :  public compact_rbtree_node_traits_impl<VoidPointer>
-{};
-
-//Inherit from rbtree_node_traits_dispatch depending on the embedding capabilities
-template<class VoidPointer, bool OptimizeSize = false>
-struct rbtree_node_traits
-   :  public rbtree_node_traits_dispatch
-         < VoidPointer
-         ,  OptimizeSize &&
-           (max_pointer_plus_bits
-            < VoidPointer
-            , detail::alignment_of<compact_rbtree_node<VoidPointer> >::value
-            >::value >= 1)
-         >
-{};
-
-} //namespace intrusive
-} //namespace boost
-
-#include <boost/intrusive/detail/config_end.hpp>
-
-#endif //BOOST_INTRUSIVE_RBTREE_NODE_HPP
diff --git a/src/boost/intrusive/detail/reverse_iterator.hpp b/src/boost/intrusive/detail/reverse_iterator.hpp
deleted file mode 100644
index 00b0e5f3..00000000
--- a/src/boost/intrusive/detail/reverse_iterator.hpp
+++ /dev/null
@@ -1,28 +0,0 @@
-/////////////////////////////////////////////////////////////////////////////
-//
-// (C) Copyright Ion Gaztanaga  2014-2014
-//
-// Distributed under the Boost 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/intrusive for documentation.
-//
-/////////////////////////////////////////////////////////////////////////////
-
-#ifndef BOOST_INTRUSIVE_DETAIL_REVERSE_ITERATOR_HPP
-#define BOOST_INTRUSIVE_DETAIL_REVERSE_ITERATOR_HPP
-
-#include <boost/move/detail/reverse_iterator.hpp>
-
-namespace boost {
-namespace intrusive {
-
-using boost::movelib::reverse_iterator;
-using boost::movelib::make_reverse_iterator;
-
-} //namespace intrusive {
-} //namespace boost {
-
-
-#endif //BOOST_INTRUSIVE_DETAIL_REVERSE_ITERATOR_HPP
diff --git a/src/boost/intrusive/detail/simple_disposers.hpp b/src/boost/intrusive/detail/simple_disposers.hpp
deleted file mode 100644
index 6b9bd4bc..00000000
--- a/src/boost/intrusive/detail/simple_disposers.hpp
+++ /dev/null
@@ -1,52 +0,0 @@
-/////////////////////////////////////////////////////////////////////////////
-//
-// (C) Copyright Ion Gaztanaga  2014-2014
-//
-// Distributed under the Boost 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/intrusive for documentation.
-//
-/////////////////////////////////////////////////////////////////////////////
-
-#ifndef BOOST_INTRUSIVE_DETAIL_SIMPLE_DISPOSERS_HPP
-#define BOOST_INTRUSIVE_DETAIL_SIMPLE_DISPOSERS_HPP
-
-#include <boost/intrusive/detail/workaround.hpp>
-
-#ifndef BOOST_CONFIG_HPP
-#  include <boost/config.hpp>
-#endif
-
-#if defined(BOOST_HAS_PRAGMA_ONCE)
-#  pragma once
-#endif
-
-namespace boost {
-namespace intrusive {
-namespace detail {
-
-class null_disposer
-{
-   public:
-   template <class Pointer>
-   void operator()(Pointer)
-   {}
-};
-
-template<class NodeAlgorithms>
-class init_disposer
-{
-   typedef typename NodeAlgorithms::node_ptr node_ptr;
-
-   public:
-   BOOST_INTRUSIVE_FORCEINLINE void operator()(node_ptr p)
-   {  NodeAlgorithms::init(p);   }
-};
-
-}  //namespace detail{
-}  //namespace intrusive{
-}  //namespace boost{
-
-#endif //BOOST_INTRUSIVE_DETAIL_SIMPLE_DISPOSERS_HPP
diff --git a/src/boost/intrusive/detail/size_holder.hpp b/src/boost/intrusive/detail/size_holder.hpp
deleted file mode 100644
index bd14dc50..00000000
--- a/src/boost/intrusive/detail/size_holder.hpp
+++ /dev/null
@@ -1,91 +0,0 @@
-/////////////////////////////////////////////////////////////////////////////
-//
-// (C) Copyright Ion Gaztanaga  2014-2014
-//
-// Distributed under the Boost 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/intrusive for documentation.
-//
-/////////////////////////////////////////////////////////////////////////////
-
-#ifndef BOOST_INTRUSIVE_DETAIL_SIZE_HOLDER_HPP
-#define BOOST_INTRUSIVE_DETAIL_SIZE_HOLDER_HPP
-
-#ifndef BOOST_CONFIG_HPP
-#  include <boost/config.hpp>
-#endif
-
-#if defined(BOOST_HAS_PRAGMA_ONCE)
-#  pragma once
-#endif
-
-#include <boost/intrusive/detail/workaround.hpp>
-
-namespace boost {
-namespace intrusive {
-namespace detail {
-
-template<bool ConstantSize, class SizeType, class Tag = void>
-struct size_holder
-{
-   static const bool constant_time_size = ConstantSize;
-   typedef SizeType  size_type;
-
-   BOOST_INTRUSIVE_FORCEINLINE SizeType get_size() const
-   {  return size_;  }
-
-   BOOST_INTRUSIVE_FORCEINLINE void set_size(SizeType size)
-   {  size_ = size; }
-
-   BOOST_INTRUSIVE_FORCEINLINE void decrement()
-   {  --size_; }
-
-   BOOST_INTRUSIVE_FORCEINLINE void increment()
-   {  ++size_; }
-
-   BOOST_INTRUSIVE_FORCEINLINE void increase(SizeType n)
-   {  size_ += n; }
-
-   BOOST_INTRUSIVE_FORCEINLINE void decrease(SizeType n)
-   {  size_ -= n; }
-
-   BOOST_INTRUSIVE_FORCEINLINE void swap(size_holder &other)
-   {  SizeType tmp(size_); size_ = other.size_; other.size_ = tmp; }
-
-   SizeType size_;
-};
-
-template<class SizeType, class Tag>
-struct size_holder<false, SizeType, Tag>
-{
-   static const bool constant_time_size = false;
-   typedef SizeType  size_type;
-
-   BOOST_INTRUSIVE_FORCEINLINE size_type get_size() const
-   {  return 0;  }
-
-   BOOST_INTRUSIVE_FORCEINLINE void set_size(size_type)
-   {}
-
-   BOOST_INTRUSIVE_FORCEINLINE void decrement()
-   {}
-
-   BOOST_INTRUSIVE_FORCEINLINE void increment()
-   {}
-
-   BOOST_INTRUSIVE_FORCEINLINE void increase(SizeType)
-   {}
-
-   BOOST_INTRUSIVE_FORCEINLINE void decrease(SizeType)
-   {}
-
-   BOOST_INTRUSIVE_FORCEINLINE void swap(size_holder){}
-};
-
-}  //namespace detail{
-}  //namespace intrusive{
-}  //namespace boost{
-
-#endif //BOOST_INTRUSIVE_DETAIL_SIZE_HOLDER_HPP
diff --git a/src/boost/intrusive/detail/slist_iterator.hpp b/src/boost/intrusive/detail/slist_iterator.hpp
deleted file mode 100644
index 9c5ee274..00000000
--- a/src/boost/intrusive/detail/slist_iterator.hpp
+++ /dev/null
@@ -1,145 +0,0 @@
-/////////////////////////////////////////////////////////////////////////////
-//
-// (C) Copyright Olaf Krzikalla 2004-2006.
-// (C) Copyright Ion Gaztanaga  2006-2013
-//
-// Distributed under the Boost 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/intrusive for documentation.
-//
-/////////////////////////////////////////////////////////////////////////////
-
-#ifndef BOOST_INTRUSIVE_SLIST_ITERATOR_HPP
-#define BOOST_INTRUSIVE_SLIST_ITERATOR_HPP
-
-#ifndef BOOST_CONFIG_HPP
-#  include <boost/config.hpp>
-#endif
-
-#if defined(BOOST_HAS_PRAGMA_ONCE)
-#  pragma once
-#endif
-
-#include <boost/intrusive/detail/config_begin.hpp>
-#include <boost/intrusive/detail/workaround.hpp>
-#include <boost/intrusive/detail/std_fwd.hpp>
-#include <boost/intrusive/detail/iiterator.hpp>
-#include <boost/intrusive/detail/mpl.hpp>
-#include <boost/static_assert.hpp>
-
-namespace boost {
-namespace intrusive {
-
-
-// slist_iterator provides some basic functions for a
-// node oriented bidirectional iterator:
-template<class ValueTraits, bool IsConst>
-class slist_iterator
-{
-   private:
-   typedef iiterator
-      <ValueTraits, IsConst, std::forward_iterator_tag> types_t;
-
-   static const bool stateful_value_traits =                types_t::stateful_value_traits;
-
-   typedef ValueTraits                                      value_traits;
-   typedef typename types_t::node_traits                    node_traits;
-
-   typedef typename types_t::node                           node;
-   typedef typename types_t::node_ptr                       node_ptr;
-   typedef typename types_t::const_value_traits_ptr         const_value_traits_ptr;
-   class nat;
-   typedef typename
-      detail::if_c< IsConst
-                  , slist_iterator<value_traits, false>
-                  , nat>::type                              nonconst_iterator;
-
-   public:
-   typedef typename types_t::iterator_type::difference_type    difference_type;
-   typedef typename types_t::iterator_type::value_type         value_type;
-   typedef typename types_t::iterator_type::pointer            pointer;
-   typedef typename types_t::iterator_type::reference          reference;
-   typedef typename types_t::iterator_type::iterator_category  iterator_category;
-
-   BOOST_INTRUSIVE_FORCEINLINE slist_iterator()
-   {}
-
-   BOOST_INTRUSIVE_FORCEINLINE slist_iterator(node_ptr nodeptr, const_value_traits_ptr traits_ptr)
-      : members_(nodeptr, traits_ptr)
-   {}
-
-   BOOST_INTRUSIVE_FORCEINLINE explicit slist_iterator(node_ptr nodeptr)
-      : members_(nodeptr, const_value_traits_ptr())
-   {  BOOST_STATIC_ASSERT((stateful_value_traits == false));  }
-
-   BOOST_INTRUSIVE_FORCEINLINE slist_iterator(const slist_iterator &other)
-      :  members_(other.pointed_node(), other.get_value_traits())
-   {}
-
-   BOOST_INTRUSIVE_FORCEINLINE slist_iterator(const nonconst_iterator &other)
-      :  members_(other.pointed_node(), other.get_value_traits())
-   {}
-
-   BOOST_INTRUSIVE_FORCEINLINE slist_iterator &operator=(const slist_iterator &other)
-   {  members_.nodeptr_ = other.members_.nodeptr_;  return *this;  }
-
-   BOOST_INTRUSIVE_FORCEINLINE node_ptr pointed_node() const
-   { return members_.nodeptr_; }
-
-   BOOST_INTRUSIVE_FORCEINLINE slist_iterator &operator=(node_ptr n)
-   {  members_.nodeptr_ = n;  return static_cast<slist_iterator&>(*this);  }
-
-   BOOST_INTRUSIVE_FORCEINLINE const_value_traits_ptr get_value_traits() const
-   {  return members_.get_ptr(); }
-
-   BOOST_INTRUSIVE_FORCEINLINE bool operator!() const
-   {  return !members_.nodeptr_; }
-
-   public:
-   BOOST_INTRUSIVE_FORCEINLINE slist_iterator& operator++()
-   {
-      members_.nodeptr_ = node_traits::get_next(members_.nodeptr_);
-      return static_cast<slist_iterator&> (*this);
-   }
-
-   BOOST_INTRUSIVE_FORCEINLINE slist_iterator operator++(int)
-   {
-      slist_iterator result (*this);
-      members_.nodeptr_ = node_traits::get_next(members_.nodeptr_);
-      return result;
-   }
-
-   BOOST_INTRUSIVE_FORCEINLINE friend bool operator== (const slist_iterator& l, const slist_iterator& r)
-   {  return l.pointed_node() == r.pointed_node();   }
-
-   BOOST_INTRUSIVE_FORCEINLINE friend bool operator!= (const slist_iterator& l, const slist_iterator& r)
-   {  return l.pointed_node() != r.pointed_node();   }
-
-   BOOST_INTRUSIVE_FORCEINLINE reference operator*() const
-   {  return *operator->();   }
-
-   BOOST_INTRUSIVE_FORCEINLINE pointer operator->() const
-   { return this->operator_arrow(detail::bool_<stateful_value_traits>()); }
-
-   BOOST_INTRUSIVE_FORCEINLINE slist_iterator<ValueTraits, false> unconst() const
-   {  return slist_iterator<ValueTraits, false>(this->pointed_node(), this->get_value_traits());   }
-
-   private:
-
-   BOOST_INTRUSIVE_FORCEINLINE pointer operator_arrow(detail::false_) const
-   { return ValueTraits::to_value_ptr(members_.nodeptr_); }
-
-   BOOST_INTRUSIVE_FORCEINLINE pointer operator_arrow(detail::true_) const
-   { return this->get_value_traits()->to_value_ptr(members_.nodeptr_); }
-
-   iiterator_members<node_ptr, const_value_traits_ptr, stateful_value_traits> members_;
-};
-
-} //namespace intrusive
-} //namespace boost
-
-#include <boost/intrusive/detail/config_end.hpp>
-
-#endif //BOOST_INTRUSIVE_SLIST_ITERATOR_HPP
diff --git a/src/boost/intrusive/detail/slist_node.hpp b/src/boost/intrusive/detail/slist_node.hpp
deleted file mode 100644
index d209f76a..00000000
--- a/src/boost/intrusive/detail/slist_node.hpp
+++ /dev/null
@@ -1,64 +0,0 @@
-/////////////////////////////////////////////////////////////////////////////
-//
-// (C) Copyright Olaf Krzikalla 2004-2006.
-// (C) Copyright Ion Gaztanaga  2006-2013
-//
-// Distributed under the Boost 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/intrusive for documentation.
-//
-/////////////////////////////////////////////////////////////////////////////
-
-#ifndef BOOST_INTRUSIVE_SLIST_NODE_HPP
-#define BOOST_INTRUSIVE_SLIST_NODE_HPP
-
-#ifndef BOOST_CONFIG_HPP
-#  include <boost/config.hpp>
-#endif
-
-#if defined(BOOST_HAS_PRAGMA_ONCE)
-#  pragma once
-#endif
-
-#include <boost/intrusive/detail/config_begin.hpp>
-#include <boost/intrusive/detail/workaround.hpp>
-#include <boost/intrusive/pointer_rebind.hpp>
-
-namespace boost {
-namespace intrusive {
-
-template<class VoidPointer>
-struct slist_node
-{
-   typedef typename pointer_rebind<VoidPointer, slist_node>::type   node_ptr;
-   node_ptr next_;
-};
-
-// slist_node_traits can be used with circular_slist_algorithms and supplies
-// a slist_node holding the pointers needed for a singly-linked list
-// it is used by slist_base_hook and slist_member_hook
-template<class VoidPointer>
-struct slist_node_traits
-{
-   typedef slist_node<VoidPointer>  node;
-   typedef typename node::node_ptr  node_ptr;
-   typedef typename pointer_rebind<VoidPointer, const node>::type    const_node_ptr;
-
-   BOOST_INTRUSIVE_FORCEINLINE static node_ptr get_next(const_node_ptr n)
-   {  return n->next_;  }
-
-   BOOST_INTRUSIVE_FORCEINLINE static node_ptr get_next(node_ptr n)
-   {  return n->next_;  }
-
-   BOOST_INTRUSIVE_FORCEINLINE static void set_next(node_ptr n, node_ptr next)
-   {  n->next_ = next;  }
-};
-
-} //namespace intrusive
-} //namespace boost
-
-#include <boost/intrusive/detail/config_end.hpp>
-
-#endif //BOOST_INTRUSIVE_SLIST_NODE_HPP
diff --git a/src/boost/intrusive/detail/std_fwd.hpp b/src/boost/intrusive/detail/std_fwd.hpp
deleted file mode 100644
index 8193ea8e..00000000
--- a/src/boost/intrusive/detail/std_fwd.hpp
+++ /dev/null
@@ -1,43 +0,0 @@
-//////////////////////////////////////////////////////////////////////////////
-//
-// (C) Copyright Ion Gaztanaga 2014-2014. Distributed under the Boost
-// 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.
-//
-//////////////////////////////////////////////////////////////////////////////
-
-#ifndef BOOST_INTRUSIVE_DETAIL_STD_FWD_HPP
-#define BOOST_INTRUSIVE_DETAIL_STD_FWD_HPP
-
-#ifndef BOOST_CONFIG_HPP
-#  include <boost/config.hpp>
-#endif
-
-#if defined(BOOST_HAS_PRAGMA_ONCE)
-#  pragma once
-#endif
-
-//////////////////////////////////////////////////////////////////////////////
-//                        Standard predeclarations
-//////////////////////////////////////////////////////////////////////////////
-
-#include <boost/move/detail/std_ns_begin.hpp>
-BOOST_MOVE_STD_NS_BEG
-
-template<class T>
-struct less;
-
-template<class T>
-struct equal_to;
-
-struct input_iterator_tag;
-struct forward_iterator_tag;
-struct bidirectional_iterator_tag;
-struct random_access_iterator_tag;
-
-BOOST_MOVE_STD_NS_END
-#include <boost/move/detail/std_ns_end.hpp>
-
-#endif //#ifndef BOOST_INTRUSIVE_DETAIL_STD_FWD_HPP
diff --git a/src/boost/intrusive/detail/tree_iterator.hpp b/src/boost/intrusive/detail/tree_iterator.hpp
deleted file mode 100644
index ba1375f8..00000000
--- a/src/boost/intrusive/detail/tree_iterator.hpp
+++ /dev/null
@@ -1,184 +0,0 @@
-/////////////////////////////////////////////////////////////////////////////
-//
-// (C) Copyright Ion Gaztanaga  2007-2013
-//
-// Distributed under the Boost 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/intrusive for documentation.
-//
-/////////////////////////////////////////////////////////////////////////////
-
-#ifndef BOOST_INTRUSIVE_TREE_ITERATOR_HPP
-#define BOOST_INTRUSIVE_TREE_ITERATOR_HPP
-
-#ifndef BOOST_CONFIG_HPP
-#  include <boost/config.hpp>
-#endif
-
-#if defined(BOOST_HAS_PRAGMA_ONCE)
-#  pragma once
-#endif
-
-#include <boost/intrusive/detail/config_begin.hpp>
-#include <boost/intrusive/detail/workaround.hpp>
-#include <boost/intrusive/detail/std_fwd.hpp>
-#include <boost/intrusive/detail/iiterator.hpp>
-#include <boost/intrusive/detail/bstree_algorithms_base.hpp>
-
-namespace boost {
-namespace intrusive {
-
-/////////////////////////////////////////////////////////////////////////////
-//                                                                         //
-//                   Implementation of the tree iterator                   //
-//                                                                         //
-/////////////////////////////////////////////////////////////////////////////
-
-// tree_iterator provides some basic functions for a
-// node oriented bidirectional iterator:
-template<class ValueTraits, bool IsConst>
-class tree_iterator
-{
-   private:
-   typedef iiterator< ValueTraits, IsConst
-                    , std::bidirectional_iterator_tag>   types_t;
-   typedef typename types_t::value_traits                value_traits;
-   typedef typename types_t::node_traits                 node_traits;
-   typedef typename types_t::node                        node;
-   typedef typename types_t::node_ptr                    node_ptr;
-   typedef typename types_t::const_value_traits_ptr      const_value_traits_ptr;
-   typedef bstree_algorithms_base<node_traits>           node_algorithms;
-
-   static const bool stateful_value_traits = types_t::stateful_value_traits;
-
-   void unspecified_bool_type_func() const {}
-   typedef void (tree_iterator::*unspecified_bool_type)() const;
-   class nat;
-   typedef typename
-      detail::if_c< IsConst
-                  , tree_iterator<value_traits, false>
-                  , nat>::type                           nonconst_iterator;
-
-   public:
-   typedef typename types_t::iterator_type::difference_type    difference_type;
-   typedef typename types_t::iterator_type::value_type         value_type;
-   typedef typename types_t::iterator_type::pointer            pointer;
-   typedef typename types_t::iterator_type::reference          reference;
-   typedef typename types_t::iterator_type::iterator_category  iterator_category;
-
-   BOOST_INTRUSIVE_FORCEINLINE tree_iterator()
-   {}
-
-   BOOST_INTRUSIVE_FORCEINLINE explicit tree_iterator(node_ptr nodeptr, const_value_traits_ptr traits_ptr)
-      : members_(nodeptr, traits_ptr)
-   {}
-
-   BOOST_INTRUSIVE_FORCEINLINE tree_iterator(const tree_iterator &other)
-      :  members_(other.pointed_node(), other.get_value_traits())
-   {}
-
-   BOOST_INTRUSIVE_FORCEINLINE tree_iterator(const nonconst_iterator &other)
-      :  members_(other.pointed_node(), other.get_value_traits())
-   {}
-
-   BOOST_INTRUSIVE_FORCEINLINE tree_iterator &operator=(const tree_iterator &other)
-   {  members_.nodeptr_ = other.members_.nodeptr_;  return *this;  }
-
-   BOOST_INTRUSIVE_FORCEINLINE tree_iterator &operator=(node_ptr nodeptr)
-   {  members_.nodeptr_ = nodeptr;  return *this;  }
-
-   BOOST_INTRUSIVE_FORCEINLINE node_ptr pointed_node() const
-   { return members_.nodeptr_; }
-
-   public:
-   BOOST_INTRUSIVE_FORCEINLINE tree_iterator& operator++()
-   {
-      members_.nodeptr_ = node_algorithms::next_node(members_.nodeptr_);
-      return *this;
-   }
-
-   tree_iterator operator++(int)
-   {
-      tree_iterator result (*this);
-      members_.nodeptr_ = node_algorithms::next_node(members_.nodeptr_);
-      return result;
-   }
-
-   BOOST_INTRUSIVE_FORCEINLINE tree_iterator& operator--()
-   {
-      members_.nodeptr_ = node_algorithms::prev_node(members_.nodeptr_);
-      return *this;
-   }
-
-   tree_iterator operator--(int)
-   {
-      tree_iterator result (*this);
-      members_.nodeptr_ = node_algorithms::prev_node(members_.nodeptr_);
-      return result;
-   }
-
-   BOOST_INTRUSIVE_FORCEINLINE tree_iterator&  go_left()
-   {
-      members_.nodeptr_ = node_traits::get_left(members_.nodeptr_);
-      return *this;
-   }
-
-   BOOST_INTRUSIVE_FORCEINLINE tree_iterator&  go_right()
-   {
-      members_.nodeptr_ = node_traits::get_right(members_.nodeptr_);
-      return *this;
-   }
-
-   BOOST_INTRUSIVE_FORCEINLINE tree_iterator&  go_parent()
-   {
-      members_.nodeptr_ = node_traits::get_parent(members_.nodeptr_);
-      return *this;
-   }
-
-   BOOST_INTRUSIVE_FORCEINLINE operator unspecified_bool_type() const
-   {  return members_.nodeptr_ ? &tree_iterator::unspecified_bool_type_func : 0;   }
-
-   BOOST_INTRUSIVE_FORCEINLINE bool operator! () const
-   {  return !members_.nodeptr_;   }
-
-   BOOST_INTRUSIVE_FORCEINLINE friend bool operator== (const tree_iterator& l, const tree_iterator& r)
-   { return l.pointed_node() == r.pointed_node(); }
-
-   BOOST_INTRUSIVE_FORCEINLINE friend bool operator!= (const tree_iterator& l, const tree_iterator& r)
-   {  return !(l == r);   }
-
-   BOOST_INTRUSIVE_FORCEINLINE reference operator*() const
-   {  return *operator->();   }
-
-   BOOST_INTRUSIVE_FORCEINLINE pointer operator->() const
-   { return this->operator_arrow(detail::bool_<stateful_value_traits>()); }
-
-   BOOST_INTRUSIVE_FORCEINLINE const_value_traits_ptr get_value_traits() const
-   {  return members_.get_ptr();  }
-
-   tree_iterator end_iterator_from_it() const
-   {
-      return tree_iterator(node_algorithms::get_header(this->pointed_node()), this->get_value_traits());
-   }
-
-   tree_iterator<value_traits, false> unconst() const
-   {  return tree_iterator<value_traits, false>(this->pointed_node(), this->get_value_traits());   }
-
-   private:
-   BOOST_INTRUSIVE_FORCEINLINE pointer operator_arrow(detail::false_) const
-   { return ValueTraits::to_value_ptr(members_.nodeptr_); }
-
-   BOOST_INTRUSIVE_FORCEINLINE pointer operator_arrow(detail::true_) const
-   { return this->get_value_traits()->to_value_ptr(members_.nodeptr_); }
-
-   iiterator_members<node_ptr, const_value_traits_ptr, stateful_value_traits> members_;
-};
-
-} //namespace intrusive
-} //namespace boost
-
-#include <boost/intrusive/detail/config_end.hpp>
-
-#endif //BOOST_INTRUSIVE_TREE_ITERATOR_HPP
diff --git a/src/boost/intrusive/detail/tree_node.hpp b/src/boost/intrusive/detail/tree_node.hpp
deleted file mode 100644
index 949d2d91..00000000
--- a/src/boost/intrusive/detail/tree_node.hpp
+++ /dev/null
@@ -1,80 +0,0 @@
-/////////////////////////////////////////////////////////////////////////////
-//
-// (C) Copyright Ion Gaztanaga  2007-2013
-//
-// Distributed under the Boost 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/intrusive for documentation.
-//
-/////////////////////////////////////////////////////////////////////////////
-
-#ifndef BOOST_INTRUSIVE_TREE_NODE_HPP
-#define BOOST_INTRUSIVE_TREE_NODE_HPP
-
-#ifndef BOOST_CONFIG_HPP
-#  include <boost/config.hpp>
-#endif
-
-#if defined(BOOST_HAS_PRAGMA_ONCE)
-#  pragma once
-#endif
-
-#include <boost/intrusive/detail/config_begin.hpp>
-#include <boost/intrusive/detail/workaround.hpp>
-#include <boost/intrusive/pointer_rebind.hpp>
-
-namespace boost {
-namespace intrusive {
-
-template<class VoidPointer>
-struct tree_node
-{
-   typedef typename pointer_rebind<VoidPointer, tree_node>::type  node_ptr;
-
-   node_ptr parent_, left_, right_;
-};
-
-template<class VoidPointer>
-struct tree_node_traits
-{
-   typedef tree_node<VoidPointer> node;
-
-   typedef typename node::node_ptr   node_ptr;
-   typedef typename pointer_rebind<VoidPointer, const node>::type const_node_ptr;
-
-   BOOST_INTRUSIVE_FORCEINLINE static node_ptr get_parent(const_node_ptr n)
-   {  return n->parent_;  }
-
-   BOOST_INTRUSIVE_FORCEINLINE static node_ptr get_parent(node_ptr n)
-   {  return n->parent_;  }
-
-   BOOST_INTRUSIVE_FORCEINLINE static void set_parent(node_ptr n, node_ptr p)
-   {  n->parent_ = p;  }
-
-   BOOST_INTRUSIVE_FORCEINLINE static node_ptr get_left(const_node_ptr n)
-   {  return n->left_;  }
-
-   BOOST_INTRUSIVE_FORCEINLINE static node_ptr get_left(node_ptr n)
-   {  return n->left_;  }
-
-   BOOST_INTRUSIVE_FORCEINLINE static void set_left(node_ptr n, node_ptr l)
-   {  n->left_ = l;  }
-
-   BOOST_INTRUSIVE_FORCEINLINE static node_ptr get_right(const_node_ptr n)
-   {  return n->right_;  }
-
-   BOOST_INTRUSIVE_FORCEINLINE static node_ptr get_right(node_ptr n)
-   {  return n->right_;  }
-
-   BOOST_INTRUSIVE_FORCEINLINE static void set_right(node_ptr n, node_ptr r)
-   {  n->right_ = r;  }
-};
-
-} //namespace intrusive
-} //namespace boost
-
-#include <boost/intrusive/detail/config_end.hpp>
-
-#endif //BOOST_INTRUSIVE_TREE_NODE_HPP
diff --git a/src/boost/intrusive/detail/tree_value_compare.hpp b/src/boost/intrusive/detail/tree_value_compare.hpp
deleted file mode 100644
index c78da0ac..00000000
--- a/src/boost/intrusive/detail/tree_value_compare.hpp
+++ /dev/null
@@ -1,186 +0,0 @@
-//////////////////////////////////////////////////////////////////////////////
-//
-// (C) Copyright Ion Gaztanaga 2015-2015. Distributed under the Boost
-// 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.
-//
-//////////////////////////////////////////////////////////////////////////////
-#ifndef BOOST_INTRUSIVE_DETAIL_TREE_VALUE_COMPARE_HPP
-#define BOOST_INTRUSIVE_DETAIL_TREE_VALUE_COMPARE_HPP
-
-#ifndef BOOST_CONFIG_HPP
-#  include <boost/config.hpp>
-#endif
-
-#if defined(BOOST_HAS_PRAGMA_ONCE)
-#  pragma once
-#endif
-
-#include <boost/intrusive/detail/workaround.hpp>
-#include <boost/intrusive/detail/mpl.hpp>
-#include <boost/intrusive/detail/ebo_functor_holder.hpp>
-#include <boost/intrusive/pointer_traits.hpp>
-
-namespace boost{
-namespace intrusive{
-
-//Needed to support smart references to value types
-template <class From, class ValuePtr>
-struct disable_if_smartref_to
-   : detail::disable_if_c 
-      <  detail::is_same
-            <From, typename pointer_traits
-               <ValuePtr>
-                  ::reference>::value
-      || detail::is_same
-            <From, typename pointer_traits
-                     < typename pointer_rebind
-                           < ValuePtr
-                           , const typename boost::movelib::pointer_element<ValuePtr>::type>::type>
-                  ::reference>::value
-      >
-{};
-
-//This function object takes a KeyCompare function object
-//and compares values that contains keys using KeyOfValue
-template< class ValuePtr, class KeyCompare, class KeyOfValue, class Ret = bool
-        , bool = boost::intrusive::detail::is_same
-   <typename boost::movelib::pointer_element<ValuePtr>::type, typename KeyOfValue::type>::value >
-struct tree_value_compare
-   :  public boost::intrusive::detail::ebo_functor_holder<KeyCompare>
-{
-   typedef typename
-      boost::movelib::pointer_element<ValuePtr>::type value_type;
-   typedef KeyCompare                                 key_compare;
-   typedef KeyOfValue                                 key_of_value;
-   typedef typename KeyOfValue::type                  key_type;
-
-   typedef boost::intrusive::detail::ebo_functor_holder<KeyCompare> base_t;
-
-   BOOST_INTRUSIVE_FORCEINLINE tree_value_compare()
-      :  base_t()
-   {}
-
-   BOOST_INTRUSIVE_FORCEINLINE explicit tree_value_compare(const key_compare &kcomp)
-      :  base_t(kcomp)
-   {}
-
-   BOOST_INTRUSIVE_FORCEINLINE tree_value_compare (const tree_value_compare &x)
-      :  base_t(x.base_t::get())
-   {}
-
-   BOOST_INTRUSIVE_FORCEINLINE tree_value_compare &operator=(const tree_value_compare &x)
-   {  this->base_t::get() = x.base_t::get();   return *this;  }
-
-   BOOST_INTRUSIVE_FORCEINLINE tree_value_compare &operator=(const key_compare &x)
-   {  this->base_t::get() = x;   return *this;  }
-
-   BOOST_INTRUSIVE_FORCEINLINE const key_compare &key_comp() const
-   {  return static_cast<const key_compare &>(*this);  }
-
-   BOOST_INTRUSIVE_FORCEINLINE Ret operator()(const key_type &key) const
-   {  return this->key_comp()(key);   }
-
-   BOOST_INTRUSIVE_FORCEINLINE Ret operator()(const value_type &value) const
-   {  return this->key_comp()(KeyOfValue()(value));  }
-
-   template<class U>
-   BOOST_INTRUSIVE_FORCEINLINE Ret operator()( const U &nonkey
-                                             , typename disable_if_smartref_to<U, ValuePtr>::type* = 0) const
-   {  return this->key_comp()(nonkey);  }
-
-   BOOST_INTRUSIVE_FORCEINLINE Ret operator()(const key_type &key1, const key_type &key2) const
-   {  return this->key_comp()(key1, key2);  }
-
-   BOOST_INTRUSIVE_FORCEINLINE Ret operator()(const value_type &value1, const value_type &value2) const
-   {  return this->key_comp()(KeyOfValue()(value1), KeyOfValue()(value2));  }
-
-   BOOST_INTRUSIVE_FORCEINLINE Ret operator()(const key_type &key1, const value_type &value2) const
-   {  return this->key_comp()(key1, KeyOfValue()(value2));  }
-
-   BOOST_INTRUSIVE_FORCEINLINE Ret operator()(const value_type &value1, const key_type &key2) const
-   {  return this->key_comp()(KeyOfValue()(value1), key2);  }
-
-   template<class U>
-   BOOST_INTRUSIVE_FORCEINLINE Ret operator()( const key_type &key1, const U &nonkey2
-                                              , typename disable_if_smartref_to<U, ValuePtr>::type* = 0) const
-   {  return this->key_comp()(key1, nonkey2);  }
-
-   template<class U>
-   BOOST_INTRUSIVE_FORCEINLINE Ret operator()( const U &nonkey1, const key_type &key2
-                                              , typename disable_if_smartref_to<U, ValuePtr>::type* = 0) const
-   {  return this->key_comp()(nonkey1, key2);  }
-
-   template<class U>
-   BOOST_INTRUSIVE_FORCEINLINE Ret operator()( const value_type &value1, const U &nonvalue2
-                                              , typename disable_if_smartref_to<U, ValuePtr>::type* = 0) const
-   {  return this->key_comp()(KeyOfValue()(value1), nonvalue2);  }
-
-   template<class U>
-   BOOST_INTRUSIVE_FORCEINLINE Ret operator()( const U &nonvalue1, const value_type &value2
-                                              , typename disable_if_smartref_to<U, ValuePtr>::type* = 0) const
-   {  return this->key_comp()(nonvalue1, KeyOfValue()(value2));  }
-};
-
-template<class ValuePtr, class KeyCompare, class KeyOfValue, class Ret>
-struct tree_value_compare<ValuePtr, KeyCompare, KeyOfValue, Ret, true>
-   :  public boost::intrusive::detail::ebo_functor_holder<KeyCompare>
-{
-   typedef typename
-      boost::movelib::pointer_element<ValuePtr>::type value_type;
-   typedef KeyCompare                                 key_compare;
-   typedef KeyOfValue                                 key_of_value;
-   typedef typename KeyOfValue::type                  key_type;
-
-   typedef boost::intrusive::detail::ebo_functor_holder<KeyCompare> base_t;
-
-
-   BOOST_INTRUSIVE_FORCEINLINE tree_value_compare()
-      :  base_t()
-   {}
-
-   BOOST_INTRUSIVE_FORCEINLINE explicit tree_value_compare(const key_compare &kcomp)
-      :  base_t(kcomp)
-   {}
-
-   BOOST_INTRUSIVE_FORCEINLINE tree_value_compare (const tree_value_compare &x)
-      :  base_t(x.base_t::get())
-   {}
-
-   BOOST_INTRUSIVE_FORCEINLINE tree_value_compare &operator=(const tree_value_compare &x)
-   {  this->base_t::get() = x.base_t::get();   return *this;  }
-
-   BOOST_INTRUSIVE_FORCEINLINE tree_value_compare &operator=(const key_compare &x)
-   {  this->base_t::get() = x;   return *this;  }
-
-   BOOST_INTRUSIVE_FORCEINLINE const key_compare &key_comp() const
-   {  return static_cast<const key_compare &>(*this);  }
-
-   BOOST_INTRUSIVE_FORCEINLINE Ret operator()(const key_type &key) const
-   {  return this->key_comp()(key);   }
-
-   template<class U>
-   BOOST_INTRUSIVE_FORCEINLINE Ret operator()( const U &nonkey
-                                             , typename disable_if_smartref_to<U, ValuePtr>::type* = 0) const
-   {  return this->key_comp()(nonkey);  }
-
-   BOOST_INTRUSIVE_FORCEINLINE Ret operator()(const key_type &key1, const key_type &key2) const
-   {  return this->key_comp()(key1, key2);  }
-
-   template<class U>
-   BOOST_INTRUSIVE_FORCEINLINE Ret operator()( const key_type &key1, const U &nonkey2
-                                              , typename disable_if_smartref_to<U, ValuePtr>::type* = 0) const
-   {  return this->key_comp()(key1, nonkey2);  }
-
-   template<class U>
-   BOOST_INTRUSIVE_FORCEINLINE Ret operator()(const U &nonkey1, const key_type &key2
-                                              , typename disable_if_smartref_to<U, ValuePtr>::type* = 0) const
-   {  return this->key_comp()(nonkey1, key2);  }
-};
-
-}  //namespace intrusive{
-}  //namespace boost{
-
-#endif   //#ifdef BOOST_INTRUSIVE_DETAIL_TREE_VALUE_COMPARE_HPP
diff --git a/src/boost/intrusive/detail/twin.hpp b/src/boost/intrusive/detail/twin.hpp
deleted file mode 100644
index b778732f..00000000
--- a/src/boost/intrusive/detail/twin.hpp
+++ /dev/null
@@ -1,49 +0,0 @@
-/////////////////////////////////////////////////////////////////////////////
-//
-// (C) Copyright Ion Gaztanaga  2014-2014
-//
-// Distributed under the Boost 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/intrusive for documentation.
-//
-/////////////////////////////////////////////////////////////////////////////
-
-#ifndef BOOST_INTRUSIVE_DETAIL_TWIN_HPP
-#define BOOST_INTRUSIVE_DETAIL_TWIN_HPP
-
-#ifndef BOOST_CONFIG_HPP
-#  include <boost/config.hpp>
-#endif
-
-#if defined(BOOST_HAS_PRAGMA_ONCE)
-#  pragma once
-#endif
-
-//A tiny utility to avoid pulling std::pair / utility for
-//very simple algorithms/types
-
-namespace boost {
-namespace intrusive {
-
-template <class T>
-struct twin
-{
-   typedef T type;
-   twin()
-      : first(), second()
-   {}
-
-   twin(const type &f, const type &s)
-      : first(f), second(s)
-   {}
-
-   T first;
-   T second;
-};
-
-}  //namespace intrusive{
-}  //namespace boost{
-
-#endif //BOOST_INTRUSIVE_DETAIL_TWIN_HPP
diff --git a/src/boost/intrusive/detail/uncast.hpp b/src/boost/intrusive/detail/uncast.hpp
deleted file mode 100644
index 7db97b74..00000000
--- a/src/boost/intrusive/detail/uncast.hpp
+++ /dev/null
@@ -1,55 +0,0 @@
-/////////////////////////////////////////////////////////////////////////////
-//
-// (C) Copyright Ion Gaztanaga  2006-2014
-//
-// Distributed under the Boost 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/intrusive for documentation.
-//
-/////////////////////////////////////////////////////////////////////////////
-
-#ifndef BOOST_INTRUSIVE_DETAIL_UNCAST_HPP
-#define BOOST_INTRUSIVE_DETAIL_UNCAST_HPP
-
-#ifndef BOOST_CONFIG_HPP
-#  include <boost/config.hpp>
-#endif
-
-#if defined(BOOST_HAS_PRAGMA_ONCE)
-#  pragma once
-#endif
-
-#include <boost/intrusive/detail/config_begin.hpp>
-#include <boost/intrusive/pointer_traits.hpp>
-#include <boost/intrusive/detail/mpl.hpp>
-
-namespace boost {
-namespace intrusive {
-namespace detail {
-
-template<class ConstNodePtr>
-struct uncast_types
-{
-   typedef typename pointer_traits<ConstNodePtr>::element_type element_type;
-   typedef typename remove_const<element_type>::type           non_const_type;
-   typedef typename pointer_traits<ConstNodePtr>::
-      template rebind_pointer<non_const_type>::type            non_const_pointer;
-   typedef pointer_traits<non_const_pointer>                   non_const_traits;
-};
-
-template<class ConstNodePtr>
-static typename uncast_types<ConstNodePtr>::non_const_pointer
-   uncast(const ConstNodePtr & ptr)
-{
-   return uncast_types<ConstNodePtr>::non_const_traits::const_cast_from(ptr);
-}
-
-} //namespace detail {
-} //namespace intrusive
-} //namespace boost
-
-#include <boost/intrusive/detail/config_end.hpp>
-
-#endif //BOOST_INTRUSIVE_DETAIL_UTILITIES_HPP
diff --git a/src/boost/intrusive/detail/value_functors.hpp b/src/boost/intrusive/detail/value_functors.hpp
deleted file mode 100644
index 7e220ebe..00000000
--- a/src/boost/intrusive/detail/value_functors.hpp
+++ /dev/null
@@ -1,52 +0,0 @@
-#ifndef BOOST_INTRUSIVE_DETAIL_VALUE_FUNCTORS_HPP
-#define BOOST_INTRUSIVE_DETAIL_VALUE_FUNCTORS_HPP
-///////////////////////////////////////////////////////////////////////////////
-//
-// (C) Copyright Ion Gaztanaga 2017-2021. Distributed under the Boost
-// 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/intrusive for documentation.
-//
-///////////////////////////////////////////////////////////////////////////////
-
-#ifndef BOOST_CONFIG_HPP
-#  include <boost/config.hpp>
-#endif
-
-#if defined(BOOST_HAS_PRAGMA_ONCE)
-#  pragma once
-#endif
-
-#include <cstddef>
-
-namespace boost {
-namespace intrusive {
-
-//Functors for member algorithm defaults
-template<class ValueType>
-struct value_less
-{
-   bool operator()(const ValueType &a, const ValueType &b) const
-      {  return a < b;  }
-};
-
-//Functors for member algorithm defaults
-template<class T>
-struct value_less<T*>
-{
-   bool operator()(const T *a, const T* b) const
-      {  return std::size_t(a) < std::size_t(b);  }
-};
-
-template<class ValueType>
-struct value_equal
-{
-   bool operator()(const ValueType &a, const ValueType &b) const
-      {  return a == b;  }
-};
-
-}  //namespace intrusive {
-}  //namespace boost {
-
-#endif   //BOOST_INTRUSIVE_DETAIL_VALUE_FUNCTORS_HPP
diff --git a/src/boost/intrusive/detail/workaround.hpp b/src/boost/intrusive/detail/workaround.hpp
deleted file mode 100644
index 0011fb5b..00000000
--- a/src/boost/intrusive/detail/workaround.hpp
+++ /dev/null
@@ -1,84 +0,0 @@
-//////////////////////////////////////////////////////////////////////////////
-//
-// (C) Copyright Ion Gaztanaga 2005-2013. Distributed under the Boost
-// 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/interprocess for documentation.
-//
-//////////////////////////////////////////////////////////////////////////////
-
-#ifndef BOOST_INTRUSIVE_DETAIL_WORKAROUND_HPP
-#define BOOST_INTRUSIVE_DETAIL_WORKAROUND_HPP
-
-#ifndef BOOST_CONFIG_HPP
-#  include <boost/config.hpp>
-#endif
-
-#if defined(BOOST_HAS_PRAGMA_ONCE)
-#  pragma once
-#endif
-
-#ifndef BOOST_CONFIG_HPP
-#include <boost/config.hpp>
-#endif
-
-// MSVC-12 ICEs when variadic templates are enabled.
-#if    !defined(BOOST_NO_CXX11_VARIADIC_TEMPLATES) && (!defined(BOOST_MSVC) || BOOST_MSVC >= 1900)
-   #define BOOST_INTRUSIVE_VARIADIC_TEMPLATES
-#endif
-
-#if    !defined(BOOST_NO_CXX11_RVALUE_REFERENCES) && !defined(BOOST_NO_CXX11_VARIADIC_TEMPLATES)
-   #define BOOST_INTRUSIVE_PERFECT_FORWARDING
-#endif
-
-//Macros for documentation purposes. For code, expands to the argument
-#define BOOST_INTRUSIVE_IMPDEF(TYPE) TYPE
-#define BOOST_INTRUSIVE_SEEDOC(TYPE) TYPE
-#define BOOST_INTRUSIVE_DOC1ST(TYPE1, TYPE2) TYPE2
-#define BOOST_INTRUSIVE_I ,
-#define BOOST_INTRUSIVE_DOCIGN(T1) T1
-
-//#define BOOST_INTRUSIVE_DISABLE_FORCEINLINE
-
-#if defined(BOOST_INTRUSIVE_DISABLE_FORCEINLINE)
-   #define BOOST_INTRUSIVE_FORCEINLINE inline
-#elif defined(BOOST_INTRUSIVE_FORCEINLINE_IS_BOOST_FORCELINE)
-   #define BOOST_INTRUSIVE_FORCEINLINE BOOST_FORCEINLINE
-#elif defined(BOOST_MSVC) && (_MSC_VER < 1900 || defined(_DEBUG))
-   //"__forceinline" and MSVC seems to have some bugs in old versions and in debug mode
-   #define BOOST_INTRUSIVE_FORCEINLINE inline
-#elif defined(BOOST_GCC) && ((__GNUC__ <= 5) || defined(__MINGW32__))
-   //Older GCCs have problems with forceinline
-   #define BOOST_INTRUSIVE_FORCEINLINE inline
-#else
-   #define BOOST_INTRUSIVE_FORCEINLINE BOOST_FORCEINLINE
-#endif
-
-#if !(defined BOOST_NO_EXCEPTIONS)
-#    define BOOST_INTRUSIVE_TRY { try
-#    define BOOST_INTRUSIVE_CATCH(x) catch(x)
-#    define BOOST_INTRUSIVE_RETHROW throw;
-#    define BOOST_INTRUSIVE_CATCH_END }
-#else
-#    if !defined(BOOST_MSVC) || BOOST_MSVC >= 1900
-#        define BOOST_INTRUSIVE_TRY { if (true)
-#        define BOOST_INTRUSIVE_CATCH(x) else if (false)
-#    else
-// warning C4127: conditional expression is constant
-#        define BOOST_INTRUSIVE_TRY { \
-             __pragma(warning(push)) \
-             __pragma(warning(disable: 4127)) \
-             if (true) \
-             __pragma(warning(pop))
-#        define BOOST_INTRUSIVE_CATCH(x) else \
-             __pragma(warning(push)) \
-             __pragma(warning(disable: 4127)) \
-             if (false) \
-             __pragma(warning(pop))
-#    endif
-#    define BOOST_INTRUSIVE_RETHROW
-#    define BOOST_INTRUSIVE_CATCH_END }
-#endif
-
-#endif   //#ifndef BOOST_INTRUSIVE_DETAIL_WORKAROUND_HPP
diff --git a/src/boost/intrusive/intrusive_fwd.hpp b/src/boost/intrusive/intrusive_fwd.hpp
deleted file mode 100644
index 127dbc9e..00000000
--- a/src/boost/intrusive/intrusive_fwd.hpp
+++ /dev/null
@@ -1,768 +0,0 @@
-/////////////////////////////////////////////////////////////////////////////
-//
-// (C) Copyright Ion Gaztanaga  2007-2013
-//
-// Distributed under the Boost 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/intrusive for documentation.
-//
-/////////////////////////////////////////////////////////////////////////////
-
-#ifndef BOOST_INTRUSIVE_FWD_HPP
-#define BOOST_INTRUSIVE_FWD_HPP
-
-#ifndef BOOST_CONFIG_HPP
-#  include <boost/config.hpp>
-#endif
-#
-#ifndef BOOST_CSTDINT_HPP
-#  include <boost/cstdint.hpp>
-#endif
-#
-#if defined(BOOST_HAS_PRAGMA_ONCE)
-#  pragma once
-#endif
-
-//! \file
-//! This header file forward declares most Intrusive classes.
-//!
-//! It forward declares the following containers and hooks:
-//!   - boost::intrusive::slist / boost::intrusive::slist_base_hook / boost::intrusive::slist_member_hook
-//!   - boost::intrusive::list / boost::intrusive::list_base_hook / boost::intrusive::list_member_hook
-//!   - boost::intrusive::bstree / boost::intrusive::bs_set / boost::intrusive::bs_multiset /
-//!      boost::intrusive::bs_set_base_hook / boost::intrusive::bs_set_member_hook
-//!   - boost::intrusive::rbtree / boost::intrusive::set / boost::intrusive::multiset /
-//!      boost::intrusive::set_base_hook / boost::intrusive::set_member_hook
-//!   - boost::intrusive::avltree / boost::intrusive::avl_set / boost::intrusive::avl_multiset /
-//!      boost::intrusive::avl_set_base_hook / boost::intrusive::avl_set_member_hook
-//!   - boost::intrusive::splaytree / boost::intrusive::splay_set / boost::intrusive::splay_multiset
-//!   - boost::intrusive::sgtree / boost::intrusive::sg_set / boost::intrusive::sg_multiset
-//!   - boost::intrusive::treap / boost::intrusive::treap_set / boost::intrusive::treap_multiset
-//!   - boost::intrusive::hashtable / boost::intrusive::unordered_set / boost::intrusive::unordered_multiset /
-//!      boost::intrusive::unordered_set_base_hook / boost::intrusive::unordered_set_member_hook /
-//!   - boost::intrusive::any_base_hook / boost::intrusive::any_member_hook
-//!
-//! It forward declares the following container or hook options:
-//!   - boost::intrusive::constant_time_size / boost::intrusive::size_type / boost::intrusive::compare / boost::intrusive::equal
-//!   - boost::intrusive::floating_point / boost::intrusive::priority / boost::intrusive::hash
-//!   - boost::intrusive::value_traits / boost::intrusive::member_hook / boost::intrusive::function_hook / boost::intrusive::base_hook
-//!   - boost::intrusive::void_pointer / boost::intrusive::tag / boost::intrusive::link_mode
-//!   - boost::intrusive::optimize_size / boost::intrusive::linear / boost::intrusive::cache_last
-//!   - boost::intrusive::bucket_traits / boost::intrusive::store_hash / boost::intrusive::optimize_multikey
-//!   - boost::intrusive::power_2_buckets / boost::intrusive::cache_begin / boost::intrusive::compare_hash / boost::intrusive::incremental
-//!
-//! It forward declares the following value traits utilities:
-//!   - boost::intrusive::value_traits / boost::intrusive::derivation_value_traits /
-//!      boost::intrusive::trivial_value_traits
-//!
-//! Finally it forward declares the following general purpose utilities:
-//!   - boost::intrusive::pointer_plus_bits / boost::intrusive::priority_compare.
-
-#if !defined(BOOST_INTRUSIVE_DOXYGEN_INVOKED)
-
-#include <cstddef>
-#include <boost/intrusive/link_mode.hpp>
-#include <boost/intrusive/detail/workaround.hpp>
-
-namespace boost {
-namespace intrusive {
-
-#if !defined(BOOST_INTERPROCESS_DOXYGEN_INVOKED)
-#  ifdef BOOST_HAS_INTPTR_T
-      using ::boost::uintptr_t;
-#  else
-      typedef std::size_t uintptr_t;
-#  endif
-#endif
-
-////////////////////////////
-//     Node algorithms
-////////////////////////////
-
-//Algorithms predeclarations
-template<class NodeTraits>
-class circular_list_algorithms;
-
-template<class NodeTraits>
-class circular_slist_algorithms;
-
-template<class NodeTraits>
-class linear_slist_algorithms;
-
-template<class NodeTraits>
-class bstree_algorithms;
-
-template<class NodeTraits>
-class rbtree_algorithms;
-
-template<class NodeTraits>
-class avltree_algorithms;
-
-template<class NodeTraits>
-class sgtree_algorithms;
-
-template<class NodeTraits>
-class splaytree_algorithms;
-
-template<class NodeTraits>
-class treap_algorithms;
-
-////////////////////////////
-//       Containers
-////////////////////////////
-
-//slist
-#if !defined(BOOST_INTRUSIVE_VARIADIC_TEMPLATES)
-template
-   < class T
-   , class O1  = void
-   , class O2  = void
-   , class O3  = void
-   , class O4  = void
-   , class O5  = void
-   , class O6  = void
-   >
-#else
-template<class T, class ...Options>
-#endif
-class slist;
-
-#if !defined(BOOST_INTRUSIVE_VARIADIC_TEMPLATES)
-template
-   < class O1  = void
-   , class O2  = void
-   , class O3  = void
-   >
-#else
-template<class ...Options>
-#endif
-class slist_base_hook;
-
-#if !defined(BOOST_INTRUSIVE_VARIADIC_TEMPLATES)
-template
-   < class O1  = void
-   , class O2  = void
-   , class O3  = void
-   >
-#else
-template<class ...Options>
-#endif
-class slist_member_hook;
-
-//list
-#if !defined(BOOST_INTRUSIVE_VARIADIC_TEMPLATES)
-template
-   < class T
-   , class O1  = void
-   , class O2  = void
-   , class O3  = void
-   , class O4  = void
-   >
-#else
-template<class T, class ...Options>
-#endif
-class list;
-
-#if !defined(BOOST_INTRUSIVE_VARIADIC_TEMPLATES)
-template
-   < class O1  = void
-   , class O2  = void
-   , class O3  = void
-   >
-#else
-template<class ...Options>
-#endif
-class list_base_hook;
-
-#if !defined(BOOST_INTRUSIVE_VARIADIC_TEMPLATES)
-template
-   < class O1  = void
-   , class O2  = void
-   , class O3  = void
-   >
-#else
-template<class ...Options>
-#endif
-class list_member_hook;
-
-//rbtree/set/multiset
-#if !defined(BOOST_INTRUSIVE_VARIADIC_TEMPLATES)
-template
-   < class T
-   , class O1  = void
-   , class O2  = void
-   , class O3  = void
-   , class O4  = void
-   , class O5  = void
-   , class O6  = void
-   >
-#else
-template<class T, class ...Options>
-#endif
-class rbtree;
-
-#if !defined(BOOST_INTRUSIVE_VARIADIC_TEMPLATES)
-template
-   < class T
-   , class O1  = void
-   , class O2  = void
-   , class O3  = void
-   , class O4  = void
-   , class O5  = void
-   , class O6  = void
-   >
-#else
-template<class T, class ...Options>
-#endif
-class set;
-
-#if !defined(BOOST_INTRUSIVE_VARIADIC_TEMPLATES)
-template
-   < class T
-   , class O1  = void
-   , class O2  = void
-   , class O3  = void
-   , class O4  = void
-   , class O5  = void
-   , class O6  = void
-   >
-#else
-template<class T, class ...Options>
-#endif
-class multiset;
-
-#if !defined(BOOST_INTRUSIVE_VARIADIC_TEMPLATES)
-template
-   < class O1  = void
-   , class O2  = void
-   , class O3  = void
-   , class O4  = void
-   >
-#else
-template<class ...Options>
-#endif
-class set_base_hook;
-
-#if !defined(BOOST_INTRUSIVE_VARIADIC_TEMPLATES)
-template
-   < class O1  = void
-   , class O2  = void
-   , class O3  = void
-   , class O4  = void
-   >
-#else
-template<class ...Options>
-#endif
-class set_member_hook;
-
-//splaytree/splay_set/splay_multiset
-#if !defined(BOOST_INTRUSIVE_VARIADIC_TEMPLATES)
-template
-   < class T
-   , class O1  = void
-   , class O2  = void
-   , class O3  = void
-   , class O4  = void
-   , class O5  = void
-   , class O6  = void
-   >
-#else
-template<class T, class ...Options>
-#endif
-class splaytree;
-
-#if !defined(BOOST_INTRUSIVE_VARIADIC_TEMPLATES)
-template
-   < class T
-   , class O1  = void
-   , class O2  = void
-   , class O3  = void
-   , class O4  = void
-   , class O5  = void
-   , class O6  = void
-   >
-#else
-template<class T, class ...Options>
-#endif
-class splay_set;
-
-#if !defined(BOOST_INTRUSIVE_VARIADIC_TEMPLATES)
-template
-   < class T
-   , class O1  = void
-   , class O2  = void
-   , class O3  = void
-   , class O4  = void
-   , class O5  = void
-   , class O6  = void
-   >
-#else
-template<class T, class ...Options>
-#endif
-class splay_multiset;
-
-//avltree/avl_set/avl_multiset
-#if !defined(BOOST_INTRUSIVE_VARIADIC_TEMPLATES)
-template
-   < class T
-   , class O1  = void
-   , class O2  = void
-   , class O3  = void
-   , class O4  = void
-   , class O5  = void
-   , class O6  = void
-   >
-#else
-template<class T, class ...Options>
-#endif
-class avltree;
-
-#if !defined(BOOST_INTRUSIVE_VARIADIC_TEMPLATES)
-template
-   < class T
-   , class O1  = void
-   , class O2  = void
-   , class O3  = void
-   , class O4  = void
-   , class O5  = void
-   , class O6  = void
-   >
-#else
-template<class T, class ...Options>
-#endif
-class avl_set;
-
-#if !defined(BOOST_INTRUSIVE_VARIADIC_TEMPLATES)
-template
-   < class T
-   , class O1  = void
-   , class O2  = void
-   , class O3  = void
-   , class O4  = void
-   , class O5  = void
-   , class O6  = void
-   >
-#else
-template<class T, class ...Options>
-#endif
-class avl_multiset;
-
-#if !defined(BOOST_INTRUSIVE_VARIADIC_TEMPLATES)
-template
-   < class O1  = void
-   , class O2  = void
-   , class O3  = void
-   , class O4  = void
-   >
-#else
-template<class ...Options>
-#endif
-class avl_set_base_hook;
-
-#if !defined(BOOST_INTRUSIVE_VARIADIC_TEMPLATES)
-template
-   < class O1  = void
-   , class O2  = void
-   , class O3  = void
-   , class O4  = void
-   >
-#else
-template<class ...Options>
-#endif
-class avl_set_member_hook;
-
-
-//treap/treap_set/treap_multiset
-#if !defined(BOOST_INTRUSIVE_VARIADIC_TEMPLATES)
-template
-   < class T
-   , class O1  = void
-   , class O2  = void
-   , class O3  = void
-   , class O4  = void
-   , class O5  = void
-   , class O6  = void
-   , class O7  = void
-   >
-#else
-template<class T, class ...Options>
-#endif
-class treap;
-
-#if !defined(BOOST_INTRUSIVE_VARIADIC_TEMPLATES)
-template
-   < class T
-   , class O1  = void
-   , class O2  = void
-   , class O3  = void
-   , class O4  = void
-   , class O5  = void
-   , class O6  = void
-   , class O7  = void
-   >
-#else
-template<class T, class ...Options>
-#endif
-class treap_set;
-
-#if !defined(BOOST_INTRUSIVE_VARIADIC_TEMPLATES)
-template
-   < class T
-   , class O1  = void
-   , class O2  = void
-   , class O3  = void
-   , class O4  = void
-   , class O5  = void
-   , class O6  = void
-   , class O7  = void
-   >
-#else
-template<class T, class ...Options>
-#endif
-class treap_multiset;
-
-//sgtree/sg_set/sg_multiset
-#if !defined(BOOST_INTRUSIVE_VARIADIC_TEMPLATES)
-template
-   < class T
-   , class O1  = void
-   , class O2  = void
-   , class O3  = void
-   , class O4  = void
-   , class O5  = void
-   , class O6  = void
-   >
-#else
-template<class T, class ...Options>
-#endif
-class sgtree;
-
-#if !defined(BOOST_INTRUSIVE_VARIADIC_TEMPLATES)
-template
-   < class T
-   , class O1  = void
-   , class O2  = void
-   , class O3  = void
-   , class O4  = void
-   , class O5  = void
-   , class O6  = void
-   >
-#else
-template<class T, class ...Options>
-#endif
-class sg_set;
-
-#if !defined(BOOST_INTRUSIVE_VARIADIC_TEMPLATES)
-template
-   < class T
-   , class O1  = void
-   , class O2  = void
-   , class O3  = void
-   , class O4  = void
-   , class O5  = void
-   , class O6  = void
-   >
-#else
-template<class T, class ...Options>
-#endif
-class sg_multiset;
-
-#if !defined(BOOST_INTRUSIVE_VARIADIC_TEMPLATES)
-template
-   < class T
-   , class O1  = void
-   , class O2  = void
-   , class O3  = void
-   , class O4  = void
-   , class O5  = void
-   , class O6  = void
-   >
-#else
-template<class T, class ...Options>
-#endif
-class bstree;
-
-#if !defined(BOOST_INTRUSIVE_VARIADIC_TEMPLATES)
-template
-   < class T
-   , class O1  = void
-   , class O2  = void
-   , class O3  = void
-   , class O4  = void
-   , class O5  = void
-   , class O6  = void
-   >
-#else
-template<class T, class ...Options>
-#endif
-class bs_set;
-
-#if !defined(BOOST_INTRUSIVE_VARIADIC_TEMPLATES)
-template
-   < class T
-   , class O1  = void
-   , class O2  = void
-   , class O3  = void
-   , class O4  = void
-   , class O5  = void
-   , class O6  = void
-   >
-#else
-template<class T, class ...Options>
-#endif
-class bs_multiset;
-
-#if !defined(BOOST_INTRUSIVE_VARIADIC_TEMPLATES)
-template
-   < class O1  = void
-   , class O2  = void
-   , class O3  = void
-   >
-#else
-template<class ...Options>
-#endif
-class bs_set_base_hook;
-
-#if !defined(BOOST_INTRUSIVE_VARIADIC_TEMPLATES)
-template
-   < class O1  = void
-   , class O2  = void
-   , class O3  = void
-   >
-#else
-template<class ...Options>
-#endif
-class bs_set_member_hook;
-
-//hashtable/unordered_set/unordered_multiset
-
-#if !defined(BOOST_INTRUSIVE_VARIADIC_TEMPLATES)
-template
-   < class T
-   , class O1  = void
-   , class O2  = void
-   , class O3  = void
-   , class O4  = void
-   , class O5  = void
-   , class O6  = void
-   , class O7  = void
-   , class O8  = void
-   , class O9  = void
-   , class O10 = void
-   >
-#else
-template<class T, class ...Options>
-#endif
-class hashtable;
-
-#if !defined(BOOST_INTRUSIVE_VARIADIC_TEMPLATES)
-template
-   < class T
-   , class O1  = void
-   , class O2  = void
-   , class O3  = void
-   , class O4  = void
-   , class O5  = void
-   , class O6  = void
-   , class O7  = void
-   , class O8  = void
-   , class O9  = void
-   , class O10 = void
-   , class O11 = void
-   >
-#else
-template<class T, class ...Options>
-#endif
-class unordered_set;
-
-#if !defined(BOOST_INTRUSIVE_VARIADIC_TEMPLATES)
-template
-   < class T
-   , class O1  = void
-   , class O2  = void
-   , class O3  = void
-   , class O4  = void
-   , class O5  = void
-   , class O6  = void
-   , class O7  = void
-   , class O8  = void
-   , class O9  = void
-   , class O10 = void
-   , class O11 = void
-   >
-#else
-template<class T, class ...Options>
-#endif
-class unordered_multiset;
-
-#if !defined(BOOST_INTRUSIVE_VARIADIC_TEMPLATES)
-template
-   < class O1  = void
-   , class O2  = void
-   , class O3  = void
-   , class O4  = void
-   >
-#else
-template<class ...Options>
-#endif
-class unordered_set_base_hook;
-
-#if !defined(BOOST_INTRUSIVE_VARIADIC_TEMPLATES)
-template
-   < class O1  = void
-   , class O2  = void
-   , class O3  = void
-   , class O4  = void
-   >
-#else
-template<class ...Options>
-#endif
-class unordered_set_member_hook;
-
-#if !defined(BOOST_INTRUSIVE_VARIADIC_TEMPLATES)
-template
-   < class O1  = void
-   , class O2  = void
-   , class O3  = void
-   >
-#else
-template<class ...Options>
-#endif
-class any_base_hook;
-
-#if !defined(BOOST_INTRUSIVE_VARIADIC_TEMPLATES)
-template
-   < class O1  = void
-   , class O2  = void
-   , class O3  = void
-   >
-#else
-template<class ...Options>
-#endif
-class any_member_hook;
-
-//Options
-
-template<bool Enabled>
-struct constant_time_size;
-
-template<typename SizeType>
-struct size_type;
-
-template<typename Compare>
-struct compare;
-
-template<bool Enabled>
-struct floating_point;
-
-template<typename Equal>
-struct equal;
-
-template<typename Priority>
-struct priority;
-
-template<typename Hash>
-struct hash;
-
-template<typename ValueTraits> struct value_traits;
-
-template< typename Parent
-        , typename MemberHook
-        , MemberHook Parent::* PtrToMember>
-struct member_hook;
-
-template<typename Functor>
-struct function_hook;
-
-template<typename BaseHook>
-struct base_hook;
-
-template<typename VoidPointer>
-struct void_pointer;
-
-template<typename Tag>
-struct tag;
-
-template<link_mode_type LinkType>
-struct link_mode;
-
-template<bool Enabled> struct
-optimize_size;
-
-template<bool Enabled>
-struct linear;
-
-template<bool Enabled>
-struct cache_last;
-
-template<typename BucketTraits>
-struct bucket_traits;
-
-template<bool Enabled>
-struct store_hash;
-
-template<bool Enabled>
-struct optimize_multikey;
-
-template<bool Enabled>
-struct power_2_buckets;
-
-template<bool Enabled>
-struct cache_begin;
-
-template<bool Enabled>
-struct compare_hash;
-
-template<bool Enabled>
-struct incremental;
-
-//Value traits
-
-template<typename ValueTraits>
-struct value_traits;
-
-template< typename Parent
-        , typename MemberHook
-        , MemberHook Parent::* PtrToMember>
-struct member_hook;
-
-template< typename Functor>
-struct function_hook;
-
-template<typename BaseHook>
-struct base_hook;
-
-template<class T, class NodeTraits, link_mode_type LinkMode = safe_link>
-struct derivation_value_traits;
-
-template<class NodeTraits, link_mode_type LinkMode = normal_link>
-struct trivial_value_traits;
-
-//Additional utilities
-
-template<typename VoidPointer, std::size_t Alignment>
-struct max_pointer_plus_bits;
-
-template<std::size_t Alignment>
-struct max_pointer_plus_bits<void *, Alignment>;
-
-template<typename Pointer, std::size_t NumBits>
-struct pointer_plus_bits;
-
-template<typename T, std::size_t NumBits>
-struct pointer_plus_bits<T *, NumBits>;
-
-template<typename Ptr>
-struct pointer_traits;
-
-template<typename T>
-struct pointer_traits<T *>;
-
-}  //namespace intrusive {
-}  //namespace boost {
-
-#endif   //#if !defined(BOOST_INTRUSIVE_DOXYGEN_INVOKED)
-
-#endif   //#ifndef BOOST_INTRUSIVE_FWD_HPP
diff --git a/src/boost/intrusive/linear_slist_algorithms.hpp b/src/boost/intrusive/linear_slist_algorithms.hpp
deleted file mode 100644
index a616d7ed..00000000
--- a/src/boost/intrusive/linear_slist_algorithms.hpp
+++ /dev/null
@@ -1,422 +0,0 @@
-/////////////////////////////////////////////////////////////////////////////
-//
-// (C) Copyright Olaf Krzikalla 2004-2006.
-// (C) Copyright Ion Gaztanaga  2006-2014
-//
-// Distributed under the Boost 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/intrusive for documentation.
-//
-/////////////////////////////////////////////////////////////////////////////
-
-#ifndef BOOST_INTRUSIVE_LINEAR_SLIST_ALGORITHMS_HPP
-#define BOOST_INTRUSIVE_LINEAR_SLIST_ALGORITHMS_HPP
-
-#include <boost/intrusive/detail/config_begin.hpp>
-#include <boost/intrusive/intrusive_fwd.hpp>
-#include <boost/intrusive/detail/common_slist_algorithms.hpp>
-#include <boost/intrusive/detail/algo_type.hpp>
-#include <cstddef>
-#include <boost/intrusive/detail/twin.hpp>   //for node_pair
-
-#if defined(BOOST_HAS_PRAGMA_ONCE)
-#  pragma once
-#endif
-
-namespace boost {
-namespace intrusive {
-
-//! linear_slist_algorithms provides basic algorithms to manipulate nodes
-//! forming a linear singly linked list.
-//!
-//! linear_slist_algorithms is configured with a NodeTraits class, which encapsulates the
-//! information about the node to be manipulated. NodeTraits must support the
-//! following interface:
-//!
-//! <b>Typedefs</b>:
-//!
-//! <tt>node</tt>: The type of the node that forms the linear list
-//!
-//! <tt>node_ptr</tt>: A pointer to a node
-//!
-//! <tt>const_node_ptr</tt>: A pointer to a const node
-//!
-//! <b>Static functions</b>:
-//!
-//! <tt>static node_ptr get_next(const_node_ptr n);</tt>
-//!
-//! <tt>static void set_next(node_ptr n, node_ptr next);</tt>
-template<class NodeTraits>
-class linear_slist_algorithms
-   /// @cond
-   : public detail::common_slist_algorithms<NodeTraits>
-   /// @endcond
-{
-   /// @cond
-   typedef detail::common_slist_algorithms<NodeTraits> base_t;
-   /// @endcond
-   public:
-   typedef typename NodeTraits::node            node;
-   typedef typename NodeTraits::node_ptr        node_ptr;
-   typedef typename NodeTraits::const_node_ptr  const_node_ptr;
-   typedef NodeTraits                           node_traits;
-   //A simple struct containing:
-   //
-   // typedef node_ptr type;
-   // node_ptr first;
-   // node_ptr second;
-   typedef twin<node_ptr>                  node_pair;
-
-   #if defined(BOOST_INTRUSIVE_DOXYGEN_INVOKED)
-
-   //! <b>Effects</b>: Constructs an non-used list element, putting the next
-   //!   pointer to null:
-   //!  <tt>NodeTraits::get_next(this_node) == node_ptr()</tt>
-   //!
-   //! <b>Complexity</b>: Constant
-   //!
-   //! <b>Throws</b>: Nothing.
-   static void init(node_ptr this_node) BOOST_NOEXCEPT;
-
-   //! <b>Requires</b>: this_node must be in a circular list or be an empty circular list.
-   //!
-   //! <b>Effects</b>: Returns true is "this_node" is the only node of a circular list:
-   //!  or it's a not inserted node:
-   //!  <tt>return node_ptr() == NodeTraits::get_next(this_node) || NodeTraits::get_next(this_node) == this_node</tt>
-   //!
-   //! <b>Complexity</b>: Constant
-   //!
-   //! <b>Throws</b>: Nothing.
-   static bool unique(const_node_ptr this_node) BOOST_NOEXCEPT;
-
-   //! <b>Effects</b>: Returns true is "this_node" has the same state as if
-   //!  it was inited using "init(node_ptr)"
-   //!
-   //! <b>Complexity</b>: Constant
-   //!
-   //! <b>Throws</b>: Nothing.
-   static bool inited(const_node_ptr this_node) BOOST_NOEXCEPT;
-
-   //! <b>Requires</b>: prev_node must be in a circular list or be an empty circular list.
-   //!
-   //! <b>Effects</b>: Unlinks the next node of prev_node from the circular list.
-   //!
-   //! <b>Complexity</b>: Constant
-   //!
-   //! <b>Throws</b>: Nothing.
-   static void unlink_after(node_ptr prev_node) BOOST_NOEXCEPT;
-
-   //! <b>Requires</b>: prev_node and last_node must be in a circular list
-   //!  or be an empty circular list.
-   //!
-   //! <b>Effects</b>: Unlinks the range (prev_node, last_node) from the linear list.
-   //!
-   //! <b>Complexity</b>: Constant
-   //!
-   //! <b>Throws</b>: Nothing.
-   static void unlink_after(node_ptr prev_node, node_ptr last_node) BOOST_NOEXCEPT;
-
-   //! <b>Requires</b>: prev_node must be a node of a linear list.
-   //!
-   //! <b>Effects</b>: Links this_node after prev_node in the linear list.
-   //!
-   //! <b>Complexity</b>: Constant
-   //!
-   //! <b>Throws</b>: Nothing.
-   static void link_after(node_ptr prev_node, node_ptr this_node) BOOST_NOEXCEPT;
-
-   //! <b>Requires</b>: b and e must be nodes of the same linear list or an empty range.
-   //!   and p must be a node of a different linear list.
-   //!
-   //! <b>Effects</b>: Removes the nodes from (b, e] range from their linear list and inserts
-   //!   them after p in p's linear list.
-   //!
-   //! <b>Complexity</b>: Constant
-   //!
-   //! <b>Throws</b>: Nothing.
-   static void transfer_after(node_ptr p, node_ptr b, node_ptr e) BOOST_NOEXCEPT;
-
-   #else
-
-   using base_t::transfer_after;
-
-   #endif   //#if defined(BOOST_INTRUSIVE_DOXYGEN_INVOKED)
-
-   //! <b>Effects</b>: Constructs an empty list, making this_node the only
-   //!   node of the circular list:
-   //!  <tt>NodeTraits::get_next(this_node) == this_node</tt>.
-   //!
-   //! <b>Complexity</b>: Constant
-   //!
-   //! <b>Throws</b>: Nothing.
-   BOOST_INTRUSIVE_FORCEINLINE static void init_header(node_ptr this_node) BOOST_NOEXCEPT
-   {  NodeTraits::set_next(this_node, node_ptr ());  }
-
-   //! <b>Requires</b>: 'p' is the first node of a list.
-   //!
-   //! <b>Effects</b>: Returns a pointer to a node that represents the "end" (one past end) node
-   //!
-   //! <b>Complexity</b>: Constant time.
-   //!
-   //! <b>Throws</b>: Nothing.
-   BOOST_INTRUSIVE_FORCEINLINE static node_ptr end_node(const_node_ptr) BOOST_NOEXCEPT
-   {  return node_ptr();   }
-
-   //! <b>Effects</b>: Returns true if this_node_points to an empty list.
-   //! 
-   //! <b>Complexity</b>: Constant
-   //!
-   //! <b>Throws</b>: Nothing.
-   BOOST_INTRUSIVE_FORCEINLINE static bool is_empty(const_node_ptr this_node) BOOST_NOEXCEPT
-   {  return !NodeTraits::get_next(this_node);  }
-
-   //! <b>Effects</b>: Returns true if this_node points to a sentinel node.
-   //! 
-   //! <b>Complexity</b>: Constant
-   //!
-   //! <b>Throws</b>: Nothing.
-   BOOST_INTRUSIVE_FORCEINLINE static bool is_sentinel(const_node_ptr this_node) BOOST_NOEXCEPT
-   {  return NodeTraits::get_next(this_node) == this_node;  }
-
-   //! <b>Effects</b>: Marks this node as a "sentinel" node, a special state that is different from "empty",
-   //!                 that can be used to mark a special state of the list
-   //!
-   //! <b>Complexity</b>: Constant
-   //!
-   //! <b>Throws</b>: Nothing.
-   BOOST_INTRUSIVE_FORCEINLINE static void set_sentinel(node_ptr this_node) BOOST_NOEXCEPT
-   {  NodeTraits::set_next(this_node, this_node);   }
-
-   //! <b>Requires</b>: this_node and prev_init_node must be in the same linear list.
-   //!
-   //! <b>Effects</b>: Returns the previous node of this_node in the linear list starting.
-   //!   the search from prev_init_node. The first node checked for equality
-   //!   is NodeTraits::get_next(prev_init_node).
-   //!
-   //! <b>Complexity</b>: Linear to the number of elements between prev_init_node and this_node.
-   //!
-   //! <b>Throws</b>: Nothing.
-   BOOST_INTRUSIVE_FORCEINLINE static node_ptr
-      get_previous_node(node_ptr prev_init_node, node_ptr this_node) BOOST_NOEXCEPT
-   {  return base_t::get_previous_node(prev_init_node, this_node);   }
-
-   //! <b>Requires</b>: this_node must be in a linear list or be an empty linear list.
-   //!
-   //! <b>Effects</b>: Returns the number of nodes in a linear list. If the linear list
-   //!  is empty, returns 1.
-   //!
-   //! <b>Complexity</b>: Linear
-   //!
-   //! <b>Throws</b>: Nothing.
-   static std::size_t count(const_node_ptr this_node) BOOST_NOEXCEPT
-   {
-      std::size_t result = 0;
-      const_node_ptr p = this_node;
-      do{
-         p = NodeTraits::get_next(p);
-         ++result;
-      } while (p);
-      return result;
-   }
-
-   //! <b>Requires</b>: this_node and other_node must be nodes inserted
-   //!  in linear lists or be empty linear lists.
-   //!
-   //! <b>Effects</b>: Moves all the nodes previously chained after this_node after other_node
-   //!   and vice-versa.
-   //!
-   //! <b>Complexity</b>: Constant
-   //!
-   //! <b>Throws</b>: Nothing.
-   BOOST_INTRUSIVE_FORCEINLINE static void swap_trailing_nodes(node_ptr this_node, node_ptr other_node) BOOST_NOEXCEPT
-   {
-      node_ptr this_nxt    = NodeTraits::get_next(this_node);
-      node_ptr other_nxt   = NodeTraits::get_next(other_node);
-      NodeTraits::set_next(this_node, other_nxt);
-      NodeTraits::set_next(other_node, this_nxt);
-   }
-
-   //! <b>Effects</b>: Reverses the order of elements in the list.
-   //!
-   //! <b>Returns</b>: The new first node of the list.
-   //!
-   //! <b>Throws</b>: Nothing.
-   //!
-   //! <b>Complexity</b>: This function is linear to the contained elements.
-   static node_ptr reverse(node_ptr p) BOOST_NOEXCEPT
-   {
-      if(!p) return node_ptr();
-      node_ptr i = NodeTraits::get_next(p);
-      node_ptr first(p);
-      while(i){
-         node_ptr nxti(NodeTraits::get_next(i));
-         base_t::unlink_after(p);
-         NodeTraits::set_next(i, first);
-         first = i;
-         i = nxti;
-      }
-      return first;
-   }
-
-   //! <b>Effects</b>: Moves the first n nodes starting at p to the end of the list.
-   //!
-   //! <b>Returns</b>: A pair containing the new first and last node of the list or
-   //!   if there has been any movement, a null pair if n leads to no movement.
-   //!
-   //! <b>Throws</b>: Nothing.
-   //!
-   //! <b>Complexity</b>: Linear to the number of elements plus the number moved positions.
-   static node_pair move_first_n_backwards(node_ptr p, std::size_t n) BOOST_NOEXCEPT
-   {
-      node_pair ret;
-      //Null shift, or count() == 0 or 1, nothing to do
-      if(!n || !p || !NodeTraits::get_next(p)){
-         return ret;
-      }
-
-      node_ptr first = p;
-      bool end_found = false;
-      node_ptr new_last = node_ptr();
-      node_ptr old_last = node_ptr();
-
-      //Now find the new last node according to the shift count.
-      //If we find 0 before finding the new last node
-      //unlink p, shortcut the search now that we know the size of the list
-      //and continue.
-      for(std::size_t i = 1; i <= n; ++i){
-         new_last = first;
-         first = NodeTraits::get_next(first);
-         if(first == node_ptr()){
-            //Shortcut the shift with the modulo of the size of the list
-            n %= i;
-            if(!n)   return ret;
-            old_last = new_last;
-            i = 0;
-            //Unlink p and continue the new first node search
-            first = p;
-            //unlink_after(new_last);
-            end_found = true;
-         }
-      }
-
-      //If the p has not been found in the previous loop, find it
-      //starting in the new first node and unlink it
-      if(!end_found){
-         old_last = base_t::get_previous_node(first, node_ptr());
-      }
-
-      //Now link p after the new last node
-      NodeTraits::set_next(old_last, p);
-      NodeTraits::set_next(new_last, node_ptr());
-      ret.first   = first;
-      ret.second  = new_last;
-      return ret;
-   }
-
-   //! <b>Effects</b>: Moves the first n nodes starting at p to the beginning of the list.
-   //!
-   //! <b>Returns</b>: A pair containing the new first and last node of the list or
-   //!   if there has been any movement, a null pair if n leads to no movement.
-   //!
-   //! <b>Throws</b>: Nothing.
-   //!
-   //! <b>Complexity</b>: Linear to the number of elements plus the number moved positions.
-   static node_pair move_first_n_forward(node_ptr p, std::size_t n) BOOST_NOEXCEPT
-   {
-      node_pair ret;
-      //Null shift, or count() == 0 or 1, nothing to do
-      if(!n || !p || !NodeTraits::get_next(p))
-         return ret;
-
-      node_ptr first  = p;
-
-      //Iterate until p is found to know where the current last node is.
-      //If the shift count is less than the size of the list, we can also obtain
-      //the position of the new last node after the shift.
-      node_ptr old_last(first), next_to_it, new_last(p);
-      std::size_t distance = 1;
-      while(!!(next_to_it = node_traits::get_next(old_last))){
-         if(distance++ > n)
-            new_last = node_traits::get_next(new_last);
-         old_last = next_to_it;
-      }
-      //If the shift was bigger or equal than the size, obtain the equivalent
-      //forward shifts and find the new last node.
-      if(distance <= n){
-         //Now find the equivalent forward shifts.
-         //Shortcut the shift with the modulo of the size of the list
-         std::size_t new_before_last_pos = (distance - (n % distance))% distance;
-         //If the shift is a multiple of the size there is nothing to do
-         if(!new_before_last_pos)
-            return ret;
-
-         for( new_last = p
-            ; --new_before_last_pos
-            ; new_last = node_traits::get_next(new_last)){
-            //empty
-         }
-      }
-
-      //Get the first new node
-      node_ptr new_first(node_traits::get_next(new_last));
-      //Now put the old beginning after the old end
-      NodeTraits::set_next(old_last, p);
-      NodeTraits::set_next(new_last, node_ptr());
-      ret.first   = new_first;
-      ret.second  = new_last;
-      return ret;
-   }
-
-   //! <b>Requires</b>: other must be a list and p must be a node of a different linear list.
-   //!
-   //! <b>Effects</b>: Transfers all nodes from other after p in p's linear list.
-   //!
-   //! <b>Complexity</b>: Linear
-   //!
-   //! <b>Throws</b>: Nothing.
-   static void transfer_after(node_ptr p, node_ptr other) BOOST_NOEXCEPT
-   {
-      if ((is_empty)(p)) {
-         (swap_trailing_nodes)(p, other);
-      }
-      else {
-         node_ptr other_last((get_previous_node)(other, node_ptr()));
-         base_t::transfer_after(p, other, other_last);
-      }
-   }
-
-   //! <b>Requires</b>: "disposer" must be an object function
-   //!   taking a node_ptr parameter and shouldn't throw.
-   //!
-   //! <b>Effects</b>: Unlinks all nodes reachable from p (but not p) and calls
-   //!   <tt>void disposer::operator()(node_ptr)</tt> for every node of the list
-   //!    where p is linked.
-   //!
-   //! <b>Returns</b>: The number of disposed nodes
-   //!
-   //! <b>Complexity</b>: Linear to the number of element of the list.
-   //!
-   //! <b>Throws</b>: Nothing.
-   template<class Disposer>
-   BOOST_INTRUSIVE_FORCEINLINE static std::size_t detach_and_dispose(node_ptr p, Disposer disposer) BOOST_NOEXCEPT
-   {  return base_t::unlink_after_and_dispose(p, node_ptr(), disposer);   }
-};
-
-/// @cond
-
-template<class NodeTraits>
-struct get_algo<LinearSListAlgorithms, NodeTraits>
-{
-   typedef linear_slist_algorithms<NodeTraits> type;
-};
-
-/// @endcond
-
-} //namespace intrusive
-} //namespace boost
-
-#include <boost/intrusive/detail/config_end.hpp>
-
-#endif //BOOST_INTRUSIVE_LINEAR_SLIST_ALGORITHMS_HPP
diff --git a/src/boost/intrusive/link_mode.hpp b/src/boost/intrusive/link_mode.hpp
deleted file mode 100644
index 4ba4daff..00000000
--- a/src/boost/intrusive/link_mode.hpp
+++ /dev/null
@@ -1,63 +0,0 @@
-/////////////////////////////////////////////////////////////////////////////
-//
-// (C) Copyright Ion Gaztanaga  2006-2013
-//
-// Distributed under the Boost 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/intrusive for documentation.
-//
-/////////////////////////////////////////////////////////////////////////////
-
-#ifndef BOOST_INTRUSIVE_LINK_MODE_HPP
-#define BOOST_INTRUSIVE_LINK_MODE_HPP
-
-#if defined(BOOST_HAS_PRAGMA_ONCE)
-#  pragma once
-#endif
-
-namespace boost {
-namespace intrusive {
-
-//!This enumeration defines the type of value_traits that can be defined
-//!for Boost.Intrusive containers
-enum link_mode_type{
-   //!If this linking policy is specified in a value_traits class
-   //!as the link_mode, containers
-   //!configured with such value_traits won't set the hooks
-   //!of the erased values to a default state. Containers also won't
-   //!check that the hooks of the new values are default initialized.
-   normal_link,
-
-   //!If this linking policy is specified in a value_traits class
-   //!as the link_mode, containers
-   //!configured with such value_traits will set the hooks
-   //!of the erased values to a default state. Containers also will
-   //!check that the hooks of the new values are default initialized.
-   safe_link,
-
-   //!Same as "safe_link" but the user type is an auto-unlink
-   //!type, so the containers with constant-time size features won't be
-   //!compatible with value_traits configured with this policy.
-   //!Containers also know that the a value can be silently erased from
-   //!the container without using any function provided by the containers.
-   auto_unlink
-};
-
-#ifndef BOOST_INTRUSIVE_DOXYGEN_INVOKED
-
-template <link_mode_type link_mode>
-struct is_safe_autounlink
-{
-   static const bool value =
-      (int)link_mode == (int)auto_unlink   ||
-      (int)link_mode == (int)safe_link;
-};
-
-#endif   //BOOST_INTRUSIVE_DOXYGEN_INVOKED
-
-} //namespace intrusive
-} //namespace boost
-
-#endif //BOOST_INTRUSIVE_LINK_MODE_HPP
diff --git a/src/boost/intrusive/options.hpp b/src/boost/intrusive/options.hpp
deleted file mode 100644
index ff6902e8..00000000
--- a/src/boost/intrusive/options.hpp
+++ /dev/null
@@ -1,278 +0,0 @@
-/////////////////////////////////////////////////////////////////////////////
-//
-// (C) Copyright Ion Gaztanaga  2007-2014
-//
-// Distributed under the Boost 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/intrusive for documentation.
-//
-/////////////////////////////////////////////////////////////////////////////
-
-#ifndef BOOST_INTRUSIVE_OPTIONS_HPP
-#define BOOST_INTRUSIVE_OPTIONS_HPP
-
-#include <boost/intrusive/detail/config_begin.hpp>
-#include <boost/intrusive/intrusive_fwd.hpp>
-#include <boost/intrusive/link_mode.hpp>
-#include <boost/intrusive/pack_options.hpp>
-
-#if defined(BOOST_HAS_PRAGMA_ONCE)
-#  pragma once
-#endif
-
-namespace boost {
-namespace intrusive {
-
-#ifndef BOOST_INTRUSIVE_DOXYGEN_INVOKED
-
-struct empty
-{};
-
-template<class Functor>
-struct fhtraits;
-
-template<class T, class Hook, Hook T::* P>
-struct mhtraits;
-
-struct dft_tag;
-struct member_tag;
-
-template<class SupposedValueTraits>
-struct is_default_hook_tag;
-
-#endif   //#ifndef BOOST_INTRUSIVE_DOXYGEN_INVOKED
-
-//!This option setter specifies if the intrusive
-//!container stores its size as a member to
-//!obtain constant-time size() member.
-BOOST_INTRUSIVE_OPTION_CONSTANT(constant_time_size, bool, Enabled, constant_time_size)
-
-//!This option setter specifies a container header holder type
-BOOST_INTRUSIVE_OPTION_TYPE(header_holder_type, HeaderHolder, HeaderHolder, header_holder_type)
-
-//!This option setter specifies the type that
-//!the container will use to store its size.
-BOOST_INTRUSIVE_OPTION_TYPE(size_type, SizeType, SizeType, size_type)
-
-//!This option setter specifies the strict weak ordering
-//!comparison functor for the value type
-BOOST_INTRUSIVE_OPTION_TYPE(compare, Compare, Compare, compare)
-
-//!This option setter specifies a function object
-//!that specifies the type of the key of an associative
-//!container and an operator to obtain it from a value type.
-//!
-//!This function object must the define a `type` member typedef and
-//!a member with signature `type [const&] operator()(const value_type &) const`
-//!that will return the key from a value_type of an associative container
-BOOST_INTRUSIVE_OPTION_TYPE(key_of_value, KeyOfValue, KeyOfValue, key_of_value)
-
-//!This option setter specifies a function object
-//!that specifies the type of the priority of a treap
-//!container and an operator to obtain it from a value type.
-//!
-//!This function object must the define a `type` member typedef and
-//!a member with signature `type [const&] operator()(const value_type &) const`
-//!that will return the priority from a value_type of a treap container
-BOOST_INTRUSIVE_OPTION_TYPE(priority_of_value, PrioOfValue, PrioOfValue, priority_of_value)
-
-//!This option setter for scapegoat containers specifies if
-//!the intrusive scapegoat container should use a non-variable
-//!alpha value that does not need floating-point operations.
-//!
-//!If activated, the fixed alpha value is 1/sqrt(2). This
-//!option also saves some space in the container since
-//!the alpha value and some additional data does not need
-//!to be stored in the container.
-//!
-//!If the user only needs an alpha value near 1/sqrt(2), this
-//!option also improves performance since avoids logarithm
-//!and division operations when rebalancing the tree.
-BOOST_INTRUSIVE_OPTION_CONSTANT(floating_point, bool, Enabled, floating_point)
-
-//!This option setter specifies the equality
-//!functor for the value type
-BOOST_INTRUSIVE_OPTION_TYPE(equal, Equal, Equal, equal)
-
-//!This option setter specifies the priority comparison
-//!functor for the value type
-BOOST_INTRUSIVE_OPTION_TYPE(priority, Priority, Priority, priority)
-
-//!This option setter specifies the hash
-//!functor for the value type
-BOOST_INTRUSIVE_OPTION_TYPE(hash, Hash, Hash, hash)
-
-//!This option setter specifies the relationship between the type
-//!to be managed by the container (the value type) and the node to be
-//!used in the node algorithms. It also specifies the linking policy.
-BOOST_INTRUSIVE_OPTION_TYPE(value_traits, ValueTraits, ValueTraits, proto_value_traits)
-
-//#define BOOST_INTRUSIVE_COMMA ,
-//#define BOOST_INTRUSIVE_LESS <
-//#define BOOST_INTRUSIVE_MORE >
-//BOOST_INTRUSIVE_OPTION_TYPE (member_hook, Parent BOOST_INTRUSIVE_COMMA class MemberHook BOOST_INTRUSIVE_COMMA MemberHook Parent::* PtrToMember , mhtraits BOOST_INTRUSIVE_LESS Parent BOOST_INTRUSIVE_COMMA MemberHook BOOST_INTRUSIVE_COMMA PtrToMember BOOST_INTRUSIVE_MORE , proto_value_traits)
-//template< class Parent , class MemberHook , MemberHook Parent::* PtrToMember>
-//struct member_hook {
-//   template<class Base> struct pack : Base {
-//      typedef mhtraits < Parent , MemberHook , PtrToMember > proto_value_traits;
-//   };
-//};
-//
-//#undef BOOST_INTRUSIVE_COMMA
-//#undef BOOST_INTRUSIVE_LESS
-//#undef BOOST_INTRUSIVE_MORE
-
-//!This option setter specifies the member hook the
-//!container must use.
-template< typename Parent
-        , typename MemberHook
-        , MemberHook Parent::* PtrToMember>
-struct member_hook
-{
-// @cond
-//   typedef typename MemberHook::hooktags::node_traits node_traits;
-//   typedef typename node_traits::node node_type;
-//   typedef node_type Parent::* Ptr2MemNode;
-//   typedef mhtraits
-//      < Parent
-//      , node_traits
-//      //This cast is really ugly but necessary to reduce template bloat.
-//      //Since we control the layout between the hook and the node, and there is
-//      //always single inheritance, the offset of the node is exactly the offset of
-//      //the hook. Since the node type is shared between all member hooks, this saves
-//      //quite a lot of symbol stuff.
-//      , (Ptr2MemNode)PtrToMember
-//      , MemberHook::hooktags::link_mode> member_value_traits;
-   typedef mhtraits <Parent, MemberHook, PtrToMember> member_value_traits;
-   template<class Base>
-   struct pack : Base
-   {
-      typedef member_value_traits proto_value_traits;
-   };
-/// @endcond
-};
-
-//!This option setter specifies the function object that will
-//!be used to convert between values to be inserted in a container
-//!and the hook to be used for that purpose.
-BOOST_INTRUSIVE_OPTION_TYPE(function_hook, Functor, fhtraits<Functor>, proto_value_traits)
-
-//!This option setter specifies that the container
-//!must use the specified base hook
-BOOST_INTRUSIVE_OPTION_TYPE(base_hook, BaseHook, BaseHook, proto_value_traits)
-
-//!This option setter specifies the type of
-//!a void pointer. This will instruct the hook
-//!to use this type of pointer instead of the
-//!default one
-BOOST_INTRUSIVE_OPTION_TYPE(void_pointer, VoidPointer, VoidPointer, void_pointer)
-
-//!This option setter specifies the type of
-//!the tag of a base hook. A type cannot have two
-//!base hooks of the same type, so a tag can be used
-//!to differentiate two base hooks with otherwise same type
-BOOST_INTRUSIVE_OPTION_TYPE(tag, Tag, Tag, tag)
-
-//!This option setter specifies the link mode
-//!(normal_link, safe_link or auto_unlink)
-BOOST_INTRUSIVE_OPTION_CONSTANT(link_mode, link_mode_type, LinkType, link_mode)
-
-//!This option setter specifies if the hook
-//!should be optimized for size instead of for speed.
-BOOST_INTRUSIVE_OPTION_CONSTANT(optimize_size, bool, Enabled, optimize_size)
-
-//!This option setter specifies if the slist container should
-//!use a linear implementation instead of a circular one.
-BOOST_INTRUSIVE_OPTION_CONSTANT(linear, bool, Enabled, linear)
-
-//!If true, slist also stores a pointer to the last element of the singly linked list.
-//!This allows O(1) swap and splice_after(iterator, slist &) for circular slists and makes
-//!possible new functions like push_back(reference) and back().
-BOOST_INTRUSIVE_OPTION_CONSTANT(cache_last, bool, Enabled, cache_last)
-
-//!This option setter specifies the bucket traits
-//!class for unordered associative containers. When this option is specified,
-//!instead of using the default bucket traits, a user defined holder will be defined
-BOOST_INTRUSIVE_OPTION_TYPE(bucket_traits, BucketTraits, BucketTraits, bucket_traits)
-
-//!This option setter specifies if the unordered hook
-//!should offer room to store the hash value.
-//!Storing the hash in the hook will speed up rehashing
-//!processes in applications where rehashing is frequent,
-//!rehashing might throw or the value is heavy to hash.
-BOOST_INTRUSIVE_OPTION_CONSTANT(store_hash, bool, Enabled, store_hash)
-
-//!This option setter specifies if the unordered hook
-//!should offer room to store another link to another node
-//!with the same key.
-//!Storing this link will speed up lookups and insertions on
-//!unordered_multiset containers with a great number of elements
-//!with the same key.
-BOOST_INTRUSIVE_OPTION_CONSTANT(optimize_multikey, bool, Enabled, optimize_multikey)
-
-//!This option setter specifies if the length of the bucket array provided by
-//!the user will always be power of two.
-//!This allows using masks instead of the default modulo operation to determine
-//!the bucket number from the hash value, leading to better performance.
-//!In debug mode, the provided bucket array length will be checked with assertions.
-BOOST_INTRUSIVE_OPTION_CONSTANT(power_2_buckets, bool, Enabled, power_2_buckets)
-
-//!WARNING: this option is EXPERIMENTAL, don't use it in production code
-//!This option setter specifies if the length of the bucket array provided by
-//!the user will always be a value specified by the
-//!suggested_upper|lower_bucket_count call. This allows the use of some
-//!precomputed values and speeds hash to bucket index operations, leading
-//!to better performance.
-//!In debug mode, the provided bucket array length will be checked with assertions.
-BOOST_INTRUSIVE_OPTION_CONSTANT(fastmod_buckets, bool, Enabled, fastmod_buckets)
-
-//!This option setter specifies if the container will cache a pointer to the first
-//!non-empty bucket so that begin() is always constant-time.
-//!This is specially helpful when we can have containers with a few elements
-//!but with big bucket arrays (that is, hashtables with low load factors).
-BOOST_INTRUSIVE_OPTION_CONSTANT(cache_begin, bool, Enabled, cache_begin)
-
-//!This option setter specifies if the container will compare the hash value
-//!before comparing objects. This option can't be specified if store_hash<>
-//!is not true.
-//!This is specially helpful when we have containers with a high load factor.
-//!and the comparison function is much more expensive that comparing already
-//!stored hash values.
-BOOST_INTRUSIVE_OPTION_CONSTANT(compare_hash, bool, Enabled, compare_hash)
-
-//!This option setter specifies if the hash container will use incremental
-//!hashing. With incremental hashing the cost of hash table expansion is spread
-//!out across each hash table insertion operation, as opposed to be incurred all at once.
-//!Therefore linear hashing is well suited for interactive applications or real-time
-//!appplications where the worst-case insertion time of non-incremental hash containers
-//!(rehashing the whole bucket array) is not admisible.
-BOOST_INTRUSIVE_OPTION_CONSTANT(incremental, bool, Enabled, incremental)
-
-//!This option setter specifies if the buckets (which form a singly linked lists of nodes)
-//!are linear (true) or circular (false, default value). Linear buckets can improve performance
-//!in some cases, but the container loses some features like obtaining an iterator from a value.
-BOOST_INTRUSIVE_OPTION_CONSTANT(linear_buckets, bool, Enabled, linear_buckets)
-
-/// @cond
-
-struct hook_defaults
-{
-   typedef void* void_pointer;
-   static const link_mode_type link_mode = safe_link;
-   typedef dft_tag tag;
-   static const bool optimize_size = false;
-   static const bool store_hash = false;
-   static const bool linear = false;
-   static const bool optimize_multikey = false;
-};
-
-/// @endcond
-
-}  //namespace intrusive {
-}  //namespace boost {
-
-#include <boost/intrusive/detail/config_end.hpp>
-
-#endif   //#ifndef BOOST_INTRUSIVE_OPTIONS_HPP
diff --git a/src/boost/intrusive/pack_options.hpp b/src/boost/intrusive/pack_options.hpp
deleted file mode 100644
index 66761d76..00000000
--- a/src/boost/intrusive/pack_options.hpp
+++ /dev/null
@@ -1,384 +0,0 @@
-/////////////////////////////////////////////////////////////////////////////
-//
-// (C) Copyright Ion Gaztanaga  2013-2013
-//
-// Distributed under the Boost 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/intrusive for documentation.
-//
-/////////////////////////////////////////////////////////////////////////////
-
-#ifndef BOOST_INTRUSIVE_PACK_OPTIONS_HPP
-#define BOOST_INTRUSIVE_PACK_OPTIONS_HPP
-
-#include <boost/intrusive/detail/config_begin.hpp>
-
-#if defined(BOOST_HAS_PRAGMA_ONCE)
-#  pragma once
-#endif
-
-#include <cstddef>
-
-namespace boost {
-namespace intrusive {
-
-#ifndef BOOST_INTRUSIVE_DOXYGEN_INVOKED
-
-#if !defined(BOOST_INTRUSIVE_VARIADIC_TEMPLATES)
-
-template<class Prev, class Next>
-struct do_pack
-{
-   //Use "pack" member template to pack options
-   typedef typename Next::template pack<Prev> type;
-};
-
-template<class Prev>
-struct do_pack<Prev, void>
-{
-   //Avoid packing "void" to shorten template names
-   typedef Prev type;
-};
-
-template
-   < class DefaultOptions
-   , class O1         = void
-   , class O2         = void
-   , class O3         = void
-   , class O4         = void
-   , class O5         = void
-   , class O6         = void
-   , class O7         = void
-   , class O8         = void
-   , class O9         = void
-   , class O10        = void
-   , class O11        = void
-   >
-struct pack_options
-{
-   // join options
-   typedef
-      typename do_pack
-      <  typename do_pack
-         <  typename do_pack
-            <  typename do_pack
-               <  typename do_pack
-                  <  typename do_pack
-                     <  typename do_pack
-                        <  typename do_pack
-                           <  typename do_pack
-                              <  typename do_pack
-                                 <  typename do_pack
-                                    < DefaultOptions
-                                    , O1
-                                    >::type
-                                 , O2
-                                 >::type
-                              , O3
-                              >::type
-                           , O4
-                           >::type
-                        , O5
-                        >::type
-                     , O6
-                     >::type
-                  , O7
-                  >::type
-               , O8
-               >::type
-            , O9
-            >::type
-         , O10
-         >::type
-      , O11
-      >::type
-   type;
-};
-#else
-
-//index_tuple
-template<std::size_t... Indexes>
-struct index_tuple{};
-
-//build_number_seq
-template<std::size_t Num, typename Tuple = index_tuple<> >
-struct build_number_seq;
-
-template<std::size_t Num, std::size_t... Indexes>
-struct build_number_seq<Num, index_tuple<Indexes...> >
-   : build_number_seq<Num - 1, index_tuple<Indexes..., sizeof...(Indexes)> >
-{};
-
-template<std::size_t... Indexes>
-struct build_number_seq<0, index_tuple<Indexes...> >
-{  typedef index_tuple<Indexes...> type;  };
-
-template<class ...Types>
-struct typelist
-{};
-
-//invert_typelist
-template<class T>
-struct invert_typelist;
-
-template<std::size_t I, typename Tuple>
-struct typelist_element;
-
-template<std::size_t I, typename Head, typename... Tail>
-struct typelist_element<I, typelist<Head, Tail...> >
-{
-   typedef typename typelist_element<I-1, typelist<Tail...> >::type type;
-};
-
-template<typename Head, typename... Tail>
-struct typelist_element<0, typelist<Head, Tail...> >
-{
-   typedef Head type;
-};
-
-template<std::size_t ...Ints, class ...Types>
-typelist<typename typelist_element<(sizeof...(Types) - 1) - Ints, typelist<Types...> >::type...>
-   inverted_typelist(index_tuple<Ints...>, typelist<Types...>)
-{
-   return typelist<typename typelist_element<(sizeof...(Types) - 1) - Ints, typelist<Types...> >::type...>();
-}
-
-//sizeof_typelist
-template<class Typelist>
-struct sizeof_typelist;
-
-template<class ...Types>
-struct sizeof_typelist< typelist<Types...> >
-{
-   static const std::size_t value = sizeof...(Types);
-};
-
-//invert_typelist_impl
-template<class Typelist, class Indexes>
-struct invert_typelist_impl;
-
-
-template<class Typelist, std::size_t ...Ints>
-struct invert_typelist_impl< Typelist, index_tuple<Ints...> >
-{
-   static const std::size_t last_idx = sizeof_typelist<Typelist>::value - 1;
-   typedef typelist
-      <typename typelist_element<last_idx - Ints, Typelist>::type...> type;
-};
-
-template<class Typelist, std::size_t Int>
-struct invert_typelist_impl< Typelist, index_tuple<Int> >
-{
-   typedef Typelist type;
-};
-
-template<class Typelist>
-struct invert_typelist_impl< Typelist, index_tuple<> >
-{
-   typedef Typelist type;
-};
-
-//invert_typelist
-template<class Typelist>
-struct invert_typelist;
-
-template<class ...Types>
-struct invert_typelist< typelist<Types...> >
-{
-   typedef typelist<Types...> typelist_t;
-   typedef typename build_number_seq<sizeof...(Types)>::type indexes_t;
-   typedef typename invert_typelist_impl<typelist_t, indexes_t>::type type;
-};
-
-//Do pack
-template<class Typelist>
-struct do_pack;
-
-template<>
-struct do_pack<typelist<> >;
-
-template<class Prev>
-struct do_pack<typelist<Prev> >
-{
-   typedef Prev type;
-};
-
-template<class Prev, class Last>
-struct do_pack<typelist<Prev, Last> >
-{
-   typedef typename Prev::template pack<Last> type;
-};
-
-template<class ...Others>
-struct do_pack<typelist<void, Others...> >
-{
-   typedef typename do_pack<typelist<Others...> >::type type;
-};
-
-template<class Prev, class ...Others>
-struct do_pack<typelist<Prev, Others...> >
-{
-   typedef typename Prev::template pack
-      <typename do_pack<typelist<Others...> >::type> type;
-};
-
-
-template<class DefaultOptions, class ...Options>
-struct pack_options
-{
-   typedef typelist<DefaultOptions, Options...> typelist_t;
-   typedef typename invert_typelist<typelist_t>::type inverted_typelist;
-   typedef typename do_pack<inverted_typelist>::type type;
-};
-
-#endif   //!defined(BOOST_INTRUSIVE_VARIADIC_TEMPLATES)
-
-#define BOOST_INTRUSIVE_OPTION_TYPE(OPTION_NAME, TYPE, TYPEDEF_EXPR, TYPEDEF_NAME) \
-template< class TYPE> \
-struct OPTION_NAME \
-{ \
-   template<class Base> \
-   struct pack : Base \
-   { \
-      typedef TYPEDEF_EXPR TYPEDEF_NAME; \
-   }; \
-}; \
-//
-
-#define BOOST_INTRUSIVE_OPTION_CONSTANT(OPTION_NAME, TYPE, VALUE, CONSTANT_NAME) \
-template< TYPE VALUE> \
-struct OPTION_NAME \
-{ \
-   static const TYPE value = VALUE; \
- \
-   template<class Base> \
-   struct pack : Base \
-   { \
-      static const TYPE CONSTANT_NAME = VALUE; \
-   }; \
-}; \
-//
-
-#else    //#ifndef BOOST_INTRUSIVE_DOXYGEN_INVOKED
-
-//! This class is a utility that takes:
-//!   - a default options class defining initial static constant
-//!   and typedefs
-//!   - several options defined with BOOST_INTRUSIVE_OPTION_CONSTANT and
-//! BOOST_INTRUSIVE_OPTION_TYPE
-//!
-//! and packs them together in a new type that defines all options as
-//! member typedefs or static constant values. Given options of form:
-//!
-//! \code
-//!   BOOST_INTRUSIVE_OPTION_TYPE(my_pointer, VoidPointer, VoidPointer, my_pointer_type)
-//!   BOOST_INTRUSIVE_OPTION_CONSTANT(incremental, bool, Enabled, is_incremental)
-//! \endcode
-//!
-//! the following expression
-//!
-//! \code
-//!
-//! struct default_options
-//! {
-//!   typedef long      int_type;
-//!   static const int  int_constant = -1;
-//! };
-//!
-//! pack_options< default_options, my_pointer<void*>, incremental<true> >::type
-//! \endcode
-//!
-//! will create a type that will contain the following typedefs/constants
-//!
-//! \code
-//!   struct unspecified_type
-//!   {
-//!      //Default options
-//!      typedef long      int_type;
-//!      static const int  int_constant  = -1;
-//!
-//!      //Packed options (will ovewrite any default option)
-//!      typedef void*     my_pointer_type;
-//!      static const bool is_incremental = true;
-//!   };
-//! \endcode
-//!
-//! If an option is specified in the default options argument and later
-//! redefined as an option, the last definition will prevail.
-template<class DefaultOptions, class ...Options>
-struct pack_options
-{
-   typedef unspecified_type type;
-};
-
-//! Defines an option class of name OPTION_NAME that can be used to specify a type
-//! of type TYPE...
-//!
-//! \code
-//! struct OPTION_NAME<class TYPE>
-//! {  unspecified_content  };
-//! \endcode
-//!
-//! ...that after being combined with
-//! <code>boost::intrusive::pack_options</code>,
-//! will typedef TYPE as a typedef of name TYPEDEF_NAME. Example:
-//!
-//! \code
-//!   //[includes and namespaces omitted for brevity]
-//!
-//!   //This macro will create the following class:
-//!   //    template<class VoidPointer>
-//!   //    struct my_pointer
-//!   //    { unspecified_content };
-//!   BOOST_INTRUSIVE_OPTION_TYPE(my_pointer, VoidPointer, boost::remove_pointer<VoidPointer>::type, my_pointer_type)
-//!
-//!   struct empty_default{};
-//!
-//!   typedef pack_options< empty_default, typename my_pointer<void*> >::type::my_pointer_type type;
-//!
-//!   BOOST_STATIC_ASSERT(( boost::is_same<type, void>::value ));
-//!
-//! \endcode
-#define BOOST_INTRUSIVE_OPTION_TYPE(OPTION_NAME, TYPE, TYPEDEF_EXPR, TYPEDEF_NAME)
-
-//! Defines an option class of name OPTION_NAME that can be used to specify a constant
-//! of type TYPE with value VALUE...
-//!
-//! \code
-//! struct OPTION_NAME<TYPE VALUE>
-//! {  unspecified_content  };
-//! \endcode
-//!
-//! ...that after being combined with
-//! <code>boost::intrusive::pack_options</code>,
-//! will contain a CONSTANT_NAME static constant of value VALUE. Example:
-//!
-//! \code
-//!   //[includes and namespaces omitted for brevity]
-//!
-//!   //This macro will create the following class:
-//!   //    template<bool Enabled>
-//!   //    struct incremental
-//!   //    { unspecified_content };
-//!   BOOST_INTRUSIVE_OPTION_CONSTANT(incremental, bool, Enabled, is_incremental)
-//!
-//!   struct empty_default{};
-//!
-//!   const bool is_incremental = pack_options< empty_default, incremental<true> >::type::is_incremental;
-//!
-//!   BOOST_STATIC_ASSERT(( is_incremental == true ));
-//!
-//! \endcode
-#define BOOST_INTRUSIVE_OPTION_CONSTANT(OPTION_NAME, TYPE, VALUE, CONSTANT_NAME)
-
-#endif   //#ifndef BOOST_INTRUSIVE_DOXYGEN_INVOKED
-
-
-}  //namespace intrusive {
-}  //namespace boost {
-
-#include <boost/intrusive/detail/config_end.hpp>
-
-#endif   //#ifndef BOOST_INTRUSIVE_PACK_OPTIONS_HPP
diff --git a/src/boost/intrusive/parent_from_member.hpp b/src/boost/intrusive/parent_from_member.hpp
deleted file mode 100644
index 9c8f167d..00000000
--- a/src/boost/intrusive/parent_from_member.hpp
+++ /dev/null
@@ -1,49 +0,0 @@
-/////////////////////////////////////////////////////////////////////////////
-//
-// (C) Copyright Ion Gaztanaga  2010-2013
-//
-// Distributed under the Boost 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/intrusive for documentation.
-//
-/////////////////////////////////////////////////////////////////////////////
-#ifndef BOOST_INTRUSIVE_PARENT_FROM_MEMBER_HPP
-#define BOOST_INTRUSIVE_PARENT_FROM_MEMBER_HPP
-
-#include <boost/intrusive/detail/config_begin.hpp>
-#include <boost/intrusive/detail/workaround.hpp>
-#include <boost/intrusive/intrusive_fwd.hpp>
-
-#include <boost/intrusive/detail/parent_from_member.hpp>
-
-#if defined(BOOST_HAS_PRAGMA_ONCE)
-#  pragma once
-#endif
-
-namespace boost {
-namespace intrusive {
-
-//! Given a pointer to a member and its corresponding pointer to data member,
-//! this function returns the pointer of the parent containing that member.
-//! Note: this function does not work with pointer to members that rely on
-//! virtual inheritance.
-template<class Parent, class Member>
-BOOST_INTRUSIVE_FORCEINLINE Parent *get_parent_from_member(Member *member, const Member Parent::* ptr_to_member) BOOST_NOEXCEPT
-{  return ::boost::intrusive::detail::parent_from_member(member, ptr_to_member);  }
-
-//! Given a const pointer to a member and its corresponding const pointer to data member,
-//! this function returns the const pointer of the parent containing that member.
-//! Note: this function does not work with pointer to members that rely on
-//! virtual inheritance.
-template<class Parent, class Member>
-BOOST_INTRUSIVE_FORCEINLINE const Parent *get_parent_from_member(const Member *member, const Member Parent::* ptr_to_member) BOOST_NOEXCEPT
-{  return ::boost::intrusive::detail::parent_from_member(member, ptr_to_member);  }
-
-}  //namespace intrusive {
-}  //namespace boost {
-
-#include <boost/intrusive/detail/config_end.hpp>
-
-#endif   //#ifndef BOOST_INTRUSIVE_PARENT_FROM_MEMBER_HPP
diff --git a/src/boost/intrusive/pointer_plus_bits.hpp b/src/boost/intrusive/pointer_plus_bits.hpp
deleted file mode 100644
index b967bb63..00000000
--- a/src/boost/intrusive/pointer_plus_bits.hpp
+++ /dev/null
@@ -1,112 +0,0 @@
-/////////////////////////////////////////////////////////////////////////////
-//
-// (C) Copyright Ion Gaztanaga  2007-2013
-//
-// Distributed under the Boost 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/intrusive for documentation.
-//
-/////////////////////////////////////////////////////////////////////////////
-
-#ifndef BOOST_INTRUSIVE_POINTER_PLUS_BITS_HPP
-#define BOOST_INTRUSIVE_POINTER_PLUS_BITS_HPP
-
-#include <boost/intrusive/detail/config_begin.hpp>
-#include <boost/intrusive/intrusive_fwd.hpp>
-#include <boost/intrusive/detail/mpl.hpp> //ls_zeros
-#include <boost/intrusive/detail/assert.hpp> //BOOST_INTRUSIVE_INVARIANT_ASSERT
-
-#if defined(BOOST_HAS_PRAGMA_ONCE)
-#  pragma once
-#endif
-
-
-//GCC reports uninitialized values when an uninitialized pointer plus bits type
-//is asigned some bits or some pointer value, but that's ok, because we don't want
-//to default initialize parts that are not being updated.
-#if defined(BOOST_GCC)
-#  if (BOOST_GCC >= 40600)
-#     pragma GCC diagnostic push
-#     pragma GCC diagnostic ignored "-Wuninitialized"
-#     if (BOOST_GCC >= 40700)
-#        pragma GCC diagnostic ignored "-Wmaybe-uninitialized"
-#     endif
-#  endif
-#endif
-
-namespace boost {
-namespace intrusive {
-
-//!This trait class is used to know if a pointer
-//!can embed extra bits of information if
-//!it's going to be used to point to objects
-//!with an alignment of "Alignment" bytes.
-template<class VoidPointer, std::size_t Alignment>
-struct max_pointer_plus_bits
-{
-   static const std::size_t value = 0;
-};
-
-//!This is a specialization for raw pointers.
-//!Raw pointers can embed extra bits in the lower bits
-//!if the alignment is multiple of 2pow(NumBits).
-template<std::size_t Alignment>
-struct max_pointer_plus_bits<void*, Alignment>
-{
-   static const std::size_t value = detail::ls_zeros<Alignment>::value;
-};
-
-//!This is class that is supposed to have static methods
-//!to embed extra bits of information in a pointer.
-//!This is a declaration and there is no default implementation,
-//!because operations to embed the bits change with every pointer type.
-//!
-//!An implementation that detects that a pointer type whose
-//!has_pointer_plus_bits<>::value is non-zero can make use of these
-//!operations to embed the bits in the pointer.
-template<class Pointer, std::size_t NumBits>
-struct pointer_plus_bits
-   #ifdef BOOST_INTRUSIVE_DOXYGEN_INVOKED
-   {}
-   #endif
-;
-
-//!This is the specialization to embed extra bits of information
-//!in a raw pointer. The extra bits are stored in the lower bits of the pointer.
-template<class T, std::size_t NumBits>
-struct pointer_plus_bits<T*, NumBits>
-{
-   static const uintptr_t Mask = uintptr_t((uintptr_t(1u) << NumBits) - 1);
-   typedef T*        pointer;
-
-   BOOST_INTRUSIVE_FORCEINLINE static pointer get_pointer(pointer n) BOOST_NOEXCEPT
-   {  return pointer(uintptr_t(n) & uintptr_t(~Mask));  }
-
-   BOOST_INTRUSIVE_FORCEINLINE static void set_pointer(pointer &n, pointer p) BOOST_NOEXCEPT
-   {
-      BOOST_INTRUSIVE_INVARIANT_ASSERT(0 == (uintptr_t(p) & Mask));
-      n = pointer(uintptr_t(p) | (uintptr_t(n) & Mask));
-   }
-
-   BOOST_INTRUSIVE_FORCEINLINE static std::size_t get_bits(pointer n) BOOST_NOEXCEPT
-   {  return std::size_t(uintptr_t(n) & Mask);  }
-
-   BOOST_INTRUSIVE_FORCEINLINE static void set_bits(pointer &n, std::size_t c) BOOST_NOEXCEPT
-   {
-      BOOST_INTRUSIVE_INVARIANT_ASSERT(uintptr_t(c) <= Mask);
-      n = pointer(uintptr_t((get_pointer)(n)) | uintptr_t(c));
-   }
-};
-
-} //namespace intrusive
-} //namespace boost
-
-#if defined(BOOST_GCC) && (BOOST_GCC >= 40600)
-#  pragma GCC diagnostic pop
-#endif
-
-#include <boost/intrusive/detail/config_end.hpp>
-
-#endif //BOOST_INTRUSIVE_POINTER_PLUS_BITS_HPP
diff --git a/src/boost/intrusive/pointer_rebind.hpp b/src/boost/intrusive/pointer_rebind.hpp
deleted file mode 100644
index 9592e06e..00000000
--- a/src/boost/intrusive/pointer_rebind.hpp
+++ /dev/null
@@ -1,188 +0,0 @@
-//////////////////////////////////////////////////////////////////////////////
-//
-// (C) Copyright Ion Gaztanaga 2014-2014. Distributed under the Boost
-// 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/intrusive for documentation.
-//
-//////////////////////////////////////////////////////////////////////////////
-
-#ifndef BOOST_INTRUSIVE_POINTER_REBIND_HPP
-#define BOOST_INTRUSIVE_POINTER_REBIND_HPP
-
-#ifndef BOOST_INTRUSIVE_DETAIL_WORKAROUND_HPP
-#include <boost/intrusive/detail/workaround.hpp>
-#endif   //BOOST_INTRUSIVE_DETAIL_WORKAROUND_HPP
-
-#ifndef BOOST_CONFIG_HPP
-#  include <boost/config.hpp>
-#endif
-
-#if defined(BOOST_HAS_PRAGMA_ONCE)
-#  pragma once
-#endif
-
-namespace boost {
-namespace intrusive {
-
-///////////////////////////
-//struct pointer_rebind_mode
-///////////////////////////
-template <typename Ptr, typename U>
-struct pointer_has_rebind
-{
-   template <typename V> struct any
-   {  any(const V&) { } };
-
-   template <typename X>
-   static char test(int, typename X::template rebind<U>*);
-
-   template <typename X>
-   static int test(any<int>, void*);
-
-   static const bool value = (1 == sizeof(test<Ptr>(0, 0)));
-};
-
-template <typename Ptr, typename U>
-struct pointer_has_rebind_other
-{
-   template <typename V> struct any
-   {  any(const V&) { } };
-
-   template <typename X>
-   static char test(int, typename X::template rebind<U>::other*);
-
-   template <typename X>
-   static int test(any<int>, void*);
-
-   static const bool value = (1 == sizeof(test<Ptr>(0, 0)));
-};
-
-template <typename Ptr, typename U>
-struct pointer_rebind_mode
-{
-   static const unsigned int rebind =       (unsigned int)pointer_has_rebind<Ptr, U>::value;
-   static const unsigned int rebind_other = (unsigned int)pointer_has_rebind_other<Ptr, U>::value;
-   static const unsigned int mode =         rebind + rebind*rebind_other;
-};
-
-////////////////////////
-//struct pointer_rebinder
-////////////////////////
-template <typename Ptr, typename U, unsigned int RebindMode>
-struct pointer_rebinder;
-
-// Implementation of pointer_rebinder<U>::type if Ptr has
-// its own rebind<U>::other type (C++03)
-template <typename Ptr, typename U>
-struct pointer_rebinder< Ptr, U, 2u >
-{
-   typedef typename Ptr::template rebind<U>::other type;
-};
-
-// Implementation of pointer_rebinder<U>::type if Ptr has
-// its own rebind template.
-template <typename Ptr, typename U>
-struct pointer_rebinder< Ptr, U, 1u >
-{
-   typedef typename Ptr::template rebind<U> type;
-};
-
-// Specialization of pointer_rebinder if Ptr does not
-// have its own rebind template but has a the form Ptr<A, An...>,
-// where An... comprises zero or more type parameters.
-// Many types fit this form, hence many pointers will get a
-// reasonable default for rebind.
-#if !defined(BOOST_NO_CXX11_VARIADIC_TEMPLATES)
-
-template <template <class, class...> class Ptr, typename A, class... An, class U>
-struct pointer_rebinder<Ptr<A, An...>, U, 0u >
-{
-   typedef Ptr<U, An...> type;
-};
-
-//Needed for non-conforming compilers like GCC 4.3
-template <template <class> class Ptr, typename A, class U>
-struct pointer_rebinder<Ptr<A>, U, 0u >
-{
-   typedef Ptr<U> type;
-};
-
-#else //C++03 compilers
-
-template <template <class> class Ptr  //0arg
-         , typename A
-         , class U>
-struct pointer_rebinder<Ptr<A>, U, 0u>
-{  typedef Ptr<U> type;   };
-
-template <template <class, class> class Ptr  //1arg
-         , typename A, class P0
-         , class U>
-struct pointer_rebinder<Ptr<A, P0>, U, 0u>
-{  typedef Ptr<U, P0> type;   };
-
-template <template <class, class, class> class Ptr  //2arg
-         , typename A, class P0, class P1
-         , class U>
-struct pointer_rebinder<Ptr<A, P0, P1>, U, 0u>
-{  typedef Ptr<U, P0, P1> type;   };
-
-template <template <class, class, class, class> class Ptr  //3arg
-         , typename A, class P0, class P1, class P2
-         , class U>
-struct pointer_rebinder<Ptr<A, P0, P1, P2>, U, 0u>
-{  typedef Ptr<U, P0, P1, P2> type;   };
-
-template <template <class, class, class, class, class> class Ptr  //4arg
-         , typename A, class P0, class P1, class P2, class P3
-         , class U>
-struct pointer_rebinder<Ptr<A, P0, P1, P2, P3>, U, 0u>
-{  typedef Ptr<U, P0, P1, P2, P3> type;   };
-
-template <template <class, class, class, class, class, class> class Ptr  //5arg
-         , typename A, class P0, class P1, class P2, class P3, class P4
-         , class U>
-struct pointer_rebinder<Ptr<A, P0, P1, P2, P3, P4>, U, 0u>
-{  typedef Ptr<U, P0, P1, P2, P3, P4> type;   };
-
-template <template <class, class, class, class, class, class, class> class Ptr  //6arg
-         , typename A, class P0, class P1, class P2, class P3, class P4, class P5
-         , class U>
-struct pointer_rebinder<Ptr<A, P0, P1, P2, P3, P4, P5>, U, 0u>
-{  typedef Ptr<U, P0, P1, P2, P3, P4, P5> type;   };
-
-template <template <class, class, class, class, class, class, class, class> class Ptr  //7arg
-         , typename A, class P0, class P1, class P2, class P3, class P4, class P5, class P6
-         , class U>
-struct pointer_rebinder<Ptr<A, P0, P1, P2, P3, P4, P5, P6>, U, 0u>
-{  typedef Ptr<U, P0, P1, P2, P3, P4, P5, P6> type;   };
-
-template <template <class, class, class, class, class, class, class, class, class> class Ptr  //8arg
-         , typename A, class P0, class P1, class P2, class P3, class P4, class P5, class P6, class P7
-         , class U>
-struct pointer_rebinder<Ptr<A, P0, P1, P2, P3, P4, P5, P6, P7>, U, 0u>
-{  typedef Ptr<U, P0, P1, P2, P3, P4, P5, P6, P7> type;   };
-
-template <template <class, class, class, class, class, class, class, class, class, class> class Ptr  //9arg
-         , typename A, class P0, class P1, class P2, class P3, class P4, class P5, class P6, class P7, class P8
-         , class U>
-struct pointer_rebinder<Ptr<A, P0, P1, P2, P3, P4, P5, P6, P7, P8>, U, 0u>
-{  typedef Ptr<U, P0, P1, P2, P3, P4, P5, P6, P7, P8> type;   };
-
-#endif   //!defined(BOOST_NO_CXX11_VARIADIC_TEMPLATES)
-
-template <typename Ptr, typename U>
-struct pointer_rebind
-   : public pointer_rebinder<Ptr, U, pointer_rebind_mode<Ptr, U>::mode>
-{};
-
-template <typename T, typename U>
-struct pointer_rebind<T*, U>
-{  typedef U* type; };
-
-}  //namespace container {
-}  //namespace boost {
-
-#endif // defined(BOOST_INTRUSIVE_POINTER_REBIND_HPP)
diff --git a/src/boost/intrusive/pointer_traits.hpp b/src/boost/intrusive/pointer_traits.hpp
deleted file mode 100644
index 1b2ed057..00000000
--- a/src/boost/intrusive/pointer_traits.hpp
+++ /dev/null
@@ -1,326 +0,0 @@
-//////////////////////////////////////////////////////////////////////////////
-//
-// (C) Copyright Pablo Halpern 2009. Distributed under the Boost
-// Software License, Version 1.0. (See accompanying file
-// LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
-//
-//////////////////////////////////////////////////////////////////////////////
-//
-// (C) Copyright Ion Gaztanaga 2011-2014. Distributed under the Boost
-// 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/intrusive for documentation.
-//
-//////////////////////////////////////////////////////////////////////////////
-
-#ifndef BOOST_INTRUSIVE_POINTER_TRAITS_HPP
-#define BOOST_INTRUSIVE_POINTER_TRAITS_HPP
-
-#include <boost/intrusive/detail/config_begin.hpp>
-#include <boost/intrusive/detail/workaround.hpp>
-#include <boost/intrusive/pointer_rebind.hpp>
-#include <boost/move/detail/pointer_element.hpp>
-#include <boost/intrusive/detail/mpl.hpp>
-#include <cstddef>
-
-#if defined(BOOST_HAS_PRAGMA_ONCE)
-#  pragma once
-#endif
-
-namespace boost {
-namespace intrusive {
-namespace detail {
-
-#if !defined(BOOST_MSVC) || (BOOST_MSVC > 1310)
-BOOST_INTRUSIVE_HAS_STATIC_MEMBER_FUNC_SIGNATURE(has_member_function_callable_with_pointer_to, pointer_to)
-BOOST_INTRUSIVE_HAS_STATIC_MEMBER_FUNC_SIGNATURE(has_member_function_callable_with_dynamic_cast_from, dynamic_cast_from)
-BOOST_INTRUSIVE_HAS_STATIC_MEMBER_FUNC_SIGNATURE(has_member_function_callable_with_static_cast_from, static_cast_from)
-BOOST_INTRUSIVE_HAS_STATIC_MEMBER_FUNC_SIGNATURE(has_member_function_callable_with_const_cast_from, const_cast_from)
-#else
-BOOST_INTRUSIVE_HAS_MEMBER_FUNC_CALLED_IGNORE_SIGNATURE(has_member_function_callable_with_pointer_to, pointer_to)
-BOOST_INTRUSIVE_HAS_MEMBER_FUNC_CALLED_IGNORE_SIGNATURE(has_member_function_callable_with_dynamic_cast_from, dynamic_cast_from)
-BOOST_INTRUSIVE_HAS_MEMBER_FUNC_CALLED_IGNORE_SIGNATURE(has_member_function_callable_with_static_cast_from, static_cast_from)
-BOOST_INTRUSIVE_HAS_MEMBER_FUNC_CALLED_IGNORE_SIGNATURE(has_member_function_callable_with_const_cast_from, const_cast_from)
-#endif
-
-BOOST_INTRUSIVE_INSTANTIATE_EVAL_DEFAULT_TYPE_TMPLT(element_type)
-BOOST_INTRUSIVE_INSTANTIATE_DEFAULT_TYPE_TMPLT(difference_type)
-BOOST_INTRUSIVE_INSTANTIATE_DEFAULT_TYPE_TMPLT(size_type)
-BOOST_INTRUSIVE_INSTANTIATE_DEFAULT_TYPE_TMPLT(reference)
-BOOST_INTRUSIVE_INSTANTIATE_DEFAULT_TYPE_TMPLT(value_traits_ptr)
-
-}  //namespace detail {
-
-
-//! pointer_traits is the implementation of C++11 std::pointer_traits class with some
-//! extensions like castings.
-//!
-//! pointer_traits supplies a uniform interface to certain attributes of pointer-like types.
-//!
-//! <b>Note</b>: When defining a custom family of pointers or references to be used with BI
-//! library, make sure the public static conversion functions accessed through
-//! the `pointer_traits` interface (`*_cast_from` and `pointer_to`) can
-//! properly convert between const and nonconst referred member types
-//! <b>without the use of implicit constructor calls</b>. It is suggested these
-//! conversions be implemented as function templates, where the template
-//! argument is the type of the object being converted from.
-template <typename Ptr>
-struct pointer_traits
-{
-   #ifdef BOOST_INTRUSIVE_DOXYGEN_INVOKED
-      //!The pointer type
-      //!queried by this pointer_traits instantiation
-      typedef Ptr             pointer;
-
-      //!Ptr::element_type if such a type exists; otherwise, T if Ptr is a class
-      //!template instantiation of the form SomePointer<T, Args>, where Args is zero or
-      //!more type arguments ; otherwise , the specialization is ill-formed.
-      typedef unspecified_type element_type;
-
-      //!Ptr::difference_type if such a type exists; otherwise,
-      //!std::ptrdiff_t.
-      typedef unspecified_type difference_type;
-
-      //!Ptr::rebind<U> if such a type exists; otherwise, SomePointer<U, Args> if Ptr is
-      //!a class template instantiation of the form SomePointer<T, Args>, where Args is zero or
-      //!more type arguments ; otherwise, the instantiation of rebind is ill-formed.
-      //!
-      //!For portable code for C++03 and C++11, <pre>typename rebind_pointer<U>::type</pre>
-      //!shall be used instead of rebind<U> to obtain a pointer to U.
-      template <class U> using rebind = unspecified;
-
-      //!Ptr::reference if such a type exists (non-standard extension); otherwise, element_type &
-      //!
-      typedef unspecified_type reference;
-   #else
-      typedef Ptr                                                             pointer;
-      //
-      typedef BOOST_INTRUSIVE_OBTAIN_TYPE_WITH_EVAL_DEFAULT
-         ( boost::intrusive::detail::, Ptr, element_type
-         , boost::movelib::detail::first_param<Ptr>)                          element_type;
-      //
-      typedef BOOST_INTRUSIVE_OBTAIN_TYPE_WITH_DEFAULT
-         (boost::intrusive::detail::, Ptr, difference_type, std::ptrdiff_t)   difference_type;
-
-      typedef BOOST_INTRUSIVE_OBTAIN_TYPE_WITH_DEFAULT
-         ( boost::intrusive::detail::, Ptr, size_type
-         , typename boost::move_detail::
-               make_unsigned<difference_type>::type)                          size_type;
-
-      typedef BOOST_INTRUSIVE_OBTAIN_TYPE_WITH_DEFAULT
-         ( boost::intrusive::detail::, Ptr, reference
-         , typename boost::intrusive::detail::unvoid_ref<element_type>::type) reference;
-      //
-      template <class U> struct rebind_pointer
-      {
-         typedef typename boost::intrusive::pointer_rebind<Ptr, U>::type  type;
-      };
-
-      #if !defined(BOOST_NO_CXX11_TEMPLATE_ALIASES)
-         template <class U> using rebind = typename boost::intrusive::pointer_rebind<Ptr, U>::type;
-      #endif
-   #endif   //#if !defined(BOOST_NO_CXX11_TEMPLATE_ALIASES)
-
-   //! <b>Remark</b>: If element_type is (possibly cv-qualified) void, r type is unspecified; otherwise,
-   //!   it is element_type &.
-   //!
-   //! <b>Returns</b>: A dereferenceable pointer to r obtained by calling Ptr::pointer_to(reference).
-   //!   Non-standard extension: If such function does not exist, returns pointer(addressof(r));
-   //!
-   //! <b>Note</b>: For non-conforming compilers only the existence of a member function called
-   //!   <code>pointer_to</code> is checked.
-   BOOST_INTRUSIVE_FORCEINLINE static pointer pointer_to(reference r) BOOST_NOEXCEPT
-   {
-      //Non-standard extension, it does not require Ptr::pointer_to. If not present
-      //tries to converts &r to pointer.
-      const bool value = boost::intrusive::detail::
-         has_member_function_callable_with_pointer_to
-            <Ptr, Ptr (*)(reference)>::value;
-      boost::intrusive::detail::bool_<value> flag;
-      return pointer_traits::priv_pointer_to(flag, r);
-   }
-
-   //! <b>Remark</b>: Non-standard extension.
-   //!
-   //! <b>Returns</b>: A dereferenceable pointer to r obtained by calling the static template function
-   //!   Ptr::static_cast_from(UPpr/const UPpr &).
-   //!   If such function does not exist, returns pointer_to(static_cast<element_type&>(*uptr))
-   //!
-   //! <b>Note</b>: For non-conforming compilers only the existence of a member function called
-   //!   <code>static_cast_from</code> is checked.
-   template<class UPtr>
-   BOOST_INTRUSIVE_FORCEINLINE static pointer static_cast_from(const UPtr &uptr) BOOST_NOEXCEPT
-   {
-      typedef const UPtr &RefArg;
-      const bool value = boost::intrusive::detail::
-         has_member_function_callable_with_static_cast_from
-            <pointer, pointer(*)(RefArg)>::value
-         || boost::intrusive::detail::
-               has_member_function_callable_with_static_cast_from
-                  <pointer, pointer(*)(UPtr)>::value;
-      return pointer_traits::priv_static_cast_from(boost::intrusive::detail::bool_<value>(), uptr);
-   }
-
-   //! <b>Remark</b>: Non-standard extension.
-   //!
-   //! <b>Returns</b>: A dereferenceable pointer to r obtained by calling the static template function
-   //!   Ptr::const_cast_from<UPtr>(UPpr/const UPpr &).
-   //!   If such function does not exist, returns pointer_to(const_cast<element_type&>(*uptr))
-   //!
-   //! <b>Note</b>: For non-conforming compilers only the existence of a member function called
-   //!   <code>const_cast_from</code> is checked.
-   template<class UPtr>
-   BOOST_INTRUSIVE_FORCEINLINE static pointer const_cast_from(const UPtr &uptr) BOOST_NOEXCEPT
-   {
-      typedef const UPtr &RefArg;
-      const bool value = boost::intrusive::detail::
-         has_member_function_callable_with_const_cast_from
-            <pointer, pointer(*)(RefArg)>::value
-         || boost::intrusive::detail::
-               has_member_function_callable_with_const_cast_from
-                  <pointer, pointer(*)(UPtr)>::value;
-      return pointer_traits::priv_const_cast_from(boost::intrusive::detail::bool_<value>(), uptr);
-   }
-
-   //! <b>Remark</b>: Non-standard extension.
-   //!
-   //! <b>Returns</b>: A dereferenceable pointer to r obtained by calling the static template function
-   //!   Ptr::dynamic_cast_from<UPtr>(UPpr/const UPpr &).
-   //!   If such function does not exist, returns pointer_to(*dynamic_cast<element_type*>(&*uptr))
-   //!
-   //! <b>Note</b>: For non-conforming compilers only the existence of a member function called
-   //!   <code>dynamic_cast_from</code> is checked.
-   template<class UPtr>
-   BOOST_INTRUSIVE_FORCEINLINE static pointer dynamic_cast_from(const UPtr &uptr) BOOST_NOEXCEPT
-   {
-      typedef const UPtr &RefArg;
-      const bool value = boost::intrusive::detail::
-         has_member_function_callable_with_dynamic_cast_from
-            <pointer, pointer(*)(RefArg)>::value
-         || boost::intrusive::detail::
-               has_member_function_callable_with_dynamic_cast_from
-                  <pointer, pointer(*)(UPtr)>::value;
-      return pointer_traits::priv_dynamic_cast_from(boost::intrusive::detail::bool_<value>(), uptr);
-   }
-
-   ///@cond
-   private:
-   //priv_to_raw_pointer
-   template <class T>
-   BOOST_INTRUSIVE_FORCEINLINE static T* to_raw_pointer(T* p) BOOST_NOEXCEPT
-   {  return p; }
-
-   template <class Pointer>
-   BOOST_INTRUSIVE_FORCEINLINE static typename pointer_traits<Pointer>::element_type*
-      to_raw_pointer(const Pointer &p) BOOST_NOEXCEPT
-   {  return pointer_traits::to_raw_pointer(p.operator->());  }
-
-   //priv_pointer_to
-   BOOST_INTRUSIVE_FORCEINLINE static pointer priv_pointer_to(boost::intrusive::detail::true_, reference r) BOOST_NOEXCEPT
-   { return Ptr::pointer_to(r); }
-
-   BOOST_INTRUSIVE_FORCEINLINE static pointer priv_pointer_to(boost::intrusive::detail::false_, reference r) BOOST_NOEXCEPT
-   { return pointer(boost::intrusive::detail::addressof(r)); }
-
-   //priv_static_cast_from
-   template<class UPtr>
-   BOOST_INTRUSIVE_FORCEINLINE static pointer priv_static_cast_from(boost::intrusive::detail::true_, const UPtr &uptr) BOOST_NOEXCEPT
-   { return Ptr::static_cast_from(uptr); }
-
-   template<class UPtr>
-   BOOST_INTRUSIVE_FORCEINLINE static pointer priv_static_cast_from(boost::intrusive::detail::false_, const UPtr &uptr) BOOST_NOEXCEPT
-   {  return uptr ? pointer_to(*static_cast<element_type*>(to_raw_pointer(uptr))) : pointer();  }
-
-   //priv_const_cast_from
-   template<class UPtr>
-   BOOST_INTRUSIVE_FORCEINLINE static pointer priv_const_cast_from(boost::intrusive::detail::true_, const UPtr &uptr) BOOST_NOEXCEPT
-   { return Ptr::const_cast_from(uptr); }
-
-   template<class UPtr>
-   BOOST_INTRUSIVE_FORCEINLINE static pointer priv_const_cast_from(boost::intrusive::detail::false_, const UPtr &uptr) BOOST_NOEXCEPT
-   {  return uptr ? pointer_to(const_cast<element_type&>(*uptr)) : pointer();  }
-
-   //priv_dynamic_cast_from
-   template<class UPtr>
-   BOOST_INTRUSIVE_FORCEINLINE static pointer priv_dynamic_cast_from(boost::intrusive::detail::true_, const UPtr &uptr) BOOST_NOEXCEPT
-   { return Ptr::dynamic_cast_from(uptr); }
-
-   template<class UPtr>
-   BOOST_INTRUSIVE_FORCEINLINE static pointer priv_dynamic_cast_from(boost::intrusive::detail::false_, const UPtr &uptr) BOOST_NOEXCEPT
-   {  return uptr ? pointer_to(dynamic_cast<element_type&>(*uptr)) : pointer();  }
-   ///@endcond
-};
-
-///@cond
-
-// Remove cv qualification from Ptr parameter to pointer_traits:
-template <typename Ptr>
-struct pointer_traits<const Ptr> : pointer_traits<Ptr> {};
-template <typename Ptr>
-struct pointer_traits<volatile Ptr> : pointer_traits<Ptr> { };
-template <typename Ptr>
-struct pointer_traits<const volatile Ptr> : pointer_traits<Ptr> { };
-// Remove reference from Ptr parameter to pointer_traits:
-template <typename Ptr>
-struct pointer_traits<Ptr&> : pointer_traits<Ptr> { };
-
-///@endcond
-
-//! Specialization of pointer_traits for raw pointers
-//!
-template <typename T>
-struct pointer_traits<T*>
-{
-   typedef T               element_type;
-   typedef T*              pointer;
-   typedef std::ptrdiff_t  difference_type;
-   typedef std::size_t     size_type;
-
-   #ifdef BOOST_INTRUSIVE_DOXYGEN_INVOKED
-      typedef T &          reference;
-      //!typedef for <pre>U *</pre>
-      //!
-      //!For portable code for C++03 and C++11, <pre>typename rebind_pointer<U>::type</pre>
-      //!shall be used instead of rebind<U> to obtain a pointer to U.
-      template <class U> using rebind = U*;
-   #else
-      typedef typename boost::intrusive::detail::unvoid_ref<element_type>::type reference;
-      #if !defined(BOOST_NO_CXX11_TEMPLATE_ALIASES)
-         template <class U> using rebind = U*;
-      #endif
-   #endif
-
-   template <class U> struct rebind_pointer
-   {  typedef U* type;  };
-
-   //! <b>Returns</b>: addressof(r)
-   //!
-   BOOST_INTRUSIVE_FORCEINLINE static pointer pointer_to(reference r) BOOST_NOEXCEPT
-   { return boost::intrusive::detail::addressof(r); }
-
-   //! <b>Returns</b>: static_cast<pointer>(uptr)
-   //!
-   template<class U>
-   BOOST_INTRUSIVE_FORCEINLINE static pointer static_cast_from(U *uptr) BOOST_NOEXCEPT
-   {  return static_cast<pointer>(uptr);  }
-
-   //! <b>Returns</b>: const_cast<pointer>(uptr)
-   //!
-   template<class U>
-   BOOST_INTRUSIVE_FORCEINLINE static pointer const_cast_from(U *uptr) BOOST_NOEXCEPT
-   {  return const_cast<pointer>(uptr);  }
-
-   //! <b>Returns</b>: dynamic_cast<pointer>(uptr)
-   //!
-   template<class U>
-   BOOST_INTRUSIVE_FORCEINLINE static pointer dynamic_cast_from(U *uptr) BOOST_NOEXCEPT
-   {  return dynamic_cast<pointer>(uptr);  }
-};
-
-}  //namespace container {
-}  //namespace boost {
-
-#include <boost/intrusive/detail/config_end.hpp>
-
-#endif // ! defined(BOOST_INTRUSIVE_POINTER_TRAITS_HPP)
diff --git a/src/boost/intrusive/rbtree.hpp b/src/boost/intrusive/rbtree.hpp
deleted file mode 100644
index 922fce51..00000000
--- a/src/boost/intrusive/rbtree.hpp
+++ /dev/null
@@ -1,591 +0,0 @@
-/////////////////////////////////////////////////////////////////////////////
-//
-// (C) Copyright Ion Gaztanaga  2006-2014
-//
-// Distributed under the Boost 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/intrusive for documentation.
-//
-/////////////////////////////////////////////////////////////////////////////
-#ifndef BOOST_INTRUSIVE_RBTREE_HPP
-#define BOOST_INTRUSIVE_RBTREE_HPP
-
-#include <boost/intrusive/detail/config_begin.hpp>
-#include <boost/intrusive/intrusive_fwd.hpp>
-#include <cstddef>
-#include <boost/intrusive/detail/minimal_less_equal_header.hpp>
-#include <boost/intrusive/detail/minimal_pair_header.hpp>   //std::pair
-
-#include <boost/intrusive/set_hook.hpp>
-#include <boost/intrusive/detail/rbtree_node.hpp>
-#include <boost/intrusive/bstree.hpp>
-#include <boost/intrusive/detail/tree_node.hpp>
-#include <boost/intrusive/detail/mpl.hpp>
-#include <boost/intrusive/pointer_traits.hpp>
-#include <boost/intrusive/detail/get_value_traits.hpp>
-#include <boost/intrusive/rbtree_algorithms.hpp>
-#include <boost/intrusive/link_mode.hpp>
-
-#include <boost/move/utility_core.hpp>
-#include <boost/static_assert.hpp>
-
-#if defined(BOOST_HAS_PRAGMA_ONCE)
-#  pragma once
-#endif
-
-namespace boost {
-namespace intrusive {
-
-/// @cond
-
-struct default_rbtree_hook_applier
-{  template <class T> struct apply{ typedef typename T::default_rbtree_hook type;  };  };
-
-template<>
-struct is_default_hook_tag<default_rbtree_hook_applier>
-{  static const bool value = true;  };
-
-struct rbtree_defaults
-   : bstree_defaults
-{
-   typedef default_rbtree_hook_applier proto_value_traits;
-};
-
-/// @endcond
-
-//! The class template rbtree is an intrusive red-black tree container, that
-//! is used to construct intrusive set and multiset containers. The no-throw
-//! guarantee holds only, if the key_compare object
-//! doesn't throw.
-//!
-//! The template parameter \c T is the type to be managed by the container.
-//! The user can specify additional options and if no options are provided
-//! default options are used.
-//!
-//! The container supports the following options:
-//! \c base_hook<>/member_hook<>/value_traits<>,
-//! \c constant_time_size<>, \c size_type<> and
-//! \c compare<>.
-#if defined(BOOST_INTRUSIVE_DOXYGEN_INVOKED)
-template<class T, class ...Options>
-#else
-template<class ValueTraits, class VoidOrKeyOfValue, class VoidOrKeyComp, class SizeType, bool ConstantTimeSize, typename HeaderHolder>
-#endif
-class rbtree_impl
-   /// @cond
-   :  public bstree_impl<ValueTraits, VoidOrKeyOfValue, VoidOrKeyComp, SizeType, ConstantTimeSize, RbTreeAlgorithms, HeaderHolder>
-   /// @endcond
-{
-   public:
-   typedef ValueTraits                                               value_traits;
-   /// @cond
-   typedef bstree_impl< ValueTraits, VoidOrKeyOfValue, VoidOrKeyComp, SizeType
-                      , ConstantTimeSize, RbTreeAlgorithms
-                      , HeaderHolder>                                tree_type;
-   typedef tree_type                                                 implementation_defined;
-   /// @endcond
-
-   typedef typename implementation_defined::pointer                  pointer;
-   typedef typename implementation_defined::const_pointer            const_pointer;
-   typedef typename implementation_defined::value_type               value_type;
-   typedef typename implementation_defined::key_type                 key_type;
-   typedef typename implementation_defined::key_of_value             key_of_value;
-   typedef typename implementation_defined::reference                reference;
-   typedef typename implementation_defined::const_reference          const_reference;
-   typedef typename implementation_defined::difference_type          difference_type;
-   typedef typename implementation_defined::size_type                size_type;
-   typedef typename implementation_defined::value_compare            value_compare;
-   typedef typename implementation_defined::key_compare              key_compare;
-   typedef typename implementation_defined::iterator                 iterator;
-   typedef typename implementation_defined::const_iterator           const_iterator;
-   typedef typename implementation_defined::reverse_iterator         reverse_iterator;
-   typedef typename implementation_defined::const_reverse_iterator   const_reverse_iterator;
-   typedef typename implementation_defined::node_traits              node_traits;
-   typedef typename implementation_defined::node                     node;
-   typedef typename implementation_defined::node_ptr                 node_ptr;
-   typedef typename implementation_defined::const_node_ptr           const_node_ptr;
-   typedef typename implementation_defined::node_algorithms          node_algorithms;
-
-   static const bool constant_time_size = implementation_defined::constant_time_size;
-   /// @cond
-   private:
-
-   //noncopyable
-   BOOST_MOVABLE_BUT_NOT_COPYABLE(rbtree_impl)
-
-   /// @endcond
-
-   public:
-
-   typedef typename implementation_defined::insert_commit_data insert_commit_data;
-
-   //! @copydoc ::boost::intrusive::bstree::bstree()
-   rbtree_impl()
-      :  tree_type()
-   {}
-
-   //! @copydoc ::boost::intrusive::bstree::bstree(const key_compare &,const value_traits &)
-   explicit rbtree_impl( const key_compare &cmp, const value_traits &v_traits = value_traits())
-      :  tree_type(cmp, v_traits)
-   {}
-
-   //! @copydoc ::boost::intrusive::bstree::bstree(bool,Iterator,Iterator,const key_compare &,const value_traits &)
-   template<class Iterator>
-   rbtree_impl( bool unique, Iterator b, Iterator e
-              , const key_compare &cmp     = key_compare()
-              , const value_traits &v_traits = value_traits())
-      : tree_type(unique, b, e, cmp, v_traits)
-   {}
-
-   //! @copydoc ::boost::intrusive::bstree::bstree(bstree &&)
-   rbtree_impl(BOOST_RV_REF(rbtree_impl) x)
-      :  tree_type(BOOST_MOVE_BASE(tree_type, x))
-   {}
-
-   //! @copydoc ::boost::intrusive::bstree::operator=(bstree &&)
-   rbtree_impl& operator=(BOOST_RV_REF(rbtree_impl) x)
-   {  return static_cast<rbtree_impl&>(tree_type::operator=(BOOST_MOVE_BASE(tree_type, x))); }
-
-   #ifdef BOOST_INTRUSIVE_DOXYGEN_INVOKED
-   //! @copydoc ::boost::intrusive::bstree::~bstree()
-   ~rbtree_impl();
-
-   //! @copydoc ::boost::intrusive::bstree::begin()
-   iterator begin() BOOST_NOEXCEPT;
-
-   //! @copydoc ::boost::intrusive::bstree::begin()const
-   const_iterator begin() const BOOST_NOEXCEPT;
-
-   //! @copydoc ::boost::intrusive::bstree::cbegin()const
-   const_iterator cbegin() const BOOST_NOEXCEPT;
-
-   //! @copydoc ::boost::intrusive::bstree::end()
-   iterator end() BOOST_NOEXCEPT;
-
-   //! @copydoc ::boost::intrusive::bstree::end()const
-   const_iterator end() const BOOST_NOEXCEPT;
-
-   //! @copydoc ::boost::intrusive::bstree::cend()const
-   const_iterator cend() const BOOST_NOEXCEPT;
-
-   //! @copydoc ::boost::intrusive::bstree::rbegin()
-   reverse_iterator rbegin() BOOST_NOEXCEPT;
-
-   //! @copydoc ::boost::intrusive::bstree::rbegin()const
-   const_reverse_iterator rbegin() const BOOST_NOEXCEPT;
-
-   //! @copydoc ::boost::intrusive::bstree::crbegin()const
-   const_reverse_iterator crbegin() const BOOST_NOEXCEPT;
-
-   //! @copydoc ::boost::intrusive::bstree::rend()
-   reverse_iterator rend() BOOST_NOEXCEPT;
-
-   //! @copydoc ::boost::intrusive::bstree::rend()const
-   const_reverse_iterator rend() const BOOST_NOEXCEPT;
-
-   //! @copydoc ::boost::intrusive::bstree::crend()const
-   const_reverse_iterator crend() const BOOST_NOEXCEPT;
-
-   //! @copydoc ::boost::intrusive::bstree::root()
-   iterator root() BOOST_NOEXCEPT;
-
-   //! @copydoc ::boost::intrusive::bstree::root()const
-   const_iterator root() const BOOST_NOEXCEPT;
-
-   //! @copydoc ::boost::intrusive::bstree::croot()const
-   const_iterator croot() const BOOST_NOEXCEPT;
-
-   //! @copydoc ::boost::intrusive::bstree::container_from_end_iterator(iterator)
-   static rbtree_impl &container_from_end_iterator(iterator end_iterator) BOOST_NOEXCEPT;
-
-   //! @copydoc ::boost::intrusive::bstree::container_from_end_iterator(const_iterator)
-   static const rbtree_impl &container_from_end_iterator(const_iterator end_iterator) BOOST_NOEXCEPT;
-
-   //! @copydoc ::boost::intrusive::bstree::container_from_iterator(iterator)
-   static rbtree_impl &container_from_iterator(iterator it) BOOST_NOEXCEPT;
-
-   //! @copydoc ::boost::intrusive::bstree::container_from_iterator(const_iterator)
-   static const rbtree_impl &container_from_iterator(const_iterator it) BOOST_NOEXCEPT;
-
-   //! @copydoc ::boost::intrusive::bstree::key_comp()const
-   key_compare key_comp() const;
-
-   //! @copydoc ::boost::intrusive::bstree::value_comp()const
-   value_compare value_comp() const;
-
-   //! @copydoc ::boost::intrusive::bstree::empty()const
-   bool empty() const BOOST_NOEXCEPT;
-
-   //! @copydoc ::boost::intrusive::bstree::size()const
-   size_type size() const BOOST_NOEXCEPT;
-
-   //! @copydoc ::boost::intrusive::bstree::swap
-   void swap(rbtree_impl& other);
-
-   //! @copydoc ::boost::intrusive::bstree::clone_from(const bstree&,Cloner,Disposer)
-   template <class Cloner, class Disposer>
-   void clone_from(const rbtree_impl &src, Cloner cloner, Disposer disposer);
-
-   #else //BOOST_INTRUSIVE_DOXYGEN_INVOKED
-
-   using tree_type::clone_from;
-
-   #endif   //#ifdef BOOST_INTRUSIVE_DOXYGEN_INVOKED
-
-   //! @copydoc ::boost::intrusive::bstree::clone_from(bstree&&,Cloner,Disposer)
-   template <class Cloner, class Disposer>
-   void clone_from(BOOST_RV_REF(rbtree_impl) src, Cloner cloner, Disposer disposer)
-   {  tree_type::clone_from(BOOST_MOVE_BASE(tree_type, src), cloner, disposer);  }
-
-   #ifdef BOOST_INTRUSIVE_DOXYGEN_INVOKED
-
-   //! @copydoc ::boost::intrusive::bstree::clone_from(bstree&&,Cloner,Disposer)
-   template <class Cloner, class Disposer>
-   void clone_from(rbtree_impl &&src, Cloner cloner, Disposer disposer);
-
-   //! @copydoc ::boost::intrusive::bstree::insert_equal(reference)
-   iterator insert_equal(reference value);
-
-   //! @copydoc ::boost::intrusive::bstree::insert_equal(const_iterator,reference)
-   iterator insert_equal(const_iterator hint, reference value);
-
-   //! @copydoc ::boost::intrusive::bstree::insert_equal(Iterator,Iterator)
-   template<class Iterator>
-   void insert_equal(Iterator b, Iterator e);
-
-   //! @copydoc ::boost::intrusive::bstree::insert_unique(reference)
-   std::pair<iterator, bool> insert_unique(reference value);
-
-   //! @copydoc ::boost::intrusive::bstree::insert_unique(const_iterator,reference)
-   iterator insert_unique(const_iterator hint, reference value);
-
-   //! @copydoc ::boost::intrusive::bstree::insert_unique_check(const KeyType&,KeyTypeKeyCompare,insert_commit_data&)
-   template<class KeyType, class KeyTypeKeyCompare>
-   std::pair<iterator, bool> insert_unique_check
-      (const KeyType &key, KeyTypeKeyCompare comp, insert_commit_data &commit_data);
-
-   //! @copydoc ::boost::intrusive::bstree::insert_unique_check(const_iterator,const KeyType&,KeyTypeKeyCompare,insert_commit_data&)
-   template<class KeyType, class KeyTypeKeyCompare>
-   std::pair<iterator, bool> insert_unique_check
-      (const_iterator hint, const KeyType &key
-      ,KeyTypeKeyCompare comp, insert_commit_data &commit_data);
-
-   //! @copydoc ::boost::intrusive::bstree::insert_unique_check(const key_type&,insert_commit_data&)
-   std::pair<iterator, bool> insert_unique_check
-      (const key_type &key, insert_commit_data &commit_data);
-
-   //! @copydoc ::boost::intrusive::bstree::insert_unique_check(const_iterator,const key_type&,insert_commit_data&)
-   std::pair<iterator, bool> insert_unique_check
-      (const_iterator hint, const key_type &key, insert_commit_data &commit_data);
-
-   //! @copydoc ::boost::intrusive::bstree::insert_unique_commit
-   iterator insert_unique_commit(reference value, const insert_commit_data &commit_data) BOOST_NOEXCEPT;
-
-   //! @copydoc ::boost::intrusive::bstree::insert_unique(Iterator,Iterator)
-   template<class Iterator>
-   void insert_unique(Iterator b, Iterator e);
-
-   //! @copydoc ::boost::intrusive::bstree::insert_before
-   iterator insert_before(const_iterator pos, reference value) BOOST_NOEXCEPT;
-
-   //! @copydoc ::boost::intrusive::bstree::push_back
-   void push_back(reference value) BOOST_NOEXCEPT;
-
-   //! @copydoc ::boost::intrusive::bstree::push_front
-   void push_front(reference value) BOOST_NOEXCEPT;
-
-   //! @copydoc ::boost::intrusive::bstree::erase(const_iterator)
-   iterator erase(const_iterator i) BOOST_NOEXCEPT;
-
-   //! @copydoc ::boost::intrusive::bstree::erase(const_iterator,const_iterator)
-   iterator erase(const_iterator b, const_iterator e) BOOST_NOEXCEPT;
-
-   //! @copydoc ::boost::intrusive::bstree::erase(const key_type &key)
-   size_type erase(const key_type &key);
-
-   //! @copydoc ::boost::intrusive::bstree::erase(const KeyType&,KeyTypeKeyCompare)
-   template<class KeyType, class KeyTypeKeyCompare>
-   size_type erase(const KeyType& key, KeyTypeKeyCompare comp);
-
-   //! @copydoc ::boost::intrusive::bstree::erase_and_dispose(const_iterator,Disposer)
-   template<class Disposer>
-   iterator erase_and_dispose(const_iterator i, Disposer disposer) BOOST_NOEXCEPT;
-
-   //! @copydoc ::boost::intrusive::bstree::erase_and_dispose(const_iterator,const_iterator,Disposer)
-   template<class Disposer>
-   iterator erase_and_dispose(const_iterator b, const_iterator e, Disposer disposer) BOOST_NOEXCEPT;
-
-   //! @copydoc ::boost::intrusive::bstree::erase_and_dispose(const key_type &, Disposer)
-   template<class Disposer>
-   size_type erase_and_dispose(const key_type &key, Disposer disposer);
-
-   //! @copydoc ::boost::intrusive::bstree::erase_and_dispose(const KeyType&,KeyTypeKeyCompare,Disposer)
-   template<class KeyType, class KeyTypeKeyCompare, class Disposer>
-   size_type erase_and_dispose(const KeyType& key, KeyTypeKeyCompare comp, Disposer disposer);
-
-   //! @copydoc ::boost::intrusive::bstree::clear
-   void clear() BOOST_NOEXCEPT;
-
-   //! @copydoc ::boost::intrusive::bstree::clear_and_dispose
-   template<class Disposer>
-   void clear_and_dispose(Disposer disposer) BOOST_NOEXCEPT;
-
-   //! @copydoc ::boost::intrusive::bstree::count(const key_type &)const
-   size_type count(const key_type &key) const;
-
-   //! @copydoc ::boost::intrusive::bstree::count(const KeyType&,KeyTypeKeyCompare)const
-   template<class KeyType, class KeyTypeKeyCompare>
-   size_type count(const KeyType& key, KeyTypeKeyCompare comp) const;
-
-   //! @copydoc ::boost::intrusive::bstree::lower_bound(const key_type &)
-   iterator lower_bound(const key_type &key);
-
-   //! @copydoc ::boost::intrusive::bstree::lower_bound(const KeyType&,KeyTypeKeyCompare)
-   template<class KeyType, class KeyTypeKeyCompare>
-   iterator lower_bound(const KeyType& key, KeyTypeKeyCompare comp);
-
-   //! @copydoc ::boost::intrusive::bstree::lower_bound(const key_type &)const
-   const_iterator lower_bound(const key_type &key) const;
-
-   //! @copydoc ::boost::intrusive::bstree::lower_bound(const KeyType&,KeyTypeKeyCompare)const
-   template<class KeyType, class KeyTypeKeyCompare>
-   const_iterator lower_bound(const KeyType& key, KeyTypeKeyCompare comp) const;
-
-   //! @copydoc ::boost::intrusive::bstree::upper_bound(const key_type &)
-   iterator upper_bound(const key_type &key);
-
-   //! @copydoc ::boost::intrusive::bstree::upper_bound(const KeyType&,KeyTypeKeyCompare)
-   template<class KeyType, class KeyTypeKeyCompare>
-   iterator upper_bound(const KeyType& key, KeyTypeKeyCompare comp);
-
-   //! @copydoc ::boost::intrusive::bstree::upper_bound(const key_type &)const
-   const_iterator upper_bound(const key_type &key) const;
-
-   //! @copydoc ::boost::intrusive::bstree::upper_bound(const KeyType&,KeyTypeKeyCompare)const
-   template<class KeyType, class KeyTypeKeyCompare>
-   const_iterator upper_bound(const KeyType& key, KeyTypeKeyCompare comp) const;
-
-   //! @copydoc ::boost::intrusive::bstree::find(const key_type &)
-   iterator find(const key_type &key);
-
-   //! @copydoc ::boost::intrusive::bstree::find(const KeyType&,KeyTypeKeyCompare)
-   template<class KeyType, class KeyTypeKeyCompare>
-   iterator find(const KeyType& key, KeyTypeKeyCompare comp);
-
-   //! @copydoc ::boost::intrusive::bstree::find(const key_type &)const
-   const_iterator find(const key_type &key) const;
-
-   //! @copydoc ::boost::intrusive::bstree::find(const KeyType&,KeyTypeKeyCompare)const
-   template<class KeyType, class KeyTypeKeyCompare>
-   const_iterator find(const KeyType& key, KeyTypeKeyCompare comp) const;
-
-   //! @copydoc ::boost::intrusive::bstree::equal_range(const key_type &)
-   std::pair<iterator,iterator> equal_range(const key_type &key);
-
-   //! @copydoc ::boost::intrusive::bstree::equal_range(const KeyType&,KeyTypeKeyCompare)
-   template<class KeyType, class KeyTypeKeyCompare>
-   std::pair<iterator,iterator> equal_range(const KeyType& key, KeyTypeKeyCompare comp);
-
-   //! @copydoc ::boost::intrusive::bstree::equal_range(const key_type &)const
-   std::pair<const_iterator, const_iterator>
-      equal_range(const key_type &key) const;
-
-   //! @copydoc ::boost::intrusive::bstree::equal_range(const KeyType&,KeyTypeKeyCompare)const
-   template<class KeyType, class KeyTypeKeyCompare>
-   std::pair<const_iterator, const_iterator>
-      equal_range(const KeyType& key, KeyTypeKeyCompare comp) const;
-
-   //! @copydoc ::boost::intrusive::bstree::bounded_range(const key_type &,const key_type &,bool,bool)
-   std::pair<iterator,iterator> bounded_range
-      (const key_type &lower, const key_type &upper_key, bool left_closed, bool right_closed);
-
-   //! @copydoc ::boost::intrusive::bstree::bounded_range(const KeyType&,const KeyType&,KeyTypeKeyCompare,bool,bool)
-   template<class KeyType, class KeyTypeKeyCompare>
-   std::pair<iterator,iterator> bounded_range
-      (const KeyType& lower_key, const KeyType& upper_key, KeyTypeKeyCompare comp, bool left_closed, bool right_closed);
-
-   //! @copydoc ::boost::intrusive::bstree::bounded_range(const key_type &,const key_type &,bool,bool)const
-   std::pair<const_iterator, const_iterator>
-      bounded_range(const key_type &lower_key, const key_type &upper_key, bool left_closed, bool right_closed) const;
-
-   //! @copydoc ::boost::intrusive::bstree::bounded_range(const KeyType&,const KeyType&,KeyTypeKeyCompare,bool,bool)const
-   template<class KeyType, class KeyTypeKeyCompare>
-   std::pair<const_iterator, const_iterator> bounded_range
-         (const KeyType& lower_key, const KeyType& upper_key, KeyTypeKeyCompare comp, bool left_closed, bool right_closed) const;
-
-   //! @copydoc ::boost::intrusive::bstree::s_iterator_to(reference)
-   static iterator s_iterator_to(reference value) BOOST_NOEXCEPT;
-
-   //! @copydoc ::boost::intrusive::bstree::s_iterator_to(const_reference)
-   static const_iterator s_iterator_to(const_reference value) BOOST_NOEXCEPT;
-
-   //! @copydoc ::boost::intrusive::bstree::iterator_to(reference)
-   iterator iterator_to(reference value) BOOST_NOEXCEPT;
-
-   //! @copydoc ::boost::intrusive::bstree::iterator_to(const_reference)const
-   const_iterator iterator_to(const_reference value) const BOOST_NOEXCEPT;
-
-   //! @copydoc ::boost::intrusive::bstree::init_node(reference)
-   static void init_node(reference value) BOOST_NOEXCEPT;
-
-   //! @copydoc ::boost::intrusive::bstree::unlink_leftmost_without_rebalance
-   pointer unlink_leftmost_without_rebalance() BOOST_NOEXCEPT;
-
-   //! @copydoc ::boost::intrusive::bstree::replace_node
-   void replace_node(iterator replace_this, reference with_this) BOOST_NOEXCEPT;
-
-   //! @copydoc ::boost::intrusive::bstree::remove_node
-   void remove_node(reference value) BOOST_NOEXCEPT;
-
-   //! @copydoc ::boost::intrusive::bstree::merge_unique(bstree<T, Options2...>&)
-   template<class T, class ...Options2>
-   void merge_unique(rbtree<T, Options2...> &);
-
-   //! @copydoc ::boost::intrusive::bstree::merge_equal(bstree<T, Options2...>&)
-   template<class T, class ...Options2>
-   void merge_equal(rbtree<T, Options2...> &);
-
-   friend bool operator< (const rbtree_impl &x, const rbtree_impl &y);
-
-   friend bool operator==(const rbtree_impl &x, const rbtree_impl &y);
-
-   friend bool operator!= (const rbtree_impl &x, const rbtree_impl &y);
-
-   friend bool operator>(const rbtree_impl &x, const rbtree_impl &y);
-
-   friend bool operator<=(const rbtree_impl &x, const rbtree_impl &y);
-
-   friend bool operator>=(const rbtree_impl &x, const rbtree_impl &y);
-
-   friend void swap(rbtree_impl &x, rbtree_impl &y);
-   #endif   //#ifdef BOOST_INTRUSIVE_DOXYGEN_INVOKED
-};
-
-
-//! Helper metafunction to define a \c rbtree that yields to the same type when the
-//! same options (either explicitly or implicitly) are used.
-#if defined(BOOST_INTRUSIVE_DOXYGEN_INVOKED) || defined(BOOST_INTRUSIVE_VARIADIC_TEMPLATES)
-template<class T, class ...Options>
-#else
-template<class T, class O1 = void, class O2 = void
-                , class O3 = void, class O4 = void
-                , class O5 = void, class O6 = void>
-#endif
-struct make_rbtree
-{
-   /// @cond
-   typedef typename pack_options
-      < rbtree_defaults,
-      #if !defined(BOOST_INTRUSIVE_VARIADIC_TEMPLATES)
-      O1, O2, O3, O4, O5, O6
-      #else
-      Options...
-      #endif
-      >::type packed_options;
-
-   typedef typename detail::get_value_traits
-      <T, typename packed_options::proto_value_traits>::type value_traits;
-
-   typedef rbtree_impl
-         < value_traits
-         , typename packed_options::key_of_value
-         , typename packed_options::compare
-         , typename packed_options::size_type
-         , packed_options::constant_time_size
-         , typename packed_options::header_holder_type
-         > implementation_defined;
-   /// @endcond
-   typedef implementation_defined type;
-};
-
-
-#ifndef BOOST_INTRUSIVE_DOXYGEN_INVOKED
-
-#if !defined(BOOST_INTRUSIVE_VARIADIC_TEMPLATES)
-template<class T, class O1, class O2, class O3, class O4, class O5, class O6>
-#else
-template<class T, class ...Options>
-#endif
-class rbtree
-   :  public make_rbtree<T,
-      #if !defined(BOOST_INTRUSIVE_VARIADIC_TEMPLATES)
-      O1, O2, O3, O4, O5, O6
-      #else
-      Options...
-      #endif
-      >::type
-{
-   typedef typename make_rbtree
-      <T,
-      #if !defined(BOOST_INTRUSIVE_VARIADIC_TEMPLATES)
-      O1, O2, O3, O4, O5, O6
-      #else
-      Options...
-      #endif
-      >::type   Base;
-   BOOST_MOVABLE_BUT_NOT_COPYABLE(rbtree)
-
-   public:
-   typedef typename Base::key_compare        key_compare;
-   typedef typename Base::value_traits       value_traits;
-   typedef typename Base::iterator           iterator;
-   typedef typename Base::const_iterator     const_iterator;
-   typedef typename Base::reverse_iterator           reverse_iterator;
-   typedef typename Base::const_reverse_iterator     const_reverse_iterator;
-
-   //Assert if passed value traits are compatible with the type
-   BOOST_STATIC_ASSERT((detail::is_same<typename value_traits::value_type, T>::value));
-
-   BOOST_INTRUSIVE_FORCEINLINE rbtree()
-      :  Base()
-   {}
-
-   BOOST_INTRUSIVE_FORCEINLINE explicit rbtree( const key_compare &cmp, const value_traits &v_traits = value_traits())
-      :  Base(cmp, v_traits)
-   {}
-
-   template<class Iterator>
-   BOOST_INTRUSIVE_FORCEINLINE rbtree( bool unique, Iterator b, Iterator e
-         , const key_compare &cmp = key_compare()
-         , const value_traits &v_traits = value_traits())
-      :  Base(unique, b, e, cmp, v_traits)
-   {}
-
-   BOOST_INTRUSIVE_FORCEINLINE rbtree(BOOST_RV_REF(rbtree) x)
-      :  Base(BOOST_MOVE_BASE(Base, x))
-   {}
-
-   BOOST_INTRUSIVE_FORCEINLINE rbtree& operator=(BOOST_RV_REF(rbtree) x)
-   {  return static_cast<rbtree &>(this->Base::operator=(BOOST_MOVE_BASE(Base, x)));  }
-
-   template <class Cloner, class Disposer>
-   BOOST_INTRUSIVE_FORCEINLINE void clone_from(const rbtree &src, Cloner cloner, Disposer disposer)
-   {  Base::clone_from(src, cloner, disposer);  }
-
-   template <class Cloner, class Disposer>
-   BOOST_INTRUSIVE_FORCEINLINE void clone_from(BOOST_RV_REF(rbtree) src, Cloner cloner, Disposer disposer)
-   {  Base::clone_from(BOOST_MOVE_BASE(Base, src), cloner, disposer);  }
-
-   BOOST_INTRUSIVE_FORCEINLINE static rbtree &container_from_end_iterator(iterator end_iterator) BOOST_NOEXCEPT
-   {  return static_cast<rbtree &>(Base::container_from_end_iterator(end_iterator));   }
-
-   BOOST_INTRUSIVE_FORCEINLINE static const rbtree &container_from_end_iterator(const_iterator end_iterator) BOOST_NOEXCEPT
-   {  return static_cast<const rbtree &>(Base::container_from_end_iterator(end_iterator));   }
-
-   BOOST_INTRUSIVE_FORCEINLINE static rbtree &container_from_iterator(iterator it) BOOST_NOEXCEPT
-   {  return static_cast<rbtree &>(Base::container_from_iterator(it));   }
-
-   BOOST_INTRUSIVE_FORCEINLINE static const rbtree &container_from_iterator(const_iterator it) BOOST_NOEXCEPT
-   {  return static_cast<const rbtree &>(Base::container_from_iterator(it));   }
-};
-
-#endif
-
-} //namespace intrusive
-} //namespace boost
-
-#include <boost/intrusive/detail/config_end.hpp>
-
-#endif //BOOST_INTRUSIVE_RBTREE_HPP
diff --git a/src/boost/intrusive/rbtree_algorithms.hpp b/src/boost/intrusive/rbtree_algorithms.hpp
deleted file mode 100644
index bbb3f0f1..00000000
--- a/src/boost/intrusive/rbtree_algorithms.hpp
+++ /dev/null
@@ -1,622 +0,0 @@
-/////////////////////////////////////////////////////////////////////////////
-//
-// (C) Copyright Olaf Krzikalla 2004-2006.
-// (C) Copyright Ion Gaztanaga  2006-2014.
-//
-// Distributed under the Boost 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/intrusive for documentation.
-//
-/////////////////////////////////////////////////////////////////////////////
-//
-// The tree destruction algorithm is based on Julienne Walker and The EC Team code:
-//
-// This code is in the public domain. Anyone may use it or change it in any way that
-// they see fit. The author assumes no responsibility for damages incurred through
-// use of the original code or any variations thereof.
-//
-// It is requested, but not required, that due credit is given to the original author
-// and anyone who has modified the code through a header comment, such as this one.
-
-#ifndef BOOST_INTRUSIVE_RBTREE_ALGORITHMS_HPP
-#define BOOST_INTRUSIVE_RBTREE_ALGORITHMS_HPP
-
-#include <boost/intrusive/detail/config_begin.hpp>
-#include <boost/intrusive/intrusive_fwd.hpp>
-
-#include <cstddef>
-
-#include <boost/intrusive/detail/assert.hpp>
-#include <boost/intrusive/detail/algo_type.hpp>
-#include <boost/intrusive/bstree_algorithms.hpp>
-#include <boost/intrusive/detail/ebo_functor_holder.hpp>
-
-#if defined(BOOST_HAS_PRAGMA_ONCE)
-#  pragma once
-#endif
-
-namespace boost {
-namespace intrusive {
-
-#ifndef BOOST_INTRUSIVE_DOXYGEN_INVOKED
-
-template<class NodeTraits, class F>
-struct rbtree_node_cloner
-   //Use public inheritance to avoid MSVC bugs with closures
-   :  public detail::ebo_functor_holder<F>
-{
-   typedef typename NodeTraits::node_ptr  node_ptr;
-   typedef detail::ebo_functor_holder<F>  base_t;
-
-   explicit rbtree_node_cloner(F f)
-      :  base_t(f)
-   {}
-
-   node_ptr operator()(node_ptr p)
-   {
-      node_ptr n = base_t::get()(p);
-      NodeTraits::set_color(n, NodeTraits::get_color(p));
-      return n;
-   }
-};
-
-namespace detail {
-
-template<class ValueTraits, class NodePtrCompare, class ExtraChecker>
-struct rbtree_node_checker
-   : public bstree_node_checker<ValueTraits, NodePtrCompare, ExtraChecker>
-{
-   typedef bstree_node_checker<ValueTraits, NodePtrCompare, ExtraChecker> base_checker_t;
-   typedef ValueTraits                             value_traits;
-   typedef typename value_traits::node_traits      node_traits;
-   typedef typename node_traits::const_node_ptr    const_node_ptr;
-   typedef typename node_traits::node_ptr          node_ptr;
-
-   struct return_type
-         : public base_checker_t::return_type
-   {
-      return_type() : black_count_(0) {}
-      std::size_t black_count_;
-   };
-
-   rbtree_node_checker(const NodePtrCompare& comp, ExtraChecker extra_checker)
-      : base_checker_t(comp, extra_checker)
-   {}
-
-   void operator () (const_node_ptr p,
-                     const return_type& check_return_left, const return_type& check_return_right,
-                     return_type& check_return)
-   {
-
-      if (node_traits::get_color(p) == node_traits::red()){
-         //Red nodes have black children
-         const node_ptr p_left(node_traits::get_left(p));   (void)p_left;
-         const node_ptr p_right(node_traits::get_right(p)); (void)p_right;
-         BOOST_INTRUSIVE_INVARIANT_ASSERT(!p_left  || node_traits::get_color(p_left)  == node_traits::black());
-         BOOST_INTRUSIVE_INVARIANT_ASSERT(!p_right || node_traits::get_color(p_right) == node_traits::black());
-         //Red node can't be root
-         BOOST_INTRUSIVE_INVARIANT_ASSERT(node_traits::get_parent(node_traits::get_parent(p)) != p);
-      }
-      //Every path to p contains the same number of black nodes
-      const std::size_t l_black_count = check_return_left.black_count_;
-      BOOST_INTRUSIVE_INVARIANT_ASSERT(l_black_count == check_return_right.black_count_);
-      check_return.black_count_ = l_black_count +
-         static_cast<std::size_t>(node_traits::get_color(p) == node_traits::black());
-      base_checker_t::operator()(p, check_return_left, check_return_right, check_return);
-   }
-};
-
-} // namespace detail
-
-#endif   //#ifndef BOOST_INTRUSIVE_DOXYGEN_INVOKED
-
-//! rbtree_algorithms provides basic algorithms to manipulate
-//! nodes forming a red-black tree. The insertion and deletion algorithms are
-//! based on those in Cormen, Leiserson, and Rivest, Introduction to Algorithms
-//! (MIT Press, 1990), except that
-//!
-//! (1) the header node is maintained with links not only to the root
-//! but also to the leftmost node of the tree, to enable constant time
-//! begin(), and to the rightmost node of the tree, to enable linear time
-//! performance when used with the generic set algorithms (set_union,
-//! etc.);
-//!
-//! (2) when a node being deleted has two children its successor node is
-//! relinked into its place, rather than copied, so that the only
-//! pointers invalidated are those referring to the deleted node.
-//!
-//! rbtree_algorithms is configured with a NodeTraits class, which encapsulates the
-//! information about the node to be manipulated. NodeTraits must support the
-//! following interface:
-//!
-//! <b>Typedefs</b>:
-//!
-//! <tt>node</tt>: The type of the node that forms the binary search tree
-//!
-//! <tt>node_ptr</tt>: A pointer to a node
-//!
-//! <tt>const_node_ptr</tt>: A pointer to a const node
-//!
-//! <tt>color</tt>: The type that can store the color of a node
-//!
-//! <b>Static functions</b>:
-//!
-//! <tt>static node_ptr get_parent(const_node_ptr n);</tt>
-//!
-//! <tt>static void set_parent(node_ptr n, node_ptr parent);</tt>
-//!
-//! <tt>static node_ptr get_left(const_node_ptr n);</tt>
-//!
-//! <tt>static void set_left(node_ptr n, node_ptr left);</tt>
-//!
-//! <tt>static node_ptr get_right(const_node_ptr n);</tt>
-//!
-//! <tt>static void set_right(node_ptr n, node_ptr right);</tt>
-//!
-//! <tt>static color get_color(const_node_ptr n);</tt>
-//!
-//! <tt>static void set_color(node_ptr n, color c);</tt>
-//!
-//! <tt>static color black();</tt>
-//!
-//! <tt>static color red();</tt>
-template<class NodeTraits>
-class rbtree_algorithms
-   #ifndef BOOST_INTRUSIVE_DOXYGEN_INVOKED
-   : public bstree_algorithms<NodeTraits>
-   #endif
-{
-   public:
-   typedef NodeTraits                           node_traits;
-   typedef typename NodeTraits::node            node;
-   typedef typename NodeTraits::node_ptr        node_ptr;
-   typedef typename NodeTraits::const_node_ptr  const_node_ptr;
-   typedef typename NodeTraits::color           color;
-
-   /// @cond
-   private:
-
-   typedef bstree_algorithms<NodeTraits>  bstree_algo;
-
-   /// @endcond
-
-   public:
-
-   //! This type is the information that will be
-   //! filled by insert_unique_check
-   typedef typename bstree_algo::insert_commit_data insert_commit_data;
-
-   #ifdef BOOST_INTRUSIVE_DOXYGEN_INVOKED
-
-   //! @copydoc ::boost::intrusive::bstree_algorithms::get_header(const_node_ptr)
-   static node_ptr get_header(const_node_ptr n) BOOST_NOEXCEPT;
-
-   //! @copydoc ::boost::intrusive::bstree_algorithms::begin_node
-   static node_ptr begin_node(const_node_ptr header) BOOST_NOEXCEPT;
-
-   //! @copydoc ::boost::intrusive::bstree_algorithms::end_node
-   static node_ptr end_node(const_node_ptr header) BOOST_NOEXCEPT;
-
-   //! @copydoc ::boost::intrusive::bstree_algorithms::swap_tree
-   static void swap_tree(node_ptr header1, node_ptr header2) BOOST_NOEXCEPT;
-
-   #endif   //#ifdef BOOST_INTRUSIVE_DOXYGEN_INVOKED
-
-   //! @copydoc ::boost::intrusive::bstree_algorithms::swap_nodes(node_ptr,node_ptr)
-   static void swap_nodes(node_ptr node1, node_ptr node2) BOOST_NOEXCEPT
-   {
-      if(node1 == node2)
-         return;
-
-      node_ptr header1(bstree_algo::get_header(node1)), header2(bstree_algo::get_header(node2));
-      swap_nodes(node1, header1, node2, header2);
-   }
-
-   //! @copydoc ::boost::intrusive::bstree_algorithms::swap_nodes(node_ptr,node_ptr,node_ptr,node_ptr)
-   static void swap_nodes(node_ptr node1, node_ptr header1, node_ptr node2, node_ptr header2) BOOST_NOEXCEPT
-   {
-      if(node1 == node2)   return;
-
-      bstree_algo::swap_nodes(node1, header1, node2, header2);
-      //Swap color
-      color c = NodeTraits::get_color(node1);
-      NodeTraits::set_color(node1, NodeTraits::get_color(node2));
-      NodeTraits::set_color(node2, c);
-   }
-
-   //! @copydoc ::boost::intrusive::bstree_algorithms::replace_node(node_ptr,node_ptr)
-   static void replace_node(node_ptr node_to_be_replaced, node_ptr new_node) BOOST_NOEXCEPT
-   {
-      if(node_to_be_replaced == new_node)
-         return;
-      replace_node(node_to_be_replaced, bstree_algo::get_header(node_to_be_replaced), new_node);
-   }
-
-   //! @copydoc ::boost::intrusive::bstree_algorithms::replace_node(node_ptr,node_ptr,node_ptr)
-   static void replace_node(node_ptr node_to_be_replaced, node_ptr header, node_ptr new_node) BOOST_NOEXCEPT
-   {
-      bstree_algo::replace_node(node_to_be_replaced, header, new_node);
-      NodeTraits::set_color(new_node, NodeTraits::get_color(node_to_be_replaced));
-   }
-
-   //! @copydoc ::boost::intrusive::bstree_algorithms::unlink(node_ptr)
-   static void unlink(node_ptr n) BOOST_NOEXCEPT
-   {
-      node_ptr x = NodeTraits::get_parent(n);
-      if(x){
-         while(!is_header(x))
-            x = NodeTraits::get_parent(x);
-         erase(x, n);
-      }
-   }
-
-   #ifdef BOOST_INTRUSIVE_DOXYGEN_INVOKED
-   //! @copydoc ::boost::intrusive::bstree_algorithms::unlink_leftmost_without_rebalance
-   static node_ptr unlink_leftmost_without_rebalance(node_ptr header) BOOST_NOEXCEPT;
-
-   //! @copydoc ::boost::intrusive::bstree_algorithms::unique(const_node_ptr)
-   static bool unique(const_node_ptr n) BOOST_NOEXCEPT;
-
-   //! @copydoc ::boost::intrusive::bstree_algorithms::size(const_node_ptr)
-   static std::size_t size(const_node_ptr header) BOOST_NOEXCEPT;
-
-   //! @copydoc ::boost::intrusive::bstree_algorithms::next_node(const_node_ptr)
-   static node_ptr next_node(node_ptr n) BOOST_NOEXCEPT;
-
-   //! @copydoc ::boost::intrusive::bstree_algorithms::prev_node(const_node_ptr)
-   static node_ptr prev_node(node_ptr n) BOOST_NOEXCEPT;
-
-   //! @copydoc ::boost::intrusive::bstree_algorithms::init(node_ptr)
-   static void init(node_ptr n) BOOST_NOEXCEPT;
-   #endif   //#ifdef BOOST_INTRUSIVE_DOXYGEN_INVOKED
-
-   //! @copydoc ::boost::intrusive::bstree_algorithms::init_header(node_ptr)
-   static void init_header(node_ptr header) BOOST_NOEXCEPT
-   {
-      bstree_algo::init_header(header);
-      NodeTraits::set_color(header, NodeTraits::red());
-   }
-
-   //! @copydoc ::boost::intrusive::bstree_algorithms::erase(node_ptr,node_ptr)
-   static node_ptr erase(node_ptr header, node_ptr z) BOOST_NOEXCEPT
-   {
-      typename bstree_algo::data_for_rebalance info;
-      bstree_algo::erase(header, z, info);
-      rebalance_after_erasure(header, z, info);
-      return z;
-   }
-
-   //! @copydoc ::boost::intrusive::bstree_algorithms::transfer_unique
-   template<class NodePtrCompare>
-   static bool transfer_unique
-      (node_ptr header1, NodePtrCompare comp, node_ptr header2, node_ptr z)
-   {
-      typename bstree_algo::data_for_rebalance info;
-      bool const transferred = bstree_algo::transfer_unique(header1, comp, header2, z, info);
-      if(transferred){
-         rebalance_after_erasure(header2, z, info);
-         rebalance_after_insertion(header1, z);
-      }
-      return transferred;
-   }
-
-   //! @copydoc ::boost::intrusive::bstree_algorithms::transfer_equal
-   template<class NodePtrCompare>
-   static void transfer_equal
-      (node_ptr header1, NodePtrCompare comp, node_ptr header2, node_ptr z)
-   {
-      typename bstree_algo::data_for_rebalance info;
-      bstree_algo::transfer_equal(header1, comp, header2, z, info);
-      rebalance_after_erasure(header2, z, info);
-      rebalance_after_insertion(header1, z);
-   }
-
-   //! @copydoc ::boost::intrusive::bstree_algorithms::clone(const_node_ptr,node_ptr,Cloner,Disposer)
-   template <class Cloner, class Disposer>
-   static void clone
-      (const_node_ptr source_header, node_ptr target_header, Cloner cloner, Disposer disposer)
-   {
-      rbtree_node_cloner<NodeTraits, Cloner> new_cloner(cloner);
-      bstree_algo::clone(source_header, target_header, new_cloner, disposer);
-   }
-
-   #ifdef BOOST_INTRUSIVE_DOXYGEN_INVOKED
-   //! @copydoc ::boost::intrusive::bstree_algorithms::clear_and_dispose(const_node_ptr,Disposer)
-   template<class Disposer>
-   static void clear_and_dispose(node_ptr header, Disposer disposer) BOOST_NOEXCEPT;
-
-   //! @copydoc ::boost::intrusive::bstree_algorithms::lower_bound(const_node_ptr,const KeyType&,KeyNodePtrCompare)
-   template<class KeyType, class KeyNodePtrCompare>
-   static node_ptr lower_bound
-      (const_node_ptr header, const KeyType &key, KeyNodePtrCompare comp);
-
-   //! @copydoc ::boost::intrusive::bstree_algorithms::upper_bound(const_node_ptr,const KeyType&,KeyNodePtrCompare)
-   template<class KeyType, class KeyNodePtrCompare>
-   static node_ptr upper_bound
-      (const_node_ptr header, const KeyType &key, KeyNodePtrCompare comp);
-
-   //! @copydoc ::boost::intrusive::bstree_algorithms::find(const_node_ptr, const KeyType&,KeyNodePtrCompare)
-   template<class KeyType, class KeyNodePtrCompare>
-   static node_ptr find
-      (const_node_ptr header, const KeyType &key, KeyNodePtrCompare comp);
-
-   //! @copydoc ::boost::intrusive::bstree_algorithms::equal_range(const_node_ptr,const KeyType&,KeyNodePtrCompare)
-   template<class KeyType, class KeyNodePtrCompare>
-   static std::pair<node_ptr, node_ptr> equal_range
-      (const_node_ptr header, const KeyType &key, KeyNodePtrCompare comp);
-
-   //! @copydoc ::boost::intrusive::bstree_algorithms::bounded_range(const_node_ptr,const KeyType&,const KeyType&,KeyNodePtrCompare,bool,bool)
-   template<class KeyType, class KeyNodePtrCompare>
-   static std::pair<node_ptr, node_ptr> bounded_range
-      (const_node_ptr eader, const KeyType &lower_key, const KeyType &upper_key, KeyNodePtrCompare comp
-      , bool left_closed, bool right_closed);
-
-   //! @copydoc ::boost::intrusive::bstree_algorithms::count(const_node_ptr,const KeyType&,KeyNodePtrCompare)
-   template<class KeyType, class KeyNodePtrCompare>
-   static std::size_t count(const_node_ptr header, const KeyType &key, KeyNodePtrCompare comp);
-
-   #endif   //#ifdef BOOST_INTRUSIVE_DOXYGEN_INVOKED
-
-   //! @copydoc ::boost::intrusive::bstree_algorithms::insert_equal_upper_bound(node_ptr,node_ptr,NodePtrCompare)
-   template<class NodePtrCompare>
-   static node_ptr insert_equal_upper_bound
-      (node_ptr h, node_ptr new_node, NodePtrCompare comp)
-   {
-      bstree_algo::insert_equal_upper_bound(h, new_node, comp);
-      rebalance_after_insertion(h, new_node);
-      return new_node;
-   }
-
-   //! @copydoc ::boost::intrusive::bstree_algorithms::insert_equal_lower_bound(node_ptr,node_ptr,NodePtrCompare)
-   template<class NodePtrCompare>
-   static node_ptr insert_equal_lower_bound
-      (node_ptr h, node_ptr new_node, NodePtrCompare comp)
-   {
-      bstree_algo::insert_equal_lower_bound(h, new_node, comp);
-      rebalance_after_insertion(h, new_node);
-      return new_node;
-   }
-
-   //! @copydoc ::boost::intrusive::bstree_algorithms::insert_equal(node_ptr,node_ptr,node_ptr,NodePtrCompare)
-   template<class NodePtrCompare>
-   static node_ptr insert_equal
-      (node_ptr header, node_ptr hint, node_ptr new_node, NodePtrCompare comp)
-   {
-      bstree_algo::insert_equal(header, hint, new_node, comp);
-      rebalance_after_insertion(header, new_node);
-      return new_node;
-   }
-
-   //! @copydoc ::boost::intrusive::bstree_algorithms::insert_before(node_ptr,node_ptr,node_ptr)
-   static node_ptr insert_before
-      (node_ptr header, node_ptr pos, node_ptr new_node) BOOST_NOEXCEPT
-   {
-      bstree_algo::insert_before(header, pos, new_node);
-      rebalance_after_insertion(header, new_node);
-      return new_node;
-   }
-
-   //! @copydoc ::boost::intrusive::bstree_algorithms::push_back(node_ptr,node_ptr)
-   static void push_back(node_ptr header, node_ptr new_node) BOOST_NOEXCEPT
-   {
-      bstree_algo::push_back(header, new_node);
-      rebalance_after_insertion(header, new_node);
-   }
-
-   //! @copydoc ::boost::intrusive::bstree_algorithms::push_front(node_ptr,node_ptr)
-   static void push_front(node_ptr header, node_ptr new_node) BOOST_NOEXCEPT
-   {
-      bstree_algo::push_front(header, new_node);
-      rebalance_after_insertion(header, new_node);
-   }
-
-   #ifdef BOOST_INTRUSIVE_DOXYGEN_INVOKED
-   //! @copydoc ::boost::intrusive::bstree_algorithms::insert_unique_check(const_node_ptr,const KeyType&,KeyNodePtrCompare,insert_commit_data&)
-   template<class KeyType, class KeyNodePtrCompare>
-   static std::pair<node_ptr, bool> insert_unique_check
-      (const_node_ptr header,  const KeyType &key
-      ,KeyNodePtrCompare comp, insert_commit_data &commit_data);
-
-   //! @copydoc ::boost::intrusive::bstree_algorithms::insert_unique_check(const_node_ptr,const_node_ptr,const KeyType&,KeyNodePtrCompare,insert_commit_data&)
-   template<class KeyType, class KeyNodePtrCompare>
-   static std::pair<node_ptr, bool> insert_unique_check
-      (const_node_ptr header, node_ptr hint, const KeyType &key
-      ,KeyNodePtrCompare comp, insert_commit_data &commit_data);
-   #endif   //#ifdef BOOST_INTRUSIVE_DOXYGEN_INVOKED
-
-   //! @copydoc ::boost::intrusive::bstree_algorithms::insert_unique_commit(node_ptr,node_ptr,const insert_commit_data&)
-   static void insert_unique_commit
-      (node_ptr header, node_ptr new_value, const insert_commit_data &commit_data) BOOST_NOEXCEPT
-   {
-      bstree_algo::insert_unique_commit(header, new_value, commit_data);
-      rebalance_after_insertion(header, new_value);
-   }
-
-   //! @copydoc ::boost::intrusive::bstree_algorithms::is_header
-   static bool is_header(const_node_ptr p) BOOST_NOEXCEPT
-   {
-      return NodeTraits::get_color(p) == NodeTraits::red() &&
-            bstree_algo::is_header(p);
-   }
-
-   /// @cond
-   private:
-
-   static void rebalance_after_erasure
-      ( node_ptr header, node_ptr z, const typename bstree_algo::data_for_rebalance &info) BOOST_NOEXCEPT
-   {
-      color new_z_color;
-      if(info.y != z){
-         new_z_color = NodeTraits::get_color(info.y);
-         NodeTraits::set_color(info.y, NodeTraits::get_color(z));
-      }
-      else{
-         new_z_color = NodeTraits::get_color(z);
-      }
-      //Rebalance rbtree if needed
-      if(new_z_color != NodeTraits::red()){
-         rebalance_after_erasure_restore_invariants(header, info.x, info.x_parent);
-      }
-   }
-
-   static void rebalance_after_erasure_restore_invariants(node_ptr header, node_ptr x, node_ptr x_parent) BOOST_NOEXCEPT
-   {
-      while(1){
-         if(x_parent == header || (x && NodeTraits::get_color(x) != NodeTraits::black())){
-            break;
-         }
-         //Don't cache x_is_leftchild or similar because x can be null and
-         //equal to both x_parent_left and x_parent_right
-         const node_ptr x_parent_left(NodeTraits::get_left(x_parent));
-         if(x == x_parent_left){ //x is left child
-            node_ptr w = NodeTraits::get_right(x_parent);
-            BOOST_INTRUSIVE_INVARIANT_ASSERT(w);
-            if(NodeTraits::get_color(w) == NodeTraits::red()){
-               NodeTraits::set_color(w, NodeTraits::black());
-               NodeTraits::set_color(x_parent, NodeTraits::red());
-               bstree_algo::rotate_left(x_parent, w, NodeTraits::get_parent(x_parent), header);
-               w = NodeTraits::get_right(x_parent);
-               BOOST_INTRUSIVE_INVARIANT_ASSERT(w);
-            }
-            node_ptr const w_left (NodeTraits::get_left(w));
-            node_ptr const w_right(NodeTraits::get_right(w));
-            if((!w_left  || NodeTraits::get_color(w_left)  == NodeTraits::black()) &&
-               (!w_right || NodeTraits::get_color(w_right) == NodeTraits::black())){
-               NodeTraits::set_color(w, NodeTraits::red());
-               x = x_parent;
-               x_parent = NodeTraits::get_parent(x_parent);
-            }
-            else {
-               if(!w_right || NodeTraits::get_color(w_right) == NodeTraits::black()){
-                  NodeTraits::set_color(w_left, NodeTraits::black());
-                  NodeTraits::set_color(w, NodeTraits::red());
-                  bstree_algo::rotate_right(w, w_left, NodeTraits::get_parent(w), header);
-                  w = NodeTraits::get_right(x_parent);
-                  BOOST_INTRUSIVE_INVARIANT_ASSERT(w);
-               }
-               NodeTraits::set_color(w, NodeTraits::get_color(x_parent));
-               NodeTraits::set_color(x_parent, NodeTraits::black());
-               const node_ptr new_wright(NodeTraits::get_right(w));
-               if(new_wright)
-                  NodeTraits::set_color(new_wright, NodeTraits::black());
-               bstree_algo::rotate_left(x_parent, NodeTraits::get_right(x_parent), NodeTraits::get_parent(x_parent), header);
-               break;
-            }
-         }
-         else {
-            // same as above, with right_ <-> left_.
-            node_ptr w = x_parent_left;
-            if(NodeTraits::get_color(w) == NodeTraits::red()){
-               NodeTraits::set_color(w, NodeTraits::black());
-               NodeTraits::set_color(x_parent, NodeTraits::red());
-               bstree_algo::rotate_right(x_parent, w, NodeTraits::get_parent(x_parent), header);
-               w = NodeTraits::get_left(x_parent);
-               BOOST_INTRUSIVE_INVARIANT_ASSERT(w);
-            }
-            node_ptr const w_left (NodeTraits::get_left(w));
-            node_ptr const w_right(NodeTraits::get_right(w));
-            if((!w_right || NodeTraits::get_color(w_right) == NodeTraits::black()) &&
-               (!w_left  || NodeTraits::get_color(w_left)  == NodeTraits::black())){
-               NodeTraits::set_color(w, NodeTraits::red());
-               x = x_parent;
-               x_parent = NodeTraits::get_parent(x_parent);
-            }
-            else {
-               if(!w_left || NodeTraits::get_color(w_left) == NodeTraits::black()){
-                  NodeTraits::set_color(w_right, NodeTraits::black());
-                  NodeTraits::set_color(w, NodeTraits::red());
-                  bstree_algo::rotate_left(w, w_right, NodeTraits::get_parent(w), header);
-                  w = NodeTraits::get_left(x_parent);
-                  BOOST_INTRUSIVE_INVARIANT_ASSERT(w);
-               }
-               NodeTraits::set_color(w, NodeTraits::get_color(x_parent));
-               NodeTraits::set_color(x_parent, NodeTraits::black());
-               const node_ptr new_wleft(NodeTraits::get_left(w));
-               if(new_wleft)
-                  NodeTraits::set_color(new_wleft, NodeTraits::black());
-               bstree_algo::rotate_right(x_parent, NodeTraits::get_left(x_parent), NodeTraits::get_parent(x_parent), header);
-               break;
-            }
-         }
-      }
-      if(x)
-         NodeTraits::set_color(x, NodeTraits::black());
-   }
-
-   static void rebalance_after_insertion(node_ptr header, node_ptr p) BOOST_NOEXCEPT
-   {
-      NodeTraits::set_color(p, NodeTraits::red());
-      while(1){
-         node_ptr p_parent(NodeTraits::get_parent(p));
-         const node_ptr p_grandparent(NodeTraits::get_parent(p_parent));
-         if(p_parent == header || NodeTraits::get_color(p_parent) == NodeTraits::black() || p_grandparent == header){
-            break;
-         }
-
-         NodeTraits::set_color(p_grandparent, NodeTraits::red());
-         node_ptr const p_grandparent_left (NodeTraits::get_left (p_grandparent));
-         bool const p_parent_is_left_child = p_parent == p_grandparent_left;
-         node_ptr const x(p_parent_is_left_child ? NodeTraits::get_right(p_grandparent) : p_grandparent_left);
-
-         if(x && NodeTraits::get_color(x) == NodeTraits::red()){
-            NodeTraits::set_color(x, NodeTraits::black());
-            NodeTraits::set_color(p_parent, NodeTraits::black());
-            p = p_grandparent;
-         }
-         else{ //Final step
-            const bool p_is_left_child(NodeTraits::get_left(p_parent) == p);
-            if(p_parent_is_left_child){ //p_parent is left child
-               if(!p_is_left_child){ //p is right child
-                  bstree_algo::rotate_left_no_parent_fix(p_parent, p);
-                  //No need to link p and p_grandparent:
-                  //    [NodeTraits::set_parent(p, p_grandparent) + NodeTraits::set_left(p_grandparent, p)]
-                  //as p_grandparent is not the header, another rotation is coming and p_parent
-                  //will be the left child of p_grandparent
-                  p_parent = p;
-               }
-               bstree_algo::rotate_right(p_grandparent, p_parent, NodeTraits::get_parent(p_grandparent), header);
-            }
-            else{  //p_parent is right child
-               if(p_is_left_child){ //p is left child
-                  bstree_algo::rotate_right_no_parent_fix(p_parent, p);
-                  //No need to link p and p_grandparent:
-                  //    [NodeTraits::set_parent(p, p_grandparent) + NodeTraits::set_right(p_grandparent, p)]
-                  //as p_grandparent is not the header, another rotation is coming and p_parent
-                  //will be the right child of p_grandparent
-                  p_parent = p;
-               }
-               bstree_algo::rotate_left(p_grandparent, p_parent, NodeTraits::get_parent(p_grandparent), header);
-            }
-            NodeTraits::set_color(p_parent, NodeTraits::black());
-            break;
-         }
-      }
-      NodeTraits::set_color(NodeTraits::get_parent(header), NodeTraits::black());
-   }
-   /// @endcond
-};
-
-/// @cond
-
-template<class NodeTraits>
-struct get_algo<RbTreeAlgorithms, NodeTraits>
-{
-   typedef rbtree_algorithms<NodeTraits> type;
-};
-
-template <class ValueTraits, class NodePtrCompare, class ExtraChecker>
-struct get_node_checker<RbTreeAlgorithms, ValueTraits, NodePtrCompare, ExtraChecker>
-{
-    typedef detail::rbtree_node_checker<ValueTraits, NodePtrCompare, ExtraChecker> type;
-};
-
-/// @endcond
-
-} //namespace intrusive
-} //namespace boost
-
-#include <boost/intrusive/detail/config_end.hpp>
-
-#endif //BOOST_INTRUSIVE_RBTREE_ALGORITHMS_HPP
diff --git a/src/boost/intrusive/set.hpp b/src/boost/intrusive/set.hpp
deleted file mode 100644
index 30f0760d..00000000
--- a/src/boost/intrusive/set.hpp
+++ /dev/null
@@ -1,1073 +0,0 @@
-/////////////////////////////////////////////////////////////////////////////
-//
-// (C) Copyright Olaf Krzikalla 2004-2006.
-// (C) Copyright Ion Gaztanaga  2006-2014
-//
-// Distributed under the Boost 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/intrusive for documentation.
-//
-/////////////////////////////////////////////////////////////////////////////
-#ifndef BOOST_INTRUSIVE_SET_HPP
-#define BOOST_INTRUSIVE_SET_HPP
-
-#include <boost/intrusive/detail/config_begin.hpp>
-#include <boost/intrusive/intrusive_fwd.hpp>
-
-#include <boost/intrusive/detail/mpl.hpp>
-#include <boost/intrusive/rbtree.hpp>
-#include <boost/move/utility_core.hpp>
-#include <boost/static_assert.hpp>
-
-#if defined(BOOST_HAS_PRAGMA_ONCE)
-#  pragma once
-#endif
-
-namespace boost {
-namespace intrusive {
-
-#if !defined(BOOST_INTRUSIVE_DOXYGEN_INVOKED)
-template<class ValueTraits, class VoidOrKeyOfValue, class Compare, class SizeType, bool ConstantTimeSize, typename HeaderHolder>
-class multiset_impl;
-#endif
-
-//! The class template set is an intrusive container, that mimics most of
-//! the interface of std::set as described in the C++ standard.
-//!
-//! The template parameter \c T is the type to be managed by the container.
-//! The user can specify additional options and if no options are provided
-//! default options are used.
-//!
-//! The container supports the following options:
-//! \c base_hook<>/member_hook<>/value_traits<>,
-//! \c constant_time_size<>, \c size_type<> and
-//! \c compare<>.
-#if defined(BOOST_INTRUSIVE_DOXYGEN_INVOKED)
-template<class T, class ...Options>
-#else
-template<class ValueTraits, class VoidOrKeyOfValue, class Compare, class SizeType, bool ConstantTimeSize, typename HeaderHolder>
-#endif
-class set_impl
-#ifndef BOOST_INTRUSIVE_DOXYGEN_INVOKED
-   : public bstree_impl<ValueTraits, VoidOrKeyOfValue, Compare, SizeType, ConstantTimeSize, RbTreeAlgorithms, HeaderHolder>
-#endif
-{
-   /// @cond
-   typedef bstree_impl<ValueTraits, VoidOrKeyOfValue, Compare, SizeType, ConstantTimeSize, RbTreeAlgorithms, HeaderHolder> tree_type;
-   BOOST_MOVABLE_BUT_NOT_COPYABLE(set_impl)
-
-   typedef tree_type implementation_defined;
-   /// @endcond
-
-   public:
-   typedef typename implementation_defined::value_type               value_type;
-   typedef typename implementation_defined::key_type                 key_type;
-   typedef typename implementation_defined::key_of_value             key_of_value;
-   typedef typename implementation_defined::value_traits             value_traits;
-   typedef typename implementation_defined::pointer                  pointer;
-   typedef typename implementation_defined::const_pointer            const_pointer;
-   typedef typename implementation_defined::reference                reference;
-   typedef typename implementation_defined::const_reference          const_reference;
-   typedef typename implementation_defined::difference_type          difference_type;
-   typedef typename implementation_defined::size_type                size_type;
-   typedef typename implementation_defined::value_compare            value_compare;
-   typedef typename implementation_defined::key_compare              key_compare;
-   typedef typename implementation_defined::iterator                 iterator;
-   typedef typename implementation_defined::const_iterator           const_iterator;
-   typedef typename implementation_defined::reverse_iterator         reverse_iterator;
-   typedef typename implementation_defined::const_reverse_iterator   const_reverse_iterator;
-   typedef typename implementation_defined::insert_commit_data       insert_commit_data;
-   typedef typename implementation_defined::node_traits              node_traits;
-   typedef typename implementation_defined::node                     node;
-   typedef typename implementation_defined::node_ptr                 node_ptr;
-   typedef typename implementation_defined::const_node_ptr           const_node_ptr;
-   typedef typename implementation_defined::node_algorithms          node_algorithms;
-
-   static const bool constant_time_size = tree_type::constant_time_size;
-
-   public:
-   //! @copydoc ::boost::intrusive::rbtree::rbtree()
-   set_impl()
-      :  tree_type()
-   {}
-
-   //! @copydoc ::boost::intrusive::rbtree::rbtree(const key_compare &,const value_traits &)
-   explicit set_impl( const key_compare &cmp, const value_traits &v_traits = value_traits())
-      :  tree_type(cmp, v_traits)
-   {}
-
-   //! @copydoc ::boost::intrusive::rbtree::rbtree(bool,Iterator,Iterator,const key_compare &,const value_traits &)
-   template<class Iterator>
-   set_impl( Iterator b, Iterator e
-           , const key_compare &cmp = key_compare()
-           , const value_traits &v_traits = value_traits())
-      : tree_type(true, b, e, cmp, v_traits)
-   {}
-
-   //! @copydoc ::boost::intrusive::rbtree::rbtree(rbtree &&)
-   set_impl(BOOST_RV_REF(set_impl) x)
-      :  tree_type(BOOST_MOVE_BASE(tree_type, x))
-   {}
-
-   //! @copydoc ::boost::intrusive::rbtree::operator=(rbtree &&)
-   set_impl& operator=(BOOST_RV_REF(set_impl) x)
-   {  return static_cast<set_impl&>(tree_type::operator=(BOOST_MOVE_BASE(tree_type, x))); }
-
-   #ifdef BOOST_INTRUSIVE_DOXYGEN_INVOKED
-   //! @copydoc ::boost::intrusive::rbtree::~rbtree()
-   ~set_impl();
-
-   //! @copydoc ::boost::intrusive::rbtree::begin()
-   iterator begin() BOOST_NOEXCEPT;
-
-   //! @copydoc ::boost::intrusive::rbtree::begin()const
-   const_iterator begin() const BOOST_NOEXCEPT;
-
-   //! @copydoc ::boost::intrusive::rbtree::cbegin()const
-   const_iterator cbegin() const BOOST_NOEXCEPT;
-
-   //! @copydoc ::boost::intrusive::rbtree::end()
-   iterator end() BOOST_NOEXCEPT;
-
-   //! @copydoc ::boost::intrusive::rbtree::end()const
-   const_iterator end() const BOOST_NOEXCEPT;
-
-   //! @copydoc ::boost::intrusive::rbtree::cend()const
-   const_iterator cend() const BOOST_NOEXCEPT;
-
-   //! @copydoc ::boost::intrusive::rbtree::rbegin()
-   reverse_iterator rbegin() BOOST_NOEXCEPT;
-
-   //! @copydoc ::boost::intrusive::rbtree::rbegin()const
-   const_reverse_iterator rbegin() const BOOST_NOEXCEPT;
-
-   //! @copydoc ::boost::intrusive::rbtree::crbegin()const
-   const_reverse_iterator crbegin() const BOOST_NOEXCEPT;
-
-   //! @copydoc ::boost::intrusive::rbtree::rend()
-   reverse_iterator rend() BOOST_NOEXCEPT;
-
-   //! @copydoc ::boost::intrusive::rbtree::rend()const
-   const_reverse_iterator rend() const BOOST_NOEXCEPT;
-
-   //! @copydoc ::boost::intrusive::rbtree::crend()const
-   const_reverse_iterator crend() const BOOST_NOEXCEPT;
-
-   //! @copydoc ::boost::intrusive::rbtree::root()
-   iterator root() BOOST_NOEXCEPT;
-
-   //! @copydoc ::boost::intrusive::rbtree::root()const
-   const_iterator root() const BOOST_NOEXCEPT;
-
-   //! @copydoc ::boost::intrusive::rbtree::croot()const
-   const_iterator croot() const BOOST_NOEXCEPT;
-
-   //! @copydoc ::boost::intrusive::rbtree::container_from_end_iterator(iterator)
-   static set_impl &container_from_end_iterator(iterator end_iterator) BOOST_NOEXCEPT;
-
-   //! @copydoc ::boost::intrusive::rbtree::container_from_end_iterator(const_iterator)
-   static const set_impl &container_from_end_iterator(const_iterator end_iterator) BOOST_NOEXCEPT;
-
-   //! @copydoc ::boost::intrusive::rbtree::container_from_iterator(iterator)
-   static set_impl &container_from_iterator(iterator it) BOOST_NOEXCEPT;
-
-   //! @copydoc ::boost::intrusive::rbtree::container_from_iterator(const_iterator)
-   static const set_impl &container_from_iterator(const_iterator it) BOOST_NOEXCEPT;
-
-   //! @copydoc ::boost::intrusive::rbtree::key_comp()const
-   key_compare key_comp() const;
-
-   //! @copydoc ::boost::intrusive::rbtree::value_comp()const
-   value_compare value_comp() const;
-
-   //! @copydoc ::boost::intrusive::rbtree::empty()const
-   bool empty() const BOOST_NOEXCEPT;
-
-   //! @copydoc ::boost::intrusive::rbtree::size()const
-   size_type size() const BOOST_NOEXCEPT;
-
-   //! @copydoc ::boost::intrusive::rbtree::swap
-   void swap(set_impl& other);
-
-   //! @copydoc ::boost::intrusive::rbtree::clone_from(const rbtree&,Cloner,Disposer)
-   template <class Cloner, class Disposer>
-   void clone_from(const set_impl &src, Cloner cloner, Disposer disposer);
-
-   #else
-
-   using tree_type::clone_from;
-
-   #endif   //#ifdef BOOST_INTRUSIVE_DOXYGEN_INVOKED
-
-   //! @copydoc ::boost::intrusive::rbtree::clone_from(rbtree&&,Cloner,Disposer)
-   template <class Cloner, class Disposer>
-   void clone_from(BOOST_RV_REF(set_impl) src, Cloner cloner, Disposer disposer)
-   {  tree_type::clone_from(BOOST_MOVE_BASE(tree_type, src), cloner, disposer);  }
-
-   //! @copydoc ::boost::intrusive::rbtree::insert_unique(reference)
-   std::pair<iterator, bool> insert(reference value)
-   {  return tree_type::insert_unique(value);  }
-
-   //! @copydoc ::boost::intrusive::rbtree::insert_unique(const_iterator,reference)
-   iterator insert(const_iterator hint, reference value)
-   {  return tree_type::insert_unique(hint, value);  }
-
-   //! @copydoc ::boost::intrusive::rbtree::insert_unique_check(const key_type&,insert_commit_data&)
-   std::pair<iterator, bool> insert_check
-      (const key_type &key, insert_commit_data &commit_data)
-   {  return tree_type::insert_unique_check(key, commit_data); }
-
-   //! @copydoc ::boost::intrusive::rbtree::insert_unique_check(const_iterator,const key_type&,insert_commit_data&)
-   std::pair<iterator, bool> insert_check
-      (const_iterator hint, const key_type &key
-      ,insert_commit_data &commit_data)
-   {  return tree_type::insert_unique_check(hint, key, commit_data); }
-
-   //! @copydoc ::boost::intrusive::rbtree::insert_unique_check(const KeyType&,KeyTypeKeyCompare,insert_commit_data&)
-   template<class KeyType, class KeyTypeKeyCompare>
-   std::pair<iterator, bool> insert_check
-      (const KeyType &key, KeyTypeKeyCompare comp, insert_commit_data &commit_data)
-   {  return tree_type::insert_unique_check(key, comp, commit_data); }
-
-   //! @copydoc ::boost::intrusive::rbtree::insert_unique_check(const_iterator,const KeyType&,KeyTypeKeyCompare,insert_commit_data&)
-   template<class KeyType, class KeyTypeKeyCompare>
-   std::pair<iterator, bool> insert_check
-      (const_iterator hint, const KeyType &key
-      ,KeyTypeKeyCompare comp, insert_commit_data &commit_data)
-   {  return tree_type::insert_unique_check(hint, key, comp, commit_data); }
-
-   //! @copydoc ::boost::intrusive::rbtree::insert_unique(Iterator,Iterator)
-   template<class Iterator>
-   void insert(Iterator b, Iterator e)
-   {  tree_type::insert_unique(b, e);  }
-
-   //! @copydoc ::boost::intrusive::rbtree::insert_unique_commit
-   iterator insert_commit(reference value, const insert_commit_data &commit_data) BOOST_NOEXCEPT
-   {  return tree_type::insert_unique_commit(value, commit_data);  }
-
-   #ifdef BOOST_INTRUSIVE_DOXYGEN_INVOKED
-   //! @copydoc ::boost::intrusive::rbtree::insert_before
-   iterator insert_before(const_iterator pos, reference value) BOOST_NOEXCEPT;
-
-   //! @copydoc ::boost::intrusive::rbtree::push_back
-   void push_back(reference value) BOOST_NOEXCEPT;
-
-   //! @copydoc ::boost::intrusive::rbtree::push_front
-   void push_front(reference value) BOOST_NOEXCEPT;
-
-   //! @copydoc ::boost::intrusive::rbtree::erase(const_iterator)
-   iterator erase(const_iterator i) BOOST_NOEXCEPT;
-
-   //! @copydoc ::boost::intrusive::rbtree::erase(const_iterator,const_iterator)
-   iterator erase(const_iterator b, const_iterator e) BOOST_NOEXCEPT;
-
-   //! @copydoc ::boost::intrusive::rbtree::erase(const key_type &)
-   size_type erase(const key_type &key);
-
-   //! @copydoc ::boost::intrusive::rbtree::erase(const KeyType&,KeyTypeKeyCompare)
-   template<class KeyType, class KeyTypeKeyCompare>
-   size_type erase(const KeyType& key, KeyTypeKeyCompare comp);
-
-   //! @copydoc ::boost::intrusive::rbtree::erase_and_dispose(const_iterator,Disposer)
-   template<class Disposer>
-   iterator erase_and_dispose(const_iterator i, Disposer disposer) BOOST_NOEXCEPT;
-
-   //! @copydoc ::boost::intrusive::rbtree::erase_and_dispose(const_iterator,const_iterator,Disposer)
-   template<class Disposer>
-   iterator erase_and_dispose(const_iterator b, const_iterator e, Disposer disposer) BOOST_NOEXCEPT;
-
-   //! @copydoc ::boost::intrusive::rbtree::erase_and_dispose(const key_type &, Disposer)
-   template<class Disposer>
-   size_type erase_and_dispose(const key_type &key, Disposer disposer);
-
-   //! @copydoc ::boost::intrusive::rbtree::erase_and_dispose(const KeyType&,KeyTypeKeyCompare,Disposer)
-   template<class KeyType, class KeyTypeKeyCompare, class Disposer>
-   size_type erase_and_dispose(const KeyType& key, KeyTypeKeyCompare comp, Disposer disposer);
-
-   //! @copydoc ::boost::intrusive::rbtree::clear
-   void clear() BOOST_NOEXCEPT;
-
-   //! @copydoc ::boost::intrusive::rbtree::clear_and_dispose
-   template<class Disposer>
-   void clear_and_dispose(Disposer disposer) BOOST_NOEXCEPT;
-
-   #endif   //   #ifdef BOOST_INTRUSIVE_DOXYGEN_INVOKED
-
-   //! @copydoc ::boost::intrusive::rbtree::count(const key_type &)const
-   size_type count(const key_type &key) const
-   {  return static_cast<size_type>(this->tree_type::find(key) != this->tree_type::cend()); }
-
-   //! @copydoc ::boost::intrusive::rbtree::count(const KeyType&,KeyTypeKeyCompare)const
-   template<class KeyType, class KeyTypeKeyCompare>
-   size_type count(const KeyType& key, KeyTypeKeyCompare comp) const
-   {  return static_cast<size_type>(this->tree_type::find(key, comp) != this->tree_type::cend()); }
-
-   #ifdef BOOST_INTRUSIVE_DOXYGEN_INVOKED
-
-   //! @copydoc ::boost::intrusive::rbtree::lower_bound(const key_type &)
-   iterator lower_bound(const key_type &key);
-
-   //! @copydoc ::boost::intrusive::rbtree::lower_bound(const KeyType&,KeyTypeKeyCompare)
-   template<class KeyType, class KeyTypeKeyCompare>
-   iterator lower_bound(const KeyType& key, KeyTypeKeyCompare comp);
-
-   //! @copydoc ::boost::intrusive::rbtree::lower_bound(const key_type &)const
-   const_iterator lower_bound(const key_type &key) const;
-
-   //! @copydoc ::boost::intrusive::rbtree::lower_bound(const KeyType&,KeyTypeKeyCompare)const
-   template<class KeyType, class KeyTypeKeyCompare>
-   const_iterator lower_bound(const KeyType& key, KeyTypeKeyCompare comp) const;
-
-   //! @copydoc ::boost::intrusive::rbtree::upper_bound(const key_type &)
-   iterator upper_bound(const key_type &key);
-
-   //! @copydoc ::boost::intrusive::rbtree::upper_bound(const KeyType&,KeyTypeKeyCompare)
-   template<class KeyType, class KeyTypeKeyCompare>
-   iterator upper_bound(const KeyType& key, KeyTypeKeyCompare comp);
-
-   //! @copydoc ::boost::intrusive::rbtree::upper_bound(const key_type &)const
-   const_iterator upper_bound(const key_type &key) const;
-
-   //! @copydoc ::boost::intrusive::rbtree::upper_bound(const KeyType&,KeyTypeKeyCompare)const
-   template<class KeyType, class KeyTypeKeyCompare>
-   const_iterator upper_bound(const KeyType& key, KeyTypeKeyCompare comp) const;
-
-   //! @copydoc ::boost::intrusive::rbtree::find(const key_type &)
-   iterator find(const key_type &key);
-
-   //! @copydoc ::boost::intrusive::rbtree::find(const KeyType&,KeyTypeKeyCompare)
-   template<class KeyType, class KeyTypeKeyCompare>
-   iterator find(const KeyType& key, KeyTypeKeyCompare comp);
-
-   //! @copydoc ::boost::intrusive::rbtree::find(const key_type &)const
-   const_iterator find(const key_type &key) const;
-
-   //! @copydoc ::boost::intrusive::rbtree::find(const KeyType&,KeyTypeKeyCompare)const
-   template<class KeyType, class KeyTypeKeyCompare>
-   const_iterator find(const KeyType& key, KeyTypeKeyCompare comp) const;
-
-   #endif   //   #ifdef BOOST_INTRUSIVE_DOXYGEN_INVOKED
-
-   //! @copydoc ::boost::intrusive::rbtree::equal_range(const key_type &)
-   std::pair<iterator,iterator> equal_range(const key_type &key)
-   {  return this->tree_type::lower_bound_range(key); }
-
-   //! @copydoc ::boost::intrusive::rbtree::equal_range(const KeyType&,KeyTypeKeyCompare)
-   template<class KeyType, class KeyTypeKeyCompare>
-   std::pair<iterator,iterator> equal_range(const KeyType& key, KeyTypeKeyCompare comp)
-   {  return this->tree_type::equal_range(key, comp); }
-
-   //! @copydoc ::boost::intrusive::rbtree::equal_range(const key_type &)const
-   std::pair<const_iterator, const_iterator>
-      equal_range(const key_type &key) const
-   {  return this->tree_type::lower_bound_range(key); }
-
-   //! @copydoc ::boost::intrusive::rbtree::equal_range(const KeyType&,KeyTypeKeyCompare)const
-   template<class KeyType, class KeyTypeKeyCompare>
-   std::pair<const_iterator, const_iterator>
-      equal_range(const KeyType& key, KeyTypeKeyCompare comp) const
-   {  return this->tree_type::equal_range(key, comp); }
-
-   #ifdef BOOST_INTRUSIVE_DOXYGEN_INVOKED
-
-   //! @copydoc ::boost::intrusive::rbtree::bounded_range(const key_type &,const key_type &,bool,bool)
-   std::pair<iterator,iterator> bounded_range
-      (const key_type &lower_key, const key_type &upper_key, bool left_closed, bool right_closed);
-
-   //! @copydoc ::boost::intrusive::rbtree::bounded_range(const KeyType&,const KeyType&,KeyTypeKeyCompare,bool,bool)
-   template<class KeyType, class KeyTypeKeyCompare>
-   std::pair<iterator,iterator> bounded_range
-      (const KeyType& lower_key, const KeyType& upper_key, KeyTypeKeyCompare comp, bool left_closed, bool right_closed);
-
-   //! @copydoc ::boost::intrusive::rbtree::bounded_range(const key_type &,const key_type &,bool,bool)const
-   std::pair<const_iterator, const_iterator>
-      bounded_range(const key_type &lower_key, const key_type &upper_key, bool left_closed, bool right_closed) const;
-
-   //! @copydoc ::boost::intrusive::rbtree::bounded_range(const KeyType&,const KeyType&,KeyTypeKeyCompare,bool,bool)const
-   template<class KeyType, class KeyTypeKeyCompare>
-   std::pair<const_iterator, const_iterator> bounded_range
-         (const KeyType& lower_key, const KeyType& upper_key, KeyTypeKeyCompare comp, bool left_closed, bool right_closed) const;
-
-   //! @copydoc ::boost::intrusive::rbtree::s_iterator_to(reference)
-   static iterator s_iterator_to(reference value) BOOST_NOEXCEPT;
-
-   //! @copydoc ::boost::intrusive::rbtree::s_iterator_to(const_reference)
-   static const_iterator s_iterator_to(const_reference value) BOOST_NOEXCEPT;
-
-   //! @copydoc ::boost::intrusive::rbtree::iterator_to(reference)
-   iterator iterator_to(reference value) BOOST_NOEXCEPT;
-
-   //! @copydoc ::boost::intrusive::rbtree::iterator_to(const_reference)const
-   const_iterator iterator_to(const_reference value) const BOOST_NOEXCEPT;
-
-   //! @copydoc ::boost::intrusive::rbtree::init_node(reference)
-   static void init_node(reference value) BOOST_NOEXCEPT;
-
-   //! @copydoc ::boost::intrusive::rbtree::unlink_leftmost_without_rebalance
-   pointer unlink_leftmost_without_rebalance() BOOST_NOEXCEPT;
-
-   //! @copydoc ::boost::intrusive::rbtree::replace_node
-   void replace_node(iterator replace_this, reference with_this) BOOST_NOEXCEPT;
-
-   //! @copydoc ::boost::intrusive::rbtree::remove_node
-   void remove_node(reference value) BOOST_NOEXCEPT;
-
-   //! @copydoc ::boost::intrusive::rbtree::merge_unique
-   template<class ...Options2>
-   void merge(set<T, Options2...> &source);
-
-   //! @copydoc ::boost::intrusive::rbtree::merge_unique
-   template<class ...Options2>
-   void merge(multiset<T, Options2...> &source);
-
-   #else
-
-   template<class Compare2>
-   void merge(set_impl<ValueTraits, VoidOrKeyOfValue, Compare2, SizeType, ConstantTimeSize, HeaderHolder> &source)
-   {  return tree_type::merge_unique(source);  }
-
-
-   template<class Compare2>
-   void merge(multiset_impl<ValueTraits, VoidOrKeyOfValue, Compare2, SizeType, ConstantTimeSize, HeaderHolder> &source)
-   {  return tree_type::merge_unique(source);  }
-
-   #endif   //#ifdef BOOST_INTRUSIVE_DOXYGEN_INVOKED
-};
-
-#if defined(BOOST_INTRUSIVE_DOXYGEN_INVOKED)
-
-template<class T, class ...Options>
-bool operator!= (const set_impl<T, Options...> &x, const set_impl<T, Options...> &y);
-
-template<class T, class ...Options>
-bool operator>(const set_impl<T, Options...> &x, const set_impl<T, Options...> &y);
-
-template<class T, class ...Options>
-bool operator<=(const set_impl<T, Options...> &x, const set_impl<T, Options...> &y);
-
-template<class T, class ...Options>
-bool operator>=(const set_impl<T, Options...> &x, const set_impl<T, Options...> &y);
-
-template<class T, class ...Options>
-void swap(set_impl<T, Options...> &x, set_impl<T, Options...> &y);
-
-#endif   //#if defined(BOOST_INTRUSIVE_DOXYGEN_INVOKED)
-
-//! Helper metafunction to define a \c set that yields to the same type when the
-//! same options (either explicitly or implicitly) are used.
-#if defined(BOOST_INTRUSIVE_DOXYGEN_INVOKED) || defined(BOOST_INTRUSIVE_VARIADIC_TEMPLATES)
-template<class T, class ...Options>
-#else
-template<class T, class O1 = void, class O2 = void
-                , class O3 = void, class O4 = void
-                , class O5 = void, class O6 = void>
-#endif
-struct make_set
-{
-   /// @cond
-   typedef typename pack_options
-      < rbtree_defaults,
-      #if !defined(BOOST_INTRUSIVE_VARIADIC_TEMPLATES)
-      O1, O2, O3, O4, O5, O6
-      #else
-      Options...
-      #endif
-      >::type packed_options;
-
-   typedef typename detail::get_value_traits
-      <T, typename packed_options::proto_value_traits>::type value_traits;
-
-   typedef set_impl
-         < value_traits
-         , typename packed_options::key_of_value
-         , typename packed_options::compare
-         , typename packed_options::size_type
-         , packed_options::constant_time_size
-         , typename packed_options::header_holder_type
-         > implementation_defined;
-   /// @endcond
-   typedef implementation_defined type;
-};
-
-#ifndef BOOST_INTRUSIVE_DOXYGEN_INVOKED
-#if !defined(BOOST_INTRUSIVE_VARIADIC_TEMPLATES)
-template<class T, class O1, class O2, class O3, class O4, class O5, class O6>
-#else
-template<class T, class ...Options>
-#endif
-class set
-   :  public make_set<T,
-   #if !defined(BOOST_INTRUSIVE_VARIADIC_TEMPLATES)
-   O1, O2, O3, O4, O5, O6
-   #else
-   Options...
-   #endif
-   >::type
-{
-   typedef typename make_set
-      <T,
-      #if !defined(BOOST_INTRUSIVE_VARIADIC_TEMPLATES)
-      O1, O2, O3, O4, O5, O6
-      #else
-      Options...
-      #endif
-      >::type   Base;
-
-   BOOST_MOVABLE_BUT_NOT_COPYABLE(set)
-   public:
-   typedef typename Base::key_compare        key_compare;
-   typedef typename Base::value_traits       value_traits;
-   typedef typename Base::iterator           iterator;
-   typedef typename Base::const_iterator     const_iterator;
-
-   //Assert if passed value traits are compatible with the type
-   BOOST_STATIC_ASSERT((detail::is_same<typename value_traits::value_type, T>::value));
-
-   BOOST_INTRUSIVE_FORCEINLINE set()
-      :  Base()
-   {}
-
-   BOOST_INTRUSIVE_FORCEINLINE explicit set( const key_compare &cmp, const value_traits &v_traits = value_traits())
-      :  Base(cmp, v_traits)
-   {}
-
-   template<class Iterator>
-   BOOST_INTRUSIVE_FORCEINLINE set( Iterator b, Iterator e
-      , const key_compare &cmp = key_compare()
-      , const value_traits &v_traits = value_traits())
-      :  Base(b, e, cmp, v_traits)
-   {}
-
-   BOOST_INTRUSIVE_FORCEINLINE set(BOOST_RV_REF(set) x)
-      :  Base(BOOST_MOVE_BASE(Base, x))
-   {}
-
-   BOOST_INTRUSIVE_FORCEINLINE set& operator=(BOOST_RV_REF(set) x)
-   {  return static_cast<set &>(this->Base::operator=(BOOST_MOVE_BASE(Base, x)));  }
-
-   template <class Cloner, class Disposer>
-   BOOST_INTRUSIVE_FORCEINLINE void clone_from(const set &src, Cloner cloner, Disposer disposer)
-   {  Base::clone_from(src, cloner, disposer);  }
-
-   template <class Cloner, class Disposer>
-   BOOST_INTRUSIVE_FORCEINLINE void clone_from(BOOST_RV_REF(set) src, Cloner cloner, Disposer disposer)
-   {  Base::clone_from(BOOST_MOVE_BASE(Base, src), cloner, disposer);  }
-
-   BOOST_INTRUSIVE_FORCEINLINE static set &container_from_end_iterator(iterator end_iterator) BOOST_NOEXCEPT
-   {  return static_cast<set &>(Base::container_from_end_iterator(end_iterator));   }
-
-   BOOST_INTRUSIVE_FORCEINLINE static const set &container_from_end_iterator(const_iterator end_iterator) BOOST_NOEXCEPT
-   {  return static_cast<const set &>(Base::container_from_end_iterator(end_iterator));   }
-
-   BOOST_INTRUSIVE_FORCEINLINE static set &container_from_iterator(iterator it) BOOST_NOEXCEPT
-   {  return static_cast<set &>(Base::container_from_iterator(it));   }
-
-   BOOST_INTRUSIVE_FORCEINLINE static const set &container_from_iterator(const_iterator it) BOOST_NOEXCEPT
-   {  return static_cast<const set &>(Base::container_from_iterator(it));   }
-};
-
-#endif
-
-//! The class template multiset is an intrusive container, that mimics most of
-//! the interface of std::multiset as described in the C++ standard.
-//!
-//! The template parameter \c T is the type to be managed by the container.
-//! The user can specify additional options and if no options are provided
-//! default options are used.
-//!
-//! The container supports the following options:
-//! \c base_hook<>/member_hook<>/value_traits<>,
-//! \c constant_time_size<>, \c size_type<> and
-//! \c compare<>.
-#if defined(BOOST_INTRUSIVE_DOXYGEN_INVOKED)
-template<class T, class ...Options>
-#else
-template<class ValueTraits, class VoidOrKeyOfValue, class Compare, class SizeType, bool ConstantTimeSize, typename HeaderHolder>
-#endif
-class multiset_impl
-#ifndef BOOST_INTRUSIVE_DOXYGEN_INVOKED
-   : public bstree_impl<ValueTraits, VoidOrKeyOfValue, Compare, SizeType, ConstantTimeSize, RbTreeAlgorithms, HeaderHolder>
-#endif
-{
-   /// @cond
-   typedef bstree_impl<ValueTraits, VoidOrKeyOfValue, Compare, SizeType, ConstantTimeSize, RbTreeAlgorithms, HeaderHolder> tree_type;
-
-   BOOST_MOVABLE_BUT_NOT_COPYABLE(multiset_impl)
-   typedef tree_type implementation_defined;
-   /// @endcond
-
-   public:
-   typedef typename implementation_defined::value_type               value_type;
-   typedef typename implementation_defined::key_type                 key_type;
-   typedef typename implementation_defined::key_of_value             key_of_value;
-   typedef typename implementation_defined::value_traits             value_traits;
-   typedef typename implementation_defined::pointer                  pointer;
-   typedef typename implementation_defined::const_pointer            const_pointer;
-   typedef typename implementation_defined::reference                reference;
-   typedef typename implementation_defined::const_reference          const_reference;
-   typedef typename implementation_defined::difference_type          difference_type;
-   typedef typename implementation_defined::size_type                size_type;
-   typedef typename implementation_defined::value_compare            value_compare;
-   typedef typename implementation_defined::key_compare              key_compare;
-   typedef typename implementation_defined::iterator                 iterator;
-   typedef typename implementation_defined::const_iterator           const_iterator;
-   typedef typename implementation_defined::reverse_iterator         reverse_iterator;
-   typedef typename implementation_defined::const_reverse_iterator   const_reverse_iterator;
-   typedef typename implementation_defined::insert_commit_data       insert_commit_data;
-   typedef typename implementation_defined::node_traits              node_traits;
-   typedef typename implementation_defined::node                     node;
-   typedef typename implementation_defined::node_ptr                 node_ptr;
-   typedef typename implementation_defined::const_node_ptr           const_node_ptr;
-   typedef typename implementation_defined::node_algorithms          node_algorithms;
-
-   static const bool constant_time_size = tree_type::constant_time_size;
-
-   public:
-   //! @copydoc ::boost::intrusive::rbtree::rbtree()
-   multiset_impl()
-      :  tree_type()
-   {}
-
-   //! @copydoc ::boost::intrusive::rbtree::rbtree(const key_compare &,const value_traits &)
-   explicit multiset_impl( const key_compare &cmp, const value_traits &v_traits = value_traits())
-      :  tree_type(cmp, v_traits)
-   {}
-
-   //! @copydoc ::boost::intrusive::rbtree::rbtree(bool,Iterator,Iterator,const key_compare &,const value_traits &)
-   template<class Iterator>
-   multiset_impl( Iterator b, Iterator e
-                , const key_compare &cmp = key_compare()
-                , const value_traits &v_traits = value_traits())
-      : tree_type(false, b, e, cmp, v_traits)
-   {}
-
-   //! @copydoc ::boost::intrusive::rbtree::rbtree(rbtree &&)
-   multiset_impl(BOOST_RV_REF(multiset_impl) x)
-      :  tree_type(BOOST_MOVE_BASE(tree_type, x))
-   {}
-
-   //! @copydoc ::boost::intrusive::rbtree::operator=(rbtree &&)
-   multiset_impl& operator=(BOOST_RV_REF(multiset_impl) x)
-   {  return static_cast<multiset_impl&>(tree_type::operator=(BOOST_MOVE_BASE(tree_type, x))); }
-
-   #ifdef BOOST_INTRUSIVE_DOXYGEN_INVOKED
-   //! @copydoc ::boost::intrusive::rbtree::~rbtree()
-   ~multiset_impl();
-
-   //! @copydoc ::boost::intrusive::rbtree::begin()
-   iterator begin() BOOST_NOEXCEPT;
-
-   //! @copydoc ::boost::intrusive::rbtree::begin()const
-   const_iterator begin() const BOOST_NOEXCEPT;
-
-   //! @copydoc ::boost::intrusive::rbtree::cbegin()const
-   const_iterator cbegin() const BOOST_NOEXCEPT;
-
-   //! @copydoc ::boost::intrusive::rbtree::end()
-   iterator end() BOOST_NOEXCEPT;
-
-   //! @copydoc ::boost::intrusive::rbtree::end()const
-   const_iterator end() const BOOST_NOEXCEPT;
-
-   //! @copydoc ::boost::intrusive::rbtree::cend()const
-   const_iterator cend() const BOOST_NOEXCEPT;
-
-   //! @copydoc ::boost::intrusive::rbtree::rbegin()
-   reverse_iterator rbegin() BOOST_NOEXCEPT;
-
-   //! @copydoc ::boost::intrusive::rbtree::rbegin()const
-   const_reverse_iterator rbegin() const BOOST_NOEXCEPT;
-
-   //! @copydoc ::boost::intrusive::rbtree::crbegin()const
-   const_reverse_iterator crbegin() const BOOST_NOEXCEPT;
-
-   //! @copydoc ::boost::intrusive::rbtree::rend()
-   reverse_iterator rend() BOOST_NOEXCEPT;
-
-   //! @copydoc ::boost::intrusive::rbtree::rend()const
-   const_reverse_iterator rend() const BOOST_NOEXCEPT;
-
-   //! @copydoc ::boost::intrusive::rbtree::crend()const
-   const_reverse_iterator crend() const BOOST_NOEXCEPT;
-
-   //! @copydoc ::boost::intrusive::rbtree::root()
-   iterator root() BOOST_NOEXCEPT;
-
-   //! @copydoc ::boost::intrusive::rbtree::root()const
-   const_iterator root() const BOOST_NOEXCEPT;
-
-   //! @copydoc ::boost::intrusive::rbtree::croot()const
-   const_iterator croot() const BOOST_NOEXCEPT;
-
-   //! @copydoc ::boost::intrusive::rbtree::container_from_end_iterator(iterator)
-   static multiset_impl &container_from_end_iterator(iterator end_iterator) BOOST_NOEXCEPT;
-
-   //! @copydoc ::boost::intrusive::rbtree::container_from_end_iterator(const_iterator)
-   static const multiset_impl &container_from_end_iterator(const_iterator end_iterator) BOOST_NOEXCEPT;
-
-   //! @copydoc ::boost::intrusive::rbtree::container_from_iterator(iterator)
-   static multiset_impl &container_from_iterator(iterator it) BOOST_NOEXCEPT;
-
-   //! @copydoc ::boost::intrusive::rbtree::container_from_iterator(const_iterator)
-   static const multiset_impl &container_from_iterator(const_iterator it) BOOST_NOEXCEPT;
-
-   //! @copydoc ::boost::intrusive::rbtree::key_comp()const
-   key_compare key_comp() const;
-
-   //! @copydoc ::boost::intrusive::rbtree::value_comp()const
-   value_compare value_comp() const;
-
-   //! @copydoc ::boost::intrusive::rbtree::empty()const
-   bool empty() const BOOST_NOEXCEPT;
-
-   //! @copydoc ::boost::intrusive::rbtree::size()const
-   size_type size() const BOOST_NOEXCEPT;
-
-   //! @copydoc ::boost::intrusive::rbtree::swap
-   void swap(multiset_impl& other);
-
-   //! @copydoc ::boost::intrusive::rbtree::clone_from(const rbtree&,Cloner,Disposer)
-   template <class Cloner, class Disposer>
-   void clone_from(const multiset_impl &src, Cloner cloner, Disposer disposer);
-
-   #else
-
-   using tree_type::clone_from;
-
-   #endif   //#ifdef BOOST_INTRUSIVE_DOXYGEN_INVOKED
-
-   //! @copydoc ::boost::intrusive::rbtree::clone_from(rbtree&&,Cloner,Disposer)
-   template <class Cloner, class Disposer>
-   void clone_from(BOOST_RV_REF(multiset_impl) src, Cloner cloner, Disposer disposer)
-   {  tree_type::clone_from(BOOST_MOVE_BASE(tree_type, src), cloner, disposer);  }
-
-   //! @copydoc ::boost::intrusive::rbtree::insert_equal(reference)
-   iterator insert(reference value)
-   {  return tree_type::insert_equal(value);  }
-
-   //! @copydoc ::boost::intrusive::rbtree::insert_equal(const_iterator,reference)
-   iterator insert(const_iterator hint, reference value)
-   {  return tree_type::insert_equal(hint, value);  }
-
-   //! @copydoc ::boost::intrusive::rbtree::insert_equal(Iterator,Iterator)
-   template<class Iterator>
-   void insert(Iterator b, Iterator e)
-   {  tree_type::insert_equal(b, e);  }
-
-   #ifdef BOOST_INTRUSIVE_DOXYGEN_INVOKED
-   //! @copydoc ::boost::intrusive::rbtree::insert_before
-   iterator insert_before(const_iterator pos, reference value) BOOST_NOEXCEPT;
-
-   //! @copydoc ::boost::intrusive::rbtree::push_back
-   void push_back(reference value) BOOST_NOEXCEPT;
-
-   //! @copydoc ::boost::intrusive::rbtree::push_front
-   void push_front(reference value) BOOST_NOEXCEPT;
-
-   //! @copydoc ::boost::intrusive::rbtree::erase(const_iterator)
-   iterator erase(const_iterator i) BOOST_NOEXCEPT;
-
-   //! @copydoc ::boost::intrusive::rbtree::erase(const_iterator,const_iterator)
-   iterator erase(const_iterator b, const_iterator e) BOOST_NOEXCEPT;
-
-   //! @copydoc ::boost::intrusive::rbtree::erase(const key_type &)
-   size_type erase(const key_type &key);
-
-   //! @copydoc ::boost::intrusive::rbtree::erase(const KeyType&,KeyTypeKeyCompare)
-   template<class KeyType, class KeyTypeKeyCompare>
-   size_type erase(const KeyType& key, KeyTypeKeyCompare comp);
-
-   //! @copydoc ::boost::intrusive::rbtree::erase_and_dispose(const_iterator,Disposer)
-   template<class Disposer>
-   iterator erase_and_dispose(const_iterator i, Disposer disposer) BOOST_NOEXCEPT;
-
-   //! @copydoc ::boost::intrusive::rbtree::erase_and_dispose(const_iterator,const_iterator,Disposer)
-   template<class Disposer>
-   iterator erase_and_dispose(const_iterator b, const_iterator e, Disposer disposer) BOOST_NOEXCEPT;
-
-   //! @copydoc ::boost::intrusive::rbtree::erase_and_dispose(const key_type &, Disposer)
-   template<class Disposer>
-   size_type erase_and_dispose(const key_type &key, Disposer disposer);
-
-   //! @copydoc ::boost::intrusive::rbtree::erase_and_dispose(const KeyType&,KeyTypeKeyCompare,Disposer)
-   template<class KeyType, class KeyTypeKeyCompare, class Disposer>
-   size_type erase_and_dispose(const KeyType& key, KeyTypeKeyCompare comp, Disposer disposer);
-
-   //! @copydoc ::boost::intrusive::rbtree::clear
-   void clear() BOOST_NOEXCEPT;
-
-   //! @copydoc ::boost::intrusive::rbtree::clear_and_dispose
-   template<class Disposer>
-   void clear_and_dispose(Disposer disposer) BOOST_NOEXCEPT;
-
-   //! @copydoc ::boost::intrusive::rbtree::count(const key_type &)const
-   size_type count(const key_type &key) const;
-
-   //! @copydoc ::boost::intrusive::rbtree::count(const KeyType&,KeyTypeKeyCompare)const
-   template<class KeyType, class KeyTypeKeyCompare>
-   size_type count(const KeyType& key, KeyTypeKeyCompare comp) const;
-
-   //! @copydoc ::boost::intrusive::rbtree::lower_bound(const key_type &)
-   iterator lower_bound(const key_type &key);
-
-   //! @copydoc ::boost::intrusive::rbtree::lower_bound(const KeyType&,KeyTypeKeyCompare)
-   template<class KeyType, class KeyTypeKeyCompare>
-   iterator lower_bound(const KeyType& key, KeyTypeKeyCompare comp);
-
-   //! @copydoc ::boost::intrusive::rbtree::lower_bound(const key_type &)const
-   const_iterator lower_bound(const key_type &key) const;
-
-   //! @copydoc ::boost::intrusive::rbtree::lower_bound(const KeyType&,KeyTypeKeyCompare)const
-   template<class KeyType, class KeyTypeKeyCompare>
-   const_iterator lower_bound(const KeyType& key, KeyTypeKeyCompare comp) const;
-
-   //! @copydoc ::boost::intrusive::rbtree::upper_bound(const key_type &)
-   iterator upper_bound(const key_type &key);
-
-   //! @copydoc ::boost::intrusive::rbtree::upper_bound(const KeyType&,KeyTypeKeyCompare)
-   template<class KeyType, class KeyTypeKeyCompare>
-   iterator upper_bound(const KeyType& key, KeyTypeKeyCompare comp);
-
-   //! @copydoc ::boost::intrusive::rbtree::upper_bound(const key_type &)const
-   const_iterator upper_bound(const key_type &key) const;
-
-   //! @copydoc ::boost::intrusive::rbtree::upper_bound(const KeyType&,KeyTypeKeyCompare)const
-   template<class KeyType, class KeyTypeKeyCompare>
-   const_iterator upper_bound(const KeyType& key, KeyTypeKeyCompare comp) const;
-
-   //! @copydoc ::boost::intrusive::rbtree::find(const key_type &)
-   iterator find(const key_type &key);
-
-   //! @copydoc ::boost::intrusive::rbtree::find(const KeyType&,KeyTypeKeyCompare)
-   template<class KeyType, class KeyTypeKeyCompare>
-   iterator find(const KeyType& key, KeyTypeKeyCompare comp);
-
-   //! @copydoc ::boost::intrusive::rbtree::find(const key_type &)const
-   const_iterator find(const key_type &key) const;
-
-   //! @copydoc ::boost::intrusive::rbtree::find(const KeyType&,KeyTypeKeyCompare)const
-   template<class KeyType, class KeyTypeKeyCompare>
-   const_iterator find(const KeyType& key, KeyTypeKeyCompare comp) const;
-
-   //! @copydoc ::boost::intrusive::rbtree::equal_range(const key_type &)
-   std::pair<iterator,iterator> equal_range(const key_type &key);
-
-   //! @copydoc ::boost::intrusive::rbtree::equal_range(const KeyType&,KeyTypeKeyCompare)
-   template<class KeyType, class KeyTypeKeyCompare>
-   std::pair<iterator,iterator> equal_range(const KeyType& key, KeyTypeKeyCompare comp);
-
-   //! @copydoc ::boost::intrusive::rbtree::equal_range(const key_type &)const
-   std::pair<const_iterator, const_iterator>
-      equal_range(const key_type &key) const;
-
-   //! @copydoc ::boost::intrusive::rbtree::equal_range(const KeyType&,KeyTypeKeyCompare)const
-   template<class KeyType, class KeyTypeKeyCompare>
-   std::pair<const_iterator, const_iterator>
-      equal_range(const KeyType& key, KeyTypeKeyCompare comp) const;
-
-   //! @copydoc ::boost::intrusive::rbtree::bounded_range(const key_type &,const key_type &,bool,bool)
-   std::pair<iterator,iterator> bounded_range
-      (const key_type &lower_key, const key_type &upper_key, bool left_closed, bool right_closed);
-
-   //! @copydoc ::boost::intrusive::rbtree::bounded_range(const KeyType&,const KeyType&,KeyTypeKeyCompare,bool,bool)
-   template<class KeyType, class KeyTypeKeyCompare>
-   std::pair<iterator,iterator> bounded_range
-      (const KeyType& lower_key, const KeyType& upper_key, KeyTypeKeyCompare comp, bool left_closed, bool right_closed);
-
-   //! @copydoc ::boost::intrusive::rbtree::bounded_range(const key_type &,const key_type &,bool,bool)const
-   std::pair<const_iterator, const_iterator>
-      bounded_range(const key_type &lower_key, const key_type &upper_key, bool left_closed, bool right_closed) const;
-
-   //! @copydoc ::boost::intrusive::rbtree::bounded_range(const KeyType&,const KeyType&,KeyTypeKeyCompare,bool,bool)const
-   template<class KeyType, class KeyTypeKeyCompare>
-   std::pair<const_iterator, const_iterator> bounded_range
-         (const KeyType& lower_key, const KeyType& upper_key, KeyTypeKeyCompare comp, bool left_closed, bool right_closed) const;
-
-   //! @copydoc ::boost::intrusive::rbtree::s_iterator_to(reference)
-   static iterator s_iterator_to(reference value) BOOST_NOEXCEPT;
-
-   //! @copydoc ::boost::intrusive::rbtree::s_iterator_to(const_reference)
-   static const_iterator s_iterator_to(const_reference value) BOOST_NOEXCEPT;
-
-   //! @copydoc ::boost::intrusive::rbtree::iterator_to(reference)
-   iterator iterator_to(reference value) BOOST_NOEXCEPT;
-
-   //! @copydoc ::boost::intrusive::rbtree::iterator_to(const_reference)const
-   const_iterator iterator_to(const_reference value) const BOOST_NOEXCEPT;
-
-   //! @copydoc ::boost::intrusive::rbtree::init_node(reference)
-   static void init_node(reference value) BOOST_NOEXCEPT;
-
-   //! @copydoc ::boost::intrusive::rbtree::unlink_leftmost_without_rebalance
-   pointer unlink_leftmost_without_rebalance() BOOST_NOEXCEPT;
-
-   //! @copydoc ::boost::intrusive::rbtree::replace_node
-   void replace_node(iterator replace_this, reference with_this) BOOST_NOEXCEPT;
-
-   //! @copydoc ::boost::intrusive::rbtree::remove_node
-   void remove_node(reference value) BOOST_NOEXCEPT;
-
-   //! @copydoc ::boost::intrusive::rbtree::merge_equal
-   template<class ...Options2>
-   void merge(multiset<T, Options2...> &source);
-
-   //! @copydoc ::boost::intrusive::rbtree::merge_equal
-   template<class ...Options2>
-   void merge(set<T, Options2...> &source);
-
-   #else
-
-   template<class Compare2>
-   void merge(multiset_impl<ValueTraits, VoidOrKeyOfValue, Compare2, SizeType, ConstantTimeSize, HeaderHolder> &source)
-   {  return tree_type::merge_equal(source);  }
-
-   template<class Compare2>
-   void merge(set_impl<ValueTraits, VoidOrKeyOfValue, Compare2, SizeType, ConstantTimeSize, HeaderHolder> &source)
-   {  return tree_type::merge_equal(source);  }
-
-   #endif   //#ifdef BOOST_INTRUSIVE_DOXYGEN_INVOKED
-};
-
-#if defined(BOOST_INTRUSIVE_DOXYGEN_INVOKED)
-
-template<class T, class ...Options>
-bool operator!= (const multiset_impl<T, Options...> &x, const multiset_impl<T, Options...> &y);
-
-template<class T, class ...Options>
-bool operator>(const multiset_impl<T, Options...> &x, const multiset_impl<T, Options...> &y);
-
-template<class T, class ...Options>
-bool operator<=(const multiset_impl<T, Options...> &x, const multiset_impl<T, Options...> &y);
-
-template<class T, class ...Options>
-bool operator>=(const multiset_impl<T, Options...> &x, const multiset_impl<T, Options...> &y);
-
-template<class T, class ...Options>
-void swap(multiset_impl<T, Options...> &x, multiset_impl<T, Options...> &y);
-
-#endif   //#if defined(BOOST_INTRUSIVE_DOXYGEN_INVOKED)
-
-//! Helper metafunction to define a \c multiset that yields to the same type when the
-//! same options (either explicitly or implicitly) are used.
-#if defined(BOOST_INTRUSIVE_DOXYGEN_INVOKED) || defined(BOOST_INTRUSIVE_VARIADIC_TEMPLATES)
-template<class T, class ...Options>
-#else
-template<class T, class O1 = void, class O2 = void
-                , class O3 = void, class O4 = void
-                , class O5 = void, class O6 = void>
-#endif
-struct make_multiset
-{
-   /// @cond
-   typedef typename pack_options
-      < rbtree_defaults,
-      #if !defined(BOOST_INTRUSIVE_VARIADIC_TEMPLATES)
-      O1, O2, O3, O4, O5, O6
-      #else
-      Options...
-      #endif
-      >::type packed_options;
-
-   typedef typename detail::get_value_traits
-      <T, typename packed_options::proto_value_traits>::type value_traits;
-
-   typedef multiset_impl
-         < value_traits
-         , typename packed_options::key_of_value
-         , typename packed_options::compare
-         , typename packed_options::size_type
-         , packed_options::constant_time_size
-         , typename packed_options::header_holder_type
-         > implementation_defined;
-   /// @endcond
-   typedef implementation_defined type;
-};
-
-#ifndef BOOST_INTRUSIVE_DOXYGEN_INVOKED
-
-#if !defined(BOOST_INTRUSIVE_VARIADIC_TEMPLATES)
-template<class T, class O1, class O2, class O3, class O4, class O5, class O6>
-#else
-template<class T, class ...Options>
-#endif
-class multiset
-   :  public make_multiset<T,
-      #if !defined(BOOST_INTRUSIVE_VARIADIC_TEMPLATES)
-      O1, O2, O3, O4, O5, O6
-      #else
-      Options...
-      #endif
-      >::type
-{
-   typedef typename make_multiset<T,
-      #if !defined(BOOST_INTRUSIVE_VARIADIC_TEMPLATES)
-      O1, O2, O3, O4, O5, O6
-      #else
-      Options...
-      #endif
-      >::type   Base;
-
-   BOOST_MOVABLE_BUT_NOT_COPYABLE(multiset)
-
-   public:
-   typedef typename Base::key_compare        key_compare;
-   typedef typename Base::value_traits       value_traits;
-   typedef typename Base::iterator           iterator;
-   typedef typename Base::const_iterator     const_iterator;
-
-   //Assert if passed value traits are compatible with the type
-   BOOST_STATIC_ASSERT((detail::is_same<typename value_traits::value_type, T>::value));
-
-   BOOST_INTRUSIVE_FORCEINLINE multiset()
-      :  Base()
-   {}
-
-   BOOST_INTRUSIVE_FORCEINLINE explicit multiset( const key_compare &cmp, const value_traits &v_traits = value_traits())
-      :  Base(cmp, v_traits)
-   {}
-
-   template<class Iterator>
-   BOOST_INTRUSIVE_FORCEINLINE multiset( Iterator b, Iterator e
-           , const key_compare &cmp = key_compare()
-           , const value_traits &v_traits = value_traits())
-      :  Base(b, e, cmp, v_traits)
-   {}
-
-   BOOST_INTRUSIVE_FORCEINLINE multiset(BOOST_RV_REF(multiset) x)
-      :  Base(BOOST_MOVE_BASE(Base, x))
-   {}
-
-   BOOST_INTRUSIVE_FORCEINLINE multiset& operator=(BOOST_RV_REF(multiset) x)
-   {  return static_cast<multiset &>(this->Base::operator=(BOOST_MOVE_BASE(Base, x)));  }
-
-   template <class Cloner, class Disposer>
-   BOOST_INTRUSIVE_FORCEINLINE void clone_from(const multiset &src, Cloner cloner, Disposer disposer)
-   {  Base::clone_from(src, cloner, disposer);  }
-
-   template <class Cloner, class Disposer>
-   BOOST_INTRUSIVE_FORCEINLINE void clone_from(BOOST_RV_REF(multiset) src, Cloner cloner, Disposer disposer)
-   {  Base::clone_from(BOOST_MOVE_BASE(Base, src), cloner, disposer);  }
-
-   BOOST_INTRUSIVE_FORCEINLINE static multiset &container_from_end_iterator(iterator end_iterator) BOOST_NOEXCEPT
-   {  return static_cast<multiset &>(Base::container_from_end_iterator(end_iterator));   }
-
-   BOOST_INTRUSIVE_FORCEINLINE static const multiset &container_from_end_iterator(const_iterator end_iterator) BOOST_NOEXCEPT
-   {  return static_cast<const multiset &>(Base::container_from_end_iterator(end_iterator));   }
-
-   BOOST_INTRUSIVE_FORCEINLINE static multiset &container_from_iterator(iterator it) BOOST_NOEXCEPT
-   {  return static_cast<multiset &>(Base::container_from_iterator(it));   }
-
-   BOOST_INTRUSIVE_FORCEINLINE static const multiset &container_from_iterator(const_iterator it) BOOST_NOEXCEPT
-   {  return static_cast<const multiset &>(Base::container_from_iterator(it));   }
-};
-
-#endif
-
-} //namespace intrusive
-} //namespace boost
-
-#include <boost/intrusive/detail/config_end.hpp>
-
-#endif //BOOST_INTRUSIVE_SET_HPP
diff --git a/src/boost/intrusive/set_hook.hpp b/src/boost/intrusive/set_hook.hpp
deleted file mode 100644
index fed331cc..00000000
--- a/src/boost/intrusive/set_hook.hpp
+++ /dev/null
@@ -1,296 +0,0 @@
-/////////////////////////////////////////////////////////////////////////////
-//
-// (C) Copyright Olaf Krzikalla 2004-2006.
-// (C) Copyright Ion Gaztanaga  2006-2013
-//
-// Distributed under the Boost 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/intrusive for documentation.
-//
-/////////////////////////////////////////////////////////////////////////////
-
-#ifndef BOOST_INTRUSIVE_SET_HOOK_HPP
-#define BOOST_INTRUSIVE_SET_HOOK_HPP
-
-#include <boost/intrusive/detail/config_begin.hpp>
-#include <boost/intrusive/intrusive_fwd.hpp>
-
-#include <boost/intrusive/detail/rbtree_node.hpp>
-#include <boost/intrusive/rbtree_algorithms.hpp>
-#include <boost/intrusive/options.hpp>
-#include <boost/intrusive/detail/generic_hook.hpp>
-
-#if defined(BOOST_HAS_PRAGMA_ONCE)
-#  pragma once
-#endif
-
-namespace boost {
-namespace intrusive {
-
-//! Helper metafunction to define a \c set_base_hook that yields to the same
-//! type when the same options (either explicitly or implicitly) are used.
-#if defined(BOOST_INTRUSIVE_DOXYGEN_INVOKED) || defined(BOOST_INTRUSIVE_VARIADIC_TEMPLATES)
-template<class ...Options>
-#else
-template<class O1 = void, class O2 = void, class O3 = void, class O4 = void>
-#endif
-struct make_set_base_hook
-{
-   /// @cond
-   typedef typename pack_options
-      < hook_defaults,
-      #if !defined(BOOST_INTRUSIVE_VARIADIC_TEMPLATES)
-      O1, O2, O3, O4
-      #else
-      Options...
-      #endif
-      >::type packed_options;
-
-   typedef generic_hook
-   < RbTreeAlgorithms
-   , rbtree_node_traits<typename packed_options::void_pointer, packed_options::optimize_size>
-   , typename packed_options::tag
-   , packed_options::link_mode
-   , RbTreeBaseHookId
-   > implementation_defined;
-   /// @endcond
-   typedef implementation_defined type;
-};
-
-//! Derive a class from set_base_hook in order to store objects in
-//! in a set/multiset. set_base_hook holds the data necessary to maintain
-//! the set/multiset and provides an appropriate value_traits class for set/multiset.
-//!
-//! The hook admits the following options: \c tag<>, \c void_pointer<>,
-//! \c link_mode<> and \c optimize_size<>.
-//!
-//! \c tag<> defines a tag to identify the node.
-//! The same tag value can be used in different classes, but if a class is
-//! derived from more than one \c list_base_hook, then each \c list_base_hook needs its
-//! unique tag.
-//!
-//! \c void_pointer<> is the pointer type that will be used internally in the hook
-//! and the container configured to use this hook.
-//!
-//! \c link_mode<> will specify the linking mode of the hook (\c normal_link,
-//! \c auto_unlink or \c safe_link).
-//!
-//! \c optimize_size<> will tell the hook to optimize the hook for size instead
-//! of speed.
-#if defined(BOOST_INTRUSIVE_DOXYGEN_INVOKED) || defined(BOOST_INTRUSIVE_VARIADIC_TEMPLATES)
-template<class ...Options>
-#else
-template<class O1, class O2, class O3, class O4>
-#endif
-class set_base_hook
-   :  public make_set_base_hook<
-      #if !defined(BOOST_INTRUSIVE_VARIADIC_TEMPLATES)
-      O1, O2, O3, O4
-      #else
-      Options...
-      #endif
-      >::type
-{
-   #if defined(BOOST_INTRUSIVE_DOXYGEN_INVOKED)
-   public:
-   //! <b>Effects</b>: If link_mode is \c auto_unlink or \c safe_link
-   //!   initializes the node to an unlinked state.
-   //!
-   //! <b>Throws</b>: Nothing.
-   set_base_hook() BOOST_NOEXCEPT;
-
-   //! <b>Effects</b>: If link_mode is \c auto_unlink or \c safe_link
-   //!   initializes the node to an unlinked state. The argument is ignored.
-   //!
-   //! <b>Throws</b>: Nothing.
-   //!
-   //! <b>Rationale</b>: Providing a copy-constructor
-   //!   makes classes using the hook STL-compliant without forcing the
-   //!   user to do some additional work. \c swap can be used to emulate
-   //!   move-semantics.
-   set_base_hook(const set_base_hook& ) BOOST_NOEXCEPT;
-
-   //! <b>Effects</b>: Empty function. The argument is ignored.
-   //!
-   //! <b>Throws</b>: Nothing.
-   //!
-   //! <b>Rationale</b>: Providing an assignment operator
-   //!   makes classes using the hook STL-compliant without forcing the
-   //!   user to do some additional work. \c swap can be used to emulate
-   //!   move-semantics.
-   set_base_hook& operator=(const set_base_hook& ) BOOST_NOEXCEPT;
-
-   //! <b>Effects</b>: If link_mode is \c normal_link, the destructor does
-   //!   nothing (ie. no code is generated). If link_mode is \c safe_link and the
-   //!   object is stored in a set an assertion is raised. If link_mode is
-   //!   \c auto_unlink and \c is_linked() is true, the node is unlinked.
-   //!
-   //! <b>Throws</b>: Nothing.
-   ~set_base_hook();
-
-   //! <b>Effects</b>: Swapping two nodes swaps the position of the elements
-   //!   related to those nodes in one or two containers. That is, if the node
-   //!   this is part of the element e1, the node x is part of the element e2
-   //!   and both elements are included in the containers s1 and s2, then after
-   //!   the swap-operation e1 is in s2 at the position of e2 and e2 is in s1
-   //!   at the position of e1. If one element is not in a container, then
-   //!   after the swap-operation the other element is not in a container.
-   //!   Iterators to e1 and e2 related to those nodes are invalidated.
-   //!
-   //! <b>Complexity</b>: Constant
-   //!
-   //! <b>Throws</b>: Nothing.
-   void swap_nodes(set_base_hook &other) BOOST_NOEXCEPT;
-
-   //! <b>Precondition</b>: link_mode must be \c safe_link or \c auto_unlink.
-   //!
-   //! <b>Returns</b>: true, if the node belongs to a container, false
-   //!   otherwise. This function can be used to test whether \c set::iterator_to
-   //!   will return a valid iterator.
-   //!
-   //! <b>Complexity</b>: Constant
-   bool is_linked() const BOOST_NOEXCEPT;
-
-   //! <b>Effects</b>: Removes the node if it's inserted in a container.
-   //!   This function is only allowed if link_mode is \c auto_unlink.
-   //!
-   //! <b>Throws</b>: Nothing.
-   void unlink() BOOST_NOEXCEPT;
-   #endif
-};
-
-//! Helper metafunction to define a \c set_member_hook that yields to the same
-//! type when the same options (either explicitly or implicitly) are used.
-#if defined(BOOST_INTRUSIVE_DOXYGEN_INVOKED) || defined(BOOST_INTRUSIVE_VARIADIC_TEMPLATES)
-template<class ...Options>
-#else
-template<class O1 = void, class O2 = void, class O3 = void, class O4 = void>
-#endif
-struct make_set_member_hook
-{
-   /// @cond
-   typedef typename pack_options
-      < hook_defaults,
-      #if !defined(BOOST_INTRUSIVE_VARIADIC_TEMPLATES)
-      O1, O2, O3, O4
-      #else
-      Options...
-      #endif
-      >::type packed_options;
-
-   typedef generic_hook
-   < RbTreeAlgorithms
-   , rbtree_node_traits<typename packed_options::void_pointer, packed_options::optimize_size>
-   , member_tag
-   , packed_options::link_mode
-   , NoBaseHookId
-   > implementation_defined;
-   /// @endcond
-   typedef implementation_defined type;
-};
-
-//! Put a public data member set_member_hook in order to store objects of this class in
-//! a set/multiset. set_member_hook holds the data necessary for maintaining the
-//! set/multiset and provides an appropriate value_traits class for set/multiset.
-//!
-//! The hook admits the following options: \c void_pointer<>,
-//! \c link_mode<> and \c optimize_size<>.
-//!
-//! \c void_pointer<> is the pointer type that will be used internally in the hook
-//! and the container configured to use this hook.
-//!
-//! \c link_mode<> will specify the linking mode of the hook (\c normal_link,
-//! \c auto_unlink or \c safe_link).
-//!
-//! \c optimize_size<> will tell the hook to optimize the hook for size instead
-//! of speed.
-#if defined(BOOST_INTRUSIVE_DOXYGEN_INVOKED) || defined(BOOST_INTRUSIVE_VARIADIC_TEMPLATES)
-template<class ...Options>
-#else
-template<class O1, class O2, class O3, class O4>
-#endif
-class set_member_hook
-   :  public make_set_member_hook<
-      #if !defined(BOOST_INTRUSIVE_VARIADIC_TEMPLATES)
-      O1, O2, O3, O4
-      #else
-      Options...
-      #endif
-      >::type
-{
-   #if defined(BOOST_INTRUSIVE_DOXYGEN_INVOKED)
-   public:
-   //! <b>Effects</b>: If link_mode is \c auto_unlink or \c safe_link
-   //!   initializes the node to an unlinked state.
-   //!
-   //! <b>Throws</b>: Nothing.
-   set_member_hook() BOOST_NOEXCEPT;
-
-   //! <b>Effects</b>: If link_mode is \c auto_unlink or \c safe_link
-   //!   initializes the node to an unlinked state. The argument is ignored.
-   //!
-   //! <b>Throws</b>: Nothing.
-   //!
-   //! <b>Rationale</b>: Providing a copy-constructor
-   //!   makes classes using the hook STL-compliant without forcing the
-   //!   user to do some additional work. \c swap can be used to emulate
-   //!   move-semantics.
-   set_member_hook(const set_member_hook& ) BOOST_NOEXCEPT;
-
-   //! <b>Effects</b>: Empty function. The argument is ignored.
-   //!
-   //! <b>Throws</b>: Nothing.
-   //!
-   //! <b>Rationale</b>: Providing an assignment operator
-   //!   makes classes using the hook STL-compliant without forcing the
-   //!   user to do some additional work. \c swap can be used to emulate
-   //!   move-semantics.
-   set_member_hook& operator=(const set_member_hook& ) BOOST_NOEXCEPT;
-
-   //! <b>Effects</b>: If link_mode is \c normal_link, the destructor does
-   //!   nothing (ie. no code is generated). If link_mode is \c safe_link and the
-   //!   object is stored in a set an assertion is raised. If link_mode is
-   //!   \c auto_unlink and \c is_linked() is true, the node is unlinked.
-   //!
-   //! <b>Throws</b>: Nothing.
-   ~set_member_hook();
-
-   //! <b>Effects</b>: Swapping two nodes swaps the position of the elements
-   //!   related to those nodes in one or two containers. That is, if the node
-   //!   this is part of the element e1, the node x is part of the element e2
-   //!   and both elements are included in the containers s1 and s2, then after
-   //!   the swap-operation e1 is in s2 at the position of e2 and e2 is in s1
-   //!   at the position of e1. If one element is not in a container, then
-   //!   after the swap-operation the other element is not in a container.
-   //!   Iterators to e1 and e2 related to those nodes are invalidated.
-   //!
-   //! <b>Complexity</b>: Constant
-   //!
-   //! <b>Throws</b>: Nothing.
-   void swap_nodes(set_member_hook &other) BOOST_NOEXCEPT;
-
-   //! <b>Precondition</b>: link_mode must be \c safe_link or \c auto_unlink.
-   //!
-   //! <b>Returns</b>: true, if the node belongs to a container, false
-   //!   otherwise. This function can be used to test whether \c set::iterator_to
-   //!   will return a valid iterator.
-   //!
-   //! <b>Complexity</b>: Constant
-   bool is_linked() const BOOST_NOEXCEPT;
-
-   //! <b>Effects</b>: Removes the node if it's inserted in a container.
-   //!   This function is only allowed if link_mode is \c auto_unlink.
-   //!
-   //! <b>Throws</b>: Nothing.
-   void unlink() BOOST_NOEXCEPT;
-   #endif
-};
-
-} //namespace intrusive
-} //namespace boost
-
-#include <boost/intrusive/detail/config_end.hpp>
-
-#endif //BOOST_INTRUSIVE_SET_HOOK_HPP
diff --git a/src/boost/intrusive/sgtree.hpp b/src/boost/intrusive/sgtree.hpp
deleted file mode 100644
index 9e687da1..00000000
--- a/src/boost/intrusive/sgtree.hpp
+++ /dev/null
@@ -1,1073 +0,0 @@
-/////////////////////////////////////////////////////////////////////////////
-//
-// (C) Copyright Ion Gaztanaga 2007-2014
-//
-// Distributed under the Boost 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/intrusive for documentation.
-//
-/////////////////////////////////////////////////////////////////////////////
-//
-// The option that yields to non-floating point 1/sqrt(2) alpha is taken
-// from the scapegoat tree implementation of the PSPP library.
-//
-/////////////////////////////////////////////////////////////////////////////
-
-#ifndef BOOST_INTRUSIVE_SGTREE_HPP
-#define BOOST_INTRUSIVE_SGTREE_HPP
-
-#include <boost/intrusive/detail/config_begin.hpp>
-#include <boost/intrusive/intrusive_fwd.hpp>
-#include <boost/intrusive/detail/assert.hpp>
-#include <boost/static_assert.hpp>
-#include <boost/intrusive/bs_set_hook.hpp>
-#include <boost/intrusive/bstree.hpp>
-#include <boost/intrusive/detail/tree_node.hpp>
-#include <boost/intrusive/pointer_traits.hpp>
-#include <boost/intrusive/detail/mpl.hpp>
-#include <boost/intrusive/detail/math.hpp>
-#include <boost/intrusive/detail/get_value_traits.hpp>
-#include <boost/intrusive/sgtree_algorithms.hpp>
-#include <boost/intrusive/detail/key_nodeptr_comp.hpp>
-#include <boost/intrusive/link_mode.hpp>
-
-#include <boost/move/utility_core.hpp>
-#include <boost/move/adl_move_swap.hpp>
-
-#include <cstddef>
-#include <boost/intrusive/detail/minimal_less_equal_header.hpp>
-#include <boost/intrusive/detail/minimal_pair_header.hpp>   //std::pair
-#include <cstddef>
-
-#if defined(BOOST_HAS_PRAGMA_ONCE)
-#  pragma once
-#endif
-
-namespace boost {
-namespace intrusive {
-
-/// @cond
-
-namespace detail{
-
-/////////////////////////////////////////////////////////////
-//
-//       Halpha for fixed floating_point<false> option
-//
-/////////////////////////////////////////////////////////////
-
-//! Returns floor(log2(n)/log2(sqrt(2))) -> floor(2*log2(n))
-//! Undefined if N is 0.
-//!
-//! This function does not use float point operations.
-inline std::size_t calculate_h_sqrt2 (std::size_t n)
-{
-   std::size_t f_log2 = detail::floor_log2(n);
-   return (2*f_log2) + static_cast<std::size_t>(n >= detail::sqrt2_pow_2xplus1(f_log2));
-}
-
-struct h_alpha_sqrt2_t
-{
-   h_alpha_sqrt2_t(void){}
-   std::size_t operator()(std::size_t n) const
-   {  return calculate_h_sqrt2(n);  }
-};
-
-struct alpha_0_75_by_max_size_t
-{
-   alpha_0_75_by_max_size_t(void){}
-
-   std::size_t operator()(std::size_t max_tree_size) const
-   {
-      const std::size_t max_tree_size_limit = ((~std::size_t(0))/std::size_t(3));
-      return max_tree_size > max_tree_size_limit ? max_tree_size/4*3 : max_tree_size*3/4;
-   }
-};
-
-/////////////////////////////////////////////////////////////
-//
-//       Halpha for fixed floating_point<true> option
-//
-/////////////////////////////////////////////////////////////
-
-struct h_alpha_t
-{
-   explicit h_alpha_t(float inv_minus_logalpha)
-      :  inv_minus_logalpha_(inv_minus_logalpha)
-   {}
-
-   std::size_t operator()(std::size_t n) const
-   {
-      ////////////////////////////////////////////////////////////
-      // This function must return "floor(log2(1/alpha(n)))" ->
-      //    floor(log2(n)/log(1/alpha)) ->
-      //    floor(log2(n)/-log2(alpha))
-      //    floor(log2(n)*(1/-log2(alpha)))
-      ////////////////////////////////////////////////////////////
-      return static_cast<std::size_t>(detail::fast_log2(float(n))*inv_minus_logalpha_);
-   }
-
-   private:
-   //Since the function will be repeatedly called
-   //precalculate constant data to avoid repeated
-   //calls to log and division.
-   //This will store 1/(-std::log2(alpha_))
-   float inv_minus_logalpha_;
-};
-
-struct alpha_by_max_size_t
-{
-   explicit alpha_by_max_size_t(float alpha)
-      :  alpha_(alpha)
-   {}
-
-   float operator()(std::size_t max_tree_size) const
-   {  return float(max_tree_size)*alpha_;   }
-
-   private:
-   float alpha_;
-};
-
-template<bool Activate, class SizeType>
-struct alpha_holder
-{
-   typedef boost::intrusive::detail::h_alpha_t           h_alpha_t;
-   typedef boost::intrusive::detail::alpha_by_max_size_t multiply_by_alpha_t;
-
-   alpha_holder()
-      : max_tree_size_()
-   {  set_alpha(0.70711f);   } // ~1/sqrt(2)
-
-   float get_alpha() const
-   {  return alpha_;  }
-
-   void set_alpha(float alpha)
-   {
-      alpha_ = alpha;
-      inv_minus_logalpha_ = 1/(-detail::fast_log2(alpha));
-   }
-
-   h_alpha_t get_h_alpha_t() const
-   {  return h_alpha_t(inv_minus_logalpha_);  }
-
-   multiply_by_alpha_t get_multiply_by_alpha_t() const
-   {  return multiply_by_alpha_t(alpha_);  }
-
-   SizeType &get_max_tree_size()
-   {  return max_tree_size_;  }
-
-   protected:
-   float alpha_;
-   float inv_minus_logalpha_;
-   SizeType max_tree_size_;
-};
-
-template<class SizeType>
-struct alpha_holder<false, SizeType>
-{
-   //This specialization uses alpha = 1/sqrt(2)
-   //without using floating point operations
-   //Downside: alpha CAN't be changed.
-   typedef boost::intrusive::detail::h_alpha_sqrt2_t           h_alpha_t;
-   typedef boost::intrusive::detail::alpha_0_75_by_max_size_t  multiply_by_alpha_t;
-
-   alpha_holder()
-      : max_tree_size_()
-   {}
-
-   float get_alpha() const
-   {  return 0.70710677f;  }
-
-   void set_alpha(float)
-   {  //alpha CAN't be changed.
-      BOOST_INTRUSIVE_INVARIANT_ASSERT(0);
-   }
-
-   h_alpha_t get_h_alpha_t() const
-   {  return h_alpha_t();  }
-
-   multiply_by_alpha_t get_multiply_by_alpha_t() const
-   {  return multiply_by_alpha_t();  }
-
-   SizeType &get_max_tree_size()
-   {  return max_tree_size_;  }
-
-   protected:
-   SizeType max_tree_size_;
-};
-
-}  //namespace detail{
-
-struct sgtree_defaults
-   : bstree_defaults
-{
-   static const bool floating_point = true;
-};
-
-/// @endcond
-
-//! The class template sgtree is an intrusive scapegoat tree container, that
-//! is used to construct intrusive sg_set and sg_multiset containers.
-//! The no-throw guarantee holds only, if the value_compare object
-//! doesn't throw.
-//!
-//! The template parameter \c T is the type to be managed by the container.
-//! The user can specify additional options and if no options are provided
-//! default options are used.
-//!
-//! The container supports the following options:
-//! \c base_hook<>/member_hook<>/value_traits<>,
-//! \c floating_point<>, \c size_type<> and
-//! \c compare<>.
-#if defined(BOOST_INTRUSIVE_DOXYGEN_INVOKED)
-template<class T, class ...Options>
-#else
-template<class ValueTraits, class VoidOrKeyOfValue, class VoidOrKeyComp, class SizeType, bool FloatingPoint, typename HeaderHolder>
-#endif
-class sgtree_impl
-   /// @cond
-   :  public bstree_impl<ValueTraits, VoidOrKeyOfValue, VoidOrKeyComp, SizeType, true, SgTreeAlgorithms, HeaderHolder>
-   ,  public detail::alpha_holder<FloatingPoint, SizeType>
-   /// @endcond
-{
-   public:
-   typedef ValueTraits                                               value_traits;
-   /// @cond
-   typedef bstree_impl< ValueTraits, VoidOrKeyOfValue, VoidOrKeyComp, SizeType
-                      , true, SgTreeAlgorithms, HeaderHolder>        tree_type;
-   typedef tree_type                                                 implementation_defined;
-
-   /// @endcond
-
-   typedef typename implementation_defined::pointer                  pointer;
-   typedef typename implementation_defined::const_pointer            const_pointer;
-   typedef typename implementation_defined::value_type               value_type;
-   typedef typename implementation_defined::key_type                 key_type;
-   typedef typename implementation_defined::key_of_value             key_of_value;
-   typedef typename implementation_defined::reference                reference;
-   typedef typename implementation_defined::const_reference          const_reference;
-   typedef typename implementation_defined::difference_type          difference_type;
-   typedef typename implementation_defined::size_type                size_type;
-   typedef typename implementation_defined::value_compare            value_compare;
-   typedef typename implementation_defined::key_compare              key_compare;
-   typedef typename implementation_defined::iterator                 iterator;
-   typedef typename implementation_defined::const_iterator           const_iterator;
-   typedef typename implementation_defined::reverse_iterator         reverse_iterator;
-   typedef typename implementation_defined::const_reverse_iterator   const_reverse_iterator;
-   typedef typename implementation_defined::node_traits              node_traits;
-   typedef typename implementation_defined::node                     node;
-   typedef typename implementation_defined::node_ptr                 node_ptr;
-   typedef typename implementation_defined::const_node_ptr           const_node_ptr;
-   typedef BOOST_INTRUSIVE_IMPDEF(sgtree_algorithms<node_traits>)    node_algorithms;
-
-   static const bool constant_time_size      = implementation_defined::constant_time_size;
-   static const bool floating_point          = FloatingPoint;
-   static const bool stateful_value_traits   = implementation_defined::stateful_value_traits;
-
-   /// @cond
-   private:
-
-   //noncopyable
-   typedef detail::alpha_holder<FloatingPoint, SizeType>    alpha_traits;
-   typedef typename alpha_traits::h_alpha_t                 h_alpha_t;
-   typedef typename alpha_traits::multiply_by_alpha_t       multiply_by_alpha_t;
-
-   BOOST_MOVABLE_BUT_NOT_COPYABLE(sgtree_impl)
-   BOOST_STATIC_ASSERT(((int)value_traits::link_mode != (int)auto_unlink));
-
-   enum { safemode_or_autounlink  =
-            (int)value_traits::link_mode == (int)auto_unlink   ||
-            (int)value_traits::link_mode == (int)safe_link     };
-
-   /// @endcond
-
-   public:
-
-   typedef BOOST_INTRUSIVE_IMPDEF(typename node_algorithms::insert_commit_data) insert_commit_data;
-
-   //! @copydoc ::boost::intrusive::bstree::bstree()
-   sgtree_impl()
-      :  tree_type()
-   {}
-
-   //! @copydoc ::boost::intrusive::bstree::bstree(const key_compare &,const value_traits &)
-   explicit sgtree_impl( const key_compare &cmp, const value_traits &v_traits = value_traits())
-      :  tree_type(cmp, v_traits)
-   {}
-
-   //! @copydoc ::boost::intrusive::bstree::bstree(bool,Iterator,Iterator,const key_compare &,const value_traits &)
-   template<class Iterator>
-   sgtree_impl( bool unique, Iterator b, Iterator e
-              , const key_compare &cmp     = key_compare()
-              , const value_traits &v_traits = value_traits())
-      : tree_type(cmp, v_traits)
-   {
-      if(unique)
-         this->insert_unique(b, e);
-      else
-         this->insert_equal(b, e);
-   }
-
-   //! @copydoc ::boost::intrusive::bstree::bstree(bstree &&)
-   sgtree_impl(BOOST_RV_REF(sgtree_impl) x)
-      :  tree_type(BOOST_MOVE_BASE(tree_type, x)), alpha_traits(x.get_alpha_traits())
-   {  ::boost::adl_move_swap(this->get_alpha_traits(), x.get_alpha_traits());   }
-
-   //! @copydoc ::boost::intrusive::bstree::operator=(bstree &&)
-   sgtree_impl& operator=(BOOST_RV_REF(sgtree_impl) x)
-   {
-      this->get_alpha_traits() = x.get_alpha_traits();
-      return static_cast<sgtree_impl&>(tree_type::operator=(BOOST_MOVE_BASE(tree_type, x)));
-   }
-
-   /// @cond
-   private:
-
-   const alpha_traits &get_alpha_traits() const
-   {  return *this;  }
-
-   alpha_traits &get_alpha_traits()
-   {  return *this;  }
-
-   h_alpha_t get_h_alpha_func() const
-   {  return this->get_alpha_traits().get_h_alpha_t();  }
-
-   multiply_by_alpha_t get_alpha_by_max_size_func() const
-   {  return this->get_alpha_traits().get_multiply_by_alpha_t(); }
-
-   /// @endcond
-
-   public:
-
-   #ifdef BOOST_INTRUSIVE_DOXYGEN_INVOKED
-   //! @copydoc ::boost::intrusive::bstree::~bstree()
-   ~sgtree_impl();
-
-   //! @copydoc ::boost::intrusive::bstree::begin()
-   iterator begin() BOOST_NOEXCEPT;
-
-   //! @copydoc ::boost::intrusive::bstree::begin()const
-   const_iterator begin() const BOOST_NOEXCEPT;
-
-   //! @copydoc ::boost::intrusive::bstree::cbegin()const
-   const_iterator cbegin() const BOOST_NOEXCEPT;
-
-   //! @copydoc ::boost::intrusive::bstree::end()
-   iterator end() BOOST_NOEXCEPT;
-
-   //! @copydoc ::boost::intrusive::bstree::end()const
-   const_iterator end() const BOOST_NOEXCEPT;
-
-   //! @copydoc ::boost::intrusive::bstree::cend()const
-   const_iterator cend() const BOOST_NOEXCEPT;
-
-   //! @copydoc ::boost::intrusive::bstree::rbegin()
-   reverse_iterator rbegin() BOOST_NOEXCEPT;
-
-   //! @copydoc ::boost::intrusive::bstree::rbegin()const
-   const_reverse_iterator rbegin() const BOOST_NOEXCEPT;
-
-   //! @copydoc ::boost::intrusive::bstree::crbegin()const
-   const_reverse_iterator crbegin() const BOOST_NOEXCEPT;
-
-   //! @copydoc ::boost::intrusive::bstree::rend()
-   reverse_iterator rend() BOOST_NOEXCEPT;
-
-   //! @copydoc ::boost::intrusive::bstree::rend()const
-   const_reverse_iterator rend() const BOOST_NOEXCEPT;
-
-   //! @copydoc ::boost::intrusive::bstree::crend()const
-   const_reverse_iterator crend() const BOOST_NOEXCEPT;
-
-   //! @copydoc ::boost::intrusive::bstree::root()
-   iterator root() BOOST_NOEXCEPT;
-
-   //! @copydoc ::boost::intrusive::bstree::root()const
-   const_iterator root() const BOOST_NOEXCEPT;
-
-   //! @copydoc ::boost::intrusive::bstree::croot()const
-   const_iterator croot() const BOOST_NOEXCEPT;
-
-   //! @copydoc ::boost::intrusive::bstree::container_from_end_iterator(iterator)
-   static sgtree_impl &container_from_end_iterator(iterator end_iterator) BOOST_NOEXCEPT;
-
-   //! @copydoc ::boost::intrusive::bstree::container_from_end_iterator(const_iterator)
-   static const sgtree_impl &container_from_end_iterator(const_iterator end_iterator) BOOST_NOEXCEPT;
-
-   //! @copydoc ::boost::intrusive::bstree::container_from_iterator(iterator)
-   static sgtree_impl &container_from_iterator(iterator it) BOOST_NOEXCEPT;
-
-   //! @copydoc ::boost::intrusive::bstree::container_from_iterator(const_iterator)
-   static const sgtree_impl &container_from_iterator(const_iterator it) BOOST_NOEXCEPT;
-
-   //! @copydoc ::boost::intrusive::bstree::key_comp()const
-   key_compare key_comp() const;
-
-   //! @copydoc ::boost::intrusive::bstree::value_comp()const
-   value_compare value_comp() const;
-
-   //! @copydoc ::boost::intrusive::bstree::empty()const
-   bool empty() const BOOST_NOEXCEPT;
-
-   //! @copydoc ::boost::intrusive::bstree::size()const
-   size_type size() const BOOST_NOEXCEPT;
-
-   #endif   //#ifdef BOOST_INTRUSIVE_DOXYGEN_INVOKED
-
-   //! @copydoc ::boost::intrusive::bstree::swap
-   void swap(sgtree_impl& other)
-   {
-      //This can throw
-      this->tree_type::swap(static_cast<tree_type&>(other));
-      ::boost::adl_move_swap(this->get_alpha_traits(), other.get_alpha_traits());
-   }
-
-   //! @copydoc ::boost::intrusive::bstree::clone_from(const bstree&,Cloner,Disposer)
-   //! Additional notes: it also copies the alpha factor from the source container.
-   template <class Cloner, class Disposer>
-   void clone_from(const sgtree_impl &src, Cloner cloner, Disposer disposer)
-   {
-      tree_type::clone_from(src, cloner, disposer);
-      this->get_alpha_traits() = src.get_alpha_traits();
-   }
-
-   //! @copydoc ::boost::intrusive::bstree::clone_from(bstree&&,Cloner,Disposer)
-   //! Additional notes: it also copies the alpha factor from the source container.
-   template <class Cloner, class Disposer>
-   void clone_from(BOOST_RV_REF(sgtree_impl) src, Cloner cloner, Disposer disposer)
-   {
-      tree_type::clone_from(BOOST_MOVE_BASE(tree_type, src), cloner, disposer);
-      this->get_alpha_traits() = ::boost::move(src.get_alpha_traits());
-   }
-
-   //! @copydoc ::boost::intrusive::bstree::insert_equal(reference)
-   iterator insert_equal(reference value)
-   {
-      node_ptr to_insert(this->get_value_traits().to_node_ptr(value));
-      BOOST_INTRUSIVE_SAFE_HOOK_DEFAULT_ASSERT(!safemode_or_autounlink || node_algorithms::unique(to_insert));
-      std::size_t max_tree_size = (std::size_t)this->max_tree_size_;
-      node_ptr p = node_algorithms::insert_equal_upper_bound
-         (this->tree_type::header_ptr(), to_insert, this->key_node_comp(this->key_comp())
-         , (size_type)this->size(), this->get_h_alpha_func(), max_tree_size);
-      this->tree_type::sz_traits().increment();
-      this->max_tree_size_ = (size_type)max_tree_size;
-      return iterator(p, this->priv_value_traits_ptr());
-   }
-
-   //! @copydoc ::boost::intrusive::bstree::insert_equal(const_iterator,reference)
-   iterator insert_equal(const_iterator hint, reference value)
-   {
-      node_ptr to_insert(this->get_value_traits().to_node_ptr(value));
-      BOOST_INTRUSIVE_SAFE_HOOK_DEFAULT_ASSERT(!safemode_or_autounlink || node_algorithms::unique(to_insert));
-      std::size_t max_tree_size = (std::size_t)this->max_tree_size_;
-      node_ptr p = node_algorithms::insert_equal
-         ( this->tree_type::header_ptr(), hint.pointed_node(), to_insert, this->key_node_comp(this->key_comp())
-         , (std::size_t)this->size(), this->get_h_alpha_func(), max_tree_size);
-      this->tree_type::sz_traits().increment();
-      this->max_tree_size_ = (size_type)max_tree_size;
-      return iterator(p, this->priv_value_traits_ptr());
-   }
-
-   //! @copydoc ::boost::intrusive::bstree::insert_equal(Iterator,Iterator)
-   template<class Iterator>
-   void insert_equal(Iterator b, Iterator e)
-   {
-      iterator iend(this->end());
-      for (; b != e; ++b)
-         this->insert_equal(iend, *b);
-   }
-
-   //! @copydoc ::boost::intrusive::bstree::insert_unique(reference)
-   std::pair<iterator, bool> insert_unique(reference value)
-   {
-      insert_commit_data commit_data;
-      std::pair<iterator, bool> ret = this->insert_unique_check
-         (key_of_value()(value), this->key_comp(), commit_data);
-      if(!ret.second)
-         return ret;
-      return std::pair<iterator, bool> (this->insert_unique_commit(value, commit_data), true);
-   }
-
-   //! @copydoc ::boost::intrusive::bstree::insert_unique(const_iterator,reference)
-   iterator insert_unique(const_iterator hint, reference value)
-   {
-      insert_commit_data commit_data;
-      std::pair<iterator, bool> ret = this->insert_unique_check
-         (hint, key_of_value()(value), this->key_comp(), commit_data);
-      if(!ret.second)
-         return ret.first;
-      return this->insert_unique_commit(value, commit_data);
-   }
-
-   //! @copydoc ::boost::intrusive::bstree::insert_unique_check(const KeyType&,KeyTypeKeyCompare,insert_commit_data&)
-   template<class KeyType, class KeyTypeKeyCompare>
-   BOOST_INTRUSIVE_DOC1ST(std::pair<iterator BOOST_INTRUSIVE_I bool>
-      , typename detail::disable_if_convertible
-         <KeyType BOOST_INTRUSIVE_I const_iterator BOOST_INTRUSIVE_I 
-         std::pair<iterator BOOST_INTRUSIVE_I bool> >::type)
-      insert_unique_check
-      (const KeyType &key, KeyTypeKeyCompare comp, insert_commit_data &commit_data)
-   {
-      std::pair<node_ptr, bool> ret =
-         node_algorithms::insert_unique_check
-            (this->tree_type::header_ptr(), key, this->key_node_comp(comp), commit_data);
-      return std::pair<iterator, bool>(iterator(ret.first, this->priv_value_traits_ptr()), ret.second);
-   }
-
-   //! @copydoc ::boost::intrusive::bstree::insert_unique_check(const_iterator,const KeyType&,KeyTypeKeyCompare,insert_commit_data&)
-   template<class KeyType, class KeyTypeKeyCompare>
-   std::pair<iterator, bool> insert_unique_check
-      (const_iterator hint, const KeyType &key
-      ,KeyTypeKeyCompare comp, insert_commit_data &commit_data)
-   {
-      std::pair<node_ptr, bool> ret =
-         node_algorithms::insert_unique_check
-            (this->tree_type::header_ptr(), hint.pointed_node(), key, this->key_node_comp(comp), commit_data);
-      return std::pair<iterator, bool>(iterator(ret.first, this->priv_value_traits_ptr()), ret.second);
-   }
-
-   //! @copydoc ::boost::intrusive::bstree::insert_unique_check(const key_type&,insert_commit_data&)
-   std::pair<iterator, bool> insert_unique_check
-      (const key_type &key, insert_commit_data &commit_data)
-   {  return this->insert_unique_check(key, this->key_comp(), commit_data);   }
-
-   //! @copydoc ::boost::intrusive::bstree::insert_unique_check(const_iterator,const key_type&,insert_commit_data&)
-   std::pair<iterator, bool> insert_unique_check
-      (const_iterator hint, const key_type &key, insert_commit_data &commit_data)
-   {  return this->insert_unique_check(hint, key, this->key_comp(), commit_data);   }
-
-   //! @copydoc ::boost::intrusive::bstree::insert_unique_commit
-   iterator insert_unique_commit(reference value, const insert_commit_data &commit_data) BOOST_NOEXCEPT
-   {
-      node_ptr to_insert(this->get_value_traits().to_node_ptr(value));
-      BOOST_INTRUSIVE_SAFE_HOOK_DEFAULT_ASSERT(!safemode_or_autounlink || node_algorithms::unique(to_insert));
-      std::size_t max_tree_size = (std::size_t)this->max_tree_size_;
-      node_algorithms::insert_unique_commit
-         ( this->tree_type::header_ptr(), to_insert, commit_data
-         , (std::size_t)this->size(), this->get_h_alpha_func(), max_tree_size);
-      this->tree_type::sz_traits().increment();
-      this->max_tree_size_ = (size_type)max_tree_size;
-      return iterator(to_insert, this->priv_value_traits_ptr());
-   }
-
-   //! @copydoc ::boost::intrusive::bstree::insert_unique(Iterator,Iterator)
-   template<class Iterator>
-   void insert_unique(Iterator b, Iterator e)
-   {
-      if(this->empty()){
-         iterator iend(this->end());
-         for (; b != e; ++b)
-            this->insert_unique(iend, *b);
-      }
-      else{
-         for (; b != e; ++b)
-            this->insert_unique(*b);
-      }
-   }
-
-   //! @copydoc ::boost::intrusive::bstree::insert_before
-   iterator insert_before(const_iterator pos, reference value) BOOST_NOEXCEPT
-   {
-      node_ptr to_insert(this->get_value_traits().to_node_ptr(value));
-      BOOST_INTRUSIVE_SAFE_HOOK_DEFAULT_ASSERT(!safemode_or_autounlink || node_algorithms::unique(to_insert));
-      std::size_t max_tree_size = (std::size_t)this->max_tree_size_;
-      node_ptr p = node_algorithms::insert_before
-         ( this->tree_type::header_ptr(), pos.pointed_node(), to_insert
-         , (size_type)this->size(), this->get_h_alpha_func(), max_tree_size);
-      this->tree_type::sz_traits().increment();
-      this->max_tree_size_ = (size_type)max_tree_size;
-      return iterator(p, this->priv_value_traits_ptr());
-   }
-
-   //! @copydoc ::boost::intrusive::bstree::push_back
-   void push_back(reference value) BOOST_NOEXCEPT
-   {
-      node_ptr to_insert(this->get_value_traits().to_node_ptr(value));
-      BOOST_INTRUSIVE_SAFE_HOOK_DEFAULT_ASSERT(!safemode_or_autounlink || node_algorithms::unique(to_insert));
-      std::size_t max_tree_size = (std::size_t)this->max_tree_size_;
-      node_algorithms::push_back
-         ( this->tree_type::header_ptr(), to_insert
-         , (size_type)this->size(), this->get_h_alpha_func(), max_tree_size);
-      this->tree_type::sz_traits().increment();
-      this->max_tree_size_ = (size_type)max_tree_size;
-   }
-
-   //! @copydoc ::boost::intrusive::bstree::push_front
-   void push_front(reference value) BOOST_NOEXCEPT
-   {
-      node_ptr to_insert(this->get_value_traits().to_node_ptr(value));
-      BOOST_INTRUSIVE_SAFE_HOOK_DEFAULT_ASSERT(!safemode_or_autounlink || node_algorithms::unique(to_insert));
-      std::size_t max_tree_size = (std::size_t)this->max_tree_size_;
-      node_algorithms::push_front
-         ( this->tree_type::header_ptr(), to_insert
-         , (size_type)this->size(), this->get_h_alpha_func(), max_tree_size);
-      this->tree_type::sz_traits().increment();
-      this->max_tree_size_ = (size_type)max_tree_size;
-   }
-
-
-   //! @copydoc ::boost::intrusive::bstree::erase(const_iterator)
-   iterator erase(const_iterator i) BOOST_NOEXCEPT
-   {
-      const_iterator ret(i);
-      ++ret;
-      node_ptr to_erase(i.pointed_node());
-      BOOST_INTRUSIVE_SAFE_HOOK_DEFAULT_ASSERT(!safemode_or_autounlink || !node_algorithms::unique(to_erase));
-      std::size_t max_tree_size = this->max_tree_size_;
-      node_algorithms::erase
-         ( this->tree_type::header_ptr(), to_erase, (std::size_t)this->size()
-         , max_tree_size, this->get_alpha_by_max_size_func());
-      this->max_tree_size_ = (size_type)max_tree_size;
-      this->tree_type::sz_traits().decrement();
-      BOOST_IF_CONSTEXPR(safemode_or_autounlink)
-         node_algorithms::init(to_erase);
-      return ret.unconst();
-   }
-
-   //! @copydoc ::boost::intrusive::bstree::erase(const_iterator,const_iterator)
-   iterator erase(const_iterator b, const_iterator e) BOOST_NOEXCEPT
-   {  size_type n;   return private_erase(b, e, n);   }
-
-   //! @copydoc ::boost::intrusive::bstree::erase(const key_type &)
-   size_type erase(const key_type &key)
-   {  return this->erase(key, this->key_comp());   }
-
-   //! @copydoc ::boost::intrusive::bstree::erase(const KeyType&,KeyTypeKeyCompare)
-   template<class KeyType, class KeyTypeKeyCompare>
-   BOOST_INTRUSIVE_DOC1ST(size_type
-      , typename detail::disable_if_convertible<KeyTypeKeyCompare BOOST_INTRUSIVE_I const_iterator BOOST_INTRUSIVE_I size_type>::type)
-      erase(const KeyType& key, KeyTypeKeyCompare comp)
-   {
-      std::pair<iterator,iterator> p = this->equal_range(key, comp);
-      size_type n;
-      private_erase(p.first, p.second, n);
-      return n;
-   }
-
-   //! @copydoc ::boost::intrusive::bstree::erase_and_dispose(const_iterator,Disposer)
-   template<class Disposer>
-   iterator erase_and_dispose(const_iterator i, Disposer disposer) BOOST_NOEXCEPT
-   {
-      node_ptr to_erase(i.pointed_node());
-      iterator ret(this->erase(i));
-      disposer(this->get_value_traits().to_value_ptr(to_erase));
-      return ret;
-   }
-
-   #if !defined(BOOST_INTRUSIVE_DOXYGEN_INVOKED)
-   template<class Disposer>
-   iterator erase_and_dispose(iterator i, Disposer disposer) BOOST_NOEXCEPT
-   {  return this->erase_and_dispose(const_iterator(i), disposer);   }
-   #endif
-
-   //! @copydoc ::boost::intrusive::bstree::erase_and_dispose(const_iterator,const_iterator,Disposer)
-   template<class Disposer>
-   iterator erase_and_dispose(const_iterator b, const_iterator e, Disposer disposer) BOOST_NOEXCEPT
-   {  size_type n;   return private_erase(b, e, n, disposer);   }
-
-   //! @copydoc ::boost::intrusive::bstree::erase_and_dispose(const key_type &, Disposer)
-   template<class Disposer>
-   size_type erase_and_dispose(const key_type &key, Disposer disposer)
-   {
-      std::pair<iterator,iterator> p = this->equal_range(key);
-      size_type n;
-      private_erase(p.first, p.second, n, disposer);
-      return n;
-   }
-
-   //! @copydoc ::boost::intrusive::bstree::erase_and_dispose(const KeyType&,KeyTypeKeyCompare,Disposer)
-   template<class KeyType, class KeyTypeKeyCompare, class Disposer>
-   BOOST_INTRUSIVE_DOC1ST(size_type
-      , typename detail::disable_if_convertible<KeyTypeKeyCompare BOOST_INTRUSIVE_I const_iterator BOOST_INTRUSIVE_I size_type>::type)
-      erase_and_dispose(const KeyType& key, KeyTypeKeyCompare comp, Disposer disposer)
-   {
-      std::pair<iterator,iterator> p = this->equal_range(key, comp);
-      size_type n;
-      private_erase(p.first, p.second, n, disposer);
-      return n;
-   }
-
-   //! @copydoc ::boost::intrusive::bstree::clear
-   void clear() BOOST_NOEXCEPT
-   {
-      tree_type::clear();
-      this->max_tree_size_ = 0;
-   }
-
-   //! @copydoc ::boost::intrusive::bstree::clear_and_dispose
-   template<class Disposer>
-   void clear_and_dispose(Disposer disposer) BOOST_NOEXCEPT
-   {
-      tree_type::clear_and_dispose(disposer);
-      this->max_tree_size_ = 0;
-   }
-
-   #if defined(BOOST_INTRUSIVE_DOXYGEN_INVOKED)
-   //! @copydoc ::boost::intrusive::bstree::merge_unique
-   template<class T, class ...Options2> void merge_unique(sgtree<T, Options2...> &);
-   #else
-   template<class Compare2>
-   void merge_unique(sgtree_impl
-      <ValueTraits, VoidOrKeyOfValue, Compare2, SizeType, FloatingPoint, HeaderHolder> &source)
-   #endif
-   {
-      node_ptr it   (node_algorithms::begin_node(source.header_ptr()))
-             , itend(node_algorithms::end_node  (source.header_ptr()));
-
-      while(it != itend){
-         node_ptr const p(it);
-         BOOST_INTRUSIVE_SAFE_HOOK_DEFAULT_ASSERT(!safemode_or_autounlink || !node_algorithms::unique(p));
-         it = node_algorithms::next_node(it);
-
-         std::size_t max_tree1_size = this->max_tree_size_;
-         std::size_t max_tree2_size = source.get_max_tree_size();
-         if( node_algorithms::transfer_unique
-               ( this->header_ptr(), this->key_node_comp(this->key_comp()), this->size(), max_tree1_size
-               , source.header_ptr(), p, source.size(), max_tree2_size
-               , this->get_h_alpha_func(), this->get_alpha_by_max_size_func()) ){
-            this->max_tree_size_  = (size_type)max_tree1_size;
-            this->sz_traits().increment();
-            source.get_max_tree_size() = (size_type)max_tree2_size;
-            source.sz_traits().decrement();
-         }
-      }
-   }
-
-   #if defined(BOOST_INTRUSIVE_DOXYGEN_INVOKED)
-   //! @copydoc ::boost::intrusive::bstree::merge_equal
-   template<class T, class ...Options2> void merge_equal(sgtree<T, Options2...> &);
-   #else
-   template<class Compare2>
-   void merge_equal(sgtree_impl
-      <ValueTraits, VoidOrKeyOfValue, Compare2, SizeType, FloatingPoint, HeaderHolder> &source)
-   #endif
-   {
-      node_ptr it   (node_algorithms::begin_node(source.header_ptr()))
-             , itend(node_algorithms::end_node  (source.header_ptr()));
-
-      while(it != itend){
-         node_ptr const p(it);
-         BOOST_INTRUSIVE_SAFE_HOOK_DEFAULT_ASSERT(!safemode_or_autounlink || !node_algorithms::unique(p));
-         it = node_algorithms::next_node(it);
-         std::size_t max_tree1_size = this->max_tree_size_;
-         std::size_t max_tree2_size = source.get_max_tree_size();
-         node_algorithms::transfer_equal
-            ( this->header_ptr(), this->key_node_comp(this->key_comp()), this->size(), max_tree1_size
-            , source.header_ptr(), p, source.size(), max_tree2_size
-            , this->get_h_alpha_func(), this->get_alpha_by_max_size_func());
-         this->max_tree_size_  = (size_type)max_tree1_size;
-         this->sz_traits().increment();
-         source.get_max_tree_size() = (size_type)max_tree2_size;
-         source.sz_traits().decrement();
-      }
-   }
-
-   #ifdef BOOST_INTRUSIVE_DOXYGEN_INVOKED
-   //! @copydoc ::boost::intrusive::bstree::count(const key_type &)const
-   size_type count(const key_type &key) const;
-
-   //! @copydoc ::boost::intrusive::bstree::count(const KeyType&,KeyTypeKeyCompare)const
-   template<class KeyType, class KeyTypeKeyCompare>
-   size_type count(const KeyType& key, KeyTypeKeyCompare comp) const;
-
-   //! @copydoc ::boost::intrusive::bstree::lower_bound(const key_type &)
-   iterator lower_bound(const key_type &key);
-
-   //! @copydoc ::boost::intrusive::bstree::lower_bound(const KeyType&,KeyTypeKeyCompare)
-   template<class KeyType, class KeyTypeKeyCompare>
-   iterator lower_bound(const KeyType& key, KeyTypeKeyCompare comp);
-
-   //! @copydoc ::boost::intrusive::bstree::lower_bound(const key_type &)const
-   const_iterator lower_bound(const key_type &key) const;
-
-   //! @copydoc ::boost::intrusive::bstree::lower_bound(const KeyType&,KeyTypeKeyCompare)const
-   template<class KeyType, class KeyTypeKeyCompare>
-   const_iterator lower_bound(const KeyType& key, KeyTypeKeyCompare comp) const;
-
-   //! @copydoc ::boost::intrusive::bstree::upper_bound(const key_type &)
-   iterator upper_bound(const key_type &key);
-
-   //! @copydoc ::boost::intrusive::bstree::upper_bound(const KeyType&,KeyTypeKeyCompare)
-   template<class KeyType, class KeyTypeKeyCompare>
-   iterator upper_bound(const KeyType& key, KeyTypeKeyCompare comp);
-
-   //! @copydoc ::boost::intrusive::bstree::upper_bound(const key_type &)const
-   const_iterator upper_bound(const key_type &key) const;
-
-   //! @copydoc ::boost::intrusive::bstree::upper_bound(const KeyType&,KeyTypeKeyCompare)const
-   template<class KeyType, class KeyTypeKeyCompare>
-   const_iterator upper_bound(const KeyType& key, KeyTypeKeyCompare comp) const;
-
-   //! @copydoc ::boost::intrusive::bstree::find(const key_type &)
-   iterator find(const key_type &key);
-
-   //! @copydoc ::boost::intrusive::bstree::find(const KeyType&,KeyTypeKeyCompare)
-   template<class KeyType, class KeyTypeKeyCompare>
-   iterator find(const KeyType& key, KeyTypeKeyCompare comp);
-
-   //! @copydoc ::boost::intrusive::bstree::find(const key_type &)const
-   const_iterator find(const key_type &key) const;
-
-   //! @copydoc ::boost::intrusive::bstree::find(const KeyType&,KeyTypeKeyCompare)const
-   template<class KeyType, class KeyTypeKeyCompare>
-   const_iterator find(const KeyType& key, KeyTypeKeyCompare comp) const;
-
-   //! @copydoc ::boost::intrusive::bstree::equal_range(const key_type &)
-   std::pair<iterator,iterator> equal_range(const key_type &key);
-
-   //! @copydoc ::boost::intrusive::bstree::equal_range(const KeyType&,KeyTypeKeyCompare)
-   template<class KeyType, class KeyTypeKeyCompare>
-   std::pair<iterator,iterator> equal_range(const KeyType& key, KeyTypeKeyCompare comp);
-
-   //! @copydoc ::boost::intrusive::bstree::equal_range(const key_type &)const
-   std::pair<const_iterator, const_iterator>
-      equal_range(const key_type &key) const;
-
-   //! @copydoc ::boost::intrusive::bstree::equal_range(const KeyType&,KeyTypeKeyCompare)const
-   template<class KeyType, class KeyTypeKeyCompare>
-   std::pair<const_iterator, const_iterator>
-      equal_range(const KeyType& key, KeyTypeKeyCompare comp) const;
-
-   //! @copydoc ::boost::intrusive::bstree::bounded_range(const key_type &,const key_type &,bool,bool)
-   std::pair<iterator,iterator> bounded_range
-      (const key_type &lower_key, const key_type &upper_key, bool left_closed, bool right_closed);
-
-   //! @copydoc ::boost::intrusive::bstree::bounded_range(const KeyType&,const KeyType&,KeyTypeKeyCompare,bool,bool)
-   template<class KeyType, class KeyTypeKeyCompare>
-   std::pair<iterator,iterator> bounded_range
-      (const KeyType& lower_key, const KeyType& upper_key, KeyTypeKeyCompare comp, bool left_closed, bool right_closed);
-
-   //! @copydoc ::boost::intrusive::bstree::bounded_range(const key_type &,const key_type &,bool,bool)const
-   std::pair<const_iterator, const_iterator>
-      bounded_range(const key_type &lower_key, const key_type &upper_key, bool left_closed, bool right_closed) const;
-
-   //! @copydoc ::boost::intrusive::bstree::bounded_range(const KeyType&,const KeyType&,KeyTypeKeyCompare,bool,bool)const
-   template<class KeyType, class KeyTypeKeyCompare>
-   std::pair<const_iterator, const_iterator> bounded_range
-         (const KeyType& lower_key, const KeyType& upper_key, KeyTypeKeyCompare comp, bool left_closed, bool right_closed) const;
-
-   //! @copydoc ::boost::intrusive::bstree::s_iterator_to(reference)
-   static iterator s_iterator_to(reference value) BOOST_NOEXCEPT;
-
-   //! @copydoc ::boost::intrusive::bstree::s_iterator_to(const_reference)
-   static const_iterator s_iterator_to(const_reference value) BOOST_NOEXCEPT;
-
-   //! @copydoc ::boost::intrusive::bstree::iterator_to(reference)
-   iterator iterator_to(reference value) BOOST_NOEXCEPT;
-
-   //! @copydoc ::boost::intrusive::bstree::iterator_to(const_reference)const
-   const_iterator iterator_to(const_reference value) const BOOST_NOEXCEPT;
-
-   //! @copydoc ::boost::intrusive::bstree::init_node(reference)
-   static void init_node(reference value) BOOST_NOEXCEPT;
-
-   //! @copydoc ::boost::intrusive::bstree::unlink_leftmost_without_rebalance
-   pointer unlink_leftmost_without_rebalance() BOOST_NOEXCEPT;
-
-   //! @copydoc ::boost::intrusive::bstree::replace_node
-   void replace_node(iterator replace_this, reference with_this) BOOST_NOEXCEPT;
-
-   //! @copydoc ::boost::intrusive::bstree::remove_node
-   void remove_node(reference value) BOOST_NOEXCEPT;
-
-   //! @copydoc ::boost::intrusive::bstree::rebalance
-   void rebalance() BOOST_NOEXCEPT;
-
-   //! @copydoc ::boost::intrusive::bstree::rebalance_subtree
-   iterator rebalance_subtree(iterator root) BOOST_NOEXCEPT;
-
-   friend bool operator< (const sgtree_impl &x, const sgtree_impl &y);
-
-   friend bool operator==(const sgtree_impl &x, const sgtree_impl &y);
-
-   friend bool operator!= (const sgtree_impl &x, const sgtree_impl &y);
-
-   friend bool operator>(const sgtree_impl &x, const sgtree_impl &y);
-
-   friend bool operator<=(const sgtree_impl &x, const sgtree_impl &y);
-
-   friend bool operator>=(const sgtree_impl &x, const sgtree_impl &y);
-
-   friend void swap(sgtree_impl &x, sgtree_impl &y);
-
-   #endif   //#ifdef BOOST_INTRUSIVE_DOXYGEN_INVOKED
-
-   //! <b>Returns</b>: The balance factor (alpha) used in this tree
-   //!
-   //! <b>Throws</b>: Nothing.
-   //!
-   //! <b>Complexity</b>: Constant.
-   float balance_factor() const BOOST_NOEXCEPT
-   {  return this->get_alpha_traits().get_alpha(); }
-
-   //! <b>Requires</b>: new_alpha must be a value between 0.5 and 1.0
-   //!
-   //! <b>Effects</b>: Establishes a new balance factor (alpha) and rebalances
-   //!   the tree if the new balance factor is stricter (less) than the old factor.
-   //!
-   //! <b>Throws</b>: Nothing.
-   //!
-   //! <b>Complexity</b>: Linear to the elements in the subtree.
-   void balance_factor(float new_alpha) BOOST_NOEXCEPT
-   {
-      //The alpha factor CAN't be changed if the fixed, floating operation-less
-      //1/sqrt(2) alpha factor option is activated
-      BOOST_STATIC_ASSERT((floating_point));
-      BOOST_INTRUSIVE_INVARIANT_ASSERT((new_alpha > 0.5f && new_alpha < 1.0f));
-      if(new_alpha >= 0.5f && new_alpha < 1.0f){
-         float old_alpha = this->get_alpha_traits().get_alpha();
-         this->get_alpha_traits().set_alpha(new_alpha);
-         if(new_alpha < old_alpha){
-            this->max_tree_size_ = this->size();
-            this->rebalance();
-         }
-      }
-   }
-
-   /// @cond
-   private:
-   template<class Disposer>
-   iterator private_erase(const_iterator b, const_iterator e, size_type &n, Disposer disposer) BOOST_NOEXCEPT
-   {
-      for(n = 0; b != e; ++n)
-        this->erase_and_dispose(b++, disposer);
-      return b.unconst();
-   }
-
-   iterator private_erase(const_iterator b, const_iterator e, size_type &n) BOOST_NOEXCEPT
-   {
-      for(n = 0; b != e; ++n)
-        this->erase(b++);
-      return b.unconst();
-   }
-   /// @endcond
-};
-
-
-//! Helper metafunction to define a \c sgtree that yields to the same type when the
-//! same options (either explicitly or implicitly) are used.
-#if defined(BOOST_INTRUSIVE_DOXYGEN_INVOKED) || defined(BOOST_INTRUSIVE_VARIADIC_TEMPLATES)
-template<class T, class ...Options>
-#else
-template<class T, class O1 = void, class O2 = void
-                , class O3 = void, class O4 = void
-                , class O5 = void, class O6 = void>
-#endif
-struct make_sgtree
-{
-   /// @cond
-   typedef typename pack_options
-      < sgtree_defaults,
-      #if !defined(BOOST_INTRUSIVE_VARIADIC_TEMPLATES)
-      O1, O2, O3, O4, O5, O6
-      #else
-      Options...
-      #endif
-      >::type packed_options;
-
-   typedef typename detail::get_value_traits
-      <T, typename packed_options::proto_value_traits>::type value_traits;
-
-   typedef sgtree_impl
-         < value_traits
-         , typename packed_options::key_of_value
-         , typename packed_options::compare
-         , typename packed_options::size_type
-         , packed_options::floating_point
-         , typename packed_options::header_holder_type
-         > implementation_defined;
-   /// @endcond
-   typedef implementation_defined type;
-};
-
-
-#ifndef BOOST_INTRUSIVE_DOXYGEN_INVOKED
-
-#if !defined(BOOST_INTRUSIVE_VARIADIC_TEMPLATES)
-template<class T, class O1, class O2, class O3, class O4, class O5, class O6>
-#else
-template<class T, class ...Options>
-#endif
-class sgtree
-   :  public make_sgtree<T,
-      #if !defined(BOOST_INTRUSIVE_VARIADIC_TEMPLATES)
-      O1, O2, O3, O4, O5, O6
-      #else
-      Options...
-      #endif
-      >::type
-{
-   typedef typename make_sgtree
-      <T,
-      #if !defined(BOOST_INTRUSIVE_VARIADIC_TEMPLATES)
-      O1, O2, O3, O4, O5, O6
-      #else
-      Options...
-      #endif
-      >::type   Base;
-   BOOST_MOVABLE_BUT_NOT_COPYABLE(sgtree)
-
-   public:
-   typedef typename Base::key_compare        key_compare;
-   typedef typename Base::value_traits       value_traits;
-   typedef typename Base::iterator           iterator;
-   typedef typename Base::const_iterator     const_iterator;
-   typedef typename Base::reverse_iterator           reverse_iterator;
-   typedef typename Base::const_reverse_iterator     const_reverse_iterator;
-
-   //Assert if passed value traits are compatible with the type
-   BOOST_STATIC_ASSERT((detail::is_same<typename value_traits::value_type, T>::value));
-
-   BOOST_INTRUSIVE_FORCEINLINE sgtree()
-      :  Base()
-   {}
-
-   BOOST_INTRUSIVE_FORCEINLINE explicit sgtree(const key_compare &cmp, const value_traits &v_traits = value_traits())
-      :  Base(cmp, v_traits)
-   {}
-
-   template<class Iterator>
-   BOOST_INTRUSIVE_FORCEINLINE sgtree( bool unique, Iterator b, Iterator e
-         , const key_compare &cmp = key_compare()
-         , const value_traits &v_traits = value_traits())
-      :  Base(unique, b, e, cmp, v_traits)
-   {}
-
-   BOOST_INTRUSIVE_FORCEINLINE sgtree(BOOST_RV_REF(sgtree) x)
-      :  Base(BOOST_MOVE_BASE(Base, x))
-   {}
-
-   BOOST_INTRUSIVE_FORCEINLINE sgtree& operator=(BOOST_RV_REF(sgtree) x)
-   {  return static_cast<sgtree &>(this->Base::operator=(BOOST_MOVE_BASE(Base, x)));  }
-
-   template <class Cloner, class Disposer>
-   BOOST_INTRUSIVE_FORCEINLINE void clone_from(const sgtree &src, Cloner cloner, Disposer disposer)
-   {  Base::clone_from(src, cloner, disposer);  }
-
-   template <class Cloner, class Disposer>
-   BOOST_INTRUSIVE_FORCEINLINE void clone_from(BOOST_RV_REF(sgtree) src, Cloner cloner, Disposer disposer)
-   {  Base::clone_from(BOOST_MOVE_BASE(Base, src), cloner, disposer);  }
-
-   BOOST_INTRUSIVE_FORCEINLINE static sgtree &container_from_end_iterator(iterator end_iterator) BOOST_NOEXCEPT
-   {  return static_cast<sgtree &>(Base::container_from_end_iterator(end_iterator));   }
-
-   BOOST_INTRUSIVE_FORCEINLINE static const sgtree &container_from_end_iterator(const_iterator end_iterator) BOOST_NOEXCEPT
-   {  return static_cast<const sgtree &>(Base::container_from_end_iterator(end_iterator));   }
-
-   BOOST_INTRUSIVE_FORCEINLINE static sgtree &container_from_iterator(iterator it) BOOST_NOEXCEPT
-   {  return static_cast<sgtree &>(Base::container_from_iterator(it));   }
-
-   BOOST_INTRUSIVE_FORCEINLINE static const sgtree &container_from_iterator(const_iterator it) BOOST_NOEXCEPT
-   {  return static_cast<const sgtree &>(Base::container_from_iterator(it));   }
-};
-
-#endif
-
-} //namespace intrusive
-} //namespace boost
-
-#include <boost/intrusive/detail/config_end.hpp>
-
-#endif //BOOST_INTRUSIVE_SGTREE_HPP
diff --git a/src/boost/intrusive/sgtree_algorithms.hpp b/src/boost/intrusive/sgtree_algorithms.hpp
deleted file mode 100644
index 726dbb99..00000000
--- a/src/boost/intrusive/sgtree_algorithms.hpp
+++ /dev/null
@@ -1,420 +0,0 @@
-/////////////////////////////////////////////////////////////////////////////
-//
-// (C) Copyright Ion Gaztanaga 2007-2014
-//
-// Distributed under the Boost 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/intrusive for documentation.
-//
-/////////////////////////////////////////////////////////////////////////////
-//
-// Scapegoat tree algorithms are taken from the paper titled:
-// "Scapegoat Trees" by Igal Galperin Ronald L. Rivest.
-//
-/////////////////////////////////////////////////////////////////////////////
-#ifndef BOOST_INTRUSIVE_SGTREE_ALGORITHMS_HPP
-#define BOOST_INTRUSIVE_SGTREE_ALGORITHMS_HPP
-
-#include <boost/intrusive/detail/config_begin.hpp>
-#include <boost/intrusive/intrusive_fwd.hpp>
-
-#include <cstddef>
-#include <boost/intrusive/detail/algo_type.hpp>
-#include <boost/intrusive/bstree_algorithms.hpp>
-
-#if defined(BOOST_HAS_PRAGMA_ONCE)
-#  pragma once
-#endif
-
-namespace boost {
-namespace intrusive {
-
-//! sgtree_algorithms is configured with a NodeTraits class, which encapsulates the
-//! information about the node to be manipulated. NodeTraits must support the
-//! following interface:
-//!
-//! <b>Typedefs</b>:
-//!
-//! <tt>node</tt>: The type of the node that forms the binary search tree
-//!
-//! <tt>node_ptr</tt>: A pointer to a node
-//!
-//! <tt>const_node_ptr</tt>: A pointer to a const node
-//!
-//! <b>Static functions</b>:
-//!
-//! <tt>static node_ptr get_parent(const_node_ptr n);</tt>
-//!
-//! <tt>static void set_parent(node_ptr n, node_ptr parent);</tt>
-//!
-//! <tt>static node_ptr get_left(const_node_ptr n);</tt>
-//!
-//! <tt>static void set_left(node_ptr n, node_ptr left);</tt>
-//!
-//! <tt>static node_ptr get_right(const_node_ptr n);</tt>
-//!
-//! <tt>static void set_right(node_ptr n, node_ptr right);</tt>
-template<class NodeTraits>
-class sgtree_algorithms
-   #ifndef BOOST_INTRUSIVE_DOXYGEN_INVOKED
-   : public bstree_algorithms<NodeTraits>
-   #endif
-{
-   public:
-   typedef typename NodeTraits::node            node;
-   typedef NodeTraits                           node_traits;
-   typedef typename NodeTraits::node_ptr       node_ptr;
-   typedef typename NodeTraits::const_node_ptr const_node_ptr;
-
-   /// @cond
-   private:
-
-   typedef bstree_algorithms<NodeTraits>  bstree_algo;
-
-   /// @endcond
-
-   public:
-   //! This type is the information that will be
-   //! filled by insert_unique_check
-   struct insert_commit_data
-      : bstree_algo::insert_commit_data
-   {
-      std::size_t depth;
-   };
-
-   #ifdef BOOST_INTRUSIVE_DOXYGEN_INVOKED
-   //! @copydoc ::boost::intrusive::bstree_algorithms::get_header(const_node_ptr)
-   static node_ptr get_header(const_node_ptr n) BOOST_NOEXCEPT;
-
-   //! @copydoc ::boost::intrusive::bstree_algorithms::begin_node
-   static node_ptr begin_node(const_node_ptr header) BOOST_NOEXCEPT;
-
-   //! @copydoc ::boost::intrusive::bstree_algorithms::end_node
-   static node_ptr end_node(const_node_ptr header) BOOST_NOEXCEPT;
-
-   //! @copydoc ::boost::intrusive::bstree_algorithms::swap_tree
-   static void swap_tree(node_ptr header1, node_ptr header2) BOOST_NOEXCEPT;
-
-   //! @copydoc ::boost::intrusive::bstree_algorithms::swap_nodes(node_ptr,node_ptr)
-   static void swap_nodes(node_ptr node1, node_ptr node2) BOOST_NOEXCEPT;
-
-   //! @copydoc ::boost::intrusive::bstree_algorithms::swap_nodes(node_ptr,node_ptr,node_ptr,node_ptr)
-   static void swap_nodes(node_ptr node1, node_ptr header1, node_ptr node2, node_ptr header2) BOOST_NOEXCEPT;
-
-   //! @copydoc ::boost::intrusive::bstree_algorithms::replace_node(node_ptr,node_ptr)
-   static void replace_node(node_ptr node_to_be_replaced, node_ptr new_node) BOOST_NOEXCEPT;
-
-   //! @copydoc ::boost::intrusive::bstree_algorithms::replace_node(node_ptr,node_ptr,node_ptr)
-   static void replace_node(node_ptr node_to_be_replaced, node_ptr header, node_ptr new_node) BOOST_NOEXCEPT;
-
-   //Unlink is not possible since tree metadata is needed to update the tree
-   //!static void unlink(node_ptr n) BOOST_NOEXCEPT;
-
-   //! @copydoc ::boost::intrusive::bstree_algorithms::unlink_leftmost_without_rebalance
-   static node_ptr unlink_leftmost_without_rebalance(node_ptr header) BOOST_NOEXCEPT;
-
-   //! @copydoc ::boost::intrusive::bstree_algorithms::unique(const_node_ptr)
-   static bool unique(const_node_ptr n) BOOST_NOEXCEPT;
-
-   //! @copydoc ::boost::intrusive::bstree_algorithms::size(const_node_ptr)
-   static std::size_t size(const_node_ptr header) BOOST_NOEXCEPT;
-
-   //! @copydoc ::boost::intrusive::bstree_algorithms::next_node(node_ptr)
-   static node_ptr next_node(node_ptr n) BOOST_NOEXCEPT;
-
-   //! @copydoc ::boost::intrusive::bstree_algorithms::prev_node(node_ptr)
-   static node_ptr prev_node(node_ptr n) BOOST_NOEXCEPT;
-
-   //! @copydoc ::boost::intrusive::bstree_algorithms::init(node_ptr)
-   static void init(node_ptr n) BOOST_NOEXCEPT;
-
-   //! @copydoc ::boost::intrusive::bstree_algorithms::init_header(node_ptr)
-   static void init_header(node_ptr header) BOOST_NOEXCEPT;
-   #endif   //#ifdef BOOST_INTRUSIVE_DOXYGEN_INVOKED
-
-   //! @copydoc ::boost::intrusive::bstree_algorithms::erase(node_ptr,node_ptr)
-   template<class AlphaByMaxSize>
-   static node_ptr erase(node_ptr header, node_ptr z, std::size_t tree_size, std::size_t &max_tree_size, AlphaByMaxSize alpha_by_maxsize)
-   {
-      bstree_algo::erase(header, z);
-      --tree_size;
-      if (tree_size > 0 &&
-          tree_size < static_cast<std::size_t>(alpha_by_maxsize(max_tree_size))){
-         bstree_algo::rebalance(header);
-         max_tree_size = tree_size;
-      }
-      return z;
-   }
-
-   #ifdef BOOST_INTRUSIVE_DOXYGEN_INVOKED
-   //! @copydoc ::boost::intrusive::bstree_algorithms::clone(const_node_ptr,node_ptr,Cloner,Disposer)
-   template <class Cloner, class Disposer>
-   static void clone
-      (const_node_ptr source_header, node_ptr target_header, Cloner cloner, Disposer disposer);
-
-   //! @copydoc ::boost::intrusive::bstree_algorithms::clear_and_dispose(node_ptr,Disposer)
-   template<class Disposer>
-   static void clear_and_dispose(node_ptr header, Disposer disposer) BOOST_NOEXCEPT;
-
-   //! @copydoc ::boost::intrusive::bstree_algorithms::lower_bound(const_node_ptr,const KeyType&,KeyNodePtrCompare)
-   template<class KeyType, class KeyNodePtrCompare>
-   static node_ptr lower_bound
-      (const_node_ptr header, const KeyType &key, KeyNodePtrCompare comp);
-
-   //! @copydoc ::boost::intrusive::bstree_algorithms::upper_bound(const_node_ptr,const KeyType&,KeyNodePtrCompare)
-   template<class KeyType, class KeyNodePtrCompare>
-   static node_ptr upper_bound
-      (const_node_ptr header, const KeyType &key, KeyNodePtrCompare comp);
-
-   //! @copydoc ::boost::intrusive::bstree_algorithms::find(const_node_ptr, const KeyType&,KeyNodePtrCompare)
-   template<class KeyType, class KeyNodePtrCompare>
-   static node_ptr find
-      (const_node_ptr header, const KeyType &key, KeyNodePtrCompare comp);
-
-   //! @copydoc ::boost::intrusive::bstree_algorithms::equal_range(const_node_ptr,const KeyType&,KeyNodePtrCompare)
-   template<class KeyType, class KeyNodePtrCompare>
-   static std::pair<node_ptr, node_ptr> equal_range
-      (const_node_ptr header, const KeyType &key, KeyNodePtrCompare comp);
-
-   //! @copydoc ::boost::intrusive::bstree_algorithms::bounded_range(const_node_ptr,const KeyType&,const KeyType&,KeyNodePtrCompare,bool,bool)
-   template<class KeyType, class KeyNodePtrCompare>
-   static std::pair<node_ptr, node_ptr> bounded_range
-      (const_node_ptr header, const KeyType &lower_key, const KeyType &upper_key, KeyNodePtrCompare comp
-      , bool left_closed, bool right_closed);
-
-   //! @copydoc ::boost::intrusive::bstree_algorithms::count(const_node_ptr,const KeyType&,KeyNodePtrCompare)
-   template<class KeyType, class KeyNodePtrCompare>
-   static std::size_t count(const_node_ptr header, const KeyType &key, KeyNodePtrCompare comp);
-
-   #endif   //#ifdef BOOST_INTRUSIVE_DOXYGEN_INVOKED
-
-   //! @copydoc ::boost::intrusive::bstree_algorithms::insert_equal_upper_bound(node_ptr,node_ptr,NodePtrCompare)
-   template<class NodePtrCompare, class H_Alpha>
-   static node_ptr insert_equal_upper_bound
-      (node_ptr h, node_ptr new_node, NodePtrCompare comp
-      ,std::size_t tree_size, H_Alpha h_alpha, std::size_t &max_tree_size)
-   {
-      std::size_t depth;
-      bstree_algo::insert_equal_upper_bound(h, new_node, comp, &depth);
-      rebalance_after_insertion(new_node, depth, tree_size+1, h_alpha, max_tree_size);
-      return new_node;
-   }
-
-   //! @copydoc ::boost::intrusive::bstree_algorithms::insert_equal_lower_bound(node_ptr,node_ptr,NodePtrCompare)
-   template<class NodePtrCompare, class H_Alpha>
-   static node_ptr insert_equal_lower_bound
-      (node_ptr h, node_ptr new_node, NodePtrCompare comp
-      ,std::size_t tree_size, H_Alpha h_alpha, std::size_t &max_tree_size)
-   {
-      std::size_t depth;
-      bstree_algo::insert_equal_lower_bound(h, new_node, comp, &depth);
-      rebalance_after_insertion(new_node, depth, tree_size+1, h_alpha, max_tree_size);
-      return new_node;
-   }
-
-   //! @copydoc ::boost::intrusive::bstree_algorithms::insert_equal(node_ptr,node_ptr,node_ptr,NodePtrCompare)
-   template<class NodePtrCompare, class H_Alpha>
-   static node_ptr insert_equal
-      (node_ptr header, node_ptr hint, node_ptr new_node, NodePtrCompare comp
-      ,std::size_t tree_size, H_Alpha h_alpha, std::size_t &max_tree_size)
-   {
-      std::size_t depth;
-      bstree_algo::insert_equal(header, hint, new_node, comp, &depth);
-      rebalance_after_insertion(new_node, depth, tree_size+1, h_alpha, max_tree_size);
-      return new_node;
-   }
-
-   //! @copydoc ::boost::intrusive::bstree_algorithms::insert_before(node_ptr,node_ptr,node_ptr)
-   template<class H_Alpha>
-   static node_ptr insert_before
-      (node_ptr header, node_ptr pos, node_ptr new_node
-      ,std::size_t tree_size, H_Alpha h_alpha, std::size_t &max_tree_size)
-   {
-      std::size_t depth;
-      bstree_algo::insert_before(header, pos, new_node, &depth);
-      rebalance_after_insertion(new_node, depth, tree_size+1, h_alpha, max_tree_size);
-      return new_node;
-   }
-
-   //! @copydoc ::boost::intrusive::bstree_algorithms::push_back(node_ptr,node_ptr)
-   template<class H_Alpha>
-   static void push_back(node_ptr header, node_ptr new_node
-         ,std::size_t tree_size, H_Alpha h_alpha, std::size_t &max_tree_size) BOOST_NOEXCEPT
-   {
-      std::size_t depth;
-      bstree_algo::push_back(header, new_node, &depth);
-      rebalance_after_insertion(new_node, depth, tree_size+1, h_alpha, max_tree_size);
-   }
-
-   //! @copydoc ::boost::intrusive::bstree_algorithms::push_front(node_ptr,node_ptr)
-   template<class H_Alpha>
-   static void push_front(node_ptr header, node_ptr new_node
-         ,std::size_t tree_size, H_Alpha h_alpha, std::size_t &max_tree_size) BOOST_NOEXCEPT
-   {
-      std::size_t depth;
-      bstree_algo::push_front(header, new_node, &depth);
-      rebalance_after_insertion(new_node, depth, tree_size+1, h_alpha, max_tree_size);
-   }
-
-   //! @copydoc ::boost::intrusive::bstree_algorithms::insert_unique_check(const_node_ptr,const KeyType&,KeyNodePtrCompare,insert_commit_data&)
-   template<class KeyType, class KeyNodePtrCompare>
-   static std::pair<node_ptr, bool> insert_unique_check
-      (const_node_ptr header,  const KeyType &key
-      ,KeyNodePtrCompare comp, insert_commit_data &commit_data)
-   {
-      std::size_t depth;
-      std::pair<node_ptr, bool> ret =
-         bstree_algo::insert_unique_check(header, key, comp, commit_data, &depth);
-      commit_data.depth = depth;
-      return ret;
-   }
-
-   //! @copydoc ::boost::intrusive::bstree_algorithms::insert_unique_check(const_node_ptr,node_ptr,const KeyType&,KeyNodePtrCompare,insert_commit_data&)
-   template<class KeyType, class KeyNodePtrCompare>
-   static std::pair<node_ptr, bool> insert_unique_check
-      (const_node_ptr header, node_ptr hint, const KeyType &key
-      ,KeyNodePtrCompare comp, insert_commit_data &commit_data)
-   {
-      std::size_t depth;
-      std::pair<node_ptr, bool> ret =
-         bstree_algo::insert_unique_check
-            (header, hint, key, comp, commit_data, &depth);
-      commit_data.depth = depth;
-      return ret;
-   }
-
-   //! @copydoc ::boost::intrusive::bstree_algorithms::insert_unique_commit(node_ptr,node_ptr,const insert_commit_data&)
-   template<class H_Alpha>
-   BOOST_INTRUSIVE_FORCEINLINE static void insert_unique_commit
-      (node_ptr header, node_ptr new_value, const insert_commit_data &commit_data
-      ,std::size_t tree_size, H_Alpha h_alpha, std::size_t &max_tree_size)
-   {  return insert_commit(header, new_value, commit_data, tree_size, h_alpha, max_tree_size);  }
-
-   //! @copydoc ::boost::intrusive::bstree_algorithms::transfer_unique
-   template<class NodePtrCompare, class H_Alpha, class AlphaByMaxSize>
-   static bool transfer_unique
-      ( node_ptr header1, NodePtrCompare comp, std::size_t tree1_size, std::size_t &max_tree1_size
-      , node_ptr header2, node_ptr z,   std::size_t tree2_size, std::size_t &max_tree2_size
-      ,H_Alpha h_alpha, AlphaByMaxSize alpha_by_maxsize)
-   {
-      insert_commit_data commit_data;
-      bool const transferable = insert_unique_check(header1, z, comp, commit_data).second;
-      if(transferable){
-         erase(header2, z, tree2_size, max_tree2_size, alpha_by_maxsize);
-         insert_commit(header1, z, commit_data, tree1_size, h_alpha, max_tree1_size);
-      }
-      return transferable;
-   }
-
-   //! @copydoc ::boost::intrusive::bstree_algorithms::transfer_equal
-   template<class NodePtrCompare, class H_Alpha, class AlphaByMaxSize>
-   static void transfer_equal
-      ( node_ptr header1, NodePtrCompare comp, std::size_t tree1_size, std::size_t &max_tree1_size
-      , node_ptr header2, node_ptr z,   std::size_t tree2_size, std::size_t &max_tree2_size
-      ,H_Alpha h_alpha, AlphaByMaxSize alpha_by_maxsize)
-   {
-      insert_commit_data commit_data;
-      insert_equal_upper_bound_check(header1, z, comp, commit_data);
-      erase(header2, z, tree2_size, max_tree2_size, alpha_by_maxsize);
-      insert_commit(header1, z, commit_data, tree1_size, h_alpha, max_tree1_size);
-   }
-
-   #ifdef BOOST_INTRUSIVE_DOXYGEN_INVOKED
-   //! @copydoc ::boost::intrusive::bstree_algorithms::is_header
-   static bool is_header(const_node_ptr p) BOOST_NOEXCEPT;
-
-   //! @copydoc ::boost::intrusive::bstree_algorithms::is_header
-   static void rebalance(node_ptr header) BOOST_NOEXCEPT;
-
-   //! @copydoc ::boost::intrusive::bstree_algorithms::rebalance_subtree
-   static node_ptr rebalance_subtree(node_ptr old_root) BOOST_NOEXCEPT
-   #endif   //#ifdef BOOST_INTRUSIVE_DOXYGEN_INVOKED
-
-   /// @cond
-   private:
-
-   template<class KeyType, class KeyNodePtrCompare>
-   static void insert_equal_upper_bound_check
-      (node_ptr header,  const KeyType &key
-      ,KeyNodePtrCompare comp, insert_commit_data &commit_data)
-   {
-      std::size_t depth;
-      bstree_algo::insert_equal_upper_bound_check(header, key, comp, commit_data, &depth);
-      commit_data.depth = depth;
-   }
-
-   template<class H_Alpha>
-   static void insert_commit
-      (node_ptr header, node_ptr new_value, const insert_commit_data &commit_data
-      ,std::size_t tree_size, H_Alpha h_alpha, std::size_t &max_tree_size) BOOST_NOEXCEPT
-   {
-      bstree_algo::insert_unique_commit(header, new_value, commit_data);
-      rebalance_after_insertion(new_value, commit_data.depth, tree_size+1, h_alpha, max_tree_size);
-   }
-
-   template<class H_Alpha>
-   static void rebalance_after_insertion
-      (node_ptr x, std::size_t depth
-      , std::size_t tree_size, H_Alpha h_alpha, std::size_t &max_tree_size) BOOST_NOEXCEPT
-   {
-      if(tree_size > max_tree_size)
-         max_tree_size = tree_size;
-
-      if(tree_size > 2 && //Nothing to do with only the root
-         //Check if the root node is unbalanced
-         //Scapegoat paper depth counts root depth as zero and "depth" counts root as 1,
-         //but since "depth" is the depth of the ancestor of x, i == depth
-         depth > h_alpha(tree_size)){
-
-         //Find the first non height-balanced node
-         //as described in the section 4.2 of the paper.
-         //This method is the alternative method described
-         //in the paper. Authors claim that this method
-         //may tend to yield more balanced trees on the average
-         //than the weight balanced method.
-         node_ptr s = x;
-         std::size_t size = 1;
-         for(std::size_t ancestor = 1; ancestor != depth; ++ancestor){
-            const node_ptr s_parent = NodeTraits::get_parent(s);
-            const node_ptr s_parent_left = NodeTraits::get_left(s_parent);
-            //Obtain parent's size (previous size + parent + sibling tree)
-            const node_ptr s_sibling = s_parent_left == s ? NodeTraits::get_right(s_parent) : s_parent_left;
-            size += 1 + bstree_algo::subtree_size(s_sibling);
-            s = s_parent;
-            if(ancestor > h_alpha(size)){ //is 's' scapegoat?
-               bstree_algo::rebalance_subtree(s);
-               return;
-            }
-         }
-         //The whole tree must be rebuilt
-         max_tree_size = tree_size;
-         bstree_algo::rebalance_subtree(NodeTraits::get_parent(s));
-      }
-   }
-   /// @endcond
-};
-
-/// @cond
-
-template<class NodeTraits>
-struct get_algo<SgTreeAlgorithms, NodeTraits>
-{
-   typedef sgtree_algorithms<NodeTraits> type;
-};
-
-template <class ValueTraits, class NodePtrCompare, class ExtraChecker>
-struct get_node_checker<SgTreeAlgorithms, ValueTraits, NodePtrCompare, ExtraChecker>
-{
-   typedef detail::bstree_node_checker<ValueTraits, NodePtrCompare, ExtraChecker> type;
-};
-
-/// @endcond
-
-} //namespace intrusive
-} //namespace boost
-
-#include <boost/intrusive/detail/config_end.hpp>
-
-#endif //BOOST_INTRUSIVE_SGTREE_ALGORITHMS_HPP
diff --git a/src/boost/intrusive/slist.hpp b/src/boost/intrusive/slist.hpp
deleted file mode 100644
index 7319bf31..00000000
--- a/src/boost/intrusive/slist.hpp
+++ /dev/null
@@ -1,2247 +0,0 @@
-/////////////////////////////////////////////////////////////////////////////
-//
-// (C) Copyright Olaf Krzikalla 2004-2006.
-// (C) Copyright Ion Gaztanaga  2006-2014
-//
-// Distributed under the Boost 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/intrusive for documentation.
-//
-/////////////////////////////////////////////////////////////////////////////
-
-#ifndef BOOST_INTRUSIVE_SLIST_HPP
-#define BOOST_INTRUSIVE_SLIST_HPP
-
-#include <boost/intrusive/detail/config_begin.hpp>
-#include <boost/intrusive/intrusive_fwd.hpp>
-
-#include <boost/intrusive/detail/assert.hpp>
-#include <boost/intrusive/slist_hook.hpp>
-#include <boost/intrusive/circular_slist_algorithms.hpp>
-#include <boost/intrusive/linear_slist_algorithms.hpp>
-#include <boost/intrusive/pointer_traits.hpp>
-#include <boost/intrusive/link_mode.hpp>
-#include <boost/intrusive/detail/get_value_traits.hpp>
-#include <boost/intrusive/detail/is_stateful_value_traits.hpp>
-#include <boost/intrusive/detail/default_header_holder.hpp>
-#include <boost/intrusive/detail/uncast.hpp>
-#include <boost/intrusive/detail/mpl.hpp>
-#include <boost/intrusive/detail/iterator.hpp>
-#include <boost/intrusive/detail/slist_iterator.hpp>
-#include <boost/intrusive/detail/array_initializer.hpp>
-#include <boost/intrusive/detail/exception_disposer.hpp>
-#include <boost/intrusive/detail/equal_to_value.hpp>
-#include <boost/intrusive/detail/key_nodeptr_comp.hpp>
-#include <boost/intrusive/detail/simple_disposers.hpp>
-#include <boost/intrusive/detail/size_holder.hpp>
-#include <boost/intrusive/detail/algorithm.hpp>
-#include <boost/intrusive/detail/value_functors.hpp>
-#include <boost/intrusive/detail/node_cloner_disposer.hpp>
-
-#include <boost/move/utility_core.hpp>
-#include <boost/static_assert.hpp>
-
-#include <cstddef>   //std::size_t
-
-#if defined(BOOST_HAS_PRAGMA_ONCE)
-#  pragma once
-#endif
-
-namespace boost {
-namespace intrusive {
-
-/// @cond
-
-template<class HeaderHolder, class NodePtr, bool>
-struct header_holder_plus_last
-{
-   HeaderHolder header_holder_;
-   NodePtr  last_;
-};
-
-template<class HeaderHolder, class NodePtr>
-struct header_holder_plus_last<HeaderHolder, NodePtr, false>
-{
-   HeaderHolder header_holder_;
-};
-
-struct default_slist_hook_applier
-{  template <class T> struct apply{ typedef typename T::default_slist_hook type;  };  };
-
-template<>
-struct is_default_hook_tag<default_slist_hook_applier>
-{  static const bool value = true;  };
-
-struct slist_defaults
-{
-   typedef default_slist_hook_applier proto_value_traits;
-   static const bool constant_time_size = true;
-   static const bool linear = false;
-   typedef std::size_t size_type;
-   static const bool cache_last = false;
-   typedef void header_holder_type;
-};
-
-struct slist_bool_flags
-{
-   static const std::size_t linear_pos             = 1u;
-   static const std::size_t constant_time_size_pos = 2u;
-   static const std::size_t cache_last_pos         = 4u;
-};
-
-
-/// @endcond
-
-//! The class template slist is an intrusive container, that encapsulates
-//! a singly-linked list. You can use such a list to squeeze the last bit
-//! of performance from your application. Unfortunately, the little gains
-//! come with some huge drawbacks. A lot of member functions can't be
-//! implemented as efficiently as for standard containers. To overcome
-//! this limitation some other member functions with rather unusual semantics
-//! have to be introduced.
-//!
-//! The template parameter \c T is the type to be managed by the container.
-//! The user can specify additional options and if no options are provided
-//! default options are used.
-//!
-//! The container supports the following options:
-//! \c base_hook<>/member_hook<>/value_traits<>,
-//! \c constant_time_size<>, \c size_type<>,
-//! \c linear<> and \c cache_last<>.
-//!
-//! The iterators of slist are forward iterators. slist provides a static
-//! function called "previous" to compute the previous iterator of a given iterator.
-//! This function has linear complexity. To improve the usability esp. with
-//! the '*_after' functions, ++end() == begin() and previous(begin()) == end()
-//! are defined. An new special function "before_begin()" is defined, which returns
-//! an iterator that points one less the beginning of the list: ++before_begin() == begin()
-#if defined(BOOST_INTRUSIVE_DOXYGEN_INVOKED)
-template<class T, class ...Options>
-#else
-template<class ValueTraits, class SizeType, std::size_t BoolFlags, typename HeaderHolder>
-#endif
-class slist_impl
-{
-   //Public typedefs
-   public:
-   typedef ValueTraits                                               value_traits;
-   typedef typename value_traits::pointer                            pointer;
-   typedef typename value_traits::const_pointer                      const_pointer;
-   typedef typename pointer_traits<pointer>::element_type            value_type;
-   typedef typename pointer_traits<pointer>::reference               reference;
-   typedef typename pointer_traits<const_pointer>::reference         const_reference;
-   typedef typename pointer_traits<pointer>::difference_type         difference_type;
-   typedef SizeType                                                  size_type;
-   typedef slist_iterator<value_traits, false>                       iterator;
-   typedef slist_iterator<value_traits, true>                        const_iterator;
-   typedef typename value_traits::node_traits                        node_traits;
-   typedef typename node_traits::node                                node;
-   typedef typename node_traits::node_ptr                            node_ptr;
-   typedef typename node_traits::const_node_ptr                      const_node_ptr;
-   typedef typename detail::get_header_holder_type
-      < value_traits, HeaderHolder >::type                           header_holder_type;
-
-   static const bool constant_time_size = 0 != (BoolFlags & slist_bool_flags::constant_time_size_pos);
-   static const bool stateful_value_traits = detail::is_stateful_value_traits<value_traits>::value;
-   static const bool linear = 0 != (BoolFlags & slist_bool_flags::linear_pos);
-   static const bool cache_last = 0 != (BoolFlags & slist_bool_flags::cache_last_pos);
-   static const bool has_container_from_iterator =
-        detail::is_same< header_holder_type, detail::default_header_holder< node_traits > >::value;
-
-   typedef typename detail::if_c
-      < linear
-      , linear_slist_algorithms<node_traits>
-      , circular_slist_algorithms<node_traits>
-      >::type                                                        node_algorithms;
-
-   /// @cond
-   private:
-   typedef detail::size_holder<constant_time_size, size_type>        size_traits;
-
-   //noncopyable
-   BOOST_MOVABLE_BUT_NOT_COPYABLE(slist_impl)
-
-   static const bool safemode_or_autounlink = is_safe_autounlink<value_traits::link_mode>::value;
-
-   //Constant-time size is incompatible with auto-unlink hooks!
-   BOOST_STATIC_ASSERT(!(constant_time_size && ((int)value_traits::link_mode == (int)auto_unlink)));
-   //Linear singly linked lists are incompatible with auto-unlink hooks!
-   BOOST_STATIC_ASSERT(!(linear && ((int)value_traits::link_mode == (int)auto_unlink)));
-   //A list with cached last node is incompatible with auto-unlink hooks!
-   BOOST_STATIC_ASSERT(!(cache_last && ((int)value_traits::link_mode == (int)auto_unlink)));
-
-   BOOST_INTRUSIVE_FORCEINLINE node_ptr get_end_node()
-   {  return node_algorithms::end_node(this->get_root_node());  }
-
-   BOOST_INTRUSIVE_FORCEINLINE const_node_ptr get_end_node() const
-   {  return node_algorithms::end_node(this->get_root_node());  }
-
-   BOOST_INTRUSIVE_FORCEINLINE node_ptr get_root_node()
-   { return data_.root_plus_size_.header_holder_.get_node(); }
-
-   BOOST_INTRUSIVE_FORCEINLINE const_node_ptr get_root_node() const
-   { return data_.root_plus_size_.header_holder_.get_node(); }
-
-   BOOST_INTRUSIVE_FORCEINLINE node_ptr get_last_node()
-   {  return this->get_last_node(detail::bool_<cache_last>());  }
-
-   BOOST_INTRUSIVE_FORCEINLINE const_node_ptr get_last_node() const
-   {  return this->get_last_node(detail::bool_<cache_last>());  }
-
-   BOOST_INTRUSIVE_FORCEINLINE void set_last_node(node_ptr n)
-   {  return this->set_last_node(n, detail::bool_<cache_last>());  }
-
-   BOOST_INTRUSIVE_FORCEINLINE static node_ptr get_last_node(detail::bool_<false>)
-   {
-      //This function shall not be used if cache_last is not true
-      BOOST_INTRUSIVE_INVARIANT_ASSERT(cache_last);
-      return node_ptr();
-   }
-
-   BOOST_INTRUSIVE_FORCEINLINE static void set_last_node(node_ptr , detail::bool_<false>)
-   {
-      //This function shall not be used if cache_last is not true
-      BOOST_INTRUSIVE_INVARIANT_ASSERT(cache_last);
-   }
-
-   BOOST_INTRUSIVE_FORCEINLINE node_ptr get_last_node(detail::bool_<true>)
-   {  return node_ptr(data_.root_plus_size_.last_);  }
-
-   BOOST_INTRUSIVE_FORCEINLINE const_node_ptr get_last_node(detail::bool_<true>) const
-   {  return const_node_ptr(data_.root_plus_size_.last_);  }
-
-   BOOST_INTRUSIVE_FORCEINLINE void set_last_node(node_ptr n, detail::bool_<true>)
-   {  data_.root_plus_size_.last_ = n;  }
-
-   void set_default_constructed_state()
-   {
-      node_algorithms::init_header(this->get_root_node());
-      this->priv_size_traits().set_size(size_type(0));
-      BOOST_IF_CONSTEXPR(cache_last){
-         this->set_last_node(this->get_root_node());
-      }
-   }
-
-   typedef header_holder_plus_last<header_holder_type, node_ptr, cache_last> header_holder_plus_last_t;
-   struct root_plus_size
-      :  public size_traits
-      ,  public header_holder_plus_last_t
-   {};
-
-   struct data_t
-      :  public value_traits
-   {
-      typedef typename slist_impl::value_traits value_traits;
-      explicit data_t(const value_traits &val_traits)
-         :  value_traits(val_traits)
-      {}
-
-      root_plus_size root_plus_size_;
-   } data_;
-
-   BOOST_INTRUSIVE_FORCEINLINE size_traits &priv_size_traits()
-   {  return data_.root_plus_size_;  }
-
-   BOOST_INTRUSIVE_FORCEINLINE const size_traits &priv_size_traits() const
-   {  return data_.root_plus_size_;  }
-
-   BOOST_INTRUSIVE_FORCEINLINE const value_traits &priv_value_traits() const
-   {  return data_;  }
-
-   BOOST_INTRUSIVE_FORCEINLINE value_traits &priv_value_traits()
-   {  return data_;  }
-
-   typedef typename boost::intrusive::value_traits_pointers
-      <ValueTraits>::const_value_traits_ptr const_value_traits_ptr;
-
-   BOOST_INTRUSIVE_FORCEINLINE const_value_traits_ptr priv_value_traits_ptr() const
-   {  return pointer_traits<const_value_traits_ptr>::pointer_to(this->priv_value_traits());  }
-
-   /// @endcond
-
-   public:
-
-   ///@cond
-
-   //! <b>Requires</b>: f and before_l belong to another slist.
-   //!
-   //! <b>Effects</b>: Transfers the range [f, before_l] to this
-   //!   list, after the element pointed by prev_pos.
-   //!   No destructors or copy constructors are called.
-   //!
-   //! <b>Throws</b>: Nothing.
-   //!
-   //! <b>Complexity</b>: Linear to the number of elements transferred
-   //!   if constant_time_size is true. Constant-time otherwise.
-   //!
-   //! <b>Note</b>: Iterators of values obtained from list x now point to elements of this
-   //!   list. Iterators of this list and all the references are not invalidated.
-   //!
-   //! <b>Warning</b>: Experimental function, don't use it!
-   slist_impl( node_ptr f, node_ptr before_l
-             , size_type n, const value_traits &v_traits = value_traits())
-      :  data_(v_traits)
-   {
-      if(n){
-         this->priv_size_traits().set_size(n);
-         BOOST_IF_CONSTEXPR(cache_last){
-            this->set_last_node(before_l);
-         }
-         node_traits::set_next(this->get_root_node(), f);
-         node_traits::set_next(before_l, this->get_end_node());
-      }
-      else{
-         this->set_default_constructed_state();
-      }
-   }
-
-   ///@endcond
-
-   //! <b>Effects</b>: constructs an empty list.
-   //!
-   //! <b>Complexity</b>: Constant
-   //!
-   //! <b>Throws</b>: If value_traits::node_traits::node
-   //!   constructor throws (this does not happen with predefined Boost.Intrusive hooks).
-   slist_impl()
-      :  data_(value_traits())
-   {  this->set_default_constructed_state(); }
-
-   //! <b>Effects</b>: constructs an empty list.
-   //!
-   //! <b>Complexity</b>: Constant
-   //!
-   //! <b>Throws</b>: If value_traits::node_traits::node
-   //!   constructor throws (this does not happen with predefined Boost.Intrusive hooks).
-   explicit slist_impl(const value_traits &v_traits)
-      :  data_(v_traits)
-   {  this->set_default_constructed_state(); }
-
-   //! <b>Requires</b>: Dereferencing iterator must yield an lvalue of type value_type.
-   //!
-   //! <b>Effects</b>: Constructs a list equal to [b ,e).
-   //!
-   //! <b>Complexity</b>: Linear in distance(b, e). No copy constructors are called.
-   //!
-   //! <b>Throws</b>: If value_traits::node_traits::node
-   //!   constructor throws (this does not happen with predefined Boost.Intrusive hooks).
-   template<class Iterator>
-   slist_impl(Iterator b, Iterator e, const value_traits &v_traits = value_traits())
-      :  data_(v_traits)
-   {
-      this->set_default_constructed_state();
-      //nothrow, no need to rollback to release elements on exception
-      this->insert_after(this->cbefore_begin(), b, e);
-   }
-
-   //! <b>Effects</b>: Constructs a container moving resources from another container.
-   //!   Internal value traits are move constructed and
-   //!   nodes belonging to x (except the node representing the "end") are linked to *this.
-   //!
-   //! <b>Complexity</b>: Constant.
-   //!
-   //! <b>Throws</b>: If value_traits::node_traits::node's
-   //!   move constructor throws (this does not happen with predefined Boost.Intrusive hooks)
-   //!   or the move constructor of value traits throws.
-   slist_impl(BOOST_RV_REF(slist_impl) x)
-      : data_(::boost::move(x.priv_value_traits()))
-   {
-      this->set_default_constructed_state();
-      //nothrow, no need to rollback to release elements on exception
-      this->swap(x);
-   }
-
-   //! <b>Effects</b>: Equivalent to swap
-   //!
-   slist_impl& operator=(BOOST_RV_REF(slist_impl) x)
-   {  this->swap(x); return *this;  }
-
-   //! <b>Effects</b>: If it's a safe-mode
-   //!   or auto-unlink value, the destructor does nothing
-   //!   (ie. no code is generated). Otherwise it detaches all elements from this.
-   //!   In this case the objects in the list are not deleted (i.e. no destructors
-   //!   are called), but the hooks according to the value_traits template parameter
-   //!   are set to their default value.
-   //!
-   //! <b>Complexity</b>: Linear to the number of elements in the list, if
-   //!   it's a safe-mode or auto-unlink value. Otherwise constant.
-   ~slist_impl()
-   {
-      BOOST_IF_CONSTEXPR(is_safe_autounlink<ValueTraits::link_mode>::value){
-         this->clear();
-         node_algorithms::init(this->get_root_node());
-      }
-   }
-
-   //! <b>Effects</b>: Erases all the elements of the container.
-   //!
-   //! <b>Throws</b>: Nothing.
-   //!
-   //! <b>Complexity</b>: Linear to the number of elements of the list.
-   //!   if it's a safe-mode or auto-unlink value_type. Constant time otherwise.
-   //!
-   //! <b>Note</b>: Invalidates the iterators (but not the references) to the erased elements.
-   void clear() BOOST_NOEXCEPT
-   {
-      BOOST_IF_CONSTEXPR(safemode_or_autounlink){
-         this->clear_and_dispose(detail::null_disposer());
-      }
-      else{
-         this->set_default_constructed_state();
-      }
-   }
-
-   //! <b>Requires</b>: Disposer::operator()(pointer) shouldn't throw.
-   //!
-   //! <b>Effects</b>: Erases all the elements of the container
-   //!   Disposer::operator()(pointer) is called for the removed elements.
-   //!
-   //! <b>Throws</b>: Nothing.
-   //!
-   //! <b>Complexity</b>: Linear to the number of elements of the list.
-   //!
-   //! <b>Note</b>: Invalidates the iterators to the erased elements.
-   template <class Disposer>
-   void clear_and_dispose(Disposer disposer) BOOST_NOEXCEPT
-   {
-      node_algorithms::detach_and_dispose
-         ( this->get_root_node()
-         , detail::node_disposer<Disposer, value_traits, CommonSListAlgorithms>
-               (disposer, &this->priv_value_traits()) );
-      this->set_default_constructed_state();
-   }
-
-   //! <b>Requires</b>: value must be an lvalue.
-   //!
-   //! <b>Effects</b>: Inserts the value in the front of the list.
-   //!   No copy constructors are called.
-   //!
-   //! <b>Throws</b>: Nothing.
-   //!
-   //! <b>Complexity</b>: Constant.
-   //!
-   //! <b>Note</b>: Does not affect the validity of iterators and references.
-   void push_front(reference value) BOOST_NOEXCEPT
-   {
-      node_ptr to_insert = priv_value_traits().to_node_ptr(value);
-      BOOST_INTRUSIVE_SAFE_HOOK_DEFAULT_ASSERT(!safemode_or_autounlink || node_algorithms::inited(to_insert));
-      BOOST_IF_CONSTEXPR(cache_last){
-         if(this->empty()){
-            this->set_last_node(to_insert);
-         }
-      }
-      node_algorithms::link_after(this->get_root_node(), to_insert);
-      this->priv_size_traits().increment();
-   }
-
-   //! <b>Requires</b>: value must be an lvalue.
-   //!
-   //! <b>Effects</b>: Inserts the value in the back of the list.
-   //!   No copy constructors are called.
-   //!
-   //! <b>Throws</b>: Nothing.
-   //!
-   //! <b>Complexity</b>: Constant.
-   //!
-   //! <b>Note</b>: Does not affect the validity of iterators and references.
-   //!   This function is only available is cache_last<> is true.
-   void push_back(reference value) BOOST_NOEXCEPT
-   {
-      BOOST_STATIC_ASSERT((cache_last));
-      node_ptr n = priv_value_traits().to_node_ptr(value);
-      BOOST_INTRUSIVE_SAFE_HOOK_DEFAULT_ASSERT(!safemode_or_autounlink || node_algorithms::inited(n));
-      node_algorithms::link_after(this->get_last_node(), n);
-      BOOST_IF_CONSTEXPR(cache_last){
-         this->set_last_node(n);
-      }
-      this->priv_size_traits().increment();
-   }
-
-   //! <b>Effects</b>: Erases the first element of the list.
-   //!   No destructors are called.
-   //!
-   //! <b>Throws</b>: Nothing.
-   //!
-   //! <b>Complexity</b>: Constant.
-   //!
-   //! <b>Note</b>: Invalidates the iterators (but not the references) to the erased element.
-   void pop_front() BOOST_NOEXCEPT
-   {  return this->pop_front_and_dispose(detail::null_disposer());   }
-
-   //! <b>Requires</b>: Disposer::operator()(pointer) shouldn't throw.
-   //!
-   //! <b>Effects</b>: Erases the first element of the list.
-   //!   Disposer::operator()(pointer) is called for the removed element.
-   //!
-   //! <b>Throws</b>: Nothing.
-   //!
-   //! <b>Complexity</b>: Constant.
-   //!
-   //! <b>Note</b>: Invalidates the iterators to the erased element.
-   template<class Disposer>
-   void pop_front_and_dispose(Disposer disposer) BOOST_NOEXCEPT
-   {
-      node_ptr to_erase = node_traits::get_next(this->get_root_node());
-      node_algorithms::unlink_after(this->get_root_node());
-      this->priv_size_traits().decrement();
-      BOOST_IF_CONSTEXPR(safemode_or_autounlink)
-         node_algorithms::init(to_erase);
-      disposer(priv_value_traits().to_value_ptr(to_erase));
-      BOOST_IF_CONSTEXPR(cache_last){
-         if(this->empty()){
-            this->set_last_node(this->get_root_node());
-         }
-      }
-   }
-
-   //! <b>Effects</b>: Returns a reference to the first element of the list.
-   //!
-   //! <b>Throws</b>: Nothing.
-   //!
-   //! <b>Complexity</b>: Constant.
-   BOOST_INTRUSIVE_FORCEINLINE reference front() BOOST_NOEXCEPT
-   { return *this->priv_value_traits().to_value_ptr(node_traits::get_next(this->get_root_node())); }
-
-   //! <b>Effects</b>: Returns a const_reference to the first element of the list.
-   //!
-   //! <b>Throws</b>: Nothing.
-   //!
-   //! <b>Complexity</b>: Constant.
-   BOOST_INTRUSIVE_FORCEINLINE const_reference front() const BOOST_NOEXCEPT
-   { return *this->priv_value_traits().to_value_ptr(detail::uncast(node_traits::get_next(this->get_root_node()))); }
-
-   //! <b>Effects</b>: Returns a reference to the last element of the list.
-   //!
-   //! <b>Throws</b>: Nothing.
-   //!
-   //! <b>Complexity</b>: Constant.
-   //!
-   //! <b>Note</b>: Does not affect the validity of iterators and references.
-   //!   This function is only available is cache_last<> is true.
-   reference back() BOOST_NOEXCEPT
-   {
-      BOOST_STATIC_ASSERT((cache_last));
-      return *this->priv_value_traits().to_value_ptr(this->get_last_node());
-   }
-
-   //! <b>Effects</b>: Returns a const_reference to the last element of the list.
-   //!
-   //! <b>Throws</b>: Nothing.
-   //!
-   //! <b>Complexity</b>: Constant.
-   //!
-   //! <b>Note</b>: Does not affect the validity of iterators and references.
-   //!   This function is only available is cache_last<> is true.
-   BOOST_INTRUSIVE_FORCEINLINE const_reference back() const BOOST_NOEXCEPT
-   {
-      BOOST_STATIC_ASSERT((cache_last));
-      return *this->priv_value_traits().to_value_ptr(this->get_last_node());
-   }
-
-   //! <b>Effects</b>: Returns an iterator to the first element contained in the list.
-   //!
-   //! <b>Throws</b>: Nothing.
-   //!
-   //! <b>Complexity</b>: Constant.
-   BOOST_INTRUSIVE_FORCEINLINE iterator begin() BOOST_NOEXCEPT
-   { return iterator (node_traits::get_next(this->get_root_node()), this->priv_value_traits_ptr()); }
-
-   //! <b>Effects</b>: Returns a const_iterator to the first element contained in the list.
-   //!
-   //! <b>Throws</b>: Nothing.
-   //!
-   //! <b>Complexity</b>: Constant.
-   BOOST_INTRUSIVE_FORCEINLINE const_iterator begin() const BOOST_NOEXCEPT
-   { return const_iterator (node_traits::get_next(this->get_root_node()), this->priv_value_traits_ptr()); }
-
-   //! <b>Effects</b>: Returns a const_iterator to the first element contained in the list.
-   //!
-   //! <b>Throws</b>: Nothing.
-   //!
-   //! <b>Complexity</b>: Constant.
-   BOOST_INTRUSIVE_FORCEINLINE const_iterator cbegin() const BOOST_NOEXCEPT
-   { return const_iterator(node_traits::get_next(this->get_root_node()), this->priv_value_traits_ptr()); }
-
-   //! <b>Effects</b>: Returns an iterator to the end of the list.
-   //!
-   //! <b>Throws</b>: Nothing.
-   //!
-   //! <b>Complexity</b>: Constant.
-   BOOST_INTRUSIVE_FORCEINLINE iterator end() BOOST_NOEXCEPT
-   { return iterator(this->get_end_node(), this->priv_value_traits_ptr()); }
-
-   //! <b>Effects</b>: Returns a const_iterator to the end of the list.
-   //!
-   //! <b>Throws</b>: Nothing.
-   //!
-   //! <b>Complexity</b>: Constant.
-   BOOST_INTRUSIVE_FORCEINLINE const_iterator end() const BOOST_NOEXCEPT
-   { return const_iterator(detail::uncast(this->get_end_node()), this->priv_value_traits_ptr()); }
-
-   //! <b>Effects</b>: Returns a const_iterator to the end of the list.
-   //!
-   //! <b>Throws</b>: Nothing.
-   //!
-   //! <b>Complexity</b>: Constant.
-   BOOST_INTRUSIVE_FORCEINLINE const_iterator cend() const BOOST_NOEXCEPT
-   { return this->end(); }
-
-   //! <b>Effects</b>: Returns an iterator that points to a position
-   //!   before the first element. Equivalent to "end()"
-   //!
-   //! <b>Throws</b>: Nothing.
-   //!
-   //! <b>Complexity</b>: Constant.
-   BOOST_INTRUSIVE_FORCEINLINE iterator before_begin() BOOST_NOEXCEPT
-   { return iterator(this->get_root_node(), this->priv_value_traits_ptr()); }
-
-   //! <b>Effects</b>: Returns an iterator that points to a position
-   //!   before the first element. Equivalent to "end()"
-   //!
-   //! <b>Throws</b>: Nothing.
-   //!
-   //! <b>Complexity</b>: Constant.
-   BOOST_INTRUSIVE_FORCEINLINE const_iterator before_begin() const BOOST_NOEXCEPT
-   { return const_iterator(detail::uncast(this->get_root_node()), this->priv_value_traits_ptr()); }
-
-   //! <b>Effects</b>: Returns an iterator that points to a position
-   //!   before the first element. Equivalent to "end()"
-   //!
-   //! <b>Throws</b>: Nothing.
-   //!
-   //! <b>Complexity</b>: Constant.
-   BOOST_INTRUSIVE_FORCEINLINE const_iterator cbefore_begin() const BOOST_NOEXCEPT
-   { return this->before_begin(); }
-
-   //! <b>Effects</b>: Returns an iterator to the last element contained in the list.
-   //!
-   //! <b>Throws</b>: Nothing.
-   //!
-   //! <b>Complexity</b>: Constant.
-   //!
-   //! <b>Note</b>: This function is present only if cached_last<> option is true.
-   BOOST_INTRUSIVE_FORCEINLINE iterator last() BOOST_NOEXCEPT
-   {
-      //This function shall not be used if cache_last is not true
-      BOOST_INTRUSIVE_INVARIANT_ASSERT(cache_last);
-      return iterator (this->get_last_node(), this->priv_value_traits_ptr());
-   }
-
-   //! <b>Effects</b>: Returns a const_iterator to the last element contained in the list.
-   //!
-   //! <b>Throws</b>: Nothing.
-   //!
-   //! <b>Complexity</b>: Constant.
-   //!
-   //! <b>Note</b>: This function is present only if cached_last<> option is true.
-   BOOST_INTRUSIVE_FORCEINLINE const_iterator last() const BOOST_NOEXCEPT
-   {
-      //This function shall not be used if cache_last is not true
-      BOOST_INTRUSIVE_INVARIANT_ASSERT(cache_last);
-      return const_iterator (this->get_last_node(), this->priv_value_traits_ptr());
-   }
-
-   //! <b>Effects</b>: Returns a const_iterator to the last element contained in the list.
-   //!
-   //! <b>Throws</b>: Nothing.
-   //!
-   //! <b>Complexity</b>: Constant.
-   //!
-   //! <b>Note</b>: This function is present only if cached_last<> option is true.
-   BOOST_INTRUSIVE_FORCEINLINE const_iterator clast() const BOOST_NOEXCEPT
-   { return const_iterator(this->get_last_node(), this->priv_value_traits_ptr()); }
-
-   //! <b>Precondition</b>: end_iterator must be a valid end iterator
-   //!   of slist.
-   //!
-   //! <b>Effects</b>: Returns a const reference to the slist associated to the end iterator
-   //!
-   //! <b>Throws</b>: Nothing.
-   //!
-   //! <b>Complexity</b>: Constant.
-   BOOST_INTRUSIVE_FORCEINLINE static slist_impl &container_from_end_iterator(iterator end_iterator) BOOST_NOEXCEPT
-   {  return slist_impl::priv_container_from_end_iterator(end_iterator);   }
-
-   //! <b>Precondition</b>: end_iterator must be a valid end const_iterator
-   //!   of slist.
-   //!
-   //! <b>Effects</b>: Returns a const reference to the slist associated to the end iterator
-   //!
-   //! <b>Throws</b>: Nothing.
-   //!
-   //! <b>Complexity</b>: Constant.
-   BOOST_INTRUSIVE_FORCEINLINE static const slist_impl &container_from_end_iterator(const_iterator end_iterator) BOOST_NOEXCEPT
-   {  return slist_impl::priv_container_from_end_iterator(end_iterator);   }
-
-   //! <b>Effects</b>: Returns the number of the elements contained in the list.
-   //!
-   //! <b>Throws</b>: Nothing.
-   //!
-   //! <b>Complexity</b>: Linear to the number of elements contained in the list.
-   //!   if constant_time_size is false. Constant time otherwise.
-   //!
-   //! <b>Note</b>: Does not affect the validity of iterators and references.
-   BOOST_INTRUSIVE_FORCEINLINE size_type size() const BOOST_NOEXCEPT
-   {
-      BOOST_IF_CONSTEXPR(constant_time_size)
-         return this->priv_size_traits().get_size();
-      else
-         return node_algorithms::count(this->get_root_node()) - 1;
-   }
-
-   //! <b>Effects</b>: Returns true if the list contains no elements.
-   //!
-   //! <b>Throws</b>: Nothing.
-   //!
-   //! <b>Complexity</b>: Constant.
-   //!
-   //! <b>Note</b>: Does not affect the validity of iterators and references.
-   BOOST_INTRUSIVE_FORCEINLINE bool empty() const BOOST_NOEXCEPT
-   {  return node_algorithms::is_empty(this->get_root_node()); }
-
-   //! <b>Effects</b>: Swaps the elements of x and *this.
-   //!
-   //! <b>Throws</b>: Nothing.
-   //!
-   //! <b>Complexity</b>: Linear to the number of elements of both lists.
-   //!  Constant-time if linear<> and/or cache_last<> options are used.
-   //!
-   //! <b>Note</b>: Does not affect the validity of iterators and references.
-   void swap(slist_impl& other)
-   {
-      BOOST_IF_CONSTEXPR(cache_last){
-         priv_swap_cache_last(this, &other);
-      }
-      else{
-         this->priv_swap_lists(this->get_root_node(), other.get_root_node(), detail::bool_<linear>());
-      }
-      this->priv_size_traits().swap(other.priv_size_traits());
-   }
-
-   //! <b>Effects</b>: Moves backwards all the elements, so that the first
-   //!   element becomes the second, the second becomes the third...
-   //!   the last element becomes the first one.
-   //!
-   //! <b>Throws</b>: Nothing.
-   //!
-   //! <b>Complexity</b>: Linear to the number of elements plus the number shifts.
-   //!
-   //! <b>Note</b>: Iterators Does not affect the validity of iterators and references.
-   void shift_backwards(size_type n = 1) BOOST_NOEXCEPT
-   {  this->priv_shift_backwards(n, detail::bool_<linear>());  }
-
-   //! <b>Effects</b>: Moves forward all the elements, so that the second
-   //!   element becomes the first, the third becomes the second...
-   //!   the first element becomes the last one.
-   //!
-   //! <b>Throws</b>: Nothing.
-   //!
-   //! <b>Complexity</b>: Linear to the number of elements plus the number shifts.
-   //!
-   //! <b>Note</b>: Does not affect the validity of iterators and references.
-   void shift_forward(size_type n = 1) BOOST_NOEXCEPT
-   {  this->priv_shift_forward(n, detail::bool_<linear>()); }
-
-   //! <b>Requires</b>: Disposer::operator()(pointer) shouldn't throw.
-   //!   Cloner should yield to nodes equivalent to the original nodes.
-   //!
-   //! <b>Effects</b>: Erases all the elements from *this
-   //!   calling Disposer::operator()(pointer), clones all the
-   //!   elements from src calling Cloner::operator()(const_reference )
-   //!   and inserts them on *this.
-   //!
-   //!   If cloner throws, all cloned elements are unlinked and disposed
-   //!   calling Disposer::operator()(pointer).
-   //!
-   //! <b>Complexity</b>: Linear to erased plus inserted elements.
-   //!
-   //! <b>Throws</b>: If cloner throws.
-   template <class Cloner, class Disposer>
-   void clone_from(const slist_impl &src, Cloner cloner, Disposer disposer)
-   {
-      this->clear_and_dispose(disposer);
-      detail::exception_disposer<slist_impl, Disposer>
-         rollback(*this, disposer);
-      const_iterator prev(this->cbefore_begin());
-      const_iterator b(src.begin()), e(src.end());
-      for(; b != e; ++b){
-         prev = this->insert_after(prev, *cloner(*b));
-      }
-      rollback.release();
-   }
-
-   //! <b>Requires</b>: Disposer::operator()(pointer) shouldn't throw.
-   //!   Cloner should yield to nodes equivalent to the original nodes.
-   //!
-   //! <b>Effects</b>: Erases all the elements from *this
-   //!   calling Disposer::operator()(pointer), clones all the
-   //!   elements from src calling Cloner::operator()(reference)
-   //!   and inserts them on *this.
-   //!
-   //!   If cloner throws, all cloned elements are unlinked and disposed
-   //!   calling Disposer::operator()(pointer).
-   //!
-   //! <b>Complexity</b>: Linear to erased plus inserted elements.
-   //!
-   //! <b>Throws</b>: If cloner throws.
-   template <class Cloner, class Disposer>
-   void clone_from(BOOST_RV_REF(slist_impl) src, Cloner cloner, Disposer disposer)
-   {
-      this->clear_and_dispose(disposer);
-      detail::exception_disposer<slist_impl, Disposer>
-         rollback(*this, disposer);
-      iterator prev(this->cbefore_begin());
-      iterator b(src.begin()), e(src.end());
-      for(; b != e; ++b){
-         prev = this->insert_after(prev, *cloner(*b));
-      }
-      rollback.release();
-   }
-
-   //! <b>Requires</b>: value must be an lvalue and prev_p must point to an element
-   //!   contained by the list or to end().
-   //!
-   //! <b>Effects</b>: Inserts the value after the position pointed by prev_p.
-   //!    No copy constructor is called.
-   //!
-   //! <b>Returns</b>: An iterator to the inserted element.
-   //!
-   //! <b>Throws</b>: Nothing.
-   //!
-   //! <b>Complexity</b>: Constant.
-   //!
-   //! <b>Note</b>: Does not affect the validity of iterators and references.
-   iterator insert_after(const_iterator prev_p, reference value) BOOST_NOEXCEPT
-   {
-      node_ptr n = priv_value_traits().to_node_ptr(value);
-      BOOST_INTRUSIVE_SAFE_HOOK_DEFAULT_ASSERT(!safemode_or_autounlink || node_algorithms::inited(n));
-      node_ptr prev_n(prev_p.pointed_node());
-      node_algorithms::link_after(prev_n, n);
-      if(cache_last && (this->get_last_node() == prev_n)){
-         this->set_last_node(n);
-      }
-      this->priv_size_traits().increment();
-      return iterator (n, this->priv_value_traits_ptr());
-   }
-
-   //! <b>Requires</b>: Dereferencing iterator must yield
-   //!   an lvalue of type value_type and prev_p must point to an element
-   //!   contained by the list or to the end node.
-   //!
-   //! <b>Effects</b>: Inserts the [f, l)
-   //!   after the position prev_p.
-   //!
-   //! <b>Throws</b>: Nothing.
-   //!
-   //! <b>Complexity</b>: Linear to the number of elements inserted.
-   //!
-   //! <b>Note</b>: Does not affect the validity of iterators and references.
-   template<class Iterator>
-   void insert_after(const_iterator prev_p, Iterator f, Iterator l) BOOST_NOEXCEPT
-   {
-      //Insert first nodes avoiding cache and size checks
-      size_type count = 0;
-      node_ptr prev_n(prev_p.pointed_node());
-      for (; f != l; ++f, ++count){
-         const node_ptr n = priv_value_traits().to_node_ptr(*f);
-         BOOST_INTRUSIVE_SAFE_HOOK_DEFAULT_ASSERT(!safemode_or_autounlink || node_algorithms::inited(n));
-         node_algorithms::link_after(prev_n, n);
-         prev_n = n;
-      }
-      //Now fix special cases if needed
-      if(cache_last && (this->get_last_node() == prev_p.pointed_node())){
-         this->set_last_node(prev_n);
-      }
-      BOOST_IF_CONSTEXPR(constant_time_size){
-         this->priv_size_traits().increase(count);
-      }
-   }
-
-   //! <b>Requires</b>: value must be an lvalue and p must point to an element
-   //!   contained by the list or to end().
-   //!
-   //! <b>Effects</b>: Inserts the value before the position pointed by p.
-   //!   No copy constructor is called.
-   //!
-   //! <b>Throws</b>: Nothing.
-   //!
-   //! <b>Complexity</b>: Linear to the number of elements before p.
-   //!  Constant-time if cache_last<> is true and p == end().
-   //!
-   //! <b>Note</b>: Does not affect the validity of iterators and references.
-   iterator insert(const_iterator p, reference value) BOOST_NOEXCEPT
-   {  return this->insert_after(this->previous(p), value);  }
-
-   //! <b>Requires</b>: Dereferencing iterator must yield
-   //!   an lvalue of type value_type and p must point to an element
-   //!   contained by the list or to the end node.
-   //!
-   //! <b>Effects</b>: Inserts the pointed by b and e
-   //!   before the position p. No copy constructors are called.
-   //!
-   //! <b>Throws</b>: Nothing.
-   //!
-   //! <b>Complexity</b>: Linear to the number of elements inserted plus linear
-   //!   to the elements before b.
-   //!   Linear to the number of elements to insert if cache_last<> option is true and p == end().
-   //!
-   //! <b>Note</b>: Does not affect the validity of iterators and references.
-   template<class Iterator>
-   void insert(const_iterator p, Iterator b, Iterator e) BOOST_NOEXCEPT
-   {  return this->insert_after(this->previous(p), b, e);  }
-
-   //! <b>Effects</b>: Erases the element after the element pointed by prev of
-   //!   the list. No destructors are called.
-   //!
-   //! <b>Returns</b>: the first element remaining beyond the removed elements,
-   //!   or end() if no such element exists.
-   //!
-   //! <b>Throws</b>: Nothing.
-   //!
-   //! <b>Complexity</b>: Constant.
-   //!
-   //! <b>Note</b>: Invalidates the iterators (but not the references) to the
-   //!   erased element.
-   iterator erase_after(const_iterator prev) BOOST_NOEXCEPT
-   {  return this->erase_after_and_dispose(prev, detail::null_disposer());  }
-
-   //! <b>Effects</b>: Erases the range (before_f, l) from
-   //!   the list. No destructors are called.
-   //!
-   //! <b>Returns</b>: the first element remaining beyond the removed elements,
-   //!   or end() if no such element exists.
-   //!
-   //! <b>Throws</b>: Nothing.
-   //!
-   //! <b>Complexity</b>: Linear to the number of erased elements if it's a safe-mode
-   //!   , auto-unlink value or constant-time size is activated. Constant time otherwise.
-   //!
-   //! <b>Note</b>: Invalidates the iterators (but not the references) to the
-   //!   erased element.
-   iterator erase_after(const_iterator before_f, const_iterator l) BOOST_NOEXCEPT
-   {
-      BOOST_IF_CONSTEXPR(safemode_or_autounlink || constant_time_size){
-         return this->erase_after_and_dispose(before_f, l, detail::null_disposer());
-      }
-      else{
-         const node_ptr bfp = before_f.pointed_node();
-         const node_ptr lp = l.pointed_node();
-         BOOST_IF_CONSTEXPR(cache_last){
-            if(lp == this->get_end_node()){
-               this->set_last_node(bfp);
-            }
-         }
-         node_algorithms::unlink_after(bfp, lp);
-         return l.unconst();
-      }
-   }
-
-   //! <b>Effects</b>: Erases the range (before_f, l) from
-   //!   the list. n must be distance(before_f, l) - 1.
-   //!   No destructors are called.
-   //!
-   //! <b>Returns</b>: the first element remaining beyond the removed elements,
-   //!   or end() if no such element exists.
-   //!
-   //! <b>Throws</b>: Nothing.
-   //!
-   //! <b>Complexity</b>: constant-time if link_mode is normal_link.
-   //!   Linear to the elements (l - before_f) otherwise.
-   //!
-   //! <b>Note</b>: Invalidates the iterators (but not the references) to the
-   //!   erased element.
-   iterator erase_after(const_iterator before_f, const_iterator l, size_type n) BOOST_NOEXCEPT
-   {
-      BOOST_INTRUSIVE_INVARIANT_ASSERT(node_algorithms::distance((++const_iterator(before_f)).pointed_node(), l.pointed_node()) == n);
-      (void)n;
-      BOOST_IF_CONSTEXPR(safemode_or_autounlink){
-         return this->erase_after(before_f, l);
-      }
-      else{
-         const node_ptr bfp = before_f.pointed_node();
-         const node_ptr lp = l.pointed_node();
-         BOOST_IF_CONSTEXPR(cache_last){
-            if((lp == this->get_end_node())){
-               this->set_last_node(bfp);
-            }
-         }
-         node_algorithms::unlink_after(bfp, lp);
-         BOOST_IF_CONSTEXPR(constant_time_size){
-            this->priv_size_traits().decrease(n);
-         }
-         return l.unconst();
-      }
-   }
-
-   //! <b>Effects</b>: Erases the element pointed by i of the list.
-   //!   No destructors are called.
-   //!
-   //! <b>Returns</b>: the first element remaining beyond the removed element,
-   //!   or end() if no such element exists.
-   //!
-   //! <b>Throws</b>: Nothing.
-   //!
-   //! <b>Complexity</b>: Linear to the elements before i.
-   //!
-   //! <b>Note</b>: Invalidates the iterators (but not the references) to the
-   //!   erased element.
-   iterator erase(const_iterator i) BOOST_NOEXCEPT
-   {  return this->erase_after(this->previous(i));  }
-
-   //! <b>Requires</b>: f and l must be valid iterator to elements in *this.
-   //!
-   //! <b>Effects</b>: Erases the range pointed by b and e.
-   //!   No destructors are called.
-   //!
-   //! <b>Returns</b>: the first element remaining beyond the removed elements,
-   //!   or end() if no such element exists.
-   //!
-   //! <b>Throws</b>: Nothing.
-   //!
-   //! <b>Complexity</b>: Linear to the elements before l.
-   //!
-   //! <b>Note</b>: Invalidates the iterators (but not the references) to the
-   //!   erased elements.
-   iterator erase(const_iterator f, const_iterator l) BOOST_NOEXCEPT
-   {  return this->erase_after(this->previous(f), l);  }
-
-   //! <b>Effects</b>: Erases the range [f, l) from
-   //!   the list. n must be distance(f, l).
-   //!   No destructors are called.
-   //!
-   //! <b>Returns</b>: the first element remaining beyond the removed elements,
-   //!   or end() if no such element exists.
-   //!
-   //! <b>Throws</b>: Nothing.
-   //!
-   //! <b>Complexity</b>: linear to the elements before f if link_mode is normal_link
-   //!   and constant_time_size is activated. Linear to the elements before l otherwise.
-   //!
-   //! <b>Note</b>: Invalidates the iterators (but not the references) to the
-   //!   erased element.
-   iterator erase(const_iterator f, const_iterator l, size_type n) BOOST_NOEXCEPT
-   {  return this->erase_after(this->previous(f), l, n);  }
-
-   //! <b>Requires</b>: Disposer::operator()(pointer) shouldn't throw.
-   //!
-   //! <b>Effects</b>: Erases the element after the element pointed by prev of
-   //!   the list.
-   //!   Disposer::operator()(pointer) is called for the removed element.
-   //!
-   //! <b>Returns</b>: the first element remaining beyond the removed elements,
-   //!   or end() if no such element exists.
-   //!
-   //! <b>Throws</b>: Nothing.
-   //!
-   //! <b>Complexity</b>: Constant.
-   //!
-   //! <b>Note</b>: Invalidates the iterators to the erased element.
-   template<class Disposer>
-   iterator erase_after_and_dispose(const_iterator prev, Disposer disposer) BOOST_NOEXCEPT
-   {
-      const_iterator it(prev);
-      ++it;
-      node_ptr to_erase(it.pointed_node());
-      ++it;
-      node_ptr prev_n(prev.pointed_node());
-      node_algorithms::unlink_after(prev_n);
-      if(cache_last && (to_erase == this->get_last_node())){
-         this->set_last_node(prev_n);
-      }
-      BOOST_IF_CONSTEXPR(safemode_or_autounlink)
-         node_algorithms::init(to_erase);
-      disposer(priv_value_traits().to_value_ptr(to_erase));
-      this->priv_size_traits().decrement();
-      return it.unconst();
-   }
-
-   /// @cond
-
-   static iterator s_insert_after(const_iterator const prev_p, reference value) BOOST_NOEXCEPT
-   {
-      BOOST_STATIC_ASSERT(((!cache_last)&&(!constant_time_size)&&(!stateful_value_traits)));
-      node_ptr const n = value_traits::to_node_ptr(value);
-      BOOST_INTRUSIVE_SAFE_HOOK_DEFAULT_ASSERT(!safemode_or_autounlink || node_algorithms::inited(n));
-      node_algorithms::link_after(prev_p.pointed_node(), n);
-      return iterator (n, const_value_traits_ptr());
-   }
-
-   template<class Disposer>
-   static iterator s_erase_after_and_dispose(const_iterator prev, Disposer disposer) BOOST_NOEXCEPT
-   {
-      BOOST_STATIC_ASSERT(((!cache_last)&&(!constant_time_size)&&(!stateful_value_traits)));
-      const_iterator it(prev);
-      ++it;
-      node_ptr to_erase(it.pointed_node());
-      ++it;
-      node_ptr prev_n(prev.pointed_node());
-      node_algorithms::unlink_after(prev_n);
-      BOOST_IF_CONSTEXPR(safemode_or_autounlink)
-         node_algorithms::init(to_erase);
-      disposer(value_traits::to_value_ptr(to_erase));
-      return it.unconst();
-   }
-
-   template<class Disposer>
-   static iterator s_erase_after_and_dispose(const_iterator before_f, const_iterator l, Disposer disposer) BOOST_NOEXCEPT
-   {
-      BOOST_STATIC_ASSERT(((!cache_last)&&(!constant_time_size)&&(!stateful_value_traits)));
-      node_ptr bfp(before_f.pointed_node()), lp(l.pointed_node());
-      node_ptr fp(node_traits::get_next(bfp));
-      node_algorithms::unlink_after(bfp, lp);
-      while(fp != lp){
-         node_ptr to_erase(fp);
-         fp = node_traits::get_next(fp);
-         BOOST_IF_CONSTEXPR(safemode_or_autounlink)
-            node_algorithms::init(to_erase);
-         disposer(value_traits::to_value_ptr(to_erase));
-      }
-      return l.unconst();
-   }
-
-   static iterator s_erase_after(const_iterator prev) BOOST_NOEXCEPT
-   {  return s_erase_after_and_dispose(prev, detail::null_disposer());  }
-
-   /// @endcond
-
-   //! <b>Requires</b>: Disposer::operator()(pointer) shouldn't throw.
-   //!
-   //! <b>Effects</b>: Erases the range (before_f, l) from
-   //!   the list.
-   //!   Disposer::operator()(pointer) is called for the removed elements.
-   //!
-   //! <b>Returns</b>: the first element remaining beyond the removed elements,
-   //!   or end() if no such element exists.
-   //!
-   //! <b>Throws</b>: Nothing.
-   //!
-   //! <b>Complexity</b>: Linear to the elements (l - before_f + 1).
-   //!
-   //! <b>Note</b>: Invalidates the iterators to the erased element.
-   template<class Disposer>
-   iterator erase_after_and_dispose(const_iterator before_f, const_iterator l, Disposer disposer) BOOST_NOEXCEPT
-   {
-      node_ptr bfp(before_f.pointed_node()), lp(l.pointed_node());
-      node_ptr fp(node_traits::get_next(bfp));
-      node_algorithms::unlink_after(bfp, lp);
-      while(fp != lp){
-         node_ptr to_erase(fp);
-         fp = node_traits::get_next(fp);
-         BOOST_IF_CONSTEXPR(safemode_or_autounlink)
-            node_algorithms::init(to_erase);
-         disposer(priv_value_traits().to_value_ptr(to_erase));
-         this->priv_size_traits().decrement();
-      }
-      if(cache_last && (node_traits::get_next(bfp) == this->get_end_node())){
-         this->set_last_node(bfp);
-      }
-      return l.unconst();
-   }
-
-   //! <b>Requires</b>: Disposer::operator()(pointer) shouldn't throw.
-   //!
-   //! <b>Effects</b>: Erases the element pointed by i of the list.
-   //!   No destructors are called.
-   //!   Disposer::operator()(pointer) is called for the removed element.
-   //!
-   //! <b>Returns</b>: the first element remaining beyond the removed element,
-   //!   or end() if no such element exists.
-   //!
-   //! <b>Throws</b>: Nothing.
-   //!
-   //! <b>Complexity</b>: Linear to the elements before i.
-   //!
-   //! <b>Note</b>: Invalidates the iterators (but not the references) to the
-   //!   erased element.
-   template<class Disposer>
-   iterator erase_and_dispose(const_iterator i, Disposer disposer) BOOST_NOEXCEPT
-   {  return this->erase_after_and_dispose(this->previous(i), disposer);  }
-
-   #if !defined(BOOST_INTRUSIVE_DOXYGEN_INVOKED)
-   template<class Disposer>
-   iterator erase_and_dispose(iterator i, Disposer disposer) BOOST_NOEXCEPT
-   {  return this->erase_and_dispose(const_iterator(i), disposer);   }
-   #endif
-
-   //! <b>Requires</b>: f and l must be valid iterator to elements in *this.
-   //!                  Disposer::operator()(pointer) shouldn't throw.
-   //!
-   //! <b>Effects</b>: Erases the range pointed by b and e.
-   //!   No destructors are called.
-   //!   Disposer::operator()(pointer) is called for the removed elements.
-   //!
-   //! <b>Returns</b>: the first element remaining beyond the removed elements,
-   //!   or end() if no such element exists.
-   //!
-   //! <b>Throws</b>: Nothing.
-   //!
-   //! <b>Complexity</b>: Linear to the number of erased elements plus linear
-   //!   to the elements before f.
-   //!
-   //! <b>Note</b>: Invalidates the iterators (but not the references) to the
-   //!   erased elements.
-   template<class Disposer>
-   iterator erase_and_dispose(const_iterator f, const_iterator l, Disposer disposer) BOOST_NOEXCEPT
-   {  return this->erase_after_and_dispose(this->previous(f), l, disposer);  }
-
-   //! <b>Requires</b>: Dereferencing iterator must yield
-   //!   an lvalue of type value_type.
-   //!
-   //! <b>Effects</b>: Clears the list and inserts the range pointed by b and e.
-   //!   No destructors or copy constructors are called.
-   //!
-   //! <b>Throws</b>: Nothing.
-   //!
-   //! <b>Complexity</b>: Linear to the number of elements inserted plus
-   //!   linear to the elements contained in the list if it's a safe-mode
-   //!   or auto-unlink value.
-   //!   Linear to the number of elements inserted in the list otherwise.
-   //!
-   //! <b>Note</b>: Invalidates the iterators (but not the references)
-   //!   to the erased elements.
-   template<class Iterator>
-   void assign(Iterator b, Iterator e)
-   {
-      this->clear();
-      this->insert_after(this->cbefore_begin(), b, e);
-   }
-
-   //! <b>Requires</b>: Disposer::operator()(pointer) shouldn't throw.
-   //!
-   //! <b>Requires</b>: Dereferencing iterator must yield
-   //!   an lvalue of type value_type.
-   //!
-   //! <b>Effects</b>: Clears the list and inserts the range pointed by b and e.
-   //!   No destructors or copy constructors are called.
-   //!   Disposer::operator()(pointer) is called for the removed elements.
-   //!
-   //! <b>Throws</b>: Nothing.
-   //!
-   //! <b>Complexity</b>: Linear to the number of elements inserted plus
-   //!   linear to the elements contained in the list.
-   //!
-   //! <b>Note</b>: Invalidates the iterators (but not the references)
-   //!   to the erased elements.
-   template<class Iterator, class Disposer>
-   void dispose_and_assign(Disposer disposer, Iterator b, Iterator e)
-   {
-      this->clear_and_dispose(disposer);
-      this->insert_after(this->cbefore_begin(), b, e, disposer);
-   }
-
-   //! <b>Requires</b>: prev must point to an element contained by this list or
-   //!   to the before_begin() element
-   //!
-   //! <b>Effects</b>: Transfers all the elements of list x to this list, after the
-   //! the element pointed by prev. No destructors or copy constructors are called.
-   //!
-   //! <b>Returns</b>: Nothing.
-   //!
-   //! <b>Throws</b>: Nothing.
-   //!
-   //! <b>Complexity</b>: In general, linear to the elements contained in x.
-   //!   Constant-time if cache_last<> option is true and also constant-time if
-   //!   linear<> option is true "this" is empty and "l" is not used.
-   //!
-   //! <b>Note</b>: Iterators of values obtained from list x now point to elements of this
-   //! list. Iterators of this list and all the references are not invalidated.
-   //!
-   //! <b>Additional note</b>: If the optional parameter "l" is provided, it will be
-   //!   assigned to the last spliced element or prev if x is empty.
-   //!   This iterator can be used as new "prev" iterator for a new splice_after call.
-   //!   that will splice new values after the previously spliced values.
-   void splice_after(const_iterator prev, slist_impl &x, const_iterator *l = 0) BOOST_NOEXCEPT
-   {
-      if(x.empty()){
-         if(l) *l = prev;
-      }
-      else if(linear && this->empty()){
-         this->swap(x);
-         if(l) *l = this->previous(this->cend());
-      }
-      else{
-         const_iterator last_x(x.previous(x.end()));  //constant time if cache_last is active
-         node_ptr prev_n(prev.pointed_node());
-         node_ptr last_x_n(last_x.pointed_node());
-         BOOST_IF_CONSTEXPR(cache_last){
-            x.set_last_node(x.get_root_node());
-            if(node_traits::get_next(prev_n) == this->get_end_node()){
-               this->set_last_node(last_x_n);
-            }
-         }
-         node_algorithms::transfer_after( prev_n, x.before_begin().pointed_node(), last_x_n);
-         this->priv_size_traits().increase(x.priv_size_traits().get_size());
-         x.priv_size_traits().set_size(size_type(0));
-         if(l) *l = last_x;
-      }
-   }
-
-   //! <b>Requires</b>: prev must point to an element contained by this list or
-   //!   to the before_begin() element. prev_ele must point to an element contained in list
-   //!   x or must be x.before_begin().
-   //!
-   //! <b>Effects</b>: Transfers the element after prev_ele, from list x to this list,
-   //!   after the element pointed by prev. No destructors or copy constructors are called.
-   //!
-   //! <b>Throws</b>: Nothing.
-   //!
-   //! <b>Complexity</b>: Constant.
-   //!
-   //! <b>Note</b>: Iterators of values obtained from list x now point to elements of this
-   //! list. Iterators of this list and all the references are not invalidated.
-   void splice_after(const_iterator prev_pos, slist_impl &x, const_iterator prev_ele) BOOST_NOEXCEPT
-   {
-      const_iterator elem = prev_ele;
-      this->splice_after(prev_pos, x, prev_ele, ++elem, 1);
-   }
-
-   //! <b>Requires</b>: prev_pos must be a dereferenceable iterator in *this or be
-   //!   before_begin(), and before_f and before_l belong to x and
-   //!   ++before_f != x.end() && before_l != x.end().
-   //!
-   //! <b>Effects</b>: Transfers the range (before_f, before_l] from list x to this
-   //!   list, after the element pointed by prev_pos.
-   //!   No destructors or copy constructors are called.
-   //!
-   //! <b>Throws</b>: Nothing.
-   //!
-   //! <b>Complexity</b>: Linear to the number of elements transferred
-   //!   if constant_time_size is true. Constant-time otherwise.
-   //!
-   //! <b>Note</b>: Iterators of values obtained from list x now point to elements of this
-   //!   list. Iterators of this list and all the references are not invalidated.
-   void splice_after(const_iterator prev_pos, slist_impl &x, const_iterator before_f, const_iterator before_l) BOOST_NOEXCEPT
-   {
-      BOOST_IF_CONSTEXPR(constant_time_size)
-         this->splice_after(prev_pos, x, before_f, before_l, node_algorithms::distance(before_f.pointed_node(), before_l.pointed_node()));
-      else
-         this->priv_splice_after
-            (prev_pos.pointed_node(), x, before_f.pointed_node(), before_l.pointed_node());
-   }
-
-   //! <b>Requires</b>: prev_pos must be a dereferenceable iterator in *this or be
-   //!   before_begin(), and before_f and before_l belong to x and
-   //!   ++before_f != x.end() && before_l != x.end() and
-   //!   n == distance(before_f, before_l).
-   //!
-   //! <b>Effects</b>: Transfers the range (before_f, before_l] from list x to this
-   //!   list, after the element pointed by p. No destructors or copy constructors are called.
-   //!
-   //! <b>Throws</b>: Nothing.
-   //!
-   //! <b>Complexity</b>: Constant time.
-   //!
-   //! <b>Note</b>: Iterators of values obtained from list x now point to elements of this
-   //!   list. Iterators of this list and all the references are not invalidated.
-   void splice_after(const_iterator prev_pos, slist_impl &x, const_iterator before_f, const_iterator before_l, size_type n) BOOST_NOEXCEPT
-   {
-      BOOST_INTRUSIVE_INVARIANT_ASSERT(node_algorithms::distance(before_f.pointed_node(), before_l.pointed_node()) == n);
-      (void)n;
-      this->priv_splice_after
-         (prev_pos.pointed_node(), x, before_f.pointed_node(), before_l.pointed_node());
-      BOOST_IF_CONSTEXPR(constant_time_size){
-         this->priv_size_traits().increase(n);
-         x.priv_size_traits().decrease(n);
-      }
-   }
-
-   //! <b>Requires</b>: it is an iterator to an element in *this.
-   //!
-   //! <b>Effects</b>: Transfers all the elements of list x to this list, before the
-   //! the element pointed by it. No destructors or copy constructors are called.
-   //!
-   //! <b>Returns</b>: Nothing.
-   //!
-   //! <b>Throws</b>: Nothing.
-   //!
-   //! <b>Complexity</b>: Linear to the elements contained in x plus linear to
-   //!   the elements before it.
-   //!   Linear to the elements before it if cache_last<> option is true.
-   //!   Constant-time if cache_last<> option is true and it == end().
-   //!
-   //! <b>Note</b>: Iterators of values obtained from list x now point to elements of this
-   //! list. Iterators of this list and all the references are not invalidated.
-   //!
-   //! <b>Additional note</b>: If the optional parameter "l" is provided, it will be
-   //!   assigned to the last spliced element or prev if x is empty.
-   //!   This iterator can be used as new "prev" iterator for a new splice_after call.
-   //!   that will splice new values after the previously spliced values.
-   void splice(const_iterator it, slist_impl &x, const_iterator *l = 0) BOOST_NOEXCEPT
-   {  this->splice_after(this->previous(it), x, l);   }
-
-   //! <b>Requires</b>: it p must be a valid iterator of *this.
-   //!   elem must point to an element contained in list
-   //!   x.
-   //!
-   //! <b>Effects</b>: Transfers the element elem, from list x to this list,
-   //!   before the element pointed by pos. No destructors or copy constructors are called.
-   //!
-   //! <b>Throws</b>: Nothing.
-   //!
-   //! <b>Complexity</b>: Linear to the elements before pos and before elem.
-   //!   Linear to the elements before elem if cache_last<> option is true and pos == end().
-   //!
-   //! <b>Note</b>: Iterators of values obtained from list x now point to elements of this
-   //! list. Iterators of this list and all the references are not invalidated.
-   void splice(const_iterator pos, slist_impl &x, const_iterator elem) BOOST_NOEXCEPT
-   {  return this->splice_after(this->previous(pos), x, x.previous(elem));  }
-
-   //! <b>Requires</b>: pos must be a dereferenceable iterator in *this
-   //!   and f and f belong to x and f and f a valid range on x.
-   //!
-   //! <b>Effects</b>: Transfers the range [f, l) from list x to this
-   //!   list, before the element pointed by pos.
-   //!   No destructors or copy constructors are called.
-   //!
-   //! <b>Throws</b>: Nothing.
-   //!
-   //! <b>Complexity</b>: Linear to the sum of elements before pos, f, and l
-   //!   plus linear to the number of elements transferred if constant_time_size is true.
-   //!   Linear to the sum of elements before f, and l
-   //!   plus linear to the number of elements transferred if constant_time_size is true
-   //!   if cache_last<> is true and pos == end()
-   //!
-   //! <b>Note</b>: Iterators of values obtained from list x now point to elements of this
-   //!   list. Iterators of this list and all the references are not invalidated.
-   void splice(const_iterator pos, slist_impl &x, const_iterator f, const_iterator l) BOOST_NOEXCEPT
-   {  return this->splice_after(this->previous(pos), x, x.previous(f), x.previous(l));  }
-
-   //! <b>Requires</b>: pos must be a dereferenceable iterator in *this
-   //!   and f and l belong to x and f and l a valid range on x.
-   //!   n == distance(f, l).
-   //!
-   //! <b>Effects</b>: Transfers the range [f, l) from list x to this
-   //!   list, before the element pointed by pos.
-   //!   No destructors or copy constructors are called.
-   //!
-   //! <b>Throws</b>: Nothing.
-   //!
-   //! <b>Complexity</b>: Linear to the sum of elements before pos, f, and l.
-   //!   Linear to the sum of elements before f and l
-   //!   if cache_last<> is true and pos == end().
-   //!
-   //! <b>Note</b>: Iterators of values obtained from list x now point to elements of this
-   //!   list. Iterators of this list and all the references are not invalidated.
-   void splice(const_iterator pos, slist_impl &x, const_iterator f, const_iterator l, size_type n) BOOST_NOEXCEPT
-   {  return this->splice_after(this->previous(pos), x, x.previous(f), x.previous(l), n);  }
-
-   //! <b>Effects</b>: This function sorts the list *this according to operator<.
-   //!   The sort is stable, that is, the relative order of equivalent elements is preserved.
-   //!
-   //! <b>Throws</b>: If value_traits::node_traits::node
-   //!   constructor throws (this does not happen with predefined Boost.Intrusive hooks)
-   //!   or the predicate throws. Basic guarantee.
-   //!
-   //! <b>Complexity</b>: The number of comparisons is approximately N log N, where N
-   //!   is the list's size.
-   //!
-   //! <b>Note</b>: Iterators and references are not invalidated
-   template<class Predicate>
-   void sort(Predicate p)
-   {
-      if (node_traits::get_next(node_traits::get_next(this->get_root_node()))
-         != this->get_root_node()) {
-
-         slist_impl carry(this->priv_value_traits());
-         detail::array_initializer<slist_impl, 64> counter(this->priv_value_traits());
-         int fill = 0;
-         const_iterator last_inserted;
-         while(!this->empty()){
-            last_inserted = this->cbegin();
-            carry.splice_after(carry.cbefore_begin(), *this, this->cbefore_begin());
-            int i = 0;
-            while(i < fill && !counter[i].empty()) {
-               carry.swap(counter[i]);
-               carry.merge(counter[i++], p, &last_inserted);
-            }
-            BOOST_INTRUSIVE_INVARIANT_ASSERT(counter[i].empty());
-            const_iterator last_element(carry.previous(last_inserted, carry.end()));
-
-            BOOST_IF_CONSTEXPR(constant_time_size){
-               counter[i].splice_after( counter[i].cbefore_begin(), carry
-                                    , carry.cbefore_begin(), last_element
-                                    , carry.size());
-            }
-            else{
-               counter[i].splice_after( counter[i].cbefore_begin(), carry
-                                    , carry.cbefore_begin(), last_element);
-            }
-            if(i == fill)
-               ++fill;
-         }
-
-         for (int i = 1; i < fill; ++i)
-            counter[i].merge(counter[i-1], p, &last_inserted);
-         --fill;
-         const_iterator last_element(counter[fill].previous(last_inserted, counter[fill].end()));
-         BOOST_IF_CONSTEXPR(constant_time_size){
-            this->splice_after( cbefore_begin(), counter[fill], counter[fill].cbefore_begin()
-                              , last_element, counter[fill].size());
-         }
-         else{
-            this->splice_after( cbefore_begin(), counter[fill], counter[fill].cbefore_begin()
-                              , last_element);
-         }
-      }
-   }
-
-   //! <b>Requires</b>: p must be a comparison function that induces a strict weak
-   //!   ordering and both *this and x must be sorted according to that ordering
-   //!   The lists x and *this must be distinct.
-   //!
-   //! <b>Effects</b>: This function removes all of x's elements and inserts them
-   //!   in order into *this. The merge is stable; that is, if an element from *this is
-   //!   equivalent to one from x, then the element from *this will precede the one from x.
-   //!
-   //! <b>Throws</b>: If value_traits::node_traits::node
-   //!   constructor throws (this does not happen with predefined Boost.Intrusive hooks)
-   //!   or operator< throws. Basic guarantee.
-   //!
-   //! <b>Complexity</b>: This function is linear time: it performs at most
-   //!   size() + x.size() - 1 comparisons.
-   //!
-   //! <b>Note</b>: Iterators and references are not invalidated.
-   void sort()
-   { this->sort(value_less<value_type>()); }
-
-   //! <b>Requires</b>: p must be a comparison function that induces a strict weak
-   //!   ordering and both *this and x must be sorted according to that ordering
-   //!   The lists x and *this must be distinct.
-   //!
-   //! <b>Effects</b>: This function removes all of x's elements and inserts them
-   //!   in order into *this. The merge is stable; that is, if an element from *this is
-   //!   equivalent to one from x, then the element from *this will precede the one from x.
-   //!
-   //! <b>Returns</b>: Nothing.
-   //!
-   //! <b>Throws</b>: If the predicate throws. Basic guarantee.
-   //!
-   //! <b>Complexity</b>: This function is linear time: it performs at most
-   //!   size() + x.size() - 1 comparisons.
-   //!
-   //! <b>Note</b>: Iterators and references are not invalidated.
-   //!
-   //! <b>Additional note</b>: If optional "l" argument is passed, it is assigned
-   //! to an iterator to the last transferred value or end() is x is empty.
-   template<class Predicate>
-   void merge(slist_impl& x, Predicate p, const_iterator *l = 0)
-   {
-      const_iterator e(this->cend()), ex(x.cend()), bb(this->cbefore_begin()),
-                     bb_next;
-      if(l) *l = e.unconst();
-      while(!x.empty()){
-         const_iterator ibx_next(x.cbefore_begin()), ibx(ibx_next++);
-         while (++(bb_next = bb) != e && !p(*ibx_next, *bb_next)){
-            bb = bb_next;
-         }
-         if(bb_next == e){
-            //Now transfer the rest to the end of the container
-            this->splice_after(bb, x, l);
-            break;
-         }
-         else{
-            size_type n(0);
-            do{
-               ibx = ibx_next; ++n;
-            } while(++(ibx_next = ibx) != ex && p(*ibx_next, *bb_next));
-            this->splice_after(bb, x, x.before_begin(), ibx, n);
-            if(l) *l = ibx;
-         }
-      }
-   }
-
-   //! <b>Effects</b>: This function removes all of x's elements and inserts them
-   //!   in order into *this according to operator<. The merge is stable;
-   //!   that is, if an element from *this is equivalent to one from x, then the element
-   //!   from *this will precede the one from x.
-   //!
-   //! <b>Throws</b>: if operator< throws. Basic guarantee.
-   //!
-   //! <b>Complexity</b>: This function is linear time: it performs at most
-   //!   size() + x.size() - 1 comparisons.
-   //!
-   //! <b>Note</b>: Iterators and references are not invalidated
-   void merge(slist_impl& x)
-   {  this->merge(x, value_less<value_type>());  }
-
-   //! <b>Effects</b>: Reverses the order of elements in the list.
-   //!
-   //! <b>Throws</b>: Nothing.
-   //!
-   //! <b>Complexity</b>: This function is linear to the contained elements.
-   //!
-   //! <b>Note</b>: Iterators and references are not invalidated
-   void reverse() BOOST_NOEXCEPT
-   {
-      if(cache_last && !this->empty()){
-         this->set_last_node(node_traits::get_next(this->get_root_node()));
-      }
-      this->priv_reverse(detail::bool_<linear>());
-   }
-
-   //! <b>Effects</b>: Removes all the elements that compare equal to value.
-   //!   No destructors are called.
-   //!
-   //! <b>Throws</b>: If operator== throws. Basic guarantee.
-   //!
-   //! <b>Complexity</b>: Linear time. It performs exactly size() comparisons for equality.
-   //!
-   //! <b>Note</b>: The relative order of elements that are not removed is unchanged,
-   //!   and iterators to elements that are not removed remain valid. This function is
-   //!   linear time: it performs exactly size() comparisons for equality.
-   void remove(const_reference value) BOOST_NOEXCEPT
-   {  this->remove_if(detail::equal_to_value<const_reference>(value));  }
-
-   //! <b>Requires</b>: Disposer::operator()(pointer) shouldn't throw.
-   //!
-   //! <b>Effects</b>: Removes all the elements that compare equal to value.
-   //!   Disposer::operator()(pointer) is called for every removed element.
-   //!
-   //! <b>Throws</b>: If operator== throws. Basic guarantee.
-   //!
-   //! <b>Complexity</b>: Linear time. It performs exactly size() comparisons for equality.
-   //!
-   //! <b>Note</b>: The relative order of elements that are not removed is unchanged,
-   //!   and iterators to elements that are not removed remain valid.
-   template<class Disposer>
-   void remove_and_dispose(const_reference value, Disposer disposer) BOOST_NOEXCEPT
-   {  this->remove_and_dispose_if(detail::equal_to_value<const_reference>(value), disposer);  }
-
-   //! <b>Effects</b>: Removes all the elements for which a specified
-   //!   predicate is satisfied. No destructors are called.
-   //!
-   //! <b>Throws</b>: If pred throws. Basic guarantee.
-   //!
-   //! <b>Complexity</b>: Linear time. It performs exactly size() calls to the predicate.
-   //!
-   //! <b>Note</b>: The relative order of elements that are not removed is unchanged,
-   //!   and iterators to elements that are not removed remain valid.
-   template<class Pred>
-   void remove_if(Pred pred)
-   {
-      const node_ptr bbeg = this->get_root_node();
-      typename node_algorithms::stable_partition_info info;
-      node_algorithms::stable_partition
-         (bbeg, this->get_end_node(), detail::key_nodeptr_comp<Pred, value_traits>(pred, &this->priv_value_traits()), info);
-      //After cache last is set, slist invariants are preserved...
-      BOOST_IF_CONSTEXPR(cache_last){
-         this->set_last_node(info.new_last_node);
-      }
-      //...so erase can be safely called
-      this->erase_after( const_iterator(bbeg, this->priv_value_traits_ptr())
-                       , const_iterator(info.beg_2st_partition, this->priv_value_traits_ptr())
-                       , info.num_1st_partition);
-   }
-
-   //! <b>Requires</b>: Disposer::operator()(pointer) shouldn't throw.
-   //!
-   //! <b>Effects</b>: Removes all the elements for which a specified
-   //!   predicate is satisfied.
-   //!   Disposer::operator()(pointer) is called for every removed element.
-   //!
-   //! <b>Throws</b>: If pred throws. Basic guarantee.
-   //!
-   //! <b>Complexity</b>: Linear time. It performs exactly size() comparisons for equality.
-   //!
-   //! <b>Note</b>: The relative order of elements that are not removed is unchanged,
-   //!   and iterators to elements that are not removed remain valid.
-   template<class Pred, class Disposer>
-   void remove_and_dispose_if(Pred pred, Disposer disposer)
-   {
-      const node_ptr bbeg = this->get_root_node();
-      typename node_algorithms::stable_partition_info info;
-      node_algorithms::stable_partition
-         (bbeg, this->get_end_node(), detail::key_nodeptr_comp<Pred, value_traits>(pred, &this->priv_value_traits()), info);
-      //After cache last is set, slist invariants are preserved...
-      BOOST_IF_CONSTEXPR(cache_last){
-         this->set_last_node(info.new_last_node);
-      }
-      //...so erase can be safely called
-      this->erase_after_and_dispose( const_iterator(bbeg, this->priv_value_traits_ptr())
-                                   , const_iterator(info.beg_2st_partition, this->priv_value_traits_ptr())
-                                   , disposer);
-   }
-
-   //! <b>Effects</b>: Removes adjacent duplicate elements or adjacent
-   //!   elements that are equal from the list. No destructors are called.
-   //!
-   //! <b>Throws</b>: If operator== throws. Basic guarantee.
-   //!
-   //! <b>Complexity</b>: Linear time (size()-1) comparisons calls to pred()).
-   //!
-   //! <b>Note</b>: The relative order of elements that are not removed is unchanged,
-   //!   and iterators to elements that are not removed remain valid.
-   void unique()
-   {  this->unique_and_dispose(value_equal<value_type>(), detail::null_disposer());  }
-
-   //! <b>Effects</b>: Removes adjacent duplicate elements or adjacent
-   //!   elements that satisfy some binary predicate from the list.
-   //!   No destructors are called.
-   //!
-   //! <b>Throws</b>: If the predicate throws. Basic guarantee.
-   //!
-   //! <b>Complexity</b>: Linear time (size()-1) comparisons equality comparisons.
-   //!
-   //! <b>Note</b>: The relative order of elements that are not removed is unchanged,
-   //!   and iterators to elements that are not removed remain valid.
-   template<class BinaryPredicate>
-   void unique(BinaryPredicate pred)
-   {  this->unique_and_dispose(pred, detail::null_disposer());  }
-
-   //! <b>Requires</b>: Disposer::operator()(pointer) shouldn't throw.
-   //!
-   //! <b>Effects</b>: Removes adjacent duplicate elements or adjacent
-   //!   elements that satisfy some binary predicate from the list.
-   //!   Disposer::operator()(pointer) is called for every removed element.
-   //!
-   //! <b>Throws</b>: If operator== throws. Basic guarantee.
-   //!
-   //! <b>Complexity</b>: Linear time (size()-1) comparisons equality comparisons.
-   //!
-   //! <b>Note</b>: The relative order of elements that are not removed is unchanged,
-   //!   and iterators to elements that are not removed remain valid.
-   template<class Disposer>
-   void unique_and_dispose(Disposer disposer)
-   {  this->unique(value_equal<value_type>(), disposer);  }
-
-   //! <b>Requires</b>: Disposer::operator()(pointer) shouldn't throw.
-   //!
-   //! <b>Effects</b>: Removes adjacent duplicate elements or adjacent
-   //!   elements that satisfy some binary predicate from the list.
-   //!   Disposer::operator()(pointer) is called for every removed element.
-   //!
-   //! <b>Throws</b>: If the predicate throws. Basic guarantee.
-   //!
-   //! <b>Complexity</b>: Linear time (size()-1) comparisons equality comparisons.
-   //!
-   //! <b>Note</b>: The relative order of elements that are not removed is unchanged,
-   //!   and iterators to elements that are not removed remain valid.
-   template<class BinaryPredicate, class Disposer>
-   void unique_and_dispose(BinaryPredicate pred, Disposer disposer)
-   {
-      const_iterator end_n(this->cend());
-      const_iterator bcur(this->cbegin());
-      if(bcur != end_n){
-         const_iterator cur(bcur);
-         ++cur;
-         while(cur != end_n) {
-            if (pred(*bcur, *cur)){
-               cur = this->erase_after_and_dispose(bcur, disposer);
-            }
-            else{
-               bcur = cur;
-               ++cur;
-            }
-         }
-         BOOST_IF_CONSTEXPR(cache_last){
-            this->set_last_node(bcur.pointed_node());
-         }
-      }
-   }
-
-   //! <b>Requires</b>: value must be a reference to a value inserted in a list.
-   //!
-   //! <b>Effects</b>: This function returns a const_iterator pointing to the element
-   //!
-   //! <b>Throws</b>: Nothing.
-   //!
-   //! <b>Complexity</b>: Constant time.
-   //!
-   //! <b>Note</b>: Iterators and references are not invalidated.
-   //!   This static function is available only if the <i>value traits</i>
-   //!   is stateless.
-   static iterator s_iterator_to(reference value) BOOST_NOEXCEPT
-   {
-      BOOST_STATIC_ASSERT((!stateful_value_traits));
-      return iterator (value_traits::to_node_ptr(value), const_value_traits_ptr());
-   }
-
-   //! <b>Requires</b>: value must be a const reference to a value inserted in a list.
-   //!
-   //! <b>Effects</b>: This function returns an iterator pointing to the element.
-   //!
-   //! <b>Throws</b>: Nothing.
-   //!
-   //! <b>Complexity</b>: Constant time.
-   //!
-   //! <b>Note</b>: Iterators and references are not invalidated.
-   //!   This static function is available only if the <i>value traits</i>
-   //!   is stateless.
-   static const_iterator s_iterator_to(const_reference value) BOOST_NOEXCEPT
-   {
-      BOOST_STATIC_ASSERT((!stateful_value_traits));
-      reference r =*detail::uncast(pointer_traits<const_pointer>::pointer_to(value));
-      return const_iterator(value_traits::to_node_ptr(r), const_value_traits_ptr());
-   }
-
-   //! <b>Requires</b>: value must be a reference to a value inserted in a list.
-   //!
-   //! <b>Effects</b>: This function returns a const_iterator pointing to the element
-   //!
-   //! <b>Throws</b>: Nothing.
-   //!
-   //! <b>Complexity</b>: Constant time.
-   //!
-   //! <b>Note</b>: Iterators and references are not invalidated.
-   iterator iterator_to(reference value) BOOST_NOEXCEPT
-   {
-      BOOST_INTRUSIVE_INVARIANT_ASSERT(linear || !node_algorithms::inited(this->priv_value_traits().to_node_ptr(value)));
-      return iterator (this->priv_value_traits().to_node_ptr(value), this->priv_value_traits_ptr());
-   }
-
-   //! <b>Requires</b>: value must be a const reference to a value inserted in a list.
-   //!
-   //! <b>Effects</b>: This function returns an iterator pointing to the element.
-   //!
-   //! <b>Throws</b>: Nothing.
-   //!
-   //! <b>Complexity</b>: Constant time.
-   //!
-   //! <b>Note</b>: Iterators and references are not invalidated.
-   const_iterator iterator_to(const_reference value) const BOOST_NOEXCEPT
-   {
-      reference r =*detail::uncast(pointer_traits<const_pointer>::pointer_to(value));
-      BOOST_INTRUSIVE_INVARIANT_ASSERT (linear || !node_algorithms::inited(this->priv_value_traits().to_node_ptr(r)));
-      return const_iterator(this->priv_value_traits().to_node_ptr(r), this->priv_value_traits_ptr());
-   }
-
-   //! <b>Returns</b>: The iterator to the element before i in the list.
-   //!   Returns the end-iterator, if either i is the begin-iterator or the
-   //!   list is empty.
-   //!
-   //! <b>Throws</b>: Nothing.
-   //!
-   //! <b>Complexity</b>: Linear to the number of elements before i.
-   //!   Constant if cache_last<> is true and i == end().
-   iterator previous(iterator i) BOOST_NOEXCEPT
-   {  return this->previous(this->cbefore_begin(), i); }
-
-   //! <b>Returns</b>: The const_iterator to the element before i in the list.
-   //!   Returns the end-const_iterator, if either i is the begin-const_iterator or
-   //!   the list is empty.
-   //!
-   //! <b>Throws</b>: Nothing.
-   //!
-   //! <b>Complexity</b>: Linear to the number of elements before i.
-   //!   Constant if cache_last<> is true and i == end().
-   const_iterator previous(const_iterator i) const BOOST_NOEXCEPT
-   {  return this->previous(this->cbefore_begin(), i); }
-
-   //! <b>Returns</b>: The iterator to the element before i in the list,
-   //!   starting the search on element after prev_from.
-   //!   Returns the end-iterator, if either i is the begin-iterator or the
-   //!   list is empty.
-   //!
-   //! <b>Throws</b>: Nothing.
-   //!
-   //! <b>Complexity</b>: Linear to the number of elements before i.
-   //!   Constant if cache_last<> is true and i == end().
-   iterator previous(const_iterator prev_from, iterator i) BOOST_NOEXCEPT
-   {  return this->previous(prev_from, const_iterator(i)).unconst(); }
-
-   //! <b>Returns</b>: The const_iterator to the element before i in the list,
-   //!   starting the search on element after prev_from.
-   //!   Returns the end-const_iterator, if either i is the begin-const_iterator or
-   //!   the list is empty.
-   //!
-   //! <b>Throws</b>: Nothing.
-   //!
-   //! <b>Complexity</b>: Linear to the number of elements before i.
-   //!   Constant if cache_last<> is true and i == end().
-   const_iterator previous(const_iterator prev_from, const_iterator i) const BOOST_NOEXCEPT
-   {
-      if(cache_last && (i.pointed_node() == this->get_end_node())){
-         return const_iterator(detail::uncast(this->get_last_node()), this->priv_value_traits_ptr());
-      }
-      return const_iterator
-         (node_algorithms::get_previous_node
-            (prev_from.pointed_node(), i.pointed_node()), this->priv_value_traits_ptr());
-   }
-
-   ///@cond
-
-   //! <b>Requires</b>: prev_pos must be a dereferenceable iterator in *this or be
-   //!   before_begin(), and f and before_l belong to another slist.
-   //!
-   //! <b>Effects</b>: Transfers the range [f, before_l] to this
-   //!   list, after the element pointed by prev_pos.
-   //!   No destructors or copy constructors are called.
-   //!
-   //! <b>Throws</b>: Nothing.
-   //!
-   //! <b>Complexity</b>: Linear to the number of elements transferred
-   //!   if constant_time_size is true. Constant-time otherwise.
-   //!
-   //! <b>Note</b>: Iterators of values obtained from the list that owned f and before_l now
-   //!   point to elements of this list. Iterators of this list and all the references are not invalidated.
-   //!
-   //! <b>Warning</b>: Experimental function, don't use it!
-   void incorporate_after(const_iterator prev_pos, node_ptr f, node_ptr before_l) BOOST_NOEXCEPT
-   {
-      BOOST_IF_CONSTEXPR(constant_time_size)
-         this->incorporate_after(prev_pos, f, before_l, node_algorithms::distance(f.pointed_node(), before_l.pointed_node())+1);
-      else
-         this->priv_incorporate_after(prev_pos.pointed_node(), f, before_l);
-   }
-
-   //! <b>Requires</b>: prev_pos must be a dereferenceable iterator in *this or be
-   //!   before_begin(), and f and before_l belong to another slist.
-   //!   n == distance(f, before_l) + 1.
-   //!
-   //! <b>Effects</b>: Transfers the range [f, before_l] to this
-   //!   list, after the element pointed by prev_pos.
-   //!   No destructors or copy constructors are called.
-   //!
-   //! <b>Throws</b>: Nothing.
-   //!
-   //! <b>Complexity</b>: Constant time.
-   //!
-   //! <b>Note</b>: Iterators of values obtained from the list that owned f and before_l now
-   //!   point to elements of this list. Iterators of this list and all the references are not invalidated.
-   //!
-   //! <b>Warning</b>: Experimental function, don't use it!
-   void incorporate_after(const_iterator prev_pos, node_ptr f, node_ptr before_l, size_type n) BOOST_NOEXCEPT
-   {
-      if(n){
-         BOOST_INTRUSIVE_INVARIANT_ASSERT(n > 0);
-         BOOST_INTRUSIVE_INVARIANT_ASSERT
-            (size_type(boost::intrusive::iterator_distance
-               ( iterator(f, this->priv_value_traits_ptr())
-               , iterator(before_l, this->priv_value_traits_ptr())))
-            +1 == n);
-         this->priv_incorporate_after(prev_pos.pointed_node(), f, before_l);
-         BOOST_IF_CONSTEXPR(constant_time_size){
-            this->priv_size_traits().increase(n);
-         }
-      }
-   }
-
-   ///@endcond
-
-   //! <b>Effects</b>: Asserts the integrity of the container.
-   //!
-   //! <b>Complexity</b>: Linear time.
-   //!
-   //! <b>Note</b>: The method has no effect when asserts are turned off (e.g., with NDEBUG).
-   //!   Experimental function, interface might change in future versions.
-   void check() const
-   {
-      const_node_ptr header_ptr = get_root_node();
-      // header's next is never null
-      BOOST_INTRUSIVE_INVARIANT_ASSERT(node_traits::get_next(header_ptr));
-      if (node_traits::get_next(header_ptr) == header_ptr)
-      {
-         BOOST_INTRUSIVE_INVARIANT_ASSERT(!constant_time_size || this->priv_size_traits().get_size() == 0);
-         return;
-      }
-      size_t node_count = 0; (void)node_count;
-      const_node_ptr p = header_ptr;
-      while (true)
-      {
-         const_node_ptr next_p = node_traits::get_next(p);
-         BOOST_IF_CONSTEXPR(!linear)
-         {
-            BOOST_INTRUSIVE_INVARIANT_ASSERT(next_p);
-         }
-         else
-         {
-            BOOST_INTRUSIVE_INVARIANT_ASSERT(next_p != header_ptr);
-         }
-         if ((!linear && next_p == header_ptr) || (linear && !next_p))
-         {
-            BOOST_INTRUSIVE_INVARIANT_ASSERT(!cache_last || get_last_node() == p);
-            break;
-         }
-         p = next_p;
-         ++node_count;
-      }
-      BOOST_INTRUSIVE_INVARIANT_ASSERT(!constant_time_size || this->priv_size_traits().get_size() == node_count);
-   }
-
-
-   friend bool operator==(const slist_impl &x, const slist_impl &y)
-   {
-      if(constant_time_size && x.size() != y.size()){
-         return false;
-      }
-      return ::boost::intrusive::algo_equal(x.cbegin(), x.cend(), y.cbegin(), y.cend());
-   }
-
-   friend bool operator!=(const slist_impl &x, const slist_impl &y)
-   {  return !(x == y); }
-
-   friend bool operator<(const slist_impl &x, const slist_impl &y)
-   {  return ::boost::intrusive::algo_lexicographical_compare(x.begin(), x.end(), y.begin(), y.end());  }
-
-   friend bool operator>(const slist_impl &x, const slist_impl &y)
-   {  return y < x;  }
-
-   friend bool operator<=(const slist_impl &x, const slist_impl &y)
-   {  return !(y < x);  }
-
-   friend bool operator>=(const slist_impl &x, const slist_impl &y)
-   {  return !(x < y);  }
-
-   friend void swap(slist_impl &x, slist_impl &y)
-   {  x.swap(y);  }
-
-   private:
-   void priv_splice_after(node_ptr prev_pos_n, slist_impl &x, node_ptr before_f_n, node_ptr before_l_n)
-   {
-      if (cache_last && (before_f_n != before_l_n)){
-         if(prev_pos_n == this->get_last_node()){
-            this->set_last_node(before_l_n);
-         }
-         if(&x != this && node_traits::get_next(before_l_n) == x.get_end_node()){
-            x.set_last_node(before_f_n);
-         }
-      }
-      node_algorithms::transfer_after(prev_pos_n, before_f_n, before_l_n);
-   }
-
-   void priv_incorporate_after(node_ptr prev_pos_n, node_ptr first_n, node_ptr before_l_n)
-   {
-      BOOST_IF_CONSTEXPR(cache_last){
-         if(prev_pos_n == this->get_last_node()){
-            this->set_last_node(before_l_n);
-         }
-      }
-      node_algorithms::incorporate_after(prev_pos_n, first_n, before_l_n);
-   }
-
-   void priv_reverse(detail::bool_<false>)
-   {  node_algorithms::reverse(this->get_root_node());   }
-
-   void priv_reverse(detail::bool_<true>)
-   {
-      node_ptr new_first = node_algorithms::reverse
-         (node_traits::get_next(this->get_root_node()));
-      node_traits::set_next(this->get_root_node(), new_first);
-   }
-
-   void priv_shift_backwards(size_type n, detail::bool_<false>)
-   {
-      node_ptr l = node_algorithms::move_forward(this->get_root_node(), (std::size_t)n);
-      if(cache_last && l){
-         this->set_last_node(l);
-      }
-   }
-
-   void priv_shift_backwards(size_type n, detail::bool_<true>)
-   {
-      typename node_algorithms::node_pair ret(
-         node_algorithms::move_first_n_forward
-            (node_traits::get_next(this->get_root_node()), (std::size_t)n));
-      if(ret.first){
-         node_traits::set_next(this->get_root_node(), ret.first);
-         BOOST_IF_CONSTEXPR(cache_last){
-            this->set_last_node(ret.second);
-         }
-      }
-   }
-
-   void priv_shift_forward(size_type n, detail::bool_<false>)
-   {
-      node_ptr l = node_algorithms::move_backwards(this->get_root_node(), (std::size_t)n);
-      if(cache_last && l){
-         this->set_last_node(l);
-      }
-   }
-
-   void priv_shift_forward(size_type n, detail::bool_<true>)
-   {
-      typename node_algorithms::node_pair ret(
-         node_algorithms::move_first_n_backwards
-         (node_traits::get_next(this->get_root_node()), (std::size_t)n));
-      if(ret.first){
-         node_traits::set_next(this->get_root_node(), ret.first);
-         BOOST_IF_CONSTEXPR(cache_last){
-            this->set_last_node(ret.second);
-         }
-      }
-   }
-
-   static void priv_swap_cache_last(slist_impl *this_impl, slist_impl *other_impl)
-   {
-      bool other_was_empty = false;
-      if(this_impl->empty()){
-         //Check if both are empty or
-         if(other_impl->empty())
-            return;
-         //If this is empty swap pointers
-         slist_impl *tmp = this_impl;
-         this_impl  = other_impl;
-         other_impl = tmp;
-         other_was_empty = true;
-      }
-      else{
-         other_was_empty = other_impl->empty();
-      }
-
-      //Precondition: this is not empty
-      node_ptr other_old_last(other_impl->get_last_node());
-      node_ptr other_bfirst(other_impl->get_root_node());
-      node_ptr this_bfirst(this_impl->get_root_node());
-      node_ptr this_old_last(this_impl->get_last_node());
-
-      //Move all nodes from this to other's beginning
-      node_algorithms::transfer_after(other_bfirst, this_bfirst, this_old_last);
-      other_impl->set_last_node(this_old_last);
-
-      if(other_was_empty){
-         this_impl->set_last_node(this_bfirst);
-      }
-      else{
-         //Move trailing nodes from other to this
-         node_algorithms::transfer_after(this_bfirst, this_old_last, other_old_last);
-         this_impl->set_last_node(other_old_last);
-      }
-   }
-
-   //circular version
-   static void priv_swap_lists(node_ptr this_node, node_ptr other_node, detail::bool_<false>)
-   {  node_algorithms::swap_nodes(this_node, other_node); }
-
-   //linear version
-   static void priv_swap_lists(node_ptr this_node, node_ptr other_node, detail::bool_<true>)
-   {  node_algorithms::swap_trailing_nodes(this_node, other_node); }
-
-   static slist_impl &priv_container_from_end_iterator(const const_iterator &end_iterator)
-   {
-      //Obtaining the container from the end iterator is not possible with linear
-      //singly linked lists (because "end" is represented by the null pointer)
-      BOOST_STATIC_ASSERT(!linear);
-      BOOST_STATIC_ASSERT((has_container_from_iterator));
-      node_ptr p = end_iterator.pointed_node();
-      header_holder_type* h = header_holder_type::get_holder(p);
-      header_holder_plus_last_t* hpl = detail::parent_from_member< header_holder_plus_last_t, header_holder_type>
-                                         (h, &header_holder_plus_last_t::header_holder_);
-      root_plus_size* r = static_cast< root_plus_size* >(hpl);
-      data_t *d = detail::parent_from_member<data_t, root_plus_size>
-         ( r, &data_t::root_plus_size_);
-      slist_impl *s  = detail::parent_from_member<slist_impl, data_t>(d, &slist_impl::data_);
-      return *s;
-   }
-};
-
-//! Helper metafunction to define a \c slist that yields to the same type when the
-//! same options (either explicitly or implicitly) are used.
-#if defined(BOOST_INTRUSIVE_DOXYGEN_INVOKED) || defined(BOOST_INTRUSIVE_VARIADIC_TEMPLATES)
-template<class T, class ...Options>
-#else
-template<class T, class O1 = void, class O2 = void, class O3 = void, class O4 = void, class O5 = void, class O6 = void>
-#endif
-struct make_slist
-{
-   /// @cond
-   typedef typename pack_options
-      < slist_defaults,
-         #if !defined(BOOST_INTRUSIVE_VARIADIC_TEMPLATES)
-         O1, O2, O3, O4, O5, O6
-         #else
-         Options...
-         #endif
-      >::type packed_options;
-
-   typedef typename detail::get_value_traits
-      <T, typename packed_options::proto_value_traits>::type value_traits;
-   typedef slist_impl
-      < value_traits
-      , typename packed_options::size_type
-      ,  (std::size_t(packed_options::linear)*slist_bool_flags::linear_pos)
-        |(std::size_t(packed_options::constant_time_size)*slist_bool_flags::constant_time_size_pos)
-        |(std::size_t(packed_options::cache_last)*slist_bool_flags::cache_last_pos)
-      , typename packed_options::header_holder_type
-      > implementation_defined;
-   /// @endcond
-   typedef implementation_defined type;
-};
-
-
-#ifndef BOOST_INTRUSIVE_DOXYGEN_INVOKED
-
-#if !defined(BOOST_INTRUSIVE_VARIADIC_TEMPLATES)
-template<class T, class O1, class O2, class O3, class O4, class O5, class O6>
-#else
-template<class T, class ...Options>
-#endif
-class slist
-   :  public make_slist<T,
-         #if !defined(BOOST_INTRUSIVE_VARIADIC_TEMPLATES)
-         O1, O2, O3, O4, O5, O6
-         #else
-         Options...
-         #endif
-      >::type
-{
-   typedef typename make_slist
-      <T,
-      #if !defined(BOOST_INTRUSIVE_VARIADIC_TEMPLATES)
-      O1, O2, O3, O4, O5, O6
-      #else
-      Options...
-      #endif
-      >::type   Base;
-   //Assert if passed value traits are compatible with the type
-   BOOST_STATIC_ASSERT((detail::is_same<typename Base::value_traits::value_type, T>::value));
-   BOOST_MOVABLE_BUT_NOT_COPYABLE(slist)
-
-   public:
-   typedef typename Base::value_traits       value_traits;
-   typedef typename Base::iterator           iterator;
-   typedef typename Base::const_iterator     const_iterator;
-   typedef typename Base::size_type          size_type;
-   typedef typename Base::node_ptr           node_ptr;
-
-   BOOST_INTRUSIVE_FORCEINLINE slist()
-      :  Base()
-   {}
-
-   BOOST_INTRUSIVE_FORCEINLINE explicit slist(const value_traits &v_traits)
-      :  Base(v_traits)
-   {}
-
-   struct incorporate_t{};
-
-   BOOST_INTRUSIVE_FORCEINLINE slist( node_ptr f, node_ptr before_l
-             , size_type n, const value_traits &v_traits = value_traits())
-      :  Base(f, before_l, n, v_traits)
-   {}
-
-   template<class Iterator>
-   BOOST_INTRUSIVE_FORCEINLINE slist(Iterator b, Iterator e, const value_traits &v_traits = value_traits())
-      :  Base(b, e, v_traits)
-   {}
-
-   BOOST_INTRUSIVE_FORCEINLINE slist(BOOST_RV_REF(slist) x)
-      :  Base(BOOST_MOVE_BASE(Base, x))
-   {}
-
-   BOOST_INTRUSIVE_FORCEINLINE slist& operator=(BOOST_RV_REF(slist) x)
-   {  return static_cast<slist &>(this->Base::operator=(BOOST_MOVE_BASE(Base, x)));  }
-
-   template <class Cloner, class Disposer>
-   BOOST_INTRUSIVE_FORCEINLINE void clone_from(const slist &src, Cloner cloner, Disposer disposer)
-   {  Base::clone_from(src, cloner, disposer);  }
-
-   template <class Cloner, class Disposer>
-   BOOST_INTRUSIVE_FORCEINLINE void clone_from(BOOST_RV_REF(slist) src, Cloner cloner, Disposer disposer)
-   {  Base::clone_from(BOOST_MOVE_BASE(Base, src), cloner, disposer);  }
-
-   BOOST_INTRUSIVE_FORCEINLINE static slist &container_from_end_iterator(iterator end_iterator) BOOST_NOEXCEPT
-   {  return static_cast<slist &>(Base::container_from_end_iterator(end_iterator));   }
-
-   BOOST_INTRUSIVE_FORCEINLINE static const slist &container_from_end_iterator(const_iterator end_iterator) BOOST_NOEXCEPT
-   {  return static_cast<const slist &>(Base::container_from_end_iterator(end_iterator));   }
-};
-
-#endif
-
-} //namespace intrusive
-} //namespace boost
-
-#include <boost/intrusive/detail/config_end.hpp>
-
-#endif //BOOST_INTRUSIVE_SLIST_HPP
diff --git a/src/boost/intrusive/slist_hook.hpp b/src/boost/intrusive/slist_hook.hpp
deleted file mode 100644
index 380818cf..00000000
--- a/src/boost/intrusive/slist_hook.hpp
+++ /dev/null
@@ -1,298 +0,0 @@
-/////////////////////////////////////////////////////////////////////////////
-//
-// (C) Copyright Olaf Krzikalla 2004-2006.
-// (C) Copyright Ion Gaztanaga  2006-2013
-//
-// Distributed under the Boost 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/intrusive for documentation.
-//
-/////////////////////////////////////////////////////////////////////////////
-
-#ifndef BOOST_INTRUSIVE_SLIST_HOOK_HPP
-#define BOOST_INTRUSIVE_SLIST_HOOK_HPP
-
-#include <boost/intrusive/detail/config_begin.hpp>
-#include <boost/intrusive/intrusive_fwd.hpp>
-
-#include <boost/intrusive/detail/slist_node.hpp>
-#include <boost/intrusive/circular_slist_algorithms.hpp>
-#include <boost/intrusive/link_mode.hpp>
-#include <boost/intrusive/options.hpp>
-#include <boost/intrusive/detail/generic_hook.hpp>
-
-#if defined(BOOST_HAS_PRAGMA_ONCE)
-#  pragma once
-#endif
-
-namespace boost {
-namespace intrusive {
-
-//! Helper metafunction to define a \c slist_base_hook that yields to the same
-//! type when the same options (either explicitly or implicitly) are used.
-#if defined(BOOST_INTRUSIVE_DOXYGEN_INVOKED) || defined(BOOST_INTRUSIVE_VARIADIC_TEMPLATES)
-template<class ...Options>
-#else
-template<class O1 = void, class O2 = void, class O3 = void>
-#endif
-struct make_slist_base_hook
-{
-   /// @cond
-   typedef typename pack_options
-      < hook_defaults,
-         #if !defined(BOOST_INTRUSIVE_VARIADIC_TEMPLATES)
-         O1, O2, O3
-         #else
-         Options...
-         #endif
-      >::type packed_options;
-
-   typedef generic_hook
-   < CircularSListAlgorithms
-   , slist_node_traits<typename packed_options::void_pointer>
-   , typename packed_options::tag
-   , packed_options::link_mode
-   , SlistBaseHookId
-   > implementation_defined;
-   /// @endcond
-   typedef implementation_defined type;
-};
-
-//! Derive a class from slist_base_hook in order to store objects in
-//! in an list. slist_base_hook holds the data necessary to maintain the
-//! list and provides an appropriate value_traits class for list.
-//!
-//! The hook admits the following options: \c tag<>, \c void_pointer<> and
-//! \c link_mode<>.
-//!
-//! \c tag<> defines a tag to identify the node.
-//! The same tag value can be used in different classes, but if a class is
-//! derived from more than one \c list_base_hook, then each \c list_base_hook needs its
-//! unique tag.
-//!
-//! \c link_mode<> will specify the linking mode of the hook (\c normal_link,
-//! \c auto_unlink or \c safe_link).
-//!
-//! \c void_pointer<> is the pointer type that will be used internally in the hook
-//! and the container configured to use this hook.
-#if defined(BOOST_INTRUSIVE_DOXYGEN_INVOKED) || defined(BOOST_INTRUSIVE_VARIADIC_TEMPLATES)
-template<class ...Options>
-#else
-template<class O1, class O2, class O3>
-#endif
-class slist_base_hook
-   :  public make_slist_base_hook<
-         #if !defined(BOOST_INTRUSIVE_VARIADIC_TEMPLATES)
-         O1, O2, O3
-         #else
-         Options...
-         #endif
-      >::type
-{
-   #if defined(BOOST_INTRUSIVE_DOXYGEN_INVOKED)
-   public:
-   //! <b>Effects</b>: If link_mode is \c auto_unlink or \c safe_link
-   //!   initializes the node to an unlinked state.
-   //!
-   //! <b>Throws</b>: Nothing.
-   slist_base_hook() BOOST_NOEXCEPT;
-
-   //! <b>Effects</b>: If link_mode is \c auto_unlink or \c safe_link
-   //!   initializes the node to an unlinked state. The argument is ignored.
-   //!
-   //! <b>Throws</b>: Nothing.
-   //!
-   //! <b>Rationale</b>: Providing a copy-constructor
-   //!   makes classes using the hook STL-compliant without forcing the
-   //!   user to do some additional work. \c swap can be used to emulate
-   //!   move-semantics.
-   slist_base_hook(const slist_base_hook& ) BOOST_NOEXCEPT;
-
-   //! <b>Effects</b>: Empty function. The argument is ignored.
-   //!
-   //! <b>Throws</b>: Nothing.
-   //!
-   //! <b>Rationale</b>: Providing an assignment operator
-   //!   makes classes using the hook STL-compliant without forcing the
-   //!   user to do some additional work. \c swap can be used to emulate
-   //!   move-semantics.
-   slist_base_hook& operator=(const slist_base_hook& ) BOOST_NOEXCEPT;
-
-   //! <b>Effects</b>: If link_mode is \c normal_link, the destructor does
-   //!   nothing (ie. no code is generated). If link_mode is \c safe_link and the
-   //!   object is stored in an slist an assertion is raised. If link_mode is
-   //!   \c auto_unlink and \c is_linked() is true, the node is unlinked.
-   //!
-   //! <b>Throws</b>: Nothing.
-   ~slist_base_hook();
-
-   //! <b>Effects</b>: Swapping two nodes swaps the position of the elements
-   //!   related to those nodes in one or two containers. That is, if the node
-   //!   this is part of the element e1, the node x is part of the element e2
-   //!   and both elements are included in the containers s1 and s2, then after
-   //!   the swap-operation e1 is in s2 at the position of e2 and e2 is in s1
-   //!   at the position of e1. If one element is not in a container, then
-   //!   after the swap-operation the other element is not in a container.
-   //!   Iterators to e1 and e2 related to those nodes are invalidated.
-   //!
-   //! <b>Complexity</b>: Constant
-   //!
-   //! <b>Throws</b>: Nothing.
-   void swap_nodes(slist_base_hook &other) BOOST_NOEXCEPT;
-
-   //! <b>Precondition</b>: link_mode must be \c safe_link or \c auto_unlink.
-   //!
-   //! <b>Returns</b>: true, if the node belongs to a container, false
-   //!   otherwise. This function can be used to test whether \c slist::iterator_to
-   //!   will return a valid iterator.
-   //!
-   //! <b>Throws</b>: Nothing.
-   //!
-   //! <b>Complexity</b>: Constant
-   bool is_linked() const BOOST_NOEXCEPT;
-
-   //! <b>Effects</b>: Removes the node if it's inserted in a container.
-   //!   This function is only allowed if link_mode is \c auto_unlink.
-   //!
-   //! <b>Throws</b>: Nothing.
-   void unlink() BOOST_NOEXCEPT;
-   #endif
-};
-
-//! Helper metafunction to define a \c slist_member_hook that yields to the same
-//! type when the same options (either explicitly or implicitly) are used.
-#if defined(BOOST_INTRUSIVE_DOXYGEN_INVOKED) || defined(BOOST_INTRUSIVE_VARIADIC_TEMPLATES)
-template<class ...Options>
-#else
-template<class O1 = void, class O2 = void, class O3 = void>
-#endif
-struct make_slist_member_hook
-{
-   /// @cond
-   typedef typename pack_options
-      < hook_defaults,
-         #if !defined(BOOST_INTRUSIVE_VARIADIC_TEMPLATES)
-         O1, O2, O3
-         #else
-         Options...
-         #endif
-      >::type packed_options;
-
-   typedef generic_hook
-   < CircularSListAlgorithms
-   , slist_node_traits<typename packed_options::void_pointer>
-   , member_tag
-   , packed_options::link_mode
-   , NoBaseHookId
-   > implementation_defined;
-   /// @endcond
-   typedef implementation_defined type;
-};
-
-//! Put a public data member slist_member_hook in order to store objects of this class in
-//! an list. slist_member_hook holds the data necessary for maintaining the list and
-//! provides an appropriate value_traits class for list.
-//!
-//! The hook admits the following options: \c void_pointer<> and
-//! \c link_mode<>.
-//!
-//! \c link_mode<> will specify the linking mode of the hook (\c normal_link,
-//! \c auto_unlink or \c safe_link).
-//!
-//! \c void_pointer<> is the pointer type that will be used internally in the hook
-//! and the container configured to use this hook.
-#if defined(BOOST_INTRUSIVE_DOXYGEN_INVOKED) || defined(BOOST_INTRUSIVE_VARIADIC_TEMPLATES)
-template<class ...Options>
-#else
-template<class O1, class O2, class O3>
-#endif
-class slist_member_hook
-   :  public make_slist_member_hook<
-         #if !defined(BOOST_INTRUSIVE_VARIADIC_TEMPLATES)
-         O1, O2, O3
-         #else
-         Options...
-         #endif
-      >::type
-{
-   #if defined(BOOST_INTRUSIVE_DOXYGEN_INVOKED)
-   public:
-   //! <b>Effects</b>: If link_mode is \c auto_unlink or \c safe_link
-   //!   initializes the node to an unlinked state.
-   //!
-   //! <b>Throws</b>: Nothing.
-   slist_member_hook();
-
-   //! <b>Effects</b>: If link_mode is \c auto_unlink or \c safe_link
-   //!   initializes the node to an unlinked state. The argument is ignored.
-   //!
-   //! <b>Throws</b>: Nothing.
-   //!
-   //! <b>Rationale</b>: Providing a copy-constructor
-   //!   makes classes using the hook STL-compliant without forcing the
-   //!   user to do some additional work. \c swap can be used to emulate
-   //!   move-semantics.
-   slist_member_hook(const slist_member_hook& );
-
-   //! <b>Effects</b>: Empty function. The argument is ignored.
-   //!
-   //! <b>Throws</b>: Nothing.
-   //!
-   //! <b>Rationale</b>: Providing an assignment operator
-   //!   makes classes using the hook STL-compliant without forcing the
-   //!   user to do some additional work. \c swap can be used to emulate
-   //!   move-semantics.
-   slist_member_hook& operator=(const slist_member_hook& );
-
-   //! <b>Effects</b>: If link_mode is \c normal_link, the destructor does
-   //!   nothing (ie. no code is generated). If link_mode is \c safe_link and the
-   //!   object is stored in an slist an assertion is raised. If link_mode is
-   //!   \c auto_unlink and \c is_linked() is true, the node is unlinked.
-   //!
-   //! <b>Throws</b>: Nothing.
-   ~slist_member_hook();
-
-   //! <b>Effects</b>: Swapping two nodes swaps the position of the elements
-   //!   related to those nodes in one or two containers. That is, if the node
-   //!   this is part of the element e1, the node x is part of the element e2
-   //!   and both elements are included in the containers s1 and s2, then after
-   //!   the swap-operation e1 is in s2 at the position of e2 and e2 is in s1
-   //!   at the position of e1. If one element is not in a container, then
-   //!   after the swap-operation the other element is not in a container.
-   //!   Iterators to e1 and e2 related to those nodes are invalidated.
-   //!
-   //! <b>Complexity</b>: Constant
-   //!
-   //! <b>Throws</b>: Nothing.
-   void swap_nodes(slist_member_hook &other);
-
-   //! <b>Precondition</b>: link_mode must be \c safe_link or \c auto_unlink.
-   //!
-   //! <b>Returns</b>: true, if the node belongs to a container, false
-   //!   otherwise. This function can be used to test whether \c slist::iterator_to
-   //!   will return a valid iterator.
-   //!
-   //! <b>Note</b>: If this member is called when the value is inserted in a
-   //!   slist with the option linear<true>, this function will return "false"
-   //!   for the last element, as it is not linked to anything (the next element is null),
-   //!   so use with care.
-   //!  
-   //! <b>Complexity</b>: Constant
-   bool is_linked() const;
-
-   //! <b>Effects</b>: Removes the node if it's inserted in a container.
-   //!   This function is only allowed if link_mode is \c auto_unlink.
-   //!
-   //! <b>Throws</b>: Nothing.
-   void unlink();
-   #endif
-};
-
-} //namespace intrusive
-} //namespace boost
-
-#include <boost/intrusive/detail/config_end.hpp>
-
-#endif //BOOST_INTRUSIVE_SLIST_HOOK_HPP
diff --git a/src/boost/intrusive/splaytree.hpp b/src/boost/intrusive/splaytree.hpp
deleted file mode 100644
index 44e5c786..00000000
--- a/src/boost/intrusive/splaytree.hpp
+++ /dev/null
@@ -1,666 +0,0 @@
-/////////////////////////////////////////////////////////////////////////////
-//
-// (C) Copyright Ion Gaztanaga  2007-2014
-//
-// Distributed under the Boost 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/intrusive for documentation.
-//
-/////////////////////////////////////////////////////////////////////////////
-#ifndef BOOST_INTRUSIVE_SPLAYTREE_HPP
-#define BOOST_INTRUSIVE_SPLAYTREE_HPP
-
-#include <boost/intrusive/detail/config_begin.hpp>
-#include <boost/intrusive/intrusive_fwd.hpp>
-#include <cstddef>
-#include <boost/intrusive/detail/minimal_less_equal_header.hpp>
-#include <boost/intrusive/detail/minimal_pair_header.hpp>   //std::pair
-
-#include <boost/static_assert.hpp>
-#include <boost/intrusive/bstree.hpp>
-#include <boost/intrusive/detail/tree_node.hpp>
-#include <boost/intrusive/detail/mpl.hpp>
-#include <boost/intrusive/pointer_traits.hpp>
-#include <boost/intrusive/detail/function_detector.hpp>
-#include <boost/intrusive/detail/get_value_traits.hpp>
-#include <boost/intrusive/splaytree_algorithms.hpp>
-#include <boost/intrusive/link_mode.hpp>
-#include <boost/intrusive/detail/key_nodeptr_comp.hpp>
-#include <boost/move/utility_core.hpp>
-
-#if defined(BOOST_HAS_PRAGMA_ONCE)
-#  pragma once
-#endif
-
-namespace boost {
-namespace intrusive {
-
-/// @cond
-
-struct splaytree_defaults
-   : bstree_defaults
-{};
-
-/// @endcond
-
-//! The class template splaytree is an intrusive splay tree container that
-//! is used to construct intrusive splay_set and splay_multiset containers. The no-throw
-//! guarantee holds only, if the key_compare object
-//! doesn't throw.
-//!
-//! The template parameter \c T is the type to be managed by the container.
-//! The user can specify additional options and if no options are provided
-//! default options are used.
-//!
-//! The container supports the following options:
-//! \c base_hook<>/member_hook<>/value_traits<>,
-//! \c constant_time_size<>, \c size_type<> and
-//! \c compare<>.
-#if defined(BOOST_INTRUSIVE_DOXYGEN_INVOKED)
-template<class T, class ...Options>
-#else
-template<class ValueTraits, class VoidOrKeyOfValue, class VoidOrKeyComp, class SizeType, bool ConstantTimeSize, typename HeaderHolder>
-#endif
-class splaytree_impl
-   /// @cond
-   :  public bstree_impl<ValueTraits, VoidOrKeyOfValue, VoidOrKeyComp, SizeType, ConstantTimeSize, SplayTreeAlgorithms, HeaderHolder>
-   /// @endcond
-{
-   public:
-   typedef ValueTraits                                               value_traits;
-   /// @cond
-   typedef bstree_impl< ValueTraits, VoidOrKeyOfValue, VoidOrKeyComp, SizeType
-                      , ConstantTimeSize, SplayTreeAlgorithms
-                      , HeaderHolder>                                tree_type;
-   typedef tree_type                                                 implementation_defined;
-   /// @endcond
-
-   typedef typename implementation_defined::pointer                  pointer;
-   typedef typename implementation_defined::const_pointer            const_pointer;
-   typedef typename implementation_defined::value_type               value_type;
-   typedef typename implementation_defined::key_type                 key_type;
-   typedef typename implementation_defined::key_of_value             key_of_value;
-   typedef typename implementation_defined::reference                reference;
-   typedef typename implementation_defined::const_reference          const_reference;
-   typedef typename implementation_defined::difference_type          difference_type;
-   typedef typename implementation_defined::size_type                size_type;
-   typedef typename implementation_defined::value_compare            value_compare;
-   typedef typename implementation_defined::key_compare              key_compare;
-   typedef typename implementation_defined::iterator                 iterator;
-   typedef typename implementation_defined::const_iterator           const_iterator;
-   typedef typename implementation_defined::reverse_iterator         reverse_iterator;
-   typedef typename implementation_defined::const_reverse_iterator   const_reverse_iterator;
-   typedef typename implementation_defined::node_traits              node_traits;
-   typedef typename implementation_defined::node                     node;
-   typedef typename implementation_defined::node_ptr                 node_ptr;
-   typedef typename implementation_defined::const_node_ptr           const_node_ptr;
-   typedef typename implementation_defined::node_algorithms          node_algorithms;
-
-   static const bool constant_time_size = implementation_defined::constant_time_size;
-   /// @cond
-   private:
-
-   //noncopyable
-   BOOST_MOVABLE_BUT_NOT_COPYABLE(splaytree_impl)
-
-   /// @endcond
-
-   public:
-
-   typedef typename implementation_defined::insert_commit_data insert_commit_data;
-
-   //! @copydoc ::boost::intrusive::bstree::bstree()
-   splaytree_impl()
-      :  tree_type()
-   {}
-
-   //! @copydoc ::boost::intrusive::bstree::bstree(const key_compare &,const value_traits &)
-   explicit splaytree_impl( const key_compare &cmp, const value_traits &v_traits = value_traits())
-      :  tree_type(cmp, v_traits)
-   {}
-
-   //! @copydoc ::boost::intrusive::bstree::bstree(bool,Iterator,Iterator,const key_compare &,const value_traits &)
-   template<class Iterator>
-   splaytree_impl( bool unique, Iterator b, Iterator e
-              , const key_compare &cmp     = key_compare()
-              , const value_traits &v_traits = value_traits())
-      : tree_type(cmp, v_traits)
-   {
-      if(unique)
-         this->insert_unique(b, e);
-      else
-         this->insert_equal(b, e);
-   }
-
-   //! @copydoc ::boost::intrusive::bstree::bstree(bstree &&)
-   splaytree_impl(BOOST_RV_REF(splaytree_impl) x)
-      :  tree_type(BOOST_MOVE_BASE(tree_type, x))
-   {}
-
-   //! @copydoc ::boost::intrusive::bstree::operator=(bstree &&)
-   splaytree_impl& operator=(BOOST_RV_REF(splaytree_impl) x)
-   {  return static_cast<splaytree_impl&>(tree_type::operator=(BOOST_MOVE_BASE(tree_type, x))); }
-
-   #ifdef BOOST_INTRUSIVE_DOXYGEN_INVOKED
-   //! @copydoc ::boost::intrusive::bstree::~bstree()
-   ~splaytree_impl();
-
-   //! @copydoc ::boost::intrusive::bstree::begin()
-   iterator begin() BOOST_NOEXCEPT;
-
-   //! @copydoc ::boost::intrusive::bstree::begin()const
-   const_iterator begin() const BOOST_NOEXCEPT;
-
-   //! @copydoc ::boost::intrusive::bstree::cbegin()const
-   const_iterator cbegin() const BOOST_NOEXCEPT;
-
-   //! @copydoc ::boost::intrusive::bstree::end()
-   iterator end() BOOST_NOEXCEPT;
-
-   //! @copydoc ::boost::intrusive::bstree::end()const
-   const_iterator end() const BOOST_NOEXCEPT;
-
-   //! @copydoc ::boost::intrusive::bstree::cend()const
-   const_iterator cend() const BOOST_NOEXCEPT;
-
-   //! @copydoc ::boost::intrusive::bstree::rbegin()
-   reverse_iterator rbegin() BOOST_NOEXCEPT;
-
-   //! @copydoc ::boost::intrusive::bstree::rbegin()const
-   const_reverse_iterator rbegin() const BOOST_NOEXCEPT;
-
-   //! @copydoc ::boost::intrusive::bstree::crbegin()const
-   const_reverse_iterator crbegin() const BOOST_NOEXCEPT;
-
-   //! @copydoc ::boost::intrusive::bstree::rend()
-   reverse_iterator rend() BOOST_NOEXCEPT;
-
-   //! @copydoc ::boost::intrusive::bstree::rend()const
-   const_reverse_iterator rend() const BOOST_NOEXCEPT;
-
-   //! @copydoc ::boost::intrusive::bstree::crend()const
-   const_reverse_iterator crend() const BOOST_NOEXCEPT;
-
-   //! @copydoc ::boost::intrusive::bstree::root()
-   iterator root() BOOST_NOEXCEPT;
-
-   //! @copydoc ::boost::intrusive::bstree::root()const
-   const_iterator root() const BOOST_NOEXCEPT;
-
-   //! @copydoc ::boost::intrusive::bstree::croot()const
-   const_iterator croot() const BOOST_NOEXCEPT;
-
-   //! @copydoc ::boost::intrusive::bstree::container_from_end_iterator(iterator)
-   static splaytree_impl &container_from_end_iterator(iterator end_iterator) BOOST_NOEXCEPT;
-
-   //! @copydoc ::boost::intrusive::bstree::container_from_end_iterator(const_iterator)
-   static const splaytree_impl &container_from_end_iterator(const_iterator end_iterator) BOOST_NOEXCEPT;
-
-   //! @copydoc ::boost::intrusive::bstree::container_from_iterator(iterator)
-   static splaytree_impl &container_from_iterator(iterator it) BOOST_NOEXCEPT;
-
-   //! @copydoc ::boost::intrusive::bstree::container_from_iterator(const_iterator)
-   static const splaytree_impl &container_from_iterator(const_iterator it) BOOST_NOEXCEPT;
-
-   //! @copydoc ::boost::intrusive::bstree::key_comp()const
-   key_compare key_comp() const;
-
-   //! @copydoc ::boost::intrusive::bstree::value_comp()const
-   value_compare value_comp() const;
-
-   //! @copydoc ::boost::intrusive::bstree::empty()const
-   bool empty() const BOOST_NOEXCEPT;
-
-   //! @copydoc ::boost::intrusive::bstree::size()const
-   size_type size() const BOOST_NOEXCEPT;
-
-   //! @copydoc ::boost::intrusive::bstree::swap
-   void swap(splaytree_impl& other);
-
-   //! @copydoc ::boost::intrusive::bstree::clone_from(const bstree&,Cloner,Disposer)
-   //! Additional notes: it also copies the alpha factor from the source container.
-   template <class Cloner, class Disposer>
-   void clone_from(const splaytree_impl &src, Cloner cloner, Disposer disposer);
-
-   #else //BOOST_INTRUSIVE_DOXYGEN_INVOKED
-
-   using tree_type::clone_from;
-
-   #endif   //#ifdef BOOST_INTRUSIVE_DOXYGEN_INVOKED
-
-   //! @copydoc ::boost::intrusive::bstree::clone_from(bstree&&,Cloner,Disposer)
-   template <class Cloner, class Disposer>
-   void clone_from(BOOST_RV_REF(splaytree_impl) src, Cloner cloner, Disposer disposer)
-   {  tree_type::clone_from(BOOST_MOVE_BASE(tree_type, src), cloner, disposer);  }
-
-   #ifdef BOOST_INTRUSIVE_DOXYGEN_INVOKED
-
-   //! @copydoc ::boost::intrusive::bstree::insert_equal(reference)
-   iterator insert_equal(reference value);
-
-   //! @copydoc ::boost::intrusive::bstree::insert_equal(const_iterator,reference)
-   iterator insert_equal(const_iterator hint, reference value);
-
-   //! @copydoc ::boost::intrusive::bstree::insert_equal(Iterator,Iterator)
-   template<class Iterator>
-   void insert_equal(Iterator b, Iterator e);
-
-   //! @copydoc ::boost::intrusive::bstree::insert_unique(reference)
-   std::pair<iterator, bool> insert_unique(reference value);
-
-   //! @copydoc ::boost::intrusive::bstree::insert_unique(const_iterator,reference)
-   iterator insert_unique(const_iterator hint, reference value);
-
-   //! @copydoc ::boost::intrusive::bstree::insert_unique_check(const key_type&,insert_commit_data&)
-   std::pair<iterator, bool> insert_unique_check
-      (const key_type &key, insert_commit_data &commit_data);
-
-   //! @copydoc ::boost::intrusive::bstree::insert_unique_check(const_iterator,const key_type&,insert_commit_data&)
-   std::pair<iterator, bool> insert_unique_check
-      (const_iterator hint, const key_type &key, insert_commit_data &commit_data);
-
-   //! @copydoc ::boost::intrusive::bstree::insert_unique_check(const KeyType&,KeyTypeKeyCompare,insert_commit_data&)
-   template<class KeyType, class KeyTypeKeyCompare>
-   std::pair<iterator, bool> insert_unique_check
-      (const KeyType &key, KeyTypeKeyCompare comp, insert_commit_data &commit_data);
-
-   //! @copydoc ::boost::intrusive::bstree::insert_unique_check(const_iterator,const KeyType&,KeyTypeKeyCompare,insert_commit_data&)
-   template<class KeyType, class KeyTypeKeyCompare>
-   std::pair<iterator, bool> insert_unique_check
-      (const_iterator hint, const KeyType &key
-      ,KeyTypeKeyCompare comp, insert_commit_data &commit_data);
-
-   //! @copydoc ::boost::intrusive::bstree::insert_unique_commit
-   iterator insert_unique_commit(reference value, const insert_commit_data &commit_data) BOOST_NOEXCEPT;
-
-   //! @copydoc ::boost::intrusive::bstree::insert_unique(Iterator,Iterator)
-   template<class Iterator>
-   void insert_unique(Iterator b, Iterator e);
-
-   //! @copydoc ::boost::intrusive::bstree::insert_before
-   iterator insert_before(const_iterator pos, reference value) BOOST_NOEXCEPT;
-
-   //! @copydoc ::boost::intrusive::bstree::push_back
-   void push_back(reference value) BOOST_NOEXCEPT;
-
-   //! @copydoc ::boost::intrusive::bstree::push_front
-   void push_front(reference value) BOOST_NOEXCEPT;
-
-   //! @copydoc ::boost::intrusive::bstree::erase(const_iterator)
-   iterator erase(const_iterator i) BOOST_NOEXCEPT;
-
-   //! @copydoc ::boost::intrusive::bstree::erase(const_iterator,const_iterator)
-   iterator erase(const_iterator b, const_iterator e) BOOST_NOEXCEPT;
-
-   //! @copydoc ::boost::intrusive::bstree::erase(const key_type &)
-   size_type erase(const key_type &key);
-
-   //! @copydoc ::boost::intrusive::bstree::erase(const KeyType&,KeyTypeKeyCompare)
-   template<class KeyType, class KeyTypeKeyCompare>
-   size_type erase(const KeyType& key, KeyTypeKeyCompare comp);
-
-   //! @copydoc ::boost::intrusive::bstree::erase_and_dispose(const_iterator,Disposer)
-   template<class Disposer>
-   iterator erase_and_dispose(const_iterator i, Disposer disposer) BOOST_NOEXCEPT;
-
-   //! @copydoc ::boost::intrusive::bstree::erase_and_dispose(const_iterator,const_iterator,Disposer)
-   template<class Disposer>
-   iterator erase_and_dispose(const_iterator b, const_iterator e, Disposer disposer) BOOST_NOEXCEPT;
-
-   //! @copydoc ::boost::intrusive::bstree::erase_and_dispose(const key_type &, Disposer)
-   template<class Disposer>
-   size_type erase_and_dispose(const key_type &key, Disposer disposer);
-
-   //! @copydoc ::boost::intrusive::bstree::erase_and_dispose(const KeyType&,KeyTypeKeyCompare,Disposer)
-   template<class KeyType, class KeyTypeKeyCompare, class Disposer>
-   size_type erase_and_dispose(const KeyType& key, KeyTypeKeyCompare comp, Disposer disposer);
-
-   //! @copydoc ::boost::intrusive::bstree::clear
-   void clear() BOOST_NOEXCEPT;
-
-   //! @copydoc ::boost::intrusive::bstree::clear_and_dispose
-   template<class Disposer>
-   void clear_and_dispose(Disposer disposer) BOOST_NOEXCEPT;
-
-   //! @copydoc ::boost::intrusive::bstree::count(const key_type &)const
-   //! Additional note: non-const function, splaying is performed.
-   size_type count(const key_type &key);
-
-   //! @copydoc ::boost::intrusive::bstree::count(const KeyType&,KeyTypeKeyCompare)const
-   //! Additional note: non-const function, splaying is performed.
-   template<class KeyType, class KeyTypeKeyCompare>
-   size_type count(const KeyType &key, KeyTypeKeyCompare comp);
-
-   //! @copydoc ::boost::intrusive::bstree::count(const key_type &)const
-   //! Additional note: const function, no splaying is performed
-   size_type count(const key_type &key) const;
-
-   //! @copydoc ::boost::intrusive::bstree::count(const KeyType&,KeyTypeKeyCompare)const
-   //! Additional note: const function, no splaying is performed
-   template<class KeyType, class KeyTypeKeyCompare>
-   size_type count(const KeyType &key, KeyTypeKeyCompare comp) const;
-
-   //! @copydoc ::boost::intrusive::bstree::lower_bound(const key_type &)
-   //! Additional note: non-const function, splaying is performed.
-   iterator lower_bound(const key_type &key);
-
-   //! @copydoc ::boost::intrusive::bstree::lower_bound(const key_type &)const
-   //! Additional note: const function, no splaying is performed
-   const_iterator lower_bound(const key_type &key) const;
-
-   //! @copydoc ::boost::intrusive::bstree::lower_bound(const KeyType&,KeyTypeKeyCompare)
-   //! Additional note: non-const function, splaying is performed for the first
-   //! element of the equal range of "key"
-   template<class KeyType, class KeyTypeKeyCompare>
-   iterator lower_bound(const KeyType &key, KeyTypeKeyCompare comp);
-
-   //! @copydoc ::boost::intrusive::bstree::lower_bound(const KeyType&,KeyTypeKeyCompare)const
-   //! Additional note: const function, no splaying is performed
-   template<class KeyType, class KeyTypeKeyCompare>
-   const_iterator lower_bound(const KeyType &key, KeyTypeKeyCompare comp) const;
-
-   //! @copydoc ::boost::intrusive::bstree::upper_bound(const key_type &)
-   //! Additional note: non-const function, splaying is performed for the first
-   //! element of the equal range of "value"
-   iterator upper_bound(const key_type &key);
-
-   //! @copydoc ::boost::intrusive::bstree::upper_bound(const key_type &)const
-   //! Additional note: const function, no splaying is performed
-   const_iterator upper_bound(const key_type &key) const;
-
-   //! @copydoc ::boost::intrusive::bstree::upper_bound(const KeyType&,KeyTypeKeyCompare)
-   //! Additional note: non-const function, splaying is performed for the first
-   //! element of the equal range of "key"
-   template<class KeyType, class KeyTypeKeyCompare>
-   iterator upper_bound(const KeyType &key, KeyTypeKeyCompare comp);
-
-   //! @copydoc ::boost::intrusive::bstree::upper_bound(const KeyType&,KeyTypeKeyCompare)const
-   //! Additional note: const function, no splaying is performed
-   template<class KeyType, class KeyTypeKeyCompare>
-   const_iterator upper_bound(const KeyType &key, KeyTypeKeyCompare comp) const;
-
-   //! @copydoc ::boost::intrusive::bstree::find(const key_type &)
-   //! Additional note: non-const function, splaying is performed for the first
-   //! element of the equal range of "value"
-   iterator find(const key_type &key);
-
-   //! @copydoc ::boost::intrusive::bstree::find(const key_type &)const
-   //! Additional note: const function, no splaying is performed
-   const_iterator find(const key_type &key) const;
-
-   //! @copydoc ::boost::intrusive::bstree::find(const KeyType&,KeyTypeKeyCompare)
-   //! Additional note: non-const function, splaying is performed for the first
-   //! element of the equal range of "key"
-   template<class KeyType, class KeyTypeKeyCompare>
-   iterator find(const KeyType &key, KeyTypeKeyCompare comp);
-
-   //! @copydoc ::boost::intrusive::bstree::find(const KeyType&,KeyTypeKeyCompare)const
-   //! Additional note: const function, no splaying is performed
-   template<class KeyType, class KeyTypeKeyCompare>
-   const_iterator find(const KeyType &key, KeyTypeKeyCompare comp) const;
-
-   //! @copydoc ::boost::intrusive::bstree::equal_range(const key_type &)
-   //! Additional note: non-const function, splaying is performed for the first
-   //! element of the equal range of "value"
-   std::pair<iterator, iterator> equal_range(const key_type &key);
-
-   //! @copydoc ::boost::intrusive::bstree::equal_range(const key_type &)const
-   //! Additional note: const function, no splaying is performed
-   std::pair<const_iterator, const_iterator> equal_range(const key_type &key) const;
-
-   //! @copydoc ::boost::intrusive::bstree::equal_range(const KeyType&,KeyTypeKeyCompare)
-   //! Additional note: non-const function, splaying is performed for the first
-   //! element of the equal range of "key"
-   template<class KeyType, class KeyTypeKeyCompare>
-   std::pair<iterator, iterator> equal_range(const KeyType &key, KeyTypeKeyCompare comp);
-
-   //! @copydoc ::boost::intrusive::bstree::equal_range(const KeyType&,KeyTypeKeyCompare)const
-   //! Additional note: const function, no splaying is performed
-   template<class KeyType, class KeyTypeKeyCompare>
-   std::pair<const_iterator, const_iterator> equal_range(const KeyType &key, KeyTypeKeyCompare comp) const;
-
-   //! @copydoc ::boost::intrusive::bstree::bounded_range(const key_type &,const key_type &,bool,bool)
-   std::pair<iterator,iterator> bounded_range
-      (const key_type &lower_key, const key_type &upper_key, bool left_closed, bool right_closed);
-
-   //! @copydoc ::boost::intrusive::bstree::bounded_range(const KeyType&,const KeyType&,KeyTypeKeyCompare,bool,bool)
-   template<class KeyType, class KeyTypeKeyCompare>
-   std::pair<iterator,iterator> bounded_range
-      (const KeyType& lower_key, const KeyType& upper_key, KeyTypeKeyCompare comp, bool left_closed, bool right_closed);
-
-   //! @copydoc ::boost::intrusive::bstree::bounded_range(const key_type &,const key_type &,bool,bool)const
-   std::pair<const_iterator, const_iterator> bounded_range
-      (const key_type &lower_key, const key_type &upper_key, bool left_closed, bool right_closed) const;
-
-   //! @copydoc ::boost::intrusive::bstree::bounded_range(const KeyType&,const KeyType&,KeyTypeKeyCompare,bool,bool)const
-   template<class KeyType, class KeyTypeKeyCompare>
-   std::pair<const_iterator, const_iterator> bounded_range
-         (const KeyType& lower_key, const KeyType& upper_key, KeyTypeKeyCompare comp, bool left_closed, bool right_closed) const;
-
-   //! @copydoc ::boost::intrusive::bstree::s_iterator_to(reference)
-   static iterator s_iterator_to(reference value) BOOST_NOEXCEPT;
-
-   //! @copydoc ::boost::intrusive::bstree::s_iterator_to(const_reference)
-   static const_iterator s_iterator_to(const_reference value) BOOST_NOEXCEPT;
-
-   //! @copydoc ::boost::intrusive::bstree::iterator_to(reference)
-   iterator iterator_to(reference value) BOOST_NOEXCEPT;
-
-   //! @copydoc ::boost::intrusive::bstree::iterator_to(const_reference)const
-   const_iterator iterator_to(const_reference value) const BOOST_NOEXCEPT;
-
-   //! @copydoc ::boost::intrusive::bstree::init_node(reference)
-   static void init_node(reference value) BOOST_NOEXCEPT;
-
-   //! @copydoc ::boost::intrusive::bstree::unlink_leftmost_without_rebalance
-   pointer unlink_leftmost_without_rebalance() BOOST_NOEXCEPT;
-
-   //! @copydoc ::boost::intrusive::bstree::replace_node
-   void replace_node(iterator replace_this, reference with_this) BOOST_NOEXCEPT;
-
-   //! @copydoc ::boost::intrusive::bstree::remove_node
-   void remove_node(reference value) BOOST_NOEXCEPT;
-
-   //! @copydoc ::boost::intrusive::bstree::merge_unique(bstree<T, Options2...>&)
-   template<class T, class ...Options2>
-   void merge_unique(splaytree<T, Options2...> &);
-
-   //! @copydoc ::boost::intrusive::bstree::merge_equal(bstree<T, Options2...>&)
-   template<class T, class ...Options2>
-   void merge_equal(splaytree<T, Options2...> &);
-
-   #endif   //#ifdef BOOST_INTRUSIVE_DOXYGEN_INVOKED
-
-   //! <b>Requires</b>: i must be a valid iterator of *this.
-   //!
-   //! <b>Effects</b>: Rearranges the container so that the element pointed by i
-   //!   is placed as the root of the tree, improving future searches of this value.
-   //!
-   //! <b>Complexity</b>: Amortized logarithmic.
-   //!
-   //! <b>Throws</b>: Nothing.
-   void splay_up(iterator i) BOOST_NOEXCEPT
-   {  return node_algorithms::splay_up(i.pointed_node(), tree_type::header_ptr());   }
-
-   //! <b>Effects</b>: Rearranges the container so that if *this stores an element
-   //!   with a key equivalent to value the element is placed as the root of the
-   //!   tree. If the element is not present returns the last node compared with the key.
-   //!   If the tree is empty, end() is returned.
-   //!
-   //! <b>Complexity</b>: Amortized logarithmic.
-   //!
-   //! <b>Returns</b>: An iterator to the new root of the tree, end() if the tree is empty.
-   //!
-   //! <b>Throws</b>: If the comparison functor throws.
-   template<class KeyType, class KeyTypeKeyCompare>
-   iterator splay_down(const KeyType &key, KeyTypeKeyCompare comp)
-   {
-      detail::key_nodeptr_comp<value_compare, value_traits>
-         key_node_comp(comp, &this->get_value_traits());
-      node_ptr r = node_algorithms::splay_down(tree_type::header_ptr(), key, key_node_comp);
-      return iterator(r, this->priv_value_traits_ptr());
-   }
-
-   //! <b>Effects</b>: Rearranges the container so that if *this stores an element
-   //!   with a key equivalent to value the element is placed as the root of the
-   //!   tree.
-   //!
-   //! <b>Complexity</b>: Amortized logarithmic.
-   //!
-   //! <b>Returns</b>: An iterator to the new root of the tree, end() if the tree is empty.
-   //!
-   //! <b>Throws</b>: If the predicate throws.
-   iterator splay_down(const key_type &key)
-   {  return this->splay_down(key, this->key_comp());   }
-
-   #ifdef BOOST_INTRUSIVE_DOXYGEN_INVOKED
-   //! @copydoc ::boost::intrusive::bstree::rebalance
-   void rebalance() BOOST_NOEXCEPT;
-
-   //! @copydoc ::boost::intrusive::bstree::rebalance_subtree
-   iterator rebalance_subtree(iterator root) BOOST_NOEXCEPT;
-
-   friend bool operator< (const splaytree_impl &x, const splaytree_impl &y);
-
-   friend bool operator==(const splaytree_impl &x, const splaytree_impl &y);
-
-   friend bool operator!= (const splaytree_impl &x, const splaytree_impl &y);
-
-   friend bool operator>(const splaytree_impl &x, const splaytree_impl &y);
-
-   friend bool operator<=(const splaytree_impl &x, const splaytree_impl &y);
-
-   friend bool operator>=(const splaytree_impl &x, const splaytree_impl &y);
-
-   friend void swap(splaytree_impl &x, splaytree_impl &y);
-
-   #endif   //#ifdef BOOST_INTRUSIVE_DOXYGEN_INVOKED
-};
-
-//! Helper metafunction to define a \c splaytree that yields to the same type when the
-//! same options (either explicitly or implicitly) are used.
-#if defined(BOOST_INTRUSIVE_DOXYGEN_INVOKED) || defined(BOOST_INTRUSIVE_VARIADIC_TEMPLATES)
-template<class T, class ...Options>
-#else
-template<class T, class O1 = void, class O2 = void
-                , class O3 = void, class O4 = void
-                , class O5 = void, class O6 = void>
-#endif
-struct make_splaytree
-{
-   /// @cond
-   typedef typename pack_options
-      < splaytree_defaults,
-      #if !defined(BOOST_INTRUSIVE_VARIADIC_TEMPLATES)
-      O1, O2, O3, O4, O5, O6
-      #else
-      Options...
-      #endif
-      >::type packed_options;
-
-   typedef typename detail::get_value_traits
-      <T, typename packed_options::proto_value_traits>::type value_traits;
-
-   typedef splaytree_impl
-         < value_traits
-         , typename packed_options::key_of_value
-         , typename packed_options::compare
-         , typename packed_options::size_type
-         , packed_options::constant_time_size
-         , typename packed_options::header_holder_type
-         > implementation_defined;
-   /// @endcond
-   typedef implementation_defined type;
-};
-
-
-#ifndef BOOST_INTRUSIVE_DOXYGEN_INVOKED
-
-#if !defined(BOOST_INTRUSIVE_VARIADIC_TEMPLATES)
-template<class T, class O1, class O2, class O3, class O4, class O5, class O6>
-#else
-template<class T, class ...Options>
-#endif
-class splaytree
-   :  public make_splaytree<T,
-      #if !defined(BOOST_INTRUSIVE_VARIADIC_TEMPLATES)
-      O1, O2, O3, O4, O5, O6
-      #else
-      Options...
-      #endif
-      >::type
-{
-   typedef typename make_splaytree
-      <T,
-      #if !defined(BOOST_INTRUSIVE_VARIADIC_TEMPLATES)
-      O1, O2, O3, O4, O5, O6
-      #else
-      Options...
-      #endif
-      >::type   Base;
-   BOOST_MOVABLE_BUT_NOT_COPYABLE(splaytree)
-
-   public:
-   typedef typename Base::key_compare        key_compare;
-   typedef typename Base::value_traits       value_traits;
-   typedef typename Base::iterator           iterator;
-   typedef typename Base::const_iterator     const_iterator;
-   typedef typename Base::reverse_iterator           reverse_iterator;
-   typedef typename Base::const_reverse_iterator     const_reverse_iterator;
-
-   //Assert if passed value traits are compatible with the type
-   BOOST_STATIC_ASSERT((detail::is_same<typename value_traits::value_type, T>::value));
-
-   BOOST_INTRUSIVE_FORCEINLINE splaytree()
-      :  Base()
-   {}
-
-   BOOST_INTRUSIVE_FORCEINLINE explicit splaytree( const key_compare &cmp, const value_traits &v_traits = value_traits())
-      :  Base(cmp, v_traits)
-   {}
-
-   template<class Iterator>
-   BOOST_INTRUSIVE_FORCEINLINE splaytree( bool unique, Iterator b, Iterator e
-         , const key_compare &cmp = key_compare()
-         , const value_traits &v_traits = value_traits())
-      :  Base(unique, b, e, cmp, v_traits)
-   {}
-
-   BOOST_INTRUSIVE_FORCEINLINE splaytree(BOOST_RV_REF(splaytree) x)
-      :  Base(BOOST_MOVE_BASE(Base, x))
-   {}
-
-   BOOST_INTRUSIVE_FORCEINLINE splaytree& operator=(BOOST_RV_REF(splaytree) x)
-   {  return static_cast<splaytree &>(this->Base::operator=(BOOST_MOVE_BASE(Base, x)));  }
-
-   template <class Cloner, class Disposer>
-   BOOST_INTRUSIVE_FORCEINLINE void clone_from(const splaytree &src, Cloner cloner, Disposer disposer)
-   {  Base::clone_from(src, cloner, disposer);  }
-
-   template <class Cloner, class Disposer>
-   BOOST_INTRUSIVE_FORCEINLINE void clone_from(BOOST_RV_REF(splaytree) src, Cloner cloner, Disposer disposer)
-   {  Base::clone_from(BOOST_MOVE_BASE(Base, src), cloner, disposer);  }
-
-   BOOST_INTRUSIVE_FORCEINLINE static splaytree &container_from_end_iterator(iterator end_iterator) BOOST_NOEXCEPT
-   {  return static_cast<splaytree &>(Base::container_from_end_iterator(end_iterator));   }
-
-   BOOST_INTRUSIVE_FORCEINLINE static const splaytree &container_from_end_iterator(const_iterator end_iterator) BOOST_NOEXCEPT
-   {  return static_cast<const splaytree &>(Base::container_from_end_iterator(end_iterator));   }
-
-   BOOST_INTRUSIVE_FORCEINLINE static splaytree &container_from_iterator(iterator it) BOOST_NOEXCEPT
-   {  return static_cast<splaytree &>(Base::container_from_iterator(it));   }
-
-   BOOST_INTRUSIVE_FORCEINLINE static const splaytree &container_from_iterator(const_iterator it) BOOST_NOEXCEPT
-   {  return static_cast<const splaytree &>(Base::container_from_iterator(it));   }
-};
-
-#endif
-
-} //namespace intrusive
-} //namespace boost
-
-#include <boost/intrusive/detail/config_end.hpp>
-
-#endif //BOOST_INTRUSIVE_SPLAYTREE_HPP
diff --git a/src/boost/intrusive/splaytree_algorithms.hpp b/src/boost/intrusive/splaytree_algorithms.hpp
deleted file mode 100644
index bef440a8..00000000
--- a/src/boost/intrusive/splaytree_algorithms.hpp
+++ /dev/null
@@ -1,756 +0,0 @@
-/////////////////////////////////////////////////////////////////////////////
-//
-// (C) Copyright Ion Gaztanaga  2007-2014
-//
-// Distributed under the Boost 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/intrusive for documentation.
-//
-/////////////////////////////////////////////////////////////////////////////
-// The implementation of splay trees is based on the article and code published
-// in C++ Users Journal "Implementing Splay Trees in C++" (September 1, 2005).
-//
-// The splay code has been modified and (supposedly) improved by Ion Gaztanaga.
-//
-// Here is the copyright notice of the original file containing the splay code:
-//
-//  splay_tree.h -- implementation of a STL compatible splay tree.
-//
-//  Copyright (c) 2004 Ralf Mattethat
-//
-//  Permission to copy, use, modify, sell and distribute this software
-//  is granted provided this copyright notice appears in all copies.
-//  This software is provided "as is" without express or implied
-//  warranty, and with no claim as to its suitability for any purpose.
-//
-/////////////////////////////////////////////////////////////////////////////
-
-#ifndef BOOST_INTRUSIVE_SPLAYTREE_ALGORITHMS_HPP
-#define BOOST_INTRUSIVE_SPLAYTREE_ALGORITHMS_HPP
-
-#include <boost/intrusive/detail/config_begin.hpp>
-#include <boost/intrusive/intrusive_fwd.hpp>
-#include <boost/intrusive/detail/assert.hpp>
-#include <boost/intrusive/detail/algo_type.hpp>
-#include <boost/intrusive/detail/uncast.hpp>
-#include <boost/intrusive/bstree_algorithms.hpp>
-
-#include <cstddef>
-
-#if defined(BOOST_HAS_PRAGMA_ONCE)
-#  pragma once
-#endif
-
-namespace boost {
-namespace intrusive {
-
-/// @cond
-namespace detail {
-
-template<class NodeTraits>
-struct splaydown_assemble_and_fix_header
-{
-   typedef typename NodeTraits::node_ptr node_ptr;
-
-   splaydown_assemble_and_fix_header(node_ptr t, node_ptr header, node_ptr leftmost, node_ptr rightmost) BOOST_NOEXCEPT
-      : t_(t)
-      , null_node_(header)
-      , l_(null_node_)
-      , r_(null_node_)
-      , leftmost_(leftmost)
-      , rightmost_(rightmost)
-   {}
-
-   ~splaydown_assemble_and_fix_header()
-   {
-      this->assemble();
-
-      //Now recover the original header except for the
-      //splayed root node.
-      //"t_" is the current root and "null_node_" is the header node
-      NodeTraits::set_parent(null_node_, t_);
-      NodeTraits::set_parent(t_, null_node_);
-      //Recover leftmost/rightmost pointers
-      NodeTraits::set_left (null_node_, leftmost_);
-      NodeTraits::set_right(null_node_, rightmost_);
-   }
-
-   private:
-
-   void assemble() BOOST_NOEXCEPT
-   {
-      //procedure assemble;
-      //    left(r), right(l) := right(t), left(t);
-      //    left(t), right(t) := right(null), left(null);
-      //end assemble;
-      {  //    left(r), right(l) := right(t), left(t);
-
-         node_ptr const old_t_left  = NodeTraits::get_left(t_);
-         node_ptr const old_t_right = NodeTraits::get_right(t_);
-         NodeTraits::set_right(l_, old_t_left);
-         NodeTraits::set_left (r_, old_t_right);
-         if(old_t_left){
-            NodeTraits::set_parent(old_t_left, l_);
-         }
-         if(old_t_right){
-            NodeTraits::set_parent(old_t_right, r_);
-         }
-      }
-      {  //    left(t), right(t) := right(null), left(null);
-         node_ptr const null_right = NodeTraits::get_right(null_node_);
-         node_ptr const null_left  = NodeTraits::get_left(null_node_);
-         NodeTraits::set_left (t_, null_right);
-         NodeTraits::set_right(t_, null_left);
-         if(null_right){
-            NodeTraits::set_parent(null_right, t_);
-         }
-         if(null_left){
-            NodeTraits::set_parent(null_left, t_);
-         }
-      }
-   }
-
-   public:
-   node_ptr t_, null_node_, l_, r_, leftmost_, rightmost_;
-};
-
-}  //namespace detail {
-/// @endcond
-
-//!   A splay tree is an implementation of a binary search tree. The tree is
-//!   self balancing using the splay algorithm as described in
-//!
-//!      "Self-Adjusting Binary Search Trees
-//!      by Daniel Dominic Sleator and Robert Endre Tarjan
-//!      AT&T Bell Laboratories, Murray Hill, NJ
-//!      Journal of the ACM, Vol 32, no 3, July 1985, pp 652-686
-//!
-//! splaytree_algorithms is configured with a NodeTraits class, which encapsulates the
-//! information about the node to be manipulated. NodeTraits must support the
-//! following interface:
-//!
-//! <b>Typedefs</b>:
-//!
-//! <tt>node</tt>: The type of the node that forms the binary search tree
-//!
-//! <tt>node_ptr</tt>: A pointer to a node
-//!
-//! <tt>const_node_ptr</tt>: A pointer to a const node
-//!
-//! <b>Static functions</b>:
-//!
-//! <tt>static node_ptr get_parent(const_node_ptr n);</tt>
-//!
-//! <tt>static void set_parent(node_ptr n, node_ptr parent);</tt>
-//!
-//! <tt>static node_ptr get_left(const_node_ptr n);</tt>
-//!
-//! <tt>static void set_left(node_ptr n, node_ptr left);</tt>
-//!
-//! <tt>static node_ptr get_right(const_node_ptr n);</tt>
-//!
-//! <tt>static void set_right(node_ptr n, node_ptr right);</tt>
-template<class NodeTraits>
-class splaytree_algorithms
-   #ifndef BOOST_INTRUSIVE_DOXYGEN_INVOKED
-   : public bstree_algorithms<NodeTraits>
-   #endif
-{
-   /// @cond
-   private:
-   typedef bstree_algorithms<NodeTraits> bstree_algo;
-   /// @endcond
-
-   public:
-   typedef typename NodeTraits::node            node;
-   typedef NodeTraits                           node_traits;
-   typedef typename NodeTraits::node_ptr        node_ptr;
-   typedef typename NodeTraits::const_node_ptr  const_node_ptr;
-
-   //! This type is the information that will be
-   //! filled by insert_unique_check
-   typedef typename bstree_algo::insert_commit_data insert_commit_data;
-
-   public:
-   #ifdef BOOST_INTRUSIVE_DOXYGEN_INVOKED
-   //! @copydoc ::boost::intrusive::bstree_algorithms::get_header(const_node_ptr)
-   static node_ptr get_header(const_node_ptr n) BOOST_NOEXCEPT;
-
-   //! @copydoc ::boost::intrusive::bstree_algorithms::begin_node
-   static node_ptr begin_node(const_node_ptr header) BOOST_NOEXCEPT;
-
-   //! @copydoc ::boost::intrusive::bstree_algorithms::end_node
-   static node_ptr end_node(const_node_ptr header) BOOST_NOEXCEPT;
-
-   //! @copydoc ::boost::intrusive::bstree_algorithms::swap_tree
-   static void swap_tree(node_ptr header1, node_ptr header2);
-
-   //! @copydoc ::boost::intrusive::bstree_algorithms::swap_nodes(node_ptr,node_ptr)
-   static void swap_nodes(node_ptr node1, node_ptr node2) BOOST_NOEXCEPT;
-
-   //! @copydoc ::boost::intrusive::bstree_algorithms::swap_nodes(node_ptr,node_ptr,node_ptr,node_ptr)
-   static void swap_nodes(node_ptr node1, node_ptr header1, node_ptr node2, node_ptr header2) BOOST_NOEXCEPT;
-
-   //! @copydoc ::boost::intrusive::bstree_algorithms::replace_node(node_ptr,node_ptr)
-   static void replace_node(node_ptr node_to_be_replaced, node_ptr new_node) BOOST_NOEXCEPT;
-
-   //! @copydoc ::boost::intrusive::bstree_algorithms::replace_node(node_ptr,node_ptr,node_ptr)
-   static void replace_node(node_ptr node_to_be_replaced, node_ptr header, node_ptr new_node) BOOST_NOEXCEPT;
-
-   //! @copydoc ::boost::intrusive::bstree_algorithms::unlink(node_ptr)
-   static void unlink(node_ptr n) BOOST_NOEXCEPT;
-
-   //! @copydoc ::boost::intrusive::bstree_algorithms::unlink_leftmost_without_rebalance
-   static node_ptr unlink_leftmost_without_rebalance(node_ptr header) BOOST_NOEXCEPT;
-
-   //! @copydoc ::boost::intrusive::bstree_algorithms::unique(const_node_ptr)
-   static bool unique(const_node_ptr n) BOOST_NOEXCEPT;
-
-   //! @copydoc ::boost::intrusive::bstree_algorithms::size(const_node_ptr)
-   static std::size_t size(const_node_ptr header) BOOST_NOEXCEPT;
-
-   //! @copydoc ::boost::intrusive::bstree_algorithms::next_node(node_ptr)
-   static node_ptr next_node(node_ptr n) BOOST_NOEXCEPT;
-
-   //! @copydoc ::boost::intrusive::bstree_algorithms::prev_node(node_ptr)
-   static node_ptr prev_node(node_ptr n) BOOST_NOEXCEPT;
-
-   //! @copydoc ::boost::intrusive::bstree_algorithms::init(node_ptr)
-   static void init(node_ptr n) BOOST_NOEXCEPT;
-
-   //! @copydoc ::boost::intrusive::bstree_algorithms::init_header(node_ptr)
-   static void init_header(node_ptr header) BOOST_NOEXCEPT;
-
-   #endif   //#ifdef BOOST_INTRUSIVE_DOXYGEN_INVOKED
-
-   //! @copydoc ::boost::intrusive::bstree_algorithms::erase(node_ptr,node_ptr)
-   //! Additional notes: the previous node of z is splayed to speed up range deletions.
-   static void erase(node_ptr header, node_ptr z) BOOST_NOEXCEPT
-   {
-      //posibility 1
-      if(NodeTraits::get_left(z)){
-         splay_up(bstree_algo::prev_node(z), header);
-      }
-
-      //possibility 2
-      //if(NodeTraits::get_left(z)){
-      //   node_ptr l = NodeTraits::get_left(z);
-      //   splay_up(l, header);
-      //}
-
-      //if(NodeTraits::get_left(z)){
-      //   node_ptr l = bstree_algo::prev_node(z);
-      //   splay_up_impl(l, z);
-      //}
-
-      //possibility 4
-      //splay_up(z, header);
-
-      bstree_algo::erase(header, z);
-   }
-
-   //! @copydoc ::boost::intrusive::bstree_algorithms::transfer_unique
-   template<class NodePtrCompare>
-   static bool transfer_unique
-      (node_ptr header1, NodePtrCompare comp, node_ptr header2, node_ptr z)
-   {
-      typename bstree_algo::insert_commit_data commit_data;
-      bool const transferable = bstree_algo::insert_unique_check(header1, z, comp, commit_data).second;
-      if(transferable){
-         erase(header2, z);
-         bstree_algo::insert_commit(header1, z, commit_data);
-         splay_up(z, header1);
-      }
-      return transferable;
-   }
-
-   //! @copydoc ::boost::intrusive::bstree_algorithms::transfer_equal
-   template<class NodePtrCompare>
-   static void transfer_equal
-      (node_ptr header1, NodePtrCompare comp, node_ptr header2, node_ptr z)
-   {
-      insert_commit_data commit_data;
-      splay_down(header1, z, comp);
-      bstree_algo::insert_equal_upper_bound_check(header1, z, comp, commit_data);
-      erase(header2, z);
-      bstree_algo::insert_commit(header1, z, commit_data);
-   }
-
-   #ifdef BOOST_INTRUSIVE_DOXYGEN_INVOKED
-   //! @copydoc ::boost::intrusive::bstree_algorithms::clone(const_node_ptr,node_ptr,Cloner,Disposer)
-   template <class Cloner, class Disposer>
-   static void clone
-      (const_node_ptr source_header, node_ptr target_header, Cloner cloner, Disposer disposer);
-
-   //! @copydoc ::boost::intrusive::bstree_algorithms::clear_and_dispose(node_ptr,Disposer)
-   template<class Disposer>
-   static void clear_and_dispose(node_ptr header, Disposer disposer) BOOST_NOEXCEPT;
-
-   #endif   //#ifdef BOOST_INTRUSIVE_DOXYGEN_INVOKED
-   //! @copydoc ::boost::intrusive::bstree_algorithms::count(const_node_ptr,const KeyType&,KeyNodePtrCompare)
-   //! Additional notes: an element with key `key` is splayed.
-   template<class KeyType, class KeyNodePtrCompare>
-   static std::size_t count
-      (node_ptr header, const KeyType &key, KeyNodePtrCompare comp)
-   {
-      std::pair<node_ptr, node_ptr> ret = equal_range(header, key, comp);
-      std::size_t n = 0;
-      while(ret.first != ret.second){
-         ++n;
-         ret.first = next_node(ret.first);
-      }
-      return n;
-   }
-
-   //! @copydoc ::boost::intrusive::bstree_algorithms::count(const_node_ptr,const KeyType&,KeyNodePtrCompare)
-   //! Additional note: no splaying is performed
-   template<class KeyType, class KeyNodePtrCompare>
-   static std::size_t count
-      (const_node_ptr header, const KeyType &key, KeyNodePtrCompare comp)
-   {  return bstree_algo::count(header, key, comp);  }
-
-   //! @copydoc ::boost::intrusive::bstree_algorithms::lower_bound(const_node_ptr,const KeyType&,KeyNodePtrCompare)
-   //! Additional notes: the first node of the range is splayed.
-   template<class KeyType, class KeyNodePtrCompare>
-   static node_ptr lower_bound
-      (node_ptr header, const KeyType &key, KeyNodePtrCompare comp)
-   {
-      splay_down(detail::uncast(header), key, comp);
-      node_ptr y = bstree_algo::lower_bound(header, key, comp);
-      //splay_up(y, detail::uncast(header));
-      return y;
-   }
-
-   //! @copydoc ::boost::intrusive::bstree_algorithms::lower_bound(const_node_ptr,const KeyType&,KeyNodePtrCompare)
-   //! Additional note: no splaying is performed
-   template<class KeyType, class KeyNodePtrCompare>
-   static node_ptr lower_bound
-      (const_node_ptr header, const KeyType &key, KeyNodePtrCompare comp)
-   {  return bstree_algo::lower_bound(header, key, comp);  }
-
-   //! @copydoc ::boost::intrusive::bstree_algorithms::upper_bound(const_node_ptr,const KeyType&,KeyNodePtrCompare)
-   //! Additional notes: the first node of the range is splayed.
-   template<class KeyType, class KeyNodePtrCompare>
-   static node_ptr upper_bound
-      (node_ptr header, const KeyType &key, KeyNodePtrCompare comp)
-   {
-      splay_down(detail::uncast(header), key, comp);
-      node_ptr y = bstree_algo::upper_bound(header, key, comp);
-      //splay_up(y, detail::uncast(header));
-      return y;
-   }
-
-   //! @copydoc ::boost::intrusive::bstree_algorithms::upper_bound(const_node_ptr,const KeyType&,KeyNodePtrCompare)
-   //! Additional note: no splaying is performed
-   template<class KeyType, class KeyNodePtrCompare>
-   static node_ptr upper_bound
-      (const_node_ptr header, const KeyType &key, KeyNodePtrCompare comp)
-   {  return bstree_algo::upper_bound(header, key, comp);  }
-
-   //! @copydoc ::boost::intrusive::bstree_algorithms::find(const_node_ptr, const KeyType&,KeyNodePtrCompare)
-   //! Additional notes: the found node of the lower bound is splayed.
-   template<class KeyType, class KeyNodePtrCompare>
-   static node_ptr find
-      (node_ptr header, const KeyType &key, KeyNodePtrCompare comp)
-   {
-      splay_down(detail::uncast(header), key, comp);
-      return bstree_algo::find(header, key, comp);
-   }
-
-   //! @copydoc ::boost::intrusive::bstree_algorithms::find(const_node_ptr, const KeyType&,KeyNodePtrCompare)
-   //! Additional note: no splaying is performed
-   template<class KeyType, class KeyNodePtrCompare>
-   static node_ptr find
-      (const_node_ptr header, const KeyType &key, KeyNodePtrCompare comp)
-   {  return bstree_algo::find(header, key, comp);  }
-
-   //! @copydoc ::boost::intrusive::bstree_algorithms::equal_range(const_node_ptr,const KeyType&,KeyNodePtrCompare)
-   //! Additional notes: the first node of the range is splayed.
-   template<class KeyType, class KeyNodePtrCompare>
-   static std::pair<node_ptr, node_ptr> equal_range
-      (node_ptr header, const KeyType &key, KeyNodePtrCompare comp)
-   {
-      splay_down(detail::uncast(header), key, comp);
-      std::pair<node_ptr, node_ptr> ret = bstree_algo::equal_range(header, key, comp);
-      //splay_up(ret.first, detail::uncast(header));
-      return ret;
-   }
-
-   //! @copydoc ::boost::intrusive::bstree_algorithms::equal_range(const_node_ptr,const KeyType&,KeyNodePtrCompare)
-   //! Additional note: no splaying is performed
-   template<class KeyType, class KeyNodePtrCompare>
-   static std::pair<node_ptr, node_ptr> equal_range
-      (const_node_ptr header, const KeyType &key, KeyNodePtrCompare comp)
-   {  return bstree_algo::equal_range(header, key, comp);  }
-
-   //! @copydoc ::boost::intrusive::bstree_algorithms::lower_bound_range(const_node_ptr,const KeyType&,KeyNodePtrCompare)
-   //! Additional notes: the first node of the range is splayed.
-   template<class KeyType, class KeyNodePtrCompare>
-   static std::pair<node_ptr, node_ptr> lower_bound_range
-      (node_ptr header, const KeyType &key, KeyNodePtrCompare comp)
-   {
-      splay_down(detail::uncast(header), key, comp);
-      std::pair<node_ptr, node_ptr> ret = bstree_algo::lower_bound_range(header, key, comp);
-      //splay_up(ret.first, detail::uncast(header));
-      return ret;
-   }
-
-   //! @copydoc ::boost::intrusive::bstree_algorithms::lower_bound_range(const_node_ptr,const KeyType&,KeyNodePtrCompare)
-   //! Additional note: no splaying is performed
-   template<class KeyType, class KeyNodePtrCompare>
-   static std::pair<node_ptr, node_ptr> lower_bound_range
-      (const_node_ptr header, const KeyType &key, KeyNodePtrCompare comp)
-   {  return bstree_algo::lower_bound_range(header, key, comp);  }
-
-   //! @copydoc ::boost::intrusive::bstree_algorithms::bounded_range(const_node_ptr,const KeyType&,const KeyType&,KeyNodePtrCompare,bool,bool)
-   //! Additional notes: the first node of the range is splayed.
-   template<class KeyType, class KeyNodePtrCompare>
-   static std::pair<node_ptr, node_ptr> bounded_range
-      (node_ptr header, const KeyType &lower_key, const KeyType &upper_key, KeyNodePtrCompare comp
-      , bool left_closed, bool right_closed)
-   {
-      splay_down(detail::uncast(header), lower_key, comp);
-      std::pair<node_ptr, node_ptr> ret =
-         bstree_algo::bounded_range(header, lower_key, upper_key, comp, left_closed, right_closed);
-      //splay_up(ret.first, detail::uncast(header));
-      return ret;
-   }
-
-   //! @copydoc ::boost::intrusive::bstree_algorithms::bounded_range(const_node_ptr,const KeyType&,const KeyType&,KeyNodePtrCompare,bool,bool)
-   //! Additional note: no splaying is performed
-   template<class KeyType, class KeyNodePtrCompare>
-   static std::pair<node_ptr, node_ptr> bounded_range
-      (const_node_ptr header, const KeyType &lower_key, const KeyType &upper_key, KeyNodePtrCompare comp
-      , bool left_closed, bool right_closed)
-   {  return bstree_algo::bounded_range(header, lower_key, upper_key, comp, left_closed, right_closed);  }
-
-   //! @copydoc ::boost::intrusive::bstree_algorithms::insert_equal_upper_bound(node_ptr,node_ptr,NodePtrCompare)
-   //! Additional note: the inserted node is splayed
-   template<class NodePtrCompare>
-   static node_ptr insert_equal_upper_bound
-      (node_ptr header, node_ptr new_node, NodePtrCompare comp)
-   {
-      splay_down(header, new_node, comp);
-      return bstree_algo::insert_equal_upper_bound(header, new_node, comp);
-   }
-
-   //! @copydoc ::boost::intrusive::bstree_algorithms::insert_equal_lower_bound(node_ptr,node_ptr,NodePtrCompare)
-   //! Additional note: the inserted node is splayed
-   template<class NodePtrCompare>
-   static node_ptr insert_equal_lower_bound
-      (node_ptr header, node_ptr new_node, NodePtrCompare comp)
-   {
-      splay_down(header, new_node, comp);
-      return bstree_algo::insert_equal_lower_bound(header, new_node, comp);
-   }  
-
-   //! @copydoc ::boost::intrusive::bstree_algorithms::insert_equal(node_ptr,node_ptr,node_ptr,NodePtrCompare)
-   //! Additional note: the inserted node is splayed
-   template<class NodePtrCompare>
-   static node_ptr insert_equal
-      (node_ptr header, node_ptr hint, node_ptr new_node, NodePtrCompare comp)
-   {
-      splay_down(header, new_node, comp);
-      return bstree_algo::insert_equal(header, hint, new_node, comp);
-   }
-
-   //! @copydoc ::boost::intrusive::bstree_algorithms::insert_before(node_ptr,node_ptr,node_ptr)
-   //! Additional note: the inserted node is splayed
-   static node_ptr insert_before
-      (node_ptr header, node_ptr pos, node_ptr new_node) BOOST_NOEXCEPT
-   {
-      bstree_algo::insert_before(header, pos, new_node);
-      splay_up(new_node, header);
-      return new_node;
-   }
-
-   //! @copydoc ::boost::intrusive::bstree_algorithms::push_back(node_ptr,node_ptr)
-   //! Additional note: the inserted node is splayed
-   static void push_back(node_ptr header, node_ptr new_node) BOOST_NOEXCEPT
-   {
-      bstree_algo::push_back(header, new_node);
-      splay_up(new_node, header);
-   }
-
-   //! @copydoc ::boost::intrusive::bstree_algorithms::push_front(node_ptr,node_ptr)
-   //! Additional note: the inserted node is splayed
-   static void push_front(node_ptr header, node_ptr new_node) BOOST_NOEXCEPT
-   {
-      bstree_algo::push_front(header, new_node);
-      splay_up(new_node, header);
-   }
-
-   //! @copydoc ::boost::intrusive::bstree_algorithms::insert_unique_check(const_node_ptr,const KeyType&,KeyNodePtrCompare,insert_commit_data&)
-   //! Additional note: nodes with the given key are splayed
-   template<class KeyType, class KeyNodePtrCompare>
-   static std::pair<node_ptr, bool> insert_unique_check
-      (node_ptr header, const KeyType &key
-      ,KeyNodePtrCompare comp, insert_commit_data &commit_data)
-   {
-      splay_down(header, key, comp);
-      return bstree_algo::insert_unique_check(header, key, comp, commit_data);
-   }
-
-   //! @copydoc ::boost::intrusive::bstree_algorithms::insert_unique_check(const_node_ptr,node_ptr,const KeyType&,KeyNodePtrCompare,insert_commit_data&)
-   //! Additional note: nodes with the given key are splayed
-   template<class KeyType, class KeyNodePtrCompare>
-   static std::pair<node_ptr, bool> insert_unique_check
-      (node_ptr header, node_ptr hint, const KeyType &key
-      ,KeyNodePtrCompare comp, insert_commit_data &commit_data)
-   {
-      splay_down(header, key, comp);
-      return bstree_algo::insert_unique_check(header, hint, key, comp, commit_data);
-   }
-
-   #ifdef BOOST_INTRUSIVE_DOXYGEN_INVOKED
-   //! @copydoc ::boost::intrusive::bstree_algorithms::insert_unique_commit(node_ptr,node_ptr,const insert_commit_data&)
-   static void insert_unique_commit
-      (node_ptr header, node_ptr new_value, const insert_commit_data &commit_data) BOOST_NOEXCEPT;
-
-   //! @copydoc ::boost::intrusive::bstree_algorithms::is_header
-   static bool is_header(const_node_ptr p) BOOST_NOEXCEPT;
-
-   //! @copydoc ::boost::intrusive::bstree_algorithms::rebalance
-   static void rebalance(node_ptr header) BOOST_NOEXCEPT;
-
-   //! @copydoc ::boost::intrusive::bstree_algorithms::rebalance_subtree
-   static node_ptr rebalance_subtree(node_ptr old_root) BOOST_NOEXCEPT;
-
-   #endif   //#ifdef BOOST_INTRUSIVE_DOXYGEN_INVOKED
-
-   // bottom-up splay, use data_ as parent for n    | complexity : logarithmic    | exception : nothrow
-   static void splay_up(node_ptr n, node_ptr header) BOOST_NOEXCEPT
-   {  priv_splay_up<true>(n, header); }
-
-   // top-down splay | complexity : logarithmic    | exception : strong, note A
-   template<class KeyType, class KeyNodePtrCompare>
-   static node_ptr splay_down(node_ptr header, const KeyType &key, KeyNodePtrCompare comp, bool *pfound = 0)
-   {  return priv_splay_down<true>(header, key, comp, pfound);   }
-
-   private:
-
-   /// @cond
-
-   // bottom-up splay, use data_ as parent for n    | complexity : logarithmic    | exception : nothrow
-   template<bool SimpleSplay>
-   static void priv_splay_up(node_ptr n, node_ptr header) BOOST_NOEXCEPT
-   {
-      // If (node == header) do a splay for the right most node instead
-      // this is to boost performance of equal_range/count on equivalent containers in the case
-      // where there are many equal elements at the end
-      if(n == header)
-         n = NodeTraits::get_right(header);
-
-      node_ptr t(header);
-
-      if( n == t ) return;
-
-      for( ;; ){
-         node_ptr p(NodeTraits::get_parent(n));
-         node_ptr g(NodeTraits::get_parent(p));
-
-         if( p == t )   break;
-
-         if( g == t ){
-            // zig
-            rotate(n);
-         }
-         else if ((NodeTraits::get_left(p) == n && NodeTraits::get_left(g) == p)    ||
-                  (NodeTraits::get_right(p) == n && NodeTraits::get_right(g) == p)  ){
-            // zig-zig
-            rotate(p);
-            rotate(n);
-         }
-         else {
-            // zig-zag
-            rotate(n);
-            if(!SimpleSplay){
-               rotate(n);
-            }
-         }
-      }
-   }
-
-   template<bool SimpleSplay, class KeyType, class KeyNodePtrCompare>
-   static node_ptr priv_splay_down(node_ptr header, const KeyType &key, KeyNodePtrCompare comp, bool *pfound = 0)
-   {
-      //Most splay tree implementations use a dummy/null node to implement.
-      //this function. This has some problems for a generic library like Intrusive:
-      //
-      // * The node might not have a default constructor.
-      // * The default constructor could throw.
-      //
-      //We already have a header node. Leftmost and rightmost nodes of the tree
-      //are not changed when splaying (because the invariants of the tree don't
-      //change) We can back up them, use the header as the null node and
-      //reassign old values after the function has been completed.
-      node_ptr const old_root  = NodeTraits::get_parent(header);
-      node_ptr const leftmost  = NodeTraits::get_left(header);
-      node_ptr const rightmost = NodeTraits::get_right(header);
-      if(leftmost == rightmost){ //Empty or unique node
-         if(pfound){
-            *pfound = old_root && !comp(key, old_root) && !comp(old_root, key);
-         }
-         return old_root ? old_root : header;
-      }
-      else{
-         //Initialize "null node" (the header in our case)
-         NodeTraits::set_left (header, node_ptr());
-         NodeTraits::set_right(header, node_ptr());
-         //Class that will backup leftmost/rightmost from header, commit the assemble(),
-         //and will restore leftmost/rightmost to header even if "comp" throws
-         detail::splaydown_assemble_and_fix_header<NodeTraits> commit(old_root, header, leftmost, rightmost);
-         bool found = false;
-
-         for( ;; ){
-            if(comp(key, commit.t_)){
-               node_ptr const t_left = NodeTraits::get_left(commit.t_);
-               if(!t_left)
-                  break;
-               if(comp(key, t_left)){
-                  bstree_algo::rotate_right_no_parent_fix(commit.t_, t_left);
-                  commit.t_ = t_left;
-                  if( !NodeTraits::get_left(commit.t_) )
-                     break;
-                  link_right(commit.t_, commit.r_);
-               }
-               else{
-                  link_right(commit.t_, commit.r_);
-                  if(!SimpleSplay && comp(t_left, key)){
-                     if( !NodeTraits::get_right(commit.t_) )
-                        break;
-                     link_left(commit.t_, commit.l_);
-                  }
-               }
-            }
-            else if(comp(commit.t_, key)){
-               node_ptr const t_right = NodeTraits::get_right(commit.t_);
-               if(!t_right)
-                  break;
-
-               if(comp(t_right, key)){
-                     bstree_algo::rotate_left_no_parent_fix(commit.t_, t_right);
-                     commit.t_ = t_right;
-                     if( !NodeTraits::get_right(commit.t_) )
-                        break;
-                     link_left(commit.t_, commit.l_);
-               }
-               else{
-                  link_left(commit.t_, commit.l_);
-                  if(!SimpleSplay && comp(key, t_right)){
-                     if( !NodeTraits::get_left(commit.t_) )
-                        break;
-                     link_right(commit.t_, commit.r_);
-                  }
-               }
-            }
-            else{
-               found = true;
-               break;
-            }
-         }
-
-         //commit.~splaydown_assemble_and_fix_header<NodeTraits>() will first
-         //"assemble()" + link the new root & recover header's leftmost & rightmost
-         if(pfound){
-            *pfound = found;
-         }
-         return commit.t_;
-      }
-   }
-
-   // break link to left child node and attach it to left tree pointed to by l   | complexity : constant | exception : nothrow
-   static void link_left(node_ptr & t, node_ptr & l) BOOST_NOEXCEPT
-   {
-      //procedure link_left;
-      //    t, l, right(l) := right(t), t, t
-      //end link_left
-      NodeTraits::set_right(l, t);
-      NodeTraits::set_parent(t, l);
-      l = t;
-      t = NodeTraits::get_right(t);
-   }
-
-   // break link to right child node and attach it to right tree pointed to by r | complexity : constant | exception : nothrow
-   static void link_right(node_ptr & t, node_ptr & r) BOOST_NOEXCEPT
-   {
-      //procedure link_right;
-      //    t, r, left(r) := left(t), t, t
-      //end link_right;
-      NodeTraits::set_left(r, t);
-      NodeTraits::set_parent(t, r);
-      r = t;
-      t = NodeTraits::get_left(t);
-   }
-
-   // rotate n with its parent                     | complexity : constant    | exception : nothrow
-   static void rotate(node_ptr n) BOOST_NOEXCEPT
-   {
-      //procedure rotate_left;
-      //    t, right(t), left(right(t)) := right(t), left(right(t)), t
-      //end rotate_left;
-      node_ptr p = NodeTraits::get_parent(n);
-      node_ptr g = NodeTraits::get_parent(p);
-      //Test if g is header before breaking tree
-      //invariants that would make is_header invalid
-      bool g_is_header = bstree_algo::is_header(g);
-
-      if(NodeTraits::get_left(p) == n){
-         NodeTraits::set_left(p, NodeTraits::get_right(n));
-         if(NodeTraits::get_left(p))
-            NodeTraits::set_parent(NodeTraits::get_left(p), p);
-         NodeTraits::set_right(n, p);
-      }
-      else{ // must be ( p->right == n )
-         NodeTraits::set_right(p, NodeTraits::get_left(n));
-         if(NodeTraits::get_right(p))
-            NodeTraits::set_parent(NodeTraits::get_right(p), p);
-         NodeTraits::set_left(n, p);
-      }
-
-      NodeTraits::set_parent(p, n);
-      NodeTraits::set_parent(n, g);
-
-      if(g_is_header){
-         if(NodeTraits::get_parent(g) == p)
-            NodeTraits::set_parent(g, n);
-         else{//must be ( g->right == p )
-            BOOST_INTRUSIVE_INVARIANT_ASSERT(false);
-            NodeTraits::set_right(g, n);
-         }
-      }
-      else{
-         if(NodeTraits::get_left(g) == p)
-            NodeTraits::set_left(g, n);
-         else  //must be ( g->right == p )
-            NodeTraits::set_right(g, n);
-      }
-   }
-
-   /// @endcond
-};
-
-/// @cond
-
-template<class NodeTraits>
-struct get_algo<SplayTreeAlgorithms, NodeTraits>
-{
-   typedef splaytree_algorithms<NodeTraits> type;
-};
-
-template <class ValueTraits, class NodePtrCompare, class ExtraChecker>
-struct get_node_checker<SplayTreeAlgorithms, ValueTraits, NodePtrCompare, ExtraChecker>
-{
-   typedef detail::bstree_node_checker<ValueTraits, NodePtrCompare, ExtraChecker> type;
-};
-
-/// @endcond
-
-} //namespace intrusive
-} //namespace boost
-
-#include <boost/intrusive/detail/config_end.hpp>
-
-#endif //BOOST_INTRUSIVE_SPLAYTREE_ALGORITHMS_HPP
diff --git a/src/boost/is_placeholder.hpp b/src/boost/is_placeholder.hpp
deleted file mode 100644
index 5f1b544f..00000000
--- a/src/boost/is_placeholder.hpp
+++ /dev/null
@@ -1,31 +0,0 @@
-#ifndef BOOST_IS_PLACEHOLDER_HPP_INCLUDED
-#define BOOST_IS_PLACEHOLDER_HPP_INCLUDED
-
-// MS compatible compilers support #pragma once
-
-#if defined( _MSC_VER ) && ( _MSC_VER >= 1020 )
-# pragma once
-#endif
-
-
-//  is_placeholder.hpp - TR1 is_placeholder metafunction
-//
-//  Copyright (c) 2006 Peter Dimov
-//
-//  Distributed under the Boost Software License, Version 1.0.
-//
-//  See accompanying file LICENSE_1_0.txt or copy at
-//  http://www.boost.org/LICENSE_1_0.txt
-
-
-namespace boost
-{
-
-template< class T > struct is_placeholder
-{
-    enum _vt { value = 0 };
-};
-
-} // namespace boost
-
-#endif // #ifndef BOOST_IS_PLACEHOLDER_HPP_INCLUDED
diff --git a/src/boost/iterator/detail/config_def.hpp b/src/boost/iterator/detail/config_def.hpp
deleted file mode 100644
index bd04b75d..00000000
--- a/src/boost/iterator/detail/config_def.hpp
+++ /dev/null
@@ -1,128 +0,0 @@
-// (C) Copyright David Abrahams 2002.
-// (C) Copyright Jeremy Siek    2002.
-// (C) Copyright Thomas Witt    2002.
-// Distributed under the Boost Software License, Version 1.0. (See
-// accompanying file LICENSE_1_0.txt or copy at
-// http://www.boost.org/LICENSE_1_0.txt)
-
-// no include guard multiple inclusion intended
-
-//
-// This is a temporary workaround until the bulk of this is
-// available in boost config.
-// 23/02/03 thw
-//
-
-#include <boost/config.hpp> // for prior
-#include <boost/detail/workaround.hpp>
-
-#ifdef BOOST_ITERATOR_CONFIG_DEF
-# error you have nested config_def #inclusion.
-#else
-# define BOOST_ITERATOR_CONFIG_DEF
-#endif
-
-// We enable this always now.  Otherwise, the simple case in
-// libs/iterator/test/constant_iterator_arrow.cpp fails to compile
-// because the operator-> return is improperly deduced as a non-const
-// pointer.
-#if 1 || defined(BOOST_NO_TEMPLATE_PARTIAL_SPECIALIZATION)           \
-    || BOOST_WORKAROUND(BOOST_BORLANDC, BOOST_TESTED_AT(0x531))
-
-// Recall that in general, compilers without partial specialization
-// can't strip constness.  Consider counting_iterator, which normally
-// passes a const Value to iterator_facade.  As a result, any code
-// which makes a std::vector of the iterator's value_type will fail
-// when its allocator declares functions overloaded on reference and
-// const_reference (the same type).
-//
-// Furthermore, Borland 5.5.1 drops constness in enough ways that we
-// end up using a proxy for operator[] when we otherwise shouldn't.
-// Using reference constness gives it an extra hint that it can
-// return the value_type from operator[] directly, but is not
-// strictly necessary.  Not sure how best to resolve this one.
-
-# define BOOST_ITERATOR_REF_CONSTNESS_KILLS_WRITABILITY 1
-
-#endif
-
-#if BOOST_WORKAROUND(BOOST_BORLANDC, BOOST_TESTED_AT(0x5A0))                      \
-    || (BOOST_WORKAROUND(BOOST_INTEL_CXX_VERSION, <= 700) && defined(_MSC_VER)) \
-    || BOOST_WORKAROUND(__DECCXX_VER, BOOST_TESTED_AT(60590042))                \
-    || BOOST_WORKAROUND(__SUNPRO_CC, BOOST_TESTED_AT(0x590))
-
-# define BOOST_NO_LVALUE_RETURN_DETECTION
-
-# if 0 // test code
-  struct v  {};
-
-  typedef  char (&no)[3];
-
-  template <class T>
-  no foo(T const&, ...);
-
-  template <class T>
-  char foo(T&, int);
-
-
-  struct value_iterator
-  {
-      v operator*() const;
-  };
-
-  template <class T>
-  struct lvalue_deref_helper
-  {
-      static T& x;
-      enum { value = (sizeof(foo(*x,0)) == 1) };
-  };
-
-  int z2[(lvalue_deref_helper<v*>::value == 1) ? 1 : -1];
-  int z[(lvalue_deref_helper<value_iterator>::value) == 1 ? -1 : 1 ];
-# endif
-
-#endif
-
-#if BOOST_WORKAROUND(__MWERKS__, <=0x2407)
-#  define BOOST_NO_IS_CONVERTIBLE // "is_convertible doesn't work for simple types"
-#endif
-
-#if BOOST_WORKAROUND(__GNUC__, == 3) && BOOST_WORKAROUND(__GNUC_MINOR__, < 4) && !defined(__EDG_VERSION__)   \
-    || BOOST_WORKAROUND(BOOST_BORLANDC, BOOST_TESTED_AT(0x551))
-#  define BOOST_NO_IS_CONVERTIBLE_TEMPLATE // The following program fails to compile:
-
-#  if 0 // test code
-    #include <boost/type_traits/is_convertible.hpp>
-    template <class T>
-    struct foo
-    {
-        foo(T);
-
-        template <class U>
-        foo(foo<U> const& other) : p(other.p) { }
-
-        T p;
-    };
-
-    bool x = boost::is_convertible<foo<int const*>, foo<int*> >::value;
-#  endif
-
-#endif
-
-
-#if !defined(BOOST_MSVC) && (defined(BOOST_NO_SFINAE) || defined(BOOST_NO_IS_CONVERTIBLE) || defined(BOOST_NO_IS_CONVERTIBLE_TEMPLATE))
-# define BOOST_NO_STRICT_ITERATOR_INTEROPERABILITY
-#endif
-
-# if BOOST_WORKAROUND(BOOST_BORLANDC, BOOST_TESTED_AT(0x564))
-
-// GCC-2.95 (obsolete) eagerly instantiates templated constructors and conversion
-// operators in convertibility checks, causing premature errors.
-//
-// Borland's problems are harder to diagnose due to lack of an
-// instantiation stack backtrace.  They may be due in part to the fact
-// that it drops cv-qualification willy-nilly in templates.
-#  define BOOST_NO_ONE_WAY_ITERATOR_INTEROP
-# endif
-
-// no include guard; multiple inclusion intended
diff --git a/src/boost/iterator/detail/config_undef.hpp b/src/boost/iterator/detail/config_undef.hpp
deleted file mode 100644
index a32529c0..00000000
--- a/src/boost/iterator/detail/config_undef.hpp
+++ /dev/null
@@ -1,24 +0,0 @@
-// (C) Copyright Thomas Witt    2002.
-// Distributed under the Boost Software License, Version 1.0. (See
-// accompanying file LICENSE_1_0.txt or copy at
-// http://www.boost.org/LICENSE_1_0.txt)
-
-// no include guard multiple inclusion intended
-
-//
-// This is a temporary workaround until the bulk of this is
-// available in boost config.
-// 23/02/03 thw
-//
-
-#undef BOOST_NO_IS_CONVERTIBLE
-#undef BOOST_NO_IS_CONVERTIBLE_TEMPLATE
-#undef BOOST_NO_STRICT_ITERATOR_INTEROPERABILITY
-#undef BOOST_NO_LVALUE_RETURN_DETECTION
-#undef BOOST_NO_ONE_WAY_ITERATOR_INTEROP
-
-#ifdef BOOST_ITERATOR_CONFIG_DEF
-# undef BOOST_ITERATOR_CONFIG_DEF
-#else
-# error missing or nested #include config_def
-#endif
diff --git a/src/boost/iterator/detail/enable_if.hpp b/src/boost/iterator/detail/enable_if.hpp
deleted file mode 100644
index dcc9adb7..00000000
--- a/src/boost/iterator/detail/enable_if.hpp
+++ /dev/null
@@ -1,83 +0,0 @@
-// (C) Copyright David Abrahams 2002.
-// (C) Copyright Jeremy Siek    2002.
-// (C) Copyright Thomas Witt    2002.
-// Distributed under the Boost Software License, Version 1.0. (See
-// accompanying file LICENSE_1_0.txt or copy at
-// http://www.boost.org/LICENSE_1_0.txt)
-#ifndef BOOST_ENABLE_IF_23022003THW_HPP
-#define BOOST_ENABLE_IF_23022003THW_HPP
-
-#include <boost/config.hpp>
-#include <boost/iterator/detail/config_def.hpp>
-#if defined(BOOST_NO_SFINAE) || defined(BOOST_NO_IS_CONVERTIBLE)
-#include <boost/type_traits/type_identity.hpp>
-#endif
-
-//
-// Boost iterators uses its own enable_if cause we need
-// special semantics for deficient compilers.
-// 23/02/03 thw
-//
-
-namespace boost
-{
-
-  namespace iterators
-  {
-    //
-    // Base machinery for all kinds of enable if
-    //
-    template<bool>
-    struct enabled
-    {
-      template<typename T>
-      struct base
-      {
-        typedef T type;
-      };
-    };
-
-    //
-    // For compilers that don't support "Substitution Failure Is Not An Error"
-    // enable_if falls back to always enabled. See comments
-    // on operator implementation for consequences.
-    //
-    template<>
-    struct enabled<false>
-    {
-      template<typename T>
-      struct base
-      {
-#ifdef BOOST_NO_SFINAE
-        typedef T type;
-
-        // This way to do it would give a nice error message containing
-        // invalid overload, but has the big disadvantage that
-        // there is no reference to user code in the error message.
-        //
-        // struct invalid_overload;
-        // typedef invalid_overload type;
-        //
-#endif
-      };
-    };
-
-
-    template <class Cond,
-              class Return>
-    struct enable_if
-# if !defined(BOOST_NO_SFINAE) && !defined(BOOST_NO_IS_CONVERTIBLE)
-      : enabled<(Cond::value)>::template base<Return>
-# else
-      : boost::type_identity<Return>
-# endif
-    {
-    };
-
-  } // namespace iterators
-
-} // namespace boost
-
-#include <boost/iterator/detail/config_undef.hpp>
-
-#endif // BOOST_ENABLE_IF_23022003THW_HPP
diff --git a/src/boost/iterator/detail/facade_iterator_category.hpp b/src/boost/iterator/detail/facade_iterator_category.hpp
deleted file mode 100644
index 9d41320f..00000000
--- a/src/boost/iterator/detail/facade_iterator_category.hpp
+++ /dev/null
@@ -1,193 +0,0 @@
-// Copyright David Abrahams 2003. Use, modification and distribution is
-// subject to the Boost Software License, Version 1.0. (See accompanying
-// file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
-#ifndef FACADE_ITERATOR_CATEGORY_DWA20031118_HPP
-# define FACADE_ITERATOR_CATEGORY_DWA20031118_HPP
-
-# include <boost/core/use_default.hpp>
-
-# include <boost/iterator/iterator_categories.hpp>
-
-# include <boost/mpl/or.hpp>  // used in iterator_tag inheritance logic
-# include <boost/mpl/and.hpp>
-# include <boost/mpl/if.hpp>
-# include <boost/mpl/eval_if.hpp>
-# include <boost/mpl/identity.hpp>
-
-# include <boost/static_assert.hpp>
-
-# include <boost/type_traits/is_same.hpp>
-# include <boost/type_traits/is_const.hpp>
-# include <boost/type_traits/is_reference.hpp>
-# include <boost/type_traits/is_convertible.hpp>
-
-# include <boost/iterator/detail/config_def.hpp> // try to keep this last
-
-# ifdef BOOST_ITERATOR_REF_CONSTNESS_KILLS_WRITABILITY
-#  include <boost/detail/indirect_traits.hpp>
-# endif
-
-//
-// iterator_category deduction for iterator_facade
-//
-
-namespace boost {
-namespace iterators {
-
-using boost::use_default;
-
-namespace detail {
-
-struct input_output_iterator_tag
-  : std::input_iterator_tag
-{
-    // Using inheritance for only input_iterator_tag helps to avoid
-    // ambiguities when a stdlib implementation dispatches on a
-    // function which is overloaded on both input_iterator_tag and
-    // output_iterator_tag, as STLPort does, in its __valid_range
-    // function.  I claim it's better to avoid the ambiguity in these
-    // cases.
-    operator std::output_iterator_tag() const
-    {
-        return std::output_iterator_tag();
-    }
-};
-
-//
-// True iff the user has explicitly disabled writability of this
-// iterator.  Pass the iterator_facade's Value parameter and its
-// nested ::reference type.
-//
-template <class ValueParam, class Reference>
-struct iterator_writability_disabled
-# ifdef BOOST_ITERATOR_REF_CONSTNESS_KILLS_WRITABILITY // Adding Thomas' logic?
-  : mpl::or_<
-        is_const<Reference>
-      , boost::detail::indirect_traits::is_reference_to_const<Reference>
-      , is_const<ValueParam>
-    >
-# else
-  : is_const<ValueParam>
-# endif
-{};
-
-
-//
-// Convert an iterator_facade's traversal category, Value parameter,
-// and ::reference type to an appropriate old-style category.
-//
-// Due to changeset 21683, this now never results in a category convertible
-// to output_iterator_tag.
-//
-// Change at: https://svn.boost.org/trac/boost/changeset/21683
-template <class Traversal, class ValueParam, class Reference>
-struct iterator_facade_default_category
-  : mpl::eval_if<
-        mpl::and_<
-            is_reference<Reference>
-          , is_convertible<Traversal,forward_traversal_tag>
-        >
-      , mpl::eval_if<
-            is_convertible<Traversal,random_access_traversal_tag>
-          , mpl::identity<std::random_access_iterator_tag>
-          , mpl::if_<
-                is_convertible<Traversal,bidirectional_traversal_tag>
-              , std::bidirectional_iterator_tag
-              , std::forward_iterator_tag
-            >
-        >
-      , typename mpl::eval_if<
-            mpl::and_<
-                is_convertible<Traversal, single_pass_traversal_tag>
-
-                // check for readability
-              , is_convertible<Reference, ValueParam>
-            >
-          , mpl::identity<std::input_iterator_tag>
-          , mpl::identity<Traversal>
-        >
-    >
-{
-};
-
-// True iff T is convertible to an old-style iterator category.
-template <class T>
-struct is_iterator_category
-  : mpl::or_<
-        is_convertible<T,std::input_iterator_tag>
-      , is_convertible<T,std::output_iterator_tag>
-    >
-{
-};
-
-template <class T>
-struct is_iterator_traversal
-  : is_convertible<T,incrementable_traversal_tag>
-{};
-
-//
-// A composite iterator_category tag convertible to Category (a pure
-// old-style category) and Traversal (a pure traversal tag).
-// Traversal must be a strict increase of the traversal power given by
-// Category.
-//
-template <class Category, class Traversal>
-struct iterator_category_with_traversal
-  : Category, Traversal
-{
-    // Make sure this isn't used to build any categories where
-    // convertibility to Traversal is redundant.  Should just use the
-    // Category element in that case.
-    BOOST_STATIC_ASSERT((
-        !is_convertible<
-              typename iterator_category_to_traversal<Category>::type
-            , Traversal
-          >::value));
-
-    BOOST_STATIC_ASSERT(is_iterator_category<Category>::value);
-    BOOST_STATIC_ASSERT(!is_iterator_category<Traversal>::value);
-    BOOST_STATIC_ASSERT(!is_iterator_traversal<Category>::value);
-#  if !BOOST_WORKAROUND(BOOST_MSVC, BOOST_TESTED_AT(1310))
-    BOOST_STATIC_ASSERT(is_iterator_traversal<Traversal>::value);
-#  endif
-};
-
-// Computes an iterator_category tag whose traversal is Traversal and
-// which is appropriate for an iterator
-template <class Traversal, class ValueParam, class Reference>
-struct facade_iterator_category_impl
-{
-    BOOST_STATIC_ASSERT(!is_iterator_category<Traversal>::value);
-
-    typedef typename iterator_facade_default_category<
-        Traversal,ValueParam,Reference
-    >::type category;
-
-    typedef typename mpl::if_<
-        is_same<
-            Traversal
-          , typename iterator_category_to_traversal<category>::type
-        >
-      , category
-      , iterator_category_with_traversal<category,Traversal>
-    >::type type;
-};
-
-//
-// Compute an iterator_category for iterator_facade
-//
-template <class CategoryOrTraversal, class ValueParam, class Reference>
-struct facade_iterator_category
-  : mpl::eval_if<
-        is_iterator_category<CategoryOrTraversal>
-      , mpl::identity<CategoryOrTraversal> // old-style categories are fine as-is
-      , facade_iterator_category_impl<CategoryOrTraversal,ValueParam,Reference>
-    >
-{
-};
-
-}}} // namespace boost::iterators::detail
-
-# include <boost/iterator/detail/config_undef.hpp>
-
-#endif // FACADE_ITERATOR_CATEGORY_DWA20031118_HPP
diff --git a/src/boost/iterator/interoperable.hpp b/src/boost/iterator/interoperable.hpp
deleted file mode 100644
index 6f3c872a..00000000
--- a/src/boost/iterator/interoperable.hpp
+++ /dev/null
@@ -1,54 +0,0 @@
-// (C) Copyright David Abrahams 2002.
-// (C) Copyright Jeremy Siek    2002.
-// (C) Copyright Thomas Witt    2002.
-// Distributed under the Boost Software License, Version 1.0. (See
-// accompanying file LICENSE_1_0.txt or copy at
-// http://www.boost.org/LICENSE_1_0.txt)
-#ifndef BOOST_INTEROPERABLE_23022003THW_HPP
-# define BOOST_INTEROPERABLE_23022003THW_HPP
-
-# include <boost/mpl/bool.hpp>
-# include <boost/mpl/or.hpp>
-
-# include <boost/type_traits/is_convertible.hpp>
-
-# include <boost/iterator/detail/config_def.hpp> // must appear last
-
-namespace boost {
-namespace iterators {
-
-  //
-  // Meta function that determines whether two
-  // iterator types are considered interoperable.
-  //
-  // Two iterator types A,B are considered interoperable if either
-  // A is convertible to B or vice versa.
-  // This interoperability definition is in sync with the
-  // standards requirements on constant/mutable container
-  // iterators (23.1 [lib.container.requirements]).
-  //
-  // For compilers that don't support is_convertible
-  // is_interoperable gives false positives. See comments
-  // on operator implementation for consequences.
-  //
-  template <typename A, typename B>
-  struct is_interoperable
-# ifdef BOOST_NO_STRICT_ITERATOR_INTEROPERABILITY
-    : mpl::true_
-# else
-    : mpl::or_<
-          is_convertible< A, B >
-        , is_convertible< B, A > >
-# endif
-  {
-  };
-
-} // namespace iterators
-
-using iterators::is_interoperable;
-
-} // namespace boost
-
-# include <boost/iterator/detail/config_undef.hpp>
-
-#endif // BOOST_INTEROPERABLE_23022003THW_HPP
diff --git a/src/boost/iterator/iterator_adaptor.hpp b/src/boost/iterator/iterator_adaptor.hpp
deleted file mode 100644
index db1c4daa..00000000
--- a/src/boost/iterator/iterator_adaptor.hpp
+++ /dev/null
@@ -1,358 +0,0 @@
-// (C) Copyright David Abrahams 2002.
-// (C) Copyright Jeremy Siek    2002.
-// (C) Copyright Thomas Witt    2002.
-// Distributed under the Boost Software License, Version 1.0. (See
-// accompanying file LICENSE_1_0.txt or copy at
-// http://www.boost.org/LICENSE_1_0.txt)
-#ifndef BOOST_ITERATOR_ADAPTOR_23022003THW_HPP
-#define BOOST_ITERATOR_ADAPTOR_23022003THW_HPP
-
-#include <boost/static_assert.hpp>
-
-#include <boost/core/use_default.hpp>
-
-#include <boost/iterator/iterator_categories.hpp>
-#include <boost/iterator/iterator_facade.hpp>
-#include <boost/iterator/detail/enable_if.hpp>
-
-#include <boost/mpl/and.hpp>
-#include <boost/mpl/not.hpp>
-#include <boost/mpl/or.hpp>
-
-#include <boost/type_traits/is_same.hpp>
-#include <boost/type_traits/is_convertible.hpp>
-
-#ifdef BOOST_ITERATOR_REF_CONSTNESS_KILLS_WRITABILITY
-# include <boost/type_traits/remove_reference.hpp>
-#endif
-
-#include <boost/type_traits/add_reference.hpp>
-#include <boost/iterator/detail/config_def.hpp>
-
-#include <boost/iterator/iterator_traits.hpp>
-
-namespace boost {
-namespace iterators {
-
-  // Used as a default template argument internally, merely to
-  // indicate "use the default", this can also be passed by users
-  // explicitly in order to specify that the default should be used.
-  using boost::use_default;
-
-} // namespace iterators
-
-// the incompleteness of use_default causes massive problems for
-// is_convertible (naturally).  This workaround is fortunately not
-// needed for vc6/vc7.
-template<class To>
-struct is_convertible<use_default,To>
-  : mpl::false_ {};
-
-namespace iterators {
-
-  namespace detail
-  {
-
-    //
-    // Result type used in enable_if_convertible meta function.
-    // This can be an incomplete type, as only pointers to
-    // enable_if_convertible< ... >::type are used.
-    // We could have used void for this, but conversion to
-    // void* is just to easy.
-    //
-    struct enable_type;
-  }
-
-
-  //
-  // enable_if for use in adapted iterators constructors.
-  //
-  // In order to provide interoperability between adapted constant and
-  // mutable iterators, adapted iterators will usually provide templated
-  // conversion constructors of the following form
-  //
-  // template <class BaseIterator>
-  // class adapted_iterator :
-  //   public iterator_adaptor< adapted_iterator<Iterator>, Iterator >
-  // {
-  // public:
-  //
-  //   ...
-  //
-  //   template <class OtherIterator>
-  //   adapted_iterator(
-  //       OtherIterator const& it
-  //     , typename enable_if_convertible<OtherIterator, Iterator>::type* = 0);
-  //
-  //   ...
-  // };
-  //
-  // enable_if_convertible is used to remove those overloads from the overload
-  // set that cannot be instantiated. For all practical purposes only overloads
-  // for constant/mutable interaction will remain. This has the advantage that
-  // meta functions like boost::is_convertible do not return false positives,
-  // as they can only look at the signature of the conversion constructor
-  // and not at the actual instantiation.
-  //
-  // enable_if_interoperable can be safely used in user code. It falls back to
-  // always enabled for compilers that don't support enable_if or is_convertible.
-  // There is no need for compiler specific workarounds in user code.
-  //
-  // The operators implementation relies on boost::is_convertible not returning
-  // false positives for user/library defined iterator types. See comments
-  // on operator implementation for consequences.
-  //
-#  if defined(BOOST_NO_IS_CONVERTIBLE) || defined(BOOST_NO_SFINAE)
-
-  template <class From, class To>
-  struct enable_if_convertible
-  {
-      typedef boost::iterators::detail::enable_type type;
-  };
-
-#  elif BOOST_WORKAROUND(_MSC_FULL_VER, BOOST_TESTED_AT(13102292))
-
-  // For some reason vc7.1 needs us to "cut off" instantiation
-  // of is_convertible in a few cases.
-  template<typename From, typename To>
-  struct enable_if_convertible
-    : iterators::enable_if<
-        mpl::or_<
-            is_same<From,To>
-          , is_convertible<From, To>
-        >
-      , boost::iterators::detail::enable_type
-    >
-  {};
-
-#  else
-
-  template<typename From, typename To>
-  struct enable_if_convertible
-    : iterators::enable_if<
-          is_convertible<From, To>
-        , boost::iterators::detail::enable_type
-      >
-  {};
-
-# endif
-
-  //
-  // Default template argument handling for iterator_adaptor
-  //
-  namespace detail
-  {
-    // If T is use_default, return the result of invoking
-    // DefaultNullaryFn, otherwise return T.
-    template <class T, class DefaultNullaryFn>
-    struct ia_dflt_help
-      : mpl::eval_if<
-            is_same<T, use_default>
-          , DefaultNullaryFn
-          , mpl::identity<T>
-        >
-    {
-    };
-
-    // A metafunction which computes an iterator_adaptor's base class,
-    // a specialization of iterator_facade.
-    template <
-        class Derived
-      , class Base
-      , class Value
-      , class Traversal
-      , class Reference
-      , class Difference
-    >
-    struct iterator_adaptor_base
-    {
-        typedef iterator_facade<
-            Derived
-
-# ifdef BOOST_ITERATOR_REF_CONSTNESS_KILLS_WRITABILITY
-          , typename boost::iterators::detail::ia_dflt_help<
-                Value
-              , mpl::eval_if<
-                    is_same<Reference,use_default>
-                  , iterator_value<Base>
-                  , remove_reference<Reference>
-                >
-            >::type
-# else
-          , typename boost::iterators::detail::ia_dflt_help<
-                Value, iterator_value<Base>
-            >::type
-# endif
-
-          , typename boost::iterators::detail::ia_dflt_help<
-                Traversal
-              , iterator_traversal<Base>
-            >::type
-
-          , typename boost::iterators::detail::ia_dflt_help<
-                Reference
-              , mpl::eval_if<
-                    is_same<Value,use_default>
-                  , iterator_reference<Base>
-                  , add_reference<Value>
-                >
-            >::type
-
-          , typename boost::iterators::detail::ia_dflt_help<
-                Difference, iterator_difference<Base>
-            >::type
-        >
-        type;
-    };
-
-    // workaround for aC++ CR JAGaf33512
-    template <class Tr1, class Tr2>
-    inline void iterator_adaptor_assert_traversal ()
-    {
-      BOOST_STATIC_ASSERT((is_convertible<Tr1, Tr2>::value));
-    }
-  }
-
-  //
-  // Iterator Adaptor
-  //
-  // The parameter ordering changed slightly with respect to former
-  // versions of iterator_adaptor The idea is that when the user needs
-  // to fiddle with the reference type it is highly likely that the
-  // iterator category has to be adjusted as well.  Any of the
-  // following four template arguments may be ommitted or explicitly
-  // replaced by use_default.
-  //
-  //   Value - if supplied, the value_type of the resulting iterator, unless
-  //      const. If const, a conforming compiler strips constness for the
-  //      value_type. If not supplied, iterator_traits<Base>::value_type is used
-  //
-  //   Category - the traversal category of the resulting iterator. If not
-  //      supplied, iterator_traversal<Base>::type is used.
-  //
-  //   Reference - the reference type of the resulting iterator, and in
-  //      particular, the result type of operator*(). If not supplied but
-  //      Value is supplied, Value& is used. Otherwise
-  //      iterator_traits<Base>::reference is used.
-  //
-  //   Difference - the difference_type of the resulting iterator. If not
-  //      supplied, iterator_traits<Base>::difference_type is used.
-  //
-  template <
-      class Derived
-    , class Base
-    , class Value        = use_default
-    , class Traversal    = use_default
-    , class Reference    = use_default
-    , class Difference   = use_default
-  >
-  class iterator_adaptor
-    : public boost::iterators::detail::iterator_adaptor_base<
-        Derived, Base, Value, Traversal, Reference, Difference
-      >::type
-  {
-      friend class iterator_core_access;
-
-   protected:
-      typedef typename boost::iterators::detail::iterator_adaptor_base<
-          Derived, Base, Value, Traversal, Reference, Difference
-      >::type super_t;
-   public:
-      iterator_adaptor() {}
-
-      explicit iterator_adaptor(Base const &iter)
-          : m_iterator(iter)
-      {
-      }
-
-      typedef Base base_type;
-
-      Base const& base() const
-        { return m_iterator; }
-
-   protected:
-      // for convenience in derived classes
-      typedef iterator_adaptor<Derived,Base,Value,Traversal,Reference,Difference> iterator_adaptor_;
-
-      //
-      // lvalue access to the Base object for Derived
-      //
-      Base const& base_reference() const
-        { return m_iterator; }
-
-      Base& base_reference()
-        { return m_iterator; }
-
-   private:
-      //
-      // Core iterator interface for iterator_facade.  This is private
-      // to prevent temptation for Derived classes to use it, which
-      // will often result in an error.  Derived classes should use
-      // base_reference(), above, to get direct access to m_iterator.
-      //
-      typename super_t::reference dereference() const
-        { return *m_iterator; }
-
-      template <
-      class OtherDerived, class OtherIterator, class V, class C, class R, class D
-      >
-      bool equal(iterator_adaptor<OtherDerived, OtherIterator, V, C, R, D> const& x) const
-      {
-        // Maybe readd with same_distance
-        //           BOOST_STATIC_ASSERT(
-        //               (detail::same_category_and_difference<Derived,OtherDerived>::value)
-        //               );
-          return m_iterator == x.base();
-      }
-
-      typedef typename iterator_category_to_traversal<
-          typename super_t::iterator_category
-      >::type my_traversal;
-
-# define BOOST_ITERATOR_ADAPTOR_ASSERT_TRAVERSAL(cat) \
-      boost::iterators::detail::iterator_adaptor_assert_traversal<my_traversal, cat>();
-
-      void advance(typename super_t::difference_type n)
-      {
-          BOOST_ITERATOR_ADAPTOR_ASSERT_TRAVERSAL(random_access_traversal_tag)
-          m_iterator += n;
-      }
-
-      void increment() { ++m_iterator; }
-
-      void decrement()
-      {
-          BOOST_ITERATOR_ADAPTOR_ASSERT_TRAVERSAL(bidirectional_traversal_tag)
-           --m_iterator;
-      }
-
-      template <
-          class OtherDerived, class OtherIterator, class V, class C, class R, class D
-      >
-      typename super_t::difference_type distance_to(
-          iterator_adaptor<OtherDerived, OtherIterator, V, C, R, D> const& y) const
-      {
-          BOOST_ITERATOR_ADAPTOR_ASSERT_TRAVERSAL(random_access_traversal_tag)
-          // Maybe readd with same_distance
-          //           BOOST_STATIC_ASSERT(
-          //               (detail::same_category_and_difference<Derived,OtherDerived>::value)
-          //               );
-          return y.base() - m_iterator;
-      }
-
-# undef BOOST_ITERATOR_ADAPTOR_ASSERT_TRAVERSAL
-
-   private: // data members
-      Base m_iterator;
-  };
-
-} // namespace iterators
-
-using iterators::iterator_adaptor;
-using iterators::enable_if_convertible;
-
-} // namespace boost
-
-#include <boost/iterator/detail/config_undef.hpp>
-
-#endif // BOOST_ITERATOR_ADAPTOR_23022003THW_HPP
diff --git a/src/boost/iterator/iterator_categories.hpp b/src/boost/iterator/iterator_categories.hpp
deleted file mode 100644
index baf805af..00000000
--- a/src/boost/iterator/iterator_categories.hpp
+++ /dev/null
@@ -1,216 +0,0 @@
-// (C) Copyright Jeremy Siek 2002.
-// Distributed under the Boost Software License, Version 1.0. (See
-// accompanying file LICENSE_1_0.txt or copy at
-// http://www.boost.org/LICENSE_1_0.txt)
-
-#ifndef BOOST_ITERATOR_CATEGORIES_HPP
-# define BOOST_ITERATOR_CATEGORIES_HPP
-
-# include <boost/config.hpp>
-# include <boost/iterator/detail/config_def.hpp>
-
-# include <boost/detail/workaround.hpp>
-
-# include <boost/mpl/eval_if.hpp>
-# include <boost/mpl/identity.hpp>
-# include <boost/mpl/placeholders.hpp>
-# include <boost/mpl/aux_/lambda_support.hpp>
-
-# include <boost/type_traits/is_convertible.hpp>
-
-# include <boost/static_assert.hpp>
-
-#include <iterator>
-
-namespace boost {
-namespace iterators {
-
-//
-// Traversal Categories
-//
-
-struct no_traversal_tag {};
-
-struct incrementable_traversal_tag
-  : no_traversal_tag
-{
-//     incrementable_traversal_tag() {}
-//     incrementable_traversal_tag(std::output_iterator_tag const&) {};
-};
-
-struct single_pass_traversal_tag
-  : incrementable_traversal_tag
-{
-//     single_pass_traversal_tag() {}
-//     single_pass_traversal_tag(std::input_iterator_tag const&) {};
-};
-
-struct forward_traversal_tag
-  : single_pass_traversal_tag
-{
-//     forward_traversal_tag() {}
-//     forward_traversal_tag(std::forward_iterator_tag const&) {};
-};
-
-struct bidirectional_traversal_tag
-  : forward_traversal_tag
-{
-//     bidirectional_traversal_tag() {};
-//     bidirectional_traversal_tag(std::bidirectional_iterator_tag const&) {};
-};
-
-struct random_access_traversal_tag
-  : bidirectional_traversal_tag
-{
-//     random_access_traversal_tag() {};
-//     random_access_traversal_tag(std::random_access_iterator_tag const&) {};
-};
-
-namespace detail
-{
-  //
-  // Convert a "strictly old-style" iterator category to a traversal
-  // tag.  This is broken out into a separate metafunction to reduce
-  // the cost of instantiating iterator_category_to_traversal, below,
-  // for new-style types.
-  //
-  template <class Cat>
-  struct old_category_to_traversal
-    : mpl::eval_if<
-          is_convertible<Cat,std::random_access_iterator_tag>
-        , mpl::identity<random_access_traversal_tag>
-        , mpl::eval_if<
-              is_convertible<Cat,std::bidirectional_iterator_tag>
-            , mpl::identity<bidirectional_traversal_tag>
-            , mpl::eval_if<
-                  is_convertible<Cat,std::forward_iterator_tag>
-                , mpl::identity<forward_traversal_tag>
-                , mpl::eval_if<
-                      is_convertible<Cat,std::input_iterator_tag>
-                    , mpl::identity<single_pass_traversal_tag>
-                    , mpl::eval_if<
-                          is_convertible<Cat,std::output_iterator_tag>
-                        , mpl::identity<incrementable_traversal_tag>
-                        , void
-                      >
-                  >
-              >
-          >
-      >
-  {};
-
-} // namespace detail
-
-//
-// Convert an iterator category into a traversal tag
-//
-template <class Cat>
-struct iterator_category_to_traversal
-  : mpl::eval_if< // if already convertible to a traversal tag, we're done.
-        is_convertible<Cat,incrementable_traversal_tag>
-      , mpl::identity<Cat>
-      , boost::iterators::detail::old_category_to_traversal<Cat>
-    >
-{};
-
-// Trait to get an iterator's traversal category
-template <class Iterator = mpl::_1>
-struct iterator_traversal
-  : iterator_category_to_traversal<
-        typename std::iterator_traits<Iterator>::iterator_category
-    >
-{};
-
-# ifdef BOOST_MPL_CFG_NO_FULL_LAMBDA_SUPPORT
-// Hack because BOOST_MPL_AUX_LAMBDA_SUPPORT doesn't seem to work
-// out well.  Instantiating the nested apply template also
-// requires instantiating iterator_traits on the
-// placeholder. Instead we just specialize it as a metafunction
-// class.
-template <>
-struct iterator_traversal<mpl::_1>
-{
-    template <class T>
-    struct apply : iterator_traversal<T>
-    {};
-};
-template <>
-struct iterator_traversal<mpl::_>
-  : iterator_traversal<mpl::_1>
-{};
-# endif
-
-//
-// Convert an iterator traversal to one of the traversal tags.
-//
-template <class Traversal>
-struct pure_traversal_tag
-  : mpl::eval_if<
-        is_convertible<Traversal,random_access_traversal_tag>
-      , mpl::identity<random_access_traversal_tag>
-      , mpl::eval_if<
-            is_convertible<Traversal,bidirectional_traversal_tag>
-          , mpl::identity<bidirectional_traversal_tag>
-          , mpl::eval_if<
-                is_convertible<Traversal,forward_traversal_tag>
-              , mpl::identity<forward_traversal_tag>
-              , mpl::eval_if<
-                    is_convertible<Traversal,single_pass_traversal_tag>
-                  , mpl::identity<single_pass_traversal_tag>
-                  , mpl::eval_if<
-                        is_convertible<Traversal,incrementable_traversal_tag>
-                      , mpl::identity<incrementable_traversal_tag>
-                      , void
-                    >
-                >
-            >
-        >
-    >
-{
-};
-
-//
-// Trait to retrieve one of the iterator traversal tags from the iterator category or traversal.
-//
-template <class Iterator = mpl::_1>
-struct pure_iterator_traversal
-  : pure_traversal_tag<typename iterator_traversal<Iterator>::type>
-{};
-
-# ifdef BOOST_MPL_CFG_NO_FULL_LAMBDA_SUPPORT
-template <>
-struct pure_iterator_traversal<mpl::_1>
-{
-    template <class T>
-    struct apply : pure_iterator_traversal<T>
-    {};
-};
-template <>
-struct pure_iterator_traversal<mpl::_>
-  : pure_iterator_traversal<mpl::_1>
-{};
-# endif
-
-} // namespace iterators
-
-using iterators::no_traversal_tag;
-using iterators::incrementable_traversal_tag;
-using iterators::single_pass_traversal_tag;
-using iterators::forward_traversal_tag;
-using iterators::bidirectional_traversal_tag;
-using iterators::random_access_traversal_tag;
-using iterators::iterator_category_to_traversal;
-using iterators::iterator_traversal;
-
-// This import is needed for backward compatibility with Boost.Range:
-// boost/range/detail/demote_iterator_traversal_tag.hpp
-// It should be removed when that header is fixed.
-namespace detail {
-using iterators::pure_traversal_tag;
-} // namespace detail
-
-} // namespace boost
-
-#include <boost/iterator/detail/config_undef.hpp>
-
-#endif // BOOST_ITERATOR_CATEGORIES_HPP
diff --git a/src/boost/iterator/iterator_facade.hpp b/src/boost/iterator/iterator_facade.hpp
deleted file mode 100644
index c4b5ae4c..00000000
--- a/src/boost/iterator/iterator_facade.hpp
+++ /dev/null
@@ -1,1062 +0,0 @@
-// (C) Copyright David Abrahams 2002.
-// (C) Copyright Jeremy Siek    2002.
-// (C) Copyright Thomas Witt    2002.
-// Distributed under the Boost Software License, Version 1.0. (See
-// accompanying file LICENSE_1_0.txt or copy at
-// http://www.boost.org/LICENSE_1_0.txt)
-#ifndef BOOST_ITERATOR_FACADE_23022003THW_HPP
-#define BOOST_ITERATOR_FACADE_23022003THW_HPP
-
-#include <boost/config.hpp>
-#include <boost/iterator/interoperable.hpp>
-#include <boost/iterator/iterator_traits.hpp>
-#include <boost/iterator/iterator_categories.hpp>
-
-#include <boost/iterator/detail/facade_iterator_category.hpp>
-#include <boost/iterator/detail/enable_if.hpp>
-
-#include <boost/static_assert.hpp>
-#include <boost/core/addressof.hpp>
-
-#include <boost/type_traits/is_same.hpp>
-#include <boost/type_traits/add_const.hpp>
-#include <boost/type_traits/add_pointer.hpp>
-#include <boost/type_traits/add_lvalue_reference.hpp>
-#include <boost/type_traits/remove_const.hpp>
-#include <boost/type_traits/remove_reference.hpp>
-#include <boost/type_traits/is_convertible.hpp>
-#include <boost/type_traits/is_pod.hpp>
-
-#include <boost/mpl/eval_if.hpp>
-#include <boost/mpl/if.hpp>
-#include <boost/mpl/or.hpp>
-#include <boost/mpl/and.hpp>
-#include <boost/mpl/not.hpp>
-#include <boost/mpl/always.hpp>
-#include <boost/mpl/apply.hpp>
-#include <boost/mpl/identity.hpp>
-
-#include <cstddef>
-
-#include <boost/iterator/detail/config_def.hpp> // this goes last
-
-namespace boost {
-namespace iterators {
-
-  // This forward declaration is required for the friend declaration
-  // in iterator_core_access
-  template <class I, class V, class TC, class R, class D> class iterator_facade;
-
-  namespace detail
-  {
-    // A binary metafunction class that always returns bool.  VC6
-    // ICEs on mpl::always<bool>, probably because of the default
-    // parameters.
-    struct always_bool2
-    {
-        template <class T, class U>
-        struct apply
-        {
-            typedef bool type;
-        };
-    };
-
-    // The type trait checks if the category or traversal is at least as advanced as the specified required traversal
-    template< typename CategoryOrTraversal, typename Required >
-    struct is_traversal_at_least :
-        public boost::is_convertible< typename iterator_category_to_traversal< CategoryOrTraversal >::type, Required >
-    {};
-
-    //
-    // enable if for use in operator implementation.
-    //
-    template <
-        class Facade1
-      , class Facade2
-      , class Return
-    >
-    struct enable_if_interoperable :
-        public boost::iterators::enable_if<
-            is_interoperable< Facade1, Facade2 >
-          , Return
-        >
-    {};
-
-    //
-    // enable if for use in implementation of operators specific for random access traversal.
-    //
-    template <
-        class Facade1
-      , class Facade2
-      , class Return
-    >
-    struct enable_if_interoperable_and_random_access_traversal :
-        public boost::iterators::enable_if<
-            mpl::and_<
-                is_interoperable< Facade1, Facade2 >
-              , is_traversal_at_least< typename iterator_category< Facade1 >::type, random_access_traversal_tag >
-              , is_traversal_at_least< typename iterator_category< Facade2 >::type, random_access_traversal_tag >
-            >
-          , Return
-        >
-    {};
-
-    //
-    // Generates associated types for an iterator_facade with the
-    // given parameters.
-    //
-    template <
-        class ValueParam
-      , class CategoryOrTraversal
-      , class Reference
-      , class Difference
-    >
-    struct iterator_facade_types
-    {
-        typedef typename facade_iterator_category<
-            CategoryOrTraversal, ValueParam, Reference
-        >::type iterator_category;
-
-        typedef typename remove_const<ValueParam>::type value_type;
-
-        // Not the real associated pointer type
-        typedef typename mpl::eval_if<
-            boost::iterators::detail::iterator_writability_disabled<ValueParam,Reference>
-          , add_pointer<const value_type>
-          , add_pointer<value_type>
-        >::type pointer;
-
-# if defined(BOOST_NO_TEMPLATE_PARTIAL_SPECIALIZATION)                          \
-    && (BOOST_WORKAROUND(_STLPORT_VERSION, BOOST_TESTED_AT(0x452))              \
-        || BOOST_WORKAROUND(BOOST_DINKUMWARE_STDLIB, BOOST_TESTED_AT(310)))     \
-    || BOOST_WORKAROUND(BOOST_RWSTD_VER, BOOST_TESTED_AT(0x20101))              \
-    || BOOST_WORKAROUND(BOOST_DINKUMWARE_STDLIB, <= 310)
-
-        // To interoperate with some broken library/compiler
-        // combinations, user-defined iterators must be derived from
-        // std::iterator.  It is possible to implement a standard
-        // library for broken compilers without this limitation.
-#  define BOOST_ITERATOR_FACADE_NEEDS_ITERATOR_BASE 1
-
-        typedef
-           iterator<iterator_category, value_type, Difference, pointer, Reference>
-        base;
-# endif
-    };
-
-    // iterators whose dereference operators reference the same value
-    // for all iterators into the same sequence (like many input
-    // iterators) need help with their postfix ++: the referenced
-    // value must be read and stored away before the increment occurs
-    // so that *a++ yields the originally referenced element and not
-    // the next one.
-    template <class Iterator>
-    class postfix_increment_proxy
-    {
-        typedef typename iterator_value<Iterator>::type value_type;
-
-     public:
-        explicit postfix_increment_proxy(Iterator const& x)
-          : stored_iterator(x)
-          , stored_value(*x)
-        {}
-
-        // Returning a mutable reference allows nonsense like
-        // (*r++).mutate(), but it imposes fewer assumptions about the
-        // behavior of the value_type.  In particular, recall that
-        // (*r).mutate() is legal if operator* returns by value.
-        // Provides readability of *r++
-        value_type& operator*() const
-        {
-            return stored_value;
-        }
-
-        // Provides X(r++)
-        operator Iterator const&() const
-        {
-            return stored_iterator;
-        }
-
-        // Provides (r++)->foo()
-        value_type* operator->() const
-        {
-            return boost::addressof(stored_value);
-        }
-
-     private:
-        Iterator stored_iterator;
-        mutable value_type stored_value;
-    };
-
-
-    template <class Iterator>
-    class writable_postfix_increment_dereference_proxy;
-
-    template <class T>
-    struct is_not_writable_postfix_increment_dereference_proxy :
-        public boost::true_type
-    {};
-
-    template <class Iterator>
-    struct is_not_writable_postfix_increment_dereference_proxy<
-        writable_postfix_increment_dereference_proxy<Iterator>
-    > :
-        public boost::false_type
-    {};
-
-    template <class Iterator>
-    class writable_postfix_increment_proxy;
-
-    //
-    // In general, we can't determine that such an iterator isn't
-    // writable -- we also need to store a copy of the old iterator so
-    // that it can be written into.
-    template <class Iterator>
-    class writable_postfix_increment_dereference_proxy
-    {
-        friend class writable_postfix_increment_proxy<Iterator>;
-
-        typedef typename iterator_value<Iterator>::type value_type;
-
-     public:
-        explicit writable_postfix_increment_dereference_proxy(Iterator const& x)
-          : stored_iterator(x)
-          , stored_value(*x)
-        {}
-
-        // Provides readability of *r++
-        operator value_type&() const
-        {
-            return this->stored_value;
-        }
-
-        template <class OtherIterator>
-        writable_postfix_increment_dereference_proxy const&
-        operator=(writable_postfix_increment_dereference_proxy<OtherIterator> const& x) const
-        {
-            typedef typename iterator_value<OtherIterator>::type other_value_type;
-            *this->stored_iterator = static_cast<other_value_type&>(x);
-            return *this;
-        }
-
-        // Provides writability of *r++
-#if !defined(BOOST_NO_CXX11_RVALUE_REFERENCES)
-        template <class T>
-        typename iterators::enable_if<
-            is_not_writable_postfix_increment_dereference_proxy< T >,
-            writable_postfix_increment_dereference_proxy const&
-        >::type operator=(T&& x) const
-        {
-            *this->stored_iterator = static_cast< T&& >(x);
-            return *this;
-        }
-#else
-        template <class T>
-        typename iterators::enable_if<
-            is_not_writable_postfix_increment_dereference_proxy< T >,
-            writable_postfix_increment_dereference_proxy const&
-        >::type operator=(T const& x) const
-        {
-            *this->stored_iterator = x;
-            return *this;
-        }
-
-        // This overload just in case only non-const objects are writable
-        template <class T>
-        typename iterators::enable_if<
-            is_not_writable_postfix_increment_dereference_proxy< T >,
-            writable_postfix_increment_dereference_proxy const&
-        >::type operator=(T& x) const
-        {
-            *this->stored_iterator = x;
-            return *this;
-        }
-#endif
-
-     private:
-        Iterator stored_iterator;
-        mutable value_type stored_value;
-    };
-
-    template <class Iterator>
-    class writable_postfix_increment_proxy
-    {
-        typedef typename iterator_value<Iterator>::type value_type;
-
-     public:
-        explicit writable_postfix_increment_proxy(Iterator const& x)
-          : dereference_proxy(x)
-        {}
-
-        writable_postfix_increment_dereference_proxy<Iterator> const&
-        operator*() const
-        {
-            return dereference_proxy;
-        }
-
-        // Provides X(r++)
-        operator Iterator const&() const
-        {
-            return dereference_proxy.stored_iterator;
-        }
-
-        // Provides (r++)->foo()
-        value_type* operator->() const
-        {
-            return boost::addressof(dereference_proxy.stored_value);
-        }
-
-     private:
-        writable_postfix_increment_dereference_proxy<Iterator> dereference_proxy;
-    };
-
-# ifdef BOOST_NO_TEMPLATE_PARTIAL_SPECIALIZATION
-
-    template <class Reference, class Value>
-    struct is_non_proxy_reference_impl
-    {
-        static Reference r;
-
-        template <class R>
-        static typename mpl::if_<
-            is_convertible<
-                R const volatile*
-              , Value const volatile*
-            >
-          , char[1]
-          , char[2]
-        >::type& helper(R const&);
-
-        BOOST_STATIC_CONSTANT(bool, value = sizeof(helper(r)) == 1);
-    };
-
-    template <class Reference, class Value>
-    struct is_non_proxy_reference
-      : mpl::bool_<
-            is_non_proxy_reference_impl<Reference, Value>::value
-        >
-    {};
-# else
-    template <class Reference, class Value>
-    struct is_non_proxy_reference
-      : is_convertible<
-            typename remove_reference<Reference>::type
-            const volatile*
-          , Value const volatile*
-        >
-    {};
-# endif
-
-    // A metafunction to choose the result type of postfix ++
-    //
-    // Because the C++98 input iterator requirements say that *r++ has
-    // type T (value_type), implementations of some standard
-    // algorithms like lexicographical_compare may use constructions
-    // like:
-    //
-    //          *r++ < *s++
-    //
-    // If *r++ returns a proxy (as required if r is writable but not
-    // multipass), this sort of expression will fail unless the proxy
-    // supports the operator<.  Since there are any number of such
-    // operations, we're not going to try to support them.  Therefore,
-    // even if r++ returns a proxy, *r++ will only return a proxy if
-    // *r also returns a proxy.
-    template <class Iterator, class Value, class Reference, class CategoryOrTraversal>
-    struct postfix_increment_result
-      : mpl::eval_if<
-            mpl::and_<
-                // A proxy is only needed for readable iterators
-                is_convertible<
-                    Reference
-                    // Use add_lvalue_reference to form `reference to Value` due to
-                    // some (strict) C++03 compilers (e.g. `gcc -std=c++03`) reject
-                    // 'reference-to-reference' in the template which described in CWG
-                    // DR106.
-                    // http://www.open-std.org/Jtc1/sc22/wg21/docs/cwg_defects.html#106
-                  , typename add_lvalue_reference<Value const>::type
-                >
-
-                // No multipass iterator can have values that disappear
-                // before positions can be re-visited
-              , mpl::not_<
-                    is_convertible<
-                        typename iterator_category_to_traversal<CategoryOrTraversal>::type
-                      , forward_traversal_tag
-                    >
-                >
-            >
-          , mpl::if_<
-                is_non_proxy_reference<Reference,Value>
-              , postfix_increment_proxy<Iterator>
-              , writable_postfix_increment_proxy<Iterator>
-            >
-          , mpl::identity<Iterator>
-        >
-    {};
-
-    // operator->() needs special support for input iterators to strictly meet the
-    // standard's requirements. If *i is not a reference type, we must still
-    // produce an lvalue to which a pointer can be formed.  We do that by
-    // returning a proxy object containing an instance of the reference object.
-    template <class Reference, class Pointer>
-    struct operator_arrow_dispatch // proxy references
-    {
-        struct proxy
-        {
-            explicit proxy(Reference const & x) : m_ref(x) {}
-            Reference* operator->() { return boost::addressof(m_ref); }
-            // This function is needed for MWCW and BCC, which won't call
-            // operator-> again automatically per 13.3.1.2 para 8
-            operator Reference*() { return boost::addressof(m_ref); }
-            Reference m_ref;
-        };
-        typedef proxy result_type;
-        static result_type apply(Reference const & x)
-        {
-            return result_type(x);
-        }
-    };
-
-    template <class T, class Pointer>
-    struct operator_arrow_dispatch<T&, Pointer> // "real" references
-    {
-        typedef Pointer result_type;
-        static result_type apply(T& x)
-        {
-            return boost::addressof(x);
-        }
-    };
-
-    // A proxy return type for operator[], needed to deal with
-    // iterators that may invalidate referents upon destruction.
-    // Consider the temporary iterator in *(a + n)
-    template <class Iterator>
-    class operator_brackets_proxy
-    {
-        // Iterator is actually an iterator_facade, so we do not have to
-        // go through iterator_traits to access the traits.
-        typedef typename Iterator::reference  reference;
-        typedef typename Iterator::value_type value_type;
-
-     public:
-        operator_brackets_proxy(Iterator const& iter)
-          : m_iter(iter)
-        {}
-
-        operator reference() const
-        {
-            return *m_iter;
-        }
-
-        operator_brackets_proxy& operator=(value_type const& val)
-        {
-            *m_iter = val;
-            return *this;
-        }
-
-     private:
-        Iterator m_iter;
-    };
-
-    // A metafunction that determines whether operator[] must return a
-    // proxy, or whether it can simply return a copy of the value_type.
-    template <class ValueType, class Reference>
-    struct use_operator_brackets_proxy
-      : mpl::not_<
-            mpl::and_<
-                // Really we want an is_copy_constructible trait here,
-                // but is_POD will have to suffice in the meantime.
-                boost::is_POD<ValueType>
-              , iterator_writability_disabled<ValueType,Reference>
-            >
-        >
-    {};
-
-    template <class Iterator, class Value, class Reference>
-    struct operator_brackets_result
-    {
-        typedef typename mpl::if_<
-            use_operator_brackets_proxy<Value,Reference>
-          , operator_brackets_proxy<Iterator>
-          , Value
-        >::type type;
-    };
-
-    template <class Iterator>
-    operator_brackets_proxy<Iterator> make_operator_brackets_result(Iterator const& iter, mpl::true_)
-    {
-        return operator_brackets_proxy<Iterator>(iter);
-    }
-
-    template <class Iterator>
-    typename Iterator::value_type make_operator_brackets_result(Iterator const& iter, mpl::false_)
-    {
-      return *iter;
-    }
-
-    struct choose_difference_type
-    {
-        template <class I1, class I2>
-        struct apply
-          :
-# ifdef BOOST_NO_ONE_WAY_ITERATOR_INTEROP
-          iterator_difference<I1>
-# else
-          mpl::eval_if<
-              is_convertible<I2,I1>
-            , iterator_difference<I1>
-            , iterator_difference<I2>
-          >
-# endif
-        {};
-
-    };
-
-    template <
-        class Derived
-      , class Value
-      , class CategoryOrTraversal
-      , class Reference
-      , class Difference
-      , bool IsBidirectionalTraversal
-      , bool IsRandomAccessTraversal
-    >
-    class iterator_facade_base;
-
-  } // namespace detail
-
-
-  // Macros which describe the declarations of binary operators
-# ifdef BOOST_NO_STRICT_ITERATOR_INTEROPERABILITY
-#  define BOOST_ITERATOR_FACADE_INTEROP_HEAD_IMPL(prefix, op, result_type, enabler)       \
-    template <                                                              \
-        class Derived1, class V1, class TC1, class Reference1, class Difference1 \
-      , class Derived2, class V2, class TC2, class Reference2, class Difference2 \
-    >                                                                       \
-    prefix typename mpl::apply2<result_type,Derived1,Derived2>::type \
-    operator op(                                                            \
-        iterator_facade<Derived1, V1, TC1, Reference1, Difference1> const& lhs   \
-      , iterator_facade<Derived2, V2, TC2, Reference2, Difference2> const& rhs)
-# else
-#  define BOOST_ITERATOR_FACADE_INTEROP_HEAD_IMPL(prefix, op, result_type, enabler)   \
-    template <                                                          \
-        class Derived1, class V1, class TC1, class Reference1, class Difference1 \
-      , class Derived2, class V2, class TC2, class Reference2, class Difference2 \
-    >                                                                   \
-    prefix typename enabler<                                            \
-        Derived1, Derived2                                              \
-      , typename mpl::apply2<result_type,Derived1,Derived2>::type       \
-    >::type                                                             \
-    operator op(                                                        \
-        iterator_facade<Derived1, V1, TC1, Reference1, Difference1> const& lhs   \
-      , iterator_facade<Derived2, V2, TC2, Reference2, Difference2> const& rhs)
-# endif
-
-#  define BOOST_ITERATOR_FACADE_INTEROP_HEAD(prefix, op, result_type)       \
-    BOOST_ITERATOR_FACADE_INTEROP_HEAD_IMPL(prefix, op, result_type, boost::iterators::detail::enable_if_interoperable)
-
-#  define BOOST_ITERATOR_FACADE_INTEROP_RANDOM_ACCESS_HEAD(prefix, op, result_type)       \
-    BOOST_ITERATOR_FACADE_INTEROP_HEAD_IMPL(prefix, op, result_type, boost::iterators::detail::enable_if_interoperable_and_random_access_traversal)
-
-#  define BOOST_ITERATOR_FACADE_PLUS_HEAD(prefix,args)              \
-    template <class Derived, class V, class TC, class R, class D>   \
-    prefix typename boost::iterators::enable_if<                    \
-        boost::iterators::detail::is_traversal_at_least< TC, boost::iterators::random_access_traversal_tag >,  \
-        Derived                                                     \
-    >::type operator+ args
-
-  //
-  // Helper class for granting access to the iterator core interface.
-  //
-  // The simple core interface is used by iterator_facade. The core
-  // interface of a user/library defined iterator type should not be made public
-  // so that it does not clutter the public interface. Instead iterator_core_access
-  // should be made friend so that iterator_facade can access the core
-  // interface through iterator_core_access.
-  //
-  class iterator_core_access
-  {
-# if defined(BOOST_NO_MEMBER_TEMPLATE_FRIENDS)
-      // Tasteless as this may seem, making all members public allows member templates
-      // to work in the absence of member template friends.
-   public:
-# else
-
-      template <class I, class V, class TC, class R, class D> friend class iterator_facade;
-      template <class I, class V, class TC, class R, class D, bool IsBidirectionalTraversal, bool IsRandomAccessTraversal>
-      friend class detail::iterator_facade_base;
-
-#  define BOOST_ITERATOR_FACADE_RELATION(op)                                \
-      BOOST_ITERATOR_FACADE_INTEROP_HEAD(friend,op, boost::iterators::detail::always_bool2);
-
-      BOOST_ITERATOR_FACADE_RELATION(==)
-      BOOST_ITERATOR_FACADE_RELATION(!=)
-
-#  undef BOOST_ITERATOR_FACADE_RELATION
-
-#  define BOOST_ITERATOR_FACADE_RANDOM_ACCESS_RELATION(op)                                \
-      BOOST_ITERATOR_FACADE_INTEROP_RANDOM_ACCESS_HEAD(friend,op, boost::iterators::detail::always_bool2);
-
-      BOOST_ITERATOR_FACADE_RANDOM_ACCESS_RELATION(<)
-      BOOST_ITERATOR_FACADE_RANDOM_ACCESS_RELATION(>)
-      BOOST_ITERATOR_FACADE_RANDOM_ACCESS_RELATION(<=)
-      BOOST_ITERATOR_FACADE_RANDOM_ACCESS_RELATION(>=)
-
-#  undef BOOST_ITERATOR_FACADE_RANDOM_ACCESS_RELATION
-
-      BOOST_ITERATOR_FACADE_INTEROP_RANDOM_ACCESS_HEAD(
-          friend, -, boost::iterators::detail::choose_difference_type)
-      ;
-
-      BOOST_ITERATOR_FACADE_PLUS_HEAD(
-          friend inline
-        , (iterator_facade<Derived, V, TC, R, D> const&
-        , typename Derived::difference_type)
-      )
-      ;
-
-      BOOST_ITERATOR_FACADE_PLUS_HEAD(
-          friend inline
-        , (typename Derived::difference_type
-        , iterator_facade<Derived, V, TC, R, D> const&)
-      )
-      ;
-
-# endif
-
-      template <class Facade>
-      static typename Facade::reference dereference(Facade const& f)
-      {
-          return f.dereference();
-      }
-
-      template <class Facade>
-      static void increment(Facade& f)
-      {
-          f.increment();
-      }
-
-      template <class Facade>
-      static void decrement(Facade& f)
-      {
-          f.decrement();
-      }
-
-      template <class Facade1, class Facade2>
-      static bool equal(Facade1 const& f1, Facade2 const& f2, mpl::true_)
-      {
-          return f1.equal(f2);
-      }
-
-      template <class Facade1, class Facade2>
-      static bool equal(Facade1 const& f1, Facade2 const& f2, mpl::false_)
-      {
-          return f2.equal(f1);
-      }
-
-      template <class Facade>
-      static void advance(Facade& f, typename Facade::difference_type n)
-      {
-          f.advance(n);
-      }
-
-      template <class Facade1, class Facade2>
-      static typename Facade1::difference_type distance_from(
-          Facade1 const& f1, Facade2 const& f2, mpl::true_)
-      {
-          return -f1.distance_to(f2);
-      }
-
-      template <class Facade1, class Facade2>
-      static typename Facade2::difference_type distance_from(
-          Facade1 const& f1, Facade2 const& f2, mpl::false_)
-      {
-          return f2.distance_to(f1);
-      }
-
-      //
-      // Curiously Recurring Template interface.
-      //
-      template <class I, class V, class TC, class R, class D>
-      static I& derived(iterator_facade<I,V,TC,R,D>& facade)
-      {
-          return *static_cast<I*>(&facade);
-      }
-
-      template <class I, class V, class TC, class R, class D>
-      static I const& derived(iterator_facade<I,V,TC,R,D> const& facade)
-      {
-          return *static_cast<I const*>(&facade);
-      }
-
-      // objects of this class are useless
-      BOOST_DELETED_FUNCTION(iterator_core_access())
-  };
-
-  namespace detail {
-
-    // Implementation for forward traversal iterators
-    template <
-        class Derived
-      , class Value
-      , class CategoryOrTraversal
-      , class Reference
-      , class Difference
-    >
-    class iterator_facade_base< Derived, Value, CategoryOrTraversal, Reference, Difference, false, false >
-# ifdef BOOST_ITERATOR_FACADE_NEEDS_ITERATOR_BASE
-        : public boost::iterators::detail::iterator_facade_types<
-             Value, CategoryOrTraversal, Reference, Difference
-          >::base
-#  undef BOOST_ITERATOR_FACADE_NEEDS_ITERATOR_BASE
-# endif
-    {
-    private:
-        typedef boost::iterators::detail::iterator_facade_types<
-            Value, CategoryOrTraversal, Reference, Difference
-        > associated_types;
-
-        typedef boost::iterators::detail::operator_arrow_dispatch<
-            Reference
-          , typename associated_types::pointer
-        > operator_arrow_dispatch_;
-
-    public:
-        typedef typename associated_types::value_type value_type;
-        typedef Reference reference;
-        typedef Difference difference_type;
-
-        typedef typename operator_arrow_dispatch_::result_type pointer;
-
-        typedef typename associated_types::iterator_category iterator_category;
-
-    public:
-        reference operator*() const
-        {
-            return iterator_core_access::dereference(this->derived());
-        }
-
-        pointer operator->() const
-        {
-            return operator_arrow_dispatch_::apply(*this->derived());
-        }
-
-        Derived& operator++()
-        {
-            iterator_core_access::increment(this->derived());
-            return this->derived();
-        }
-
-    protected:
-        //
-        // Curiously Recurring Template interface.
-        //
-        Derived& derived()
-        {
-            return *static_cast<Derived*>(this);
-        }
-
-        Derived const& derived() const
-        {
-            return *static_cast<Derived const*>(this);
-        }
-    };
-
-    // Implementation for bidirectional traversal iterators
-    template <
-        class Derived
-      , class Value
-      , class CategoryOrTraversal
-      , class Reference
-      , class Difference
-    >
-    class iterator_facade_base< Derived, Value, CategoryOrTraversal, Reference, Difference, true, false > :
-        public iterator_facade_base< Derived, Value, CategoryOrTraversal, Reference, Difference, false, false >
-    {
-    public:
-        Derived& operator--()
-        {
-            iterator_core_access::decrement(this->derived());
-            return this->derived();
-        }
-
-        Derived operator--(int)
-        {
-            Derived tmp(this->derived());
-            --*this;
-            return tmp;
-        }
-    };
-
-    // Implementation for random access traversal iterators
-    template <
-        class Derived
-      , class Value
-      , class CategoryOrTraversal
-      , class Reference
-      , class Difference
-    >
-    class iterator_facade_base< Derived, Value, CategoryOrTraversal, Reference, Difference, true, true > :
-        public iterator_facade_base< Derived, Value, CategoryOrTraversal, Reference, Difference, true, false >
-    {
-    private:
-        typedef iterator_facade_base< Derived, Value, CategoryOrTraversal, Reference, Difference, true, false > base_type;
-
-    public:
-        typedef typename base_type::reference reference;
-        typedef typename base_type::difference_type difference_type;
-
-    public:
-        typename boost::iterators::detail::operator_brackets_result<Derived, Value, reference>::type
-        operator[](difference_type n) const
-        {
-            typedef boost::iterators::detail::use_operator_brackets_proxy<Value, Reference> use_proxy;
-
-            return boost::iterators::detail::make_operator_brackets_result<Derived>(
-                this->derived() + n
-              , use_proxy()
-            );
-        }
-
-        Derived& operator+=(difference_type n)
-        {
-            iterator_core_access::advance(this->derived(), n);
-            return this->derived();
-        }
-
-        Derived& operator-=(difference_type n)
-        {
-            iterator_core_access::advance(this->derived(), -n);
-            return this->derived();
-        }
-
-        Derived operator-(difference_type x) const
-        {
-            Derived result(this->derived());
-            return result -= x;
-        }
-    };
-
-  } // namespace detail
-
-  //
-  // iterator_facade - use as a public base class for defining new
-  // standard-conforming iterators.
-  //
-  template <
-      class Derived             // The derived iterator type being constructed
-    , class Value
-    , class CategoryOrTraversal
-    , class Reference   = Value&
-    , class Difference  = std::ptrdiff_t
-  >
-  class iterator_facade :
-      public detail::iterator_facade_base<
-          Derived,
-          Value,
-          CategoryOrTraversal,
-          Reference,
-          Difference,
-          detail::is_traversal_at_least< CategoryOrTraversal, bidirectional_traversal_tag >::value,
-          detail::is_traversal_at_least< CategoryOrTraversal, random_access_traversal_tag >::value
-      >
-  {
-  protected:
-      // For use by derived classes
-      typedef iterator_facade<Derived,Value,CategoryOrTraversal,Reference,Difference> iterator_facade_;
-  };
-
-  template <class I, class V, class TC, class R, class D>
-  inline typename boost::iterators::detail::postfix_increment_result<I,V,R,TC>::type
-  operator++(
-      iterator_facade<I,V,TC,R,D>& i
-    , int
-  )
-  {
-      typename boost::iterators::detail::postfix_increment_result<I,V,R,TC>::type
-          tmp(*static_cast<I*>(&i));
-
-      ++i;
-
-      return tmp;
-  }
-
-
-  //
-  // Comparison operator implementation. The library supplied operators
-  // enables the user to provide fully interoperable constant/mutable
-  // iterator types. I.e. the library provides all operators
-  // for all mutable/constant iterator combinations.
-  //
-  // Note though that this kind of interoperability for constant/mutable
-  // iterators is not required by the standard for container iterators.
-  // All the standard asks for is a conversion mutable -> constant.
-  // Most standard library implementations nowadays provide fully interoperable
-  // iterator implementations, but there are still heavily used implementations
-  // that do not provide them. (Actually it's even worse, they do not provide
-  // them for only a few iterators.)
-  //
-  // ?? Maybe a BOOST_ITERATOR_NO_FULL_INTEROPERABILITY macro should
-  //    enable the user to turn off mixed type operators
-  //
-  // The library takes care to provide only the right operator overloads.
-  // I.e.
-  //
-  // bool operator==(Iterator,      Iterator);
-  // bool operator==(ConstIterator, Iterator);
-  // bool operator==(Iterator,      ConstIterator);
-  // bool operator==(ConstIterator, ConstIterator);
-  //
-  //   ...
-  //
-  // In order to do so it uses c++ idioms that are not yet widely supported
-  // by current compiler releases. The library is designed to degrade gracefully
-  // in the face of compiler deficiencies. In general compiler
-  // deficiencies result in less strict error checking and more obscure
-  // error messages, functionality is not affected.
-  //
-  // For full operation compiler support for "Substitution Failure Is Not An Error"
-  // (aka. enable_if) and boost::is_convertible is required.
-  //
-  // The following problems occur if support is lacking.
-  //
-  // Pseudo code
-  //
-  // ---------------
-  // AdaptorA<Iterator1> a1;
-  // AdaptorA<Iterator2> a2;
-  //
-  // // This will result in a no such overload error in full operation
-  // // If enable_if or is_convertible is not supported
-  // // The instantiation will fail with an error hopefully indicating that
-  // // there is no operator== for Iterator1, Iterator2
-  // // The same will happen if no enable_if is used to remove
-  // // false overloads from the templated conversion constructor
-  // // of AdaptorA.
-  //
-  // a1 == a2;
-  // ----------------
-  //
-  // AdaptorA<Iterator> a;
-  // AdaptorB<Iterator> b;
-  //
-  // // This will result in a no such overload error in full operation
-  // // If enable_if is not supported the static assert used
-  // // in the operator implementation will fail.
-  // // This will accidently work if is_convertible is not supported.
-  //
-  // a == b;
-  // ----------------
-  //
-
-# ifdef BOOST_NO_ONE_WAY_ITERATOR_INTEROP
-#  define BOOST_ITERATOR_CONVERTIBLE(a,b) mpl::true_()
-# else
-#  define BOOST_ITERATOR_CONVERTIBLE(a,b) is_convertible<a,b>()
-# endif
-
-# define BOOST_ITERATOR_FACADE_INTEROP(op, result_type, return_prefix, base_op) \
-  BOOST_ITERATOR_FACADE_INTEROP_HEAD(inline, op, result_type)                   \
-  {                                                                             \
-      /* For those compilers that do not support enable_if */                   \
-      BOOST_STATIC_ASSERT((                                                     \
-          is_interoperable< Derived1, Derived2 >::value                         \
-      ));                                                                       \
-      return_prefix iterator_core_access::base_op(                              \
-          *static_cast<Derived1 const*>(&lhs)                                   \
-        , *static_cast<Derived2 const*>(&rhs)                                   \
-        , BOOST_ITERATOR_CONVERTIBLE(Derived2,Derived1)                         \
-      );                                                                        \
-  }
-
-# define BOOST_ITERATOR_FACADE_RELATION(op, return_prefix, base_op) \
-  BOOST_ITERATOR_FACADE_INTEROP(                                    \
-      op                                                            \
-    , boost::iterators::detail::always_bool2                                   \
-    , return_prefix                                                 \
-    , base_op                                                       \
-  )
-
-  BOOST_ITERATOR_FACADE_RELATION(==, return, equal)
-  BOOST_ITERATOR_FACADE_RELATION(!=, return !, equal)
-
-# undef BOOST_ITERATOR_FACADE_RELATION
-
-
-# define BOOST_ITERATOR_FACADE_INTEROP_RANDOM_ACCESS(op, result_type, return_prefix, base_op) \
-  BOOST_ITERATOR_FACADE_INTEROP_RANDOM_ACCESS_HEAD(inline, op, result_type)                   \
-  {                                                                             \
-      /* For those compilers that do not support enable_if */                   \
-      BOOST_STATIC_ASSERT((                                                     \
-          is_interoperable< Derived1, Derived2 >::value &&                      \
-          boost::iterators::detail::is_traversal_at_least< typename iterator_category< Derived1 >::type, random_access_traversal_tag >::value && \
-          boost::iterators::detail::is_traversal_at_least< typename iterator_category< Derived2 >::type, random_access_traversal_tag >::value \
-      ));                                                                       \
-      return_prefix iterator_core_access::base_op(                              \
-          *static_cast<Derived1 const*>(&lhs)                                   \
-        , *static_cast<Derived2 const*>(&rhs)                                   \
-        , BOOST_ITERATOR_CONVERTIBLE(Derived2,Derived1)                         \
-      );                                                                        \
-  }
-
-# define BOOST_ITERATOR_FACADE_RANDOM_ACCESS_RELATION(op, return_prefix, base_op) \
-  BOOST_ITERATOR_FACADE_INTEROP_RANDOM_ACCESS(                                    \
-      op                                                            \
-    , boost::iterators::detail::always_bool2                                   \
-    , return_prefix                                                 \
-    , base_op                                                       \
-  )
-
-  BOOST_ITERATOR_FACADE_RANDOM_ACCESS_RELATION(<, return 0 >, distance_from)
-  BOOST_ITERATOR_FACADE_RANDOM_ACCESS_RELATION(>, return 0 <, distance_from)
-  BOOST_ITERATOR_FACADE_RANDOM_ACCESS_RELATION(<=, return 0 >=, distance_from)
-  BOOST_ITERATOR_FACADE_RANDOM_ACCESS_RELATION(>=, return 0 <=, distance_from)
-
-# undef BOOST_ITERATOR_FACADE_RANDOM_ACCESS_RELATION
-
-  // operator- requires an additional part in the static assertion
-  BOOST_ITERATOR_FACADE_INTEROP_RANDOM_ACCESS(
-      -
-    , boost::iterators::detail::choose_difference_type
-    , return
-    , distance_from
-  )
-
-# undef BOOST_ITERATOR_FACADE_INTEROP
-# undef BOOST_ITERATOR_FACADE_INTEROP_RANDOM_ACCESS
-
-# define BOOST_ITERATOR_FACADE_PLUS(args)           \
-  BOOST_ITERATOR_FACADE_PLUS_HEAD(inline, args)     \
-  {                                                 \
-      Derived tmp(static_cast<Derived const&>(i));  \
-      return tmp += n;                              \
-  }
-
-  BOOST_ITERATOR_FACADE_PLUS((
-      iterator_facade<Derived, V, TC, R, D> const& i
-    , typename Derived::difference_type n
-  ))
-
-  BOOST_ITERATOR_FACADE_PLUS((
-      typename Derived::difference_type n
-    , iterator_facade<Derived, V, TC, R, D> const& i
-  ))
-
-# undef BOOST_ITERATOR_FACADE_PLUS
-# undef BOOST_ITERATOR_FACADE_PLUS_HEAD
-
-# undef BOOST_ITERATOR_FACADE_INTEROP_HEAD
-# undef BOOST_ITERATOR_FACADE_INTEROP_RANDOM_ACCESS_HEAD
-# undef BOOST_ITERATOR_FACADE_INTEROP_HEAD_IMPL
-
-} // namespace iterators
-
-using iterators::iterator_core_access;
-using iterators::iterator_facade;
-
-} // namespace boost
-
-#include <boost/iterator/detail/config_undef.hpp>
-
-#endif // BOOST_ITERATOR_FACADE_23022003THW_HPP
diff --git a/src/boost/iterator/iterator_traits.hpp b/src/boost/iterator/iterator_traits.hpp
deleted file mode 100644
index 6582a68f..00000000
--- a/src/boost/iterator/iterator_traits.hpp
+++ /dev/null
@@ -1,61 +0,0 @@
-// Copyright David Abrahams 2003.
-// Distributed under the Boost Software License, Version 1.0. (See
-// accompanying file LICENSE_1_0.txt or copy at
-// http://www.boost.org/LICENSE_1_0.txt)
-#ifndef ITERATOR_TRAITS_DWA200347_HPP
-# define ITERATOR_TRAITS_DWA200347_HPP
-
-# include <boost/detail/workaround.hpp>
-
-#include <iterator>
-
-namespace boost {
-namespace iterators {
-
-// Macro for supporting old compilers, no longer needed but kept
-// for backwards compatibility (it was documented).
-#define BOOST_ITERATOR_CATEGORY iterator_category
-
-
-template <class Iterator>
-struct iterator_value
-{
-    typedef typename std::iterator_traits<Iterator>::value_type type;
-};
-
-template <class Iterator>
-struct iterator_reference
-{
-    typedef typename std::iterator_traits<Iterator>::reference type;
-};
-
-
-template <class Iterator>
-struct iterator_pointer
-{
-    typedef typename std::iterator_traits<Iterator>::pointer type;
-};
-
-template <class Iterator>
-struct iterator_difference
-{
-    typedef typename std::iterator_traits<Iterator>::difference_type type;
-};
-
-template <class Iterator>
-struct iterator_category
-{
-    typedef typename std::iterator_traits<Iterator>::iterator_category type;
-};
-
-} // namespace iterators
-
-using iterators::iterator_value;
-using iterators::iterator_reference;
-using iterators::iterator_pointer;
-using iterators::iterator_difference;
-using iterators::iterator_category;
-
-} // namespace boost
-
-#endif // ITERATOR_TRAITS_DWA200347_HPP
diff --git a/src/boost/iterator/reverse_iterator.hpp b/src/boost/iterator/reverse_iterator.hpp
deleted file mode 100644
index 03b7925c..00000000
--- a/src/boost/iterator/reverse_iterator.hpp
+++ /dev/null
@@ -1,77 +0,0 @@
-// (C) Copyright David Abrahams 2002.
-// (C) Copyright Jeremy Siek    2002.
-// (C) Copyright Thomas Witt    2002.
-// Distributed under the Boost Software License, Version 1.0. (See
-// accompanying file LICENSE_1_0.txt or copy at
-// http://www.boost.org/LICENSE_1_0.txt)
-#ifndef BOOST_REVERSE_ITERATOR_23022003THW_HPP
-#define BOOST_REVERSE_ITERATOR_23022003THW_HPP
-
-#include <boost/iterator/iterator_adaptor.hpp>
-
-namespace boost {
-namespace iterators {
-
-  //
-  //
-  //
-  template <class Iterator>
-  class reverse_iterator
-      : public iterator_adaptor< reverse_iterator<Iterator>, Iterator >
-  {
-      typedef iterator_adaptor< reverse_iterator<Iterator>, Iterator > super_t;
-
-      friend class iterator_core_access;
-
-   public:
-      reverse_iterator() {}
-
-      explicit reverse_iterator(Iterator x)
-          : super_t(x) {}
-
-      template<class OtherIterator>
-      reverse_iterator(
-          reverse_iterator<OtherIterator> const& r
-          , typename enable_if_convertible<OtherIterator, Iterator>::type* = 0
-          )
-          : super_t(r.base())
-      {}
-
-   private:
-      typename super_t::reference dereference() const
-      {
-          Iterator it = this->base_reference();
-          --it;
-          return *it;
-      }
-
-      void increment() { --this->base_reference(); }
-      void decrement() { ++this->base_reference(); }
-
-      void advance(typename super_t::difference_type n)
-      {
-          this->base_reference() -= n;
-      }
-
-      template <class OtherIterator>
-      typename super_t::difference_type
-      distance_to(reverse_iterator<OtherIterator> const& y) const
-      {
-          return this->base_reference() - y.base();
-      }
-  };
-
-  template <class BidirectionalIterator>
-  inline reverse_iterator<BidirectionalIterator> make_reverse_iterator(BidirectionalIterator x)
-  {
-      return reverse_iterator<BidirectionalIterator>(x);
-  }
-
-} // namespace iterators
-
-using iterators::reverse_iterator;
-using iterators::make_reverse_iterator;
-
-} // namespace boost
-
-#endif // BOOST_REVERSE_ITERATOR_23022003THW_HPP
diff --git a/src/boost/move/adl_move_swap.hpp b/src/boost/move/adl_move_swap.hpp
deleted file mode 100644
index d9096e36..00000000
--- a/src/boost/move/adl_move_swap.hpp
+++ /dev/null
@@ -1,272 +0,0 @@
-//////////////////////////////////////////////////////////////////////////////
-//
-// (C) Copyright 2007, 2008 Steven Watanabe, Joseph Gauterin, Niels Dekker
-// (C) Copyright Ion Gaztanaga 2005-2013. Distributed under the Boost
-// 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.
-//
-//////////////////////////////////////////////////////////////////////////////
-
-#ifndef BOOST_MOVE_ADL_MOVE_SWAP_HPP
-#define BOOST_MOVE_ADL_MOVE_SWAP_HPP
-
-#ifndef BOOST_CONFIG_HPP
-#  include <boost/config.hpp>
-#endif
-#
-#if defined(BOOST_HAS_PRAGMA_ONCE)
-#  pragma once
-#endif
-
-//Based on Boost.Core's swap.
-//Many thanks to Steven Watanabe, Joseph Gauterin and Niels Dekker.
-#include <cstddef> //for std::size_t
-#include <boost/move/detail/workaround.hpp>  //forceinline
-
-//Try to avoid including <algorithm>, as it's quite big
-#if defined(_MSC_VER) && defined(BOOST_DINKUMWARE_STDLIB)
-   #include <utility>   //Dinkum libraries define std::swap in utility which is lighter than algorithm
-#elif defined(BOOST_GNU_STDLIB)
-   //For non-GCC compilers, where GNUC version is not very reliable, or old GCC versions
-   //use the good old stl_algobase header, which is quite lightweight
-   #if !defined(BOOST_GCC) || ((__GNUC__ < 4) || ((__GNUC__ == 4) && (__GNUC_MINOR__ < 3)))
-      #include <bits/stl_algobase.h>
-   #elif (__GNUC__ == 4) && (__GNUC_MINOR__ == 3)
-      //In GCC 4.3 a tiny stl_move.h was created with swap and move utilities
-      #include <bits/stl_move.h>
-   #else
-      //In GCC 4.4 stl_move.h was renamed to move.h
-      #include <bits/move.h>
-   #endif
-#elif defined(_LIBCPP_VERSION)
-   #include <type_traits>  //The initial import of libc++ defines std::swap and still there
-#elif __cplusplus >= 201103L
-   #include <utility>    //Fallback for C++ >= 2011
-#else
-   #include <algorithm>  //Fallback for C++98/03
-#endif
-
-#include <boost/move/utility_core.hpp> //for boost::move
-
-#if !defined(BOOST_MOVE_DOXYGEN_INVOKED)
-
-#if defined(BOOST_NO_CXX11_RVALUE_REFERENCES)
-namespace boost_move_member_swap {
-
-struct dont_care
-{
-   dont_care(...);
-};
-
-struct private_type
-{
-   static private_type p;
-   private_type const &operator,(int) const;
-};
-
-typedef char yes_type;            
-struct no_type{ char dummy[2]; }; 
-
-template<typename T>
-no_type is_private_type(T const &);
-
-yes_type is_private_type(private_type const &);
-
-template <typename Type>
-class has_member_function_named_swap
-{
-   struct BaseMixin
-   {
-      void swap();
-   };
-
-   struct Base : public Type, public BaseMixin { Base(); };
-   template <typename T, T t> class Helper{};
-
-   template <typename U>
-   static no_type deduce(U*, Helper<void (BaseMixin::*)(), &U::swap>* = 0);
-   static yes_type deduce(...);
-
-   public:
-   static const bool value = sizeof(yes_type) == sizeof(deduce((Base*)(0)));
-};
-
-template<typename Fun, bool HasFunc>
-struct has_member_swap_impl
-{
-   static const bool value = false;
-};
-
-template<typename Fun>
-struct has_member_swap_impl<Fun, true>
-{
-   struct FunWrap : Fun
-   {
-      FunWrap();
-
-      using Fun::swap;
-      private_type swap(dont_care) const;
-   };
-
-   static Fun &declval_fun();
-   static FunWrap declval_wrap();
-
-   static bool const value =
-      sizeof(no_type) == sizeof(is_private_type( (declval_wrap().swap(declval_fun()), 0)) );
-};
-
-template<typename Fun>
-struct has_member_swap : public has_member_swap_impl
-      <Fun, has_member_function_named_swap<Fun>::value>
-{};
-
-}  //namespace boost_move_member_swap
-
-namespace boost_move_adl_swap{
-
-template<class P1, class P2, bool = P1::value>
-struct and_op_impl
-{  static const bool value = false; };
-
-template<class P1, class P2>
-struct and_op_impl<P1, P2, true>
-{  static const bool value = P2::value;   };
-
-template<class P1, class P2>
-struct and_op
-   : and_op_impl<P1, P2>
-{};
-
-//////
-
-template<class P1, class P2, bool = P1::value>
-struct and_op_not_impl
-{  static const bool value = false; };
-
-template<class P1, class P2>
-struct and_op_not_impl<P1, P2, true>
-{  static const bool value = !P2::value;   };
-
-template<class P1, class P2>
-struct and_op_not
-   : and_op_not_impl<P1, P2>
-{};
-
-template<class T>
-BOOST_MOVE_FORCEINLINE void swap_proxy(T& x, T& y, typename boost::move_detail::enable_if_c<!boost::move_detail::has_move_emulation_enabled_impl<T>::value>::type* = 0)
-{
-   //use std::swap if argument dependent lookup fails
-   //Use using directive ("using namespace xxx;") instead as some older compilers
-   //don't do ADL with using declarations ("using ns::func;").
-   using namespace std;
-   swap(x, y);
-}
-
-template<class T>
-BOOST_MOVE_FORCEINLINE void swap_proxy(T& x, T& y
-               , typename boost::move_detail::enable_if< and_op_not_impl<boost::move_detail::has_move_emulation_enabled_impl<T>
-                                                                        , boost_move_member_swap::has_member_swap<T> >
-                                                       >::type* = 0)
-{  T t(::boost::move(x)); x = ::boost::move(y); y = ::boost::move(t);  }
-
-template<class T>
-BOOST_MOVE_FORCEINLINE void swap_proxy(T& x, T& y
-               , typename boost::move_detail::enable_if< and_op_impl< boost::move_detail::has_move_emulation_enabled_impl<T>
-                                                                    , boost_move_member_swap::has_member_swap<T> >
-                                                       >::type* = 0)
-{  x.swap(y);  }
-
-}  //namespace boost_move_adl_swap{
-
-#else
-
-namespace boost_move_adl_swap{
-
-template<class T>
-BOOST_MOVE_FORCEINLINE void swap_proxy(T& x, T& y)
-{
-   using std::swap;
-   swap(x, y);
-}
-
-}  //namespace boost_move_adl_swap{
-
-#endif   //#if defined(BOOST_NO_CXX11_RVALUE_REFERENCES)
-
-namespace boost_move_adl_swap{
-
-template<class T, std::size_t N>
-void swap_proxy(T (& x)[N], T (& y)[N])
-{
-   for (std::size_t i = 0; i < N; ++i){
-      ::boost_move_adl_swap::swap_proxy(x[i], y[i]);
-   }
-}
-
-}  //namespace boost_move_adl_swap {
-
-#endif   //!defined(BOOST_MOVE_DOXYGEN_INVOKED)
-
-namespace boost{
-
-//! Exchanges the values of a and b, using Argument Dependent Lookup (ADL) to select a
-//! specialized swap function if available. If no specialized swap function is available,
-//! std::swap is used.
-//!
-//! <b>Exception</b>: If T uses Boost.Move's move emulation and the compiler has
-//! no rvalue references then:
-//!
-//!   -  If T has a <code>T::swap(T&)</code> member, that member is called.
-//!   -  Otherwise a move-based swap is called, equivalent to: 
-//!      <code>T t(::boost::move(x)); x = ::boost::move(y); y = ::boost::move(t);</code>.
-template<class T>
-BOOST_MOVE_FORCEINLINE void adl_move_swap(T& x, T& y)
-{
-   ::boost_move_adl_swap::swap_proxy(x, y);
-}
-
-//! Exchanges elements between range [first1, last1) and another range starting at first2
-//! using boost::adl_move_swap.
-//! 
-//! Parameters:
-//!   first1, last1   -   the first range of elements to swap
-//!   first2   -   beginning of the second range of elements to swap
-//!
-//! Type requirements:
-//!   - ForwardIt1, ForwardIt2 must meet the requirements of ForwardIterator.
-//!   - The types of dereferenced ForwardIt1 and ForwardIt2 must meet the
-//!     requirements of Swappable
-//!
-//! Return value: Iterator to the element past the last element exchanged in the range
-//! beginning with first2.
-template<class ForwardIt1, class ForwardIt2>
-ForwardIt2 adl_move_swap_ranges(ForwardIt1 first1, ForwardIt1 last1, ForwardIt2 first2)
-{
-    while (first1 != last1) {
-      ::boost::adl_move_swap(*first1, *first2);
-      ++first1;
-      ++first2;
-    }
-   return first2;
-}
-
-template<class BidirIt1, class BidirIt2>
-BidirIt2 adl_move_swap_ranges_backward(BidirIt1 first1, BidirIt1 last1, BidirIt2 last2)
-{
-   while (first1 != last1) {
-      ::boost::adl_move_swap(*(--last1), *(--last2));
-   }
-   return last2;
-}
-
-template<class ForwardIt1, class ForwardIt2>
-void adl_move_iter_swap(ForwardIt1 a, ForwardIt2 b)
-{
-   boost::adl_move_swap(*a, *b); 
-}
-
-}  //namespace boost{
-
-#endif   //#ifndef BOOST_MOVE_ADL_MOVE_SWAP_HPP
diff --git a/src/boost/move/algo/adaptive_merge.hpp b/src/boost/move/algo/adaptive_merge.hpp
deleted file mode 100644
index bba41bd2..00000000
--- a/src/boost/move/algo/adaptive_merge.hpp
+++ /dev/null
@@ -1,364 +0,0 @@
-//////////////////////////////////////////////////////////////////////////////
-//
-// (C) Copyright Ion Gaztanaga 2015-2016.
-// Distributed under the Boost 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/move for documentation.
-//
-//////////////////////////////////////////////////////////////////////////////
-
-#ifndef BOOST_MOVE_ADAPTIVE_MERGE_HPP
-#define BOOST_MOVE_ADAPTIVE_MERGE_HPP
-
-#include <boost/move/detail/config_begin.hpp>
-#include <boost/move/algo/detail/adaptive_sort_merge.hpp>
-#include <cassert>
-
-#if defined(BOOST_CLANG) || (defined(BOOST_GCC) && (BOOST_GCC >= 40600))
-#pragma GCC diagnostic push
-#pragma GCC diagnostic ignored "-Wsign-conversion"
-#endif
-
-namespace boost {
-namespace movelib {
-
-///@cond
-namespace detail_adaptive {
-
-template<class RandIt, class Compare, class XBuf>
-inline void adaptive_merge_combine_blocks( RandIt first
-                                      , typename iter_size<RandIt>::type len1
-                                      , typename iter_size<RandIt>::type len2
-                                      , typename iter_size<RandIt>::type collected
-                                      , typename iter_size<RandIt>::type n_keys
-                                      , typename iter_size<RandIt>::type l_block
-                                      , bool use_internal_buf
-                                      , bool xbuf_used
-                                      , Compare comp
-                                      , XBuf & xbuf
-                                      )
-{
-   typedef typename iter_size<RandIt>::type       size_type;
-
-   size_type const len = size_type(len1+len2);
-   size_type const l_combine  = size_type(len-collected);
-   size_type const l_combine1 = size_type(len1-collected);
-
-    if(n_keys){
-      RandIt const first_data = first+collected;
-      RandIt const keys = first;
-      BOOST_MOVE_ADAPTIVE_SORT_PRINT_L2("   A combine: ", len);
-      if(xbuf_used){
-         if(xbuf.size() < l_block){
-            xbuf.initialize_until(l_block, *first);
-         }
-         assert(xbuf.size() >= l_block);
-         size_type n_block_a, n_block_b, l_irreg1, l_irreg2;
-         combine_params( keys, comp, l_combine
-                           , l_combine1, l_block, xbuf
-                           , n_block_a, n_block_b, l_irreg1, l_irreg2);   //Outputs
-         op_merge_blocks_with_buf
-            (keys, comp, first_data, l_block, l_irreg1, n_block_a, n_block_b, l_irreg2, comp, move_op(), xbuf.data());
-         BOOST_MOVE_ADAPTIVE_SORT_PRINT_L1("   A mrg xbf: ", len);
-      }
-      else{
-         size_type n_block_a, n_block_b, l_irreg1, l_irreg2;
-         combine_params( keys, comp, l_combine
-                           , l_combine1, l_block, xbuf
-                           , n_block_a, n_block_b, l_irreg1, l_irreg2);   //Outputs
-         if(use_internal_buf){
-            op_merge_blocks_with_buf
-               ( keys, comp, first_data, l_block, l_irreg1, n_block_a, n_block_b
-               , l_irreg2, comp, swap_op(), first_data-l_block);
-            BOOST_MOVE_ADAPTIVE_SORT_PRINT_L2("   A mrg buf: ", len);
-         }
-         else{
-            merge_blocks_bufferless
-               (keys, comp, first_data, l_block, l_irreg1, n_block_a, n_block_b, l_irreg2, comp);
-            BOOST_MOVE_ADAPTIVE_SORT_PRINT_L1("   A mrg nbf: ", len);
-         }
-      }
-   }
-   else{
-      xbuf.shrink_to_fit(l_block);
-      if(xbuf.size() < l_block){
-         xbuf.initialize_until(l_block, *first);
-      }
-      size_type *const uint_keys = xbuf.template aligned_trailing<size_type>(l_block);
-      size_type n_block_a, n_block_b, l_irreg1, l_irreg2;
-      combine_params( uint_keys, less(), l_combine
-                     , l_combine1, l_block, xbuf
-                     , n_block_a, n_block_b, l_irreg1, l_irreg2, true);   //Outputs
-      BOOST_MOVE_ADAPTIVE_SORT_PRINT_L2("   A combine: ", len);
-      assert(xbuf.size() >= l_block);
-      op_merge_blocks_with_buf
-         (uint_keys, less(), first, l_block, l_irreg1, n_block_a, n_block_b, l_irreg2, comp, move_op(), xbuf.data());
-      xbuf.clear();
-      BOOST_MOVE_ADAPTIVE_SORT_PRINT_L1("   A mrg buf: ", len);
-   }
-}
-
-template<class RandIt, class Compare, class XBuf>
-inline void adaptive_merge_final_merge( RandIt first
-                                      , typename iter_size<RandIt>::type len1
-                                      , typename iter_size<RandIt>::type len2
-                                      , typename iter_size<RandIt>::type collected
-                                      , typename iter_size<RandIt>::type l_intbuf
-                                      , typename iter_size<RandIt>::type //l_block
-                                      , bool //use_internal_buf
-                                      , bool xbuf_used
-                                      , Compare comp
-                                      , XBuf & xbuf
-                                      )
-{
-   typedef typename iter_size<RandIt>::type       size_type;
-
-   size_type n_keys = size_type(collected-l_intbuf);
-   size_type len = size_type(len1+len2);
-   if (!xbuf_used || n_keys) {
-      xbuf.clear();
-      const size_type middle = xbuf_used && n_keys ? n_keys: collected;
-      unstable_sort(first, first + middle, comp, xbuf);
-      BOOST_MOVE_ADAPTIVE_SORT_PRINT_L2("   A k/b srt: ", len);
-      stable_merge(first, first + middle, first + len, comp, xbuf);
-   }
-   BOOST_MOVE_ADAPTIVE_SORT_PRINT_L1("   A fin mrg: ", len);
-}
-
-template<class SizeType>
-inline static SizeType adaptive_merge_n_keys_without_external_keys(SizeType l_block, SizeType len1, SizeType len2, SizeType l_intbuf)
-{
-   typedef SizeType size_type;
-   //This is the minimum number of keys to implement the ideal algorithm
-   size_type n_keys = size_type(len1/l_block + len2/l_block);
-   const size_type second_half_blocks = size_type(len2/l_block);
-   const size_type first_half_aux = size_type(len1 - l_intbuf);
-   while(n_keys >= ((first_half_aux-n_keys)/l_block + second_half_blocks)){
-      --n_keys;
-   }
-   ++n_keys;
-   return n_keys;
-}
-
-template<class SizeType>
-inline static SizeType adaptive_merge_n_keys_with_external_keys(SizeType l_block, SizeType len1, SizeType len2, SizeType l_intbuf)
-{
-   typedef SizeType size_type;
-   //This is the minimum number of keys to implement the ideal algorithm
-   size_type n_keys = size_type((len1-l_intbuf)/l_block + len2/l_block);
-   return n_keys;
-}
-
-template<class SizeType, class Xbuf>
-inline SizeType adaptive_merge_n_keys_intbuf(SizeType &rl_block, SizeType len1, SizeType len2, Xbuf & xbuf, SizeType &l_intbuf_inout)
-{
-   typedef SizeType size_type;
-   size_type l_block = rl_block;
-   size_type l_intbuf = xbuf.capacity() >= l_block ? 0u : l_block;
-
-   if (xbuf.capacity() > l_block){
-      l_block = xbuf.capacity();
-   }
-
-   //This is the minimum number of keys to implement the ideal algorithm
-   size_type n_keys = adaptive_merge_n_keys_without_external_keys(l_block, len1, len2, l_intbuf);
-   assert(n_keys >= ((len1-l_intbuf-n_keys)/l_block + len2/l_block));
-
-   if(xbuf.template supports_aligned_trailing<size_type>
-      ( l_block
-      , adaptive_merge_n_keys_with_external_keys(l_block, len1, len2, l_intbuf)))
-   {
-      n_keys = 0u;
-   }
-   l_intbuf_inout = l_intbuf;
-   rl_block = l_block;
-   return n_keys;
-}
-
-// Main explanation of the merge algorithm.
-//
-// csqrtlen = ceil(sqrt(len));
-//
-// * First, csqrtlen [to be used as buffer] + (len/csqrtlen - 1) [to be used as keys] => to_collect
-//   unique elements are extracted from elements to be sorted and placed in the beginning of the range.
-//
-// * Step "combine_blocks": the leading (len1-to_collect) elements plus trailing len2 elements
-//   are merged with a non-trivial ("smart") algorithm to form an ordered range trailing "len-to_collect" elements.
-//
-//   Explanation of the "combine_blocks" step:
-//
-//         * Trailing [first+to_collect, first+len1) elements are divided in groups of cqrtlen elements.
-//           Remaining elements that can't form a group are grouped in front of those elements.
-//         * Trailing [first+len1, first+len1+len2) elements are divided in groups of cqrtlen elements.
-//           Remaining elements that can't form a group are grouped in the back of those elements.
-//         * In parallel the following two steps are performed:
-//             *  Groups are selection-sorted by first or last element (depending whether they are going
-//                to be merged to left or right) and keys are reordered accordingly as an imitation-buffer.
-//             * Elements of each block pair are merged using the csqrtlen buffer taking into account
-//                if they belong to the first half or second half (marked by the key).
-//
-// * In the final merge step leading "to_collect" elements are merged with rotations
-//   with the rest of merged elements in the "combine_blocks" step.
-//
-// Corner cases:
-//
-// * If no "to_collect" elements can be extracted:
-//
-//    * If more than a minimum number of elements is extracted
-//      then reduces the number of elements used as buffer and keys in the
-//      and "combine_blocks" steps. If "combine_blocks" has no enough keys due to this reduction
-//      then uses a rotation based smart merge.
-//
-//    * If the minimum number of keys can't be extracted, a rotation-based merge is performed.
-//
-// * If auxiliary memory is more or equal than min(len1, len2), a buffered merge is performed.
-//
-// * If the len1 or len2 are less than 2*csqrtlen then a rotation-based merge is performed.
-//
-// * If auxiliary memory is more than csqrtlen+n_keys*sizeof(std::size_t),
-//   then no csqrtlen need to be extracted and "combine_blocks" will use integral
-//   keys to combine blocks.
-template<class RandIt, class Compare, class XBuf>
-void adaptive_merge_impl
-   ( RandIt first
-   , typename iter_size<RandIt>::type len1
-   , typename iter_size<RandIt>::type len2
-   , Compare comp
-   , XBuf & xbuf
-   )
-{
-   typedef typename iter_size<RandIt>::type size_type;
-
-   if(xbuf.capacity() >= min_value<size_type>(len1, len2)){
-      buffered_merge( first, first+len1
-                    , first + len1+len2, comp, xbuf);
-   }
-   else{
-      const size_type len = size_type(len1+len2);
-      //Calculate ideal parameters and try to collect needed unique keys
-      size_type l_block = size_type(ceil_sqrt(len));
-
-      //One range is not big enough to extract keys and the internal buffer so a
-      //rotation-based based merge will do just fine
-      if(len1 <= l_block*2 || len2 <= l_block*2){
-         merge_bufferless(first, first+len1, first+len1+len2, comp);
-         return;
-      }
-
-      //Detail the number of keys and internal buffer. If xbuf has enough memory, no
-      //internal buffer is needed so l_intbuf will remain 0.
-      size_type l_intbuf = 0;
-      size_type n_keys = adaptive_merge_n_keys_intbuf(l_block, len1, len2, xbuf, l_intbuf);
-      size_type const to_collect = size_type(l_intbuf+n_keys);
-      //Try to extract needed unique values from the first range
-      size_type const collected  = collect_unique(first, first+len1, to_collect, comp, xbuf);
-      BOOST_MOVE_ADAPTIVE_SORT_PRINT_L1("\n   A collect: ", len);
-
-      //Not the minimum number of keys is not available on the first range, so fallback to rotations
-      if(collected != to_collect && collected < 4){
-         merge_bufferless(first, first+collected, first+len1, comp);
-         merge_bufferless(first, first + len1, first + len1 + len2, comp);
-         return;
-      }
-
-      //If not enough keys but more than minimum, adjust the internal buffer and key count
-      bool use_internal_buf = collected == to_collect;
-      if (!use_internal_buf){
-         l_intbuf = 0u;
-         n_keys = collected;
-         l_block  = lblock_for_combine(l_intbuf, n_keys, len, use_internal_buf);
-         //If use_internal_buf is false, then then internal buffer will be zero and rotation-based combination will be used
-         l_intbuf = use_internal_buf ? l_block : 0u;
-      }
-
-      bool const xbuf_used = collected == to_collect && xbuf.capacity() >= l_block;
-      //Merge trailing elements using smart merges
-      adaptive_merge_combine_blocks(first, len1, len2, collected,   n_keys, l_block, use_internal_buf, xbuf_used, comp, xbuf);
-      //Merge buffer and keys with the rest of the values
-      adaptive_merge_final_merge   (first, len1, len2, collected, l_intbuf, l_block, use_internal_buf, xbuf_used, comp, xbuf);
-   }
-}
-
-}  //namespace detail_adaptive {
-
-///@endcond
-
-//! <b>Effects</b>: Merges two consecutive sorted ranges [first, middle) and [middle, last)
-//!   into one sorted range [first, last) according to the given comparison function comp.
-//!   The algorithm is stable (if there are equivalent elements in the original two ranges,
-//!   the elements from the first range (preserving their original order) precede the elements
-//!   from the second range (preserving their original order).
-//!
-//! <b>Requires</b>:
-//!   - RandIt must meet the requirements of ValueSwappable and RandomAccessIterator.
-//!   - The type of dereferenced RandIt must meet the requirements of MoveAssignable and MoveConstructible.
-//!
-//! <b>Parameters</b>:
-//!   - first: the beginning of the first sorted range. 
-//!   - middle: the end of the first sorted range and the beginning of the second
-//!   - last: the end of the second sorted range
-//!   - comp: comparison function object which returns true if the first argument is is ordered before the second.
-//!   - uninitialized, uninitialized_len: raw storage starting on "uninitialized", able to hold "uninitialized_len"
-//!      elements of type iterator_traits<RandIt>::value_type. Maximum performance is achieved when uninitialized_len
-//!      is min(std::distance(first, middle), std::distance(middle, last)).
-//!
-//! <b>Throws</b>: If comp throws or the move constructor, move assignment or swap of the type
-//!   of dereferenced RandIt throws.
-//!
-//! <b>Complexity</b>: Always K x O(N) comparisons and move assignments/constructors/swaps.
-//!   Constant factor for comparisons and data movement is minimized when uninitialized_len
-//!   is min(std::distance(first, middle), std::distance(middle, last)).
-//!   Pretty good enough performance is achieved when uninitialized_len is
-//!   ceil(sqrt(std::distance(first, last)))*2.
-//!
-//! <b>Caution</b>: Experimental implementation, not production-ready.
-template<class RandIt, class Compare>
-void adaptive_merge( RandIt first, RandIt middle, RandIt last, Compare comp
-                , typename iterator_traits<RandIt>::value_type* uninitialized = 0
-                , typename iter_size<RandIt>::type uninitialized_len = 0)
-{
-   typedef typename iter_size<RandIt>::type  size_type;
-   typedef typename iterator_traits<RandIt>::value_type value_type;
-
-   if (first == middle || middle == last){
-      return;
-   }
-
-   //Reduce ranges to merge if possible
-   do {
-      if (comp(*middle, *first)){
-         break;
-      }
-      ++first;
-      if (first == middle)
-         return;
-   } while(1);
-
-   RandIt first_high(middle);
-   --first_high;
-   do {
-      --last;
-      if (comp(*last, *first_high)){
-         ++last;
-         break;
-      }
-      if (last == middle)
-         return;
-   } while(1);
-
-   ::boost::movelib::adaptive_xbuf<value_type, value_type*, size_type> xbuf(uninitialized, size_type(uninitialized_len));
-   ::boost::movelib::detail_adaptive::adaptive_merge_impl(first, size_type(middle - first), size_type(last - middle), comp, xbuf);
-}
-
-}  //namespace movelib {
-}  //namespace boost {
-
-#if defined(BOOST_CLANG) || (defined(BOOST_GCC) && (BOOST_GCC >= 40600))
-#pragma GCC diagnostic pop
-#endif
-
-#include <boost/move/detail/config_end.hpp>
-
-#endif   //#define BOOST_MOVE_ADAPTIVE_MERGE_HPP
diff --git a/src/boost/move/algo/adaptive_sort.hpp b/src/boost/move/algo/adaptive_sort.hpp
deleted file mode 100644
index b2ade8b8..00000000
--- a/src/boost/move/algo/adaptive_sort.hpp
+++ /dev/null
@@ -1,654 +0,0 @@
-//////////////////////////////////////////////////////////////////////////////
-//
-// (C) Copyright Ion Gaztanaga 2015-2016.
-// Distributed under the Boost 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/move for documentation.
-//
-//////////////////////////////////////////////////////////////////////////////
-
-#ifndef BOOST_MOVE_ADAPTIVE_SORT_HPP
-#define BOOST_MOVE_ADAPTIVE_SORT_HPP
-
-#include <boost/move/detail/config_begin.hpp>
-
-#include <boost/move/algo/detail/adaptive_sort_merge.hpp>
-#include <cassert>
-
-#if defined(BOOST_CLANG) || (defined(BOOST_GCC) && (BOOST_GCC >= 40600))
-#pragma GCC diagnostic push
-#pragma GCC diagnostic ignored "-Wsign-conversion"
-#endif
-
-namespace boost {
-namespace movelib {
-
-///@cond
-namespace detail_adaptive {
-
-template<class RandIt>
-void move_data_backward( RandIt cur_pos
-              , typename iter_size<RandIt>::type const l_data
-              , RandIt new_pos
-              , bool const xbuf_used)
-{
-   //Move buffer to the total combination right
-   if(xbuf_used){
-      boost::move_backward(cur_pos, cur_pos+l_data, new_pos+l_data);      
-   }
-   else{
-      boost::adl_move_swap_ranges_backward(cur_pos, cur_pos+l_data, new_pos+l_data);      
-      //Rotate does less moves but it seems slower due to cache issues
-      //rotate_gcd(first-l_block, first+len-l_block, first+len);
-   }
-}
-
-template<class RandIt>
-void move_data_forward( RandIt cur_pos
-              , typename iter_size<RandIt>::type const l_data
-              , RandIt new_pos
-              , bool const xbuf_used)
-{
-   //Move buffer to the total combination right
-   if(xbuf_used){
-      boost::move(cur_pos, cur_pos+l_data, new_pos);
-   }
-   else{
-      boost::adl_move_swap_ranges(cur_pos, cur_pos+l_data, new_pos);
-      //Rotate does less moves but it seems slower due to cache issues
-      //rotate_gcd(first-l_block, first+len-l_block, first+len);
-   }
-}
-
-// build blocks of length 2*l_build_buf. l_build_buf is power of two
-// input: [0, l_build_buf) elements are buffer, rest unsorted elements
-// output: [0, l_build_buf) elements are buffer, blocks 2*l_build_buf and last subblock sorted
-//
-// First elements are merged from right to left until elements start
-// at first. All old elements [first, first + l_build_buf) are placed at the end
-// [first+len-l_build_buf, first+len). To achieve this:
-// - If we have external memory to merge, we save elements from the buffer
-//   so that a non-swapping merge is used. Buffer elements are restored
-//   at the end of the buffer from the external memory.
-//
-// - When the external memory is not available or it is insufficient
-//   for a merge operation, left swap merging is used.
-//
-// Once elements are merged left to right in blocks of l_build_buf, then a single left
-// to right merge step is performed to achieve merged blocks of size 2K.
-// If external memory is available, usual merge is used, swap merging otherwise.
-//
-// As a last step, if auxiliary memory is available in-place merge is performed.
-// until all is merged or auxiliary memory is not large enough.
-template<class RandIt, class Compare, class XBuf>
-typename iter_size<RandIt>::type  
-   adaptive_sort_build_blocks
-      ( RandIt const first
-      , typename iter_size<RandIt>::type const len
-      , typename iter_size<RandIt>::type const l_base
-      , typename iter_size<RandIt>::type const l_build_buf
-      , XBuf & xbuf
-      , Compare comp)
-{
-   typedef typename iter_size<RandIt>::type       size_type;
-   assert(l_build_buf <= len);
-   assert(0 == ((l_build_buf / l_base)&(l_build_buf/l_base-1)));
-
-   //Place the start pointer after the buffer
-   RandIt first_block = first + l_build_buf;
-   size_type const elements_in_blocks = size_type(len - l_build_buf);
-
-   //////////////////////////////////
-   // Start of merge to left step
-   //////////////////////////////////
-   size_type l_merged = 0u;
-
-   assert(l_build_buf);
-   //If there is no enough buffer for the insertion sort step, just avoid the external buffer
-   size_type kbuf = min_value<size_type>(l_build_buf, size_type(xbuf.capacity()));
-   kbuf = kbuf < l_base ? 0 : kbuf;
-
-   if(kbuf){
-      //Backup internal buffer values in external buffer so they can be overwritten
-      xbuf.move_assign(first+l_build_buf-kbuf, kbuf);
-      l_merged = op_insertion_sort_step_left(first_block, elements_in_blocks, l_base, comp, move_op());
-
-      //Now combine them using the buffer. Elements from buffer can be
-      //overwritten since they've been saved to xbuf
-      l_merged = op_merge_left_step_multiple
-         ( first_block - l_merged, elements_in_blocks, l_merged, l_build_buf, size_type(kbuf - l_merged), comp, move_op());
-
-      //Restore internal buffer from external buffer unless kbuf was l_build_buf,
-      //in that case restoration will happen later
-      if(kbuf != l_build_buf){
-         boost::move(xbuf.data()+kbuf-l_merged, xbuf.data() + kbuf, first_block-l_merged+elements_in_blocks);
-      }
-   }
-   else{
-      l_merged = insertion_sort_step(first_block, elements_in_blocks, l_base, comp);
-      rotate_gcd(first_block-l_merged, first_block, first_block+elements_in_blocks);
-   }
-
-   //Now combine elements using the buffer. Elements from buffer can't be
-   //overwritten since xbuf was not big enough, so merge swapping elements.
-   l_merged = op_merge_left_step_multiple
-      (first_block-l_merged, elements_in_blocks, l_merged, l_build_buf, size_type(l_build_buf - l_merged), comp, swap_op());
-
-   assert(l_merged == l_build_buf);
-
-   //////////////////////////////////
-   // Start of merge to right step
-   //////////////////////////////////
-
-   //If kbuf is l_build_buf then we can merge right without swapping
-   //Saved data is still in xbuf
-   if(kbuf && kbuf == l_build_buf){
-      op_merge_right_step_once(first, elements_in_blocks, l_build_buf, comp, move_op());
-      //Restore internal buffer from external buffer if kbuf was l_build_buf.
-      //as this operation was previously delayed.
-      boost::move(xbuf.data(), xbuf.data() + kbuf, first);
-   }
-   else{
-      op_merge_right_step_once(first, elements_in_blocks, l_build_buf, comp, swap_op());
-   }
-   xbuf.clear();
-   //2*l_build_buf or total already merged
-   return min_value<size_type>(elements_in_blocks, size_type(2u*l_build_buf));
-}
-
-template<class RandItKeys, class KeyCompare, class RandIt, class Compare, class XBuf>
-void adaptive_sort_combine_blocks
-   ( RandItKeys const keys
-   , KeyCompare key_comp
-   , RandIt const first
-   , typename iter_size<RandIt>::type const len
-   , typename iter_size<RandIt>::type const l_prev_merged
-   , typename iter_size<RandIt>::type const l_block
-   , bool const use_buf
-   , bool const xbuf_used
-   , XBuf & xbuf
-   , Compare comp
-   , bool merge_left)
-{
-   boost::movelib::ignore(xbuf);
-   typedef typename iter_size<RandIt>::type         size_type;
-
-   size_type const l_reg_combined   = size_type(2u*l_prev_merged);
-   size_type l_irreg_combined = 0;
-   size_type const l_total_combined = calculate_total_combined(len, l_prev_merged, &l_irreg_combined);
-   size_type const n_reg_combined = len/l_reg_combined;
-   RandIt combined_first = first;
-
-   boost::movelib::ignore(l_total_combined);
-   assert(l_total_combined <= len);
-
-   size_type const max_i = size_type(n_reg_combined + (l_irreg_combined != 0));
-
-   if(merge_left || !use_buf) {
-      for( size_type combined_i = 0; combined_i != max_i; ) {
-         //Now merge blocks
-         bool const is_last = combined_i==n_reg_combined;
-         size_type const l_cur_combined = is_last ? l_irreg_combined : l_reg_combined;
-
-         range_xbuf<RandIt, size_type, move_op> rbuf( (use_buf && xbuf_used) ? (combined_first-l_block) : combined_first, combined_first);
-         size_type n_block_a, n_block_b, l_irreg1, l_irreg2;
-         combine_params( keys, key_comp, l_cur_combined
-                        , l_prev_merged, l_block, rbuf
-                        , n_block_a, n_block_b, l_irreg1, l_irreg2);   //Outputs
-         BOOST_MOVE_ADAPTIVE_SORT_PRINT_L2("   A combpar:            ", len + l_block);
-         BOOST_MOVE_ADAPTIVE_SORT_INVARIANT(boost::movelib::is_sorted(combined_first, combined_first + n_block_a*l_block+l_irreg1, comp));
-            BOOST_MOVE_ADAPTIVE_SORT_INVARIANT(boost::movelib::is_sorted(combined_first + n_block_a*l_block+l_irreg1, combined_first + n_block_a*l_block+l_irreg1+n_block_b*l_block+l_irreg2, comp));
-         if(!use_buf){
-            merge_blocks_bufferless
-               (keys, key_comp, combined_first, l_block, 0u, n_block_a, n_block_b, l_irreg2, comp);
-         }
-         else{
-            merge_blocks_left
-               (keys, key_comp, combined_first, l_block, 0u, n_block_a, n_block_b, l_irreg2, comp, xbuf_used);
-         }
-         BOOST_MOVE_ADAPTIVE_SORT_PRINT_L2("   After merge_blocks_L: ", len + l_block);
-         ++combined_i;
-         if(combined_i != max_i)
-            combined_first += l_reg_combined;
-      }
-   }
-   else{
-      combined_first += size_type(l_reg_combined*(max_i-1u));
-      for( size_type combined_i = max_i; combined_i; ) {
-         --combined_i;
-         bool const is_last = combined_i==n_reg_combined;
-         size_type const l_cur_combined = is_last ? l_irreg_combined : l_reg_combined;
-
-         RandIt const combined_last(combined_first+l_cur_combined);
-         range_xbuf<RandIt, size_type, move_op> rbuf(combined_last, xbuf_used ? (combined_last+l_block) : combined_last);
-         size_type n_block_a, n_block_b, l_irreg1, l_irreg2;
-         combine_params( keys, key_comp, l_cur_combined
-                        , l_prev_merged, l_block, rbuf
-                        , n_block_a, n_block_b, l_irreg1, l_irreg2);  //Outputs
-         BOOST_MOVE_ADAPTIVE_SORT_PRINT_L2("   A combpar:            ", len + l_block);
-         BOOST_MOVE_ADAPTIVE_SORT_INVARIANT(boost::movelib::is_sorted(combined_first, combined_first + n_block_a*l_block+l_irreg1, comp));
-         BOOST_MOVE_ADAPTIVE_SORT_INVARIANT(boost::movelib::is_sorted(combined_first + n_block_a*l_block+l_irreg1, combined_first + n_block_a*l_block+l_irreg1+n_block_b*l_block+l_irreg2, comp));
-         merge_blocks_right
-            (keys, key_comp, combined_first, l_block, n_block_a, n_block_b, l_irreg2, comp, xbuf_used);
-         BOOST_MOVE_ADAPTIVE_SORT_PRINT_L2("   After merge_blocks_R: ", len + l_block);
-         if(combined_i)
-            combined_first -= l_reg_combined;
-      }
-   }
-}
-
-//Returns true if buffer is placed in 
-//[buffer+len-l_intbuf, buffer+len). Otherwise, buffer is
-//[buffer,buffer+l_intbuf)
-template<class RandIt, class Compare, class XBuf>
-bool adaptive_sort_combine_all_blocks
-   ( RandIt keys
-   , typename iter_size<RandIt>::type &n_keys
-   , RandIt const buffer
-   , typename iter_size<RandIt>::type const l_buf_plus_data
-   , typename iter_size<RandIt>::type l_merged
-   , typename iter_size<RandIt>::type &l_intbuf
-   , XBuf & xbuf
-   , Compare comp)
-{
-   typedef typename iter_size<RandIt>::type       size_type;
-
-   RandIt const first = buffer + l_intbuf;
-   size_type const l_data = size_type(l_buf_plus_data - l_intbuf);
-   size_type const l_unique = size_type(l_intbuf + n_keys);
-   //Backup data to external buffer once if possible
-   bool const common_xbuf = l_data > l_merged && l_intbuf && l_intbuf <= xbuf.capacity();
-   if(common_xbuf){
-      xbuf.move_assign(buffer, l_intbuf);
-   }
-
-   bool prev_merge_left = true;
-   size_type l_prev_total_combined = l_merged, l_prev_block = 0;
-   bool prev_use_internal_buf = true;
-
-   for( size_type n = 0; l_data > l_merged
-      ; l_merged = size_type(2u*l_merged)
-      , ++n){
-      //If l_intbuf is non-zero, use that internal buffer.
-      //    Implies l_block == l_intbuf && use_internal_buf == true
-      //If l_intbuf is zero, see if half keys can be reused as a reduced emergency buffer,
-      //    Implies l_block == n_keys/2 && use_internal_buf == true
-      //Otherwise, just give up and and use all keys to merge using rotations (use_internal_buf = false)
-      bool use_internal_buf = false;
-      size_type const l_block = lblock_for_combine(l_intbuf, n_keys, size_type(2*l_merged), use_internal_buf);
-      assert(!l_intbuf || (l_block == l_intbuf));
-      assert(n == 0 || (!use_internal_buf || prev_use_internal_buf) );
-      assert(n == 0 || (!use_internal_buf || l_prev_block == l_block) );
-      
-      bool const is_merge_left = (n&1) == 0;
-      size_type const l_total_combined = calculate_total_combined(l_data, l_merged);
-      if(n && prev_use_internal_buf && prev_merge_left){
-         if(is_merge_left || !use_internal_buf){
-            move_data_backward(first-l_prev_block, l_prev_total_combined, first, common_xbuf);
-         }
-         else{
-            //Put the buffer just after l_total_combined
-            RandIt const buf_end = first+l_prev_total_combined;
-            RandIt const buf_beg = buf_end-l_block;
-            if(l_prev_total_combined > l_total_combined){
-               size_type const l_diff = size_type(l_prev_total_combined - l_total_combined);
-               move_data_backward(buf_beg-l_diff, l_diff, buf_end-l_diff, common_xbuf);
-            }
-            else if(l_prev_total_combined < l_total_combined){
-               size_type const l_diff = size_type(l_total_combined - l_prev_total_combined);
-               move_data_forward(buf_end, l_diff, buf_beg, common_xbuf);
-            }
-         }
-         BOOST_MOVE_ADAPTIVE_SORT_PRINT_L2("   After move_data     : ", l_data + l_intbuf);
-      }
-
-      //Combine to form l_merged*2 segments
-      if(n_keys){
-         size_type upper_n_keys_this_iter = size_type(2u*l_merged/l_block);
-         if(upper_n_keys_this_iter > 256){
-            adaptive_sort_combine_blocks
-               ( keys, comp, !use_internal_buf || is_merge_left ? first : first-l_block
-               , l_data, l_merged, l_block, use_internal_buf, common_xbuf, xbuf, comp, is_merge_left);
-         }
-         else{
-            unsigned char uint_keys[256];
-            adaptive_sort_combine_blocks
-               ( uint_keys, less(), !use_internal_buf || is_merge_left ? first : first-l_block
-               , l_data, l_merged, l_block, use_internal_buf, common_xbuf, xbuf, comp, is_merge_left);
-            }
-      }
-      else{
-         size_type *const uint_keys = xbuf.template aligned_trailing<size_type>();
-         adaptive_sort_combine_blocks
-            ( uint_keys, less(), !use_internal_buf || is_merge_left ? first : first-l_block
-            , l_data, l_merged, l_block, use_internal_buf, common_xbuf, xbuf, comp, is_merge_left);
-      }
-
-      BOOST_MOVE_ADAPTIVE_SORT_PRINT_L1(is_merge_left ? "   After comb blocks L:  " : "   After comb blocks R:  ", l_data + l_intbuf);
-      prev_merge_left = is_merge_left;
-      l_prev_total_combined = l_total_combined;
-      l_prev_block = l_block;
-      prev_use_internal_buf = use_internal_buf;
-   }
-   assert(l_prev_total_combined == l_data);
-   bool const buffer_right = prev_use_internal_buf && prev_merge_left;
-
-   l_intbuf = prev_use_internal_buf ? l_prev_block : 0u;
-   n_keys = size_type(l_unique - l_intbuf);
-   //Restore data from to external common buffer if used
-   if(common_xbuf){
-      if(buffer_right){
-         boost::move(xbuf.data(), xbuf.data() + l_intbuf, buffer+l_data);
-      }
-      else{
-         boost::move(xbuf.data(), xbuf.data() + l_intbuf, buffer);
-      }
-   }
-   return buffer_right;
-}
-
-
-template<class RandIt, class Compare, class XBuf>
-void adaptive_sort_final_merge( bool buffer_right
-                              , RandIt const first
-                              , typename iter_size<RandIt>::type const l_intbuf
-                              , typename iter_size<RandIt>::type const n_keys
-                              , typename iter_size<RandIt>::type const len
-                              , XBuf & xbuf
-                              , Compare comp)
-{
-   //assert(n_keys || xbuf.size() == l_intbuf);
-   xbuf.clear();
-
-   typedef typename iter_size<RandIt>::type         size_type;
-
-   size_type const n_key_plus_buf = size_type(l_intbuf+n_keys);
-   if(buffer_right){
-      //Use stable sort as some buffer elements might not be unique (see non_unique_buf)
-      stable_sort(first+len-l_intbuf, first+len, comp, xbuf);
-      stable_merge( first+n_keys, first+len-l_intbuf, first+len,    antistable<Compare>(comp), xbuf);
-      unstable_sort(first, first+n_keys, comp, xbuf);
-      stable_merge(first, first+n_keys, first+len, comp, xbuf);
-   }
-   else{
-      //Use stable sort as some buffer elements might not be unique (see non_unique_buf)
-      stable_sort(first, first+n_key_plus_buf, comp, xbuf);
-      if(xbuf.capacity() >= n_key_plus_buf){
-         buffered_merge(first, first+n_key_plus_buf, first+len, comp, xbuf);
-      }
-      else if(xbuf.capacity() >= min_value<size_type>(l_intbuf, n_keys)){
-         stable_merge( first+n_keys, first+n_key_plus_buf
-                     , first+len, comp, xbuf);
-         stable_merge(first, first+n_keys, first+len, comp, xbuf);
-      }
-      else{
-         stable_merge(first, first+n_key_plus_buf, first+len, comp, xbuf);
-      }
-   }
-   BOOST_MOVE_ADAPTIVE_SORT_PRINT_L1("   After final_merge   : ", len);
-}
-
-template<class RandIt, class Compare, class Unsigned, class XBuf>
-bool adaptive_sort_build_params
-   (RandIt first, Unsigned const len, Compare comp
-   , Unsigned &n_keys, Unsigned &l_intbuf, Unsigned &l_base, Unsigned &l_build_buf
-   , XBuf & xbuf
-   )
-{
-   typedef typename iter_size<RandIt>::type         size_type;
-
-   //Calculate ideal parameters and try to collect needed unique keys
-   l_base = 0u;
-
-   //Try to find a value near sqrt(len) that is 2^N*l_base where
-   //l_base <= AdaptiveSortInsertionSortThreshold. This property is important
-   //as build_blocks merges to the left iteratively duplicating the
-   //merged size and all the buffer must be used just before the final
-   //merge to right step. This guarantees "build_blocks" produces 
-   //segments of size l_build_buf*2, maximizing the classic merge phase.
-   l_intbuf = size_type(ceil_sqrt_multiple(len, &l_base));
-
-   //The internal buffer can be expanded if there is enough external memory
-   while(xbuf.capacity() >= l_intbuf*2){
-      l_intbuf = size_type(2u*l_intbuf);
-   }
-
-   //This is the minimum number of keys to implement the ideal algorithm
-   //
-   //l_intbuf is used as buffer plus the key count
-   size_type n_min_ideal_keys = size_type(l_intbuf-1u);
-   while(n_min_ideal_keys >= (len-l_intbuf-n_min_ideal_keys)/l_intbuf){
-      --n_min_ideal_keys;
-   }
-   ++n_min_ideal_keys;
-   assert(n_min_ideal_keys <= l_intbuf);
-
-   if(xbuf.template supports_aligned_trailing<size_type>
-         (l_intbuf, size_type((size_type(len-l_intbuf)-1u)/l_intbuf+1u))){
-      n_keys = 0u;
-      l_build_buf = l_intbuf;
-   }
-   else{
-      //Try to achieve a l_build_buf of length l_intbuf*2, so that we can merge with that
-      //l_intbuf*2 buffer in "build_blocks" and use half of them as buffer and the other half
-      //as keys in combine_all_blocks. In that case n_keys >= n_min_ideal_keys but by a small margin.
-      //
-      //If available memory is 2*sqrt(l), then only sqrt(l) unique keys are needed,
-      //(to be used for keys in combine_all_blocks) as the whole l_build_buf
-      //will be backuped in the buffer during build_blocks.
-      bool const non_unique_buf = xbuf.capacity() >= l_intbuf;
-      size_type const to_collect = non_unique_buf ? n_min_ideal_keys : size_type(l_intbuf*2u);
-      size_type collected = collect_unique(first, first+len, to_collect, comp, xbuf);
-
-      //If available memory is 2*sqrt(l), then for "build_params" 
-      //the situation is the same as if 2*l_intbuf were collected.
-      if(non_unique_buf && collected == n_min_ideal_keys){
-         l_build_buf = l_intbuf;
-         n_keys = n_min_ideal_keys;
-      }
-      else if(collected == 2*l_intbuf){
-         //l_intbuf*2 elements found. Use all of them in the build phase 
-         l_build_buf = size_type(l_intbuf*2);
-         n_keys = l_intbuf;
-      }
-      else if(collected >= (n_min_ideal_keys+l_intbuf)){ 
-         l_build_buf = l_intbuf;
-         n_keys = size_type(collected - l_intbuf);
-      }
-      //If collected keys are not enough, try to fix n_keys and l_intbuf. If no fix
-      //is possible (due to very low unique keys), then go to a slow sort based on rotations.
-      else{
-         assert(collected < (n_min_ideal_keys+l_intbuf));
-         if(collected < 4){  //No combination possible with less that 4 keys
-            return false;
-         }
-         n_keys = l_intbuf;
-         while(n_keys & (n_keys-1u)){
-            n_keys &= size_type(n_keys-1u);  // make it power or 2
-         }
-         while(n_keys > collected){
-            n_keys/=2;
-         }
-         //AdaptiveSortInsertionSortThreshold is always power of two so the minimum is power of two
-         l_base = min_value<Unsigned>(n_keys, AdaptiveSortInsertionSortThreshold);
-         l_intbuf = 0;
-         l_build_buf = n_keys;
-      }
-      assert((n_keys+l_intbuf) >= l_build_buf);
-   }
-
-   return true;
-}
-
-// Main explanation of the sort algorithm.
-//
-// csqrtlen = ceil(sqrt(len));
-//
-// * First, 2*csqrtlen unique elements elements are extracted from elements to be
-//   sorted and placed in the beginning of the range.
-//
-// * Step "build_blocks": In this nearly-classic merge step, 2*csqrtlen unique elements
-//   will be used as auxiliary memory, so trailing len-2*csqrtlen elements are
-//   are grouped in blocks of sorted 4*csqrtlen elements. At the end of the step
-//   2*csqrtlen unique elements are again the leading elements of the whole range.
-//
-// * Step "combine_blocks": pairs of previously formed blocks are merged with a different
-//   ("smart") algorithm to form blocks of 8*csqrtlen elements. This step is slower than the
-//   "build_blocks" step and repeated iteratively (forming blocks of 16*csqrtlen, 32*csqrtlen
-//   elements, etc) of until all trailing (len-2*csqrtlen) elements are merged.
-//
-//   In "combine_blocks" len/csqrtlen elements used are as "keys" (markers) to
-//   know if elements belong to the first or second block to be merged and another 
-//   leading csqrtlen elements are used as buffer. Explanation of the "combine_blocks" step:
-//
-//   Iteratively until all trailing (len-2*csqrtlen) elements are merged:
-//      Iteratively for each pair of previously merged block:
-//         * Blocks are divided groups of csqrtlen elements and
-//           2*merged_block/csqrtlen keys are sorted to be used as markers
-//         * Groups are selection-sorted by first or last element (depending whether they are going
-//           to be merged to left or right) and keys are reordered accordingly as an imitation-buffer.
-//         * Elements of each block pair are merged using the csqrtlen buffer taking into account
-//           if they belong to the first half or second half (marked by the key).
-//
-// * In the final merge step leading elements (2*csqrtlen) are sorted and merged with
-//   rotations with the rest of sorted elements in the "combine_blocks" step.
-//
-// Corner cases:
-//
-// * If no 2*csqrtlen elements can be extracted:
-//
-//    * If csqrtlen+len/csqrtlen are extracted, then only csqrtlen elements are used
-//      as buffer in the "build_blocks" step forming blocks of 2*csqrtlen elements. This
-//      means that an additional "combine_blocks" step will be needed to merge all elements.
-//    
-//    * If no csqrtlen+len/csqrtlen elements can be extracted, but still more than a minimum,
-//      then reduces the number of elements used as buffer and keys in the "build_blocks"
-//      and "combine_blocks" steps. If "combine_blocks" has no enough keys due to this reduction
-//      then uses a rotation based smart merge.
-//
-//    * If the minimum number of keys can't be extracted, a rotation-based sorting is performed.
-//
-// * If auxiliary memory is more or equal than ceil(len/2), half-copying mergesort is used.
-//
-// * If auxiliary memory is more than csqrtlen+n_keys*sizeof(std::size_t),
-//   then only csqrtlen elements need to be extracted and "combine_blocks" will use integral
-//   keys to combine blocks.
-//
-// * If auxiliary memory is available, the "build_blocks" will be extended to build bigger blocks
-//   using classic merge and "combine_blocks" will use bigger blocks when merging.
-template<class RandIt, class Compare, class XBuf>
-void adaptive_sort_impl
-   ( RandIt first
-   , typename iter_size<RandIt>::type const len
-   , Compare comp
-   , XBuf & xbuf
-   )
-{
-   typedef typename iter_size<RandIt>::type         size_type;
-
-   //Small sorts go directly to insertion sort
-   if(len <= size_type(AdaptiveSortInsertionSortThreshold)){
-      insertion_sort(first, first + len, comp);
-   }
-   else if((len-len/2) <= xbuf.capacity()){
-      merge_sort(first, first+len, comp, xbuf.data());
-   }
-   else{
-      //Make sure it is at least four
-      BOOST_MOVE_STATIC_ASSERT(AdaptiveSortInsertionSortThreshold >= 4);
-
-      size_type l_base = 0;
-      size_type l_intbuf = 0;
-      size_type n_keys = 0;
-      size_type l_build_buf = 0;
-
-      //Calculate and extract needed unique elements. If a minimum is not achieved
-      //fallback to a slow stable sort
-      if(!adaptive_sort_build_params(first, len, comp, n_keys, l_intbuf, l_base, l_build_buf, xbuf)){
-         stable_sort(first, first+len, comp, xbuf);
-      }
-      else{
-         assert(l_build_buf);
-         //Otherwise, continue the adaptive_sort
-         BOOST_MOVE_ADAPTIVE_SORT_PRINT_L1("\n   After collect_unique: ", len);
-         size_type const n_key_plus_buf = size_type(l_intbuf+n_keys);
-         //l_build_buf is always power of two if l_intbuf is zero
-         assert(l_intbuf || (0 == (l_build_buf & (l_build_buf-1))));
-
-         //Classic merge sort until internal buffer and xbuf are exhausted
-         size_type const l_merged = adaptive_sort_build_blocks
-            ( first + n_key_plus_buf-l_build_buf
-            , size_type(len-n_key_plus_buf+l_build_buf)
-            , l_base, l_build_buf, xbuf, comp);
-         BOOST_MOVE_ADAPTIVE_SORT_PRINT_L1("   After build_blocks:   ", len);
-
-         //Non-trivial merge
-         bool const buffer_right = adaptive_sort_combine_all_blocks
-            (first, n_keys, first+n_keys, size_type(len-n_keys), l_merged, l_intbuf, xbuf, comp);
-
-         //Sort keys and buffer and merge the whole sequence
-         adaptive_sort_final_merge(buffer_right, first, l_intbuf, n_keys, len, xbuf, comp);
-      }
-   }
-}
-
-}  //namespace detail_adaptive {
-
-///@endcond
-
-//! <b>Effects</b>: Sorts the elements in the range [first, last) in ascending order according
-//!   to comparison functor "comp". The sort is stable (order of equal elements
-//!   is guaranteed to be preserved). Performance is improved if additional raw storage is
-//!   provided.
-//!
-//! <b>Requires</b>:
-//!   - RandIt must meet the requirements of ValueSwappable and RandomAccessIterator.
-//!   - The type of dereferenced RandIt must meet the requirements of MoveAssignable and MoveConstructible.
-//!
-//! <b>Parameters</b>:
-//!   - first, last: the range of elements to sort
-//!   - comp: comparison function object which returns true if the first argument is is ordered before the second.
-//!   - uninitialized, uninitialized_len: raw storage starting on "uninitialized", able to hold "uninitialized_len"
-//!      elements of type iterator_traits<RandIt>::value_type. Maximum performance is achieved when uninitialized_len
-//!      is ceil(std::distance(first, last)/2).
-//!
-//! <b>Throws</b>: If comp throws or the move constructor, move assignment or swap of the type
-//!   of dereferenced RandIt throws.
-//!
-//! <b>Complexity</b>: Always K x O(Nxlog(N)) comparisons and move assignments/constructors/swaps.
-//!   Comparisons are close to minimum even with no additional memory. Constant factor for data movement is minimized
-//!   when uninitialized_len is ceil(std::distance(first, last)/2). Pretty good enough performance is achieved when
-//!   ceil(sqrt(std::distance(first, last)))*2.
-//!
-//! <b>Caution</b>: Experimental implementation, not production-ready.
-template<class RandIt, class RandRawIt, class Compare>
-void adaptive_sort( RandIt first, RandIt last, Compare comp
-               , RandRawIt uninitialized
-               , typename iter_size<RandIt>::type uninitialized_len)
-{
-   typedef typename iter_size<RandIt>::type  size_type;
-   typedef typename iterator_traits<RandIt>::value_type value_type;
-
-   ::boost::movelib::adaptive_xbuf<value_type, RandRawIt, size_type> xbuf(uninitialized, uninitialized_len);
-   ::boost::movelib::detail_adaptive::adaptive_sort_impl(first, size_type(last - first), comp, xbuf);
-}
-
-template<class RandIt, class Compare>
-void adaptive_sort( RandIt first, RandIt last, Compare comp)
-{
-   typedef typename iterator_traits<RandIt>::value_type value_type;
-   adaptive_sort(first, last, comp, (value_type*)0, 0u);
-}
-
-}  //namespace movelib {
-}  //namespace boost {
-
-#include <boost/move/detail/config_end.hpp>
-
-#if defined(BOOST_CLANG) || (defined(BOOST_GCC) && (BOOST_GCC >= 40600))
-#pragma GCC diagnostic pop
-#endif
-
-#endif   //#define BOOST_MOVE_ADAPTIVE_SORT_HPP
diff --git a/src/boost/move/algo/detail/adaptive_sort_merge.hpp b/src/boost/move/algo/detail/adaptive_sort_merge.hpp
deleted file mode 100644
index 79c46996..00000000
--- a/src/boost/move/algo/detail/adaptive_sort_merge.hpp
+++ /dev/null
@@ -1,1537 +0,0 @@
-//////////////////////////////////////////////////////////////////////////////
-//
-// (C) Copyright Ion Gaztanaga 2015-2016.
-// Distributed under the Boost 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/move for documentation.
-//
-//////////////////////////////////////////////////////////////////////////////
-//
-// Stable sorting that works in O(N*log(N)) worst time
-// and uses O(1) extra memory
-//
-//////////////////////////////////////////////////////////////////////////////
-//
-// The main idea of the adaptive_sort algorithm was developed by Andrey Astrelin
-// and explained in the article from the russian collaborative blog
-// Habrahabr (http://habrahabr.ru/post/205290/). The algorithm is based on
-// ideas from B-C. Huang and M. A. Langston explained in their article
-// "Fast Stable Merging and Sorting in Constant Extra Space (1989-1992)"
-// (http://comjnl.oxfordjournals.org/content/35/6/643.full.pdf).
-//
-// This implementation by Ion Gaztanaga uses previous ideas with additional changes:
-// 
-// - Use of GCD-based rotation.
-// - Non power of two buffer-sizes.
-// - Tries to find sqrt(len)*2 unique keys, so that the merge sort
-//   phase can form up to sqrt(len)*4 segments if enough keys are found.
-// - The merge-sort phase can take advantage of external memory to
-//   save some additional combination steps.
-// - Combination phase: Blocks are selection sorted and merged in parallel.
-// - The combination phase is performed alternating merge to left and merge
-//   to right phases minimizing swaps due to internal buffer repositioning.
-// - When merging blocks special optimizations are made to avoid moving some
-//   elements twice.
-//
-// The adaptive_merge algorithm was developed by Ion Gaztanaga reusing some parts
-// from the sorting algorithm and implementing an additional block merge algorithm
-// without moving elements to left or right.
-//////////////////////////////////////////////////////////////////////////////
-#ifndef BOOST_MOVE_ADAPTIVE_SORT_MERGE_HPP
-#define BOOST_MOVE_ADAPTIVE_SORT_MERGE_HPP
-
-#include <boost/move/detail/config_begin.hpp>
-
-#include <boost/move/detail/reverse_iterator.hpp>
-#include <boost/move/algo/move.hpp>
-#include <boost/move/algo/detail/merge.hpp>
-#include <boost/move/adl_move_swap.hpp>
-#include <boost/move/algo/detail/insertion_sort.hpp>
-#include <boost/move/algo/detail/merge_sort.hpp>
-#include <boost/move/algo/detail/heap_sort.hpp>
-#include <boost/move/algo/detail/merge.hpp>
-#include <boost/move/algo/detail/is_sorted.hpp>
-#include <cassert>
-#include <boost/cstdint.hpp>
-#include <limits.h>
-
-#if defined(BOOST_CLANG) || (defined(BOOST_GCC) && (BOOST_GCC >= 40600))
-#pragma GCC diagnostic push
-#pragma GCC diagnostic ignored "-Wsign-conversion"
-#endif
-
-#ifndef BOOST_MOVE_ADAPTIVE_SORT_STATS_LEVEL
-   #define BOOST_MOVE_ADAPTIVE_SORT_STATS_LEVEL 1
-#endif
-
-#ifdef BOOST_MOVE_ADAPTIVE_SORT_STATS
-   #if BOOST_MOVE_ADAPTIVE_SORT_STATS_LEVEL == 2
-      #define BOOST_MOVE_ADAPTIVE_SORT_PRINT_L1(STR, L) \
-         print_stats(STR, L)\
-      //
-
-      #define BOOST_MOVE_ADAPTIVE_SORT_PRINT_L2(STR, L) \
-         print_stats(STR, L)\
-      //
-   #else
-      #define BOOST_MOVE_ADAPTIVE_SORT_PRINT_L1(STR, L) \
-         print_stats(STR, L)\
-      //
-
-      #define BOOST_MOVE_ADAPTIVE_SORT_PRINT_L2(STR, L)
-   #endif
-#else
-   #define BOOST_MOVE_ADAPTIVE_SORT_PRINT_L1(STR, L)
-   #define BOOST_MOVE_ADAPTIVE_SORT_PRINT_L2(STR, L)
-#endif
-
-#ifdef BOOST_MOVE_ADAPTIVE_SORT_INVARIANTS
-   #define BOOST_MOVE_ADAPTIVE_SORT_INVARIANT  assert
-#else
-   #define BOOST_MOVE_ADAPTIVE_SORT_INVARIANT(L)
-#endif
-
-namespace boost {
-namespace movelib {
-
-#if defined(BOOST_MOVE_ADAPTIVE_SORT_INVARIANTS)
-
-bool is_sorted(::order_perf_type *first, ::order_perf_type *last, ::order_type_less)
-{
-   if (first != last) {
-      const order_perf_type *next = first, *cur(first);
-      while (++next != last) {
-         if (!(cur->key < next->key || (cur->key == next->key && cur->val < next->val)))
-            return false;
-         cur = next;
-      }
-   }
-   return true;
-}
-
-#endif   //BOOST_MOVE_ADAPTIVE_SORT_INVARIANTS
-
-namespace detail_adaptive {
-
-static const std::size_t AdaptiveSortInsertionSortThreshold = 16;
-//static const std::size_t AdaptiveSortInsertionSortThreshold = 4;
-BOOST_MOVE_STATIC_ASSERT((AdaptiveSortInsertionSortThreshold&(AdaptiveSortInsertionSortThreshold-1)) == 0);
-
-#if defined BOOST_HAS_INTPTR_T
-   typedef ::boost::uintptr_t uintptr_t;
-#else
-   typedef std::size_t uintptr_t;
-#endif
-
-template<class T>
-const T &min_value(const T &a, const T &b)
-{
-   return a < b ? a : b;
-}
-
-template<class T>
-const T &max_value(const T &a, const T &b)
-{
-   return a > b ? a : b;
-}
-
-template<class ForwardIt, class Pred, class V>
-typename iter_size<ForwardIt>::type
-   count_if_with(ForwardIt first, ForwardIt last, Pred pred, const V &v)
-{
-   typedef typename iter_size<ForwardIt>::type size_type;
-   size_type count = 0;
-   while(first != last) {
-      count = size_type(count + static_cast<size_type>(0 != pred(*first, v)));
-      ++first;
-   }
-   return count;
-}
-
-
-template<class RandIt, class Compare>
-RandIt skip_until_merge
-   ( RandIt first1, RandIt const last1
-   , const typename iterator_traits<RandIt>::value_type &next_key, Compare comp)
-{
-   while(first1 != last1 && !comp(next_key, *first1)){
-      ++first1;
-   }
-   return first1;
-}
-
-
-template<class RandItKeys, class RandIt>
-void swap_and_update_key
-   ( RandItKeys const key_next
-   , RandItKeys const key_range2
-   , RandItKeys &key_mid
-   , RandIt const begin
-   , RandIt const end
-   , RandIt const with)
-{
-   if(begin != with){
-      ::boost::adl_move_swap_ranges(begin, end, with);
-      if(key_next != key_range2)  //Avoid potential self-swapping
-         ::boost::adl_move_swap(*key_next, *key_range2);
-      if(key_next == key_mid){
-         key_mid = key_range2;
-      }
-      else if(key_mid == key_range2){
-         key_mid = key_next;
-      }
-   }
-}
-
-template<class RandItKeys>
-void update_key
-(RandItKeys const key_next
-   , RandItKeys const key_range2
-   , RandItKeys &key_mid)
-{
-   if (key_next != key_range2) {
-      ::boost::adl_move_swap(*key_next, *key_range2);
-      if (key_next == key_mid) {
-         key_mid = key_range2;
-      }
-      else if (key_mid == key_range2) {
-         key_mid = key_next;
-      }
-   }
-}
-
-template<class RandItKeys, class RandIt, class RandIt2, class Op>
-RandIt2 buffer_and_update_key
-(RandItKeys const key_next
-   , RandItKeys const key_range2
-   , RandItKeys &key_mid
-   , RandIt begin
-   , RandIt end
-   , RandIt with
-   , RandIt2 buffer
-   , Op op)
-{
-   if (begin != with) {
-      while(begin != end) {
-         op(three_way_t(), begin++, with++, buffer++);
-      }
-      if (key_next != key_range2)   //Avoid potential self-swapping
-         ::boost::adl_move_swap(*key_next, *key_range2);
-      if (key_next == key_mid) {
-         key_mid = key_range2;
-      }
-      else if (key_mid == key_range2) {
-         key_mid = key_next;
-      }
-   }
-   return buffer;
-}
-
-///////////////////////////////////////////////////////////////////////////////
-//
-//                         MERGE BUFFERLESS
-//
-///////////////////////////////////////////////////////////////////////////////
-
-// [first1, last1) merge [last1,last2) -> [first1,last2)
-template<class RandIt, class Compare>
-RandIt partial_merge_bufferless_impl
-   (RandIt first1, RandIt last1, RandIt const last2, bool *const pis_range1_A, Compare comp)
-{
-   if(last1 == last2){
-      return first1;
-   }
-   bool const is_range1_A = *pis_range1_A;
-   if(first1 != last1 && comp(*last1, last1[-1])){
-      do{
-         RandIt const old_last1 = last1;
-         last1  = boost::movelib::lower_bound(last1, last2, *first1, comp);
-         first1 = rotate_gcd(first1, old_last1, last1);//old_last1 == last1 supported
-         if(last1 == last2){
-            return first1;
-         }
-         do{
-            ++first1;
-         } while(last1 != first1 && !comp(*last1, *first1) );
-      } while(first1 != last1);
-   }
-   *pis_range1_A = !is_range1_A;
-   return last1;
-}
-
-// [first1, last1) merge [last1,last2) -> [first1,last2)
-template<class RandIt, class Compare>
-RandIt partial_merge_bufferless
-   (RandIt first1, RandIt last1, RandIt const last2, bool *const pis_range1_A, Compare comp)
-{
-   return *pis_range1_A ? partial_merge_bufferless_impl(first1, last1, last2, pis_range1_A, comp)
-                        : partial_merge_bufferless_impl(first1, last1, last2, pis_range1_A, antistable<Compare>(comp));
-}
-
-template<class SizeType>
-static SizeType needed_keys_count(SizeType n_block_a, SizeType n_block_b)
-{
-   return SizeType(n_block_a + n_block_b);
-}
-
-template<class RandItKeys, class KeyCompare, class RandIt, class Compare>
-typename iter_size<RandIt>::type
-   find_next_block
-      ( RandItKeys const key_first
-      , KeyCompare key_comp
-      , RandIt const first
-      , typename iter_size<RandIt>::type const l_block
-      , typename iter_size<RandIt>::type const ix_first_block
-      , typename iter_size<RandIt>::type const ix_last_block
-      , Compare comp)
-{
-   typedef typename iter_size<RandIt>::type      size_type;
-   typedef typename iterator_traits<RandIt>::value_type     value_type;
-   typedef typename iterator_traits<RandItKeys>::value_type key_type;
-   assert(ix_first_block <= ix_last_block);
-   size_type ix_min_block = 0u;
-   for (size_type szt_i = ix_first_block; szt_i < ix_last_block; ++szt_i) {
-      const value_type &min_val = first[size_type(ix_min_block*l_block)];
-      const value_type &cur_val = first[size_type(szt_i*l_block)];
-      const key_type   &min_key = key_first[ix_min_block];
-      const key_type   &cur_key = key_first[szt_i];
-
-      bool const less_than_minimum = comp(cur_val, min_val) ||
-         (!comp(min_val, cur_val) && key_comp(cur_key, min_key));
-
-      if (less_than_minimum) {
-         ix_min_block = szt_i;
-      }
-   }
-   return ix_min_block;
-}
-
-template<class RandItKeys, class KeyCompare, class RandIt, class Compare>
-void merge_blocks_bufferless
-   ( RandItKeys const key_first
-   , KeyCompare key_comp
-   , RandIt const first
-   , typename iter_size<RandIt>::type const l_block
-   , typename iter_size<RandIt>::type const l_irreg1
-   , typename iter_size<RandIt>::type const n_block_a
-   , typename iter_size<RandIt>::type const n_block_b
-   , typename iter_size<RandIt>::type const l_irreg2
-   , Compare comp)
-{
-   typedef typename iter_size<RandIt>::type size_type;
-   size_type const key_count = needed_keys_count(n_block_a, n_block_b);
-   ::boost::movelib::ignore(key_count);
-   //assert(n_block_a || n_block_b);
-   BOOST_MOVE_ADAPTIVE_SORT_INVARIANT(boost::movelib::is_sorted_and_unique(key_first, key_first + key_count, key_comp));
-   BOOST_MOVE_ADAPTIVE_SORT_INVARIANT(!n_block_b || n_block_a == count_if_with(key_first, key_first + key_count, key_comp, key_first[n_block_a]));
-
-   size_type n_bef_irreg2 = 0;
-   bool l_irreg_pos_count = true;
-   RandItKeys key_mid(key_first + n_block_a);
-   RandIt const first_irr2 = first + size_type(l_irreg1 + (n_block_a+n_block_b)*l_block);
-   RandIt const last_irr2  = first_irr2 + l_irreg2;
-
-   {  //Selection sort blocks
-      size_type n_block_left = size_type(n_block_b + n_block_a);
-      RandItKeys key_range2(key_first);
-
-      size_type min_check = n_block_a == n_block_left ? 0u : n_block_a;
-      size_type max_check = min_value<size_type>(size_type(min_check+1), n_block_left);
-      for ( RandIt f = first+l_irreg1; n_block_left; --n_block_left) {
-         size_type const next_key_idx = find_next_block(key_range2, key_comp, f, l_block, min_check, max_check, comp);
-         RandItKeys const key_next(key_range2 + next_key_idx);
-         max_check = min_value<size_type>(max_value<size_type>(max_check, size_type(next_key_idx+2)), n_block_left);
-
-         RandIt const first_min = f + size_type(next_key_idx*l_block);
-
-         //Check if irregular b block should go here.
-         //If so, break to the special code handling the irregular block
-         if (l_irreg_pos_count && l_irreg2 && comp(*first_irr2, *first_min)){
-            l_irreg_pos_count = false;
-         }
-         n_bef_irreg2 = size_type(n_bef_irreg2+l_irreg_pos_count);
-
-         swap_and_update_key(key_next, key_range2, key_mid, f, f + l_block, first_min);
-         BOOST_MOVE_ADAPTIVE_SORT_INVARIANT(boost::movelib::is_sorted(f, f+l_block, comp));
-         BOOST_MOVE_ADAPTIVE_SORT_INVARIANT(boost::movelib::is_sorted(first_min, first_min + l_block, comp));
-         BOOST_MOVE_ADAPTIVE_SORT_INVARIANT((f == (first+l_irreg1)) || !comp(*f, *(f-l_block)));
-         //Update context
-         ++key_range2;
-         f += l_block;
-         min_check = size_type(min_check - (min_check != 0));
-         max_check = size_type(max_check - (max_check != 0));
-      }
-   }
-   BOOST_MOVE_ADAPTIVE_SORT_INVARIANT(boost::movelib::is_sorted(first+l_irreg1+n_bef_irreg2*l_block, first_irr2, comp));
-
-   RandIt first1 = first;
-   RandIt last1  = first+l_irreg1;
-   RandItKeys const key_end (key_first+n_bef_irreg2);
-   bool is_range1_A = true;
-
-   for(RandItKeys key_next = key_first; key_next != key_end; ++key_next){
-      bool is_range2_A = key_mid == (key_first+key_count) || key_comp(*key_next, *key_mid);
-      first1 = is_range1_A == is_range2_A
-         ? last1 : partial_merge_bufferless(first1, last1, last1 + l_block, &is_range1_A, comp);
-      last1 += l_block;
-      BOOST_MOVE_ADAPTIVE_SORT_INVARIANT(boost::movelib::is_sorted(first, first1, comp));
-   }
-
-   merge_bufferless(is_range1_A ? first1 : last1, first_irr2, last_irr2, comp);
-   BOOST_MOVE_ADAPTIVE_SORT_INVARIANT(boost::movelib::is_sorted(first, last_irr2, comp));
-}
-
-// Complexity: 2*distance(first, last)+max_collected^2/2
-//
-// Tries to collect at most n_keys unique elements from [first, last),
-// in the begining of the range, and ordered according to comp
-// 
-// Returns the number of collected keys
-template<class RandIt, class Compare, class XBuf>
-typename iter_size<RandIt>::type
-   collect_unique
-      ( RandIt const first, RandIt const last
-      , typename iter_size<RandIt>::type const max_collected, Compare comp
-      , XBuf & xbuf)
-{
-   typedef typename iter_size<RandIt>::type       size_type;
-   size_type h = 0;
-
-   if(max_collected){
-      ++h;  // first key is always here
-      RandIt h0 = first;
-      RandIt u = first; ++u;
-      RandIt search_end = u;
-
-      if(xbuf.capacity() >= max_collected){
-         typename XBuf::iterator const ph0 = xbuf.add(first);
-         while(u != last && h < max_collected){
-            typename XBuf::iterator const r = boost::movelib::lower_bound(ph0, xbuf.end(), *u, comp);
-            //If key not found add it to [h, h+h0)
-            if(r == xbuf.end() || comp(*u, *r) ){
-               RandIt const new_h0 = boost::move(search_end, u, h0);
-               search_end = u;
-               ++search_end;
-               ++h;
-               xbuf.insert(r, u);
-               h0 = new_h0;
-            }
-            ++u;
-         }
-         boost::move_backward(first, h0, h0+h);
-         boost::move(xbuf.data(), xbuf.end(), first);
-      }
-      else{
-         while(u != last && h < max_collected){
-            RandIt const r = boost::movelib::lower_bound(h0, search_end, *u, comp);
-            //If key not found add it to [h, h+h0)
-            if(r == search_end || comp(*u, *r) ){
-               RandIt const new_h0 = rotate_gcd(h0, search_end, u);
-               search_end = u;
-               ++search_end;
-               ++h;
-               rotate_gcd(r+(new_h0-h0), u, search_end);
-               h0 = new_h0;
-            }
-            ++u;
-         }
-         rotate_gcd(first, h0, h0+h);
-      }
-   }
-   return h;
-}
-
-template<class Unsigned>
-Unsigned floor_sqrt(Unsigned n)
-{
-   Unsigned rem = 0, root = 0;
-   const unsigned bits = sizeof(Unsigned)*CHAR_BIT;
-
-   for (unsigned i = bits / 2; i > 0; i--) {
-      root = Unsigned(root << 1u);
-      rem = Unsigned(Unsigned(rem << 2u) | Unsigned(n >> (bits - 2u)));
-      n = Unsigned(n << 2u);
-      if (root < rem) {
-         rem  = Unsigned(rem - Unsigned(root | 1u));
-         root = Unsigned(root + 2u);
-      }
-   }
-   return Unsigned(root >> 1u);
-}
-
-template<class Unsigned>
-Unsigned ceil_sqrt(Unsigned const n)
-{
-   Unsigned r = floor_sqrt(n);
-   return Unsigned(r + Unsigned((n%r) != 0));
-}
-
-template<class Unsigned>
-Unsigned floor_merge_multiple(Unsigned const n, Unsigned &base, Unsigned &pow)
-{
-   Unsigned s = n;
-   Unsigned p = 0;
-   while(s > AdaptiveSortInsertionSortThreshold){
-      s /= 2;
-      ++p;
-   }
-   base = s;
-   pow = p;
-   return Unsigned(s << p);
-}
-
-template<class Unsigned>
-Unsigned ceil_merge_multiple(Unsigned const n, Unsigned &base, Unsigned &pow)
-{
-   Unsigned fm = floor_merge_multiple(n, base, pow);
-
-   if(fm != n){
-      if(base < AdaptiveSortInsertionSortThreshold){
-         ++base;
-      }
-      else{
-         base = AdaptiveSortInsertionSortThreshold/2 + 1;
-         ++pow;
-      }
-   }
-   return Unsigned(base << pow);
-}
-
-template<class Unsigned>
-Unsigned ceil_sqrt_multiple(Unsigned const n, Unsigned *pbase = 0)
-{
-   Unsigned const r = ceil_sqrt(n);
-   Unsigned pow = 0;
-   Unsigned base = 0;
-   Unsigned const res = ceil_merge_multiple(r, base, pow);
-   if(pbase) *pbase = base;
-   return res;
-}
-
-struct less
-{
-   template<class T>
-   bool operator()(const T &l, const T &r)
-   {  return l < r;  }
-};
-
-///////////////////////////////////////////////////////////////////////////////
-//
-//                            MERGE BLOCKS
-//
-///////////////////////////////////////////////////////////////////////////////
-
-//#define ADAPTIVE_SORT_MERGE_SLOW_STABLE_SORT_IS_NLOGN
-
-#if defined ADAPTIVE_SORT_MERGE_SLOW_STABLE_SORT_IS_NLOGN
-template<class RandIt, class Compare>
-void slow_stable_sort
-   ( RandIt const first, RandIt const last, Compare comp)
-{
-   boost::movelib::inplace_stable_sort(first, last, comp);
-}
-
-#else //ADAPTIVE_SORT_MERGE_SLOW_STABLE_SORT_IS_NLOGN
-
-template<class RandIt, class Compare>
-void slow_stable_sort
-   ( RandIt const first, RandIt const last, Compare comp)
-{
-   typedef typename iter_size<RandIt>::type       size_type;
-
-   size_type L = size_type(last - first);
-   {  //Use insertion sort to merge first elements
-      size_type m = 0;
-      while((L - m) > size_type(AdaptiveSortInsertionSortThreshold)){
-         insertion_sort(first+m, first+m+size_type(AdaptiveSortInsertionSortThreshold), comp);
-         m = size_type(m + AdaptiveSortInsertionSortThreshold);
-      }
-      insertion_sort(first+m, last, comp);
-   }
-
-   size_type h = AdaptiveSortInsertionSortThreshold;
-   for(bool do_merge = L > h; do_merge; h = size_type(h*2)){
-      do_merge = (L - h) > h;
-      size_type p0 = 0;
-      if(do_merge){
-         size_type const h_2 = size_type(2*h);
-         while((L-p0) > h_2){
-            merge_bufferless(first+p0, first+p0+h, first+p0+h_2, comp);
-            p0 = size_type(p0 + h_2);
-         }
-      }
-      if((L-p0) > h){
-         merge_bufferless(first+p0, first+p0+h, last, comp);
-      }
-   }
-}
-
-#endif   //ADAPTIVE_SORT_MERGE_SLOW_STABLE_SORT_IS_NLOGN
-
-//Returns new l_block and updates use_buf
-template<class Unsigned>
-Unsigned lblock_for_combine
-   (Unsigned const l_block, Unsigned const n_keys, Unsigned const l_data, bool &use_buf)
-{
-   assert(l_data > 1);
-
-   //We need to guarantee lblock >= l_merged/(n_keys/2) keys for the combination.
-   //We have at least 4 keys guaranteed (which are the minimum to merge 2 ranges)
-   //If l_block != 0, then n_keys is already enough to merge all blocks in all
-   //phases as we've found all needed keys for that buffer and length before.
-   //If l_block == 0 then see if half keys can be used as buffer and the rest
-   //as keys guaranteeing that n_keys >= (2*l_merged)/lblock = 
-   if(!l_block){
-      //If l_block == 0 then n_keys is power of two
-      //(guaranteed by build_params(...))
-      assert(n_keys >= 4);
-      //assert(0 == (n_keys &(n_keys-1)));
-
-      //See if half keys are at least 4 and if half keys fulfill
-      Unsigned const new_buf  = n_keys/2;
-      Unsigned const new_keys = Unsigned(n_keys-new_buf);
-      use_buf = new_keys >= 4 && new_keys >= l_data/new_buf;
-      if(use_buf){
-         return new_buf;
-      }
-      else{
-         return l_data/n_keys;
-      }
-   }
-   else{
-      use_buf = true;
-      return l_block;
-   }
-}
-
-template<class RandIt, class Compare, class XBuf>
-void stable_sort( RandIt first, RandIt last, Compare comp, XBuf & xbuf)
-{
-   typedef typename iter_size<RandIt>::type size_type;
-   size_type const len = size_type(last - first);
-   size_type const half_len = size_type(len/2u + (len&1u));
-   if(std::size_t(xbuf.capacity() - xbuf.size()) >= half_len) {
-      merge_sort(first, last, comp, xbuf.data()+xbuf.size());
-   }
-   else{
-      slow_stable_sort(first, last, comp);
-   }
-}
-
-template<class RandIt, class Comp, class XBuf>
-void unstable_sort( RandIt first, RandIt last
-                    , Comp comp
-                    , XBuf & xbuf)
-{
-   heap_sort(first, last, comp);
-   ::boost::movelib::ignore(xbuf);
-}
-
-template<class RandIt, class Compare, class XBuf>
-void stable_merge
-      ( RandIt first, RandIt const middle, RandIt last
-      , Compare comp
-      , XBuf &xbuf)
-{
-   assert(xbuf.empty());
-   typedef typename iter_size<RandIt>::type   size_type;
-   size_type const len1  = size_type(middle-first);
-   size_type const len2  = size_type(last-middle);
-   size_type const l_min = min_value<size_type>(len1, len2);
-   if(xbuf.capacity() >= l_min){
-      buffered_merge(first, middle, last, comp, xbuf);
-      xbuf.clear();
-   }
-   else{
-      //merge_bufferless(first, middle, last, comp);
-      merge_adaptive_ONlogN(first, middle, last, comp, xbuf.begin(), xbuf.capacity());
-   }
-   BOOST_MOVE_ADAPTIVE_SORT_INVARIANT(boost::movelib::is_sorted(first, last, boost::movelib::unantistable(comp)));
-}
-
-template<class RandIt, class Comp, class XBuf>
-void initialize_keys( RandIt first, RandIt last
-                    , Comp comp
-                    , XBuf & xbuf)
-{
-   unstable_sort(first, last, comp, xbuf);
-   assert(boost::movelib::is_sorted_and_unique(first, last, comp));
-}
-
-template<class RandIt, class U>
-void initialize_keys( RandIt first, RandIt last
-                    , less
-                    , U &)
-{
-   typedef typename iterator_traits<RandIt>::value_type value_type;
-   std::size_t count = std::size_t(last - first);
-   for(std::size_t i = 0; i != count; ++i){
-      *first = static_cast<value_type>(i);
-      ++first;
-   }
-}
-
-template <class Unsigned>
-Unsigned calculate_total_combined(Unsigned const len, Unsigned const l_prev_merged, Unsigned *pl_irreg_combined = 0)
-{
-   typedef Unsigned size_type;
-
-   size_type const l_combined = size_type(2*l_prev_merged);
-   size_type l_irreg_combined = size_type(len%l_combined);
-   size_type l_total_combined = len;
-   if(l_irreg_combined <= l_prev_merged){
-      l_total_combined = size_type(l_total_combined - l_irreg_combined);
-      l_irreg_combined = 0;
-   }
-   if(pl_irreg_combined)
-      *pl_irreg_combined = l_irreg_combined;
-   return l_total_combined;
-}
-
-template<class RandItKeys, class KeyCompare, class SizeType, class XBuf>
-void combine_params
-   ( RandItKeys const keys
-   , KeyCompare key_comp
-   , SizeType l_combined
-   , SizeType const l_prev_merged
-   , SizeType const l_block
-   , XBuf & xbuf
-   //Output
-   , SizeType &n_block_a
-   , SizeType &n_block_b
-   , SizeType &l_irreg1
-   , SizeType &l_irreg2
-   //Options
-   , bool do_initialize_keys = true)
-{
-   typedef SizeType   size_type;
-
-   //Initial parameters for selection sort blocks
-   l_irreg1 = size_type(l_prev_merged%l_block);
-   l_irreg2 = size_type((l_combined-l_irreg1)%l_block);
-   assert(((l_combined-l_irreg1-l_irreg2)%l_block) == 0);
-   size_type const n_reg_block = size_type((l_combined-l_irreg1-l_irreg2)/l_block);
-   n_block_a = l_prev_merged/l_block;
-   n_block_b = size_type(n_reg_block - n_block_a);
-   assert(n_reg_block>=n_block_a);
-
-   //Key initialization
-   if (do_initialize_keys) {
-      initialize_keys(keys, keys + needed_keys_count(n_block_a, n_block_b), key_comp, xbuf);
-   }
-}
-
-
-
-//////////////////////////////////
-//
-//          partial_merge
-//
-//////////////////////////////////
-template<class InputIt1, class InputIt2, class OutputIt, class Compare, class Op>
-OutputIt op_partial_merge_impl
-   (InputIt1 &r_first1, InputIt1 const last1, InputIt2 &r_first2, InputIt2 const last2, OutputIt d_first, Compare comp, Op op)
-{
-   InputIt1 first1(r_first1);
-   InputIt2 first2(r_first2);
-   if(first2 != last2 && last1 != first1)
-   while(1){
-      if(comp(*first2, *first1)) {
-         op(first2++, d_first++);
-         if(first2 == last2){
-            break;
-         }
-      }
-      else{
-         op(first1++, d_first++);
-         if(first1 == last1){
-            break;
-         }
-      }
-   }
-   r_first1 = first1;
-   r_first2 = first2;
-   return d_first;
-}
-
-template<class InputIt1, class InputIt2, class OutputIt, class Compare, class Op>
-OutputIt op_partial_merge
-   (InputIt1 &r_first1, InputIt1 const last1, InputIt2 &r_first2, InputIt2 const last2, OutputIt d_first, Compare comp, Op op, bool is_stable)
-{
-   return is_stable ? op_partial_merge_impl(r_first1, last1, r_first2, last2, d_first, comp, op)
-                    : op_partial_merge_impl(r_first1, last1, r_first2, last2, d_first, antistable<Compare>(comp), op);
-}
-
-//////////////////////////////////
-//////////////////////////////////
-//////////////////////////////////
-//
-//    op_partial_merge_and_save
-//
-//////////////////////////////////
-//////////////////////////////////
-//////////////////////////////////
-template<class InputIt1, class InputIt2, class OutputIt, class Compare, class Op>
-OutputIt op_partial_merge_and_swap_impl
-   (InputIt1 &r_first1, InputIt1 const last1, InputIt2 &r_first2, InputIt2 const last2, InputIt2 &r_first_min, OutputIt d_first, Compare comp, Op op)
-{
-   InputIt1 first1(r_first1);
-   InputIt2 first2(r_first2);
-   
-   if(first2 != last2 && last1 != first1) {
-      InputIt2 first_min(r_first_min);
-      bool non_empty_ranges = true;
-      do{
-         if(comp(*first_min, *first1)) {
-            op(three_way_t(), first2++, first_min++, d_first++);
-            non_empty_ranges = first2 != last2;
-         }
-         else{
-            op(first1++, d_first++);
-            non_empty_ranges = first1 != last1;
-         }
-      } while(non_empty_ranges);
-      r_first_min = first_min;
-      r_first1 = first1;
-      r_first2 = first2;
-   }
-   return d_first;
-}
-
-template<class RandIt, class InputIt2, class OutputIt, class Compare, class Op>
-OutputIt op_partial_merge_and_swap
-   (RandIt &r_first1, RandIt const last1, InputIt2 &r_first2, InputIt2 const last2, InputIt2 &r_first_min, OutputIt d_first, Compare comp, Op op, bool is_stable)
-{
-   return is_stable ? op_partial_merge_and_swap_impl(r_first1, last1, r_first2, last2, r_first_min, d_first, comp, op)
-                    : op_partial_merge_and_swap_impl(r_first1, last1, r_first2, last2, r_first_min, d_first, antistable<Compare>(comp), op);
-}
-
-template<class RandIt1, class RandIt2, class RandItB, class Compare, class Op>
-RandItB op_buffered_partial_merge_and_swap_to_range1_and_buffer
-   ( RandIt1 first1, RandIt1 const last1
-   , RandIt2 &rfirst2, RandIt2 const last2, RandIt2 &rfirst_min
-   , RandItB &rfirstb, Compare comp, Op op )
-{
-   RandItB firstb = rfirstb;
-   RandItB lastb  = firstb;
-   RandIt2 first2 = rfirst2;
-
-   //Move to buffer while merging
-   //Three way moves need less moves when op is swap_op so use it
-   //when merging elements from range2 to the destination occupied by range1
-   if(first1 != last1 && first2 != last2){
-      RandIt2 first_min = rfirst_min;
-      op(four_way_t(), first2++, first_min++, first1++, lastb++);
-
-      while(first1 != last1){
-         if(first2 == last2){
-            lastb = op(forward_t(), first1, last1, firstb);
-            break;
-         }
-
-         if(comp(*first_min, *firstb)){
-            op( four_way_t(), first2++, first_min++, first1++, lastb++);
-         }
-         else{
-            op(three_way_t(), firstb++, first1++, lastb++);
-         }
-      }
-      rfirst2 = first2;
-      rfirstb = firstb;
-      rfirst_min = first_min;
-   }
-
-   return lastb;
-}
-
-template<class RandIt1, class RandIt2, class RandItB, class Compare, class Op>
-RandItB op_buffered_partial_merge_to_range1_and_buffer
-   ( RandIt1 first1, RandIt1 const last1
-   , RandIt2 &rfirst2, RandIt2 const last2
-   , RandItB &rfirstb, Compare comp, Op op )
-{
-   RandItB firstb = rfirstb;
-   RandItB lastb  = firstb;
-   RandIt2 first2 = rfirst2;
-
-   //Move to buffer while merging
-   //Three way moves need less moves when op is swap_op so use it
-   //when merging elements from range2 to the destination occupied by range1
-   if(first1 != last1 && first2 != last2){
-      op(three_way_t(), first2++, first1++, lastb++);
-
-      while(true){
-         if(first1 == last1){
-            break;
-         }
-         if(first2 == last2){
-            lastb = op(forward_t(), first1, last1, firstb);
-            break;
-         }
-         if (comp(*first2, *firstb)) {
-            op(three_way_t(), first2++, first1++, lastb++);
-         }
-         else {
-            op(three_way_t(), firstb++, first1++, lastb++);
-         }
-      }
-      rfirst2 = first2;
-      rfirstb = firstb;
-   }
-
-   return lastb;
-}
-
-template<class RandIt, class RandItBuf, class Compare, class Op>
-RandIt op_partial_merge_and_save_impl
-   ( RandIt first1, RandIt const last1, RandIt &rfirst2, RandIt last2, RandIt first_min
-   , RandItBuf &buf_first1_in_out, RandItBuf &buf_last1_in_out
-   , Compare comp, Op op
-   )
-{
-   RandItBuf buf_first1 = buf_first1_in_out;
-   RandItBuf buf_last1  = buf_last1_in_out;
-   RandIt first2(rfirst2);
-
-   bool const do_swap = first2 != first_min;
-   if(buf_first1 == buf_last1){
-      //Skip any element that does not need to be moved
-      RandIt new_first1 = skip_until_merge(first1, last1, *first_min, comp);
-      buf_first1 += (new_first1-first1);
-      first1 = new_first1;
-      buf_last1  = do_swap ? op_buffered_partial_merge_and_swap_to_range1_and_buffer(first1, last1, first2, last2, first_min, buf_first1, comp, op)
-                           : op_buffered_partial_merge_to_range1_and_buffer    (first1, last1, first2, last2, buf_first1, comp, op);
-      first1 = last1;
-   }
-   else{
-      assert((last1-first1) == (buf_last1 - buf_first1));
-   }
-
-   //Now merge from buffer
-   first1 = do_swap ? op_partial_merge_and_swap_impl(buf_first1, buf_last1, first2, last2, first_min, first1, comp, op)
-                    : op_partial_merge_impl    (buf_first1, buf_last1, first2, last2, first1, comp, op);
-   buf_first1_in_out = buf_first1;
-   buf_last1_in_out  = buf_last1;
-   rfirst2 = first2;
-   return first1;
-}
-
-template<class RandIt, class RandItBuf, class Compare, class Op>
-RandIt op_partial_merge_and_save
-   ( RandIt first1, RandIt const last1, RandIt &rfirst2, RandIt last2, RandIt first_min
-   , RandItBuf &buf_first1_in_out
-   , RandItBuf &buf_last1_in_out
-   , Compare comp
-   , Op op
-   , bool is_stable)
-{
-   return is_stable
-      ? op_partial_merge_and_save_impl
-         (first1, last1, rfirst2, last2, first_min, buf_first1_in_out, buf_last1_in_out, comp, op)
-      : op_partial_merge_and_save_impl
-         (first1, last1, rfirst2, last2, first_min, buf_first1_in_out, buf_last1_in_out, antistable<Compare>(comp), op)
-      ;
-}
-
-//////////////////////////////////
-//////////////////////////////////
-//////////////////////////////////
-//
-//    op_merge_blocks_with_irreg
-//
-//////////////////////////////////
-//////////////////////////////////
-//////////////////////////////////
-
-template<class RandItKeys, class KeyCompare, class RandIt, class RandIt2, class OutputIt, class Compare, class Op>
-OutputIt op_merge_blocks_with_irreg
-   ( RandItKeys key_first
-   , RandItKeys key_mid
-   , KeyCompare key_comp
-   , RandIt first_reg
-   , RandIt2 &first_irr
-   , RandIt2 const last_irr
-   , OutputIt dest
-   , typename iter_size<RandIt>::type const l_block
-   , typename iter_size<RandIt>::type n_block_left
-   , typename iter_size<RandIt>::type min_check
-   , typename iter_size<RandIt>::type max_check
-   , Compare comp, bool const is_stable, Op op)
-{
-   typedef typename iter_size<RandIt>::type size_type;
-
-   for(; n_block_left; --n_block_left){
-      size_type next_key_idx = find_next_block(key_first, key_comp, first_reg, l_block, min_check, max_check, comp);  
-      max_check = min_value(max_value(max_check, size_type(next_key_idx+2u)), n_block_left);
-      RandIt const last_reg  = first_reg + l_block;
-      RandIt first_min = first_reg + size_type(next_key_idx*l_block);
-      RandIt const last_min  = first_min + l_block;
-      boost::movelib::ignore(last_min);
-
-      BOOST_MOVE_ADAPTIVE_SORT_INVARIANT(boost::movelib::is_sorted(first_reg, last_reg, comp));
-      BOOST_MOVE_ADAPTIVE_SORT_INVARIANT(!next_key_idx || boost::movelib::is_sorted(first_min, last_min, comp));
-      BOOST_MOVE_ADAPTIVE_SORT_INVARIANT((!next_key_idx || !comp(*first_reg, *first_min )));
-
-      OutputIt orig_dest = dest;
-      boost::movelib::ignore(orig_dest);
-      dest = next_key_idx ? op_partial_merge_and_swap(first_irr, last_irr, first_reg, last_reg, first_min, dest, comp, op, is_stable)
-                          : op_partial_merge         (first_irr, last_irr, first_reg, last_reg, dest, comp, op, is_stable);
-      BOOST_MOVE_ADAPTIVE_SORT_INVARIANT(boost::movelib::is_sorted(orig_dest, dest, comp));
-
-      if(first_reg == dest){
-         dest = next_key_idx ? ::boost::adl_move_swap_ranges(first_min, last_min, first_reg)
-                             : last_reg;
-      }
-      else{
-         dest = next_key_idx ? op(three_way_forward_t(), first_reg, last_reg, first_min, dest)
-                             : op(forward_t(), first_reg, last_reg, dest);
-      }
-
-      RandItKeys const key_next(key_first + next_key_idx);
-      swap_and_update_key(key_next, key_first, key_mid, last_reg, last_reg, first_min);
-
-      BOOST_MOVE_ADAPTIVE_SORT_INVARIANT(boost::movelib::is_sorted(orig_dest, dest, comp));
-      first_reg = last_reg;
-      ++key_first;
-      min_check = size_type(min_check - (min_check != 0));
-      max_check = size_type(max_check - (max_check != 0));
-   }
-   return dest;
-}
-
-//////////////////////////////////
-//////////////////////////////////
-//////////////////////////////////
-//
-//    op_merge_blocks_left/right
-//
-//////////////////////////////////
-//////////////////////////////////
-//////////////////////////////////
-
-template<class RandItKeys, class KeyCompare, class RandIt, class Compare, class Op>
-void op_merge_blocks_left
-   ( RandItKeys const key_first
-   , KeyCompare key_comp
-   , RandIt const first
-   , typename iter_size<RandIt>::type const l_block
-   , typename iter_size<RandIt>::type const l_irreg1
-   , typename iter_size<RandIt>::type const n_block_a
-   , typename iter_size<RandIt>::type const n_block_b
-   , typename iter_size<RandIt>::type const l_irreg2
-   , Compare comp, Op op)
-{
-   typedef typename iter_size<RandIt>::type       size_type;
-
-   size_type const key_count = needed_keys_count(n_block_a, n_block_b);
-   boost::movelib::ignore(key_count);
-
-//   assert(n_block_a || n_block_b);
-   BOOST_MOVE_ADAPTIVE_SORT_INVARIANT(boost::movelib::is_sorted_and_unique(key_first, key_first + key_count, key_comp));
-   BOOST_MOVE_ADAPTIVE_SORT_INVARIANT(!n_block_b || n_block_a == count_if_with(key_first, key_first + key_count, key_comp, key_first[n_block_a]));
-
-   size_type n_block_b_left = n_block_b;
-   size_type n_block_a_left = n_block_a;
-   size_type n_block_left = size_type(n_block_b + n_block_a);
-   RandItKeys key_mid(key_first + n_block_a);
-
-   RandIt buffer = first - l_block;
-   RandIt first1 = first;
-   RandIt last1  = first1 + l_irreg1;
-   RandIt first2 = last1;
-   RandIt const irreg2 = first2 + size_type(n_block_left*l_block);
-   bool is_range1_A = true;
-
-   RandItKeys key_range2(key_first);
-
-   ////////////////////////////////////////////////////////////////////////////
-   //Process all regular blocks before the irregular B block
-   ////////////////////////////////////////////////////////////////////////////
-   size_type min_check = n_block_a == n_block_left ? 0u : n_block_a;
-   size_type max_check = min_value<size_type>(size_type(min_check+1u), n_block_left);
-   for (; n_block_left; --n_block_left) {
-      size_type const next_key_idx = find_next_block(key_range2, key_comp, first2, l_block, min_check, max_check, comp);
-      max_check = min_value<size_type>(max_value<size_type>(max_check, size_type(next_key_idx+2u)), n_block_left);
-      RandIt const first_min = first2 + size_type(next_key_idx*l_block);
-      RandIt const last_min  = first_min + l_block;
-
-      boost::movelib::ignore(last_min);
-      RandIt const last2  = first2 + l_block;
-
-      BOOST_MOVE_ADAPTIVE_SORT_INVARIANT(boost::movelib::is_sorted(first1, last1, comp));
-      BOOST_MOVE_ADAPTIVE_SORT_INVARIANT(boost::movelib::is_sorted(first2, last2, comp));
-      BOOST_MOVE_ADAPTIVE_SORT_INVARIANT(!n_block_left || boost::movelib::is_sorted(first_min, last_min, comp));
-
-      //Check if irregular b block should go here.
-      //If so, break to the special code handling the irregular block
-      if (!n_block_b_left &&
-            ( (l_irreg2 && comp(*irreg2, *first_min)) || (!l_irreg2 && is_range1_A)) ){
-         break;
-      }
-
-      RandItKeys const key_next(key_range2 + next_key_idx);
-      bool const is_range2_A = key_mid == (key_first+key_count) || key_comp(*key_next, *key_mid);
-
-      bool const is_buffer_middle = last1 == buffer;
-      BOOST_MOVE_ADAPTIVE_SORT_INVARIANT( ( is_buffer_middle && size_type(first2-buffer) == l_block && buffer == last1) ||
-                                          (!is_buffer_middle && size_type(first1-buffer) == l_block && first2 == last1));
-
-      if(is_range1_A == is_range2_A){
-         assert((first1 == last1) || !comp(*first_min, last1[typename iterator_traits<RandIt>::difference_type(-1)]));
-         if(!is_buffer_middle){
-            buffer = op(forward_t(), first1, last1, buffer);
-         }
-         swap_and_update_key(key_next, key_range2, key_mid, first2, last2, first_min);
-         first1 = first2;
-         last1  = last2;
-      }
-      else {
-         RandIt unmerged;
-         RandIt buf_beg;
-         RandIt buf_end;
-         if(is_buffer_middle){
-            buf_end = buf_beg = first2 - (last1-first1);
-            unmerged = op_partial_merge_and_save( first1, last1, first2, last2, first_min
-                                                , buf_beg, buf_end, comp, op, is_range1_A);
-         }  
-         else{
-            buf_beg = first1;
-            buf_end = last1;
-            unmerged = op_partial_merge_and_save
-               (buffer, buffer+(last1-first1), first2, last2, first_min, buf_beg, buf_end, comp, op, is_range1_A);
-         }
-
-         boost::movelib::ignore(unmerged);
-         BOOST_MOVE_ADAPTIVE_SORT_INVARIANT(boost::movelib::is_sorted(first-l_block, unmerged, comp));
-
-         swap_and_update_key( key_next, key_range2, key_mid, first2, last2
-                            , last_min - size_type(last2 - first2));
-
-         if(buf_beg != buf_end){  //range2 exhausted: is_buffer_middle for the next iteration
-            first1 = buf_beg;
-            last1  = buf_end;
-            BOOST_MOVE_ADAPTIVE_SORT_INVARIANT(buf_end == (last2-l_block));
-            buffer = last1;
-         }
-         else{ //range1 exhausted: !is_buffer_middle for the next iteration
-            first1 = first2;
-            last1  = last2;
-            buffer = first2 - l_block;
-            is_range1_A = is_range2_A;
-         }
-      }
-      BOOST_MOVE_ADAPTIVE_SORT_INVARIANT( (is_range2_A && n_block_a_left) || (!is_range2_A && n_block_b_left));
-      is_range2_A ? --n_block_a_left : --n_block_b_left;
-      first2 = last2;
-      //Update context
-      ++key_range2;
-      min_check = size_type(min_check - (min_check != 0));
-      max_check = size_type(max_check - (max_check != 0));
-   }
-
-   BOOST_MOVE_ADAPTIVE_SORT_INVARIANT(!n_block_b || n_block_a == count_if_with(key_first, key_range2 + n_block_left, key_comp, *key_mid));
-   assert(!n_block_b_left);
-
-   ////////////////////////////////////////////////////////////////////////////
-   //Process remaining range 1 left before the irregular B block
-   ////////////////////////////////////////////////////////////////////////////
-   bool const is_buffer_middle = last1 == buffer;
-   RandIt first_irr2 = irreg2;
-   RandIt const last_irr2  = first_irr2 + l_irreg2;
-   if(l_irreg2 && is_range1_A){
-      if(is_buffer_middle){
-         first1 = skip_until_merge(first1, last1, *first_irr2, comp);
-         //Even if we copy backward, no overlapping occurs so use forward copy
-         //that can be faster specially with trivial types
-         RandIt const new_first1 = first2 - (last1 - first1);
-         op(forward_t(), first1, last1, new_first1);
-         first1 = new_first1;
-         last1 = first2;
-         buffer = first1 - l_block;
-      }
-      buffer = op_partial_merge_impl(first1, last1, first_irr2, last_irr2, buffer, comp, op);
-      buffer = op(forward_t(), first1, last1, buffer);
-   }
-   else if(!is_buffer_middle){
-      buffer = op(forward_t(), first1, last1, buffer);
-   }
-   BOOST_MOVE_ADAPTIVE_SORT_INVARIANT(boost::movelib::is_sorted(first-l_block, buffer, comp));
-
-   ////////////////////////////////////////////////////////////////////////////
-   //Process irregular B block and remaining A blocks
-   ////////////////////////////////////////////////////////////////////////////
-   buffer = op_merge_blocks_with_irreg
-      ( key_range2, key_mid, key_comp, first2, first_irr2, last_irr2
-      , buffer, l_block, n_block_left, min_check, max_check, comp, false, op);
-   buffer = op(forward_t(), first_irr2, last_irr2, buffer);
-   boost::movelib::ignore(buffer);
-   BOOST_MOVE_ADAPTIVE_SORT_INVARIANT(boost::movelib::is_sorted(first-l_block, buffer, comp));
-}
-
-// first - first element to merge.
-// first[-l_block, 0) - buffer (if use_buf == true)
-// l_block - length of regular blocks. First nblocks are stable sorted by 1st elements and key-coded
-// keys - sequence of keys, in same order as blocks. key<midkey means stream A
-// n_bef_irreg2/n_aft_irreg2 are regular blocks
-// l_irreg2 is a irregular block, that is to be combined after n_bef_irreg2 blocks and before n_aft_irreg2 blocks
-// If l_irreg2==0 then n_aft_irreg2==0 (no irregular blocks).
-template<class RandItKeys, class KeyCompare, class RandIt, class Compare>
-void merge_blocks_left
-   ( RandItKeys const key_first
-   , KeyCompare key_comp
-   , RandIt const first
-   , typename iter_size<RandIt>::type const l_block
-   , typename iter_size<RandIt>::type const l_irreg1
-   , typename iter_size<RandIt>::type const n_block_a
-   , typename iter_size<RandIt>::type const n_block_b
-   , typename iter_size<RandIt>::type const l_irreg2
-   , Compare comp
-   , bool const xbuf_used)
-{
-   BOOST_MOVE_ADAPTIVE_SORT_INVARIANT(!n_block_b || n_block_a == count_if_with(key_first, key_first + needed_keys_count(n_block_a, n_block_b), key_comp, key_first[n_block_a]));
-   if(xbuf_used){
-      op_merge_blocks_left
-         (key_first, key_comp, first, l_block, l_irreg1, n_block_a, n_block_b, l_irreg2, comp, move_op());
-   }
-   else{
-      op_merge_blocks_left
-         (key_first, key_comp, first, l_block, l_irreg1, n_block_a, n_block_b, l_irreg2, comp, swap_op());
-   }
-}
-
-// first - first element to merge.
-// [first+l_block*(n_bef_irreg2+n_aft_irreg2)+l_irreg2, first+l_block*(n_bef_irreg2+n_aft_irreg2+1)+l_irreg2) - buffer
-// l_block - length of regular blocks. First nblocks are stable sorted by 1st elements and key-coded
-// keys - sequence of keys, in same order as blocks. key<midkey means stream A
-// n_bef_irreg2/n_aft_irreg2 are regular blocks
-// l_irreg2 is a irregular block, that is to be combined after n_bef_irreg2 blocks and before n_aft_irreg2 blocks
-// If l_irreg2==0 then n_aft_irreg2==0 (no irregular blocks).
-template<class RandItKeys, class KeyCompare, class RandIt, class Compare>
-void merge_blocks_right
-   ( RandItKeys const key_first
-   , KeyCompare key_comp
-   , RandIt const first
-   , typename iter_size<RandIt>::type const l_block
-   , typename iter_size<RandIt>::type const n_block_a
-   , typename iter_size<RandIt>::type const n_block_b
-   , typename iter_size<RandIt>::type const l_irreg2
-   , Compare comp
-   , bool const xbuf_used)
-{
-   typedef typename iter_size<RandIt>::type size_type;
-   merge_blocks_left
-      ( (make_reverse_iterator)(key_first + needed_keys_count(n_block_a, n_block_b))
-      , inverse<KeyCompare>(key_comp)
-      , (make_reverse_iterator)(first + size_type((n_block_a+n_block_b)*l_block+l_irreg2))
-      , l_block
-      , l_irreg2
-      , n_block_b
-      , n_block_a
-      , 0
-      , inverse<Compare>(comp), xbuf_used);
-}
-
-//////////////////////////////////
-//////////////////////////////////
-//////////////////////////////////
-//
-//    op_merge_blocks_with_buf
-//
-//////////////////////////////////
-//////////////////////////////////
-//////////////////////////////////
-template<class RandItKeys, class KeyCompare, class RandIt, class Compare, class Op, class RandItBuf>
-void op_merge_blocks_with_buf
-   ( RandItKeys key_first
-   , KeyCompare key_comp
-   , RandIt const first
-   , typename iter_size<RandIt>::type const l_block
-   , typename iter_size<RandIt>::type const l_irreg1
-   , typename iter_size<RandIt>::type const n_block_a
-   , typename iter_size<RandIt>::type const n_block_b
-   , typename iter_size<RandIt>::type const l_irreg2
-   , Compare comp
-   , Op op
-   , RandItBuf const buf_first)
-{
-   typedef typename iter_size<RandIt>::type size_type;
-   size_type const key_count = needed_keys_count(n_block_a, n_block_b);
-   boost::movelib::ignore(key_count);
-   //assert(n_block_a || n_block_b);
-   BOOST_MOVE_ADAPTIVE_SORT_INVARIANT(boost::movelib::is_sorted_and_unique(key_first, key_first + key_count, key_comp));
-   BOOST_MOVE_ADAPTIVE_SORT_INVARIANT(!n_block_b || n_block_a == count_if_with(key_first, key_first + key_count, key_comp, key_first[n_block_a]));
-
-   size_type n_block_b_left = n_block_b;
-   size_type n_block_a_left = n_block_a;
-   size_type n_block_left = size_type(n_block_b + n_block_a);
-   RandItKeys key_mid(key_first + n_block_a);
-
-   RandItBuf buffer = buf_first;
-   RandItBuf buffer_end = buffer;
-   RandIt first1 = first;
-   RandIt last1  = first1 + l_irreg1;
-   RandIt first2 = last1;
-   RandIt const first_irr2 = first2 + size_type(n_block_left*l_block);
-   bool is_range1_A = true;
-   const size_type len = size_type(l_block * n_block_a + l_block * n_block_b + l_irreg1 + l_irreg2);
-   boost::movelib::ignore(len);
-
-   RandItKeys key_range2(key_first);
-
-   ////////////////////////////////////////////////////////////////////////////
-   //Process all regular blocks before the irregular B block
-   ////////////////////////////////////////////////////////////////////////////
-   size_type min_check = n_block_a == n_block_left ? 0u : n_block_a;
-   size_type max_check = min_value(size_type(min_check+1), n_block_left);
-   for (; n_block_left; --n_block_left) {
-      size_type const next_key_idx = find_next_block(key_range2, key_comp, first2, l_block, min_check, max_check, comp);
-      max_check = min_value(max_value(max_check, size_type(next_key_idx+2)), n_block_left);
-      RandIt       first_min = first2 + size_type(next_key_idx*l_block);
-      RandIt const last_min  = first_min + l_block;
-      boost::movelib::ignore(last_min);
-      RandIt const last2  = first2 + l_block;
-
-      bool const buffer_empty = buffer == buffer_end;
-      boost::movelib::ignore(buffer_empty);
-      BOOST_MOVE_ADAPTIVE_SORT_INVARIANT(buffer_empty ? boost::movelib::is_sorted(first1, last1, comp) : boost::movelib::is_sorted(buffer, buffer_end, comp));
-      BOOST_MOVE_ADAPTIVE_SORT_INVARIANT(boost::movelib::is_sorted(first2, last2, comp));
-      BOOST_MOVE_ADAPTIVE_SORT_INVARIANT(!n_block_left || boost::movelib::is_sorted(first_min, last_min, comp));
-
-      //Check if irregular b block should go here.
-      //If so, break to the special code handling the irregular block
-      if (!n_block_b_left &&
-            ( (l_irreg2 && comp(*first_irr2, *first_min)) || (!l_irreg2 && is_range1_A)) ){
-         break;
-      }
-
-      RandItKeys const key_next(key_range2 + next_key_idx);
-      bool const is_range2_A = key_mid == (key_first+key_count) || key_comp(*key_next, *key_mid);
-
-      if(is_range1_A == is_range2_A){
-         BOOST_MOVE_ADAPTIVE_SORT_INVARIANT((first1 == last1) || (buffer_empty ? !comp(*first_min, last1[-1]) : !comp(*first_min, buffer_end[-1])));
-         //If buffered, put those elements in place
-         RandIt res = op(forward_t(), buffer, buffer_end, first1);
-         BOOST_MOVE_ADAPTIVE_SORT_PRINT_L2("   merge_blocks_w_fwd: ", len);
-         buffer    = buffer_end = buf_first;
-         assert(buffer_empty || res == last1);
-         boost::movelib::ignore(res);
-         //swap_and_update_key(key_next, key_range2, key_mid, first2, last2, first_min);
-         buffer_end = buffer_and_update_key(key_next, key_range2, key_mid, first2, last2, first_min, buffer = buf_first, op);
-         BOOST_MOVE_ADAPTIVE_SORT_PRINT_L2("   merge_blocks_w_swp: ", len);
-         BOOST_MOVE_ADAPTIVE_SORT_INVARIANT(boost::movelib::is_sorted(first2, last2, comp));
-         BOOST_MOVE_ADAPTIVE_SORT_INVARIANT(boost::movelib::is_sorted(first_min, last_min, comp));
-         first1 = first2;
-         BOOST_MOVE_ADAPTIVE_SORT_INVARIANT(boost::movelib::is_sorted(first, first1, comp));
-      }
-      else {
-         RandIt const unmerged = op_partial_merge_and_save(first1, last1, first2, last2, first_min, buffer, buffer_end, comp, op, is_range1_A);
-         BOOST_MOVE_ADAPTIVE_SORT_PRINT_L2("   merge_blocks_w_mrs: ", len);
-         bool const is_range_1_empty = buffer == buffer_end;
-         assert(is_range_1_empty || (buffer_end-buffer) == (last1+l_block-unmerged));
-         if(is_range_1_empty){
-            buffer    = buffer_end = buf_first;
-            first_min = last_min - (last2 - first2);
-            //swap_and_update_key(key_next, key_range2, key_mid, first2, last2, first_min);
-            buffer_end = buffer_and_update_key(key_next, key_range2, key_mid, first2, last2, first_min, buf_first, op);
-         }
-         else{
-            first_min = last_min;
-            //swap_and_update_key(key_next, key_range2, key_mid, first2, last2, first_min);
-            update_key(key_next, key_range2, key_mid);
-         }
-         BOOST_MOVE_ADAPTIVE_SORT_INVARIANT(!is_range_1_empty || (last_min-first_min) == (last2-unmerged));
-         BOOST_MOVE_ADAPTIVE_SORT_PRINT_L2("   merge_blocks_w_swp: ", len);
-         BOOST_MOVE_ADAPTIVE_SORT_INVARIANT(boost::movelib::is_sorted(first_min, last_min, comp));
-         is_range1_A ^= is_range_1_empty;
-         first1 = unmerged;
-         BOOST_MOVE_ADAPTIVE_SORT_INVARIANT(boost::movelib::is_sorted(first, unmerged, comp));
-      }
-      assert( (is_range2_A && n_block_a_left) || (!is_range2_A && n_block_b_left));
-      is_range2_A ? --n_block_a_left : --n_block_b_left;
-      last1 += l_block;
-      first2 = last2;
-      //Update context
-      ++key_range2;
-      min_check = size_type(min_check - (min_check != 0));
-      max_check = size_type(max_check - (max_check != 0));
-   }
-   RandIt res = op(forward_t(), buffer, buffer_end, first1);
-   boost::movelib::ignore(res);
-   BOOST_MOVE_ADAPTIVE_SORT_INVARIANT(boost::movelib::is_sorted(first, res, comp));
-   BOOST_MOVE_ADAPTIVE_SORT_PRINT_L2("   merge_blocks_w_fwd: ", len);
-
-   ////////////////////////////////////////////////////////////////////////////
-   //Process irregular B block and remaining A blocks
-   ////////////////////////////////////////////////////////////////////////////
-   RandIt const last_irr2 = first_irr2 + l_irreg2;
-   op(forward_t(), first_irr2, first_irr2+l_irreg2, buf_first);
-   BOOST_MOVE_ADAPTIVE_SORT_PRINT_L2("   merge_blocks_w_fwir:", len);
-   buffer = buf_first;
-   buffer_end = buffer+l_irreg2;
-
-   reverse_iterator<RandItBuf> rbuf_beg(buffer_end);
-   RandIt dest = op_merge_blocks_with_irreg
-      ((make_reverse_iterator)(key_first + n_block_b + n_block_a), (make_reverse_iterator)(key_mid), inverse<KeyCompare>(key_comp)
-      , (make_reverse_iterator)(first_irr2), rbuf_beg, (make_reverse_iterator)(buffer), (make_reverse_iterator)(last_irr2)
-      , l_block, n_block_left, 0, n_block_left
-      , inverse<Compare>(comp), true, op).base();
-   BOOST_MOVE_ADAPTIVE_SORT_INVARIANT(boost::movelib::is_sorted(dest, last_irr2, comp));
-   BOOST_MOVE_ADAPTIVE_SORT_PRINT_L2("   merge_blocks_w_irg: ", len);
-
-   buffer_end = rbuf_beg.base();
-   assert((dest-last1) == (buffer_end-buffer));
-   op_merge_with_left_placed(is_range1_A ? first1 : last1, last1, dest, buffer, buffer_end, comp, op);
-   BOOST_MOVE_ADAPTIVE_SORT_PRINT_L2("   merge_with_left_plc:", len);
-   BOOST_MOVE_ADAPTIVE_SORT_INVARIANT(boost::movelib::is_sorted(first, last_irr2, comp));
-}
-
-//////////////////////////////////
-//////////////////////////////////
-//////////////////////////////////
-//
-//  op_insertion_sort_step_left/right
-//
-//////////////////////////////////
-//////////////////////////////////
-//////////////////////////////////
-
-template<class RandIt, class Compare, class Op>
-typename iter_size<RandIt>::type
-   op_insertion_sort_step_left
-      ( RandIt const first
-      , typename iter_size<RandIt>::type const length
-      , typename iter_size<RandIt>::type const step
-      , Compare comp, Op op)
-{
-   typedef typename iter_size<RandIt>::type       size_type;
-
-   size_type const s = min_value<size_type>(step, AdaptiveSortInsertionSortThreshold);
-   size_type m = 0;
-
-   while(size_type(length - m) > s){
-      insertion_sort_op(first+m, first+m+s, first+m-s, comp, op);
-      m = size_type(m + s);
-   }
-   insertion_sort_op(first+m, first+length, first+m-s, comp, op);
-   return s;
-}
-
-template<class RandIt, class Compare, class Op>
-void op_merge_right_step_once
-      ( RandIt first_block
-      , typename iter_size<RandIt>::type const elements_in_blocks
-      , typename iter_size<RandIt>::type const l_build_buf
-      , Compare comp
-      , Op op)
-{
-   typedef typename iter_size<RandIt>::type size_type;
-   size_type restk = size_type(elements_in_blocks%(2*l_build_buf));
-   size_type p = size_type(elements_in_blocks - restk);
-   assert(0 == (p%(2*l_build_buf)));
-
-   if(restk <= l_build_buf){
-      op(backward_t(),first_block+p, first_block+p+restk, first_block+p+restk+l_build_buf);
-   }
-   else{
-      op_merge_right(first_block+p, first_block+p+l_build_buf, first_block+p+restk, first_block+p+restk+l_build_buf, comp, op);
-   }
-   while(p>0){
-      p = size_type(p - 2u*l_build_buf);
-      op_merge_right( first_block+p, first_block+size_type(p+l_build_buf)
-                    , first_block+size_type(p+2*l_build_buf)
-                    , first_block+size_type(p+3*l_build_buf), comp, op);
-   }
-}
-
-
-//////////////////////////////////
-//////////////////////////////////
-//////////////////////////////////
-//
-//    insertion_sort_step
-//
-//////////////////////////////////
-//////////////////////////////////
-//////////////////////////////////
-template<class RandIt, class Compare>
-typename iter_size<RandIt>::type
-   insertion_sort_step
-      ( RandIt const first
-      , typename iter_size<RandIt>::type const length
-      , typename iter_size<RandIt>::type const step
-      , Compare comp)
-{
-   typedef typename iter_size<RandIt>::type size_type;
-   size_type const s = min_value<size_type>(step, AdaptiveSortInsertionSortThreshold);
-   size_type m = 0;
-
-   while((length - m) > s){
-      insertion_sort(first+m, first+m+s, comp);
-      m = size_type(m + s);
-   }
-   insertion_sort(first+m, first+length, comp);
-   return s;
-}
-
-//////////////////////////////////
-//////////////////////////////////
-//////////////////////////////////
-//
-//    op_merge_left_step_multiple
-//
-//////////////////////////////////
-//////////////////////////////////
-//////////////////////////////////
-template<class RandIt, class Compare, class Op>
-typename iter_size<RandIt>::type  
-   op_merge_left_step_multiple
-      ( RandIt first_block
-      , typename iter_size<RandIt>::type const elements_in_blocks
-      , typename iter_size<RandIt>::type l_merged
-      , typename iter_size<RandIt>::type const l_build_buf
-      , typename iter_size<RandIt>::type l_left_space
-      , Compare comp
-      , Op op)
-{
-   typedef typename iter_size<RandIt>::type size_type;
-   for(; l_merged < l_build_buf && l_left_space >= l_merged; l_merged = size_type(l_merged*2u)){
-      size_type p0=0;
-      RandIt pos = first_block;
-      while((elements_in_blocks - p0) > 2*l_merged) {
-         op_merge_left(pos-l_merged, pos, pos+l_merged, pos+size_type(2*l_merged), comp, op);
-         BOOST_MOVE_ADAPTIVE_SORT_INVARIANT(boost::movelib::is_sorted(pos-l_merged, pos+l_merged, comp));
-         p0 = size_type(p0 + 2u*l_merged);
-         pos = first_block+p0;
-      }
-      if((elements_in_blocks-p0) > l_merged) {
-         op_merge_left(pos-l_merged, pos, pos+l_merged, first_block+elements_in_blocks, comp, op);
-         BOOST_MOVE_ADAPTIVE_SORT_INVARIANT
-            (boost::movelib::is_sorted
-               (pos-l_merged, pos+size_type((first_block+elements_in_blocks-pos))-l_merged, comp));
-      }
-      else {
-         op(forward_t(), pos, first_block+elements_in_blocks, pos-l_merged);
-         BOOST_MOVE_ADAPTIVE_SORT_INVARIANT
-            (boost::movelib::is_sorted
-               (pos-l_merged, first_block+size_type(elements_in_blocks-l_merged), comp));
-      }
-      first_block  -= l_merged;
-      l_left_space = size_type(l_left_space - l_merged);
-   }
-   return l_merged;
-}
-
-
-}  //namespace detail_adaptive {
-}  //namespace movelib {
-}  //namespace boost {
-
-#if defined(BOOST_CLANG) || (defined(BOOST_GCC) && (BOOST_GCC >= 40600))
-#pragma GCC diagnostic pop
-#endif
-
-#include <boost/move/detail/config_end.hpp>
-
-#endif   //#define BOOST_MOVE_ADAPTIVE_SORT_MERGE_HPP
diff --git a/src/boost/move/algo/detail/basic_op.hpp b/src/boost/move/algo/detail/basic_op.hpp
deleted file mode 100644
index 144280b3..00000000
--- a/src/boost/move/algo/detail/basic_op.hpp
+++ /dev/null
@@ -1,122 +0,0 @@
-//////////////////////////////////////////////////////////////////////////////
-//
-// (C) Copyright Ion Gaztanaga 2015-2016.
-// Distributed under the Boost 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/move for documentation.
-//
-//////////////////////////////////////////////////////////////////////////////
-#ifndef BOOST_MOVE_ALGO_BASIC_OP
-#define BOOST_MOVE_ALGO_BASIC_OP
-
-#ifndef BOOST_CONFIG_HPP
-#  include <boost/config.hpp>
-#endif
-#
-#if defined(BOOST_HAS_PRAGMA_ONCE)
-#  pragma once
-#endif
-
-#include <boost/move/utility_core.hpp>
-#include <boost/move/adl_move_swap.hpp>
-#include <boost/move/detail/iterator_traits.hpp>
-#include <boost/move/algo/move.hpp>
-
-namespace boost {
-namespace movelib {
-
-struct forward_t{};
-struct backward_t{};
-struct three_way_t{};
-struct three_way_forward_t{};
-struct four_way_t{};
-
-struct move_op
-{
-   template <class SourceIt, class DestinationIt>
-   BOOST_MOVE_FORCEINLINE void operator()(SourceIt source, DestinationIt dest)
-   {  *dest = ::boost::move(*source);  }
-
-   template <class SourceIt, class DestinationIt>
-   BOOST_MOVE_FORCEINLINE DestinationIt operator()(forward_t, SourceIt first, SourceIt last, DestinationIt dest_begin)
-   {  return ::boost::move(first, last, dest_begin);  }
-
-   template <class SourceIt, class DestinationIt>
-   BOOST_MOVE_FORCEINLINE DestinationIt operator()(backward_t, SourceIt first, SourceIt last, DestinationIt dest_last)
-   {  return ::boost::move_backward(first, last, dest_last);  }
-
-   template <class SourceIt, class DestinationIt1, class DestinationIt2>
-   BOOST_MOVE_FORCEINLINE void operator()(three_way_t, SourceIt srcit, DestinationIt1 dest1it, DestinationIt2 dest2it)
-   {
-      *dest2it = boost::move(*dest1it);
-      *dest1it = boost::move(*srcit);
-   }
-
-   template <class SourceIt, class DestinationIt1, class DestinationIt2>
-   DestinationIt2 operator()(three_way_forward_t, SourceIt srcit, SourceIt srcitend, DestinationIt1 dest1it, DestinationIt2 dest2it)
-   {
-      //Destination2 range can overlap SourceIt range so avoid boost::move
-      while(srcit != srcitend){
-         this->operator()(three_way_t(), srcit++, dest1it++, dest2it++);
-      }
-      return dest2it;
-   }
-
-   template <class SourceIt, class DestinationIt1, class DestinationIt2, class DestinationIt3>
-   BOOST_MOVE_FORCEINLINE void operator()(four_way_t, SourceIt srcit, DestinationIt1 dest1it, DestinationIt2 dest2it, DestinationIt3 dest3it)
-   {
-      *dest3it = boost::move(*dest2it);
-      *dest2it = boost::move(*dest1it);
-      *dest1it = boost::move(*srcit);
-   }
-};
-
-struct swap_op
-{
-   template <class SourceIt, class DestinationIt>
-   BOOST_MOVE_FORCEINLINE void operator()(SourceIt source, DestinationIt dest)
-   {  boost::adl_move_swap(*dest, *source);  }
-
-   template <class SourceIt, class DestinationIt>
-   BOOST_MOVE_FORCEINLINE DestinationIt operator()(forward_t, SourceIt first, SourceIt last, DestinationIt dest_begin)
-   {  return boost::adl_move_swap_ranges(first, last, dest_begin);  }
-
-   template <class SourceIt, class DestinationIt>
-   BOOST_MOVE_FORCEINLINE DestinationIt operator()(backward_t, SourceIt first, SourceIt last, DestinationIt dest_begin)
-   {  return boost::adl_move_swap_ranges_backward(first, last, dest_begin);  }
-
-   template <class SourceIt, class DestinationIt1, class DestinationIt2>
-   BOOST_MOVE_FORCEINLINE void operator()(three_way_t, SourceIt srcit, DestinationIt1 dest1it, DestinationIt2 dest2it)
-   {
-      typename ::boost::movelib::iterator_traits<SourceIt>::value_type tmp(boost::move(*dest2it));
-      *dest2it = boost::move(*dest1it);
-      *dest1it = boost::move(*srcit);
-      *srcit = boost::move(tmp);
-   }
-
-   template <class SourceIt, class DestinationIt1, class DestinationIt2>
-   DestinationIt2 operator()(three_way_forward_t, SourceIt srcit, SourceIt srcitend, DestinationIt1 dest1it, DestinationIt2 dest2it)
-   {
-      while(srcit != srcitend){
-         this->operator()(three_way_t(), srcit++, dest1it++, dest2it++);
-      }
-      return dest2it;
-   }
-
-   template <class SourceIt, class DestinationIt1, class DestinationIt2, class DestinationIt3>
-   BOOST_MOVE_FORCEINLINE void operator()(four_way_t, SourceIt srcit, DestinationIt1 dest1it, DestinationIt2 dest2it, DestinationIt3 dest3it)
-   {
-      typename ::boost::movelib::iterator_traits<SourceIt>::value_type tmp(boost::move(*dest3it));
-      *dest3it = boost::move(*dest2it);
-      *dest2it = boost::move(*dest1it);
-      *dest1it = boost::move(*srcit);
-      *srcit = boost::move(tmp);
-   }
-};
-
-
-}} //namespace boost::movelib
-
-#endif   //BOOST_MOVE_ALGO_BASIC_OP
diff --git a/src/boost/move/algo/detail/heap_sort.hpp b/src/boost/move/algo/detail/heap_sort.hpp
deleted file mode 100644
index 60db353e..00000000
--- a/src/boost/move/algo/detail/heap_sort.hpp
+++ /dev/null
@@ -1,122 +0,0 @@
-//////////////////////////////////////////////////////////////////////////////
-//
-// (C) Copyright Ion Gaztanaga 2017-2018.
-// Distributed under the Boost 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/move for documentation.
-//
-//////////////////////////////////////////////////////////////////////////////
-
-//! \file
-
-#ifndef BOOST_MOVE_DETAIL_HEAP_SORT_HPP
-#define BOOST_MOVE_DETAIL_HEAP_SORT_HPP
-
-#ifndef BOOST_CONFIG_HPP
-#  include <boost/config.hpp>
-#endif
-#
-#if defined(BOOST_HAS_PRAGMA_ONCE)
-#  pragma once
-#endif
-
-#include <boost/move/detail/config_begin.hpp>
-
-#include <boost/move/detail/workaround.hpp>
-#include <boost/move/detail/iterator_traits.hpp>
-#include <boost/move/algo/detail/is_sorted.hpp>
-#include <boost/move/utility_core.hpp>
-#include <cassert>
-
-#if defined(BOOST_CLANG) || (defined(BOOST_GCC) && (BOOST_GCC >= 40600))
-#pragma GCC diagnostic push
-#pragma GCC diagnostic ignored "-Wsign-conversion"
-#endif
-
-namespace boost {  namespace movelib{
-
-template <class RandomAccessIterator, class Compare>
-class heap_sort_helper
-{
-   typedef typename boost::movelib::iter_size<RandomAccessIterator>::type  size_type;
-   typedef typename boost::movelib::iterator_traits<RandomAccessIterator>::value_type value_type;
-
-   static void adjust_heap(RandomAccessIterator first, size_type hole_index, size_type const len, value_type &value, Compare comp)
-   {
-      size_type const top_index = hole_index;
-      size_type second_child = size_type(2u*(hole_index + 1u));
-
-      while (second_child < len) {
-         if (comp(*(first + second_child), *(first + size_type(second_child - 1u))))
-            second_child--;
-         *(first + hole_index) = boost::move(*(first + second_child));
-         hole_index = second_child;
-         second_child = size_type(2u * (second_child + 1u));
-      }
-      if (second_child == len) {
-         *(first + hole_index) = boost::move(*(first + size_type(second_child - 1u)));
-         hole_index = size_type(second_child - 1);
-      }
-
-      {  //push_heap-like ending
-         size_type parent = size_type((hole_index - 1u) / 2u);
-         while (hole_index > top_index && comp(*(first + parent), value)) {
-            *(first + hole_index) = boost::move(*(first + parent));
-            hole_index = parent;
-            parent = size_type((hole_index - 1u) / 2u);
-         }    
-         *(first + hole_index) = boost::move(value);
-      }
-   }
-
-   static void make_heap(RandomAccessIterator first, RandomAccessIterator last, Compare comp)
-   {
-      size_type const len = size_type(last - first);
-      if (len > 1) {
-         size_type parent = size_type(len/2u - 1u);
-
-         do {
-            value_type v(boost::move(*(first + parent)));
-            adjust_heap(first, parent, len, v, comp);
-         }while (parent--);
-      }
-   }
-
-   static void sort_heap(RandomAccessIterator first, RandomAccessIterator last, Compare comp)
-   {
-      size_type len = size_type(last - first);
-      while (len > 1) {
-         //move biggest to the safe zone
-         --last;
-         value_type v(boost::move(*last));
-         *last = boost::move(*first);
-         adjust_heap(first, size_type(0), --len, v, comp);
-      }
-   }
-
-   public:
-   static void sort(RandomAccessIterator first, RandomAccessIterator last, Compare comp)
-   {
-      make_heap(first, last, comp);
-      sort_heap(first, last, comp);
-      assert(boost::movelib::is_sorted(first, last, comp));
-   }
-};
-
-template <class RandomAccessIterator, class Compare>
-BOOST_MOVE_FORCEINLINE void heap_sort(RandomAccessIterator first, RandomAccessIterator last, Compare comp)
-{
-   heap_sort_helper<RandomAccessIterator, Compare>::sort(first, last, comp);
-}
-
-}} //namespace boost {  namespace movelib{
-
-#if defined(BOOST_CLANG) || (defined(BOOST_GCC) && (BOOST_GCC >= 40600))
-#pragma GCC diagnostic pop
-#endif
-
-#include <boost/move/detail/config_end.hpp>
-
-#endif //#ifndef BOOST_MOVE_DETAIL_HEAP_SORT_HPP
diff --git a/src/boost/move/algo/detail/insertion_sort.hpp b/src/boost/move/algo/detail/insertion_sort.hpp
deleted file mode 100644
index 77f0b698..00000000
--- a/src/boost/move/algo/detail/insertion_sort.hpp
+++ /dev/null
@@ -1,137 +0,0 @@
-//////////////////////////////////////////////////////////////////////////////
-//
-// (C) Copyright Ion Gaztanaga 2014-2014.
-// Distributed under the Boost 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/move for documentation.
-//
-//////////////////////////////////////////////////////////////////////////////
-
-//! \file
-
-#ifndef BOOST_MOVE_DETAIL_INSERT_SORT_HPP
-#define BOOST_MOVE_DETAIL_INSERT_SORT_HPP
-
-#ifndef BOOST_CONFIG_HPP
-#  include <boost/config.hpp>
-#endif
-#
-#if defined(BOOST_HAS_PRAGMA_ONCE)
-#  pragma once
-#endif
-
-#include <boost/move/utility_core.hpp>
-#include <boost/move/algo/move.hpp>
-#include <boost/move/detail/iterator_traits.hpp>
-#include <boost/move/adl_move_swap.hpp>
-#include <boost/move/utility_core.hpp>
-#include <boost/move/detail/placement_new.hpp>
-#include <boost/move/detail/destruct_n.hpp>
-#include <boost/move/algo/detail/basic_op.hpp>
-#include <boost/move/detail/placement_new.hpp>
-#include <boost/move/detail/iterator_to_raw_pointer.hpp>
-
-#if defined(BOOST_CLANG) || (defined(BOOST_GCC) && (BOOST_GCC >= 40600))
-#pragma GCC diagnostic push
-#pragma GCC diagnostic ignored "-Wsign-conversion"
-#endif
-
-namespace boost {  namespace movelib{
-
-// @cond
-
-template <class Compare, class ForwardIterator, class BirdirectionalIterator, class Op>
-void insertion_sort_op(ForwardIterator first1, ForwardIterator last1, BirdirectionalIterator first2, Compare comp, Op op)
-{
-   if (first1 != last1){
-      BirdirectionalIterator last2 = first2;
-      op(first1, last2);
-      for (++last2; ++first1 != last1; ++last2){
-         BirdirectionalIterator j2 = last2;
-         BirdirectionalIterator i2 = j2;
-         if (comp(*first1, *--i2)){
-            op(i2, j2);
-            for (--j2; i2 != first2 && comp(*first1, *--i2); --j2) {
-               op(i2, j2);
-            }
-         }
-         op(first1, j2);
-      }
-   }
-}
-
-template <class Compare, class ForwardIterator, class BirdirectionalIterator>
-void insertion_sort_swap(ForwardIterator first1, ForwardIterator last1, BirdirectionalIterator first2, Compare comp)
-{
-   insertion_sort_op(first1, last1, first2, comp, swap_op());
-}
-
-
-template <class Compare, class ForwardIterator, class BirdirectionalIterator>
-void insertion_sort_copy(ForwardIterator first1, ForwardIterator last1, BirdirectionalIterator first2, Compare comp)
-{
-   insertion_sort_op(first1, last1, first2, comp, move_op());
-}
-
-// @endcond
-
-template <class Compare, class BirdirectionalIterator>
-void insertion_sort(BirdirectionalIterator first, BirdirectionalIterator last, Compare comp)
-{
-   typedef typename boost::movelib::iterator_traits<BirdirectionalIterator>::value_type value_type;
-   if (first != last){
-      BirdirectionalIterator i = first;
-      for (++i; i != last; ++i){
-         BirdirectionalIterator j = i;
-         if (comp(*i,  *--j)) {
-            value_type tmp(::boost::move(*i));
-            *i = ::boost::move(*j);
-            for (BirdirectionalIterator k = j; k != first && comp(tmp,  *--k); --j) {
-               *j = ::boost::move(*k);
-            }
-            *j = ::boost::move(tmp);
-         }
-      }
-   }
-}
-
-template <class Compare, class BirdirectionalIterator, class BirdirectionalRawIterator>
-void insertion_sort_uninitialized_copy
-   (BirdirectionalIterator first1, BirdirectionalIterator const last1
-   , BirdirectionalRawIterator const first2
-   , Compare comp)
-{
-   typedef typename iterator_traits<BirdirectionalIterator>::value_type value_type;
-   if (first1 != last1){
-      BirdirectionalRawIterator last2 = first2;
-      ::new((iterator_to_raw_pointer)(last2), boost_move_new_t()) value_type(::boost::move(*first1));
-      destruct_n<value_type, BirdirectionalRawIterator> d(first2);
-      d.incr();
-      for (++last2; ++first1 != last1; ++last2){
-         BirdirectionalRawIterator j2 = last2;
-         BirdirectionalRawIterator k2 = j2;
-         if (comp(*first1, *--k2)){
-            ::new((iterator_to_raw_pointer)(j2), boost_move_new_t()) value_type(::boost::move(*k2));
-            d.incr();
-            for (--j2; k2 != first2 && comp(*first1, *--k2); --j2)
-               *j2 = ::boost::move(*k2);
-            *j2 = ::boost::move(*first1);
-         }
-         else{
-            ::new((iterator_to_raw_pointer)(j2), boost_move_new_t()) value_type(::boost::move(*first1));
-            d.incr();
-         }
-      }
-      d.release();
-   }
-}
-
-}} //namespace boost {  namespace movelib{
-
-#if defined(BOOST_CLANG) || (defined(BOOST_GCC) && (BOOST_GCC >= 40600))
-#pragma GCC diagnostic pop
-#endif
-
-#endif //#ifndef BOOST_MOVE_DETAIL_INSERT_SORT_HPP
diff --git a/src/boost/move/algo/detail/is_sorted.hpp b/src/boost/move/algo/detail/is_sorted.hpp
deleted file mode 100644
index d3dccfc2..00000000
--- a/src/boost/move/algo/detail/is_sorted.hpp
+++ /dev/null
@@ -1,55 +0,0 @@
-#ifndef BOOST_MOVE_DETAIL_IS_SORTED_HPP
-#define BOOST_MOVE_DETAIL_IS_SORTED_HPP
-///////////////////////////////////////////////////////////////////////////////
-//
-// (C) Copyright Ion Gaztanaga 2017-2018. Distributed under the Boost
-// 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.
-//
-///////////////////////////////////////////////////////////////////////////////
-
-#ifndef BOOST_CONFIG_HPP
-#  include <boost/config.hpp>
-#endif
-
-#if defined(BOOST_HAS_PRAGMA_ONCE)
-#  pragma once
-#endif
-
-namespace boost {
-namespace movelib {
-
-template<class ForwardIt, class Pred>
-bool is_sorted(ForwardIt const first, ForwardIt last, Pred pred)
-{
-   if (first != last) {
-      ForwardIt next = first, cur(first);
-      while (++next != last) {
-         if (pred(*next, *cur))
-            return false;
-         cur = next;
-      }
-   }
-   return true;
-}
-
-template<class ForwardIt, class Pred>
-bool is_sorted_and_unique(ForwardIt first, ForwardIt last, Pred pred)
-{
-   if (first != last) {
-      ForwardIt next = first;
-      while (++next != last) {
-         if (!pred(*first, *next))
-            return false;
-         first = next;
-      }
-   }
-   return true;
-}
-
-}  //namespace movelib {
-}  //namespace boost {
-
-#endif   //BOOST_MOVE_DETAIL_IS_SORTED_HPP
diff --git a/src/boost/move/algo/detail/merge.hpp b/src/boost/move/algo/detail/merge.hpp
deleted file mode 100644
index ad260046..00000000
--- a/src/boost/move/algo/detail/merge.hpp
+++ /dev/null
@@ -1,896 +0,0 @@
-//////////////////////////////////////////////////////////////////////////////
-//
-// (C) Copyright Ion Gaztanaga 2015-2016.
-// Distributed under the Boost 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/move for documentation.
-//
-//////////////////////////////////////////////////////////////////////////////
-#ifndef BOOST_MOVE_MERGE_HPP
-#define BOOST_MOVE_MERGE_HPP
-
-#include <boost/move/adl_move_swap.hpp>
-#include <boost/move/algo/detail/basic_op.hpp>
-#include <boost/move/detail/iterator_traits.hpp>
-#include <boost/move/detail/destruct_n.hpp>
-#include <boost/move/algo/predicate.hpp>
-#include <boost/move/algo/detail/search.hpp>
-#include <boost/move/detail/iterator_to_raw_pointer.hpp>
-#include <cassert>
-#include <cstddef>
-
-#if defined(BOOST_CLANG) || (defined(BOOST_GCC) && (BOOST_GCC >= 40600))
-#pragma GCC diagnostic push
-#pragma GCC diagnostic ignored "-Wsign-conversion"
-#endif
-
-namespace boost {
-namespace movelib {
-
-template<class T, class RandRawIt = T*, class SizeType = typename iter_size<RandRawIt>::type>
-class adaptive_xbuf
-{
-   adaptive_xbuf(const adaptive_xbuf &);
-   adaptive_xbuf & operator=(const adaptive_xbuf &);
-
-   #if !defined(UINTPTR_MAX)
-   typedef std::size_t uintptr_t;
-   #endif
-
-   public:
-   typedef RandRawIt iterator;
-   typedef SizeType  size_type;
-
-   BOOST_MOVE_FORCEINLINE adaptive_xbuf()
-      : m_ptr(), m_size(0), m_capacity(0)
-   {}
-
-   BOOST_MOVE_FORCEINLINE adaptive_xbuf(RandRawIt raw_memory, size_type cap)
-      : m_ptr(raw_memory), m_size(0), m_capacity(cap)
-   {}
-
-   template<class RandIt>
-   void move_assign(RandIt first, size_type n)
-   {
-      typedef typename iterator_traits<RandIt>::difference_type rand_diff_t;
-      if(n <= m_size){
-         boost::move(first, first+rand_diff_t(n), m_ptr);
-         size_type sz = m_size;
-         while(sz-- != n){
-            m_ptr[sz].~T();
-         }
-         m_size = n;
-      }
-      else{
-         RandRawIt result = boost::move(first, first+rand_diff_t(m_size), m_ptr);
-         boost::uninitialized_move(first+rand_diff_t(m_size), first+rand_diff_t(n), result);
-         m_size = n;
-      }
-   }
-
-   template<class RandIt>
-   void push_back(RandIt first, size_type n)
-   {
-      assert(m_capacity - m_size >= n);
-      boost::uninitialized_move(first, first+n, m_ptr+m_size);
-      m_size += n;
-   }
-
-   template<class RandIt>
-   iterator add(RandIt it)
-   {
-      assert(m_size < m_capacity);
-      RandRawIt p_ret = m_ptr + m_size;
-      ::new(&*p_ret) T(::boost::move(*it));
-      ++m_size;
-      return p_ret;
-   }
-
-   template<class RandIt>
-   void insert(iterator pos, RandIt it)
-   {
-      if(pos == (m_ptr + m_size)){
-         this->add(it);
-      }
-      else{
-         this->add(m_ptr+m_size-1);
-         //m_size updated
-         boost::move_backward(pos, m_ptr+m_size-2, m_ptr+m_size-1);
-         *pos = boost::move(*it);
-      }
-   }
-
-   BOOST_MOVE_FORCEINLINE void set_size(size_type sz)
-   {
-      m_size = sz;
-   }
-
-   void shrink_to_fit(size_type const sz)
-   {
-      if(m_size > sz){
-         for(size_type szt_i = sz; szt_i != m_size; ++szt_i){
-            m_ptr[szt_i].~T();
-         }
-         m_size = sz;
-      }
-   }
-
-   void initialize_until(size_type const sz, T &t)
-   {
-      assert(m_size < m_capacity);
-      if(m_size < sz){
-         BOOST_MOVE_TRY
-         {
-            ::new((void*)&m_ptr[m_size]) T(::boost::move(t));
-            ++m_size;
-            for(; m_size != sz; ++m_size){
-               ::new((void*)&m_ptr[m_size]) T(::boost::move(m_ptr[m_size-1]));
-            }
-            t = ::boost::move(m_ptr[m_size-1]);
-         }
-         BOOST_MOVE_CATCH(...)
-         {
-            while(m_size)
-            {
-               --m_size;
-               m_ptr[m_size].~T();
-            }
-         }
-         BOOST_MOVE_CATCH_END
-      }
-   }
-
-   private:
-   template<class RIt>
-   BOOST_MOVE_FORCEINLINE static bool is_raw_ptr(RIt)
-   {
-      return false;
-   }
-
-   BOOST_MOVE_FORCEINLINE static bool is_raw_ptr(T*)
-   {
-      return true;
-   }
-
-   public:
-   template<class U>
-   bool supports_aligned_trailing(size_type sz, size_type trail_count) const
-   {
-      if(this->is_raw_ptr(this->data()) && m_capacity){
-         uintptr_t u_addr_sz = uintptr_t(&*(this->data()+sz));
-         uintptr_t u_addr_cp = uintptr_t(&*(this->data()+this->capacity()));
-         u_addr_sz = ((u_addr_sz + sizeof(U)-1)/sizeof(U))*sizeof(U);
-         return (u_addr_cp >= u_addr_sz) && ((u_addr_cp - u_addr_sz)/sizeof(U) >= trail_count);
-      }
-      return false;
-   }
-
-   template<class U>
-   BOOST_MOVE_FORCEINLINE U *aligned_trailing() const
-   {
-      return this->aligned_trailing<U>(this->size());
-   }
-
-   template<class U>
-   BOOST_MOVE_FORCEINLINE U *aligned_trailing(size_type pos) const
-   {
-      uintptr_t u_addr = uintptr_t(&*(this->data()+pos));
-      u_addr = ((u_addr + sizeof(U)-1)/sizeof(U))*sizeof(U);
-      return (U*)u_addr;
-   }
-
-   BOOST_MOVE_FORCEINLINE ~adaptive_xbuf()
-   {
-      this->clear();
-   }
-
-   BOOST_MOVE_FORCEINLINE size_type capacity() const
-   {  return m_capacity;   }
-
-   BOOST_MOVE_FORCEINLINE iterator data() const
-   {  return m_ptr;   }
-
-   BOOST_MOVE_FORCEINLINE iterator begin() const
-   {  return m_ptr;   }
-
-   BOOST_MOVE_FORCEINLINE iterator end() const
-   {  return m_ptr+m_size;   }
-
-   BOOST_MOVE_FORCEINLINE size_type size() const
-   {  return m_size;   }
-
-   BOOST_MOVE_FORCEINLINE bool empty() const
-   {  return !m_size;   }
-
-   BOOST_MOVE_FORCEINLINE void clear()
-   {
-      this->shrink_to_fit(0u);
-   }
-
-   private:
-   RandRawIt m_ptr;
-   size_type m_size;
-   size_type m_capacity;
-};
-
-template<class Iterator, class SizeType, class Op>
-class range_xbuf
-{
-   range_xbuf(const range_xbuf &);
-   range_xbuf & operator=(const range_xbuf &);
-
-   public:
-   typedef SizeType size_type;
-   typedef Iterator iterator;
-
-   range_xbuf(Iterator first, Iterator last)
-      : m_first(first), m_last(first), m_cap(last)
-   {}
-
-   template<class RandIt>
-   void move_assign(RandIt first, size_type n)
-   {
-      assert(size_type(n) <= size_type(m_cap-m_first));
-      typedef typename iter_difference<RandIt>::type d_type;
-      m_last = Op()(forward_t(), first, first+d_type(n), m_first);
-   }
-
-   ~range_xbuf()
-   {}
-
-   size_type capacity() const
-   {  return m_cap-m_first;   }
-
-   Iterator data() const
-   {  return m_first;   }
-
-   Iterator end() const
-   {  return m_last;   }
-
-   size_type size() const
-   {  return m_last-m_first;   }
-
-   bool empty() const
-   {  return m_first == m_last;   }
-
-   void clear()
-   {
-      m_last = m_first;
-   }
-
-   template<class RandIt>
-   iterator add(RandIt it)
-   {
-      Iterator pos(m_last);
-      *pos = boost::move(*it);
-      ++m_last;
-      return pos;
-   }
-
-   void set_size(size_type sz)
-   {
-      m_last  = m_first;
-      m_last += sz;
-   }
-
-   private:
-   Iterator const m_first;
-   Iterator m_last;
-   Iterator const m_cap;
-};
-
-
-
-// @cond
-
-/*
-template<typename Unsigned>
-inline Unsigned gcd(Unsigned x, Unsigned y)
-{
-   if(0 == ((x &(x-1)) | (y & (y-1)))){
-      return x < y ? x : y;
-   }
-   else{
-      do
-      {
-         Unsigned t = x % y;
-         x = y;
-         y = t;
-      } while (y);
-      return x;
-   }
-}
-*/
-
-//Modified version from "An Optimal In-Place Array Rotation Algorithm", Ching-Kuang Shene
-template<typename Unsigned>
-Unsigned gcd(Unsigned x, Unsigned y)
-{
-   if(0 == ((x &(x-1)) | (y & (y-1)))){
-      return x < y ? x : y;
-   }
-   else{
-      Unsigned z = 1;
-      while((!(x&1)) & (!(y&1))){
-         z = Unsigned(z << 1);
-         x = Unsigned(x >> 1);
-         y = Unsigned(y >> 1);
-      }
-      while(x && y){
-         if(!(x&1))
-            x = Unsigned(x >> 1);
-         else if(!(y&1))
-            y = Unsigned (y >> 1);
-         else if(x >=y)
-            x = Unsigned((x-y) >> 1u);
-         else
-            y = Unsigned((y-x) >> 1);
-      }
-      return Unsigned(z*(x+y));
-   }
-}
-
-template<typename RandIt>
-RandIt rotate_gcd(RandIt first, RandIt middle, RandIt last)
-{
-   typedef typename iter_size<RandIt>::type size_type;
-   typedef typename iterator_traits<RandIt>::value_type value_type;
-
-   if(first == middle)
-      return last;
-   if(middle == last)
-      return first;
-   const size_type middle_pos = size_type(middle - first);
-   RandIt ret = last - middle_pos;
-   if (middle == ret){
-      boost::adl_move_swap_ranges(first, middle, middle);
-   }
-   else{
-      const size_type length = size_type(last - first);
-      for( RandIt it_i(first), it_gcd(it_i + gcd(length, middle_pos))
-         ; it_i != it_gcd
-         ; ++it_i){
-         value_type temp(boost::move(*it_i));
-         RandIt it_j = it_i;
-         RandIt it_k = it_j+middle_pos;
-         do{
-            *it_j = boost::move(*it_k);
-            it_j = it_k;
-            size_type const left = size_type(last - it_j);
-            it_k = left > middle_pos ? it_j + middle_pos : first + middle_pos - left;
-         } while(it_k != it_i);
-         *it_j = boost::move(temp);
-      }
-   }
-   return ret;
-}
-
-template<class RandIt, class Compare, class Op>
-void op_merge_left( RandIt buf_first
-                    , RandIt first1
-                    , RandIt const last1
-                    , RandIt const last2
-                    , Compare comp
-                    , Op op)
-{
-   for(RandIt first2=last1; first2 != last2; ++buf_first){
-      if(first1 == last1){
-         op(forward_t(), first2, last2, buf_first);
-         return;
-      }
-      else if(comp(*first2, *first1)){
-         op(first2, buf_first);
-         ++first2;
-      }
-      else{
-         op(first1, buf_first);
-         ++first1;
-      }
-   }
-   if(buf_first != first1){//In case all remaining elements are in the same place
-                           //(e.g. buffer is exactly the size of the second half
-                           //and all elements from the second half are less)
-      op(forward_t(), first1, last1, buf_first);
-   }
-}
-
-// [buf_first, first1) -> buffer
-// [first1, last1) merge [last1,last2) -> [buf_first,buf_first+(last2-first1))
-// Elements from buffer are moved to [last2 - (first1-buf_first), last2)
-// Note: distance(buf_first, first1) >= distance(last1, last2), so no overlapping occurs
-template<class RandIt, class Compare>
-void merge_left
-   (RandIt buf_first, RandIt first1, RandIt const last1, RandIt const last2, Compare comp)
-{
-   op_merge_left(buf_first, first1, last1, last2, comp, move_op());
-}
-
-// [buf_first, first1) -> buffer
-// [first1, last1) merge [last1,last2) -> [buf_first,buf_first+(last2-first1))
-// Elements from buffer are swapped to [last2 - (first1-buf_first), last2)
-// Note: distance(buf_first, first1) >= distance(last1, last2), so no overlapping occurs
-template<class RandIt, class Compare>
-void swap_merge_left
-   (RandIt buf_first, RandIt first1, RandIt const last1, RandIt const last2, Compare comp)
-{
-   op_merge_left(buf_first, first1, last1, last2, comp, swap_op());
-}
-
-template<class RandIt, class Compare, class Op>
-void op_merge_right
-   (RandIt const first1, RandIt last1, RandIt last2, RandIt buf_last, Compare comp, Op op)
-{
-   RandIt const first2 = last1;
-   while(first1 != last1){
-      if(last2 == first2){
-         op(backward_t(), first1, last1, buf_last);
-         return;
-      }
-      --last2;
-      --last1;
-      --buf_last;
-      if(comp(*last2, *last1)){
-         op(last1, buf_last);
-         ++last2;
-      }
-      else{
-         op(last2, buf_last);
-         ++last1;
-      }
-   }
-   if(last2 != buf_last){  //In case all remaining elements are in the same place
-                           //(e.g. buffer is exactly the size of the first half
-                           //and all elements from the second half are less)
-      op(backward_t(), first2, last2, buf_last);
-   }
-}
-
-// [last2, buf_last) - buffer
-// [first1, last1) merge [last1,last2) -> [first1+(buf_last-last2), buf_last)
-// Note: distance[last2, buf_last) >= distance[first1, last1), so no overlapping occurs
-template<class RandIt, class Compare>
-void merge_right
-   (RandIt first1, RandIt last1, RandIt last2, RandIt buf_last, Compare comp)
-{
-   op_merge_right(first1, last1, last2, buf_last, comp, move_op());
-}
-
-// [last2, buf_last) - buffer
-// [first1, last1) merge [last1,last2) -> [first1+(buf_last-last2), buf_last)
-// Note: distance[last2, buf_last) >= distance[first1, last1), so no overlapping occurs
-template<class RandIt, class Compare>
-void swap_merge_right
-   (RandIt first1, RandIt last1, RandIt last2, RandIt buf_last, Compare comp)
-{
-   op_merge_right(first1, last1, last2, buf_last, comp, swap_op());
-}
-
-///////////////////////////////////////////////////////////////////////////////
-//
-//                            BUFFERED MERGE
-//
-///////////////////////////////////////////////////////////////////////////////
-template<class RandIt, class Compare, class Op, class Buf>
-void op_buffered_merge
-      ( RandIt first, RandIt const middle, RandIt last
-      , Compare comp, Op op
-      , Buf &xbuf)
-{
-   if(first != middle && middle != last && comp(*middle, middle[-1])){
-      typedef typename iter_size<RandIt>::type   size_type;
-      size_type const len1 = size_type(middle-first);
-      size_type const len2 = size_type(last-middle);
-      if(len1 <= len2){
-         first = boost::movelib::upper_bound(first, middle, *middle, comp);
-         xbuf.move_assign(first, size_type(middle-first));
-         op_merge_with_right_placed
-            (xbuf.data(), xbuf.end(), first, middle, last, comp, op);
-      }
-      else{
-         last = boost::movelib::lower_bound(middle, last, middle[-1], comp);
-         xbuf.move_assign(middle, size_type(last-middle));
-         op_merge_with_left_placed
-            (first, middle, last, xbuf.data(), xbuf.end(), comp, op);
-      }
-   }
-}
-
-template<class RandIt, class Compare, class XBuf>
-void buffered_merge
-      ( RandIt first, RandIt const middle, RandIt last
-      , Compare comp
-      , XBuf &xbuf)
-{
-   op_buffered_merge(first, middle, last, comp, move_op(), xbuf);
-}
-
-//Complexity: min(len1,len2)^2 + max(len1,len2)
-template<class RandIt, class Compare>
-void merge_bufferless_ON2(RandIt first, RandIt middle, RandIt last, Compare comp)
-{
-   if((middle - first) < (last - middle)){
-      while(first != middle){
-         RandIt const old_last1 = middle;
-         middle = boost::movelib::lower_bound(middle, last, *first, comp);
-         first = rotate_gcd(first, old_last1, middle);
-         if(middle == last){
-            break;
-         }
-         do{
-            ++first;
-         } while(first != middle && !comp(*middle, *first));
-      }
-   }
-   else{
-      while(middle != last){
-         RandIt p = boost::movelib::upper_bound(first, middle, last[-1], comp);
-         last = rotate_gcd(p, middle, last);
-         middle = p;
-         if(middle == first){
-            break;
-         }
-         --p;
-         do{
-            --last;
-         } while(middle != last && !comp(last[-1], *p));
-      }
-   }
-}
-
-static const std::size_t MergeBufferlessONLogNRotationThreshold = 16u;
-
-template <class RandIt, class Compare>
-void merge_bufferless_ONlogN_recursive
-   ( RandIt first, RandIt middle, RandIt last
-   , typename iter_size<RandIt>::type len1
-   , typename iter_size<RandIt>::type len2
-   , Compare comp)
-{
-   typedef typename iter_size<RandIt>::type size_type;
-
-   while(1) {
-      //trivial cases
-      if (!len2) {
-         return;
-      }
-      else if (!len1) {
-         return;
-      }
-      else if (size_type(len1 | len2) == 1u) {
-         if (comp(*middle, *first))
-            adl_move_swap(*first, *middle);  
-         return;
-      }
-      else if(size_type(len1+len2) < MergeBufferlessONLogNRotationThreshold){
-         merge_bufferless_ON2(first, middle, last, comp);
-         return;
-      }
-
-      RandIt first_cut = first;
-      RandIt second_cut = middle;
-      size_type len11 = 0;
-      size_type len22 = 0;
-      if (len1 > len2) {
-         len11 = len1 / 2;
-         first_cut +=  len11;
-         second_cut = boost::movelib::lower_bound(middle, last, *first_cut, comp);
-         len22 = size_type(second_cut - middle);
-      }
-      else {
-         len22 = len2 / 2;
-         second_cut += len22;
-         first_cut = boost::movelib::upper_bound(first, middle, *second_cut, comp);
-         len11 = size_type(first_cut - first);
-      }
-      RandIt new_middle = rotate_gcd(first_cut, middle, second_cut);
-
-      //Avoid one recursive call doing a manual tail call elimination on the biggest range
-      const size_type len_internal = size_type(len11+len22);
-      if( len_internal < (len1 + len2 - len_internal) ) {
-         merge_bufferless_ONlogN_recursive(first, first_cut,  new_middle, len11, len22, comp);
-         first = new_middle;
-         middle = second_cut;
-         len1 = size_type(len1-len11);
-         len2 = size_type(len2-len22);
-      }
-      else {
-         merge_bufferless_ONlogN_recursive
-            (new_middle, second_cut, last, size_type(len1 - len11), size_type(len2 - len22), comp);
-         middle = first_cut;
-         last = new_middle;
-         len1 = len11;
-         len2 = len22;
-      }
-   }
-}
-
-
-//Complexity: NlogN
-template<class RandIt, class Compare>
-void merge_bufferless_ONlogN(RandIt first, RandIt middle, RandIt last, Compare comp)
-{
-   typedef typename iter_size<RandIt>::type size_type;
-   merge_bufferless_ONlogN_recursive
-      (first, middle, last, size_type(middle - first), size_type(last - middle), comp);
-}
-
-template<class RandIt, class Compare>
-void merge_bufferless(RandIt first, RandIt middle, RandIt last, Compare comp)
-{
-   #define BOOST_ADAPTIVE_MERGE_NLOGN_MERGE
-   #ifdef BOOST_ADAPTIVE_MERGE_NLOGN_MERGE
-   merge_bufferless_ONlogN(first, middle, last, comp);
-   #else
-   merge_bufferless_ON2(first, middle, last, comp);
-   #endif   //BOOST_ADAPTIVE_MERGE_NLOGN_MERGE
-}
-
-// [r_first, r_last) are already in the right part of the destination range.
-template <class Compare, class InputIterator, class InputOutIterator, class Op>
-void op_merge_with_right_placed
-   ( InputIterator first, InputIterator last
-   , InputOutIterator dest_first, InputOutIterator r_first, InputOutIterator r_last
-   , Compare comp, Op op)
-{
-   assert((last - first) == (r_first - dest_first));
-   while ( first != last ) {
-      if (r_first == r_last) {
-         InputOutIterator end = op(forward_t(), first, last, dest_first);
-         assert(end == r_last);
-         boost::movelib::ignore(end);
-         return;
-      }
-      else if (comp(*r_first, *first)) {
-         op(r_first, dest_first);
-         ++r_first;
-      }
-      else {
-         op(first, dest_first);
-         ++first;
-      }
-      ++dest_first;
-   }
-   // Remaining [r_first, r_last) already in the correct place
-}
-
-template <class Compare, class InputIterator, class InputOutIterator>
-void swap_merge_with_right_placed
-   ( InputIterator first, InputIterator last
-   , InputOutIterator dest_first, InputOutIterator r_first, InputOutIterator r_last
-   , Compare comp)
-{
-   op_merge_with_right_placed(first, last, dest_first, r_first, r_last, comp, swap_op());
-}
-
-// [first, last) are already in the right part of the destination range.
-template <class Compare, class Op, class BidirIterator, class BidirOutIterator>
-void op_merge_with_left_placed
-   ( BidirOutIterator const first, BidirOutIterator last, BidirOutIterator dest_last
-   , BidirIterator const r_first, BidirIterator r_last
-   , Compare comp, Op op)
-{
-   assert((dest_last - last) == (r_last - r_first));
-   while( r_first != r_last ) {
-      if(first == last) {
-         BidirOutIterator res = op(backward_t(), r_first, r_last, dest_last);
-         assert(last == res);
-         boost::movelib::ignore(res);
-         return;
-      }
-      --r_last;
-      --last;
-      if(comp(*r_last, *last)){
-         ++r_last;
-         --dest_last;
-         op(last, dest_last);
-      }
-      else{
-         ++last;
-         --dest_last;
-         op(r_last, dest_last);
-      }
-   }
-   // Remaining [first, last) already in the correct place
-}
-
-// @endcond
-
-// [first, last) are already in the right part of the destination range.
-template <class Compare, class BidirIterator, class BidirOutIterator>
-void merge_with_left_placed
-   ( BidirOutIterator const first, BidirOutIterator last, BidirOutIterator dest_last
-   , BidirIterator const r_first, BidirIterator r_last
-   , Compare comp)
-{
-   op_merge_with_left_placed(first, last, dest_last, r_first, r_last, comp, move_op());
-}
-
-// [r_first, r_last) are already in the right part of the destination range.
-template <class Compare, class InputIterator, class InputOutIterator>
-void merge_with_right_placed
-   ( InputIterator first, InputIterator last
-   , InputOutIterator dest_first, InputOutIterator r_first, InputOutIterator r_last
-   , Compare comp)
-{
-   op_merge_with_right_placed(first, last, dest_first, r_first, r_last, comp, move_op());
-}
-
-// [r_first, r_last) are already in the right part of the destination range.
-// [dest_first, r_first) is uninitialized memory
-template <class Compare, class InputIterator, class InputOutIterator>
-void uninitialized_merge_with_right_placed
-   ( InputIterator first, InputIterator last
-   , InputOutIterator dest_first, InputOutIterator r_first, InputOutIterator r_last
-   , Compare comp)
-{
-   assert((last - first) == (r_first - dest_first));
-   typedef typename iterator_traits<InputOutIterator>::value_type value_type;
-   InputOutIterator const original_r_first = r_first;
-
-   destruct_n<value_type, InputOutIterator> d(dest_first);
-
-   while ( first != last && dest_first != original_r_first ) {
-      if (r_first == r_last) {
-         for(; dest_first != original_r_first; ++dest_first, ++first){
-            ::new((iterator_to_raw_pointer)(dest_first)) value_type(::boost::move(*first));
-            d.incr();
-         }
-         d.release();
-         InputOutIterator end = ::boost::move(first, last, original_r_first);
-         assert(end == r_last);
-         boost::movelib::ignore(end);
-         return;
-      }
-      else if (comp(*r_first, *first)) {
-         ::new((iterator_to_raw_pointer)(dest_first)) value_type(::boost::move(*r_first));
-         d.incr();
-         ++r_first;
-      }
-      else {
-         ::new((iterator_to_raw_pointer)(dest_first)) value_type(::boost::move(*first));
-         d.incr();
-         ++first;
-      }
-      ++dest_first;
-   }
-   d.release();
-   merge_with_right_placed(first, last, original_r_first, r_first, r_last, comp);
-}
-
-/// This is a helper function for the merge routines.
-template<typename BidirectionalIterator1, typename BidirectionalIterator2>
-   BidirectionalIterator1
-   rotate_adaptive(BidirectionalIterator1 first,
-      BidirectionalIterator1 middle,
-      BidirectionalIterator1 last,
-      typename iter_size<BidirectionalIterator1>::type len1,
-      typename iter_size<BidirectionalIterator1>::type len2,
-      BidirectionalIterator2 buffer,
-      typename iter_size<BidirectionalIterator1>::type buffer_size)
-{
-   if (len1 > len2 && len2 <= buffer_size)
-   {
-      if(len2) //Protect against self-move ranges
-      {
-         BidirectionalIterator2 buffer_end = boost::move(middle, last, buffer);
-         boost::move_backward(first, middle, last);
-         return boost::move(buffer, buffer_end, first);
-      }
-      else
-         return first;
-   }
-   else if (len1 <= buffer_size)
-   {
-      if(len1) //Protect against self-move ranges
-      {
-         BidirectionalIterator2 buffer_end = boost::move(first, middle, buffer);
-         BidirectionalIterator1 ret = boost::move(middle, last, first);
-         boost::move(buffer, buffer_end, ret);
-         return ret;
-      }
-      else
-         return last;
-   }
-   else
-      return rotate_gcd(first, middle, last);
-}
-
-template<typename BidirectionalIterator,
-   typename Pointer, typename Compare>
-   void merge_adaptive_ONlogN_recursive
-   (BidirectionalIterator first,
-      BidirectionalIterator middle,
-      BidirectionalIterator last,
-      typename  iter_size<BidirectionalIterator>::type len1,
-      typename  iter_size<BidirectionalIterator>::type len2,
-      Pointer buffer,
-      typename  iter_size<BidirectionalIterator>::type buffer_size,
-      Compare comp)
-{
-   typedef typename  iter_size<BidirectionalIterator>::type size_type;
-   //trivial cases
-   if (!len2 || !len1) {
-      // no-op
-   }
-   else if (len1 <= buffer_size || len2 <= buffer_size) {
-      range_xbuf<Pointer, size_type, move_op> rxbuf(buffer, buffer + buffer_size);
-      buffered_merge(first, middle, last, comp, rxbuf);
-   }
-   else if (size_type(len1 + len2) == 2u) {
-      if (comp(*middle, *first))
-         adl_move_swap(*first, *middle);
-   }
-   else if (size_type(len1 + len2) < MergeBufferlessONLogNRotationThreshold) {
-      merge_bufferless_ON2(first, middle, last, comp);
-   }
-   else {
-      BidirectionalIterator first_cut = first;
-      BidirectionalIterator second_cut = middle;
-      size_type len11 = 0;
-      size_type len22 = 0;
-      if (len1 > len2)  //(len1 < len2)
-      {
-         len11 = len1 / 2;
-         first_cut += len11;
-         second_cut = boost::movelib::lower_bound(middle, last, *first_cut, comp);
-         len22 = size_type(second_cut - middle);
-      }
-      else
-      {
-         len22 = len2 / 2;
-         second_cut += len22;
-         first_cut = boost::movelib::upper_bound(first, middle, *second_cut, comp);
-         len11 = size_type(first_cut - first);
-      }
-
-      BidirectionalIterator new_middle
-         = rotate_adaptive(first_cut, middle, second_cut,
-            size_type(len1 - len11), len22, buffer,
-            buffer_size);
-      merge_adaptive_ONlogN_recursive(first, first_cut, new_middle, len11,
-         len22, buffer, buffer_size, comp);
-      merge_adaptive_ONlogN_recursive(new_middle, second_cut, last,
-         size_type(len1 - len11), size_type(len2 - len22), buffer, buffer_size, comp);
-   }
-}
-
-
-template<typename BidirectionalIterator, typename Compare, typename RandRawIt>
-void merge_adaptive_ONlogN(BidirectionalIterator first,
-		                     BidirectionalIterator middle,
-		                     BidirectionalIterator last,
-		                     Compare comp,
-                           RandRawIt uninitialized,
-                           typename  iter_size<BidirectionalIterator>::type uninitialized_len)
-{
-   typedef typename iterator_traits<BidirectionalIterator>::value_type  value_type;
-   typedef typename  iter_size<BidirectionalIterator>::type   size_type;
-
-   if (first == middle || middle == last)
-      return;
-
-   if(uninitialized_len)
-   {
-      const size_type len1 = size_type(middle - first);
-      const size_type len2 = size_type(last - middle);
-
-      ::boost::movelib::adaptive_xbuf<value_type, RandRawIt> xbuf(uninitialized, uninitialized_len);
-      xbuf.initialize_until(uninitialized_len, *first);
-	   merge_adaptive_ONlogN_recursive(first, middle, last, len1, len2, xbuf.begin(), uninitialized_len, comp);
-   }
-   else
-   {
-      merge_bufferless(first, middle, last, comp);
-   }
-}
-
-}  //namespace movelib {
-}  //namespace boost {
-
-#if defined(BOOST_CLANG) || (defined(BOOST_GCC) && (BOOST_GCC >= 40600))
-#pragma GCC diagnostic pop
-#endif
-
-#endif   //#define BOOST_MOVE_MERGE_HPP
diff --git a/src/boost/move/algo/detail/merge_sort.hpp b/src/boost/move/algo/detail/merge_sort.hpp
deleted file mode 100644
index dbc4797c..00000000
--- a/src/boost/move/algo/detail/merge_sort.hpp
+++ /dev/null
@@ -1,216 +0,0 @@
-//////////////////////////////////////////////////////////////////////////////
-//
-// (C) Copyright Ion Gaztanaga 2015-2016.
-// Distributed under the Boost 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/move for documentation.
-//
-//////////////////////////////////////////////////////////////////////////////
-
-//! \file
-
-#ifndef BOOST_MOVE_DETAIL_MERGE_SORT_HPP
-#define BOOST_MOVE_DETAIL_MERGE_SORT_HPP
-
-#ifndef BOOST_CONFIG_HPP
-#  include <boost/config.hpp>
-#endif
-#
-#if defined(BOOST_HAS_PRAGMA_ONCE)
-#  pragma once
-#endif
-
-#include <boost/move/detail/config_begin.hpp>
-#include <boost/move/detail/workaround.hpp>
-
-#include <boost/move/utility_core.hpp>
-#include <boost/move/algo/move.hpp>
-#include <boost/move/algo/detail/merge.hpp>
-#include <boost/move/detail/iterator_traits.hpp>
-#include <boost/move/adl_move_swap.hpp>
-#include <boost/move/detail/destruct_n.hpp>
-#include <boost/move/algo/detail/insertion_sort.hpp>
-#include <cassert>
-
-#if defined(BOOST_CLANG) || (defined(BOOST_GCC) && (BOOST_GCC >= 40600))
-#pragma GCC diagnostic push
-#pragma GCC diagnostic ignored "-Wsign-conversion"
-#endif
-
-namespace boost {
-namespace movelib {
-
-// @cond
-
-static const unsigned MergeSortInsertionSortThreshold = 16;
-
-template <class RandIt, class Compare>
-void inplace_stable_sort(RandIt first, RandIt last, Compare comp)
-{
-   typedef typename iter_size<RandIt>::type  size_type;
-   if (size_type(last - first) <= size_type(MergeSortInsertionSortThreshold)) {
-      insertion_sort(first, last, comp);
-      return;
-   }
-   RandIt middle = first + (last - first) / 2;
-   inplace_stable_sort(first, middle, comp);
-   inplace_stable_sort(middle, last, comp);
-   merge_bufferless_ONlogN_recursive
-      (first, middle, last, size_type(middle - first), size_type(last - middle), comp);
-}
-
-// @endcond
-
-template<class RandIt, class RandIt2, class Compare>
-void merge_sort_copy( RandIt first, RandIt last
-                   , RandIt2 dest, Compare comp)
-{
-   typedef typename iter_size<RandIt>::type         size_type;
-   
-   size_type const count = size_type(last - first);
-   if(count <= MergeSortInsertionSortThreshold){
-      insertion_sort_copy(first, last, dest, comp);
-   }
-   else{
-      size_type const half = size_type(count/2u);
-      merge_sort_copy(first + half, last        , dest+half   , comp);
-      merge_sort_copy(first       , first + half, first + half, comp);
-      merge_with_right_placed
-         ( first + half, first + half + half
-         , dest, dest+half, dest + count
-         , comp);
-   }
-}
-
-template<class RandIt, class RandItRaw, class Compare>
-void merge_sort_uninitialized_copy( RandIt first, RandIt last
-                                 , RandItRaw uninitialized
-                                 , Compare comp)
-{
-   typedef typename iter_size<RandIt>::type       size_type;
-   typedef typename iterator_traits<RandIt>::value_type value_type;
-
-   size_type const count = size_type(last - first);
-   if(count <= MergeSortInsertionSortThreshold){
-      insertion_sort_uninitialized_copy(first, last, uninitialized, comp);
-   }
-   else{
-      size_type const half = count/2;
-      merge_sort_uninitialized_copy(first + half, last, uninitialized + half, comp);
-      destruct_n<value_type, RandItRaw> d(uninitialized+half);
-      d.incr(size_type(count-half));
-      merge_sort_copy(first, first + half, first + half, comp);
-      uninitialized_merge_with_right_placed
-         ( first + half, first + half + half
-         , uninitialized, uninitialized+half, uninitialized+count
-         , comp);
-      d.release();
-   }
-}
-
-template<class RandIt, class RandItRaw, class Compare>
-void merge_sort( RandIt first, RandIt last, Compare comp
-               , RandItRaw uninitialized)
-{
-   typedef typename iter_size<RandIt>::type       size_type;
-   typedef typename iterator_traits<RandIt>::value_type      value_type;
-
-   size_type const count = size_type(last - first);
-   if(count <= MergeSortInsertionSortThreshold){
-      insertion_sort(first, last, comp);
-   }
-   else{
-      size_type const half = size_type(count/2u);
-      size_type const rest = size_type(count -  half);
-      RandIt const half_it = first + half;
-      RandIt const rest_it = first + rest;
-
-      merge_sort_uninitialized_copy(half_it, last, uninitialized, comp);
-      destruct_n<value_type, RandItRaw> d(uninitialized);
-      d.incr(rest);
-      merge_sort_copy(first, half_it, rest_it, comp);
-      merge_with_right_placed
-         ( uninitialized, uninitialized + rest
-         , first, rest_it, last, antistable<Compare>(comp));
-   }
-}
-
-///@cond
-
-template<class RandIt, class RandItRaw, class Compare>
-void merge_sort_with_constructed_buffer( RandIt first, RandIt last, Compare comp, RandItRaw buffer)
-{
-   typedef typename iter_size<RandIt>::type       size_type;
-
-   size_type const count = size_type(last - first);
-   if(count <= MergeSortInsertionSortThreshold){
-      insertion_sort(first, last, comp);
-   }
-   else{
-      size_type const half = size_type(count/2);
-      size_type const rest = size_type(count -  half);
-      RandIt const half_it = first + half;
-      RandIt const rest_it = first + rest;
-
-      merge_sort_copy(half_it, last, buffer, comp);
-      merge_sort_copy(first, half_it, rest_it, comp);
-      merge_with_right_placed
-         (buffer, buffer + rest
-         , first, rest_it, last, antistable<Compare>(comp));
-   }
-}
-
-template<typename RandIt, typename Pointer,
-         typename Distance, typename Compare>
-void stable_sort_ONlogN_recursive(RandIt first, RandIt last, Pointer buffer, Distance buffer_size, Compare comp)
-{
-   typedef typename iter_size<RandIt>::type  size_type;
-   if (size_type(last - first) <= size_type(MergeSortInsertionSortThreshold)) {
-      insertion_sort(first, last, comp);
-   }
-   else {
-      const size_type len = size_type(last - first) / 2u;
-      const RandIt middle = first + len;
-      if (len > ((buffer_size+1)/2)){
-         stable_sort_ONlogN_recursive(first, middle, buffer, buffer_size, comp);
-         stable_sort_ONlogN_recursive(middle, last, buffer, buffer_size, comp);
-      }
-      else{
-         merge_sort_with_constructed_buffer(first, middle, comp, buffer);
-         merge_sort_with_constructed_buffer(middle, last, comp, buffer);
-      }
-      merge_adaptive_ONlogN_recursive(first, middle, last,
-         size_type(middle - first),
-         size_type(last - middle),
-         buffer, buffer_size,
-         comp);
-   }
-}
-
-template<typename BidirectionalIterator, typename Compare, typename RandRawIt>
-void stable_sort_adaptive_ONlogN2(BidirectionalIterator first,
-		                           BidirectionalIterator last,
-		                           Compare comp,
-                                 RandRawIt uninitialized,
-                                 std::size_t uninitialized_len)
-{
-   typedef typename iterator_traits<BidirectionalIterator>::value_type  value_type;
-
-   ::boost::movelib::adaptive_xbuf<value_type, RandRawIt> xbuf(uninitialized, uninitialized_len);
-   xbuf.initialize_until(uninitialized_len, *first);
-   stable_sort_ONlogN_recursive(first, last, uninitialized, uninitialized_len, comp);
-}
-
-///@endcond
-
-}} //namespace boost {  namespace movelib{
-
-#if defined(BOOST_CLANG) || (defined(BOOST_GCC) && (BOOST_GCC >= 40600))
-#pragma GCC diagnostic pop
-#endif
-
-#include <boost/move/detail/config_end.hpp>
-
-#endif //#ifndef BOOST_MOVE_DETAIL_MERGE_SORT_HPP
diff --git a/src/boost/move/algo/detail/pdqsort.hpp b/src/boost/move/algo/detail/pdqsort.hpp
deleted file mode 100644
index 1e927558..00000000
--- a/src/boost/move/algo/detail/pdqsort.hpp
+++ /dev/null
@@ -1,345 +0,0 @@
-//////////////////////////////////////////////////////////////////////////////
-//
-// (C) Copyright Orson Peters  2017.
-// (C) Copyright Ion Gaztanaga 2017-2018.
-// Distributed under the Boost 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/move for documentation.
-//
-//////////////////////////////////////////////////////////////////////////////
-//
-// This implementation of Pattern-defeating quicksort (pdqsort) was written
-// by Orson Peters, and discussed in the Boost mailing list:
-// http://boost.2283326.n4.nabble.com/sort-pdqsort-td4691031.html
-//
-// This implementation is the adaptation by Ion Gaztanaga of code originally in GitHub
-// with permission from the author to relicense it under the Boost Software License
-// (see the Boost mailing list for details).
-//
-// The original copyright statement is pasted here for completeness:
-//
-//  pdqsort.h - Pattern-defeating quicksort.
-//  Copyright (c) 2015 Orson Peters
-//  This software is provided 'as-is', without any express or implied warranty. In no event will the
-//  authors be held liable for any damages arising from the use of this software.
-//  Permission is granted to anyone to use this software for any purpose, including commercial
-//  applications, and to alter it and redistribute it freely, subject to the following restrictions:
-//  1. The origin of this software must not be misrepresented; you must not claim that you wrote the
-//     original software. If you use this software in a product, an acknowledgment in the product
-//     documentation would be appreciated but is not required.
-//  2. Altered source versions must be plainly marked as such, and must not be misrepresented as
-//     being the original software.
-//  3. This notice may not be removed or altered from any source distribution.
-//
-//////////////////////////////////////////////////////////////////////////////
-
-#ifndef BOOST_MOVE_ALGO_PDQSORT_HPP
-#define BOOST_MOVE_ALGO_PDQSORT_HPP
-
-#ifndef BOOST_CONFIG_HPP
-#  include <boost/config.hpp>
-#endif
-#
-#if defined(BOOST_HAS_PRAGMA_ONCE)
-#  pragma once
-#endif
-
-#include <boost/move/detail/config_begin.hpp>
-
-#include <boost/move/detail/workaround.hpp>
-#include <boost/move/utility_core.hpp>
-#include <boost/move/algo/detail/insertion_sort.hpp>
-#include <boost/move/algo/detail/heap_sort.hpp>
-#include <boost/move/detail/iterator_traits.hpp>
-
-#include <boost/move/adl_move_swap.hpp>
-#include <cstddef>
-
-#if defined(BOOST_CLANG) || (defined(BOOST_GCC) && (BOOST_GCC >= 40600))
-#pragma GCC diagnostic push
-#pragma GCC diagnostic ignored "-Wsign-conversion"
-#endif
-
-namespace boost {
-namespace movelib {
-
-namespace pdqsort_detail {
-
-   //A simple pair implementation to avoid including <utility>
-   template<class T1, class T2>
-   struct pair
-   {
-      pair()
-      {}
-
-      pair(const T1 &t1, const T2 &t2)
-         : first(t1), second(t2)
-      {}
-
-      T1 first;
-      T2 second;
-   };
-
-    enum {
-        // Partitions below this size are sorted using insertion sort.
-        insertion_sort_threshold = 24,
-
-        // Partitions above this size use Tukey's ninther to select the pivot.
-        ninther_threshold = 128,
-
-        // When we detect an already sorted partition, attempt an insertion sort that allows this
-        // amount of element moves before giving up.
-        partial_insertion_sort_limit = 8,
-
-        // Must be multiple of 8 due to loop unrolling, and < 256 to fit in unsigned char.
-        block_size = 64,
-
-        // Cacheline size, assumes power of two.
-        cacheline_size = 64
-
-    };
-
-    // Returns floor(log2(n)), assumes n > 0.
-    template<class Unsigned>
-    Unsigned log2(Unsigned n) {
-        Unsigned log = 0;
-        while (n >>= 1) ++log;
-        return log;
-    }
-
-    // Attempts to use insertion sort on [begin, end). Will return false if more than
-    // partial_insertion_sort_limit elements were moved, and abort sorting. Otherwise it will
-    // successfully sort and return true.
-    template<class Iter, class Compare>
-    inline bool partial_insertion_sort(Iter begin, Iter end, Compare comp) {
-        typedef typename boost::movelib::iterator_traits<Iter>::value_type T;
-        typedef typename boost::movelib:: iter_size<Iter>::type  size_type;
-        if (begin == end) return true;
-        
-        size_type limit = 0;
-        for (Iter cur = begin + 1; cur != end; ++cur) {
-            if (limit > partial_insertion_sort_limit) return false;
-
-            Iter sift = cur;
-            Iter sift_1 = cur - 1;
-
-            // Compare first so we can avoid 2 moves for an element already positioned correctly.
-            if (comp(*sift, *sift_1)) {
-                T tmp = boost::move(*sift);
-
-                do { *sift-- = boost::move(*sift_1); }
-                while (sift != begin && comp(tmp, *--sift_1));
-
-                *sift = boost::move(tmp);
-                limit += size_type(cur - sift);
-            }
-        }
-
-        return true;
-    }
-
-    template<class Iter, class Compare>
-    inline void sort2(Iter a, Iter b, Compare comp) {
-        if (comp(*b, *a)) boost::adl_move_iter_swap(a, b);
-    }
-
-    // Sorts the elements *a, *b and *c using comparison function comp.
-    template<class Iter, class Compare>
-    inline void sort3(Iter a, Iter b, Iter c, Compare comp) {
-        sort2(a, b, comp);
-        sort2(b, c, comp);
-        sort2(a, b, comp);
-    }
-
-    // Partitions [begin, end) around pivot *begin using comparison function comp. Elements equal
-    // to the pivot are put in the right-hand partition. Returns the position of the pivot after
-    // partitioning and whether the passed sequence already was correctly partitioned. Assumes the
-    // pivot is a median of at least 3 elements and that [begin, end) is at least
-    // insertion_sort_threshold long.
-    template<class Iter, class Compare>
-    pdqsort_detail::pair<Iter, bool> partition_right(Iter begin, Iter end, Compare comp) {
-        typedef typename boost::movelib::iterator_traits<Iter>::value_type T;
-        
-        // Move pivot into local for speed.
-        T pivot(boost::move(*begin));
-
-        Iter first = begin;
-        Iter last = end;
-
-        // Find the first element greater than or equal than the pivot (the median of 3 guarantees
-        // this exists).
-        while (comp(*++first, pivot));
-
-        // Find the first element strictly smaller than the pivot. We have to guard this search if
-        // there was no element before *first.
-        if (first - 1 == begin) while (first < last && !comp(*--last, pivot));
-        else                    while (                !comp(*--last, pivot));
-
-        // If the first pair of elements that should be swapped to partition are the same element,
-        // the passed in sequence already was correctly partitioned.
-        bool already_partitioned = first >= last;
-        
-        // Keep swapping pairs of elements that are on the wrong side of the pivot. Previously
-        // swapped pairs guard the searches, which is why the first iteration is special-cased
-        // above.
-        while (first < last) {
-            boost::adl_move_iter_swap(first, last);
-            while (comp(*++first, pivot));
-            while (!comp(*--last, pivot));
-        }
-
-        // Put the pivot in the right place.
-        Iter pivot_pos = first - 1;
-        if(begin != pivot_pos)   //Avoid potential self-move
-            *begin = boost::move(*pivot_pos);
-        *pivot_pos = boost::move(pivot);
-
-        return pdqsort_detail::pair<Iter, bool>(pivot_pos, already_partitioned);
-    }
-
-    // Similar function to the one above, except elements equal to the pivot are put to the left of
-    // the pivot and it doesn't check or return if the passed sequence already was partitioned.
-    // Since this is rarely used (the many equal case), and in that case pdqsort already has O(n)
-    // performance, no block quicksort is applied here for simplicity.
-    template<class Iter, class Compare>
-    inline Iter partition_left(Iter begin, Iter end, Compare comp) {
-        typedef typename boost::movelib::iterator_traits<Iter>::value_type T;
-
-        T pivot(boost::move(*begin));
-        Iter first = begin;
-        Iter last = end;
-        
-        while (comp(pivot, *--last));
-
-        if (last + 1 == end) while (first < last && !comp(pivot, *++first));
-        else                 while (                !comp(pivot, *++first));
-
-        while (first < last) {
-            boost::adl_move_iter_swap(first, last);
-            while (comp(pivot, *--last));
-            while (!comp(pivot, *++first));
-        }
-
-        Iter pivot_pos = last;
-        *begin = boost::move(*pivot_pos);
-        *pivot_pos = boost::move(pivot);
-
-        return pivot_pos;
-    }
-
-
-   template<class Iter, class Compare>
-   void pdqsort_loop( Iter begin, Iter end, Compare comp
-                    , typename boost::movelib:: iter_size<Iter>::type bad_allowed
-                    , bool leftmost = true)
-   {
-        typedef typename boost::movelib:: iter_size<Iter>::type size_type;
-
-        // Use a while loop for tail recursion elimination.
-        while (true) {
-            size_type size = size_type(end - begin);
-
-            // Insertion sort is faster for small arrays.
-            if (size < insertion_sort_threshold) {
-                insertion_sort(begin, end, comp);
-                return;
-            }
-
-            // Choose pivot as median of 3 or pseudomedian of 9.
-            size_type s2 = size / 2;
-            if (size > ninther_threshold) {
-                sort3(begin, begin + s2, end - 1, comp);
-                sort3(begin + 1, begin + (s2 - 1), end - 2, comp);
-                sort3(begin + 2, begin + (s2 + 1), end - 3, comp);
-                sort3(begin + (s2 - 1), begin + s2, begin + (s2 + 1), comp);
-                boost::adl_move_iter_swap(begin, begin + s2);
-            } else sort3(begin + s2, begin, end - 1, comp);
-
-            // If *(begin - 1) is the end of the right partition of a previous partition operation
-            // there is no element in [begin, end) that is smaller than *(begin - 1). Then if our
-            // pivot compares equal to *(begin - 1) we change strategy, putting equal elements in
-            // the left partition, greater elements in the right partition. We do not have to
-            // recurse on the left partition, since it's sorted (all equal).
-            if (!leftmost && !comp(*(begin - 1), *begin)) {
-                begin = partition_left(begin, end, comp) + 1;
-                continue;
-            }
-
-            // Partition and get results.
-            pdqsort_detail::pair<Iter, bool> part_result = partition_right(begin, end, comp);
-            Iter pivot_pos = part_result.first;
-            bool already_partitioned = part_result.second;
-
-            // Check for a highly unbalanced partition.
-            size_type l_size = size_type(pivot_pos - begin);
-            size_type r_size = size_type(end - (pivot_pos + 1));
-            bool highly_unbalanced = l_size < size / 8 || r_size < size / 8;
-
-            // If we got a highly unbalanced partition we shuffle elements to break many patterns.
-            if (highly_unbalanced) {
-                // If we had too many bad partitions, switch to heapsort to guarantee O(n log n).
-                if (--bad_allowed == 0) {
-                    boost::movelib::heap_sort(begin, end, comp);
-                    return;
-                }
-
-                if (l_size >= insertion_sort_threshold) {
-                    boost::adl_move_iter_swap(begin,             begin + l_size / 4);
-                    boost::adl_move_iter_swap(pivot_pos - 1, pivot_pos - l_size / 4);
-
-                    if (l_size > ninther_threshold) {
-                        boost::adl_move_iter_swap(begin + 1,         begin + (l_size / 4 + 1));
-                        boost::adl_move_iter_swap(begin + 2,         begin + (l_size / 4 + 2));
-                        boost::adl_move_iter_swap(pivot_pos - 2, pivot_pos - (l_size / 4 + 1));
-                        boost::adl_move_iter_swap(pivot_pos - 3, pivot_pos - (l_size / 4 + 2));
-                    }
-                }
-                
-                if (r_size >= insertion_sort_threshold) {
-                    boost::adl_move_iter_swap(pivot_pos + 1, pivot_pos + (1 + r_size / 4));
-                    boost::adl_move_iter_swap(end - 1,                   end - r_size / 4);
-                    
-                    if (r_size > ninther_threshold) {
-                        boost::adl_move_iter_swap(pivot_pos + 2, pivot_pos + (2 + r_size / 4));
-                        boost::adl_move_iter_swap(pivot_pos + 3, pivot_pos + (3 + r_size / 4));
-                        boost::adl_move_iter_swap(end - 2,             end - (1 + r_size / 4));
-                        boost::adl_move_iter_swap(end - 3,             end - (2 + r_size / 4));
-                    }
-                }
-            } else {
-                // If we were decently balanced and we tried to sort an already partitioned
-                // sequence try to use insertion sort.
-                if (already_partitioned && partial_insertion_sort(begin, pivot_pos, comp)
-                                        && partial_insertion_sort(pivot_pos + 1, end, comp)) return;
-            }
-                
-            // Sort the left partition first using recursion and do tail recursion elimination for
-            // the right-hand partition.
-            pdqsort_loop<Iter, Compare>(begin, pivot_pos, comp, bad_allowed, leftmost);
-            begin = pivot_pos + 1;
-            leftmost = false;
-        }
-    }
-}
-
-
-template<class Iter, class Compare>
-void pdqsort(Iter begin, Iter end, Compare comp)
-{
-   if (begin == end) return;
-   typedef typename boost::movelib:: iter_size<Iter>::type size_type;
-   pdqsort_detail::pdqsort_loop<Iter, Compare>(begin, end, comp, pdqsort_detail::log2(size_type(end - begin)));
-}
-
-}  //namespace movelib {
-}  //namespace boost {
-
-#if defined(BOOST_CLANG) || (defined(BOOST_GCC) && (BOOST_GCC >= 40600))
-#pragma GCC diagnostic pop
-#endif
-
-#include <boost/move/detail/config_end.hpp>
-
-#endif   //BOOST_MOVE_ALGO_PDQSORT_HPP
diff --git a/src/boost/move/algo/detail/search.hpp b/src/boost/move/algo/detail/search.hpp
deleted file mode 100644
index 9433fbd4..00000000
--- a/src/boost/move/algo/detail/search.hpp
+++ /dev/null
@@ -1,79 +0,0 @@
-//////////////////////////////////////////////////////////////////////////////
-//
-// (C) Copyright Ion Gaztanaga 2022-2022.
-// Distributed under the Boost 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/move for documentation.
-//
-//////////////////////////////////////////////////////////////////////////////
-#ifndef BOOST_MOVE_DETAIL_SEARCH_HPP
-#define BOOST_MOVE_DETAIL_SEARCH_HPP
-
-#include <boost/move/detail/iterator_traits.hpp>
-
-#if defined(BOOST_CLANG) || (defined(BOOST_GCC) && (BOOST_GCC >= 40600))
-#pragma GCC diagnostic push
-#pragma GCC diagnostic ignored "-Wsign-conversion"
-#endif
-
-namespace boost {
-namespace movelib {
-
-template <class RandIt, class T, class Compare>
-RandIt lower_bound
-   (RandIt first, const RandIt last, const T& key, Compare comp)
-{
-   typedef typename iter_size<RandIt>::type size_type;
-   size_type len = size_type(last - first);
-   RandIt middle;
-
-   while (len) {
-      size_type step = size_type(len >> 1);
-      middle = first;
-      middle += step;
-
-      if (comp(*middle, key)) {
-         first = ++middle;
-         len = size_type(len - (step + 1));
-      }
-      else{
-         len = step;
-      }
-   }
-   return first;
-}
-
-template <class RandIt, class T, class Compare>
-RandIt upper_bound
-   (RandIt first, const RandIt last, const T& key, Compare comp)
-{
-   typedef typename iter_size<RandIt>::type size_type;
-   size_type len = size_type(last - first);
-   RandIt middle;
-
-   while (len) {
-      size_type step = size_type(len >> 1);
-      middle = first;
-      middle += step;
-
-      if (!comp(key, *middle)) {
-         first = ++middle;
-         len = size_type(len - (step + 1));
-      }
-      else{
-         len = step;
-      }
-   }
-   return first;
-}
-
-}  //namespace movelib {
-}  //namespace boost {
-
-#if defined(BOOST_CLANG) || (defined(BOOST_GCC) && (BOOST_GCC >= 40600))
-#pragma GCC diagnostic pop
-#endif
-
-#endif   //#define BOOST_MOVE_DETAIL_SEARCH_HPP
diff --git a/src/boost/move/algo/detail/set_difference.hpp b/src/boost/move/algo/detail/set_difference.hpp
deleted file mode 100644
index 812ca5f3..00000000
--- a/src/boost/move/algo/detail/set_difference.hpp
+++ /dev/null
@@ -1,213 +0,0 @@
-//////////////////////////////////////////////////////////////////////////////
-//
-// (C) Copyright Ion Gaztanaga 2017-2017.
-// Distributed under the Boost 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/move for documentation.
-//
-//////////////////////////////////////////////////////////////////////////////
-#ifndef BOOST_MOVE_SET_DIFFERENCE_HPP
-#define BOOST_MOVE_SET_DIFFERENCE_HPP
-
-#include <boost/move/algo/move.hpp>
-#include <boost/move/iterator.hpp>
-#include <boost/move/utility_core.hpp>
-
-#if defined(BOOST_CLANG) || (defined(BOOST_GCC) && (BOOST_GCC >= 40600))
-#pragma GCC diagnostic push
-#pragma GCC diagnostic ignored "-Wsign-conversion"
-#endif
-
-namespace boost {
-namespace move_detail{
-
-template<class InputIt, class OutputIt>
-OutputIt copy(InputIt first, InputIt last, OutputIt result)
-{
-   while (first != last) {
-      *result++ = *first;
-      ++result;
-      ++first;
-   }
-   return result;
-}
-
-}  //namespace move_detail{
-
-namespace movelib {
-
-//Moves the elements from the sorted range [first1, last1) which are not found in the sorted
-//range [first2, last2) to the range beginning at result.
-//The resulting range is also sorted. Equivalent elements are treated individually,
-//that is, if some element is found m times in [first1, last1) and n times in [first2, last2),
-//it will be moved to result exactly max(m-n, 0) times.
-//The resulting range cannot overlap with either of the input ranges.
-template<class InputIt1, class InputIt2,
-         class OutputIt, class Compare>
-OutputIt set_difference
-   (InputIt1 first1, InputIt1 last1, InputIt2 first2, InputIt2 last2, OutputIt result, Compare comp)
-{
-   while (first1 != last1) {
-      if (first2 == last2)
-         return boost::move_detail::copy(first1, last1, result);
-
-      if (comp(*first1, *first2)) {
-         *result = *first1;
-         ++result;
-         ++first1;
-      }
-      else {
-         if (!comp(*first2, *first1)) {
-            ++first1;
-         }
-         ++first2;
-      }
-   }
-   return result;
-}
-
-//Moves the elements from the sorted range [first1, last1) which are not found in the sorted
-//range [first2, last2) to the range beginning at first1 (in place operation in range1).
-//The resulting range is also sorted. Equivalent elements are treated individually,
-//that is, if some element is found m times in [first1, last1) and n times in [first2, last2),
-//it will be moved to result exactly max(m-n, 0) times.
-template<class InputOutputIt1, class InputIt2, class Compare>
-InputOutputIt1 inplace_set_difference
-   (InputOutputIt1 first1, InputOutputIt1 last1, InputIt2 first2, InputIt2 last2, Compare comp )
-{
-   while (first1 != last1) {
-      //Skip copying from range 1 if no element has to be skipped
-      if (first2 == last2){
-         return last1;
-      }
-      else if (comp(*first1, *first2)){
-         ++first1;
-      }
-      else{
-         if (!comp(*first2, *first1)) {
-            InputOutputIt1 result = first1;
-            //An element from range 1 must be skipped, no longer an inplace operation
-            return boost::movelib::set_difference
-               ( boost::make_move_iterator(++first1)
-               , boost::make_move_iterator(last1)
-               , ++first2, last2, result, comp);
-         }
-         ++first2;
-      }
-   }
-   return first1;
-}
-
-//Moves the elements from the sorted range [first1, last1) which are not found in the sorted
-//range [first2, last2) to the range beginning at first1.
-//The resulting range is also sorted. Equivalent elements from range 1 are moved past to end
-//of the result,
-//that is, if some element is found m times in [first1, last1) and n times in [first2, last2),
-//it will be moved to result exactly max(m-n, 0) times.
-//The resulting range cannot overlap with either of the input ranges.
-template<class ForwardIt1, class InputIt2,
-         class OutputIt, class Compare>
-OutputIt set_unique_difference
-   (ForwardIt1 first1, ForwardIt1 last1, InputIt2 first2, InputIt2 last2, OutputIt result, Compare comp)
-{
-   while (first1 != last1) {
-      if (first2 == last2){
-         //unique_copy-like sequence with forward iterators but don't write i
-         //to result before comparing as moving *i could alter the value in i.
-         ForwardIt1 i = first1;
-         while (++first1 != last1) {
-            if (comp(*i, *first1)) {
-               *result = *i;
-               ++result;
-               i = first1;
-            }
-         }
-         *result = *i;
-         ++result;
-         break;
-      }
-
-      if (comp(*first1, *first2)) {
-         //Skip equivalent elements in range1 but don't write i
-         //to result before comparing as moving *i could alter the value in i.
-         ForwardIt1 i = first1;
-         while (++first1 != last1) {
-            if (comp(*i, *first1)) {
-               break;
-            }
-         }
-         *result = *i;
-         ++result;
-      }
-      else {
-         if (comp(*first2, *first1)) {
-            ++first2;
-         }
-         else{
-            ++first1;
-         }
-      }
-   }
-   return result;
-}
-
-//Moves the elements from the sorted range [first1, last1) which are not found in the sorted
-//range [first2, last2) to the range beginning at first1 (in place operation in range1).
-//The resulting range is also sorted. Equivalent elements are treated individually,
-//that is, if some element is found m times in [first1, last1) and n times in [first2, last2),
-//it will be moved to result exactly max(m-n, 0) times.
-template<class ForwardOutputIt1, class ForwardIt2, class Compare>
-ForwardOutputIt1 inplace_set_unique_difference
-   (ForwardOutputIt1 first1, ForwardOutputIt1 last1, ForwardIt2 first2, ForwardIt2 last2, Compare comp )
-{
-   while (first1 != last1) {
-      //Skip copying from range 1 if no element has to be skipped
-      if (first2 == last2){
-         //unique-like algorithm for the remaining range 1
-         ForwardOutputIt1 result = first1;
-         while (++first1 != last1) {
-            if (comp(*result, *first1) && ++result != first1) {
-               *result = boost::move(*first1);
-            }
-         }
-         return ++result;
-      }
-      else if (comp(*first2, *first1)) {
-         ++first2;
-      }
-      else if (comp(*first1, *first2)){
-         //skip any adjacent equivalent element in range 1
-         ForwardOutputIt1 result = first1;
-         if (++first1 != last1 && !comp(*result, *first1)) {
-            //Some elements from range 1 must be skipped, no longer an inplace operation
-            while (++first1 != last1 && !comp(*result, *first1)){}
-            return boost::movelib::set_unique_difference
-               ( boost::make_move_iterator(first1)
-               , boost::make_move_iterator(last1)
-               , first2, last2, ++result, comp);
-         }
-      }
-      else{
-         ForwardOutputIt1 result = first1;
-         //Some elements from range 1 must be skipped, no longer an inplace operation
-         while (++first1 != last1 && !comp(*result, *first1)){}
-         //An element from range 1 must be skipped, no longer an inplace operation
-         return boost::movelib::set_unique_difference
-            ( boost::make_move_iterator(first1)
-            , boost::make_move_iterator(last1)
-            , first2, last2, result, comp);
-      }
-   }
-   return first1;
-}
-
-#if defined(BOOST_CLANG) || (defined(BOOST_GCC) && (BOOST_GCC >= 40600))
-#pragma GCC diagnostic pop
-#endif
-
-}  //namespace movelib {
-}  //namespace boost {
-
-#endif   //#define BOOST_MOVE_SET_DIFFERENCE_HPP
diff --git a/src/boost/move/algo/move.hpp b/src/boost/move/algo/move.hpp
deleted file mode 100644
index 9a3eacca..00000000
--- a/src/boost/move/algo/move.hpp
+++ /dev/null
@@ -1,159 +0,0 @@
-//////////////////////////////////////////////////////////////////////////////
-//
-// (C) Copyright Ion Gaztanaga 2012-2016.
-// Distributed under the Boost 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/move for documentation.
-//
-//////////////////////////////////////////////////////////////////////////////
-
-//! \file
-
-#ifndef BOOST_MOVE_ALGO_MOVE_HPP
-#define BOOST_MOVE_ALGO_MOVE_HPP
-
-#ifndef BOOST_CONFIG_HPP
-#  include <boost/config.hpp>
-#endif
-#
-#if defined(BOOST_HAS_PRAGMA_ONCE)
-#  pragma once
-#endif
-
-#include <boost/move/detail/config_begin.hpp>
-
-#include <boost/move/utility_core.hpp>
-#include <boost/move/detail/iterator_traits.hpp>
-#include <boost/move/detail/iterator_to_raw_pointer.hpp>
-#include <boost/move/detail/addressof.hpp>
-#if defined(BOOST_MOVE_USE_STANDARD_LIBRARY_MOVE)
-#include <algorithm>
-#endif
-
-namespace boost {
-
-//////////////////////////////////////////////////////////////////////////////
-//
-//                               move
-//
-//////////////////////////////////////////////////////////////////////////////
-
-#if !defined(BOOST_MOVE_USE_STANDARD_LIBRARY_MOVE)
-
-   //! <b>Effects</b>: Moves elements in the range [first,last) into the range [result,result + (last -
-   //!   first)) starting from first and proceeding to last. For each non-negative integer n < (last-first),
-   //!   performs *(result + n) = ::boost::move (*(first + n)).
-   //!
-   //! <b>Effects</b>: result + (last - first).
-   //!
-   //! <b>Requires</b>: result shall not be in the range [first,last).
-   //!
-   //! <b>Complexity</b>: Exactly last - first move assignments.
-   template <typename I, // I models InputIterator
-            typename O> // O models OutputIterator
-   O move(I f, I l, O result)
-   {
-      while (f != l) {
-         *result = ::boost::move(*f);
-         ++f; ++result;
-      }
-      return result;
-   }
-
-   //////////////////////////////////////////////////////////////////////////////
-   //
-   //                               move_backward
-   //
-   //////////////////////////////////////////////////////////////////////////////
-
-   //! <b>Effects</b>: Moves elements in the range [first,last) into the range
-   //!   [result - (last-first),result) starting from last - 1 and proceeding to
-   //!   first. For each positive integer n <= (last - first),
-   //!   performs *(result - n) = ::boost::move(*(last - n)).
-   //!
-   //! <b>Requires</b>: result shall not be in the range [first,last).
-   //!
-   //! <b>Returns</b>: result - (last - first).
-   //!
-   //! <b>Complexity</b>: Exactly last - first assignments.
-   template <typename I, // I models BidirectionalIterator
-   typename O> // O models BidirectionalIterator
-   O move_backward(I f, I l, O result)
-   {
-      while (f != l) {
-         --l; --result;
-         *result = ::boost::move(*l);
-      }
-      return result;
-   }
-
-#else
-
-   using ::std::move_backward;
-
-#endif   //!defined(BOOST_MOVE_USE_STANDARD_LIBRARY_MOVE)
-
-//////////////////////////////////////////////////////////////////////////////
-//
-//                               uninitialized_move
-//
-//////////////////////////////////////////////////////////////////////////////
-
-//! <b>Effects</b>:
-//!   \code
-//!   for (; first != last; ++result, ++first)
-//!      new (static_cast<void*>(&*result))
-//!         typename iterator_traits<ForwardIterator>::value_type(boost::move(*first));
-//!   \endcode
-//!
-//! <b>Returns</b>: result
-template
-   <typename I, // I models InputIterator
-    typename F> // F models ForwardIterator
-F uninitialized_move(I f, I l, F r
-   /// @cond
-//   ,typename ::boost::move_detail::enable_if<has_move_emulation_enabled<typename boost::movelib::iterator_traits<I>::value_type> >::type* = 0
-   /// @endcond
-   )
-{
-   typedef typename boost::movelib::iterator_traits<I>::value_type input_value_type;
-
-   F back = r;
-   BOOST_MOVE_TRY{
-      while (f != l) {
-         void * const addr = static_cast<void*>(::boost::move_detail::addressof(*r));
-         ::new(addr) input_value_type(::boost::move(*f));
-         ++f; ++r;
-      }
-   }
-   BOOST_MOVE_CATCH(...){
-      for (; back != r; ++back){
-         boost::movelib::iterator_to_raw_pointer(back)->~input_value_type();
-      }
-      BOOST_MOVE_RETHROW;
-   }
-   BOOST_MOVE_CATCH_END
-   return r;
-}
-
-/// @cond
-/*
-template
-   <typename I,   // I models InputIterator
-    typename F>   // F models ForwardIterator
-F uninitialized_move(I f, I l, F r,
-   typename ::boost::move_detail::disable_if<has_move_emulation_enabled<typename boost::movelib::iterator_traits<I>::value_type> >::type* = 0)
-{
-   return std::uninitialized_copy(f, l, r);
-}
-*/
-
-/// @endcond
-
-}  //namespace boost {
-
-#include <boost/move/detail/config_end.hpp>
-
-#endif //#ifndef BOOST_MOVE_ALGO_MOVE_HPP
diff --git a/src/boost/move/algo/predicate.hpp b/src/boost/move/algo/predicate.hpp
deleted file mode 100644
index 58a4d620..00000000
--- a/src/boost/move/algo/predicate.hpp
+++ /dev/null
@@ -1,101 +0,0 @@
-//////////////////////////////////////////////////////////////////////////////
-//
-// (C) Copyright Ion Gaztanaga 2015-2016.
-// Distributed under the Boost 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/move for documentation.
-//
-//////////////////////////////////////////////////////////////////////////////
-#ifndef BOOST_MOVE_ALGO_PREDICATE_HPP
-#define BOOST_MOVE_ALGO_PREDICATE_HPP
-
-#include <boost/move/algo/move.hpp>
-#include <boost/move/adl_move_swap.hpp>
-#include <boost/move/algo/detail/basic_op.hpp>
-#include <boost/move/detail/iterator_traits.hpp>
-#include <boost/move/detail/destruct_n.hpp>
-#include <cassert>
-
-namespace boost {
-namespace movelib {
-
-template<class Comp>
-struct antistable
-{
-   BOOST_MOVE_FORCEINLINE explicit antistable(Comp &comp)
-      : m_comp(comp)
-   {}
-
-   BOOST_MOVE_FORCEINLINE antistable(const antistable & other)
-      : m_comp(other.m_comp)
-   {}
-
-   template<class U, class V>
-   BOOST_MOVE_FORCEINLINE bool operator()(const U &u, const V & v)
-   {  return !m_comp(v, u);  }
-
-   BOOST_MOVE_FORCEINLINE const Comp &get() const
-   {  return m_comp; }
-
-   private:
-   antistable & operator=(const antistable &);
-   Comp &m_comp;
-};
-
-template<class Comp>
-Comp unantistable(Comp comp)
-{   return comp;  }
-
-template<class Comp>
-Comp unantistable(antistable<Comp> comp)
-{   return comp.get();  }
-
-template <class Comp>
-class negate
-{
-   public:
-   BOOST_MOVE_FORCEINLINE negate()
-   {}
-
-   BOOST_MOVE_FORCEINLINE explicit negate(Comp comp)
-      : m_comp(comp)
-   {}
-
-   template <class T1, class T2>
-   BOOST_MOVE_FORCEINLINE bool operator()(const T1& l, const T2& r)
-   {
-      return !m_comp(l, r);
-   }
-
-   private:
-   Comp m_comp;
-};
-
-
-template <class Comp>
-class inverse
-{
-   public:
-   BOOST_MOVE_FORCEINLINE inverse()
-   {}
-
-   BOOST_MOVE_FORCEINLINE explicit inverse(Comp comp)
-      : m_comp(comp)
-   {}
-
-   template <class T1, class T2>
-   BOOST_MOVE_FORCEINLINE bool operator()(const T1& l, const T2& r)
-   {
-      return m_comp(r, l);
-   }
-
-   private:
-   Comp m_comp;
-};
-
-}  //namespace movelib {
-}  //namespace boost {
-
-#endif   //#define BOOST_MOVE_ALGO_PREDICATE_HPP
diff --git a/src/boost/move/algo/unique.hpp b/src/boost/move/algo/unique.hpp
deleted file mode 100644
index 8022a654..00000000
--- a/src/boost/move/algo/unique.hpp
+++ /dev/null
@@ -1,55 +0,0 @@
-//////////////////////////////////////////////////////////////////////////////
-//
-// (C) Copyright Ion Gaztanaga 2017-2017.
-// Distributed under the Boost 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/move for documentation.
-//
-//////////////////////////////////////////////////////////////////////////////
-
-#ifndef BOOST_MOVE_ALGO_UNIQUE_HPP
-#define BOOST_MOVE_ALGO_UNIQUE_HPP
-
-#include <boost/move/detail/config_begin.hpp>
-#include <boost/move/utility_core.hpp>
-
-namespace boost {
-namespace movelib {
-
-//! <b>Requires</b>: The comparison function shall be an equivalence relation. The type of *first shall satisfy
-//! the MoveAssignable requirements
-//!
-//! <b>Effects</b>: For a nonempty range, eliminates all but the first element from every consecutive group
-//!   of equivalent elements referred to by the iterator i in the range [first + 1, last) for which the
-//!   following conditions hold: pred(*(i - 1), *i) != false.
-//!
-//! <b>Returns</b>: The end of the resulting range.
-//!
-//! <b>Complexity</b>: For nonempty ranges, exactly (last - first) - 1 applications of the corresponding predicate.
-template<class ForwardIterator, class BinaryPredicate>
-ForwardIterator unique(ForwardIterator first, ForwardIterator last, BinaryPredicate pred)
-{
-    if (first != last) {
-      ForwardIterator next(first);
-      ++next;
-      for (; next != last; ++next, ++first) {
-         if (pred(*first, *next)) { //Find first equal element
-            while (++next != last)
-               if (!pred(*first, *next))
-                  *++first = ::boost::move(*next);
-            break;
-         }
-      }
-      ++first;
-   }
-   return first;
-}
-
-}  //namespace movelib {
-}  //namespace boost {
-
-#include <boost/move/detail/config_end.hpp>
-
-#endif   //#define BOOST_MOVE_ALGO_UNIQUE_HPP
diff --git a/src/boost/move/algorithm.hpp b/src/boost/move/algorithm.hpp
deleted file mode 100644
index 67a69064..00000000
--- a/src/boost/move/algorithm.hpp
+++ /dev/null
@@ -1,166 +0,0 @@
-//////////////////////////////////////////////////////////////////////////////
-//
-// (C) Copyright Ion Gaztanaga 2012-2012.
-// Distributed under the Boost 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/move for documentation.
-//
-//////////////////////////////////////////////////////////////////////////////
-
-//! \file
-
-#ifndef BOOST_MOVE_ALGORITHM_HPP
-#define BOOST_MOVE_ALGORITHM_HPP
-
-#ifndef BOOST_CONFIG_HPP
-#  include <boost/config.hpp>
-#endif
-#
-#if defined(BOOST_HAS_PRAGMA_ONCE)
-#  pragma once
-#endif
-
-#include <boost/move/detail/config_begin.hpp>
-
-#include <boost/move/utility_core.hpp>
-#include <boost/move/iterator.hpp>
-#include <boost/move/algo/move.hpp>
-
-#include <algorithm> //copy, copy_backward
-#include <memory>    //uninitialized_copy
-
-namespace boost {
-
-//////////////////////////////////////////////////////////////////////////////
-//
-//                            uninitialized_copy_or_move
-//
-//////////////////////////////////////////////////////////////////////////////
-
-namespace move_detail {
-
-template
-<typename I,   // I models InputIterator
-typename F>   // F models ForwardIterator
-inline F uninitialized_move_move_iterator(I f, I l, F r
-//                             ,typename ::boost::move_detail::enable_if< has_move_emulation_enabled<typename I::value_type> >::type* = 0
-)
-{
-   return ::boost::uninitialized_move(f, l, r);
-}
-/*
-template
-<typename I,   // I models InputIterator
-typename F>   // F models ForwardIterator
-F uninitialized_move_move_iterator(I f, I l, F r,
-                                   typename ::boost::move_detail::disable_if< has_move_emulation_enabled<typename I::value_type> >::type* = 0)
-{
-   return std::uninitialized_copy(f.base(), l.base(), r);
-}
-*/
-}  //namespace move_detail {
-
-template
-<typename I,   // I models InputIterator
-typename F>   // F models ForwardIterator
-inline F uninitialized_copy_or_move(I f, I l, F r,
-                             typename ::boost::move_detail::enable_if< move_detail::is_move_iterator<I> >::type* = 0)
-{
-   return ::boost::move_detail::uninitialized_move_move_iterator(f, l, r);
-}
-
-//////////////////////////////////////////////////////////////////////////////
-//
-//                            copy_or_move
-//
-//////////////////////////////////////////////////////////////////////////////
-
-namespace move_detail {
-
-template
-<typename I,   // I models InputIterator
-typename F>   // F models ForwardIterator
-inline F move_move_iterator(I f, I l, F r
-//                             ,typename ::boost::move_detail::enable_if< has_move_emulation_enabled<typename I::value_type> >::type* = 0
-)
-{
-   return ::boost::move(f, l, r);
-}
-/*
-template
-<typename I,   // I models InputIterator
-typename F>   // F models ForwardIterator
-F move_move_iterator(I f, I l, F r,
-                                   typename ::boost::move_detail::disable_if< has_move_emulation_enabled<typename I::value_type> >::type* = 0)
-{
-   return std::copy(f.base(), l.base(), r);
-}
-*/
-
-}  //namespace move_detail {
-
-template
-<typename I,   // I models InputIterator
-typename F>   // F models ForwardIterator
-inline F copy_or_move(I f, I l, F r,
-                             typename ::boost::move_detail::enable_if< move_detail::is_move_iterator<I> >::type* = 0)
-{
-   return ::boost::move_detail::move_move_iterator(f, l, r);
-}
-
-/// @endcond
-
-//! <b>Effects</b>:
-//!   \code
-//!   for (; first != last; ++result, ++first)
-//!      new (static_cast<void*>(&*result))
-//!         typename iterator_traits<ForwardIterator>::value_type(*first);
-//!   \endcode
-//!
-//! <b>Returns</b>: result
-//!
-//! <b>Note</b>: This function is provided because
-//!   <i>std::uninitialized_copy</i> from some STL implementations
-//!    is not compatible with <i>move_iterator</i>
-template
-<typename I,   // I models InputIterator
-typename F>   // F models ForwardIterator
-inline F uninitialized_copy_or_move(I f, I l, F r
-   /// @cond
-   ,typename ::boost::move_detail::disable_if< move_detail::is_move_iterator<I> >::type* = 0
-   /// @endcond
-   )
-{
-   return std::uninitialized_copy(f, l, r);
-}
-
-//! <b>Effects</b>:
-//!   \code
-//!   for (; first != last; ++result, ++first)
-//!      *result = *first;
-//!   \endcode
-//!
-//! <b>Returns</b>: result
-//!
-//! <b>Note</b>: This function is provided because
-//!   <i>std::uninitialized_copy</i> from some STL implementations
-//!    is not compatible with <i>move_iterator</i>
-template
-<typename I,   // I models InputIterator
-typename F>   // F models ForwardIterator
-inline F copy_or_move(I f, I l, F r
-   /// @cond
-   ,typename ::boost::move_detail::disable_if< move_detail::is_move_iterator<I> >::type* = 0
-   /// @endcond
-   )
-{
-   return std::copy(f, l, r);
-}
-
-}  //namespace boost {
-
-#include <boost/move/detail/config_end.hpp>
-
-#endif //#ifndef BOOST_MOVE_ALGORITHM_HPP
diff --git a/src/boost/move/default_delete.hpp b/src/boost/move/default_delete.hpp
deleted file mode 100644
index 2b91dcd9..00000000
--- a/src/boost/move/default_delete.hpp
+++ /dev/null
@@ -1,243 +0,0 @@
-//////////////////////////////////////////////////////////////////////////////
-//
-// (C) Copyright Ion Gaztanaga 2014-2014. Distributed under the Boost
-// 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/move for documentation.
-//
-//////////////////////////////////////////////////////////////////////////////
-
-#ifndef BOOST_MOVE_DEFAULT_DELETE_HPP_INCLUDED
-#define BOOST_MOVE_DEFAULT_DELETE_HPP_INCLUDED
-
-#ifndef BOOST_CONFIG_HPP
-#  include <boost/config.hpp>
-#endif
-#
-#if defined(BOOST_HAS_PRAGMA_ONCE)
-#  pragma once
-#endif
-
-#include <boost/move/detail/config_begin.hpp>
-#include <boost/move/detail/workaround.hpp>
-#include <boost/move/detail/unique_ptr_meta_utils.hpp>
-#include <boost/move/utility_core.hpp>
-
-#include <cstddef>   //For std::size_t,std::nullptr_t
-
-//!\file
-//! Describes the default deleter (destruction policy) of <tt>unique_ptr</tt>: <tt>default_delete</tt>.
-
-namespace boost{
-// @cond
-namespace move_upd {
-
-namespace bmupmu = ::boost::move_upmu;
-
-////////////////////////////////////////
-////        enable_def_del
-////////////////////////////////////////
-
-//compatible with a pointer type T*:
-//When either Y* is convertible to T*
-//Y is U[N] and T is U cv []
-template<class U, class T>
-struct def_del_compatible_cond
-   : bmupmu::is_convertible<U*, T*>
-{};
-
-template<class U, class T, std::size_t N>
-struct def_del_compatible_cond<U[N], T[]>
-   : def_del_compatible_cond<U[], T[]>
-{};
-
-template<class U, class T, class Type = bmupmu::nat>
-struct enable_def_del
-   : bmupmu::enable_if_c<def_del_compatible_cond<U, T>::value, Type>
-{};
-
-////////////////////////////////////////
-////        enable_defdel_call
-////////////////////////////////////////
-
-//When 2nd is T[N], 1st(*)[N] shall be convertible to T(*)[N]; 
-//When 2nd is T[],  1st(*)[] shall be convertible to T(*)[]; 
-//Otherwise, 1st* shall be convertible to 2nd*.
-
-template<class U, class T, class Type = bmupmu::nat>
-struct enable_defdel_call
-   : public enable_def_del<U, T, Type>
-{};
-
-template<class U, class T, class Type>
-struct enable_defdel_call<U, T[], Type>
-   : public enable_def_del<U[], T[], Type>
-{};
-
-template<class U, class T, class Type, std::size_t N>
-struct enable_defdel_call<U, T[N], Type>
-   : public enable_def_del<U[N], T[N], Type>
-{};
-
-////////////////////////////////////////
-////     Some bool literal zero conversion utilities
-////////////////////////////////////////
-
-struct bool_conversion {int for_bool; int for_arg(); };
-typedef int bool_conversion::* explicit_bool_arg;
-
-#if !defined(BOOST_NO_CXX11_NULLPTR) && !defined(BOOST_NO_CXX11_DECLTYPE)
-   typedef decltype(nullptr) nullptr_type;
-#elif !defined(BOOST_NO_CXX11_NULLPTR)
-   typedef std::nullptr_t nullptr_type;
-#else
-   typedef int (bool_conversion::*nullptr_type)();
-#endif
-
-template<bool B>
-struct is_array_del
-{};
-
-template<class T>
-void call_delete(T *p, is_array_del<true>)
-{
-   delete [] p;
-}
-
-template<class T>
-void call_delete(T *p, is_array_del<false>)
-{
-   delete p;
-}
-
-template< class T, class U
-        , bool enable =  def_del_compatible_cond< U, T>::value &&
-                        !move_upmu::is_array<T>::value &&
-                        !move_upmu::is_same<typename move_upmu::remove_cv<T>::type, void>::value &&
-                        !move_upmu::is_same<typename move_upmu::remove_cv<U>::type, typename move_upmu::remove_cv<T>::type>::value
-        >
-struct missing_virtual_destructor_default_delete
-{  static const bool value = !move_upmu::has_virtual_destructor<T>::value;  };
-
-template<class T, class U>
-struct missing_virtual_destructor_default_delete<T, U, false>
-{  static const bool value = false;  };
-
-//////////////////////////////////////
-//       missing_virtual_destructor
-//////////////////////////////////////
-
-template<class Deleter, class U>
-struct missing_virtual_destructor
-{  static const bool value = false;  };
-
-template<class T, class U>
-struct missing_virtual_destructor< ::boost::movelib::default_delete<T>, U >
-   : missing_virtual_destructor_default_delete<T, U>
-{};
-
-
-}  //namespace move_upd {
-// @endcond
-
-namespace movelib {
-
-namespace bmupd = boost::move_upd;
-namespace bmupmu = ::boost::move_upmu;
-
-//!The class template <tt>default_delete</tt> serves as the default deleter
-//!(destruction policy) for the class template <tt>unique_ptr</tt>.
-//!
-//! \tparam T The type to be deleted. It may be an incomplete type
-template <class T>
-struct default_delete
-{
-   //! Default constructor.
-   //!
-   BOOST_CONSTEXPR default_delete()
-   //Avoid "defaulted on its first declaration must not have an exception-specification" error for GCC 4.6
-   #if !defined(BOOST_GCC) || (BOOST_GCC < 40600 && BOOST_GCC >= 40700) || defined(BOOST_MOVE_DOXYGEN_INVOKED)
-   BOOST_NOEXCEPT
-   #endif
-   #if !defined(BOOST_NO_CXX11_DEFAULTED_FUNCTIONS) || defined(BOOST_MOVE_DOXYGEN_INVOKED)
-   = default;
-   #else
-   {};
-   #endif
-
-   #if defined(BOOST_MOVE_DOXYGEN_INVOKED)
-   //! Trivial copy constructor
-   //!
-   default_delete(const default_delete&) BOOST_NOEXCEPT = default;
-   //! Trivial assignment
-   //!
-   default_delete &operator=(const default_delete&) BOOST_NOEXCEPT = default;
-   #else
-   typedef typename bmupmu::remove_extent<T>::type element_type;
-   #endif
-
-   //! <b>Effects</b>: Constructs a default_delete object from another <tt>default_delete<U></tt> object.
-   //!
-   //! <b>Remarks</b>: This constructor shall not participate in overload resolution unless:
-   //!   - If T is not an array type and U* is implicitly convertible to T*.
-   //!   - If T is an array type and U* is a more CV qualified pointer to remove_extent<T>::type.
-   template <class U>
-   default_delete(const default_delete<U>&
-      BOOST_MOVE_DOCIGN(BOOST_MOVE_I typename bmupd::enable_def_del<U BOOST_MOVE_I T>::type* =0)
-      ) BOOST_NOEXCEPT
-   {
-      //If T is not an array type, U derives from T
-      //and T has no virtual destructor, then you have a problem
-      BOOST_MOVE_STATIC_ASSERT(( !bmupd::missing_virtual_destructor<default_delete, U>::value ));
-   }
-
-   //! <b>Effects</b>: Constructs a default_delete object from another <tt>default_delete<U></tt> object.
-   //!
-   //! <b>Remarks</b>: This constructor shall not participate in overload resolution unless:
-   //!   - If T is not an array type and U* is implicitly convertible to T*.
-   //!   - If T is an array type and U* is a more CV qualified pointer to remove_extent<T>::type.
-   template <class U>
-   BOOST_MOVE_DOC1ST(default_delete&, 
-      typename bmupd::enable_def_del<U BOOST_MOVE_I T BOOST_MOVE_I default_delete &>::type)
-      operator=(const default_delete<U>&) BOOST_NOEXCEPT
-   {
-      //If T is not an array type, U derives from T
-      //and T has no virtual destructor, then you have a problem
-      BOOST_MOVE_STATIC_ASSERT(( !bmupd::missing_virtual_destructor<default_delete, U>::value ));
-      return *this;
-   }
-
-   //! <b>Effects</b>: if T is not an array type, calls <tt>delete</tt> on static_cast<T*>(ptr),
-   //!   otherwise calls <tt>delete[]</tt> on static_cast<remove_extent<T>::type*>(ptr).
-   //!
-   //! <b>Remarks</b>: If U is an incomplete type, the program is ill-formed.
-   //!   This operator shall not participate in overload resolution unless:
-   //!      - T is not an array type and U* is convertible to T*, OR
-   //!      - T is an array type, and remove_cv<U>::type is the same type as
-   //!         remove_cv<remove_extent<T>::type>::type and U* is convertible to remove_extent<T>::type*.
-   template <class U>
-   BOOST_MOVE_DOC1ST(void, typename bmupd::enable_defdel_call<U BOOST_MOVE_I T BOOST_MOVE_I void>::type)
-      operator()(U* ptr) const BOOST_NOEXCEPT
-   {
-      //U must be a complete type
-      BOOST_MOVE_STATIC_ASSERT(sizeof(U) > 0);
-      //If T is not an array type, U derives from T
-      //and T has no virtual destructor, then you have a problem
-      BOOST_MOVE_STATIC_ASSERT(( !bmupd::missing_virtual_destructor<default_delete, U>::value ));
-      element_type * const p = static_cast<element_type*>(ptr);
-      move_upd::call_delete(p, move_upd::is_array_del<bmupmu::is_array<T>::value>());
-   }
-
-   //! <b>Effects</b>: Same as <tt>(*this)(static_cast<element_type*>(nullptr))</tt>.
-   //!
-   void operator()(BOOST_MOVE_DOC0PTR(bmupd::nullptr_type)) const BOOST_NOEXCEPT
-   {  BOOST_MOVE_STATIC_ASSERT(sizeof(element_type) > 0);  }
-};
-
-}  //namespace movelib {
-}  //namespace boost{
-
-#include <boost/move/detail/config_end.hpp>
-
-#endif   //#ifndef BOOST_MOVE_DEFAULT_DELETE_HPP_INCLUDED
diff --git a/src/boost/move/detail/destruct_n.hpp b/src/boost/move/detail/destruct_n.hpp
deleted file mode 100644
index 9f60fc27..00000000
--- a/src/boost/move/detail/destruct_n.hpp
+++ /dev/null
@@ -1,66 +0,0 @@
-//////////////////////////////////////////////////////////////////////////////
-//
-// (C) Copyright Ion Gaztanaga 2015-2016.
-// Distributed under the Boost 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/move for documentation.
-//
-//////////////////////////////////////////////////////////////////////////////
-
-//! \file
-
-#ifndef BOOST_MOVE_DETAIL_DESTRUCT_N_HPP
-#define BOOST_MOVE_DETAIL_DESTRUCT_N_HPP
-
-#ifndef BOOST_CONFIG_HPP
-#  include <boost/config.hpp>
-#endif
-#
-#if defined(BOOST_HAS_PRAGMA_ONCE)
-#  pragma once
-#endif
-
-#include <cstddef>
-
-namespace boost {
-namespace movelib{
-
-template<class T, class RandItUninit>
-class destruct_n
-{
-   public:
-   explicit destruct_n(RandItUninit raw)
-      : m_ptr(raw), m_size()
-   {}
-
-   void incr()
-   {
-      ++m_size;
-   }
-
-   void incr(std::size_t n)
-   {
-      m_size += n;
-   }
-
-   void release()
-   {
-      m_size = 0u;
-   }
-
-   ~destruct_n()
-   {
-      while(m_size--){
-         m_ptr[m_size].~T();
-      }
-   }
-   private:
-   RandItUninit m_ptr;
-   std::size_t m_size;
-};
-
-}} //namespace boost {  namespace movelib{
-
-#endif //#ifndef BOOST_MOVE_DETAIL_DESTRUCT_N_HPP
diff --git a/src/boost/move/detail/force_ptr.hpp b/src/boost/move/detail/force_ptr.hpp
deleted file mode 100644
index 3abed2d8..00000000
--- a/src/boost/move/detail/force_ptr.hpp
+++ /dev/null
@@ -1,36 +0,0 @@
-//////////////////////////////////////////////////////////////////////////////
-//
-// (C) Copyright Ion Gaztanaga 2014-2015. Distributed under the Boost
-// 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.
-//
-//////////////////////////////////////////////////////////////////////////////
-#ifndef BOOST_MOVE_DETAIL_FORCE_CAST_HPP
-#define BOOST_MOVE_DETAIL_FORCE_CAST_HPP
-
-#ifndef BOOST_CONFIG_HPP
-#  include <boost/config.hpp>
-#endif
-
-#if defined(BOOST_HAS_PRAGMA_ONCE)
-#  pragma once
-#endif
-
-#include <boost/move/detail/workaround.hpp>
-
-namespace boost {
-namespace move_detail {
-
-
-template <typename T>
-BOOST_MOVE_FORCEINLINE T force_ptr(const volatile void *p)
-{
-   return static_cast<T>(const_cast<void*>(p));
-}
-
-}  //namespace move_detail {
-}  //namespace boost {
-
-#endif   //#ifndef BOOST_MOVE_DETAIL_FORCE_CAST_HPP
diff --git a/src/boost/move/detail/fwd_macros.hpp b/src/boost/move/detail/fwd_macros.hpp
deleted file mode 100644
index dcc4b07c..00000000
--- a/src/boost/move/detail/fwd_macros.hpp
+++ /dev/null
@@ -1,893 +0,0 @@
-//////////////////////////////////////////////////////////////////////////////
-//
-// (C) Copyright Ion Gaztanaga 2014-2014. Distributed under the Boost
-// 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.
-//
-//////////////////////////////////////////////////////////////////////////////
-
-#ifndef BOOST_MOVE_DETAIL_FWD_MACROS_HPP
-#define BOOST_MOVE_DETAIL_FWD_MACROS_HPP
-
-#ifndef BOOST_CONFIG_HPP
-#  include <boost/config.hpp>
-#endif
-#
-#if defined(BOOST_HAS_PRAGMA_ONCE)
-#  pragma once
-#endif
-
-#include <boost/move/detail/workaround.hpp>
-
-namespace boost {
-namespace move_detail {
-
-template <typename T> struct unvoid { typedef T type; };
-template <> struct unvoid<void> { struct type { }; };
-template <> struct unvoid<const void> { struct type { }; };
-
-}  //namespace move_detail {
-}  //namespace boost {
-
-#if !defined(BOOST_NO_CXX11_RVALUE_REFERENCES)
-
-#if defined(BOOST_MOVE_MSVC_10_MEMBER_RVALUE_REF_BUG)
-
-namespace boost {
-namespace move_detail {
-
-   template<class T>
-   struct mref;
-
-   template<class T>
-   struct mref<T &>
-   {
-      explicit mref(T &t) : t_(t){}
-      T &t_;
-      T & get() {  return t_;   }
-   };
-
-   template<class T>
-   struct mref
-   {
-      explicit mref(T &&t) : t_(t) {}
-      T &t_;
-      T &&get() {  return ::boost::move(t_);   }
-   };
-
-}  //namespace move_detail {
-}  //namespace boost {
-
-#endif   //BOOST_MOVE_MSVC_10_MEMBER_RVALUE_REF_BUG
-#endif   //!defined(BOOST_NO_CXX11_RVALUE_REFERENCES)
-
-//BOOST_MOVE_REPEATN(MACRO)
-#define BOOST_MOVE_REPEAT(x, MACRO)   BOOST_MOVE_REPEAT_I(x,MACRO)
-#define BOOST_MOVE_REPEAT_I(x, MACRO) BOOST_MOVE_REPEAT##x(MACRO)
-#define BOOST_MOVE_REPEAT0(MACRO)
-#define BOOST_MOVE_REPEAT1(MACRO)                              MACRO
-#define BOOST_MOVE_REPEAT2(MACRO)  BOOST_MOVE_REPEAT1(MACRO),  MACRO
-#define BOOST_MOVE_REPEAT3(MACRO)  BOOST_MOVE_REPEAT2(MACRO),  MACRO
-#define BOOST_MOVE_REPEAT4(MACRO)  BOOST_MOVE_REPEAT3(MACRO),  MACRO
-#define BOOST_MOVE_REPEAT5(MACRO)  BOOST_MOVE_REPEAT4(MACRO),  MACRO
-#define BOOST_MOVE_REPEAT6(MACRO)  BOOST_MOVE_REPEAT5(MACRO),  MACRO
-#define BOOST_MOVE_REPEAT7(MACRO)  BOOST_MOVE_REPEAT6(MACRO),  MACRO
-#define BOOST_MOVE_REPEAT8(MACRO)  BOOST_MOVE_REPEAT7(MACRO),  MACRO
-#define BOOST_MOVE_REPEAT9(MACRO)  BOOST_MOVE_REPEAT8(MACRO),  MACRO
-#define BOOST_MOVE_REPEAT10(MACRO) BOOST_MOVE_REPEAT9(MACRO),  MACRO
-#define BOOST_MOVE_REPEAT11(MACRO) BOOST_MOVE_REPEAT10(MACRO), MACRO
-#define BOOST_MOVE_REPEAT12(MACRO) BOOST_MOVE_REPEAT11(MACRO), MACRO
-#define BOOST_MOVE_REPEAT13(MACRO) BOOST_MOVE_REPEAT12(MACRO), MACRO
-
-//BOOST_MOVE_FWDN
-#define BOOST_MOVE_FWD0
-#define BOOST_MOVE_FWD1                  ::boost::forward<P0>(p0)
-#define BOOST_MOVE_FWD2 BOOST_MOVE_FWD1, ::boost::forward<P1>(p1)
-#define BOOST_MOVE_FWD3 BOOST_MOVE_FWD2, ::boost::forward<P2>(p2)
-#define BOOST_MOVE_FWD4 BOOST_MOVE_FWD3, ::boost::forward<P3>(p3)
-#define BOOST_MOVE_FWD5 BOOST_MOVE_FWD4, ::boost::forward<P4>(p4)
-#define BOOST_MOVE_FWD6 BOOST_MOVE_FWD5, ::boost::forward<P5>(p5)
-#define BOOST_MOVE_FWD7 BOOST_MOVE_FWD6, ::boost::forward<P6>(p6)
-#define BOOST_MOVE_FWD8 BOOST_MOVE_FWD7, ::boost::forward<P7>(p7)
-#define BOOST_MOVE_FWD9 BOOST_MOVE_FWD8, ::boost::forward<P8>(p8)
-
-//BOOST_MOVE_FWDQN
-#define BOOST_MOVE_FWDQ0
-#define BOOST_MOVE_FWDQ1                   ::boost::forward<Q0>(q0)
-#define BOOST_MOVE_FWDQ2 BOOST_MOVE_FWDQ1, ::boost::forward<Q1>(q1)
-#define BOOST_MOVE_FWDQ3 BOOST_MOVE_FWDQ2, ::boost::forward<Q2>(q2)
-#define BOOST_MOVE_FWDQ4 BOOST_MOVE_FWDQ3, ::boost::forward<Q3>(q3)
-#define BOOST_MOVE_FWDQ5 BOOST_MOVE_FWDQ4, ::boost::forward<Q4>(q4)
-#define BOOST_MOVE_FWDQ6 BOOST_MOVE_FWDQ5, ::boost::forward<Q5>(q5)
-#define BOOST_MOVE_FWDQ7 BOOST_MOVE_FWDQ6, ::boost::forward<Q6>(q6)
-#define BOOST_MOVE_FWDQ8 BOOST_MOVE_FWDQ7, ::boost::forward<Q7>(q7)
-#define BOOST_MOVE_FWDQ9 BOOST_MOVE_FWDQ8, ::boost::forward<Q8>(q8)
-
-//BOOST_MOVE_TMPL_GETN
-#define BOOST_MOVE_TMPL_GET0
-#define BOOST_MOVE_TMPL_GET1                       p.template get<0>()
-#define BOOST_MOVE_TMPL_GET2 BOOST_MOVE_TMPL_GET1, p.template get<1>()
-#define BOOST_MOVE_TMPL_GET3 BOOST_MOVE_TMPL_GET2, p.template get<2>()
-#define BOOST_MOVE_TMPL_GET4 BOOST_MOVE_TMPL_GET3, p.template get<3>()
-#define BOOST_MOVE_TMPL_GET5 BOOST_MOVE_TMPL_GET4, p.template get<4>()
-#define BOOST_MOVE_TMPL_GET6 BOOST_MOVE_TMPL_GET5, p.template get<5>()
-#define BOOST_MOVE_TMPL_GET7 BOOST_MOVE_TMPL_GET6, p.template get<6>()
-#define BOOST_MOVE_TMPL_GET8 BOOST_MOVE_TMPL_GET7, p.template get<7>()
-#define BOOST_MOVE_TMPL_GET9 BOOST_MOVE_TMPL_GET8, p.template get<8>()
-
-//BOOST_MOVE_TMPL_GETQN
-#define BOOST_MOVE_TMPL_GETQ0
-#define BOOST_MOVE_TMPL_GETQ1                        q.template get<0>()
-#define BOOST_MOVE_TMPL_GETQ2 BOOST_MOVE_TMPL_GETQ1, q.template get<1>()
-#define BOOST_MOVE_TMPL_GETQ3 BOOST_MOVE_TMPL_GETQ2, q.template get<2>()
-#define BOOST_MOVE_TMPL_GETQ4 BOOST_MOVE_TMPL_GETQ3, q.template get<3>()
-#define BOOST_MOVE_TMPL_GETQ5 BOOST_MOVE_TMPL_GETQ4, q.template get<4>()
-#define BOOST_MOVE_TMPL_GETQ6 BOOST_MOVE_TMPL_GETQ5, q.template get<5>()
-#define BOOST_MOVE_TMPL_GETQ7 BOOST_MOVE_TMPL_GETQ6, q.template get<6>()
-#define BOOST_MOVE_TMPL_GETQ8 BOOST_MOVE_TMPL_GETQ7, q.template get<7>()
-#define BOOST_MOVE_TMPL_GETQ9 BOOST_MOVE_TMPL_GETQ8, q.template get<8>()
-
-//BOOST_MOVE_GET_IDXN
-#define BOOST_MOVE_GET_IDX0
-#define BOOST_MOVE_GET_IDX1                      get<0>(p)
-#define BOOST_MOVE_GET_IDX2 BOOST_MOVE_GET_IDX1, get<1>(p)
-#define BOOST_MOVE_GET_IDX3 BOOST_MOVE_GET_IDX2, get<2>(p)
-#define BOOST_MOVE_GET_IDX4 BOOST_MOVE_GET_IDX3, get<3>(p)
-#define BOOST_MOVE_GET_IDX5 BOOST_MOVE_GET_IDX4, get<4>(p)
-#define BOOST_MOVE_GET_IDX6 BOOST_MOVE_GET_IDX5, get<5>(p)
-#define BOOST_MOVE_GET_IDX7 BOOST_MOVE_GET_IDX6, get<6>(p)
-#define BOOST_MOVE_GET_IDX8 BOOST_MOVE_GET_IDX7, get<7>(p)
-#define BOOST_MOVE_GET_IDX9 BOOST_MOVE_GET_IDX8, get<8>(p)
-
-//BOOST_MOVE_GET_IDXQN
-#define BOOST_MOVE_GET_IDXQ0
-#define BOOST_MOVE_GET_IDXQ1                       get<0>(q)
-#define BOOST_MOVE_GET_IDXQ2 BOOST_MOVE_GET_IDXQ1, get<1>(q)
-#define BOOST_MOVE_GET_IDXQ3 BOOST_MOVE_GET_IDXQ2, get<2>(q)
-#define BOOST_MOVE_GET_IDXQ4 BOOST_MOVE_GET_IDXQ3, get<3>(q)
-#define BOOST_MOVE_GET_IDXQ5 BOOST_MOVE_GET_IDXQ4, get<4>(q)
-#define BOOST_MOVE_GET_IDXQ6 BOOST_MOVE_GET_IDXQ5, get<5>(q)
-#define BOOST_MOVE_GET_IDXQ7 BOOST_MOVE_GET_IDXQ6, get<6>(q)
-#define BOOST_MOVE_GET_IDXQ8 BOOST_MOVE_GET_IDXQ7, get<7>(q)
-#define BOOST_MOVE_GET_IDXQ9 BOOST_MOVE_GET_IDXQ8, get<8>(q)
-
-//BOOST_MOVE_ARGN
-#define BOOST_MOVE_ARG0
-#define BOOST_MOVE_ARG1                  p0
-#define BOOST_MOVE_ARG2 BOOST_MOVE_ARG1, p1
-#define BOOST_MOVE_ARG3 BOOST_MOVE_ARG2, p2
-#define BOOST_MOVE_ARG4 BOOST_MOVE_ARG3, p3
-#define BOOST_MOVE_ARG5 BOOST_MOVE_ARG4, p4
-#define BOOST_MOVE_ARG6 BOOST_MOVE_ARG5, p5
-#define BOOST_MOVE_ARG7 BOOST_MOVE_ARG6, p6
-#define BOOST_MOVE_ARG8 BOOST_MOVE_ARG7, p7
-#define BOOST_MOVE_ARG9 BOOST_MOVE_ARG8, p8
-
-//BOOST_MOVE_ARGQN
-#define BOOST_MOVE_ARGQ0
-#define BOOST_MOVE_ARGQ1                   q0
-#define BOOST_MOVE_ARGQ2 BOOST_MOVE_ARGQ1, q1
-#define BOOST_MOVE_ARGQ3 BOOST_MOVE_ARGQ2, q2
-#define BOOST_MOVE_ARGQ4 BOOST_MOVE_ARGQ3, q3
-#define BOOST_MOVE_ARGQ5 BOOST_MOVE_ARGQ4, q4
-#define BOOST_MOVE_ARGQ6 BOOST_MOVE_ARGQ5, q5
-#define BOOST_MOVE_ARGQ7 BOOST_MOVE_ARGQ6, q6
-#define BOOST_MOVE_ARGQ8 BOOST_MOVE_ARGQ7, q7
-#define BOOST_MOVE_ARGQ9 BOOST_MOVE_ARGQ8, q8
-
-//BOOST_MOVE_DECLVALN
-#define BOOST_MOVE_DECLVAL0
-#define BOOST_MOVE_DECLVAL1                      ::boost::move_detail::declval<P0>()
-#define BOOST_MOVE_DECLVAL2 BOOST_MOVE_DECLVAL1, ::boost::move_detail::declval<P1>()
-#define BOOST_MOVE_DECLVAL3 BOOST_MOVE_DECLVAL2, ::boost::move_detail::declval<P2>()
-#define BOOST_MOVE_DECLVAL4 BOOST_MOVE_DECLVAL3, ::boost::move_detail::declval<P3>()
-#define BOOST_MOVE_DECLVAL5 BOOST_MOVE_DECLVAL4, ::boost::move_detail::declval<P4>()
-#define BOOST_MOVE_DECLVAL6 BOOST_MOVE_DECLVAL5, ::boost::move_detail::declval<P5>()
-#define BOOST_MOVE_DECLVAL7 BOOST_MOVE_DECLVAL6, ::boost::move_detail::declval<P6>()
-#define BOOST_MOVE_DECLVAL8 BOOST_MOVE_DECLVAL7, ::boost::move_detail::declval<P7>()
-#define BOOST_MOVE_DECLVAL9 BOOST_MOVE_DECLVAL8, ::boost::move_detail::declval<P8>()
-
-//BOOST_MOVE_DECLVALQN
-#define BOOST_MOVE_DECLVALQ0
-#define BOOST_MOVE_DECLVALQ1                       ::boost::move_detail::declval<Q0>()
-#define BOOST_MOVE_DECLVALQ2 BOOST_MOVE_DECLVALQ1, ::boost::move_detail::declval<Q1>()
-#define BOOST_MOVE_DECLVALQ3 BOOST_MOVE_DECLVALQ2, ::boost::move_detail::declval<Q2>()
-#define BOOST_MOVE_DECLVALQ4 BOOST_MOVE_DECLVALQ3, ::boost::move_detail::declval<Q3>()
-#define BOOST_MOVE_DECLVALQ5 BOOST_MOVE_DECLVALQ4, ::boost::move_detail::declval<Q4>()
-#define BOOST_MOVE_DECLVALQ6 BOOST_MOVE_DECLVALQ5, ::boost::move_detail::declval<Q5>()
-#define BOOST_MOVE_DECLVALQ7 BOOST_MOVE_DECLVALQ6, ::boost::move_detail::declval<Q6>()
-#define BOOST_MOVE_DECLVALQ8 BOOST_MOVE_DECLVALQ7, ::boost::move_detail::declval<Q7>()
-#define BOOST_MOVE_DECLVALQ9 BOOST_MOVE_DECLVALQ8, ::boost::move_detail::declval<Q8>()
-
-#ifdef BOOST_MOVE_MSVC_10_MEMBER_RVALUE_REF_BUG
-   #define BOOST_MOVE_MREF(T)    ::boost::move_detail::mref<T>
-   #define BOOST_MOVE_MFWD(N)    ::boost::forward<P##N>(this->m_p##N.get())
-   #define BOOST_MOVE_MFWDQ(N)   ::boost::forward<Q##N>(this->m_q##N.get())
-#else
-   #define BOOST_MOVE_MREF(T)    BOOST_FWD_REF(T)
-   #define BOOST_MOVE_MFWD(N)    ::boost::forward<P##N>(this->m_p##N)
-   #define BOOST_MOVE_MFWDQ(N)   ::boost::forward<Q##N>(this->m_q##N)
-#endif
-#define BOOST_MOVE_MITFWD(N)  *this->m_p##N
-#define BOOST_MOVE_MINC(N)    ++this->m_p##N
-#define BOOST_MOVE_MITFWDQ(N) *this->m_q##N
-#define BOOST_MOVE_MINCQ(N)   ++this->m_q##N
-
-
-//BOOST_MOVE_MFWDN
-#define BOOST_MOVE_MFWD0
-#define BOOST_MOVE_MFWD1                   BOOST_MOVE_MFWD(0)
-#define BOOST_MOVE_MFWD2 BOOST_MOVE_MFWD1, BOOST_MOVE_MFWD(1)
-#define BOOST_MOVE_MFWD3 BOOST_MOVE_MFWD2, BOOST_MOVE_MFWD(2)
-#define BOOST_MOVE_MFWD4 BOOST_MOVE_MFWD3, BOOST_MOVE_MFWD(3)
-#define BOOST_MOVE_MFWD5 BOOST_MOVE_MFWD4, BOOST_MOVE_MFWD(4)
-#define BOOST_MOVE_MFWD6 BOOST_MOVE_MFWD5, BOOST_MOVE_MFWD(5)
-#define BOOST_MOVE_MFWD7 BOOST_MOVE_MFWD6, BOOST_MOVE_MFWD(6)
-#define BOOST_MOVE_MFWD8 BOOST_MOVE_MFWD7, BOOST_MOVE_MFWD(7)
-#define BOOST_MOVE_MFWD9 BOOST_MOVE_MFWD8, BOOST_MOVE_MFWD(8)
-
-//BOOST_MOVE_MFWDN
-#define BOOST_MOVE_MFWDQ0
-#define BOOST_MOVE_MFWDQ1                    BOOST_MOVE_MFWDQ(0)
-#define BOOST_MOVE_MFWDQ2 BOOST_MOVE_MFWDQ1, BOOST_MOVE_MFWDQ(1)
-#define BOOST_MOVE_MFWDQ3 BOOST_MOVE_MFWDQ2, BOOST_MOVE_MFWDQ(2)
-#define BOOST_MOVE_MFWDQ4 BOOST_MOVE_MFWDQ3, BOOST_MOVE_MFWDQ(3)
-#define BOOST_MOVE_MFWDQ5 BOOST_MOVE_MFWDQ4, BOOST_MOVE_MFWDQ(4)
-#define BOOST_MOVE_MFWDQ6 BOOST_MOVE_MFWDQ5, BOOST_MOVE_MFWDQ(5)
-#define BOOST_MOVE_MFWDQ7 BOOST_MOVE_MFWDQ6, BOOST_MOVE_MFWDQ(6)
-#define BOOST_MOVE_MFWDQ8 BOOST_MOVE_MFWDQ7, BOOST_MOVE_MFWDQ(7)
-#define BOOST_MOVE_MFWDQ9 BOOST_MOVE_MFWDQ8, BOOST_MOVE_MFWDQ(8)
-
-//BOOST_MOVE_MINCN
-#define BOOST_MOVE_MINC0
-#define BOOST_MOVE_MINC1                   BOOST_MOVE_MINC(0)
-#define BOOST_MOVE_MINC2 BOOST_MOVE_MINC1, BOOST_MOVE_MINC(1)
-#define BOOST_MOVE_MINC3 BOOST_MOVE_MINC2, BOOST_MOVE_MINC(2)
-#define BOOST_MOVE_MINC4 BOOST_MOVE_MINC3, BOOST_MOVE_MINC(3)
-#define BOOST_MOVE_MINC5 BOOST_MOVE_MINC4, BOOST_MOVE_MINC(4)
-#define BOOST_MOVE_MINC6 BOOST_MOVE_MINC5, BOOST_MOVE_MINC(5)
-#define BOOST_MOVE_MINC7 BOOST_MOVE_MINC6, BOOST_MOVE_MINC(6)
-#define BOOST_MOVE_MINC8 BOOST_MOVE_MINC7, BOOST_MOVE_MINC(7)
-#define BOOST_MOVE_MINC9 BOOST_MOVE_MINC8, BOOST_MOVE_MINC(8)
-
-//BOOST_MOVE_MINCQN
-#define BOOST_MOVE_MINCQ0
-#define BOOST_MOVE_MINCQ1                    BOOST_MOVE_MINCQ(0)
-#define BOOST_MOVE_MINCQ2 BOOST_MOVE_MINCQ1, BOOST_MOVE_MINCQ(1)
-#define BOOST_MOVE_MINCQ3 BOOST_MOVE_MINCQ2, BOOST_MOVE_MINCQ(2)
-#define BOOST_MOVE_MINCQ4 BOOST_MOVE_MINCQ3, BOOST_MOVE_MINCQ(3)
-#define BOOST_MOVE_MINCQ5 BOOST_MOVE_MINCQ4, BOOST_MOVE_MINCQ(4)
-#define BOOST_MOVE_MINCQ6 BOOST_MOVE_MINCQ5, BOOST_MOVE_MINCQ(5)
-#define BOOST_MOVE_MINCQ7 BOOST_MOVE_MINCQ6, BOOST_MOVE_MINCQ(6)
-#define BOOST_MOVE_MINCQ8 BOOST_MOVE_MINCQ7, BOOST_MOVE_MINCQ(7)
-#define BOOST_MOVE_MINCQ9 BOOST_MOVE_MINCQ8, BOOST_MOVE_MINCQ(8)
-
-//BOOST_MOVE_MITFWDN
-#define BOOST_MOVE_MITFWD0
-#define BOOST_MOVE_MITFWD1                     BOOST_MOVE_MITFWD(0)
-#define BOOST_MOVE_MITFWD2 BOOST_MOVE_MITFWD1, BOOST_MOVE_MITFWD(1)
-#define BOOST_MOVE_MITFWD3 BOOST_MOVE_MITFWD2, BOOST_MOVE_MITFWD(2)
-#define BOOST_MOVE_MITFWD4 BOOST_MOVE_MITFWD3, BOOST_MOVE_MITFWD(3)
-#define BOOST_MOVE_MITFWD5 BOOST_MOVE_MITFWD4, BOOST_MOVE_MITFWD(4)
-#define BOOST_MOVE_MITFWD6 BOOST_MOVE_MITFWD5, BOOST_MOVE_MITFWD(5)
-#define BOOST_MOVE_MITFWD7 BOOST_MOVE_MITFWD6, BOOST_MOVE_MITFWD(6)
-#define BOOST_MOVE_MITFWD8 BOOST_MOVE_MITFWD7, BOOST_MOVE_MITFWD(7)
-#define BOOST_MOVE_MITFWD9 BOOST_MOVE_MITFWD8, BOOST_MOVE_MITFWD(8)
-
-//BOOST_MOVE_MITFWDQN
-#define BOOST_MOVE_MITFWDQ0
-#define BOOST_MOVE_MITFWDQ1                      BOOST_MOVE_MITFWDQ(0)
-#define BOOST_MOVE_MITFWDQ2 BOOST_MOVE_MITFWDQ1, BOOST_MOVE_MITFWDQ(1)
-#define BOOST_MOVE_MITFWDQ3 BOOST_MOVE_MITFWDQ2, BOOST_MOVE_MITFWDQ(2)
-#define BOOST_MOVE_MITFWDQ4 BOOST_MOVE_MITFWDQ3, BOOST_MOVE_MITFWDQ(3)
-#define BOOST_MOVE_MITFWDQ5 BOOST_MOVE_MITFWDQ4, BOOST_MOVE_MITFWDQ(4)
-#define BOOST_MOVE_MITFWDQ6 BOOST_MOVE_MITFWDQ5, BOOST_MOVE_MITFWDQ(5)
-#define BOOST_MOVE_MITFWDQ7 BOOST_MOVE_MITFWDQ6, BOOST_MOVE_MITFWDQ(6)
-#define BOOST_MOVE_MITFWDQ8 BOOST_MOVE_MITFWDQ7, BOOST_MOVE_MITFWDQ(7)
-#define BOOST_MOVE_MITFWDQ9 BOOST_MOVE_MITFWDQ8, BOOST_MOVE_MITFWDQ(8)
-
-//BOOST_MOVE_FWD_INITN
-#define BOOST_MOVE_FWD_INIT0
-#define BOOST_MOVE_FWD_INIT1                       m_p0(::boost::forward<P0>(p0))
-#define BOOST_MOVE_FWD_INIT2 BOOST_MOVE_FWD_INIT1, m_p1(::boost::forward<P1>(p1))
-#define BOOST_MOVE_FWD_INIT3 BOOST_MOVE_FWD_INIT2, m_p2(::boost::forward<P2>(p2))
-#define BOOST_MOVE_FWD_INIT4 BOOST_MOVE_FWD_INIT3, m_p3(::boost::forward<P3>(p3))
-#define BOOST_MOVE_FWD_INIT5 BOOST_MOVE_FWD_INIT4, m_p4(::boost::forward<P4>(p4))
-#define BOOST_MOVE_FWD_INIT6 BOOST_MOVE_FWD_INIT5, m_p5(::boost::forward<P5>(p5))
-#define BOOST_MOVE_FWD_INIT7 BOOST_MOVE_FWD_INIT6, m_p6(::boost::forward<P6>(p6))
-#define BOOST_MOVE_FWD_INIT8 BOOST_MOVE_FWD_INIT7, m_p7(::boost::forward<P7>(p7))
-#define BOOST_MOVE_FWD_INIT9 BOOST_MOVE_FWD_INIT8, m_p8(::boost::forward<P8>(p8))
-
-//BOOST_MOVE_FWD_INITQN
-#define BOOST_MOVE_FWD_INITQ0
-#define BOOST_MOVE_FWD_INITQ1                        m_q0(::boost::forward<Q0>(q0))
-#define BOOST_MOVE_FWD_INITQ2 BOOST_MOVE_FWD_INITQ1, m_q1(::boost::forward<Q1>(q1))
-#define BOOST_MOVE_FWD_INITQ3 BOOST_MOVE_FWD_INITQ2, m_q2(::boost::forward<Q2>(q2))
-#define BOOST_MOVE_FWD_INITQ4 BOOST_MOVE_FWD_INITQ3, m_q3(::boost::forward<Q3>(q3))
-#define BOOST_MOVE_FWD_INITQ5 BOOST_MOVE_FWD_INITQ4, m_q4(::boost::forward<Q4>(q4))
-#define BOOST_MOVE_FWD_INITQ6 BOOST_MOVE_FWD_INITQ5, m_q5(::boost::forward<Q5>(q5))
-#define BOOST_MOVE_FWD_INITQ7 BOOST_MOVE_FWD_INITQ6, m_q6(::boost::forward<Q6>(q6))
-#define BOOST_MOVE_FWD_INITQ8 BOOST_MOVE_FWD_INITQ7, m_q7(::boost::forward<Q7>(q7))
-#define BOOST_MOVE_FWD_INITQ9 BOOST_MOVE_FWD_INITQ8, m_q8(::boost::forward<Q8>(q8))
-
-//BOOST_MOVE_VAL_INITN
-#define BOOST_MOVE_VAL_INIT0
-#define BOOST_MOVE_VAL_INIT1                       m_p0(p0)
-#define BOOST_MOVE_VAL_INIT2 BOOST_MOVE_VAL_INIT1, m_p1(p1)
-#define BOOST_MOVE_VAL_INIT3 BOOST_MOVE_VAL_INIT2, m_p2(p2)
-#define BOOST_MOVE_VAL_INIT4 BOOST_MOVE_VAL_INIT3, m_p3(p3)
-#define BOOST_MOVE_VAL_INIT5 BOOST_MOVE_VAL_INIT4, m_p4(p4)
-#define BOOST_MOVE_VAL_INIT6 BOOST_MOVE_VAL_INIT5, m_p5(p5)
-#define BOOST_MOVE_VAL_INIT7 BOOST_MOVE_VAL_INIT6, m_p6(p6)
-#define BOOST_MOVE_VAL_INIT8 BOOST_MOVE_VAL_INIT7, m_p7(p7)
-#define BOOST_MOVE_VAL_INIT9 BOOST_MOVE_VAL_INIT8, m_p8(p8)
-
-//BOOST_MOVE_VAL_INITQN
-#define BOOST_MOVE_VAL_INITQ0
-#define BOOST_MOVE_VAL_INITQ1                        m_q0(q0)
-#define BOOST_MOVE_VAL_INITQ2 BOOST_MOVE_VAL_INITQ1, m_q1(q1)
-#define BOOST_MOVE_VAL_INITQ3 BOOST_MOVE_VAL_INITQ2, m_q2(q2)
-#define BOOST_MOVE_VAL_INITQ4 BOOST_MOVE_VAL_INITQ3, m_q3(q3)
-#define BOOST_MOVE_VAL_INITQ5 BOOST_MOVE_VAL_INITQ4, m_q4(q4)
-#define BOOST_MOVE_VAL_INITQ6 BOOST_MOVE_VAL_INITQ5, m_q5(q5)
-#define BOOST_MOVE_VAL_INITQ7 BOOST_MOVE_VAL_INITQ6, m_q6(q6)
-#define BOOST_MOVE_VAL_INITQ8 BOOST_MOVE_VAL_INITQ7, m_q7(q7)
-#define BOOST_MOVE_VAL_INITQ9 BOOST_MOVE_VAL_INITQ8, m_q8(q8)
-
-//BOOST_MOVE_UREFANONN
-#define BOOST_MOVE_UREFANON0
-#define BOOST_MOVE_UREFANON1                       BOOST_FWD_REF(P0)
-#define BOOST_MOVE_UREFANON2 BOOST_MOVE_UREFANON1, BOOST_FWD_REF(P1)
-#define BOOST_MOVE_UREFANON3 BOOST_MOVE_UREFANON2, BOOST_FWD_REF(P2)
-#define BOOST_MOVE_UREFANON4 BOOST_MOVE_UREFANON3, BOOST_FWD_REF(P3)
-#define BOOST_MOVE_UREFANON5 BOOST_MOVE_UREFANON4, BOOST_FWD_REF(P4)
-#define BOOST_MOVE_UREFANON6 BOOST_MOVE_UREFANON5, BOOST_FWD_REF(P5)
-#define BOOST_MOVE_UREFANON7 BOOST_MOVE_UREFANON6, BOOST_FWD_REF(P6)
-#define BOOST_MOVE_UREFANON8 BOOST_MOVE_UREFANON7, BOOST_FWD_REF(P7)
-#define BOOST_MOVE_UREFANON9 BOOST_MOVE_UREFANON8, BOOST_FWD_REF(P8)
-
-//BOOST_MOVE_UREFN
-#define BOOST_MOVE_UREF0
-#define BOOST_MOVE_UREF1                   BOOST_FWD_REF(P0) p0
-#define BOOST_MOVE_UREF2 BOOST_MOVE_UREF1, BOOST_FWD_REF(P1) p1
-#define BOOST_MOVE_UREF3 BOOST_MOVE_UREF2, BOOST_FWD_REF(P2) p2
-#define BOOST_MOVE_UREF4 BOOST_MOVE_UREF3, BOOST_FWD_REF(P3) p3
-#define BOOST_MOVE_UREF5 BOOST_MOVE_UREF4, BOOST_FWD_REF(P4) p4
-#define BOOST_MOVE_UREF6 BOOST_MOVE_UREF5, BOOST_FWD_REF(P5) p5
-#define BOOST_MOVE_UREF7 BOOST_MOVE_UREF6, BOOST_FWD_REF(P6) p6
-#define BOOST_MOVE_UREF8 BOOST_MOVE_UREF7, BOOST_FWD_REF(P7) p7
-#define BOOST_MOVE_UREF9 BOOST_MOVE_UREF8, BOOST_FWD_REF(P8) p8
-
-//BOOST_MOVE_UREFQN
-#define BOOST_MOVE_UREFQ0
-#define BOOST_MOVE_UREFQ1                    BOOST_FWD_REF(Q0) q0
-#define BOOST_MOVE_UREFQ2 BOOST_MOVE_UREFQ1, BOOST_FWD_REF(Q1) q1
-#define BOOST_MOVE_UREFQ3 BOOST_MOVE_UREFQ2, BOOST_FWD_REF(Q2) q2
-#define BOOST_MOVE_UREFQ4 BOOST_MOVE_UREFQ3, BOOST_FWD_REF(Q3) q3
-#define BOOST_MOVE_UREFQ5 BOOST_MOVE_UREFQ4, BOOST_FWD_REF(Q4) q4
-#define BOOST_MOVE_UREFQ6 BOOST_MOVE_UREFQ5, BOOST_FWD_REF(Q5) q5
-#define BOOST_MOVE_UREFQ7 BOOST_MOVE_UREFQ6, BOOST_FWD_REF(Q6) q6
-#define BOOST_MOVE_UREFQ8 BOOST_MOVE_UREFQ7, BOOST_FWD_REF(Q7) q7
-#define BOOST_MOVE_UREFQ9 BOOST_MOVE_UREFQ8, BOOST_FWD_REF(Q8) q8
-
-//BOOST_MOVE_VALN
-#define BOOST_MOVE_VAL0
-#define BOOST_MOVE_VAL1                  BOOST_FWD_REF(P0) p0
-#define BOOST_MOVE_VAL2 BOOST_MOVE_VAL1, BOOST_FWD_REF(P1) p1
-#define BOOST_MOVE_VAL3 BOOST_MOVE_VAL2, BOOST_FWD_REF(P2) p2
-#define BOOST_MOVE_VAL4 BOOST_MOVE_VAL3, BOOST_FWD_REF(P3) p3
-#define BOOST_MOVE_VAL5 BOOST_MOVE_VAL4, BOOST_FWD_REF(P4) p4
-#define BOOST_MOVE_VAL6 BOOST_MOVE_VAL5, BOOST_FWD_REF(P5) p5
-#define BOOST_MOVE_VAL7 BOOST_MOVE_VAL6, BOOST_FWD_REF(P6) p6
-#define BOOST_MOVE_VAL8 BOOST_MOVE_VAL7, BOOST_FWD_REF(P7) p7
-#define BOOST_MOVE_VAL9 BOOST_MOVE_VAL8, BOOST_FWD_REF(P8) p8
-
-//BOOST_MOVE_VALQN
-#define BOOST_MOVE_VALQ0
-#define BOOST_MOVE_VALQ1                   BOOST_FWD_REF(Q0) q0
-#define BOOST_MOVE_VALQ2 BOOST_MOVE_VALQ1, BOOST_FWD_REF(Q1) q1
-#define BOOST_MOVE_VALQ3 BOOST_MOVE_VALQ2, BOOST_FWD_REF(Q2) q2
-#define BOOST_MOVE_VALQ4 BOOST_MOVE_VALQ3, BOOST_FWD_REF(Q3) q3
-#define BOOST_MOVE_VALQ5 BOOST_MOVE_VALQ4, BOOST_FWD_REF(Q4) q4
-#define BOOST_MOVE_VALQ6 BOOST_MOVE_VALQ5, BOOST_FWD_REF(Q5) q5
-#define BOOST_MOVE_VALQ7 BOOST_MOVE_VALQ6, BOOST_FWD_REF(Q6) q6
-#define BOOST_MOVE_VALQ8 BOOST_MOVE_VALQ7, BOOST_FWD_REF(Q7) q7
-#define BOOST_MOVE_VALQ9 BOOST_MOVE_VALQ8, BOOST_FWD_REF(Q8) q8
-
-
-#define BOOST_MOVE_UNVOIDCREF(T) const typename boost::move_detail::unvoid<T>::type&
-//BOOST_MOVE_CREFN
-#define BOOST_MOVE_CREF0
-#define BOOST_MOVE_CREF1                   BOOST_MOVE_UNVOIDCREF(P0) p0
-#define BOOST_MOVE_CREF2 BOOST_MOVE_CREF1, BOOST_MOVE_UNVOIDCREF(P1) p1
-#define BOOST_MOVE_CREF3 BOOST_MOVE_CREF2, BOOST_MOVE_UNVOIDCREF(P2) p2
-#define BOOST_MOVE_CREF4 BOOST_MOVE_CREF3, BOOST_MOVE_UNVOIDCREF(P3) p3
-#define BOOST_MOVE_CREF5 BOOST_MOVE_CREF4, BOOST_MOVE_UNVOIDCREF(P4) p4
-#define BOOST_MOVE_CREF6 BOOST_MOVE_CREF5, BOOST_MOVE_UNVOIDCREF(P5) p5
-#define BOOST_MOVE_CREF7 BOOST_MOVE_CREF6, BOOST_MOVE_UNVOIDCREF(P6) p6
-#define BOOST_MOVE_CREF8 BOOST_MOVE_CREF7, BOOST_MOVE_UNVOIDCREF(P7) p7
-#define BOOST_MOVE_CREF9 BOOST_MOVE_CREF8, BOOST_MOVE_UNVOIDCREF(P8) p8
-
-//BOOST_MOVE_CREFQN
-#define BOOST_MOVE_CREFQ0
-#define BOOST_MOVE_CREFQ1                    BOOST_MOVE_UNVOIDCREF(Q0) q0
-#define BOOST_MOVE_CREFQ2 BOOST_MOVE_CREFQ1, BOOST_MOVE_UNVOIDCREF(Q1) q1
-#define BOOST_MOVE_CREFQ3 BOOST_MOVE_CREFQ2, BOOST_MOVE_UNVOIDCREF(Q2) q2
-#define BOOST_MOVE_CREFQ4 BOOST_MOVE_CREFQ3, BOOST_MOVE_UNVOIDCREF(Q3) q3
-#define BOOST_MOVE_CREFQ5 BOOST_MOVE_CREFQ4, BOOST_MOVE_UNVOIDCREF(Q4) q4
-#define BOOST_MOVE_CREFQ6 BOOST_MOVE_CREFQ5, BOOST_MOVE_UNVOIDCREF(Q5) q5
-#define BOOST_MOVE_CREFQ7 BOOST_MOVE_CREFQ6, BOOST_MOVE_UNVOIDCREF(Q6) q6
-#define BOOST_MOVE_CREFQ8 BOOST_MOVE_CREFQ7, BOOST_MOVE_UNVOIDCREF(Q7) q7
-#define BOOST_MOVE_CREFQ9 BOOST_MOVE_CREFQ8, BOOST_MOVE_UNVOIDCREF(Q8) q8
-
-//BOOST_MOVE_CLASSN
-#define BOOST_MOVE_CLASS0
-#define BOOST_MOVE_CLASS1                    class P0
-#define BOOST_MOVE_CLASS2 BOOST_MOVE_CLASS1, class P1
-#define BOOST_MOVE_CLASS3 BOOST_MOVE_CLASS2, class P2
-#define BOOST_MOVE_CLASS4 BOOST_MOVE_CLASS3, class P3
-#define BOOST_MOVE_CLASS5 BOOST_MOVE_CLASS4, class P4
-#define BOOST_MOVE_CLASS6 BOOST_MOVE_CLASS5, class P5
-#define BOOST_MOVE_CLASS7 BOOST_MOVE_CLASS6, class P6
-#define BOOST_MOVE_CLASS8 BOOST_MOVE_CLASS7, class P7
-#define BOOST_MOVE_CLASS9 BOOST_MOVE_CLASS8, class P8
-
-//BOOST_MOVE_CLASSQN
-#define BOOST_MOVE_CLASSQ0
-#define BOOST_MOVE_CLASSQ1                     class Q0
-#define BOOST_MOVE_CLASSQ2 BOOST_MOVE_CLASSQ1, class Q1
-#define BOOST_MOVE_CLASSQ3 BOOST_MOVE_CLASSQ2, class Q2
-#define BOOST_MOVE_CLASSQ4 BOOST_MOVE_CLASSQ3, class Q3
-#define BOOST_MOVE_CLASSQ5 BOOST_MOVE_CLASSQ4, class Q4
-#define BOOST_MOVE_CLASSQ6 BOOST_MOVE_CLASSQ5, class Q5
-#define BOOST_MOVE_CLASSQ7 BOOST_MOVE_CLASSQ6, class Q6
-#define BOOST_MOVE_CLASSQ8 BOOST_MOVE_CLASSQ7, class Q7
-#define BOOST_MOVE_CLASSQ9 BOOST_MOVE_CLASSQ8, class Q8
-
-//BOOST_MOVE_CLASSDFLTN
-#define BOOST_MOVE_CLASSDFLT0
-#define BOOST_MOVE_CLASSDFLT1                        class P0 = void
-#define BOOST_MOVE_CLASSDFLT2 BOOST_MOVE_CLASSDFLT1, class P1 = void
-#define BOOST_MOVE_CLASSDFLT3 BOOST_MOVE_CLASSDFLT2, class P2 = void
-#define BOOST_MOVE_CLASSDFLT4 BOOST_MOVE_CLASSDFLT3, class P3 = void
-#define BOOST_MOVE_CLASSDFLT5 BOOST_MOVE_CLASSDFLT4, class P4 = void
-#define BOOST_MOVE_CLASSDFLT6 BOOST_MOVE_CLASSDFLT5, class P5 = void
-#define BOOST_MOVE_CLASSDFLT7 BOOST_MOVE_CLASSDFLT6, class P6 = void
-#define BOOST_MOVE_CLASSDFLT8 BOOST_MOVE_CLASSDFLT7, class P7 = void
-#define BOOST_MOVE_CLASSDFLT9 BOOST_MOVE_CLASSDFLT8, class P8 = void
-
-//BOOST_MOVE_CLASSDFLTQN
-#define BOOST_MOVE_CLASSDFLTQ0
-#define BOOST_MOVE_CLASSDFLTQ1                         class Q0 = void
-#define BOOST_MOVE_CLASSDFLTQ2 BOOST_MOVE_CLASSDFLTQ1, class Q1 = void
-#define BOOST_MOVE_CLASSDFLTQ3 BOOST_MOVE_CLASSDFLTQ2, class Q2 = void
-#define BOOST_MOVE_CLASSDFLTQ4 BOOST_MOVE_CLASSDFLTQ3, class Q3 = void
-#define BOOST_MOVE_CLASSDFLTQ5 BOOST_MOVE_CLASSDFLTQ4, class Q4 = void
-#define BOOST_MOVE_CLASSDFLTQ6 BOOST_MOVE_CLASSDFLTQ5, class Q5 = void
-#define BOOST_MOVE_CLASSDFLTQ7 BOOST_MOVE_CLASSDFLTQ6, class Q6 = void
-#define BOOST_MOVE_CLASSDFLTQ8 BOOST_MOVE_CLASSDFLTQ7, class Q7 = void
-#define BOOST_MOVE_CLASSDFLTQ9 BOOST_MOVE_CLASSDFLTQ8, class Q8 = void
-
-//BOOST_MOVE_LAST_TARGN
-#define BOOST_MOVE_LAST_TARG0 void
-#define BOOST_MOVE_LAST_TARG1 P0
-#define BOOST_MOVE_LAST_TARG2 P1
-#define BOOST_MOVE_LAST_TARG3 P2
-#define BOOST_MOVE_LAST_TARG4 P3
-#define BOOST_MOVE_LAST_TARG5 P4
-#define BOOST_MOVE_LAST_TARG6 P5
-#define BOOST_MOVE_LAST_TARG7 P6
-#define BOOST_MOVE_LAST_TARG8 P7
-#define BOOST_MOVE_LAST_TARG9 P8
-
-//BOOST_MOVE_LAST_TARGQN
-#define BOOST_MOVE_LAST_TARGQ0 void
-#define BOOST_MOVE_LAST_TARGQ1 Q0
-#define BOOST_MOVE_LAST_TARGQ2 Q1
-#define BOOST_MOVE_LAST_TARGQ3 Q2
-#define BOOST_MOVE_LAST_TARGQ4 Q3
-#define BOOST_MOVE_LAST_TARGQ5 Q4
-#define BOOST_MOVE_LAST_TARGQ6 Q5
-#define BOOST_MOVE_LAST_TARGQ7 Q6
-#define BOOST_MOVE_LAST_TARGQ8 Q7
-#define BOOST_MOVE_LAST_TARGQ9 Q8
-
-
-//BOOST_MOVE_TARGN
-#define BOOST_MOVE_TARG0
-#define BOOST_MOVE_TARG1                   P0
-#define BOOST_MOVE_TARG2 BOOST_MOVE_TARG1, P1
-#define BOOST_MOVE_TARG3 BOOST_MOVE_TARG2, P2
-#define BOOST_MOVE_TARG4 BOOST_MOVE_TARG3, P3
-#define BOOST_MOVE_TARG5 BOOST_MOVE_TARG4, P4
-#define BOOST_MOVE_TARG6 BOOST_MOVE_TARG5, P5
-#define BOOST_MOVE_TARG7 BOOST_MOVE_TARG6, P6
-#define BOOST_MOVE_TARG8 BOOST_MOVE_TARG7, P7
-#define BOOST_MOVE_TARG9 BOOST_MOVE_TARG8, P8
-
-//BOOST_MOVE_TARGQN
-#define BOOST_MOVE_TARGQ0
-#define BOOST_MOVE_TARGQ1                    Q0
-#define BOOST_MOVE_TARGQ2 BOOST_MOVE_TARGQ1, Q1
-#define BOOST_MOVE_TARGQ3 BOOST_MOVE_TARGQ2, Q2
-#define BOOST_MOVE_TARGQ4 BOOST_MOVE_TARGQ3, Q3
-#define BOOST_MOVE_TARGQ5 BOOST_MOVE_TARGQ4, Q4
-#define BOOST_MOVE_TARGQ6 BOOST_MOVE_TARGQ5, Q5
-#define BOOST_MOVE_TARGQ7 BOOST_MOVE_TARGQ6, Q6
-#define BOOST_MOVE_TARGQ8 BOOST_MOVE_TARGQ7, Q7
-#define BOOST_MOVE_TARGQ9 BOOST_MOVE_TARGQ8, Q8
-
-//BOOST_MOVE_FWD_TN
-#define BOOST_MOVE_FWD_T0
-#define BOOST_MOVE_FWD_T1                    typename ::boost::move_detail::forward_type<P0>::type
-#define BOOST_MOVE_FWD_T2 BOOST_MOVE_FWD_T1, typename ::boost::move_detail::forward_type<P1>::type
-#define BOOST_MOVE_FWD_T3 BOOST_MOVE_FWD_T2, typename ::boost::move_detail::forward_type<P2>::type
-#define BOOST_MOVE_FWD_T4 BOOST_MOVE_FWD_T3, typename ::boost::move_detail::forward_type<P3>::type
-#define BOOST_MOVE_FWD_T5 BOOST_MOVE_FWD_T4, typename ::boost::move_detail::forward_type<P4>::type
-#define BOOST_MOVE_FWD_T6 BOOST_MOVE_FWD_T5, typename ::boost::move_detail::forward_type<P5>::type
-#define BOOST_MOVE_FWD_T7 BOOST_MOVE_FWD_T6, typename ::boost::move_detail::forward_type<P6>::type
-#define BOOST_MOVE_FWD_T8 BOOST_MOVE_FWD_T7, typename ::boost::move_detail::forward_type<P7>::type
-#define BOOST_MOVE_FWD_T9 BOOST_MOVE_FWD_T8, typename ::boost::move_detail::forward_type<P8>::type
-
-//BOOST_MOVE_FWD_TQN
-#define BOOST_MOVE_FWD_TQ0
-#define BOOST_MOVE_FWD_TQ1                     typename ::boost::move_detail::forward_type<Q0>::type
-#define BOOST_MOVE_FWD_TQ2 BOOST_MOVE_FWD_TQ1, typename ::boost::move_detail::forward_type<Q1>::type
-#define BOOST_MOVE_FWD_TQ3 BOOST_MOVE_FWD_TQ2, typename ::boost::move_detail::forward_type<Q2>::type
-#define BOOST_MOVE_FWD_TQ4 BOOST_MOVE_FWD_TQ3, typename ::boost::move_detail::forward_type<Q3>::type
-#define BOOST_MOVE_FWD_TQ5 BOOST_MOVE_FWD_TQ4, typename ::boost::move_detail::forward_type<Q4>::type
-#define BOOST_MOVE_FWD_TQ6 BOOST_MOVE_FWD_TQ5, typename ::boost::move_detail::forward_type<Q5>::type
-#define BOOST_MOVE_FWD_TQ7 BOOST_MOVE_FWD_TQ6, typename ::boost::move_detail::forward_type<Q6>::type
-#define BOOST_MOVE_FWD_TQ8 BOOST_MOVE_FWD_TQ7, typename ::boost::move_detail::forward_type<Q7>::type
-#define BOOST_MOVE_FWD_TQ9 BOOST_MOVE_FWD_TQ8, typename ::boost::move_detail::forward_type<Q8>::type
-
-//BOOST_MOVE_MREFX
-#define BOOST_MOVE_MREF0
-#define BOOST_MOVE_MREF1                  BOOST_MOVE_MREF(P0) m_p0;
-#define BOOST_MOVE_MREF2 BOOST_MOVE_MREF1 BOOST_MOVE_MREF(P1) m_p1;
-#define BOOST_MOVE_MREF3 BOOST_MOVE_MREF2 BOOST_MOVE_MREF(P2) m_p2;
-#define BOOST_MOVE_MREF4 BOOST_MOVE_MREF3 BOOST_MOVE_MREF(P3) m_p3;
-#define BOOST_MOVE_MREF5 BOOST_MOVE_MREF4 BOOST_MOVE_MREF(P4) m_p4;
-#define BOOST_MOVE_MREF6 BOOST_MOVE_MREF5 BOOST_MOVE_MREF(P5) m_p5;
-#define BOOST_MOVE_MREF7 BOOST_MOVE_MREF6 BOOST_MOVE_MREF(P6) m_p6;
-#define BOOST_MOVE_MREF8 BOOST_MOVE_MREF7 BOOST_MOVE_MREF(P7) m_p7;
-#define BOOST_MOVE_MREF9 BOOST_MOVE_MREF8 BOOST_MOVE_MREF(P8) m_p8;
-
-//BOOST_MOVE_MREFQX
-#define BOOST_MOVE_MREFQ0
-#define BOOST_MOVE_MREFQ1                   BOOST_MOVE_MREFQ(Q0) m_q0;
-#define BOOST_MOVE_MREFQ2 BOOST_MOVE_MREFQ1 BOOST_MOVE_MREFQ(Q1) m_q1;
-#define BOOST_MOVE_MREFQ3 BOOST_MOVE_MREFQ2 BOOST_MOVE_MREFQ(Q2) m_q2;
-#define BOOST_MOVE_MREFQ4 BOOST_MOVE_MREFQ3 BOOST_MOVE_MREFQ(Q3) m_q3;
-#define BOOST_MOVE_MREFQ5 BOOST_MOVE_MREFQ4 BOOST_MOVE_MREFQ(Q4) m_q4;
-#define BOOST_MOVE_MREFQ6 BOOST_MOVE_MREFQ5 BOOST_MOVE_MREFQ(Q5) m_q5;
-#define BOOST_MOVE_MREFQ7 BOOST_MOVE_MREFQ6 BOOST_MOVE_MREFQ(Q6) m_q6;
-#define BOOST_MOVE_MREFQ8 BOOST_MOVE_MREFQ7 BOOST_MOVE_MREFQ(Q7) m_q7;
-#define BOOST_MOVE_MREFQ9 BOOST_MOVE_MREFQ8 BOOST_MOVE_MREFQ(Q8) m_q8;
-
-//BOOST_MOVE_MEMBX
-#define BOOST_MOVE_MEMB0
-#define BOOST_MOVE_MEMB1                  P0 m_p0;
-#define BOOST_MOVE_MEMB2 BOOST_MOVE_MEMB1 P1 m_p1;
-#define BOOST_MOVE_MEMB3 BOOST_MOVE_MEMB2 P2 m_p2;
-#define BOOST_MOVE_MEMB4 BOOST_MOVE_MEMB3 P3 m_p3;
-#define BOOST_MOVE_MEMB5 BOOST_MOVE_MEMB4 P4 m_p4;
-#define BOOST_MOVE_MEMB6 BOOST_MOVE_MEMB5 P5 m_p5;
-#define BOOST_MOVE_MEMB7 BOOST_MOVE_MEMB6 P6 m_p6;
-#define BOOST_MOVE_MEMB8 BOOST_MOVE_MEMB7 P7 m_p7;
-#define BOOST_MOVE_MEMB9 BOOST_MOVE_MEMB8 P8 m_p8;
-
-//BOOST_MOVE_MEMBQX
-#define BOOST_MOVE_MEMBQ0
-#define BOOST_MOVE_MEMBQ1                   Q0 m_q0;
-#define BOOST_MOVE_MEMBQ2 BOOST_MOVE_MEMBQ1 Q1 m_q1;
-#define BOOST_MOVE_MEMBQ3 BOOST_MOVE_MEMBQ2 Q2 m_q2;
-#define BOOST_MOVE_MEMBQ4 BOOST_MOVE_MEMBQ3 Q3 m_q3;
-#define BOOST_MOVE_MEMBQ5 BOOST_MOVE_MEMBQ4 Q4 m_q4;
-#define BOOST_MOVE_MEMBQ6 BOOST_MOVE_MEMBQ5 Q5 m_q5;
-#define BOOST_MOVE_MEMBQ7 BOOST_MOVE_MEMBQ6 Q6 m_q6;
-#define BOOST_MOVE_MEMBQ8 BOOST_MOVE_MEMBQ7 Q7 m_q7;
-#define BOOST_MOVE_MEMBQ9 BOOST_MOVE_MEMBQ8 Q8 m_q8;
-
-//BOOST_MOVE_TMPL_LTN
-#define BOOST_MOVE_TMPL_LT0
-#define BOOST_MOVE_TMPL_LT1 template<
-#define BOOST_MOVE_TMPL_LT2 BOOST_MOVE_TMPL_LT1
-#define BOOST_MOVE_TMPL_LT3 BOOST_MOVE_TMPL_LT1
-#define BOOST_MOVE_TMPL_LT4 BOOST_MOVE_TMPL_LT1
-#define BOOST_MOVE_TMPL_LT5 BOOST_MOVE_TMPL_LT1
-#define BOOST_MOVE_TMPL_LT6 BOOST_MOVE_TMPL_LT1
-#define BOOST_MOVE_TMPL_LT7 BOOST_MOVE_TMPL_LT1
-#define BOOST_MOVE_TMPL_LT8 BOOST_MOVE_TMPL_LT1
-#define BOOST_MOVE_TMPL_LT9 BOOST_MOVE_TMPL_LT1
-
-//BOOST_MOVE_LTN
-#define BOOST_MOVE_LT0
-#define BOOST_MOVE_LT1 <
-#define BOOST_MOVE_LT2 BOOST_MOVE_LT1
-#define BOOST_MOVE_LT3 BOOST_MOVE_LT1
-#define BOOST_MOVE_LT4 BOOST_MOVE_LT1
-#define BOOST_MOVE_LT5 BOOST_MOVE_LT1
-#define BOOST_MOVE_LT6 BOOST_MOVE_LT1
-#define BOOST_MOVE_LT7 BOOST_MOVE_LT1
-#define BOOST_MOVE_LT8 BOOST_MOVE_LT1
-#define BOOST_MOVE_LT9 BOOST_MOVE_LT1
-
-//BOOST_MOVE_GTN
-#define BOOST_MOVE_GT0
-#define BOOST_MOVE_GT1 >
-#define BOOST_MOVE_GT2 BOOST_MOVE_GT1
-#define BOOST_MOVE_GT3 BOOST_MOVE_GT1
-#define BOOST_MOVE_GT4 BOOST_MOVE_GT1
-#define BOOST_MOVE_GT5 BOOST_MOVE_GT1
-#define BOOST_MOVE_GT6 BOOST_MOVE_GT1
-#define BOOST_MOVE_GT7 BOOST_MOVE_GT1
-#define BOOST_MOVE_GT8 BOOST_MOVE_GT1
-#define BOOST_MOVE_GT9 BOOST_MOVE_GT1
-
-//BOOST_MOVE_LPN
-#define BOOST_MOVE_LP0
-#define BOOST_MOVE_LP1 (
-#define BOOST_MOVE_LP2 BOOST_MOVE_LP1
-#define BOOST_MOVE_LP3 BOOST_MOVE_LP1
-#define BOOST_MOVE_LP4 BOOST_MOVE_LP1
-#define BOOST_MOVE_LP5 BOOST_MOVE_LP1
-#define BOOST_MOVE_LP6 BOOST_MOVE_LP1
-#define BOOST_MOVE_LP7 BOOST_MOVE_LP1
-#define BOOST_MOVE_LP8 BOOST_MOVE_LP1
-#define BOOST_MOVE_LP9 BOOST_MOVE_LP1
-
-//BOOST_MOVE_RPN
-#define BOOST_MOVE_RP0
-#define BOOST_MOVE_RP1 )
-#define BOOST_MOVE_RP2 BOOST_MOVE_RP1
-#define BOOST_MOVE_RP3 BOOST_MOVE_RP1
-#define BOOST_MOVE_RP4 BOOST_MOVE_RP1
-#define BOOST_MOVE_RP5 BOOST_MOVE_RP1
-#define BOOST_MOVE_RP6 BOOST_MOVE_RP1
-#define BOOST_MOVE_RP7 BOOST_MOVE_RP1
-#define BOOST_MOVE_RP8 BOOST_MOVE_RP1
-#define BOOST_MOVE_RP9 BOOST_MOVE_RP1
-
-//BOOST_MOVE_IN
-#define BOOST_MOVE_I0
-#define BOOST_MOVE_I1 ,
-#define BOOST_MOVE_I2 BOOST_MOVE_I1
-#define BOOST_MOVE_I3 BOOST_MOVE_I1
-#define BOOST_MOVE_I4 BOOST_MOVE_I1
-#define BOOST_MOVE_I5 BOOST_MOVE_I1
-#define BOOST_MOVE_I6 BOOST_MOVE_I1
-#define BOOST_MOVE_I7 BOOST_MOVE_I1
-#define BOOST_MOVE_I8 BOOST_MOVE_I1
-#define BOOST_MOVE_I9 BOOST_MOVE_I1
-
-//BOOST_MOVE_BOOL
-# define BOOST_MOVE_BOOL(x)   BOOST_MOVE_BOOL_I(x)
-# define BOOST_MOVE_BOOL_I(x) BOOST_MOVE_BOOL##x
-# define BOOST_MOVE_BOOL0 0
-# define BOOST_MOVE_BOOL1 1
-# define BOOST_MOVE_BOOL2 1
-# define BOOST_MOVE_BOOL3 1
-# define BOOST_MOVE_BOOL4 1
-# define BOOST_MOVE_BOOL5 1
-# define BOOST_MOVE_BOOL6 1
-# define BOOST_MOVE_BOOL7 1
-# define BOOST_MOVE_BOOL8 1
-# define BOOST_MOVE_BOOL9 1
-
-//BOOST_MOVE_I_IF
-#define BOOST_MOVE_I_IF(x)    BOOST_MOVE_I_IF_I (BOOST_MOVE_BOOL(x))
-#define BOOST_MOVE_I_IF_I(x)  BOOST_MOVE_I_IF_I2(x)
-#define BOOST_MOVE_I_IF_I2(x) BOOST_MOVE_IF_I_##x
-#define BOOST_MOVE_IF_I_0
-#define BOOST_MOVE_IF_I_1 ,
-
-//BOOST_MOVE_IF
-#define BOOST_MOVE_IF(cond, t, f) BOOST_MOVE_IF_I(cond, t, f)
-#define BOOST_MOVE_IF_I(cond, t, f) BOOST_MOVE_IIF(BOOST_MOVE_BOOL(cond), t, f)
-
-#define BOOST_MOVE_IIF(bit, t, f)   BOOST_MOVE_IIF_I(bit, t, f)
-#define BOOST_MOVE_IIF_I(bit, t, f) BOOST_MOVE_IIF_##bit(t, f)
-#define BOOST_MOVE_IIF_0(t, f) f
-#define BOOST_MOVE_IIF_1(t, f) t
-
-/*
-#define BOOST_MOVE_IIF(bit, t, f) BOOST_MOVE_IIF_OO((bit, t, f))
-#define BOOST_MOVE_IIF_OO(par) BOOST_MOVE_IIF_I ## par
-#define BOOST_MOVE_IIF_I(bit, t, f) BOOST_MOVE_IIF_II(BOOST_MOVE_IIF_ ## bit(t, f))
-#define BOOST_MOVE_IIF_II(id) id
-#define BOOST_MOVE_IIF_0(t, f) f
-#define BOOST_MOVE_IIF_1(t, f) t
-*/
-
-//BOOST_MOVE_COLON
-#define BOOST_MOVE_COLON0
-#define BOOST_MOVE_COLON1 :
-#define BOOST_MOVE_COLON2 BOOST_MOVE_COLON1
-#define BOOST_MOVE_COLON3 BOOST_MOVE_COLON1
-#define BOOST_MOVE_COLON4 BOOST_MOVE_COLON1
-#define BOOST_MOVE_COLON5 BOOST_MOVE_COLON1
-#define BOOST_MOVE_COLON6 BOOST_MOVE_COLON1
-#define BOOST_MOVE_COLON7 BOOST_MOVE_COLON1
-#define BOOST_MOVE_COLON8 BOOST_MOVE_COLON1
-#define BOOST_MOVE_COLON9 BOOST_MOVE_COLON1
-
-//BOOST_MOVE_BITOR
-#define BOOST_MOVE_BITOR(x,y)    BOOST_MOVE_BITOR_I(x,y)
-#define BOOST_MOVE_BITOR_I(x,y)  BOOST_MOVE_BITOR##x##y
-#define BOOST_MOVE_BITOR00 0
-#define BOOST_MOVE_BITOR01 1
-#define BOOST_MOVE_BITOR10 1
-#define BOOST_MOVE_BITOR11 1
-
-//BOOST_MOVE_OR
-#define BOOST_MOVE_OR(x, y) BOOST_MOVE_OR_I(x, y)
-#define BOOST_MOVE_OR_I(x, y) BOOST_MOVE_BITOR(BOOST_MOVE_BOOL(x), BOOST_MOVE_BOOL(y))
-
-//BOOST_MOVE_BITAND
-#define BOOST_MOVE_BITAND(x,y)    BOOST_MOVE_BITAND_I(x,y)
-#define BOOST_MOVE_BITAND_I(x,y)  BOOST_MOVE_BITAND##x##y
-#define BOOST_MOVE_BITAND00 0
-#define BOOST_MOVE_BITAND01 0
-#define BOOST_MOVE_BITAND10 0
-#define BOOST_MOVE_BITAND11 1
-
-//BOOST_MOVE_AND
-#define BOOST_MOVE_AND(x, y) BOOST_MOVE_AND_I(x, y)
-#define BOOST_MOVE_AND_I(x, y) BOOST_MOVE_BITAND(BOOST_MOVE_BOOL(x), BOOST_MOVE_BOOL(y))
-
-//BOOST_MOVE_DEC
-#define BOOST_MOVE_DEC(x) BOOST_MOVE_DEC_I(x)
-#define BOOST_MOVE_DEC_I(x) BOOST_MOVE_DEC##x
-#define BOOST_MOVE_DEC1  0
-#define BOOST_MOVE_DEC2  1
-#define BOOST_MOVE_DEC3  2
-#define BOOST_MOVE_DEC4  3
-#define BOOST_MOVE_DEC5  4
-#define BOOST_MOVE_DEC6  5
-#define BOOST_MOVE_DEC7  6
-#define BOOST_MOVE_DEC8  7
-#define BOOST_MOVE_DEC9  8
-#define BOOST_MOVE_DEC10 9
-#define BOOST_MOVE_DEC11 10
-#define BOOST_MOVE_DEC12 11
-#define BOOST_MOVE_DEC13 12
-#define BOOST_MOVE_DEC14 13
-
-//BOOST_MOVE_SUB
-#define BOOST_MOVE_SUB(x, y) BOOST_MOVE_SUB_I(x,y)
-#define BOOST_MOVE_SUB_I(x, y) BOOST_MOVE_SUB##y(x)
-#define BOOST_MOVE_SUB0(x) x
-#define BOOST_MOVE_SUB1(x) BOOST_MOVE_DEC(x)
-#define BOOST_MOVE_SUB2(x) BOOST_MOVE_SUB1(BOOST_MOVE_DEC(x))
-#define BOOST_MOVE_SUB3(x) BOOST_MOVE_SUB2(BOOST_MOVE_DEC(x))
-#define BOOST_MOVE_SUB4(x) BOOST_MOVE_SUB3(BOOST_MOVE_DEC(x))
-#define BOOST_MOVE_SUB5(x) BOOST_MOVE_SUB4(BOOST_MOVE_DEC(x))
-#define BOOST_MOVE_SUB6(x) BOOST_MOVE_SUB5(BOOST_MOVE_DEC(x))
-#define BOOST_MOVE_SUB7(x) BOOST_MOVE_SUB6(BOOST_MOVE_DEC(x))
-#define BOOST_MOVE_SUB8(x) BOOST_MOVE_SUB7(BOOST_MOVE_DEC(x))
-#define BOOST_MOVE_SUB9(x) BOOST_MOVE_SUB8(BOOST_MOVE_DEC(x))
-#define BOOST_MOVE_SUB10(x) BOOST_MOVE_SUB9(BOOST_MOVE_DEC(x))
-#define BOOST_MOVE_SUB11(x) BOOST_MOVE_SUB10(BOOST_MOVE_DEC(x))
-#define BOOST_MOVE_SUB12(x) BOOST_MOVE_SUB11(BOOST_MOVE_DEC(x))
-#define BOOST_MOVE_SUB13(x) BOOST_MOVE_SUB12(BOOST_MOVE_DEC(x))
-#define BOOST_MOVE_SUB14(x) BOOST_MOVE_SUB13(BOOST_MOVE_DEC(x))
-
-//BOOST_MOVE_INC
-#define BOOST_MOVE_INC(x) BOOST_MOVE_INC_I(x)
-#define BOOST_MOVE_INC_I(x) BOOST_MOVE_INC##x
-#define BOOST_MOVE_INC0  1
-#define BOOST_MOVE_INC1  2
-#define BOOST_MOVE_INC2  3
-#define BOOST_MOVE_INC3  4
-#define BOOST_MOVE_INC4  5
-#define BOOST_MOVE_INC5  6
-#define BOOST_MOVE_INC6  7
-#define BOOST_MOVE_INC7  8
-#define BOOST_MOVE_INC8  9
-#define BOOST_MOVE_INC9  10
-#define BOOST_MOVE_INC10 11
-#define BOOST_MOVE_INC11 12
-#define BOOST_MOVE_INC12 13
-#define BOOST_MOVE_INC13 14
-
-//BOOST_MOVE_ADD
-#define BOOST_MOVE_ADD(x, y) BOOST_MOVE_ADD_I(x,y)
-#define BOOST_MOVE_ADD_I(x, y) BOOST_MOVE_ADD##y(x)
-#define BOOST_MOVE_ADD0(x) x
-#define BOOST_MOVE_ADD1(x) BOOST_MOVE_INC(x)
-#define BOOST_MOVE_ADD2(x) BOOST_MOVE_ADD1(BOOST_MOVE_INC(x))
-#define BOOST_MOVE_ADD3(x) BOOST_MOVE_ADD2(BOOST_MOVE_INC(x))
-#define BOOST_MOVE_ADD4(x) BOOST_MOVE_ADD3(BOOST_MOVE_INC(x))
-#define BOOST_MOVE_ADD5(x) BOOST_MOVE_ADD4(BOOST_MOVE_INC(x))
-#define BOOST_MOVE_ADD6(x) BOOST_MOVE_ADD5(BOOST_MOVE_INC(x))
-#define BOOST_MOVE_ADD7(x) BOOST_MOVE_ADD6(BOOST_MOVE_INC(x))
-#define BOOST_MOVE_ADD8(x) BOOST_MOVE_ADD7(BOOST_MOVE_INC(x))
-#define BOOST_MOVE_ADD9(x) BOOST_MOVE_ADD8(BOOST_MOVE_INC(x))
-#define BOOST_MOVE_ADD10(x) BOOST_MOVE_ADD9(BOOST_MOVE_INC(x))
-#define BOOST_MOVE_ADD11(x) BOOST_MOVE_ADD10(BOOST_MOVE_INC(x))
-#define BOOST_MOVE_ADD12(x) BOOST_MOVE_ADD11(BOOST_MOVE_INC(x))
-#define BOOST_MOVE_ADD13(x) BOOST_MOVE_ADD12(BOOST_MOVE_INC(x))
-
-//BOOST_MOVE_ITERATE_2TON
-#define BOOST_MOVE_ITERATE_2TO2(MACROFUNC)                                       MACROFUNC(2)
-#define BOOST_MOVE_ITERATE_2TO3(MACROFUNC)   BOOST_MOVE_ITERATE_2TO2(MACROFUNC)  MACROFUNC(3)
-#define BOOST_MOVE_ITERATE_2TO4(MACROFUNC)   BOOST_MOVE_ITERATE_2TO3(MACROFUNC)  MACROFUNC(4)
-#define BOOST_MOVE_ITERATE_2TO5(MACROFUNC)   BOOST_MOVE_ITERATE_2TO4(MACROFUNC)  MACROFUNC(5)
-#define BOOST_MOVE_ITERATE_2TO6(MACROFUNC)   BOOST_MOVE_ITERATE_2TO5(MACROFUNC)  MACROFUNC(6)
-#define BOOST_MOVE_ITERATE_2TO7(MACROFUNC)   BOOST_MOVE_ITERATE_2TO6(MACROFUNC)  MACROFUNC(7)
-#define BOOST_MOVE_ITERATE_2TO8(MACROFUNC)   BOOST_MOVE_ITERATE_2TO7(MACROFUNC)  MACROFUNC(8)
-#define BOOST_MOVE_ITERATE_2TO9(MACROFUNC)   BOOST_MOVE_ITERATE_2TO8(MACROFUNC)  MACROFUNC(9)
-
-//BOOST_MOVE_ITERATE_1TON
-#define BOOST_MOVE_ITERATE_1TO1(MACROFUNC)                                       MACROFUNC(1)
-#define BOOST_MOVE_ITERATE_1TO2(MACROFUNC)   BOOST_MOVE_ITERATE_1TO1(MACROFUNC)  MACROFUNC(2)
-#define BOOST_MOVE_ITERATE_1TO3(MACROFUNC)   BOOST_MOVE_ITERATE_1TO2(MACROFUNC)  MACROFUNC(3)
-#define BOOST_MOVE_ITERATE_1TO4(MACROFUNC)   BOOST_MOVE_ITERATE_1TO3(MACROFUNC)  MACROFUNC(4)
-#define BOOST_MOVE_ITERATE_1TO5(MACROFUNC)   BOOST_MOVE_ITERATE_1TO4(MACROFUNC)  MACROFUNC(5)
-#define BOOST_MOVE_ITERATE_1TO6(MACROFUNC)   BOOST_MOVE_ITERATE_1TO5(MACROFUNC)  MACROFUNC(6)
-#define BOOST_MOVE_ITERATE_1TO7(MACROFUNC)   BOOST_MOVE_ITERATE_1TO6(MACROFUNC)  MACROFUNC(7)
-#define BOOST_MOVE_ITERATE_1TO8(MACROFUNC)   BOOST_MOVE_ITERATE_1TO7(MACROFUNC)  MACROFUNC(8)
-#define BOOST_MOVE_ITERATE_1TO9(MACROFUNC)   BOOST_MOVE_ITERATE_1TO8(MACROFUNC)  MACROFUNC(9)
-
-//BOOST_MOVE_ITERATE_0TON
-#define BOOST_MOVE_ITERATE_0TO0(MACROFUNC)                                       MACROFUNC(0)
-#define BOOST_MOVE_ITERATE_0TO1(MACROFUNC)   BOOST_MOVE_ITERATE_0TO0(MACROFUNC)  MACROFUNC(1)
-#define BOOST_MOVE_ITERATE_0TO2(MACROFUNC)   BOOST_MOVE_ITERATE_0TO1(MACROFUNC)  MACROFUNC(2)
-#define BOOST_MOVE_ITERATE_0TO3(MACROFUNC)   BOOST_MOVE_ITERATE_0TO2(MACROFUNC)  MACROFUNC(3)
-#define BOOST_MOVE_ITERATE_0TO4(MACROFUNC)   BOOST_MOVE_ITERATE_0TO3(MACROFUNC)  MACROFUNC(4)
-#define BOOST_MOVE_ITERATE_0TO5(MACROFUNC)   BOOST_MOVE_ITERATE_0TO4(MACROFUNC)  MACROFUNC(5)
-#define BOOST_MOVE_ITERATE_0TO6(MACROFUNC)   BOOST_MOVE_ITERATE_0TO5(MACROFUNC)  MACROFUNC(6)
-#define BOOST_MOVE_ITERATE_0TO7(MACROFUNC)   BOOST_MOVE_ITERATE_0TO6(MACROFUNC)  MACROFUNC(7)
-#define BOOST_MOVE_ITERATE_0TO8(MACROFUNC)   BOOST_MOVE_ITERATE_0TO7(MACROFUNC)  MACROFUNC(8)
-#define BOOST_MOVE_ITERATE_0TO9(MACROFUNC)   BOOST_MOVE_ITERATE_0TO8(MACROFUNC)  MACROFUNC(9)
-
-//BOOST_MOVE_ITERATE_NTON
-#define BOOST_MOVE_ITERATE_1TO1(MACROFUNC)   MACROFUNC(1)
-#define BOOST_MOVE_ITERATE_2TO2(MACROFUNC)   MACROFUNC(2)
-#define BOOST_MOVE_ITERATE_3TO3(MACROFUNC)   MACROFUNC(3)
-#define BOOST_MOVE_ITERATE_4TO4(MACROFUNC)   MACROFUNC(4)
-#define BOOST_MOVE_ITERATE_5TO5(MACROFUNC)   MACROFUNC(5)
-#define BOOST_MOVE_ITERATE_6TO6(MACROFUNC)   MACROFUNC(6)
-#define BOOST_MOVE_ITERATE_7TO7(MACROFUNC)   MACROFUNC(7)
-#define BOOST_MOVE_ITERATE_8TO8(MACROFUNC)   MACROFUNC(8)
-#define BOOST_MOVE_ITERATE_9TO9(MACROFUNC)   MACROFUNC(9)
-
-//BOOST_MOVE_ITER2D_0TOMAX
-#define BOOST_MOVE_ITER2DLOW_0TOMAX0(MACROFUNC2D, M)                                                  MACROFUNC2D(M, 0)
-#define BOOST_MOVE_ITER2DLOW_0TOMAX1(MACROFUNC2D, M)  BOOST_MOVE_ITER2DLOW_0TOMAX0(MACROFUNC2D, M) MACROFUNC2D(M, 1)
-#define BOOST_MOVE_ITER2DLOW_0TOMAX2(MACROFUNC2D, M)  BOOST_MOVE_ITER2DLOW_0TOMAX1(MACROFUNC2D, M) MACROFUNC2D(M, 2)
-#define BOOST_MOVE_ITER2DLOW_0TOMAX3(MACROFUNC2D, M)  BOOST_MOVE_ITER2DLOW_0TOMAX2(MACROFUNC2D, M) MACROFUNC2D(M, 3)
-#define BOOST_MOVE_ITER2DLOW_0TOMAX4(MACROFUNC2D, M)  BOOST_MOVE_ITER2DLOW_0TOMAX3(MACROFUNC2D, M) MACROFUNC2D(M, 4)
-#define BOOST_MOVE_ITER2DLOW_0TOMAX5(MACROFUNC2D, M)  BOOST_MOVE_ITER2DLOW_0TOMAX4(MACROFUNC2D, M) MACROFUNC2D(M, 5)
-#define BOOST_MOVE_ITER2DLOW_0TOMAX6(MACROFUNC2D, M)  BOOST_MOVE_ITER2DLOW_0TOMAX5(MACROFUNC2D, M) MACROFUNC2D(M, 6)
-#define BOOST_MOVE_ITER2DLOW_0TOMAX7(MACROFUNC2D, M)  BOOST_MOVE_ITER2DLOW_0TOMAX6(MACROFUNC2D, M) MACROFUNC2D(M, 7)
-#define BOOST_MOVE_ITER2DLOW_0TOMAX8(MACROFUNC2D, M)  BOOST_MOVE_ITER2DLOW_0TOMAX7(MACROFUNC2D, M) MACROFUNC2D(M, 8)
-#define BOOST_MOVE_ITER2DLOW_0TOMAX9(MACROFUNC2D, M)  BOOST_MOVE_ITER2DLOW_0TOMAX8(MACROFUNC2D, M) MACROFUNC2D(M, 9)
-
-#define BOOST_MOVE_ITER2D_0TOMAX0(MAX, MACROFUNC2D)                                                   BOOST_MOVE_ITER2DLOW_0TOMAX##MAX(MACROFUNC2D, 0)
-#define BOOST_MOVE_ITER2D_0TOMAX1(MAX, MACROFUNC2D)   BOOST_MOVE_ITER2D_0TOMAX0(MAX, MACROFUNC2D)  BOOST_MOVE_ITER2DLOW_0TOMAX##MAX(MACROFUNC2D, 1)
-#define BOOST_MOVE_ITER2D_0TOMAX2(MAX, MACROFUNC2D)   BOOST_MOVE_ITER2D_0TOMAX1(MAX, MACROFUNC2D)  BOOST_MOVE_ITER2DLOW_0TOMAX##MAX(MACROFUNC2D, 2)
-#define BOOST_MOVE_ITER2D_0TOMAX3(MAX, MACROFUNC2D)   BOOST_MOVE_ITER2D_0TOMAX2(MAX, MACROFUNC2D)  BOOST_MOVE_ITER2DLOW_0TOMAX##MAX(MACROFUNC2D, 3)
-#define BOOST_MOVE_ITER2D_0TOMAX4(MAX, MACROFUNC2D)   BOOST_MOVE_ITER2D_0TOMAX3(MAX, MACROFUNC2D)  BOOST_MOVE_ITER2DLOW_0TOMAX##MAX(MACROFUNC2D, 4)
-#define BOOST_MOVE_ITER2D_0TOMAX5(MAX, MACROFUNC2D)   BOOST_MOVE_ITER2D_0TOMAX4(MAX, MACROFUNC2D)  BOOST_MOVE_ITER2DLOW_0TOMAX##MAX(MACROFUNC2D, 5)
-#define BOOST_MOVE_ITER2D_0TOMAX6(MAX, MACROFUNC2D)   BOOST_MOVE_ITER2D_0TOMAX5(MAX, MACROFUNC2D)  BOOST_MOVE_ITER2DLOW_0TOMAX##MAX(MACROFUNC2D, 6)
-#define BOOST_MOVE_ITER2D_0TOMAX7(MAX, MACROFUNC2D)   BOOST_MOVE_ITER2D_0TOMAX6(MAX, MACROFUNC2D)  BOOST_MOVE_ITER2DLOW_0TOMAX##MAX(MACROFUNC2D, 7)
-#define BOOST_MOVE_ITER2D_0TOMAX8(MAX, MACROFUNC2D)   BOOST_MOVE_ITER2D_0TOMAX7(MAX, MACROFUNC2D)  BOOST_MOVE_ITER2DLOW_0TOMAX##MAX(MACROFUNC2D, 8)
-#define BOOST_MOVE_ITER2D_0TOMAX9(MAX, MACROFUNC2D)   BOOST_MOVE_ITER2D_0TOMAX8(MAX, MACROFUNC2D)  BOOST_MOVE_ITER2DLOW_0TOMAX##MAX(MACROFUNC2D, 9)
-
-#define BOOST_MOVE_ITER2D_0TOMAX(MAX, MACROFUNC2D)    BOOST_MOVE_ITER2D_0TOMAX_I   (MAX, MACROFUNC2D)
-#define BOOST_MOVE_ITER2D_0TOMAX_I(MAX, MACROFUNC2D)  BOOST_MOVE_ITER2D_0TOMAX##MAX(MAX, MACROFUNC2D)
-
-
-
-
-//BOOST_MOVE_CAT
-#define BOOST_MOVE_CAT(a, b) BOOST_MOVE_CAT_I(a, b)
-#define BOOST_MOVE_CAT_I(a, b) a ## b
-//#    define BOOST_MOVE_CAT_I(a, b) BOOST_MOVE_CAT_II(~, a ## b)
-//#    define BOOST_MOVE_CAT_II(p, res) res
-
-#endif //#ifndef BOOST_MOVE_DETAIL_FWD_MACROS_HPP
diff --git a/src/boost/move/detail/iterator_to_raw_pointer.hpp b/src/boost/move/detail/iterator_to_raw_pointer.hpp
deleted file mode 100644
index 67afd6c1..00000000
--- a/src/boost/move/detail/iterator_to_raw_pointer.hpp
+++ /dev/null
@@ -1,59 +0,0 @@
-//////////////////////////////////////////////////////////////////////////////
-//
-// (C) Copyright Ion Gaztanaga 2014-2015. Distributed under the Boost
-// 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.
-//
-//////////////////////////////////////////////////////////////////////////////
-#ifndef BOOST_MOVE_DETAIL_ITERATOR_TO_RAW_POINTER_HPP
-#define BOOST_MOVE_DETAIL_ITERATOR_TO_RAW_POINTER_HPP
-
-#ifndef BOOST_CONFIG_HPP
-#  include <boost/config.hpp>
-#endif
-
-#if defined(BOOST_HAS_PRAGMA_ONCE)
-#  pragma once
-#endif
-
-#include <boost/move/detail/iterator_traits.hpp>
-#include <boost/move/detail/to_raw_pointer.hpp>
-#include <boost/move/detail/pointer_element.hpp>
-
-namespace boost {
-namespace movelib {
-namespace detail {
-
-template <class T>
-BOOST_MOVE_FORCEINLINE T* iterator_to_pointer(T* i)
-{  return i; }
-
-template <class Iterator>
-BOOST_MOVE_FORCEINLINE typename boost::movelib::iterator_traits<Iterator>::pointer
-   iterator_to_pointer(const Iterator &i)
-{  return i.operator->();  }
-
-template <class Iterator>
-struct iterator_to_element_ptr
-{
-   typedef typename boost::movelib::iterator_traits<Iterator>::pointer  pointer;
-   typedef typename boost::movelib::pointer_element<pointer>::type      element_type;
-   typedef element_type* type;
-};
-
-}  //namespace detail {
-
-template <class Iterator>
-BOOST_MOVE_FORCEINLINE typename boost::movelib::detail::iterator_to_element_ptr<Iterator>::type
-   iterator_to_raw_pointer(const Iterator &i)
-{
-   return ::boost::movelib::to_raw_pointer
-      (  ::boost::movelib::detail::iterator_to_pointer(i)   );
-}
-
-}  //namespace movelib {
-}  //namespace boost {
-
-#endif   //#ifndef BOOST_MOVE_DETAIL_ITERATOR_TO_RAW_POINTER_HPP
diff --git a/src/boost/move/detail/iterator_traits.hpp b/src/boost/move/detail/iterator_traits.hpp
deleted file mode 100644
index 9ea01c25..00000000
--- a/src/boost/move/detail/iterator_traits.hpp
+++ /dev/null
@@ -1,177 +0,0 @@
-//////////////////////////////////////////////////////////////////////////////
-//
-// (C) Copyright Ion Gaztanaga 2014-2014.
-// Distributed under the Boost 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/move for documentation.
-//
-//////////////////////////////////////////////////////////////////////////////
-
-//! \file
-
-#ifndef BOOST_MOVE_DETAIL_ITERATOR_TRAITS_HPP
-#define BOOST_MOVE_DETAIL_ITERATOR_TRAITS_HPP
-
-#ifndef BOOST_CONFIG_HPP
-#  include <boost/config.hpp>
-#endif
-#
-#if defined(BOOST_HAS_PRAGMA_ONCE)
-#  pragma once
-#endif
-
-#if (BOOST_CXX_VERSION > 201703L) && defined(__cpp_lib_concepts)
-
-#include <iterator>
-
-#define BOOST_MOVE_CONTIGUOUS_ITERATOR_TAG
-
-namespace boost {
-namespace movelib {
-
-   using std::iterator_traits;
-
-   template<class T>
-   struct iter_difference
-   {
-      typedef typename std::iterator_traits<T>::difference_type type;
-   };
-
-   template<class T>
-   struct iter_value
-   {
-      typedef typename std::iterator_traits<T>::value_type type;
-   };
-
-   template<class T>
-   struct iter_category
-   {
-      typedef typename std::iterator_traits<T>::iterator_category type;
-   };
-
-}} //namespace boost::movelib
-
-#else
-
-#include <cstddef>
-#include <boost/move/detail/type_traits.hpp>
-
-#include <boost/move/detail/std_ns_begin.hpp>
-
-BOOST_MOVE_STD_NS_BEG
-
-struct input_iterator_tag;
-struct forward_iterator_tag;
-struct bidirectional_iterator_tag;
-struct random_access_iterator_tag;
-struct output_iterator_tag;
-
-#if (  (defined(BOOST_GNU_STDLIB) && (__cplusplus > 201703L))\
-    || (defined(_LIBCPP_VERSION) && (_LIBCPP_STD_VER > 17))\
-    || (defined(_YVALS) && defined(_CPPLIB_VER) && defined(__cpp_lib_concepts))\
-    || (__cplusplus >= 202002L)\
-    )
-#  define BOOST_MOVE_CONTIGUOUS_ITERATOR_TAG
-struct contiguous_iterator_tag;
-
-#endif
-
-BOOST_MOVE_STD_NS_END
-
-#include <boost/move/detail/std_ns_end.hpp>
-
-namespace boost{  namespace movelib{
-
-template<class T>
-struct iter_difference
-{
-   typedef typename T::difference_type type;
-};
-
-template<class T>
-struct iter_difference<T*>
-{
-   typedef std::ptrdiff_t type;
-};
-
-template<class T>
-struct iter_value
-{
-   typedef typename T::value_type type;
-};
-
-template<class T>
-struct iter_value<T*>
-{
-   typedef T type;
-};
-
-template<class T>
-struct iter_value<const T*>
-{
-   typedef T type;
-};
-
-template<class T>
-struct iter_category
-{
-   typedef typename T::iterator_category type;
-};
-
-
-template<class T>
-struct iter_category<T*>
-{
-   typedef std::random_access_iterator_tag type;
-};
-
-template<class Iterator>
-struct iterator_traits
-{
-   typedef typename iter_difference<Iterator>::type   difference_type;
-   typedef typename iter_value<Iterator>::type        value_type;
-   typedef typename Iterator::pointer                 pointer;
-   typedef typename Iterator::reference               reference;
-   typedef typename iter_category<Iterator>::type     iterator_category;
-};
-
-template<class T>
-struct iterator_traits<T*>
-{
-   typedef std::ptrdiff_t                    difference_type;
-   typedef T                                 value_type;
-   typedef T*                                pointer;
-   typedef T&                                reference;
-   typedef std::random_access_iterator_tag   iterator_category;
-};
-
-template<class T>
-struct iterator_traits<const T*>
-{
-   typedef std::ptrdiff_t                    difference_type;
-   typedef T                                 value_type;
-   typedef const T*                          pointer;
-   typedef const T&                          reference;
-   typedef std::random_access_iterator_tag   iterator_category;
-};
-
-}} //namespace boost::movelib
-
-#endif   //
-
-#include <boost/move/detail/type_traits.hpp>
-
-namespace boost {
-namespace movelib {
-
-template<class T>
-struct iter_size
-   : boost::move_detail::
-      make_unsigned<typename iter_difference<T>::type >
-{};
-
-}}  //namespace boost move_detail {
-
-#endif //#ifndef BOOST_MOVE_DETAIL_ITERATOR_TRAITS_HPP
diff --git a/src/boost/move/detail/move_helpers.hpp b/src/boost/move/detail/move_helpers.hpp
deleted file mode 100644
index 17138444..00000000
--- a/src/boost/move/detail/move_helpers.hpp
+++ /dev/null
@@ -1,256 +0,0 @@
-//////////////////////////////////////////////////////////////////////////////
-//
-// (C) Copyright Ion Gaztanaga 2010-2016.
-// Distributed under the Boost 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/move for documentation.
-//
-//////////////////////////////////////////////////////////////////////////////
-
-#ifndef BOOST_MOVE_MOVE_HELPERS_HPP
-#define BOOST_MOVE_MOVE_HELPERS_HPP
-
-#ifndef BOOST_CONFIG_HPP
-#  include <boost/config.hpp>
-#endif
-#
-#if defined(BOOST_HAS_PRAGMA_ONCE)
-#  pragma once
-#endif
-
-#include <boost/move/core.hpp>
-#include <boost/move/utility_core.hpp>
-#include <boost/move/detail/type_traits.hpp>
-
-#if defined(BOOST_NO_CXX11_RVALUE_REFERENCES)
-
-#define BOOST_MOVE_CATCH_CONST(U)  \
-   typename ::boost::move_detail::if_< ::boost::move_detail::is_class<U>, BOOST_CATCH_CONST_RLVALUE(U), const U &>::type
-#define BOOST_MOVE_CATCH_RVALUE(U)\
-   typename ::boost::move_detail::if_< ::boost::move_detail::is_class<U>, BOOST_RV_REF(U), ::boost::move_detail::nat>::type
-#define BOOST_MOVE_CATCH_FWD(U) BOOST_FWD_REF(U)
-#else
-#define BOOST_MOVE_CATCH_CONST(U)  const U &
-#define BOOST_MOVE_CATCH_RVALUE(U) U &&
-#define BOOST_MOVE_CATCH_FWD(U)    U &&
-#endif
-
-////////////////////////////////////////
-//
-// BOOST_MOVE_CONVERSION_AWARE_CATCH
-//
-////////////////////////////////////////
-
-#ifdef BOOST_NO_CXX11_RVALUE_REFERENCES
-
-   template<class RETURN_VALUE, class BOOST_MOVE_TEMPL_PARAM, class TYPE>
-   struct boost_move_conversion_aware_catch_1
-      : public ::boost::move_detail::enable_if_and
-                        < RETURN_VALUE
-                        , ::boost::move_detail::is_same<TYPE, BOOST_MOVE_TEMPL_PARAM>
-                        , ::boost::move_detail::is_class<TYPE>
-                        , ::boost::has_move_emulation_disabled<BOOST_MOVE_TEMPL_PARAM>
-                        >
-   {};
-
-   template<class RETURN_VALUE, class BOOST_MOVE_TEMPL_PARAM, class TYPE>
-   struct boost_move_conversion_aware_catch_2
-      : public ::boost::move_detail::disable_if_or
-                        < RETURN_VALUE
-                        , ::boost::move_detail::is_same<TYPE, BOOST_MOVE_TEMPL_PARAM> 
-                        , ::boost::move_detail::is_rv_impl<BOOST_MOVE_TEMPL_PARAM>
-                        , ::boost::move_detail::and_
-                                    < ::boost::move_detail::is_rv_impl<BOOST_MOVE_TEMPL_PARAM>
-                                    , ::boost::move_detail::is_class<BOOST_MOVE_TEMPL_PARAM>
-                                    >
-                        >
-   {};
-
-   #define BOOST_MOVE_CONVERSION_AWARE_CATCH_COMMON(PUB_FUNCTION, TYPE, RETURN_VALUE, FWD_FUNCTION)\
-      BOOST_MOVE_FORCEINLINE RETURN_VALUE PUB_FUNCTION(BOOST_MOVE_CATCH_CONST(TYPE) x)\
-      {  return FWD_FUNCTION(static_cast<const TYPE&>(x)); }\
-      \
-      BOOST_MOVE_FORCEINLINE RETURN_VALUE PUB_FUNCTION(BOOST_MOVE_CATCH_RVALUE(TYPE) x) \
-      {  return FWD_FUNCTION(::boost::move(x));  }\
-      \
-      BOOST_MOVE_FORCEINLINE RETURN_VALUE PUB_FUNCTION(TYPE &x)\
-      {  return FWD_FUNCTION(const_cast<const TYPE &>(x)); }\
-   //
-   #if defined(BOOST_MOVE_HELPERS_RETURN_SFINAE_BROKEN)
-      #define BOOST_MOVE_CONVERSION_AWARE_CATCH(PUB_FUNCTION, TYPE, RETURN_VALUE, FWD_FUNCTION)\
-         BOOST_MOVE_CONVERSION_AWARE_CATCH_COMMON(PUB_FUNCTION, TYPE, RETURN_VALUE, FWD_FUNCTION)\
-         \
-         template<class BOOST_MOVE_TEMPL_PARAM>\
-         BOOST_MOVE_FORCEINLINE RETURN_VALUE PUB_FUNCTION(const BOOST_MOVE_TEMPL_PARAM &u,\
-            typename boost_move_conversion_aware_catch_1< ::boost::move_detail::nat, BOOST_MOVE_TEMPL_PARAM, TYPE>::type* = 0)\
-         { return FWD_FUNCTION(u); }\
-         \
-         template<class BOOST_MOVE_TEMPL_PARAM>\
-         BOOST_MOVE_FORCEINLINE RETURN_VALUE PUB_FUNCTION(const BOOST_MOVE_TEMPL_PARAM &u,\
-            typename boost_move_conversion_aware_catch_2< ::boost::move_detail::nat, BOOST_MOVE_TEMPL_PARAM, TYPE>::type* = 0)\
-         {\
-            TYPE t((u));\
-            return FWD_FUNCTION(::boost::move(t));\
-         }\
-      //
-   #else
-      #define BOOST_MOVE_CONVERSION_AWARE_CATCH(PUB_FUNCTION, TYPE, RETURN_VALUE, FWD_FUNCTION)\
-         BOOST_MOVE_CONVERSION_AWARE_CATCH_COMMON(PUB_FUNCTION, TYPE, RETURN_VALUE, FWD_FUNCTION)\
-         \
-         template<class BOOST_MOVE_TEMPL_PARAM>\
-         BOOST_MOVE_FORCEINLINE typename boost_move_conversion_aware_catch_1<RETURN_VALUE, BOOST_MOVE_TEMPL_PARAM, TYPE>::type\
-            PUB_FUNCTION(const BOOST_MOVE_TEMPL_PARAM &u)\
-         { return FWD_FUNCTION(u); }\
-         \
-         template<class BOOST_MOVE_TEMPL_PARAM>\
-         BOOST_MOVE_FORCEINLINE typename boost_move_conversion_aware_catch_2<RETURN_VALUE, BOOST_MOVE_TEMPL_PARAM, TYPE>::type\
-            PUB_FUNCTION(const BOOST_MOVE_TEMPL_PARAM &u)\
-         {\
-            TYPE t((u));\
-            return FWD_FUNCTION(::boost::move(t));\
-         }\
-      //
-   #endif
-#elif (defined(_MSC_VER) && (_MSC_VER == 1600))
-
-   #define BOOST_MOVE_CONVERSION_AWARE_CATCH(PUB_FUNCTION, TYPE, RETURN_VALUE, FWD_FUNCTION)\
-      BOOST_MOVE_FORCEINLINE RETURN_VALUE PUB_FUNCTION(BOOST_MOVE_CATCH_CONST(TYPE) x)\
-      {  return FWD_FUNCTION(static_cast<const TYPE&>(x)); }\
-      \
-      BOOST_MOVE_FORCEINLINE RETURN_VALUE PUB_FUNCTION(BOOST_MOVE_CATCH_RVALUE(TYPE) x) \
-      {  return FWD_FUNCTION(::boost::move(x));  }\
-      \
-      template<class BOOST_MOVE_TEMPL_PARAM>\
-      BOOST_MOVE_FORCEINLINE typename ::boost::move_detail::enable_if_c\
-                        < !::boost::move_detail::is_same<TYPE, BOOST_MOVE_TEMPL_PARAM>::value\
-                        , RETURN_VALUE >::type\
-      PUB_FUNCTION(const BOOST_MOVE_TEMPL_PARAM &u)\
-      {\
-         TYPE t((u));\
-         return FWD_FUNCTION(::boost::move(t));\
-      }\
-   //
-
-#else    //BOOST_NO_CXX11_RVALUE_REFERENCES
-
-   #define BOOST_MOVE_CONVERSION_AWARE_CATCH(PUB_FUNCTION, TYPE, RETURN_VALUE, FWD_FUNCTION)\
-      BOOST_MOVE_FORCEINLINE RETURN_VALUE PUB_FUNCTION(BOOST_MOVE_CATCH_CONST(TYPE) x)\
-      {  return FWD_FUNCTION(x); }\
-      \
-      BOOST_MOVE_FORCEINLINE RETURN_VALUE PUB_FUNCTION(BOOST_MOVE_CATCH_RVALUE(TYPE) x) \
-      {  return FWD_FUNCTION(::boost::move(x));  }\
-   //
-
-#endif   //BOOST_NO_CXX11_RVALUE_REFERENCES
-
-////////////////////////////////////////
-//
-// BOOST_MOVE_CONVERSION_AWARE_CATCH_1ARG
-//
-////////////////////////////////////////
-
-#ifdef BOOST_NO_CXX11_RVALUE_REFERENCES
-
-   template<class RETURN_VALUE, class BOOST_MOVE_TEMPL_PARAM, class UNLESS_CONVERTIBLE_TO, class TYPE>
-   struct boost_move_conversion_aware_catch_1arg_1
-      : public ::boost::move_detail::enable_if_and
-                        < RETURN_VALUE
-                        , ::boost::move_detail::not_< ::boost::move_detail::is_same_or_convertible<BOOST_MOVE_TEMPL_PARAM, UNLESS_CONVERTIBLE_TO> >
-                        , ::boost::move_detail::is_same<TYPE, BOOST_MOVE_TEMPL_PARAM>
-                        , ::boost::has_move_emulation_disabled<BOOST_MOVE_TEMPL_PARAM>
-                        >
-   {};
-
-   template<class RETURN_VALUE, class BOOST_MOVE_TEMPL_PARAM, class UNLESS_CONVERTIBLE_TO, class TYPE>
-   struct boost_move_conversion_aware_catch_1arg_2
-      : public ::boost::move_detail::disable_if_or
-                        < RETURN_VALUE
-                        , ::boost::move_detail::is_same_or_convertible< BOOST_MOVE_TEMPL_PARAM, UNLESS_CONVERTIBLE_TO>
-                        , ::boost::move_detail::is_rv_impl<BOOST_MOVE_TEMPL_PARAM>
-                        , ::boost::move_detail::is_same<TYPE, BOOST_MOVE_TEMPL_PARAM>
-                        >
-   {};
-
-   #define BOOST_MOVE_CONVERSION_AWARE_CATCH_1ARG_COMMON(PUB_FUNCTION, TYPE, RETURN_VALUE, FWD_FUNCTION, ARG1, UNLESS_CONVERTIBLE_TO)\
-      BOOST_MOVE_FORCEINLINE RETURN_VALUE PUB_FUNCTION(ARG1 arg1, BOOST_MOVE_CATCH_CONST(TYPE) x)\
-      {  return FWD_FUNCTION(arg1, static_cast<const TYPE&>(x)); }\
-      \
-      BOOST_MOVE_FORCEINLINE RETURN_VALUE PUB_FUNCTION(ARG1 arg1, BOOST_MOVE_CATCH_RVALUE(TYPE) x) \
-      {  return FWD_FUNCTION(arg1, ::boost::move(x));  }\
-      \
-      BOOST_MOVE_FORCEINLINE RETURN_VALUE PUB_FUNCTION(ARG1 arg1, TYPE &x)\
-      {  return FWD_FUNCTION(arg1, const_cast<const TYPE &>(x)); }\
-   //
-   #if defined(BOOST_MOVE_HELPERS_RETURN_SFINAE_BROKEN)
-      #define BOOST_MOVE_CONVERSION_AWARE_CATCH_1ARG(PUB_FUNCTION, TYPE, RETURN_VALUE, FWD_FUNCTION, ARG1, UNLESS_CONVERTIBLE_TO)\
-         BOOST_MOVE_CONVERSION_AWARE_CATCH_1ARG_COMMON(PUB_FUNCTION, TYPE, RETURN_VALUE, FWD_FUNCTION, ARG1, UNLESS_CONVERTIBLE_TO)\
-         \
-         template<class BOOST_MOVE_TEMPL_PARAM>\
-         BOOST_MOVE_FORCEINLINE RETURN_VALUE PUB_FUNCTION(ARG1 arg1, const BOOST_MOVE_TEMPL_PARAM &u,\
-            typename boost_move_conversion_aware_catch_1arg_1<void, BOOST_MOVE_TEMPL_PARAM, UNLESS_CONVERTIBLE_TO, TYPE>::type* = 0)\
-         { return FWD_FUNCTION(arg1, u); }\
-         \
-         template<class BOOST_MOVE_TEMPL_PARAM>\
-         BOOST_MOVE_FORCEINLINE RETURN_VALUE PUB_FUNCTION(ARG1 arg1, const BOOST_MOVE_TEMPL_PARAM &u,\
-            typename boost_move_conversion_aware_catch_1arg_2<void, BOOST_MOVE_TEMPL_PARAM, UNLESS_CONVERTIBLE_TO, TYPE>::type* = 0)\
-         {\
-            TYPE t((u));\
-            return FWD_FUNCTION(arg1, ::boost::move(t));\
-         }\
-      //
-   #else
-      #define BOOST_MOVE_CONVERSION_AWARE_CATCH_1ARG(PUB_FUNCTION, TYPE, RETURN_VALUE, FWD_FUNCTION, ARG1, UNLESS_CONVERTIBLE_TO)\
-         BOOST_MOVE_CONVERSION_AWARE_CATCH_1ARG_COMMON(PUB_FUNCTION, TYPE, RETURN_VALUE, FWD_FUNCTION, ARG1, UNLESS_CONVERTIBLE_TO)\
-         \
-         template<class BOOST_MOVE_TEMPL_PARAM>\
-         BOOST_MOVE_FORCEINLINE typename boost_move_conversion_aware_catch_1arg_1<RETURN_VALUE, BOOST_MOVE_TEMPL_PARAM, UNLESS_CONVERTIBLE_TO, TYPE>::type\
-            PUB_FUNCTION(ARG1 arg1, const BOOST_MOVE_TEMPL_PARAM &u)\
-         { return FWD_FUNCTION(arg1, u); }\
-         \
-         template<class BOOST_MOVE_TEMPL_PARAM>\
-         BOOST_MOVE_FORCEINLINE typename boost_move_conversion_aware_catch_1arg_2<RETURN_VALUE, BOOST_MOVE_TEMPL_PARAM, UNLESS_CONVERTIBLE_TO, TYPE>::type\
-            PUB_FUNCTION(ARG1 arg1, const BOOST_MOVE_TEMPL_PARAM &u)\
-         {\
-            TYPE t((u));\
-            return FWD_FUNCTION(arg1, ::boost::move(t));\
-         }\
-      //
-   #endif
-
-#elif (defined(_MSC_VER) && (_MSC_VER == 1600))
-
-   #define BOOST_MOVE_CONVERSION_AWARE_CATCH_1ARG(PUB_FUNCTION, TYPE, RETURN_VALUE, FWD_FUNCTION, ARG1, UNLESS_CONVERTIBLE_TO)\
-      BOOST_MOVE_FORCEINLINE RETURN_VALUE PUB_FUNCTION(ARG1 arg1, BOOST_MOVE_CATCH_CONST(TYPE) x)\
-      {  return FWD_FUNCTION(arg1, static_cast<const TYPE&>(x)); }\
-      \
-      BOOST_MOVE_FORCEINLINE RETURN_VALUE PUB_FUNCTION(ARG1 arg1, BOOST_MOVE_CATCH_RVALUE(TYPE) x) \
-      {  return FWD_FUNCTION(arg1, ::boost::move(x));  }\
-      \
-      template<class BOOST_MOVE_TEMPL_PARAM>\
-      BOOST_MOVE_FORCEINLINE typename ::boost::move_detail::disable_if_or\
-                        < RETURN_VALUE \
-                        , ::boost::move_detail::is_same<TYPE, BOOST_MOVE_TEMPL_PARAM> \
-                        , ::boost::move_detail::is_same_or_convertible<BOOST_MOVE_TEMPL_PARAM, UNLESS_CONVERTIBLE_TO> \
-                        >::type\
-      PUB_FUNCTION(ARG1 arg1, const BOOST_MOVE_TEMPL_PARAM &u)\
-      {\
-         TYPE t((u));\
-         return FWD_FUNCTION(arg1, ::boost::move(t));\
-      }\
-   //
-
-#else
-
-   #define BOOST_MOVE_CONVERSION_AWARE_CATCH_1ARG(PUB_FUNCTION, TYPE, RETURN_VALUE, FWD_FUNCTION, ARG1, UNLESS_CONVERTIBLE_TO)\
-      BOOST_MOVE_FORCEINLINE RETURN_VALUE PUB_FUNCTION(ARG1 arg1, BOOST_MOVE_CATCH_CONST(TYPE) x)\
-      {  return FWD_FUNCTION(arg1, static_cast<const TYPE&>(x)); }\
-      \
-      BOOST_MOVE_FORCEINLINE RETURN_VALUE PUB_FUNCTION(ARG1 arg1, BOOST_MOVE_CATCH_RVALUE(TYPE) x) \
-      {  return FWD_FUNCTION(arg1, ::boost::move(x));  }\
-   //
-
-#endif
-
-#endif //#ifndef BOOST_MOVE_MOVE_HELPERS_HPP
diff --git a/src/boost/move/detail/placement_new.hpp b/src/boost/move/detail/placement_new.hpp
deleted file mode 100644
index 69d33328..00000000
--- a/src/boost/move/detail/placement_new.hpp
+++ /dev/null
@@ -1,30 +0,0 @@
-#ifndef BOOST_MOVE_DETAIL_PLACEMENT_NEW_HPP
-#define BOOST_MOVE_DETAIL_PLACEMENT_NEW_HPP
-///////////////////////////////////////////////////////////////////////////////
-//
-// (C) Copyright Ion Gaztanaga 2014-2015. Distributed under the Boost
-// 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.
-//
-///////////////////////////////////////////////////////////////////////////////
-
-#ifndef BOOST_CONFIG_HPP
-#  include <boost/config.hpp>
-#endif
-
-#if defined(BOOST_HAS_PRAGMA_ONCE)
-#  pragma once
-#endif
-
-struct boost_move_new_t{};
-
-//avoid including <new>
-inline void *operator new(std::size_t, void *p, boost_move_new_t)
-{  return p;  }
-
-inline void operator delete(void *, void *, boost_move_new_t)
-{}
-
-#endif   //BOOST_MOVE_DETAIL_PLACEMENT_NEW_HPP
diff --git a/src/boost/move/detail/pointer_element.hpp b/src/boost/move/detail/pointer_element.hpp
deleted file mode 100644
index ecdd6080..00000000
--- a/src/boost/move/detail/pointer_element.hpp
+++ /dev/null
@@ -1,168 +0,0 @@
-//////////////////////////////////////////////////////////////////////////////
-//
-// (C) Copyright Ion Gaztanaga 2014-2017. Distributed under the Boost
-// 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/move for documentation.
-//
-//////////////////////////////////////////////////////////////////////////////
-
-#ifndef BOOST_MOVE_DETAIL_POINTER_ELEMENT_HPP
-#define BOOST_MOVE_DETAIL_POINTER_ELEMENT_HPP
-
-#ifndef BOOST_CONFIG_HPP
-#  include <boost/config.hpp>
-#endif
-
-#if defined(BOOST_HAS_PRAGMA_ONCE)
-#  pragma once
-#endif
-
-#ifndef BOOST_MOVE_DETAIL_WORKAROUND_HPP
-#include <boost/move/detail/workaround.hpp>
-#endif   //BOOST_MOVE_DETAIL_WORKAROUND_HPP
-
-namespace boost {
-namespace movelib {
-namespace detail{
-
-//////////////////////
-//struct first_param
-//////////////////////
-
-template <typename T> struct first_param
-{  typedef void type;   };
-
-#if !defined(BOOST_NO_CXX11_VARIADIC_TEMPLATES)
-
-   template <template <typename, typename...> class TemplateClass, typename T, typename... Args>
-   struct first_param< TemplateClass<T, Args...> >
-   {
-      typedef T type;
-   };
-
-#else //C++03 compilers
-
-   template < template  //0arg
-               <class
-               > class TemplateClass, class T
-            >
-   struct first_param
-      < TemplateClass<T> >
-   {  typedef T type;   };
-
-   template < template  //1arg
-               <class,class
-               > class TemplateClass, class T
-            , class P0>
-   struct first_param
-      < TemplateClass<T, P0> >
-   {  typedef T type;   };
-
-   template < template  //2arg
-               <class,class,class
-               > class TemplateClass, class T
-            , class P0, class P1>
-   struct first_param
-      < TemplateClass<T, P0, P1> >
-   {  typedef T type;   };
-
-   template < template  //3arg
-               <class,class,class,class
-               > class TemplateClass, class T
-            , class P0, class P1, class P2>
-   struct first_param
-      < TemplateClass<T, P0, P1, P2> >
-   {  typedef T type;   };
-
-   template < template  //4arg
-               <class,class,class,class,class
-               > class TemplateClass, class T
-            , class P0, class P1, class P2, class P3>
-   struct first_param
-      < TemplateClass<T, P0, P1, P2, P3> >
-   {  typedef T type;   };
-
-   template < template  //5arg
-               <class,class,class,class,class,class
-               > class TemplateClass, class T
-            , class P0, class P1, class P2, class P3, class P4>
-   struct first_param
-      < TemplateClass<T, P0, P1, P2, P3, P4> >
-   {  typedef T type;   };
-
-   template < template  //6arg
-               <class,class,class,class,class,class,class
-               > class TemplateClass, class T
-            , class P0, class P1, class P2, class P3, class P4, class P5>
-   struct first_param
-      < TemplateClass<T, P0, P1, P2, P3, P4, P5> >
-   {  typedef T type;   };
-
-   template < template  //7arg
-               <class,class,class,class,class,class,class,class
-               > class TemplateClass, class T
-            , class P0, class P1, class P2, class P3, class P4, class P5, class P6>
-   struct first_param
-      < TemplateClass<T, P0, P1, P2, P3, P4, P5, P6> >
-   {  typedef T type;   };
-
-   template < template  //8arg
-               <class,class,class,class,class,class,class,class,class
-               > class TemplateClass, class T
-            , class P0, class P1, class P2, class P3, class P4, class P5, class P6, class P7>
-   struct first_param
-      < TemplateClass<T, P0, P1, P2, P3, P4, P5, P6, P7> >
-   {  typedef T type;   };
-
-   template < template  //9arg
-               <class,class,class,class,class,class,class,class,class,class
-               > class TemplateClass, class T
-            , class P0, class P1, class P2, class P3, class P4, class P5, class P6, class P7, class P8>
-   struct first_param
-      < TemplateClass<T, P0, P1, P2, P3, P4, P5, P6, P7, P8> >
-   {  typedef T type;   };
-
-#endif   //!defined(BOOST_NO_CXX11_VARIADIC_TEMPLATES)
-
-template <typename T>
-struct has_internal_pointer_element
-{
-   template <typename X>
-   static char test(int, typename X::element_type*);
-
-   template <typename X>
-   static int test(...);
-
-   static const bool value = (1 == sizeof(test<T>(0, 0)));
-};
-
-template<class Ptr, bool = has_internal_pointer_element<Ptr>::value>
-struct pointer_element_impl
-{
-   typedef typename Ptr::element_type type;
-};
-
-template<class Ptr>
-struct pointer_element_impl<Ptr, false>
-{
-   typedef typename boost::movelib::detail::first_param<Ptr>::type type;
-};
-
-}  //namespace detail{
-
-template <typename Ptr>
-struct pointer_element
-{
-   typedef typename ::boost::movelib::detail::pointer_element_impl<Ptr>::type type;
-};
-
-template <typename T>
-struct pointer_element<T*>
-{  typedef T type; };
-
-}  //namespace movelib {
-}  //namespace boost {
-
-#endif // defined(BOOST_MOVE_DETAIL_POINTER_ELEMENT_HPP)
diff --git a/src/boost/move/detail/reverse_iterator.hpp b/src/boost/move/detail/reverse_iterator.hpp
deleted file mode 100644
index 7fda6edf..00000000
--- a/src/boost/move/detail/reverse_iterator.hpp
+++ /dev/null
@@ -1,178 +0,0 @@
-/////////////////////////////////////////////////////////////////////////////
-//
-// (C) Copyright Ion Gaztanaga  2014-2014
-//
-// Distributed under the Boost 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/move for documentation.
-//
-/////////////////////////////////////////////////////////////////////////////
-
-#ifndef BOOST_MOVE_DETAIL_REVERSE_ITERATOR_HPP
-#define BOOST_MOVE_DETAIL_REVERSE_ITERATOR_HPP
-
-#ifndef BOOST_CONFIG_HPP
-#  include <boost/config.hpp>
-#endif
-
-#if defined(BOOST_HAS_PRAGMA_ONCE)
-#  pragma once
-#endif
-
-#include <boost/move/detail/config_begin.hpp>
-#include <boost/move/detail/iterator_traits.hpp>
-#include <boost/move/detail/meta_utils.hpp>
-
-namespace boost {
-namespace movelib {
-
-template<class I>
-BOOST_MOVE_FORCEINLINE typename iterator_traits<I>::pointer iterator_arrow_result(const I &i)
-{  return i.operator->();  }
-
-template<class T>
-BOOST_MOVE_FORCEINLINE T * iterator_arrow_result(T *p)
-{  return p;   }
-
-template<class It>
-class reverse_iterator
-{
-   public:
-   typedef typename boost::movelib::iterator_traits<It>::pointer             pointer;
-   typedef typename boost::movelib::iterator_traits<It>::reference           reference;
-   typedef typename boost::movelib::iterator_traits<It>::difference_type     difference_type;
-   typedef typename boost::movelib::iterator_traits<It>::iterator_category   iterator_category;
-   typedef typename boost::movelib::iterator_traits<It>::value_type          value_type;
-
-
-   typedef It iterator_type;
-
-   BOOST_MOVE_FORCEINLINE reverse_iterator()
-      : m_current()  //Value initialization to achieve "null iterators" (N3644)
-   {}
-
-   BOOST_MOVE_FORCEINLINE explicit reverse_iterator(It r)
-      : m_current(r)
-   {}
-
-   BOOST_MOVE_FORCEINLINE reverse_iterator(const reverse_iterator& r)
-      : m_current(r.base())
-   {}
-
-   template<class OtherIt>
-   BOOST_MOVE_FORCEINLINE
-      reverse_iterator( const reverse_iterator<OtherIt>& r
-                      , typename boost::move_detail::enable_if_convertible<OtherIt, It>::type* =0
-                   )
-      : m_current(r.base())
-   {}
-
-   BOOST_MOVE_FORCEINLINE reverse_iterator & operator=( const reverse_iterator& r)
-   {  m_current = r.base();   return *this;  }
-
-   template<class OtherIt>
-   BOOST_MOVE_FORCEINLINE typename boost::move_detail::enable_if_convertible<OtherIt, It, reverse_iterator &>::type
-         operator=( const reverse_iterator<OtherIt>& r)
-   {  m_current = r.base();   return *this;  }
-
-   BOOST_MOVE_FORCEINLINE It base() const
-   {  return m_current;  }
-
-   BOOST_MOVE_FORCEINLINE reference operator*() const
-   {
-      It temp(m_current);
-      --temp;
-      reference r = *temp;
-      return r;
-   }
-
-   BOOST_MOVE_FORCEINLINE pointer operator->() const
-   {
-      It temp(m_current);
-      --temp;
-      return (iterator_arrow_result)(temp);
-   }
-
-   BOOST_MOVE_FORCEINLINE reference operator[](difference_type off) const
-   {
-      return this->m_current[difference_type(-off - 1)];
-   }
-
-   BOOST_MOVE_FORCEINLINE reverse_iterator& operator++()
-   {
-      --m_current;
-      return *this;
-   }
-
-   BOOST_MOVE_FORCEINLINE reverse_iterator operator++(int)
-   {
-      reverse_iterator temp((*this));
-      --m_current;
-      return temp;
-   }
-
-   BOOST_MOVE_FORCEINLINE reverse_iterator& operator--()
-   {
-      ++m_current;
-      return *this;
-   }
-
-   BOOST_MOVE_FORCEINLINE reverse_iterator operator--(int)
-   {
-      reverse_iterator temp((*this));
-      ++m_current;
-      return temp;
-   }
-
-   BOOST_MOVE_FORCEINLINE friend bool operator==(const reverse_iterator& l, const reverse_iterator& r)
-   {  return l.m_current == r.m_current;  }
-
-   BOOST_MOVE_FORCEINLINE friend bool operator!=(const reverse_iterator& l, const reverse_iterator& r)
-   {  return l.m_current != r.m_current;  }
-
-   BOOST_MOVE_FORCEINLINE friend bool operator<(const reverse_iterator& l, const reverse_iterator& r)
-   {  return l.m_current > r.m_current;  }
-
-   BOOST_MOVE_FORCEINLINE friend bool operator<=(const reverse_iterator& l, const reverse_iterator& r)
-   {  return l.m_current >= r.m_current;  }
-
-   BOOST_MOVE_FORCEINLINE friend bool operator>(const reverse_iterator& l, const reverse_iterator& r)
-   {  return l.m_current < r.m_current;  }
-
-   BOOST_MOVE_FORCEINLINE friend bool operator>=(const reverse_iterator& l, const reverse_iterator& r)
-   {  return l.m_current <= r.m_current;  }
-
-   BOOST_MOVE_FORCEINLINE reverse_iterator& operator+=(difference_type off)
-   {  m_current -= off; return *this;  }
-
-   BOOST_MOVE_FORCEINLINE reverse_iterator& operator-=(difference_type off)
-   {  m_current += off; return *this;  }
-
-   BOOST_MOVE_FORCEINLINE friend reverse_iterator operator+(reverse_iterator l, difference_type off)
-   {  return (l += off);  }
-
-   BOOST_MOVE_FORCEINLINE friend reverse_iterator operator+(difference_type off, reverse_iterator r)
-   {  return (r += off);   }
-
-   BOOST_MOVE_FORCEINLINE friend reverse_iterator operator-(reverse_iterator l, difference_type off)
-   {  return (l-= off);  }
-
-   BOOST_MOVE_FORCEINLINE friend difference_type operator-(const reverse_iterator& l, const reverse_iterator& r)
-   {  return r.m_current - l.m_current;  }
-
-   private:
-   It m_current;   // the wrapped iterator
-};
-
-template< class Iterator >
-BOOST_MOVE_FORCEINLINE reverse_iterator<Iterator> make_reverse_iterator( Iterator i )
-{  return reverse_iterator<Iterator>(i);  }
-
-} //namespace movelib {
-} //namespace boost {
-
-#include <boost/move/detail/config_end.hpp>
-
-#endif //BOOST_MOVE_DETAIL_REVERSE_ITERATOR_HPP
diff --git a/src/boost/move/detail/std_ns_begin.hpp b/src/boost/move/detail/std_ns_begin.hpp
deleted file mode 100644
index 1d28117b..00000000
--- a/src/boost/move/detail/std_ns_begin.hpp
+++ /dev/null
@@ -1,34 +0,0 @@
-#//////////////////////////////////////////////////////////////////////////////
-#//
-#// (C) Copyright Ion Gaztanaga 2015-2015.
-#// Distributed under the Boost 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/move for documentation.
-#//
-#//////////////////////////////////////////////////////////////////////////////
-#
-#if defined(_LIBCPP_VERSION)
-   #if defined(__clang__)
-      #define BOOST_MOVE_STD_NS_GCC_DIAGNOSTIC_PUSH
-      #pragma GCC diagnostic push
-      #pragma GCC diagnostic ignored "-Wc++11-extensions"
-   #endif
-   #define BOOST_MOVE_STD_NS_BEG _LIBCPP_BEGIN_NAMESPACE_STD
-   #define BOOST_MOVE_STD_NS_END _LIBCPP_END_NAMESPACE_STD
-#elif defined(BOOST_GNU_STDLIB) && defined(_GLIBCXX_BEGIN_NAMESPACE_VERSION)  //GCC >= 4.6
-   #define BOOST_MOVE_STD_NS_BEG namespace std _GLIBCXX_VISIBILITY(default) { _GLIBCXX_BEGIN_NAMESPACE_VERSION
-   #define BOOST_MOVE_STD_NS_END _GLIBCXX_END_NAMESPACE_VERSION  } // namespace
-#elif defined(BOOST_GNU_STDLIB) && defined(_GLIBCXX_BEGIN_NAMESPACE)  //GCC >= 4.2
-   #define BOOST_MOVE_STD_NS_BEG _GLIBCXX_BEGIN_NAMESPACE(std)
-   #define BOOST_MOVE_STD_NS_END _GLIBCXX_END_NAMESPACE
-#else
-   #if defined(_MSC_VER) && (_MSC_VER >= 1915)
-      #pragma warning (push)
-      #pragma warning (disable : 4643) // Forward declaring 'X' in namespace std is not permitted by the C++ Standard
-   #endif
-
-   #define BOOST_MOVE_STD_NS_BEG namespace std{
-   #define BOOST_MOVE_STD_NS_END }
-#endif
diff --git a/src/boost/move/detail/std_ns_end.hpp b/src/boost/move/detail/std_ns_end.hpp
deleted file mode 100644
index 61af2d7b..00000000
--- a/src/boost/move/detail/std_ns_end.hpp
+++ /dev/null
@@ -1,16 +0,0 @@
-#//////////////////////////////////////////////////////////////////////////////
-#//
-#// (C) Copyright Ion Gaztanaga 2015-2015.
-#// Distributed under the Boost 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/move for documentation.
-#//
-#//////////////////////////////////////////////////////////////////////////////
-#ifdef BOOST_MOVE_STD_NS_GCC_DIAGNOSTIC_PUSH
-   #pragma GCC diagnostic pop
-   #undef BOOST_MOVE_STD_NS_GCC_DIAGNOSTIC_PUSH
-#elif defined(_MSC_VER) && (_MSC_VER >= 1915)
-   #pragma warning (pop)
-#endif   //BOOST_MOVE_STD_NS_GCC_DIAGNOSTIC_PUSH
diff --git a/src/boost/move/detail/to_raw_pointer.hpp b/src/boost/move/detail/to_raw_pointer.hpp
deleted file mode 100644
index 7e89beb4..00000000
--- a/src/boost/move/detail/to_raw_pointer.hpp
+++ /dev/null
@@ -1,45 +0,0 @@
-/////////////////////////////////////////////////////////////////////////////
-//
-// (C) Copyright Ion Gaztanaga  2017-2017
-//
-// Distributed under the Boost 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/move for documentation.
-//
-/////////////////////////////////////////////////////////////////////////////
-
-#ifndef BOOST_MOVE_DETAIL_TO_RAW_POINTER_HPP
-#define BOOST_MOVE_DETAIL_TO_RAW_POINTER_HPP
-
-#ifndef BOOST_CONFIG_HPP
-#  include <boost/config.hpp>
-#endif
-
-#if defined(BOOST_HAS_PRAGMA_ONCE)
-#  pragma once
-#endif
-
-#include <boost/move/detail/config_begin.hpp>
-#include <boost/move/detail/workaround.hpp>
-#include <boost/move/detail/pointer_element.hpp>
-
-namespace boost {
-namespace movelib {
-
-template <class T>
-BOOST_MOVE_FORCEINLINE T* to_raw_pointer(T* p)
-{  return p; }
-
-template <class Pointer>
-BOOST_MOVE_FORCEINLINE typename boost::movelib::pointer_element<Pointer>::type*
-to_raw_pointer(const Pointer &p)
-{  return ::boost::movelib::to_raw_pointer(p.operator->());  }
-
-} //namespace movelib
-} //namespace boost
-
-#include <boost/move/detail/config_end.hpp>
-
-#endif //BOOST_MOVE_DETAIL_TO_RAW_POINTER_HPP
diff --git a/src/boost/move/detail/unique_ptr_meta_utils.hpp b/src/boost/move/detail/unique_ptr_meta_utils.hpp
deleted file mode 100644
index 4c6aeb5b..00000000
--- a/src/boost/move/detail/unique_ptr_meta_utils.hpp
+++ /dev/null
@@ -1,565 +0,0 @@
-//////////////////////////////////////////////////////////////////////////////
-//
-// (C) Copyright Ion Gaztanaga 2012-2012.
-// Distributed under the Boost 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/move for documentation.
-//
-//////////////////////////////////////////////////////////////////////////////
-
-//! \file
-
-#ifndef BOOST_MOVE_UNIQUE_PTR_DETAIL_META_UTILS_HPP
-#define BOOST_MOVE_UNIQUE_PTR_DETAIL_META_UTILS_HPP
-
-#ifndef BOOST_CONFIG_HPP
-#  include <boost/config.hpp>
-#endif
-#
-#if defined(BOOST_HAS_PRAGMA_ONCE)
-#  pragma once
-#endif
-
-#include <cstddef>   //for std::size_t
-
-//Small meta-typetraits to support move
-
-namespace boost {
-
-namespace movelib {
-
-template <class T>
-struct default_delete;
-
-}  //namespace movelib {
-
-#ifdef BOOST_NO_CXX11_RVALUE_REFERENCES
-//Forward declare boost::rv
-template <class T> class rv;
-#endif
-
-namespace move_upmu {
-
-//////////////////////////////////////
-//              nat
-//////////////////////////////////////
-struct nat{};
-
-//////////////////////////////////////
-//            natify
-//////////////////////////////////////
-template <class T> struct natify{};
-
-//////////////////////////////////////
-//             if_c
-//////////////////////////////////////
-template<bool C, typename T1, typename T2>
-struct if_c
-{
-   typedef T1 type;
-};
-
-template<typename T1, typename T2>
-struct if_c<false,T1,T2>
-{
-   typedef T2 type;
-};
-
-//////////////////////////////////////
-//             if_
-//////////////////////////////////////
-template<typename T1, typename T2, typename T3>
-struct if_ : if_c<0 != T1::value, T2, T3>
-{};
-
-//enable_if_
-template <bool B, class T = nat>
-struct enable_if_c
-{
-   typedef T type;
-};
-
-//////////////////////////////////////
-//          enable_if_c
-//////////////////////////////////////
-template <class T>
-struct enable_if_c<false, T> {};
-
-//////////////////////////////////////
-//           enable_if
-//////////////////////////////////////
-template <class Cond, class T = nat>
-struct enable_if : public enable_if_c<Cond::value, T> {};
-
-//////////////////////////////////////
-//          remove_reference
-//////////////////////////////////////
-template<class T>
-struct remove_reference
-{
-   typedef T type;
-};
-
-template<class T>
-struct remove_reference<T&>
-{
-   typedef T type;
-};
-
-#ifndef BOOST_NO_CXX11_RVALUE_REFERENCES
-
-template<class T>
-struct remove_reference<T&&>
-{
-   typedef T type;
-};
-
-#else
-
-template<class T>
-struct remove_reference< rv<T> >
-{
-   typedef T type;
-};
-
-template<class T>
-struct remove_reference< rv<T> &>
-{
-   typedef T type;
-};
-
-template<class T>
-struct remove_reference< const rv<T> &>
-{
-   typedef T type;
-};
-
-
-#endif
-
-//////////////////////////////////////
-//             remove_const
-//////////////////////////////////////
-template< class T >
-struct remove_const
-{
-   typedef T type;
-};
-
-template< class T >
-struct remove_const<const T>
-{
-   typedef T type;
-};
-
-//////////////////////////////////////
-//             remove_volatile
-//////////////////////////////////////
-template< class T >
-struct remove_volatile
-{
-   typedef T type;
-};
-
-template< class T >
-struct remove_volatile<volatile T>
-{
-   typedef T type;
-};
-
-//////////////////////////////////////
-//             remove_cv
-//////////////////////////////////////
-template< class T >
-struct remove_cv
-{
-    typedef typename remove_volatile
-      <typename remove_const<T>::type>::type type;
-};
-
-//////////////////////////////////////
-//          remove_extent
-//////////////////////////////////////
-template<class T>
-struct remove_extent
-{
-   typedef T type;
-};
- 
-template<class T>
-struct remove_extent<T[]>
-{
-   typedef T type;
-};
- 
-template<class T, std::size_t N>
-struct remove_extent<T[N]>
-{
-   typedef T type;
-};
-
-//////////////////////////////////////
-//             extent
-//////////////////////////////////////
-
-template<class T, unsigned N = 0>
-struct extent
-{
-   static const std::size_t value = 0;
-};
- 
-template<class T>
-struct extent<T[], 0> 
-{
-   static const std::size_t value = 0;
-};
-
-template<class T, unsigned N>
-struct extent<T[], N>
-{
-   static const std::size_t value = extent<T, N-1>::value;
-};
-
-template<class T, std::size_t N>
-struct extent<T[N], 0> 
-{
-   static const std::size_t value = N;
-};
- 
-template<class T, std::size_t I, unsigned N>
-struct extent<T[I], N>
-{
-   static const std::size_t value = extent<T, N-1>::value;
-};
-
-//////////////////////////////////////
-//      add_lvalue_reference
-//////////////////////////////////////
-template<class T>
-struct add_lvalue_reference
-{
-   typedef T& type;
-};
-
-template<class T>
-struct add_lvalue_reference<T&>
-{
-   typedef T& type;
-};
-
-template<>
-struct add_lvalue_reference<void>
-{
-   typedef void type;
-};
-
-template<>
-struct add_lvalue_reference<const void>
-{
-   typedef const void type;
-};
-
-template<>
-struct add_lvalue_reference<volatile void>
-{
-   typedef volatile void type;
-};
-
-template<>
-struct add_lvalue_reference<const volatile void>
-{
-   typedef const volatile void type;
-};
-
-template<class T>
-struct add_const_lvalue_reference
-{
-   typedef typename remove_reference<T>::type   t_unreferenced;
-   typedef const t_unreferenced                 t_unreferenced_const;
-   typedef typename add_lvalue_reference
-      <t_unreferenced_const>::type              type;
-};
-
-//////////////////////////////////////
-//             is_same
-//////////////////////////////////////
-template<class T, class U>
-struct is_same
-{
-   static const bool value = false;
-};
- 
-template<class T>
-struct is_same<T, T>
-{
-   static const bool value = true;
-};
-
-//////////////////////////////////////
-//             is_pointer
-//////////////////////////////////////
-template< class T >
-struct is_pointer
-{
-    static const bool value = false;
-};
-
-template< class T >
-struct is_pointer<T*>
-{
-    static const bool value = true;
-};
-
-//////////////////////////////////////
-//             is_reference
-//////////////////////////////////////
-template< class T >
-struct is_reference
-{
-    static const bool value = false;
-};
-
-template< class T >
-struct is_reference<T&>
-{
-    static const bool value = true;
-};
-
-#ifndef BOOST_NO_CXX11_RVALUE_REFERENCES
-
-template< class T >
-struct is_reference<T&&>
-{
-    static const bool value = true;
-};
-
-#endif
-
-//////////////////////////////////////
-//             is_lvalue_reference
-//////////////////////////////////////
-template<class T>
-struct is_lvalue_reference
-{
-    static const bool value = false;
-};
-
-template<class T>
-struct is_lvalue_reference<T&>
-{
-    static const bool value = true;
-};
-
-//////////////////////////////////////
-//          is_array
-//////////////////////////////////////
-template<class T>
-struct is_array
-{
-   static const bool value = false;
-};
- 
-template<class T>
-struct is_array<T[]>
-{
-   static const bool value = true;
-};
- 
-template<class T, std::size_t N>
-struct is_array<T[N]>
-{
-   static const bool value = true;
-};
-
-//////////////////////////////////////
-//          has_pointer_type
-//////////////////////////////////////
-template <class T>
-struct has_pointer_type
-{
-   struct two { char c[2]; };
-   template <class U> static two test(...);
-   template <class U> static char test(typename U::pointer* = 0);
-   static const bool value = sizeof(test<T>(0)) == 1;
-};
-
-//////////////////////////////////////
-//             pointer_type
-//////////////////////////////////////
-template <class T, class D, bool = has_pointer_type<D>::value>
-struct pointer_type_imp
-{
-    typedef typename D::pointer type;
-};
-
-template <class T, class D>
-struct pointer_type_imp<T, D, false>
-{
-    typedef T* type;
-};
-
-template <class T, class D>
-struct pointer_type
-{
-    typedef typename pointer_type_imp
-      <typename remove_extent<T>::type, typename remove_reference<D>::type>::type type;
-};
-
-//////////////////////////////////////
-//           is_convertible
-//////////////////////////////////////
-#if defined(_MSC_VER) && (_MSC_VER >= 1400)
-
-//use intrinsic since in MSVC
-//overaligned types can't go through ellipsis
-template <class T, class U>
-struct is_convertible
-{
-   static const bool value = __is_convertible_to(T, U);
-};
-
-#else
-
-template <class T, class U>
-class is_convertible
-{
-   typedef typename add_lvalue_reference<T>::type t_reference;
-   typedef char true_t;
-   class false_t { char dummy[2]; };
-   static false_t dispatch(...);
-   static true_t  dispatch(U);
-   static t_reference       trigger();
-   public:
-   static const bool value = sizeof(dispatch(trigger())) == sizeof(true_t);
-};
-
-#endif
-
-//////////////////////////////////////
-//       is_unary_function
-//////////////////////////////////////
-#if defined(BOOST_MSVC) || defined(__BORLANDC_)
-#define BOOST_MOVE_TT_DECL __cdecl
-#else
-#define BOOST_MOVE_TT_DECL
-#endif
-
-#if defined(_MSC_EXTENSIONS) && !defined(__BORLAND__) && !defined(_WIN64) && !defined(_M_ARM) && !defined(_M_ARM64) && !defined(UNDER_CE)
-#define BOOST_MOVE_TT_TEST_MSC_FUNC_SIGS
-#endif
-
-template <typename T>
-struct is_unary_function_impl
-{  static const bool value = false; };
-
-// avoid duplicate definitions of is_unary_function_impl
-#ifndef BOOST_MOVE_TT_TEST_MSC_FUNC_SIGS
-
-template <typename R>
-struct is_unary_function_impl<R (*)()>
-{  static const bool value = true;  };
-
-template <typename R>
-struct is_unary_function_impl<R (*)(...)>
-{  static const bool value = true;  };
-
-#else // BOOST_MOVE_TT_TEST_MSC_FUNC_SIGS
-
-template <typename R>
-struct is_unary_function_impl<R (__stdcall*)()>
-{  static const bool value = true;  };
-
-#ifndef _MANAGED
-
-template <typename R>
-struct is_unary_function_impl<R (__fastcall*)()>
-{  static const bool value = true;  };
-
-#endif
-
-template <typename R>
-struct is_unary_function_impl<R (__cdecl*)()>
-{  static const bool value = true;  };
-
-template <typename R>
-struct is_unary_function_impl<R (__cdecl*)(...)>
-{  static const bool value = true;  };
-
-#endif
-
-// avoid duplicate definitions of is_unary_function_impl
-#ifndef BOOST_MOVE_TT_TEST_MSC_FUNC_SIGS
-
-template <typename R, class T0>
-struct is_unary_function_impl<R (*)(T0)>
-{  static const bool value = true;  };
-
-template <typename R, class T0>
-struct is_unary_function_impl<R (*)(T0...)>
-{  static const bool value = true;  };
-
-#else // BOOST_MOVE_TT_TEST_MSC_FUNC_SIGS
-
-template <typename R, class T0>
-struct is_unary_function_impl<R (__stdcall*)(T0)>
-{  static const bool value = true;  };
-
-#ifndef _MANAGED
-
-template <typename R, class T0>
-struct is_unary_function_impl<R (__fastcall*)(T0)>
-{  static const bool value = true;  };
-
-#endif
-
-template <typename R, class T0>
-struct is_unary_function_impl<R (__cdecl*)(T0)>
-{  static const bool value = true;  };
-
-template <typename R, class T0>
-struct is_unary_function_impl<R (__cdecl*)(T0...)>
-{  static const bool value = true;  };
-
-#endif
-
-template <typename T>
-struct is_unary_function_impl<T&>
-{  static const bool value = false; };
-
-template<typename T>
-struct is_unary_function
-{  static const bool value = is_unary_function_impl<T>::value;   };
-
-//////////////////////////////////////
-//       has_virtual_destructor
-//////////////////////////////////////
-#if (defined(BOOST_MSVC) && defined(BOOST_MSVC_FULL_VER) && (BOOST_MSVC_FULL_VER >=140050215))\
-         || (defined(BOOST_INTEL) && defined(_MSC_VER) && (_MSC_VER >= 1500))
-#  define BOOST_MOVEUP_HAS_VIRTUAL_DESTRUCTOR(T) __has_virtual_destructor(T)
-#elif defined(BOOST_CLANG) && defined(__has_feature)
-#  if __has_feature(has_virtual_destructor)
-#     define BOOST_MOVEUP_HAS_VIRTUAL_DESTRUCTOR(T) __has_virtual_destructor(T)
-#  endif
-#elif defined(__GNUC__) && ((__GNUC__ > 4) || ((__GNUC__ == 4) && (__GNUC_MINOR__ >= 3) && !defined(__GCCXML__))) && !defined(BOOST_CLANG)
-#  define BOOST_MOVEUP_HAS_VIRTUAL_DESTRUCTOR(T) __has_virtual_destructor(T)
-#elif defined(__ghs__) && (__GHS_VERSION_NUMBER >= 600)
-#  define BOOST_MOVEUP_HAS_VIRTUAL_DESTRUCTOR(T) __has_virtual_destructor(T)
-#elif defined(BOOST_CODEGEARC)
-#  define BOOST_MOVEUP_HAS_VIRTUAL_DESTRUCTOR(T) __has_virtual_destructor(T)
-#endif
-
-#ifdef BOOST_MOVEUP_HAS_VIRTUAL_DESTRUCTOR
-   template<class T>
-   struct has_virtual_destructor{   static const bool value = BOOST_MOVEUP_HAS_VIRTUAL_DESTRUCTOR(T);  };
-#else
-   //If no intrinsic is available you trust the programmer knows what is doing
-   template<class T>
-   struct has_virtual_destructor{   static const bool value = true;  };
-#endif
-
-}  //namespace move_upmu {
-}  //namespace boost {
-
-#endif //#ifndef BOOST_MOVE_UNIQUE_PTR_DETAIL_META_UTILS_HPP
diff --git a/src/boost/move/iterator.hpp b/src/boost/move/iterator.hpp
deleted file mode 100644
index c289c083..00000000
--- a/src/boost/move/iterator.hpp
+++ /dev/null
@@ -1,311 +0,0 @@
-//////////////////////////////////////////////////////////////////////////////
-//
-// (C) Copyright Ion Gaztanaga 2012-2012.
-// Distributed under the Boost 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/move for documentation.
-//
-//////////////////////////////////////////////////////////////////////////////
-
-//! \file
-
-#ifndef BOOST_MOVE_ITERATOR_HPP
-#define BOOST_MOVE_ITERATOR_HPP
-
-#ifndef BOOST_CONFIG_HPP
-#  include <boost/config.hpp>
-#endif
-#
-#if defined(BOOST_HAS_PRAGMA_ONCE)
-#  pragma once
-#endif
-
-#include <boost/move/detail/config_begin.hpp>
-#include <boost/move/detail/workaround.hpp>  //forceinline
-#include <boost/move/detail/iterator_traits.hpp>
-#include <boost/move/utility_core.hpp>
-
-namespace boost {
-
-//////////////////////////////////////////////////////////////////////////////
-//
-//                            move_iterator
-//
-//////////////////////////////////////////////////////////////////////////////
-
-//! Class template move_iterator is an iterator adaptor with the same behavior
-//! as the underlying iterator except that its dereference operator implicitly
-//! converts the value returned by the underlying iterator's dereference operator
-//! to an rvalue reference. Some generic algorithms can be called with move
-//! iterators to replace copying with moving.
-template <class It>
-class move_iterator
-{
-   public:
-   typedef It                                                              iterator_type;
-   typedef typename boost::movelib::iterator_traits<iterator_type>::value_type        value_type;
-   #if !defined(BOOST_NO_CXX11_RVALUE_REFERENCES) || defined(BOOST_MOVE_DOXYGEN_INVOKED)
-   typedef value_type &&                                                   reference;
-   #else
-   typedef typename ::boost::move_detail::if_
-      < ::boost::has_move_emulation_enabled<value_type>
-      , ::boost::rv<value_type>&
-      , value_type & >::type                                               reference;
-   #endif
-   typedef It                                                              pointer;
-   typedef typename boost::movelib::iterator_traits<iterator_type>::difference_type   difference_type;
-   typedef typename boost::movelib::iterator_traits<iterator_type>::iterator_category iterator_category;
-
-   BOOST_MOVE_FORCEINLINE move_iterator()
-      : m_it()
-   {}
-
-   BOOST_MOVE_FORCEINLINE explicit move_iterator(const It &i)
-      :  m_it(i)
-   {}
-
-   template <class U>
-   BOOST_MOVE_FORCEINLINE move_iterator(const move_iterator<U>& u)
-      :  m_it(u.m_it)
-   {}
-
-   BOOST_MOVE_FORCEINLINE reference operator*() const
-   {
-      #if defined(BOOST_NO_CXX11_RVALUE_REFERENCES) || defined(BOOST_MOVE_OLD_RVALUE_REF_BINDING_RULES)
-      return *m_it;
-      #else
-      return ::boost::move(*m_it);
-      #endif
-   }
-
-   BOOST_MOVE_FORCEINLINE pointer   operator->() const
-   {  return m_it;   }
-
-   BOOST_MOVE_FORCEINLINE move_iterator& operator++()
-   {  ++m_it; return *this;   }
-
-   BOOST_MOVE_FORCEINLINE move_iterator<iterator_type>  operator++(int)
-   {  move_iterator<iterator_type> tmp(*this); ++(*this); return tmp;   }
-
-   BOOST_MOVE_FORCEINLINE move_iterator& operator--()
-   {  --m_it; return *this;   }
-
-   BOOST_MOVE_FORCEINLINE move_iterator<iterator_type>  operator--(int)
-   {  move_iterator<iterator_type> tmp(*this); --(*this); return tmp;   }
-
-   move_iterator<iterator_type>  operator+ (difference_type n) const
-   {  return move_iterator<iterator_type>(m_it + n);  }
-
-   BOOST_MOVE_FORCEINLINE move_iterator& operator+=(difference_type n)
-   {  m_it += n; return *this;   }
-
-   BOOST_MOVE_FORCEINLINE move_iterator<iterator_type>  operator- (difference_type n) const
-   {  return move_iterator<iterator_type>(m_it - n);  }
-
-   BOOST_MOVE_FORCEINLINE move_iterator& operator-=(difference_type n)
-   {  m_it -= n; return *this;   }
-
-   BOOST_MOVE_FORCEINLINE reference operator[](difference_type n) const
-   {
-      #if defined(BOOST_NO_CXX11_RVALUE_REFERENCES) || defined(BOOST_MOVE_OLD_RVALUE_REF_BINDING_RULES)
-      return m_it[n];
-      #else
-      return ::boost::move(m_it[n]);
-      #endif
-   }
-
-   BOOST_MOVE_FORCEINLINE friend bool operator==(const move_iterator& x, const move_iterator& y)
-   {  return x.m_it == y.m_it;  }
-
-   BOOST_MOVE_FORCEINLINE friend bool operator!=(const move_iterator& x, const move_iterator& y)
-   {  return x.m_it != y.m_it;  }
-
-   BOOST_MOVE_FORCEINLINE friend bool operator< (const move_iterator& x, const move_iterator& y)
-   {  return x.m_it < y.m_it;   }
-
-   BOOST_MOVE_FORCEINLINE friend bool operator<=(const move_iterator& x, const move_iterator& y)
-   {  return x.m_it <= y.m_it;  }
-
-   BOOST_MOVE_FORCEINLINE friend bool operator> (const move_iterator& x, const move_iterator& y)
-   {  return x.m_it > y.m_it;  }
-
-   BOOST_MOVE_FORCEINLINE friend bool operator>=(const move_iterator& x, const move_iterator& y)
-   {  return x.m_it >= y.m_it;  }
-
-   BOOST_MOVE_FORCEINLINE friend difference_type operator-(const move_iterator& x, const move_iterator& y)
-   {  return x.m_it - y.m_it;   }
-
-   BOOST_MOVE_FORCEINLINE friend move_iterator operator+(difference_type n, const move_iterator& x)
-   {  return move_iterator(x.m_it + n);   }
-
-   private:
-   It m_it;
-};
-
-//is_move_iterator
-namespace move_detail {
-
-template <class I>
-struct is_move_iterator
-{
-   static const bool value = false;
-};
-
-template <class I>
-struct is_move_iterator< ::boost::move_iterator<I> >
-{
-   static const bool value = true;
-};
-
-}  //namespace move_detail {
-
-//////////////////////////////////////////////////////////////////////////////
-//
-//                            move_iterator
-//
-//////////////////////////////////////////////////////////////////////////////
-
-//!
-//! <b>Returns</b>: move_iterator<It>(i).
-template<class It>
-BOOST_MOVE_FORCEINLINE move_iterator<It> make_move_iterator(const It &it)
-{  return move_iterator<It>(it); }
-
-//////////////////////////////////////////////////////////////////////////////
-//
-//                         back_move_insert_iterator
-//
-//////////////////////////////////////////////////////////////////////////////
-
-
-//! A move insert iterator that move constructs elements at the
-//! back of a container
-template <typename C> // C models Container
-class back_move_insert_iterator
-{
-   C* container_m;
-
-   public:
-   typedef C                           container_type;
-   typedef typename C::value_type      value_type;
-   typedef typename C::reference       reference;
-   typedef typename C::pointer         pointer;
-   typedef typename C::difference_type difference_type;
-   typedef std::output_iterator_tag    iterator_category;
-
-   explicit back_move_insert_iterator(C& x) : container_m(&x) { }
-
-   back_move_insert_iterator& operator=(reference x)
-   { container_m->push_back(boost::move(x)); return *this; }
-
-   back_move_insert_iterator& operator=(BOOST_RV_REF(value_type) x)
-   {  reference rx = x; return this->operator=(rx);  }
-
-   back_move_insert_iterator& operator*()     { return *this; }
-   back_move_insert_iterator& operator++()    { return *this; }
-   back_move_insert_iterator& operator++(int) { return *this; }
-};
-
-//!
-//! <b>Returns</b>: back_move_insert_iterator<C>(x).
-template <typename C> // C models Container
-inline back_move_insert_iterator<C> back_move_inserter(C& x)
-{
-   return back_move_insert_iterator<C>(x);
-}
-
-//////////////////////////////////////////////////////////////////////////////
-//
-//                         front_move_insert_iterator
-//
-//////////////////////////////////////////////////////////////////////////////
-
-//! A move insert iterator that move constructs elements int the
-//! front of a container
-template <typename C> // C models Container
-class front_move_insert_iterator
-{
-   C* container_m;
-
-public:
-   typedef C                           container_type;
-   typedef typename C::value_type      value_type;
-   typedef typename C::reference       reference;
-   typedef typename C::pointer         pointer;
-   typedef typename C::difference_type difference_type;
-   typedef std::output_iterator_tag    iterator_category;
-
-   explicit front_move_insert_iterator(C& x) : container_m(&x) { }
-
-   front_move_insert_iterator& operator=(reference x)
-   { container_m->push_front(boost::move(x)); return *this; }
-
-   front_move_insert_iterator& operator=(BOOST_RV_REF(value_type) x)
-   {  reference rx = x; return this->operator=(rx);  }
-
-   front_move_insert_iterator& operator*()     { return *this; }
-   front_move_insert_iterator& operator++()    { return *this; }
-   front_move_insert_iterator& operator++(int) { return *this; }
-};
-
-//!
-//! <b>Returns</b>: front_move_insert_iterator<C>(x).
-template <typename C> // C models Container
-inline front_move_insert_iterator<C> front_move_inserter(C& x)
-{
-   return front_move_insert_iterator<C>(x);
-}
-
-//////////////////////////////////////////////////////////////////////////////
-//
-//                         insert_move_iterator
-//
-//////////////////////////////////////////////////////////////////////////////
-template <typename C> // C models Container
-class move_insert_iterator
-{
-   C* container_m;
-   typename C::iterator pos_;
-
-   public:
-   typedef C                           container_type;
-   typedef typename C::value_type      value_type;
-   typedef typename C::reference       reference;
-   typedef typename C::pointer         pointer;
-   typedef typename C::difference_type difference_type;
-   typedef std::output_iterator_tag    iterator_category;
-
-   explicit move_insert_iterator(C& x, typename C::iterator pos)
-      : container_m(&x), pos_(pos)
-   {}
-
-   move_insert_iterator& operator=(reference x)
-   {
-      pos_ = container_m->insert(pos_, ::boost::move(x));
-      ++pos_;
-      return *this;
-   }
-
-   move_insert_iterator& operator=(BOOST_RV_REF(value_type) x)
-   {  reference rx = x; return this->operator=(rx);  }
-
-   move_insert_iterator& operator*()     { return *this; }
-   move_insert_iterator& operator++()    { return *this; }
-   move_insert_iterator& operator++(int) { return *this; }
-};
-
-//!
-//! <b>Returns</b>: move_insert_iterator<C>(x, it).
-template <typename C> // C models Container
-inline move_insert_iterator<C> move_inserter(C& x, typename C::iterator it)
-{
-   return move_insert_iterator<C>(x, it);
-}
-
-}  //namespace boost {
-
-#include <boost/move/detail/config_end.hpp>
-
-#endif //#ifndef BOOST_MOVE_ITERATOR_HPP
diff --git a/src/boost/move/make_unique.hpp b/src/boost/move/make_unique.hpp
deleted file mode 100644
index 2d421fcf..00000000
--- a/src/boost/move/make_unique.hpp
+++ /dev/null
@@ -1,248 +0,0 @@
-//////////////////////////////////////////////////////////////////////////////
-//
-// (C) Copyright Ion Gaztanaga 2006-2014. Distributed under the Boost
-// 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/move for documentation.
-//
-//////////////////////////////////////////////////////////////////////////////
-
-#ifndef BOOST_MOVE_MAKE_UNIQUE_HPP_INCLUDED
-#define BOOST_MOVE_MAKE_UNIQUE_HPP_INCLUDED
-
-#ifndef BOOST_CONFIG_HPP
-#  include <boost/config.hpp>
-#endif
-#
-#if defined(BOOST_HAS_PRAGMA_ONCE)
-#  pragma once
-#endif
-
-#include <boost/move/detail/config_begin.hpp>
-#include <boost/move/detail/workaround.hpp>
-#include <boost/move/utility_core.hpp>
-#include <boost/move/unique_ptr.hpp>
-#include <cstddef>   //for std::size_t
-#include <boost/move/detail/unique_ptr_meta_utils.hpp>
-#ifdef BOOST_NO_CXX11_VARIADIC_TEMPLATES
-#  include <boost/move/detail/fwd_macros.hpp>
-#endif
-
-//!\file
-//! Defines "make_unique" functions, which are factories to create instances
-//! of unique_ptr depending on the passed arguments.
-//!
-//! This header can be a bit heavyweight in C++03 compilers due to the use of the
-//! preprocessor library, that's why it's a a separate header from <tt>unique_ptr.hpp</tt>
- 
-#if !defined(BOOST_MOVE_DOXYGEN_INVOKED)
-
-#if defined(_MSC_VER) && (_MSC_VER >= 1915)
-   #pragma warning (push)
-   #pragma warning (disable : 4643) // Forward declaring 'X' in namespace std is not permitted by the C++ Standard
-#endif
-
-namespace std {   //no namespace versioning in clang+libc++
-
-struct nothrow_t;
-
-}  //namespace std {
-
-#if defined(_MSC_VER) && (_MSC_VER >= 1915)
-   #pragma warning (pop)
-#endif
-
-
-namespace boost{
-namespace move_upmu {
-
-//Compile time switch between
-//single element, unknown bound array
-//and known bound array
-template<class T>
-struct unique_ptr_if
-{
-   typedef ::boost::movelib::unique_ptr<T> t_is_not_array;
-};
-
-template<class T>
-struct unique_ptr_if<T[]>
-{
-   typedef ::boost::movelib::unique_ptr<T[]> t_is_array_of_unknown_bound;
-};
-
-template<class T, std::size_t N>
-struct unique_ptr_if<T[N]>
-{
-   typedef void t_is_array_of_known_bound;
-};
-
-template <int Dummy = 0>
-struct nothrow_holder
-{
-   static std::nothrow_t *pnothrow;   
-};
-
-template <int Dummy>
-std::nothrow_t *nothrow_holder<Dummy>::pnothrow = 
-   reinterpret_cast<std::nothrow_t *>(0x1234);  //Avoid reference to null errors in sanitizers
-
-}  //namespace move_upmu {
-}  //namespace boost{
-
-#endif   //!defined(BOOST_MOVE_DOXYGEN_INVOKED)
-
-namespace boost{
-namespace movelib {
-
-#if defined(BOOST_MOVE_DOXYGEN_INVOKED) || !defined(BOOST_NO_CXX11_VARIADIC_TEMPLATES)
-
-//! <b>Remarks</b>: This function shall not participate in overload resolution unless T is not an array.
-//!
-//! <b>Returns</b>: <tt>unique_ptr<T>(new T(std::forward<Args>(args)...))</tt>.
-template<class T, class... Args>
-inline BOOST_MOVE_DOC1ST(unique_ptr<T>, 
-   typename ::boost::move_upmu::unique_ptr_if<T>::t_is_not_array)
-      make_unique(BOOST_FWD_REF(Args)... args)
-{  return unique_ptr<T>(new T(::boost::forward<Args>(args)...));  }
-
-//! <b>Remarks</b>: This function shall not participate in overload resolution unless T is not an array.
-//!
-//! <b>Returns</b>: <tt>unique_ptr<T>(new T(std::nothrow)(std::forward<Args>(args)...))</tt>.
-template<class T, class... Args>
-inline BOOST_MOVE_DOC1ST(unique_ptr<T>, 
-   typename ::boost::move_upmu::unique_ptr_if<T>::t_is_not_array)
-      make_unique_nothrow(BOOST_FWD_REF(Args)... args)
-{  return unique_ptr<T>(new (*boost::move_upmu::nothrow_holder<>::pnothrow)T(::boost::forward<Args>(args)...));  }
-
-#else
-   #define BOOST_MOVE_MAKE_UNIQUE_CODE(N)\
-      template<class T BOOST_MOVE_I##N BOOST_MOVE_CLASS##N>\
-      typename ::boost::move_upmu::unique_ptr_if<T>::t_is_not_array\
-         make_unique( BOOST_MOVE_UREF##N)\
-      {  return unique_ptr<T>( new T( BOOST_MOVE_FWD##N ) );  }\
-      \
-      template<class T BOOST_MOVE_I##N BOOST_MOVE_CLASS##N>\
-      typename ::boost::move_upmu::unique_ptr_if<T>::t_is_not_array\
-         make_unique_nothrow( BOOST_MOVE_UREF##N)\
-      {  return unique_ptr<T>( new (*boost::move_upmu::nothrow_holder<>::pnothrow)T ( BOOST_MOVE_FWD##N ) );  }\
-      //
-   BOOST_MOVE_ITERATE_0TO9(BOOST_MOVE_MAKE_UNIQUE_CODE)
-   #undef BOOST_MOVE_MAKE_UNIQUE_CODE
-
-#endif
-
-//! <b>Remarks</b>: This function shall not participate in overload resolution unless T is not an array.
-//!
-//! <b>Returns</b>: <tt>unique_ptr<T>(new T)</tt> (default initialization)
-template<class T>
-inline BOOST_MOVE_DOC1ST(unique_ptr<T>, 
-   typename ::boost::move_upmu::unique_ptr_if<T>::t_is_not_array)
-      make_unique_definit()
-{
-    return unique_ptr<T>(new T);
-}
-
-//! <b>Remarks</b>: This function shall not participate in overload resolution unless T is not an array.
-//!
-//! <b>Returns</b>: <tt>unique_ptr<T>(new T(std::nothrow)</tt> (default initialization)
-template<class T>
-inline BOOST_MOVE_DOC1ST(unique_ptr<T>, 
-   typename ::boost::move_upmu::unique_ptr_if<T>::t_is_not_array)
-      make_unique_nothrow_definit()
-{
-    return unique_ptr<T>(new (*boost::move_upmu::nothrow_holder<>::pnothrow)T);
-}
-
-//! <b>Remarks</b>: This function shall not participate in overload resolution unless T is an array of 
-//!   unknown bound.
-//!
-//! <b>Returns</b>: <tt>unique_ptr<T>(new remove_extent_t<T>[n]())</tt> (value initialization)
-template<class T>
-inline BOOST_MOVE_DOC1ST(unique_ptr<T>, 
-   typename ::boost::move_upmu::unique_ptr_if<T>::t_is_array_of_unknown_bound)
-      make_unique(std::size_t n)
-{
-    typedef typename ::boost::move_upmu::remove_extent<T>::type U;
-    return unique_ptr<T>(new U[n]());
-}
-
-//! <b>Remarks</b>: This function shall not participate in overload resolution unless T is an array of 
-//!   unknown bound.
-//!
-//! <b>Returns</b>: <tt>unique_ptr<T>(new (std::nothrow)remove_extent_t<T>[n]())</tt> (value initialization)
-template<class T>
-inline BOOST_MOVE_DOC1ST(unique_ptr<T>, 
-   typename ::boost::move_upmu::unique_ptr_if<T>::t_is_array_of_unknown_bound)
-      make_unique_nothrow(std::size_t n)
-{
-    typedef typename ::boost::move_upmu::remove_extent<T>::type U;
-    return unique_ptr<T>(new (*boost::move_upmu::nothrow_holder<>::pnothrow)U[n]());
-}
-
-//! <b>Remarks</b>: This function shall not participate in overload resolution unless T is an array of 
-//!   unknown bound.
-//!
-//! <b>Returns</b>: <tt>unique_ptr<T>(new remove_extent_t<T>[n])</tt> (default initialization)
-template<class T>
-inline BOOST_MOVE_DOC1ST(unique_ptr<T>, 
-   typename ::boost::move_upmu::unique_ptr_if<T>::t_is_array_of_unknown_bound)
-      make_unique_definit(std::size_t n)
-{
-    typedef typename ::boost::move_upmu::remove_extent<T>::type U;
-    return unique_ptr<T>(new U[n]);
-}
-
-//! <b>Remarks</b>: This function shall not participate in overload resolution unless T is an array of 
-//!   unknown bound.
-//!
-//! <b>Returns</b>: <tt>unique_ptr<T>(new (std::nothrow)remove_extent_t<T>[n])</tt> (default initialization)
-template<class T>
-inline BOOST_MOVE_DOC1ST(unique_ptr<T>, 
-   typename ::boost::move_upmu::unique_ptr_if<T>::t_is_array_of_unknown_bound)
-      make_unique_nothrow_definit(std::size_t n)
-{
-    typedef typename ::boost::move_upmu::remove_extent<T>::type U;
-    return unique_ptr<T>(new (*boost::move_upmu::nothrow_holder<>::pnothrow) U[n]);
-}
-
-#if !defined(BOOST_NO_CXX11_DELETED_FUNCTIONS)
-
-//! <b>Remarks</b>: This function shall not participate in overload resolution unless T is
-//!   an array of known bound.
-template<class T, class... Args>
-inline BOOST_MOVE_DOC1ST(unspecified, 
-   typename ::boost::move_upmu::unique_ptr_if<T>::t_is_array_of_known_bound)
-      make_unique(BOOST_FWD_REF(Args) ...) = delete;
-
-//! <b>Remarks</b>: This function shall not participate in overload resolution unless T is
-//!   an array of known bound.
-template<class T, class... Args>
-inline BOOST_MOVE_DOC1ST(unspecified, 
-   typename ::boost::move_upmu::unique_ptr_if<T>::t_is_array_of_known_bound)
-      make_unique_definit(BOOST_FWD_REF(Args) ...) = delete;
-
-//! <b>Remarks</b>: This function shall not participate in overload resolution unless T is
-//!   an array of known bound.
-template<class T, class... Args>
-inline BOOST_MOVE_DOC1ST(unspecified, 
-   typename ::boost::move_upmu::unique_ptr_if<T>::t_is_array_of_known_bound)
-      make_unique_nothrow(BOOST_FWD_REF(Args) ...) = delete;
-
-//! <b>Remarks</b>: This function shall not participate in overload resolution unless T is
-//!   an array of known bound.
-template<class T, class... Args>
-inline BOOST_MOVE_DOC1ST(unspecified, 
-   typename ::boost::move_upmu::unique_ptr_if<T>::t_is_array_of_known_bound)
-      make_unique_nothrow_definit(BOOST_FWD_REF(Args) ...) = delete;
-
-#endif
-
-}  //namespace movelib {
-
-}  //namespace boost{
-
-#include <boost/move/detail/config_end.hpp>
-
-#endif   //#ifndef BOOST_MOVE_MAKE_UNIQUE_HPP_INCLUDED
diff --git a/src/boost/move/move.hpp b/src/boost/move/move.hpp
deleted file mode 100644
index 62dddbc9..00000000
--- a/src/boost/move/move.hpp
+++ /dev/null
@@ -1,35 +0,0 @@
-//////////////////////////////////////////////////////////////////////////////
-//
-// (C) Copyright David Abrahams, Vicente Botet 2009.
-// (C) Copyright Ion Gaztanaga 2009-2012.
-// Distributed under the Boost 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/move for documentation.
-//
-//////////////////////////////////////////////////////////////////////////////
-
-//! \file
-//! A general library header that includes
-//! the rest of top-level headers.
-
-#ifndef BOOST_MOVE_MOVE_HPP
-#define BOOST_MOVE_MOVE_HPP
-
-#ifndef BOOST_CONFIG_HPP
-#  include <boost/config.hpp>
-#endif
-#
-#if defined(BOOST_HAS_PRAGMA_ONCE)
-#  pragma once
-#endif
-
-#include <boost/move/detail/config_begin.hpp>
-#include <boost/move/utility.hpp>
-#include <boost/move/iterator.hpp>
-#include <boost/move/traits.hpp>
-#include <boost/move/algorithm.hpp>
-#include <boost/move/detail/config_end.hpp>
-
-#endif //#ifndef BOOST_MOVE_MOVE_HPP
diff --git a/src/boost/move/unique_ptr.hpp b/src/boost/move/unique_ptr.hpp
deleted file mode 100644
index 21028722..00000000
--- a/src/boost/move/unique_ptr.hpp
+++ /dev/null
@@ -1,870 +0,0 @@
-//////////////////////////////////////////////////////////////////////////////
-//
-// (C) Copyright Ion Gaztanaga 2014-2014. Distributed under the Boost
-// 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/move for documentation.
-//
-//////////////////////////////////////////////////////////////////////////////
-
-#ifndef BOOST_MOVE_UNIQUE_PTR_HPP_INCLUDED
-#define BOOST_MOVE_UNIQUE_PTR_HPP_INCLUDED
-
-#ifndef BOOST_CONFIG_HPP
-#  include <boost/config.hpp>
-#endif
-#
-#if defined(BOOST_HAS_PRAGMA_ONCE)
-#  pragma once
-#endif
-
-#include <boost/move/detail/config_begin.hpp>
-#include <boost/move/detail/workaround.hpp>  //forceinline
-#include <boost/move/detail/unique_ptr_meta_utils.hpp>
-#include <boost/move/default_delete.hpp>
-#include <boost/move/utility_core.hpp>
-#include <boost/move/adl_move_swap.hpp>
-#include <cassert>
-
-#include <cstddef>   //For std::nullptr_t and std::size_t
-
-//!\file
-//! Describes the smart pointer unique_ptr, a drop-in replacement for std::unique_ptr,
-//! usable also from C++03 compilers.
-//!
-//! Main differences from std::unique_ptr to avoid heavy dependencies,
-//! specially in C++03 compilers:
-//!   - <tt>operator < </tt> uses pointer <tt>operator < </tt>instead of <tt>std::less<common_type></tt>. 
-//!      This avoids dependencies on <tt>std::common_type</tt> and <tt>std::less</tt>
-//!      (<tt><type_traits>/<functional></tt> headers). In C++03 this avoid pulling Boost.Typeof and other
-//!      cascading dependencies. As in all Boost platforms <tt>operator <</tt> on raw pointers and
-//!      other smart pointers provides strict weak ordering in practice this should not be a problem for users.
-//!   - assignable from literal 0 for compilers without nullptr
-//!   - <tt>unique_ptr<T[]></tt> is constructible and assignable from <tt>unique_ptr<U[]></tt> if
-//!      cv-less T and cv-less U are the same type and T is more CV qualified than U.
-
-namespace boost{
-// @cond
-namespace move_upd {
-
-////////////////////////////////////////////
-//          deleter types
-////////////////////////////////////////////
-#if defined(BOOST_NO_CXX11_RVALUE_REFERENCES)
-template <class T>
-class is_noncopyable
-{
-   typedef char true_t;
-   class false_t { char dummy[2]; };
-   template<class U> static false_t dispatch(...);
-   template<class U> static true_t  dispatch(typename U::boost_move_no_copy_constructor_or_assign*);
-   public:
-   static const bool value = sizeof(dispatch<T>(0)) == sizeof(true_t);
-};
-#endif   //defined(BOOST_NO_CXX11_RVALUE_REFERENCES)
-
-template <class D>
-struct deleter_types
-{
-   typedef typename bmupmu::add_lvalue_reference<D>::type            del_ref;
-   typedef typename bmupmu::add_const_lvalue_reference<D>::type      del_cref;
-   #ifndef BOOST_NO_CXX11_RVALUE_REFERENCES
-   typedef typename bmupmu::if_c
-      < bmupmu::is_lvalue_reference<D>::value, D, del_cref >::type   deleter_arg_type1;
-   typedef typename bmupmu::remove_reference<D>::type &&             deleter_arg_type2;
-   #else
-   typedef typename bmupmu::if_c
-      < is_noncopyable<D>::value, bmupmu::nat, del_cref>::type       non_ref_deleter_arg1;
-   typedef typename bmupmu::if_c< bmupmu::is_lvalue_reference<D>::value
-                       , D, non_ref_deleter_arg1 >::type          deleter_arg_type1;
-   typedef ::boost::rv<D> &                                       deleter_arg_type2;
-   #endif
-};
-
-////////////////////////////////////////////
-//          unique_ptr_data
-////////////////////////////////////////////
-template <class P, class D, bool = bmupmu::is_unary_function<D>::value || bmupmu::is_reference<D>::value >
-struct unique_ptr_data
-{
-   typedef typename deleter_types<D>::deleter_arg_type1  deleter_arg_type1;
-   typedef typename deleter_types<D>::del_ref            del_ref;
-   typedef typename deleter_types<D>::del_cref           del_cref;
-
-   BOOST_MOVE_FORCEINLINE unique_ptr_data() BOOST_NOEXCEPT
-      : m_p(), d()
-   {}
-
-   BOOST_MOVE_FORCEINLINE explicit unique_ptr_data(P p) BOOST_NOEXCEPT
-      : m_p(p), d()
-   {}
-
-   BOOST_MOVE_FORCEINLINE unique_ptr_data(P p, deleter_arg_type1 d1) BOOST_NOEXCEPT
-      : m_p(p), d(d1)
-   {}
-
-   template <class U>
-   BOOST_MOVE_FORCEINLINE unique_ptr_data(P p, BOOST_FWD_REF(U) d1) BOOST_NOEXCEPT
-      : m_p(p), d(::boost::forward<U>(d1))
-   {}
-
-   BOOST_MOVE_FORCEINLINE del_ref deleter()       { return d; }
-   BOOST_MOVE_FORCEINLINE del_cref deleter() const{ return d; }
-
-   P m_p;
-   D d;
-
-   private:
-   unique_ptr_data& operator=(const unique_ptr_data&);
-   unique_ptr_data(const unique_ptr_data&);
-};
-
-template <class P, class D>
-struct unique_ptr_data<P, D, false>
-   : private D
-{
-   typedef typename deleter_types<D>::deleter_arg_type1  deleter_arg_type1;
-   typedef typename deleter_types<D>::del_ref            del_ref;
-   typedef typename deleter_types<D>::del_cref           del_cref;
-
-   BOOST_MOVE_FORCEINLINE unique_ptr_data() BOOST_NOEXCEPT
-      : D(), m_p()
-   {}
-
-   BOOST_MOVE_FORCEINLINE explicit unique_ptr_data(P p) BOOST_NOEXCEPT
-      : D(), m_p(p)
-   {}
-
-   BOOST_MOVE_FORCEINLINE unique_ptr_data(P p, deleter_arg_type1 d1) BOOST_NOEXCEPT
-      : D(d1), m_p(p)
-   {}
-
-   template <class U>
-   BOOST_MOVE_FORCEINLINE unique_ptr_data(P p, BOOST_FWD_REF(U) d) BOOST_NOEXCEPT
-      : D(::boost::forward<U>(d)), m_p(p)
-   {}
-
-   BOOST_MOVE_FORCEINLINE del_ref deleter()        BOOST_NOEXCEPT   {  return static_cast<del_ref>(*this);   }
-   BOOST_MOVE_FORCEINLINE del_cref deleter() const BOOST_NOEXCEPT   {  return static_cast<del_cref>(*this);  }
-
-   P m_p;
-
-   private:
-   unique_ptr_data& operator=(const unique_ptr_data&);
-   unique_ptr_data(const unique_ptr_data&);
-};
-
-////////////////////////////////////////////
-//          is_unique_ptr_convertible
-////////////////////////////////////////////
-
-//Although non-standard, we avoid using pointer_traits
-//to avoid heavy dependencies
-template <typename T>
-struct get_element_type
-{
-   struct DefaultWrap { typedef bmupmu::natify<T> element_type; };
-   template <typename X>   static char test(int, typename X::element_type*);
-   template <typename X>   static int test(...);
-   static const bool value = (1 == sizeof(test<T>(0, 0)));
-   typedef typename bmupmu::if_c<value, T, DefaultWrap>::type::element_type type;
-};
-
-template<class T>
-struct get_element_type<T*>
-{
-   typedef T type;
-};
-
-template<class T>
-struct get_cvelement
-   : bmupmu::remove_cv<typename get_element_type<T>::type>
-{};
-
-template <class P1, class P2>
-struct is_same_cvelement_and_convertible
-{
-   typedef typename bmupmu::remove_reference<P1>::type arg1;
-   typedef typename bmupmu::remove_reference<P2>::type arg2;
-   static const bool same_cvless =
-      bmupmu::is_same<typename get_cvelement<arg1>::type,typename get_cvelement<arg2>::type>::value;
-   static const bool value = same_cvless && bmupmu::is_convertible<arg1, arg2>::value;
-};
-
-template<bool IsArray, class FromPointer, class ThisPointer>
-struct is_unique_ptr_convertible
-   : is_same_cvelement_and_convertible<FromPointer, ThisPointer>
-{};
-
-template<class FromPointer, class ThisPointer>
-struct is_unique_ptr_convertible<false, FromPointer, ThisPointer>
-   : bmupmu::is_convertible<FromPointer, ThisPointer>
-{};
-
-////////////////////////////////////////
-////     enable_up_moveconv_assign
-////////////////////////////////////////
-
-template<class T, class FromPointer, class ThisPointer, class Type = bmupmu::nat>
-struct enable_up_ptr
-   : bmupmu::enable_if_c< is_unique_ptr_convertible
-      < bmupmu::is_array<T>::value, FromPointer, ThisPointer>::value, Type>
-{};
-
-////////////////////////////////////////
-////     enable_up_moveconv_assign
-////////////////////////////////////////
-
-template<class T, class D, class U, class E>
-struct unique_moveconvert_assignable
-{
-   static const bool t_is_array = bmupmu::is_array<T>::value;
-   static const bool value =
-      t_is_array == bmupmu::is_array<U>::value &&
-      bmupmu::extent<T>::value == bmupmu::extent<U>::value &&
-      is_unique_ptr_convertible
-         < t_is_array
-         , typename bmupmu::pointer_type<U, E>::type, typename bmupmu::pointer_type<T, D>::type
-         >::value;
-};
-
-template<class T, class D, class U, class E, std::size_t N>
-struct unique_moveconvert_assignable<T[], D, U[N], E>
-   : unique_moveconvert_assignable<T[], D, U[], E>
-{};
-
-template<class T, class D, class U, class E, class Type = bmupmu::nat>
-struct enable_up_moveconv_assign
-   : bmupmu::enable_if_c<unique_moveconvert_assignable<T, D, U, E>::value, Type>
-{};
-
-////////////////////////////////////////
-////     enable_up_moveconv_constr
-////////////////////////////////////////
-
-template<class D, class E, bool IsReference = bmupmu::is_reference<D>::value>
-struct unique_deleter_is_initializable
-   : bmupmu::is_same<D, E>
-{};
-
-template <class T, class U>
-class is_rvalue_convertible
-{
-   #ifndef BOOST_NO_CXX11_RVALUE_REFERENCES
-   typedef typename bmupmu::remove_reference<T>::type&& t_from;
-   #else
-   typedef typename bmupmu::if_c
-      < ::boost::has_move_emulation_enabled<T>::value && !bmupmu::is_reference<T>::value
-      , ::boost::rv<T>&
-      , typename bmupmu::add_lvalue_reference<T>::type
-      >::type t_from;
-   #endif
-
-   typedef char true_t;
-   class false_t { char dummy[2]; };
-   static false_t dispatch(...);
-   static true_t  dispatch(U);
-   static t_from trigger();
-   public:
-   static const bool value = sizeof(dispatch(trigger())) == sizeof(true_t);
-};
-
-template<class D, class E>
-struct unique_deleter_is_initializable<D, E, false>
-{
-   #if !defined(BOOST_NO_CXX11_RVALUE_REFERENCES)
-   //Clang has some problems with is_rvalue_convertible with non-copyable types
-   //so use intrinsic if available
-   #if defined(BOOST_CLANG)
-      #if __has_feature(is_convertible_to)
-      static const bool value = __is_convertible_to(E, D);
-      #else
-      static const bool value = is_rvalue_convertible<E, D>::value;
-      #endif
-   #else
-   static const bool value = is_rvalue_convertible<E, D>::value;
-   #endif
-
-   #else //!defined(BOOST_NO_CXX11_RVALUE_REFERENCES)
-   //No hope for compilers with move emulation for now. In several compilers is_convertible
-   // leads to errors, so just move the Deleter and see if the conversion works
-   static const bool value = true;  /*is_rvalue_convertible<E, D>::value*/
-   #endif
-};
-
-template<class T, class D, class U, class E, class Type = bmupmu::nat>
-struct enable_up_moveconv_constr
-   : bmupmu::enable_if_c
-      < unique_moveconvert_assignable<T, D, U, E>::value && unique_deleter_is_initializable<D, E>::value
-      , Type>
-{};
-
-}  //namespace move_upd {
-// @endcond
-
-namespace movelib {
-
-//! A unique pointer is an object that owns another object and
-//! manages that other object through a pointer.
-//! 
-//! More precisely, a unique pointer is an object u that stores a pointer to a second object p and will dispose
-//! of p when u is itself destroyed (e.g., when leaving block scope). In this context, u is said to own p.
-//! 
-//! The mechanism by which u disposes of p is known as p's associated deleter, a function object whose correct
-//! invocation results in p's appropriate disposition (typically its deletion).
-//! 
-//! Let the notation u.p denote the pointer stored by u, and let u.d denote the associated deleter. Upon request,
-//! u can reset (replace) u.p and u.d with another pointer and deleter, but must properly dispose of its owned
-//! object via the associated deleter before such replacement is considered completed.
-//! 
-//! Additionally, u can, upon request, transfer ownership to another unique pointer u2. Upon completion of
-//! such a transfer, the following postconditions hold:
-//!   - u2.p is equal to the pre-transfer u.p,
-//!   - u.p is equal to nullptr, and
-//!   - if the pre-transfer u.d maintained state, such state has been transferred to u2.d.
-//! 
-//! As in the case of a reset, u2 must properly dispose of its pre-transfer owned object via the pre-transfer
-//! associated deleter before the ownership transfer is considered complete.
-//! 
-//! Each object of a type U instantiated from the unique_ptr template specified in this subclause has the strict
-//! ownership semantics, specified above, of a unique pointer. In partial satisfaction of these semantics, each
-//! such U is MoveConstructible and MoveAssignable, but is not CopyConstructible nor CopyAssignable.
-//! The template parameter T of unique_ptr may be an incomplete type.
-//! 
-//! The uses of unique_ptr include providing exception safety for dynamically allocated memory, passing
-//! ownership of dynamically allocated memory to a function, and returning dynamically allocated memory from
-//! a function.
-//!
-//! If T is an array type (e.g. unique_ptr<MyType[]>) the interface is slightly altered:
-//!   - Pointers to types derived from T are rejected by the constructors, and by reset.
-//!   - The observers <tt>operator*</tt> and <tt>operator-></tt> are not provided.
-//!   - The indexing observer <tt>operator[]</tt> is provided.
-//!
-//! \tparam T Provides the type of the stored pointer.
-//! \tparam D The deleter type:
-//!   -  The default type for the template parameter D is default_delete. A client-supplied template argument
-//!      D shall be a function object type, lvalue-reference to function, or lvalue-reference to function object type
-//!      for which, given a value d of type D and a value ptr of type unique_ptr<T, D>::pointer, the expression
-//!      d(ptr) is valid and has the effect of disposing of the pointer as appropriate for that deleter.
-//!   -  If the deleter's type D is not a reference type, D shall satisfy the requirements of Destructible.
-//!   -  If the type <tt>remove_reference<D>::type::pointer</tt> exists, it shall satisfy the requirements of NullablePointer.
-template <class T, class D = default_delete<T> >
-class unique_ptr
-{
-   #if defined(BOOST_MOVE_DOXYGEN_INVOKED)
-   public:
-   unique_ptr(const unique_ptr&) = delete;
-   unique_ptr& operator=(const unique_ptr&) = delete;
-   private:
-   #else
-   BOOST_MOVABLE_BUT_NOT_COPYABLE(unique_ptr)
-
-   typedef bmupmu::pointer_type<T, D >                            pointer_type_obtainer;
-   typedef bmupd::unique_ptr_data
-      <typename pointer_type_obtainer::type, D>                data_type;
-   typedef typename bmupd::deleter_types<D>::deleter_arg_type1 deleter_arg_type1;
-   typedef typename bmupd::deleter_types<D>::deleter_arg_type2 deleter_arg_type2;
-   data_type m_data;
-   #endif
-
-   public:
-   //! If the type <tt>remove_reference<D>::type::pointer</tt> exists, then it shall be a
-   //! synonym for <tt>remove_reference<D>::type::pointer</tt>. Otherwise it shall be a
-   //! synonym for T*.
-   typedef typename BOOST_MOVE_SEEDOC(pointer_type_obtainer::type) pointer;
-   //! If T is an array type, then element_type is equal to T. Otherwise, if T is a type
-   //! in the form U[], element_type is equal to U.
-   typedef typename BOOST_MOVE_SEEDOC(bmupmu::remove_extent<T>::type) element_type;
-   typedef D deleter_type;
-
-   //! <b>Requires</b>: D shall satisfy the requirements of DefaultConstructible, and
-   //!   that construction shall not throw an exception.
-   //!
-   //! <b>Effects</b>: Constructs a unique_ptr object that owns nothing, value-initializing the
-   //!   stored pointer and the stored deleter.
-   //!
-   //! <b>Postconditions</b>: <tt>get() == nullptr</tt>. <tt>get_deleter()</tt> returns a reference to the stored deleter.
-   //!
-   //! <b>Remarks</b>: If this constructor is instantiated with a pointer type or reference type
-   //!   for the template argument D, the program is ill-formed.   
-   BOOST_MOVE_FORCEINLINE BOOST_CONSTEXPR unique_ptr() BOOST_NOEXCEPT
-      : m_data()
-   {
-      //If this constructor is instantiated with a pointer type or reference type
-      //for the template argument D, the program is ill-formed.
-      BOOST_MOVE_STATIC_ASSERT(!bmupmu::is_pointer<D>::value);
-      BOOST_MOVE_STATIC_ASSERT(!bmupmu::is_reference<D>::value);
-   }
-
-   //! <b>Effects</b>: Same as <tt>unique_ptr()</tt> (default constructor).
-   //! 
-   BOOST_MOVE_FORCEINLINE BOOST_CONSTEXPR unique_ptr(BOOST_MOVE_DOC0PTR(bmupd::nullptr_type)) BOOST_NOEXCEPT
-      : m_data()
-   {
-      //If this constructor is instantiated with a pointer type or reference type
-      //for the template argument D, the program is ill-formed.
-      BOOST_MOVE_STATIC_ASSERT(!bmupmu::is_pointer<D>::value);
-      BOOST_MOVE_STATIC_ASSERT(!bmupmu::is_reference<D>::value);
-   }
-
-   //! <b>Requires</b>: D shall satisfy the requirements of DefaultConstructible, and
-   //!   that construction shall not throw an exception.
-   //!
-   //! <b>Effects</b>: Constructs a unique_ptr which owns p, initializing the stored pointer 
-   //!   with p and value initializing the stored deleter.
-   //!
-   //! <b>Postconditions</b>: <tt>get() == p</tt>. <tt>get_deleter()</tt> returns a reference to the stored deleter.
-   //!
-   //! <b>Remarks</b>: If this constructor is instantiated with a pointer type or reference type
-   //!   for the template argument D, the program is ill-formed.
-   //!   This constructor shall not participate in overload resolution unless:
-   //!      - If T is not an array type and Pointer is implicitly convertible to pointer.
-   //!      - If T is an array type and Pointer is a more CV qualified pointer to element_type.
-   template<class Pointer>
-   BOOST_MOVE_FORCEINLINE explicit unique_ptr(Pointer p
-      BOOST_MOVE_DOCIGN(BOOST_MOVE_I typename bmupd::enable_up_ptr<T BOOST_MOVE_I Pointer BOOST_MOVE_I pointer>::type* =0)
-                 ) BOOST_NOEXCEPT
-      : m_data(p)
-   {
-      //If T is not an array type, element_type_t<Pointer> derives from T
-      //it uses the default deleter and T has no virtual destructor, then you have a problem
-      BOOST_MOVE_STATIC_ASSERT(( !bmupd::missing_virtual_destructor
-                            <D, typename bmupd::get_element_type<Pointer>::type>::value ));
-      //If this constructor is instantiated with a pointer type or reference type
-      //for the template argument D, the program is ill-formed.
-      BOOST_MOVE_STATIC_ASSERT(!bmupmu::is_pointer<D>::value);
-      BOOST_MOVE_STATIC_ASSERT(!bmupmu::is_reference<D>::value);
-   }
-
-   //!The signature of this constructor depends upon whether D is a reference type.
-   //!   - If D is non-reference type A, then the signature is <tt>unique_ptr(pointer p, const A& d)</tt>.
-   //!   - If D is an lvalue-reference type A&, then the signature is <tt>unique_ptr(pointer p, A& d)</tt>.
-   //!   - If D is an lvalue-reference type const A&, then the signature is <tt>unique_ptr(pointer p, const A& d)</tt>.
-   //!
-   //!
-   //! <b>Requires</b>: Either
-   //!   - D is not an lvalue-reference type and d is an lvalue or const rvalue. 
-   //!         D shall satisfy the requirements of CopyConstructible, and the copy constructor of D
-   //!         shall not throw an exception. This unique_ptr will hold a copy of d.
-   //!   - D is an lvalue-reference type and d is an lvalue. the type which D references need not be CopyConstructible nor
-   //!      MoveConstructible. This unique_ptr will hold a D which refers to the lvalue d.
-   //!
-   //! <b>Effects</b>: Constructs a unique_ptr object which owns p, initializing the stored pointer with p and
-   //!   initializing the deleter as described above.
-   //! 
-   //! <b>Postconditions</b>: <tt>get() == p</tt>. <tt>get_deleter()</tt> returns a reference to the stored deleter. If D is a
-   //!   reference type then <tt>get_deleter()</tt> returns a reference to the lvalue d.
-   //!
-   //! <b>Remarks</b>: This constructor shall not participate in overload resolution unless:
-   //!      - If T is not an array type and Pointer is implicitly convertible to pointer.
-   //!      - If T is an array type and Pointer is a more CV qualified pointer to element_type.
-   template<class Pointer>
-   BOOST_MOVE_FORCEINLINE unique_ptr(Pointer p, BOOST_MOVE_SEEDOC(deleter_arg_type1) d1
-      BOOST_MOVE_DOCIGN(BOOST_MOVE_I typename bmupd::enable_up_ptr<T BOOST_MOVE_I Pointer BOOST_MOVE_I pointer>::type* =0)
-              ) BOOST_NOEXCEPT
-      : m_data(p, d1)
-   {
-      //If T is not an array type, element_type_t<Pointer> derives from T
-      //it uses the default deleter and T has no virtual destructor, then you have a problem
-      BOOST_MOVE_STATIC_ASSERT(( !bmupd::missing_virtual_destructor
-                            <D, typename bmupd::get_element_type<Pointer>::type>::value ));
-   }
-
-   //! <b>Effects</b>: Same effects as <tt>template<class Pointer> unique_ptr(Pointer p, deleter_arg_type1 d1)</tt>
-   //!   and additionally <tt>get() == nullptr</tt>
-   BOOST_MOVE_FORCEINLINE unique_ptr(BOOST_MOVE_DOC0PTR(bmupd::nullptr_type), BOOST_MOVE_SEEDOC(deleter_arg_type1) d1) BOOST_NOEXCEPT
-      : m_data(pointer(), d1)
-   {}
-
-   //! The signature of this constructor depends upon whether D is a reference type.
-   //!   - If D is non-reference type A, then the signature is <tt>unique_ptr(pointer p, A&& d)</tt>.
-   //!   - If D is an lvalue-reference type A&, then the signature is <tt>unique_ptr(pointer p, A&& d)</tt>.
-   //!   - If D is an lvalue-reference type const A&, then the signature is <tt>unique_ptr(pointer p, const A&& d)</tt>.
-   //!
-   //! <b>Requires</b>: Either
-   //!   - D is not an lvalue-reference type and d is a non-const rvalue. D
-   //!      shall satisfy the requirements of MoveConstructible, and the move constructor
-   //!      of D shall not throw an exception. This unique_ptr will hold a value move constructed from d.
-   //!   - D is an lvalue-reference type and d is an rvalue, the program is ill-formed.
-   //!
-   //! <b>Effects</b>: Constructs a unique_ptr object which owns p, initializing the stored pointer with p and
-   //!   initializing the deleter as described above.
-   //! 
-   //! <b>Postconditions</b>: <tt>get() == p</tt>. <tt>get_deleter()</tt> returns a reference to the stored deleter. If D is a
-   //!   reference type then <tt>get_deleter()</tt> returns a reference to the lvalue d.
-   //!
-   //! <b>Remarks</b>: This constructor shall not participate in overload resolution unless:
-   //!      - If T is not an array type and Pointer is implicitly convertible to pointer.
-   //!      - If T is an array type and Pointer is a more CV qualified pointer to element_type.
-   template<class Pointer>
-   BOOST_MOVE_FORCEINLINE unique_ptr(Pointer p, BOOST_MOVE_SEEDOC(deleter_arg_type2) d2
-      BOOST_MOVE_DOCIGN(BOOST_MOVE_I typename bmupd::enable_up_ptr<T BOOST_MOVE_I Pointer BOOST_MOVE_I pointer>::type* =0)
-             ) BOOST_NOEXCEPT
-      : m_data(p, ::boost::move(d2))
-   {
-      //If T is not an array type, element_type_t<Pointer> derives from T
-      //it uses the default deleter and T has no virtual destructor, then you have a problem
-      BOOST_MOVE_STATIC_ASSERT(( !bmupd::missing_virtual_destructor
-                            <D, typename bmupd::get_element_type<Pointer>::type>::value ));
-   }
-
-   //! <b>Effects</b>: Same effects as <tt>template<class Pointer> unique_ptr(Pointer p, deleter_arg_type2 d2)</tt>
-   //!   and additionally <tt>get() == nullptr</tt>
-   BOOST_MOVE_FORCEINLINE unique_ptr(BOOST_MOVE_DOC0PTR(bmupd::nullptr_type), BOOST_MOVE_SEEDOC(deleter_arg_type2) d2) BOOST_NOEXCEPT
-      : m_data(pointer(), ::boost::move(d2))
-   {}
-
-   //! <b>Requires</b>: If D is not a reference type, D shall satisfy the requirements of MoveConstructible.
-   //! Construction of the deleter from an rvalue of type D shall not throw an exception.
-   //! 
-   //! <b>Effects</b>: Constructs a unique_ptr by transferring ownership from u to *this. If D is a reference type,
-   //! this deleter is copy constructed from u's deleter; otherwise, this deleter is move constructed from u's
-   //! deleter.
-   //! 
-   //! <b>Postconditions</b>: <tt>get()</tt> yields the value u.get() yielded before the construction. <tt>get_deleter()</tt>
-   //! returns a reference to the stored deleter that was constructed from u.get_deleter(). If D is a
-   //! reference type then <tt>get_deleter()</tt> and <tt>u.get_deleter()</tt> both reference the same lvalue deleter.
-   BOOST_MOVE_FORCEINLINE unique_ptr(BOOST_RV_REF(unique_ptr) u) BOOST_NOEXCEPT
-      : m_data(u.release(), ::boost::move_if_not_lvalue_reference<D>(u.get_deleter()))
-   {}
-
-   //! <b>Requires</b>: If E is not a reference type, construction of the deleter from an rvalue of type E shall be
-   //!   well formed and shall not throw an exception. Otherwise, E is a reference type and construction of the
-   //!   deleter from an lvalue of type E shall be well formed and shall not throw an exception.
-   //!
-   //! <b>Remarks</b>: This constructor shall not participate in overload resolution unless:
-   //!   - <tt>unique_ptr<U, E>::pointer</tt> is implicitly convertible to pointer,
-   //!   - U is not an array type, and
-   //!   - either D is a reference type and E is the same type as D, or D is not a reference type and E is
-   //!      implicitly convertible to D.
-   //!
-   //! <b>Effects</b>: Constructs a unique_ptr by transferring ownership from u to *this. If E is a reference type,
-   //!   this deleter is copy constructed from u's deleter; otherwise, this deleter is move constructed from u's deleter.
-   //!
-   //! <b>Postconditions</b>: <tt>get()</tt> yields the value <tt>u.get()</tt> yielded before the construction. <tt>get_deleter()</tt>
-   //!   returns a reference to the stored deleter that was constructed from <tt>u.get_deleter()</tt>.
-   template <class U, class E>
-   BOOST_MOVE_FORCEINLINE unique_ptr( BOOST_RV_REF_BEG_IF_CXX11 unique_ptr<U, E> BOOST_RV_REF_END_IF_CXX11 u
-      BOOST_MOVE_DOCIGN(BOOST_MOVE_I typename bmupd::enable_up_moveconv_constr<T BOOST_MOVE_I D BOOST_MOVE_I U BOOST_MOVE_I E>::type* =0)
-      ) BOOST_NOEXCEPT
-      : m_data(u.release(), ::boost::move_if_not_lvalue_reference<E>(u.get_deleter()))
-   {
-      //If T is not an array type, U derives from T
-      //it uses the default deleter and T has no virtual destructor, then you have a problem
-      BOOST_MOVE_STATIC_ASSERT(( !bmupd::missing_virtual_destructor
-                            <D, typename unique_ptr<U, E>::pointer>::value ));
-   }
-
-   //! <b>Requires</b>: The expression <tt>get_deleter()(get())</tt> shall be well formed, shall have well-defined behavior,
-   //!   and shall not throw exceptions.
-   //!
-   //! <b>Effects</b>: If <tt>get() == nullpt1r</tt> there are no effects. Otherwise <tt>get_deleter()(get())</tt>.
-   //!
-   //! <b>Note</b>: The use of default_delete requires T to be a complete type
-   ~unique_ptr()
-   {  if(m_data.m_p) m_data.deleter()(m_data.m_p);   }
-
-   //! <b>Requires</b>: If D is not a reference type, D shall satisfy the requirements of MoveAssignable
-   //!   and assignment of the deleter from an rvalue of type D shall not throw an exception. Otherwise, D
-   //!   is a reference type; <tt>remove_reference<D>::type</tt> shall satisfy the CopyAssignable requirements and
-   //!   assignment of the deleter from an lvalue of type D shall not throw an exception.
-   //!
-   //! <b>Effects</b>: Transfers ownership from u to *this as if by calling <tt>reset(u.release())</tt> followed
-   //!   by <tt>get_deleter() = std::forward<D>(u.get_deleter())</tt>.
-   //!
-   //! <b>Returns</b>: *this.
-   unique_ptr& operator=(BOOST_RV_REF(unique_ptr) u) BOOST_NOEXCEPT
-   {
-      this->reset(u.release());
-      m_data.deleter() = ::boost::move_if_not_lvalue_reference<D>(u.get_deleter());
-      return *this;
-   }
-
-   //! <b>Requires</b>: If E is not a reference type, assignment of the deleter from an rvalue of type E shall be
-   //!   well-formed and shall not throw an exception. Otherwise, E is a reference type and assignment of the
-   //!   deleter from an lvalue of type E shall be well-formed and shall not throw an exception.
-   //!
-   //! <b>Remarks</b>: This operator shall not participate in overload resolution unless:
-   //!   - <tt>unique_ptr<U, E>::pointer</tt> is implicitly convertible to pointer and
-   //!   - U is not an array type.
-   //!
-   //! <b>Effects</b>: Transfers ownership from u to *this as if by calling <tt>reset(u.release())</tt> followed by
-   //!   <tt>get_deleter() = std::forward<E>(u.get_deleter())</tt>.
-   //!
-   //! <b>Returns</b>: *this.
-   template <class U, class E>
-   BOOST_MOVE_DOC1ST(unique_ptr&, typename bmupd::enable_up_moveconv_assign
-         <T BOOST_MOVE_I D BOOST_MOVE_I U BOOST_MOVE_I E BOOST_MOVE_I unique_ptr &>::type)
-      operator=(BOOST_RV_REF_BEG unique_ptr<U, E> BOOST_RV_REF_END u) BOOST_NOEXCEPT
-   {
-      this->reset(u.release());
-      m_data.deleter() = ::boost::move_if_not_lvalue_reference<E>(u.get_deleter());
-      return *this;
-   }
-
-   //! <b>Effects</b>: <tt>reset()</tt>.
-   //!
-   //! <b>Postcondition</b>: <tt>get() == nullptr</tt>
-   //!
-   //! <b>Returns</b>: *this.
-   unique_ptr& operator=(BOOST_MOVE_DOC0PTR(bmupd::nullptr_type)) BOOST_NOEXCEPT
-   {  this->reset(); return *this;  }
-
-   //! <b>Requires</b>: <tt>get() != nullptr</tt>.
-   //!
-   //! <b>Returns</b>: <tt>*get()</tt>.
-   //!
-   //! <b>Remarks</b: If T is an array type, the program is ill-formed.
-   BOOST_MOVE_DOC1ST(element_type&, typename bmupmu::add_lvalue_reference<element_type>::type)
-      operator*() const BOOST_NOEXCEPT
-   {
-      BOOST_MOVE_STATIC_ASSERT((!bmupmu::is_array<T>::value));
-      return *m_data.m_p;
-   }
-
-   //! <b>Requires</b>: i < the number of elements in the array to which the stored pointer points.
-   //!
-   //! <b>Returns</b>: <tt>get()[i]</tt>.
-   //!
-   //! <b>Remarks</b: If T is not an array type, the program is ill-formed.
-   BOOST_MOVE_FORCEINLINE BOOST_MOVE_DOC1ST(element_type&, typename bmupmu::add_lvalue_reference<element_type>::type)
-      operator[](std::size_t i) const BOOST_NOEXCEPT
-   {
-      assert( bmupmu::extent<T>::value == 0 || i < bmupmu::extent<T>::value );
-      assert(m_data.m_p);
-      return m_data.m_p[i];
-   }
-
-   //! <b>Requires</b>: <tt>get() != nullptr</tt>.
-   //!
-   //! <b>Returns</b>: <tt>get()</tt>.
-   //!
-   //! <b>Note</b>: use typically requires that T be a complete type.
-   //!
-   //! <b>Remarks</b: If T is an array type, the program is ill-formed.
-   BOOST_MOVE_FORCEINLINE pointer operator->() const BOOST_NOEXCEPT
-   {
-      BOOST_MOVE_STATIC_ASSERT((!bmupmu::is_array<T>::value));
-      assert(m_data.m_p);
-      return m_data.m_p;
-   }
-
-   //! <b>Returns</b>: The stored pointer.
-   //!
-   BOOST_MOVE_FORCEINLINE pointer get() const BOOST_NOEXCEPT
-   {  return m_data.m_p;  }
-
-   //! <b>Returns</b>: A reference to the stored deleter.
-   //!
-   BOOST_MOVE_FORCEINLINE BOOST_MOVE_DOC1ST(D&, typename bmupmu::add_lvalue_reference<D>::type)
-      get_deleter() BOOST_NOEXCEPT
-   {  return m_data.deleter();  }   
-
-   //! <b>Returns</b>: A reference to the stored deleter.
-   //!
-   BOOST_MOVE_FORCEINLINE BOOST_MOVE_DOC1ST(const D&, typename bmupmu::add_const_lvalue_reference<D>::type)
-      get_deleter() const BOOST_NOEXCEPT
-   {  return m_data.deleter();  }
-
-   #ifdef BOOST_MOVE_DOXYGEN_INVOKED
-   //! <b>Returns</b>: Returns: get() != nullptr.
-   //!
-   BOOST_MOVE_FORCEINLINE explicit operator bool
-   #else
-   BOOST_MOVE_FORCEINLINE operator bmupd::explicit_bool_arg
-   #endif
-      ()const BOOST_NOEXCEPT
-   {
-      return m_data.m_p
-         ? &bmupd::bool_conversion::for_bool
-         : bmupd::explicit_bool_arg(0);
-   }
-
-   //! <b>Postcondition</b>: <tt>get() == nullptr</tt>.
-   //!
-   //! <b>Returns</b>: The value <tt>get()</tt> had at the start of the call to release.   
-   BOOST_MOVE_FORCEINLINE pointer release() BOOST_NOEXCEPT
-   {
-      const pointer tmp = m_data.m_p;
-      m_data.m_p = pointer();
-      return tmp;
-   }
-
-   //! <b>Requires</b>: The expression <tt>get_deleter()(get())</tt> shall be well formed, shall have well-defined behavior,
-   //!   and shall not throw exceptions.
-   //!
-   //! <b>Effects</b>: assigns p to the stored pointer, and then if the old value of the stored pointer, old_p, was not
-   //!   equal to nullptr, calls <tt>get_deleter()(old_p)</tt>. Note: The order of these operations is significant
-   //!   because the call to <tt>get_deleter()</tt> may destroy *this.
-   //!
-   //! <b>Postconditions</b>: <tt>get() == p</tt>. Note: The postcondition does not hold if the call to <tt>get_deleter()</tt>
-   //!   destroys *this since <tt>this->get()</tt> is no longer a valid expression.
-   //!
-   //! <b>Remarks</b>: This constructor shall not participate in overload resolution unless:
-   //!      - If T is not an array type and Pointer is implicitly convertible to pointer.
-   //!      - If T is an array type and Pointer is a more CV qualified pointer to element_type.
-   template<class Pointer>
-   BOOST_MOVE_DOC1ST(void, typename bmupd::enable_up_ptr<T BOOST_MOVE_I Pointer BOOST_MOVE_I pointer BOOST_MOVE_I void>::type)
-      reset(Pointer p) BOOST_NOEXCEPT
-   {
-      //If T is not an array type, element_type_t<Pointer> derives from T
-      //it uses the default deleter and T has no virtual destructor, then you have a problem
-      BOOST_MOVE_STATIC_ASSERT(( !bmupd::missing_virtual_destructor
-                            <D, typename bmupd::get_element_type<Pointer>::type>::value ));
-      pointer tmp = m_data.m_p;
-      m_data.m_p = p;
-      if(tmp) m_data.deleter()(tmp);
-   }
-
-   //! <b>Requires</b>: The expression <tt>get_deleter()(get())</tt> shall be well formed, shall have well-defined behavior,
-   //!   and shall not throw exceptions.
-   //!
-   //! <b>Effects</b>: assigns nullptr to the stored pointer, and then if the old value of the stored pointer, old_p, was not
-   //!   equal to nullptr, calls <tt>get_deleter()(old_p)</tt>. Note: The order of these operations is significant
-   //!   because the call to <tt>get_deleter()</tt> may destroy *this.
-   //!
-   //! <b>Postconditions</b>: <tt>get() == p</tt>. Note: The postcondition does not hold if the call to <tt>get_deleter()</tt>
-   //!   destroys *this since <tt>this->get()</tt> is no longer a valid expression.
-   void reset() BOOST_NOEXCEPT
-   {  this->reset(pointer());  }
-
-   //! <b>Effects</b>: Same as <tt>reset()</tt>
-   //! 
-   void reset(BOOST_MOVE_DOC0PTR(bmupd::nullptr_type)) BOOST_NOEXCEPT
-   {  this->reset(); }
-
-   //! <b>Requires</b>: <tt>get_deleter()</tt> shall be swappable and shall not throw an exception under swap.
-   //!
-   //! <b>Effects</b>: Invokes swap on the stored pointers and on the stored deleters of *this and u.
-   void swap(unique_ptr& u) BOOST_NOEXCEPT
-   {
-      ::boost::adl_move_swap(m_data.m_p, u.m_data.m_p);
-      ::boost::adl_move_swap(m_data.deleter(), u.m_data.deleter());
-   }
-};
-
-//! <b>Effects</b>: Calls <tt>x.swap(y)</tt>.
-//!
-template <class T, class D>
-BOOST_MOVE_FORCEINLINE void swap(unique_ptr<T, D> &x, unique_ptr<T, D> &y) BOOST_NOEXCEPT
-{  x.swap(y); }
-
-//! <b>Returns</b>: <tt>x.get() == y.get()</tt>.
-//!
-template <class T1, class D1, class T2, class D2>
-BOOST_MOVE_FORCEINLINE bool operator==(const unique_ptr<T1, D1> &x, const unique_ptr<T2, D2> &y)
-{  return x.get() == y.get(); }
-
-//! <b>Returns</b>: <tt>x.get() != y.get()</tt>.
-//!
-template <class T1, class D1, class T2, class D2>
-BOOST_MOVE_FORCEINLINE bool operator!=(const unique_ptr<T1, D1> &x, const unique_ptr<T2, D2> &y)
-{  return x.get() != y.get(); }
-
-//! <b>Returns</b>: x.get() < y.get().
-//!
-//! <b>Remarks</b>: This comparison shall induce a
-//!   strict weak ordering betwen pointers.
-template <class T1, class D1, class T2, class D2>
-BOOST_MOVE_FORCEINLINE bool operator<(const unique_ptr<T1, D1> &x, const unique_ptr<T2, D2> &y)
-{  return x.get() < y.get();  }
-
-//! <b>Returns</b>: !(y < x).
-//!
-template <class T1, class D1, class T2, class D2>
-BOOST_MOVE_FORCEINLINE bool operator<=(const unique_ptr<T1, D1> &x, const unique_ptr<T2, D2> &y)
-{  return !(y < x);  }
-
-//! <b>Returns</b>: y < x.
-//!
-template <class T1, class D1, class T2, class D2>
-BOOST_MOVE_FORCEINLINE bool operator>(const unique_ptr<T1, D1> &x, const unique_ptr<T2, D2> &y)
-{  return y < x;  }
-
-//! <b>Returns</b>:!(x < y).
-//!
-template <class T1, class D1, class T2, class D2>
-BOOST_MOVE_FORCEINLINE bool operator>=(const unique_ptr<T1, D1> &x, const unique_ptr<T2, D2> &y)
-{  return !(x < y);  }
-
-//! <b>Returns</b>:!x.
-//!
-template <class T, class D>
-BOOST_MOVE_FORCEINLINE bool operator==(const unique_ptr<T, D> &x, BOOST_MOVE_DOC0PTR(bmupd::nullptr_type)) BOOST_NOEXCEPT
-{  return !x;  }
-
-//! <b>Returns</b>:!x.
-//!
-template <class T, class D>
-BOOST_MOVE_FORCEINLINE bool operator==(BOOST_MOVE_DOC0PTR(bmupd::nullptr_type), const unique_ptr<T, D> &x) BOOST_NOEXCEPT
-{  return !x;  }
-
-//! <b>Returns</b>: (bool)x.
-//!
-template <class T, class D>
-BOOST_MOVE_FORCEINLINE bool operator!=(const unique_ptr<T, D> &x, BOOST_MOVE_DOC0PTR(bmupd::nullptr_type)) BOOST_NOEXCEPT
-{  return !!x;  }
-
-//! <b>Returns</b>: (bool)x.
-//!
-template <class T, class D>
-BOOST_MOVE_FORCEINLINE bool operator!=(BOOST_MOVE_DOC0PTR(bmupd::nullptr_type), const unique_ptr<T, D> &x) BOOST_NOEXCEPT
-{  return !!x;  }
-
-//! <b>Requires</b>: <tt>operator </tt> shall induce a strict weak ordering on unique_ptr<T, D>::pointer values.
-//!
-//! <b>Returns</b>: Returns <tt>x.get() < pointer()</tt>.
-template <class T, class D>
-BOOST_MOVE_FORCEINLINE bool operator<(const unique_ptr<T, D> &x, BOOST_MOVE_DOC0PTR(bmupd::nullptr_type))
-{  return x.get() < typename unique_ptr<T, D>::pointer();  }
-
-//! <b>Requires</b>: <tt>operator </tt> shall induce a strict weak ordering on unique_ptr<T, D>::pointer values.
-//!
-//! <b>Returns</b>: Returns <tt>pointer() < x.get()</tt>.
-template <class T, class D>
-BOOST_MOVE_FORCEINLINE bool operator<(BOOST_MOVE_DOC0PTR(bmupd::nullptr_type), const unique_ptr<T, D> &x)
-{  return typename unique_ptr<T, D>::pointer() < x.get();  }
-
-//! <b>Returns</b>: <tt>nullptr < x</tt>.
-//!
-template <class T, class D>
-BOOST_MOVE_FORCEINLINE bool operator>(const unique_ptr<T, D> &x, BOOST_MOVE_DOC0PTR(bmupd::nullptr_type))
-{  return x.get() > typename unique_ptr<T, D>::pointer();  }
-
-//! <b>Returns</b>: <tt>x < nullptr</tt>.
-//!
-template <class T, class D>
-BOOST_MOVE_FORCEINLINE bool operator>(BOOST_MOVE_DOC0PTR(bmupd::nullptr_type), const unique_ptr<T, D> &x)
-{  return typename unique_ptr<T, D>::pointer() > x.get();  }
-
-//! <b>Returns</b>: <tt>!(nullptr < x)</tt>.
-//!
-template <class T, class D>
-BOOST_MOVE_FORCEINLINE bool operator<=(const unique_ptr<T, D> &x, BOOST_MOVE_DOC0PTR(bmupd::nullptr_type))
-{  return !(bmupd::nullptr_type() < x);  }
-
-//! <b>Returns</b>: <tt>!(x < nullptr)</tt>.
-//!
-template <class T, class D>
-BOOST_MOVE_FORCEINLINE bool operator<=(BOOST_MOVE_DOC0PTR(bmupd::nullptr_type), const unique_ptr<T, D> &x)
-{  return !(x < bmupd::nullptr_type());  }
-
-//! <b>Returns</b>: <tt>!(x < nullptr)</tt>.
-//!
-template <class T, class D>
-BOOST_MOVE_FORCEINLINE bool operator>=(const unique_ptr<T, D> &x, BOOST_MOVE_DOC0PTR(bmupd::nullptr_type))
-{  return !(x < bmupd::nullptr_type());  }
-
-//! <b>Returns</b>: <tt>!(nullptr < x)</tt>.
-//!
-template <class T, class D>
-BOOST_MOVE_FORCEINLINE bool operator>=(BOOST_MOVE_DOC0PTR(bmupd::nullptr_type), const unique_ptr<T, D> &x)
-{  return !(bmupd::nullptr_type() < x);  }
-
-}  //namespace movelib {
-}  //namespace boost{
-
-#include <boost/move/detail/config_end.hpp>
-
-#endif   //#ifndef BOOST_MOVE_UNIQUE_PTR_HPP_INCLUDED
diff --git a/src/boost/multi_index/detail/rnd_index_loader.hpp b/src/boost/multi_index/detail/rnd_index_loader.hpp
deleted file mode 100644
index cf6f0690..00000000
--- a/src/boost/multi_index/detail/rnd_index_loader.hpp
+++ /dev/null
@@ -1,175 +0,0 @@
-/* Copyright 2003-2022 Joaquin M Lopez Munoz.
- * Distributed under the Boost 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/multi_index for library home page.
- */
-
-#ifndef BOOST_MULTI_INDEX_DETAIL_RND_INDEX_LOADER_HPP
-#define BOOST_MULTI_INDEX_DETAIL_RND_INDEX_LOADER_HPP
-
-#if defined(_MSC_VER)
-#pragma once
-#endif
-
-#include <boost/config.hpp> /* keep it first to prevent nasty warns in MSVC */
-#include <algorithm>
-#include <boost/core/noncopyable.hpp>
-#include <boost/multi_index/detail/allocator_traits.hpp>
-#include <boost/multi_index/detail/auto_space.hpp>
-#include <boost/multi_index/detail/rnd_index_ptr_array.hpp>
-
-namespace boost{
-
-namespace multi_index{
-
-namespace detail{
-
-/* This class implements a serialization rearranger for random access
- * indices. In order to achieve O(n) performance, the following strategy
- * is followed: the nodes of the index are handled as if in a bidirectional
- * list, where the next pointers are stored in the original
- * random_access_index_ptr_array and the prev pointers are stored in
- * an auxiliary array. Rearranging of nodes in such a bidirectional list
- * is constant time. Once all the arrangements are performed (on destruction
- * time) the list is traversed in reverse order and
- * pointers are swapped and set accordingly so that they recover its
- * original semantics ( *(node->up())==node ) while retaining the
- * new order.
- */
-
-template<typename Allocator>
-class random_access_index_loader_base:private noncopyable
-{
-protected:
-  typedef random_access_index_node_impl<
-    typename rebind_alloc_for<
-      Allocator,
-      char
-    >::type
-  >                                                 node_impl_type;
-  typedef typename node_impl_type::pointer          node_impl_pointer;
-  typedef random_access_index_ptr_array<Allocator>  ptr_array;
-
-  random_access_index_loader_base(const Allocator& al_,ptr_array& ptrs_):
-    al(al_),
-    ptrs(ptrs_),
-    header(*ptrs.end()),
-    prev_spc(al,0),
-    preprocessed(false)
-  {}
-
-  ~random_access_index_loader_base()
-  {
-    if(preprocessed)
-    {
-      node_impl_pointer n=header;
-      next(n)=n;
-
-      for(size_type i=ptrs.size();i--;){
-        n=prev(n);
-        size_type d=position(n);
-        if(d!=i){
-          node_impl_pointer m=prev(next_at(i));
-          std::swap(m->up(),n->up());
-          next_at(d)=next_at(i);
-          std::swap(prev_at(d),prev_at(i));
-        }
-        next(n)=n;
-      }
-    }
-  }
-
-  void rearrange(node_impl_pointer position_,node_impl_pointer x)
-  {
-    preprocess(); /* only incur this penalty if rearrange() is ever called */
-    if(position_==node_impl_pointer(0))position_=header;
-    next(prev(x))=next(x);
-    prev(next(x))=prev(x);
-    prev(x)=position_;
-    next(x)=next(position_);
-    next(prev(x))=prev(next(x))=x;
-  }
-
-private:
-  typedef allocator_traits<Allocator>      alloc_traits;
-  typedef typename alloc_traits::size_type size_type;
-
-  void preprocess()
-  {
-    if(!preprocessed){
-      /* get space for the auxiliary prev array */
-      auto_space<node_impl_pointer,Allocator> tmp(al,ptrs.size()+1);
-      prev_spc.swap(tmp);
-
-      /* prev_spc elements point to the prev nodes */
-      std::rotate_copy(
-        &*ptrs.begin(),&*ptrs.end(),&*ptrs.end()+1,&*prev_spc.data());
-
-      /* ptrs elements point to the next nodes */
-      std::rotate(&*ptrs.begin(),&*ptrs.begin()+1,&*ptrs.end()+1);
-
-      preprocessed=true;
-    }
-  }
-
-  size_type position(node_impl_pointer x)const
-  {
-    return (size_type)(x->up()-ptrs.begin());
-  }
-
-  node_impl_pointer& next_at(size_type n)const
-  {
-    return *ptrs.at(n);
-  }
-
-  node_impl_pointer& prev_at(size_type n)const
-  {
-    return *(prev_spc.data()+n);
-  }
-
-  node_impl_pointer& next(node_impl_pointer x)const
-  {
-    return *(x->up());
-  }
-
-  node_impl_pointer& prev(node_impl_pointer x)const
-  {
-    return prev_at(position(x));
-  }
-
-  Allocator                               al;
-  ptr_array&                              ptrs;
-  node_impl_pointer                       header;
-  auto_space<node_impl_pointer,Allocator> prev_spc;
-  bool                                    preprocessed;
-};
-
-template<typename Node,typename Allocator>
-class random_access_index_loader:
-  private random_access_index_loader_base<Allocator>
-{
-  typedef random_access_index_loader_base<Allocator> super;
-  typedef typename super::node_impl_pointer          node_impl_pointer;
-  typedef typename super::ptr_array                  ptr_array;
-
-public:
-  random_access_index_loader(const Allocator& al_,ptr_array& ptrs_):
-    super(al_,ptrs_)
-  {}
-
-  void rearrange(Node* position_,Node *x)
-  {
-    super::rearrange(
-      position_?position_->impl():node_impl_pointer(0),x->impl());
-  }
-};
-
-} /* namespace multi_index::detail */
-
-} /* namespace multi_index */
-
-} /* namespace boost */
-
-#endif
diff --git a/src/boost/multi_index/detail/rnd_index_node.hpp b/src/boost/multi_index/detail/rnd_index_node.hpp
deleted file mode 100644
index 9f76eede..00000000
--- a/src/boost/multi_index/detail/rnd_index_node.hpp
+++ /dev/null
@@ -1,293 +0,0 @@
-/* Copyright 2003-2021 Joaquin M Lopez Munoz.
- * Distributed under the Boost 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/multi_index for library home page.
- */
-
-#ifndef BOOST_MULTI_INDEX_DETAIL_RND_INDEX_NODE_HPP
-#define BOOST_MULTI_INDEX_DETAIL_RND_INDEX_NODE_HPP
-
-#if defined(_MSC_VER)
-#pragma once
-#endif
-
-#include <boost/config.hpp> /* keep it first to prevent nasty warns in MSVC */
-#include <algorithm>
-#include <boost/integer/common_factor_rt.hpp>
-#include <boost/multi_index/detail/allocator_traits.hpp>
-#include <boost/multi_index/detail/raw_ptr.hpp>
-#include <cstddef>
-#include <functional>
-
-namespace boost{
-
-namespace multi_index{
-
-namespace detail{
-
-template<typename Allocator>
-struct random_access_index_node_impl
-{
-  typedef typename rebind_alloc_for<
-    Allocator,random_access_index_node_impl
-  >::type                                             node_allocator;
-  typedef allocator_traits<node_allocator>            node_alloc_traits;
-  typedef typename node_alloc_traits::pointer         pointer;
-  typedef typename node_alloc_traits::const_pointer   const_pointer;
-  typedef typename node_alloc_traits::difference_type difference_type;
-  typedef typename rebind_alloc_for<
-    Allocator,pointer
-  >::type                                             ptr_allocator;
-  typedef allocator_traits<ptr_allocator>             ptr_alloc_traits;
-  typedef typename ptr_alloc_traits::pointer          ptr_pointer;
-
-  ptr_pointer& up(){return up_;}
-  ptr_pointer  up()const{return up_;}
-
-  /* interoperability with rnd_node_iterator */
-
-  static void increment(pointer& x)
-  {
-    x=*(x->up()+1);
-  }
-
-  static void decrement(pointer& x)
-  {
-    x=*(x->up()-1);
-  }
-
-  static void advance(pointer& x,difference_type n)
-  {
-    x=*(x->up()+n);
-  }
-
-  static difference_type distance(pointer x,pointer y)
-  {
-    return static_cast<difference_type>(y->up()-x->up());
-  }
-
-  /* algorithmic stuff */
-
-  static void relocate(ptr_pointer pos,ptr_pointer x)
-  {
-    pointer n=*x;
-    if(x<pos){
-      extract(x,pos);
-      *(pos-1)=n;
-      n->up()=pos-1;
-    }
-    else{
-      while(x!=pos){
-        *x=*(x-1);
-        (*x)->up()=x;
-        --x;
-      }
-      *pos=n;
-      n->up()=pos;
-    }
-  };
-
-  static void relocate(ptr_pointer pos,ptr_pointer first,ptr_pointer last)
-  {
-    ptr_pointer begin,middle,end;
-    if(pos<first){
-      begin=pos;
-      middle=first;
-      end=last;
-    }
-    else{
-      begin=first;
-      middle=last;
-      end=pos;
-    }
-
-    std::ptrdiff_t n=end-begin;
-    std::ptrdiff_t m=middle-begin;
-    std::ptrdiff_t n_m=n-m;
-    std::ptrdiff_t p=integer::gcd(n,m);
-
-    for(std::ptrdiff_t i=0;i<p;++i){
-      pointer tmp=begin[i];
-      for(std::ptrdiff_t j=i,k;;){
-        if(j<n_m)k=j+m;
-        else     k=j-n_m;
-        if(k==i){
-          *(begin+j)=tmp;
-          (*(begin+j))->up()=begin+j;
-          break;
-        }
-        else{
-          *(begin+j)=*(begin+k);
-          (*(begin+j))->up()=begin+j;
-        }
-
-        if(k<n_m)j=k+m;
-        else     j=k-n_m;
-        if(j==i){
-          *(begin+k)=tmp;
-          (*(begin+k))->up()=begin+k;
-          break;
-        }
-        else{
-          *(begin+k)=*(begin+j);
-          (*(begin+k))->up()=begin+k;
-        }
-      }
-    }
-  };
-
-  static void extract(ptr_pointer x,ptr_pointer pend)
-  {
-    --pend;
-    while(x!=pend){
-      *x=*(x+1);
-      (*x)->up()=x;
-      ++x;
-    }
-  }
-
-  static void transfer(
-    ptr_pointer pbegin0,ptr_pointer pend0,ptr_pointer pbegin1)
-  {
-    while(pbegin0!=pend0){
-      *pbegin1=*pbegin0++;
-      (*pbegin1)->up()=pbegin1;
-      ++pbegin1;
-    }
-  }
-
-  static void reverse(ptr_pointer pbegin,ptr_pointer pend)
-  {
-    std::ptrdiff_t d=(pend-pbegin)/2;
-    for(std::ptrdiff_t i=0;i<d;++i){
-      std::swap(*pbegin,*--pend);
-      (*pbegin)->up()=pbegin;
-      (*pend)->up()=pend;
-      ++pbegin;
-    }
-  }
-
-  static ptr_pointer gather_nulls(
-    ptr_pointer pbegin,ptr_pointer pend,ptr_pointer x)
-  {
-    for(ptr_pointer p=pbegin;p!=x;++p){
-      if(*p){
-        *pbegin=*p;
-        (*pbegin)->up()=pbegin;
-        ++pbegin;
-      }
-    }
-    for(ptr_pointer p=pend;p!=x;){
-      if(*--p){
-        *--pend=*p;
-        (*pend)->up()=pend;
-      }
-    }
-    return pbegin;
-  }
-
-private:
-  ptr_pointer up_;
-};
-
-template<typename Super>
-struct random_access_index_node_trampoline:
-  random_access_index_node_impl<
-    typename rebind_alloc_for<
-      typename Super::allocator_type,
-      char
-    >::type
-  >
-{
-  typedef random_access_index_node_impl<
-    typename rebind_alloc_for<
-      typename Super::allocator_type,
-      char
-    >::type
-  > impl_type;
-};
-
-template<typename Super>
-struct random_access_index_node:
-  Super,random_access_index_node_trampoline<Super>
-{
-private:
-  typedef random_access_index_node_trampoline<Super> trampoline;
-
-public:
-  typedef typename trampoline::impl_type         impl_type;
-  typedef typename trampoline::pointer           impl_pointer;
-  typedef typename trampoline::const_pointer     const_impl_pointer;
-  typedef typename trampoline::difference_type   difference_type;
-  typedef typename trampoline::ptr_pointer       impl_ptr_pointer;
-
-  impl_ptr_pointer& up(){return trampoline::up();}
-  impl_ptr_pointer  up()const{return trampoline::up();}
-
-  impl_pointer impl()
-  {
-    return static_cast<impl_pointer>(
-      static_cast<impl_type*>(static_cast<trampoline*>(this)));
-  }
-
-  const_impl_pointer impl()const
-  {
-    return static_cast<const_impl_pointer>(
-      static_cast<const impl_type*>(static_cast<const trampoline*>(this)));
-  }
-
-  static random_access_index_node* from_impl(impl_pointer x)
-  {
-    return
-      static_cast<random_access_index_node*>(
-        static_cast<trampoline*>(
-          raw_ptr<impl_type*>(x)));
-  }
-
-  static const random_access_index_node* from_impl(const_impl_pointer x)
-  {
-    return
-      static_cast<const random_access_index_node*>(
-        static_cast<const trampoline*>(
-          raw_ptr<const impl_type*>(x)));
-  }
-
-  /* interoperability with rnd_node_iterator */
-
-  static void increment(random_access_index_node*& x)
-  {
-    impl_pointer xi=x->impl();
-    trampoline::increment(xi);
-    x=from_impl(xi);
-  }
-
-  static void decrement(random_access_index_node*& x)
-  {
-    impl_pointer xi=x->impl();
-    trampoline::decrement(xi);
-    x=from_impl(xi);
-  }
-
-  static void advance(random_access_index_node*& x,difference_type n)
-  {
-    impl_pointer xi=x->impl();
-    trampoline::advance(xi,n);
-    x=from_impl(xi);
-  }
-
-  static difference_type distance(
-    random_access_index_node* x,random_access_index_node* y)
-  {
-    return trampoline::distance(x->impl(),y->impl());
-  }
-};
-
-} /* namespace multi_index::detail */
-
-} /* namespace multi_index */
-
-} /* namespace boost */
-
-#endif
diff --git a/src/boost/multi_index/detail/rnd_index_ops.hpp b/src/boost/multi_index/detail/rnd_index_ops.hpp
deleted file mode 100644
index f5e76e44..00000000
--- a/src/boost/multi_index/detail/rnd_index_ops.hpp
+++ /dev/null
@@ -1,203 +0,0 @@
-/* Copyright 2003-2015 Joaquin M Lopez Munoz.
- * Distributed under the Boost 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/multi_index for library home page.
- */
-
-#ifndef BOOST_MULTI_INDEX_DETAIL_RND_INDEX_OPS_HPP
-#define BOOST_MULTI_INDEX_DETAIL_RND_INDEX_OPS_HPP
-
-#if defined(_MSC_VER)
-#pragma once
-#endif
-
-#include <boost/config.hpp> /* keep it first to prevent nasty warns in MSVC */
-#include <algorithm>
-#include <boost/multi_index/detail/rnd_index_ptr_array.hpp>
-
-namespace boost{
-
-namespace multi_index{
-
-namespace detail{
-
-/* Common code for random_access_index memfuns having templatized and
- * non-templatized versions.
- */
-
-template<typename Node,typename Allocator,typename Predicate>
-Node* random_access_index_remove(
-  random_access_index_ptr_array<Allocator>& ptrs,Predicate pred)
-{
-  typedef typename Node::value_type value_type;
-  typedef typename Node::impl_ptr_pointer impl_ptr_pointer;
-
-  impl_ptr_pointer first=ptrs.begin(),
-                   res=first,
-                   last=ptrs.end();
-  for(;first!=last;++first){
-    if(!pred(
-        const_cast<const value_type&>(Node::from_impl(*first)->value()))){
-      if(first!=res){
-        std::swap(*first,*res);
-        (*first)->up()=first;
-        (*res)->up()=res;
-      }
-      ++res;
-    }
-  }
-  return Node::from_impl(*res);
-}
-
-template<typename Node,typename Allocator,class BinaryPredicate>
-Node* random_access_index_unique(
-  random_access_index_ptr_array<Allocator>& ptrs,BinaryPredicate binary_pred)
-{
-  typedef typename Node::value_type       value_type;
-  typedef typename Node::impl_ptr_pointer impl_ptr_pointer;
-
-  impl_ptr_pointer first=ptrs.begin(),
-                   res=first,
-                   last=ptrs.end();
-  if(first!=last){
-    for(;++first!=last;){
-      if(!binary_pred(
-           const_cast<const value_type&>(Node::from_impl(*res)->value()),
-           const_cast<const value_type&>(Node::from_impl(*first)->value()))){
-        ++res;
-        if(first!=res){
-          std::swap(*first,*res);
-          (*first)->up()=first;
-          (*res)->up()=res;
-        }
-      }
-    }
-    ++res;
-  }
-  return Node::from_impl(*res);
-}
-
-template<typename Node,typename Allocator,typename Compare>
-void random_access_index_inplace_merge(
-  const Allocator& al,
-  random_access_index_ptr_array<Allocator>& ptrs,
-  BOOST_DEDUCED_TYPENAME Node::impl_ptr_pointer first1,Compare comp)
-{
-  typedef typename Node::value_type       value_type;
-  typedef typename Node::impl_pointer     impl_pointer;
-  typedef typename Node::impl_ptr_pointer impl_ptr_pointer;
-
-  auto_space<impl_pointer,Allocator> spc(al,ptrs.size());
-
-  impl_ptr_pointer first0=ptrs.begin(),
-                   last0=first1,
-                   last1=ptrs.end(),
-                   out=spc.data();
-  while(first0!=last0&&first1!=last1){
-    if(comp(
-        const_cast<const value_type&>(Node::from_impl(*first1)->value()),
-        const_cast<const value_type&>(Node::from_impl(*first0)->value()))){
-      *out++=*first1++;
-    }
-    else{
-      *out++=*first0++;
-    }
-  }
-  std::copy(&*first0,&*last0,&*out);
-  std::copy(&*first1,&*last1,&*out);
-
-  first1=ptrs.begin();
-  out=spc.data();
-  while(first1!=last1){
-    *first1=*out++;
-    (*first1)->up()=first1;
-    ++first1;
-  }
-}
-
-/* sorting */
-
-/* auxiliary stuff */
-
-template<typename Node,typename Compare>
-struct random_access_index_sort_compare
-{
-  typedef typename Node::impl_pointer first_argument_type;
-  typedef typename Node::impl_pointer second_argument_type;
-  typedef bool                        result_type;
-
-  random_access_index_sort_compare(Compare comp_=Compare()):comp(comp_){}
-
-  bool operator()(
-    typename Node::impl_pointer x,typename Node::impl_pointer y)const
-  {
-    typedef typename Node::value_type value_type;
-
-    return comp(
-      const_cast<const value_type&>(Node::from_impl(x)->value()),
-      const_cast<const value_type&>(Node::from_impl(y)->value()));
-  }
-
-private:
-  Compare comp;
-};
-
-template<typename Node,typename Allocator,class Compare>
-void random_access_index_sort(
-  const Allocator& al,
-  random_access_index_ptr_array<Allocator>& ptrs,
-  Compare comp)
-{
-  /* The implementation is extremely simple: an auxiliary
-   * array of pointers is sorted using stdlib facilities and
-   * then used to rearrange the index. This is suboptimal
-   * in space and time, but has some advantages over other
-   * possible approaches:
-   *   - Use std::stable_sort() directly on ptrs using some
-   *     special iterator in charge of maintaining pointers
-   *     and up() pointers in sync: we cannot guarantee
-   *     preservation of the container invariants in the face of
-   *     exceptions, if, for instance, std::stable_sort throws
-   *     when ptrs transitorily contains duplicate elements.
-   *   - Rewrite the internal algorithms of std::stable_sort
-   *     adapted for this case: besides being a fair amount of
-   *     work, making a stable sort compatible with Boost.MultiIndex
-   *     invariants (basically, no duplicates or missing elements
-   *     even if an exception is thrown) is complicated, error-prone
-   *     and possibly won't perform much better than the
-   *     solution adopted.
-   */
-
-  if(ptrs.size()<=1)return;
-
-  typedef typename Node::impl_pointer       impl_pointer;
-  typedef typename Node::impl_ptr_pointer   impl_ptr_pointer;
-  typedef random_access_index_sort_compare<
-    Node,Compare>                           ptr_compare;
-  
-  impl_ptr_pointer   first=ptrs.begin();
-  impl_ptr_pointer   last=ptrs.end();
-  auto_space<
-    impl_pointer,
-    Allocator>       spc(al,ptrs.size());
-  impl_ptr_pointer   buf=spc.data();
-
-  std::copy(&*first,&*last,&*buf);
-  std::stable_sort(&*buf,&*buf+ptrs.size(),ptr_compare(comp));
-
-  while(first!=last){
-    *first=*buf++;
-    (*first)->up()=first;
-    ++first;
-  }
-}
-
-} /* namespace multi_index::detail */
-
-} /* namespace multi_index */
-
-} /* namespace boost */
-
-#endif
diff --git a/src/boost/multi_index/detail/rnd_index_ptr_array.hpp b/src/boost/multi_index/detail/rnd_index_ptr_array.hpp
deleted file mode 100644
index e758b628..00000000
--- a/src/boost/multi_index/detail/rnd_index_ptr_array.hpp
+++ /dev/null
@@ -1,154 +0,0 @@
-/* Copyright 2003-2022 Joaquin M Lopez Munoz.
- * Distributed under the Boost 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/multi_index for library home page.
- */
-
-#ifndef BOOST_MULTI_INDEX_DETAIL_RND_INDEX_PTR_ARRAY_HPP
-#define BOOST_MULTI_INDEX_DETAIL_RND_INDEX_PTR_ARRAY_HPP
-
-#if defined(_MSC_VER)
-#pragma once
-#endif
-
-#include <boost/config.hpp> /* keep it first to prevent nasty warns in MSVC */
-#include <algorithm>
-#include <boost/core/noncopyable.hpp>
-#include <boost/multi_index/detail/allocator_traits.hpp>
-#include <boost/multi_index/detail/auto_space.hpp>
-#include <boost/multi_index/detail/rnd_index_node.hpp>
-
-namespace boost{
-
-namespace multi_index{
-
-namespace detail{
-
-/* pointer structure for use by random access indices */
-
-template<typename Allocator>
-class random_access_index_ptr_array:private noncopyable
-{
-  typedef random_access_index_node_impl<
-    typename rebind_alloc_for<
-      Allocator,
-      char
-    >::type
-  >                                         node_impl_type;
-
-public:
-  typedef typename node_impl_type::pointer  value_type;
-  typedef typename rebind_alloc_for<
-    Allocator,value_type
-  >::type                                   value_allocator;
-  typedef allocator_traits<value_allocator> alloc_traits;
-  typedef typename alloc_traits::pointer    pointer;
-  typedef typename alloc_traits::size_type  size_type;
-
-  random_access_index_ptr_array(
-    const Allocator& al,value_type end_,size_type sz):
-    size_(sz),
-    capacity_(sz),
-    spc(al,capacity_+1)
-  {
-    *end()=end_;
-    end_->up()=end();
-  }
-
-  size_type size()const{return size_;}
-  size_type capacity()const{return capacity_;}
-
-  void room_for_one()
-  {
-    if(size_==capacity_){
-      reserve(capacity_<=10?15:capacity_+capacity_/2);
-    }
-  }
-
-  void reserve(size_type c)
-  {
-    if(c>capacity_)set_capacity(c);
-  }
-
-  void shrink_to_fit()
-  {
-    if(capacity_>size_)set_capacity(size_);
-  }
-
-  pointer begin()const{return ptrs();}
-  pointer end()const{return ptrs()+size_;}
-  pointer at(size_type n)const{return ptrs()+n;}
-
-  void push_back(value_type x)
-  {
-    *(end()+1)=*end();
-    (*(end()+1))->up()=end()+1;
-    *end()=x;
-    (*end())->up()=end();
-    ++size_;
-  }
-
-  void erase(value_type x)
-  {
-    node_impl_type::extract(x->up(),end()+1);
-    --size_;
-  }
-
-  void clear()
-  {
-    *begin()=*end();
-    (*begin())->up()=begin();
-    size_=0;
-  }
-
-  void swap(random_access_index_ptr_array& x)
-  {
-    std::swap(size_,x.size_);
-    std::swap(capacity_,x.capacity_);
-    spc.swap(x.spc);
-  }
-
-  template<typename BoolConstant>
-  void swap(random_access_index_ptr_array& x,BoolConstant swap_allocators)
-  {
-    std::swap(size_,x.size_);
-    std::swap(capacity_,x.capacity_);
-    spc.swap(x.spc,swap_allocators);
-  }
-
-private:
-  size_type                        size_;
-  size_type                        capacity_;
-  auto_space<value_type,Allocator> spc;
-
-  pointer ptrs()const
-  {
-    return spc.data();
-  }
-
-  void set_capacity(size_type c)
-  {
-    auto_space<value_type,Allocator> spc1(spc.get_allocator(),c+1);
-    node_impl_type::transfer(begin(),end()+1,spc1.data());
-    spc.swap(spc1);
-    capacity_=c;
-  }
-};
-
-template<typename Allocator>
-void swap(
-  random_access_index_ptr_array<Allocator>& x,
-  random_access_index_ptr_array<Allocator>& y)
-{
-  x.swap(y);
-}
-
-} /* namespace multi_index::detail */
-
-} /* namespace multi_index */
-
-} /* namespace boost */
-
-#endif
diff --git a/src/boost/multi_index/detail/rnd_node_iterator.hpp b/src/boost/multi_index/detail/rnd_node_iterator.hpp
deleted file mode 100644
index 7149cb0f..00000000
--- a/src/boost/multi_index/detail/rnd_node_iterator.hpp
+++ /dev/null
@@ -1,143 +0,0 @@
-/* Copyright 2003-2023 Joaquin M Lopez Munoz.
- * Distributed under the Boost 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/multi_index for library home page.
- */
-
-#ifndef BOOST_MULTI_INDEX_DETAIL_RND_NODE_ITERATOR_HPP
-#define BOOST_MULTI_INDEX_DETAIL_RND_NODE_ITERATOR_HPP
-
-#if defined(_MSC_VER)
-#pragma once
-#endif
-
-#include <boost/config.hpp> /* keep it first to prevent nasty warns in MSVC */
-#include <boost/operators.hpp>
-
-#if !defined(BOOST_MULTI_INDEX_DISABLE_SERIALIZATION)
-#include <boost/core/serialization.hpp>
-#endif
-
-namespace boost{
-
-namespace multi_index{
-
-namespace detail{
-
-/* Iterator class for node-based indices with random access iterators. */
-
-template<typename Node>
-class rnd_node_iterator:
-  public random_access_iterator_helper<
-    rnd_node_iterator<Node>,
-    typename Node::value_type,
-    typename Node::difference_type,
-    const typename Node::value_type*,
-    const typename Node::value_type&>
-{
-public:
-  /* coverity[uninit_ctor]: suppress warning */
-  rnd_node_iterator(){}
-  explicit rnd_node_iterator(Node* node_):node(node_){}
-
-  const typename Node::value_type& operator*()const
-  {
-    return node->value();
-  }
-
-  rnd_node_iterator& operator++()
-  {
-    Node::increment(node);
-    return *this;
-  }
-
-  rnd_node_iterator& operator--()
-  {
-    Node::decrement(node);
-    return *this;
-  }
-
-  rnd_node_iterator& operator+=(typename Node::difference_type n)
-  {
-    Node::advance(node,n);
-    return *this;
-  }
-
-  rnd_node_iterator& operator-=(typename Node::difference_type n)
-  {
-    Node::advance(node,-n);
-    return *this;
-  }
-
-#if !defined(BOOST_MULTI_INDEX_DISABLE_SERIALIZATION)
-  /* Serialization. As for why the following is public,
-   * see explanation in safe_mode_iterator notes in safe_mode.hpp.
-   */
-
-  template<class Archive>
-  void serialize(Archive& ar,const unsigned int version)
-  {
-    core::split_member(ar,*this,version);
-  }
-
-  typedef typename Node::base_type node_base_type;
-
-  template<class Archive>
-  void save(Archive& ar,const unsigned int)const
-  {
-    node_base_type* bnode=node;
-    ar<<core::make_nvp("pointer",bnode);
-  }
-
-  template<class Archive>
-  void load(Archive& ar,const unsigned int)
-  {
-    node_base_type* bnode;
-    ar>>core::make_nvp("pointer",bnode);
-    node=static_cast<Node*>(bnode);
-  }
-#endif
-
-  /* get_node is not to be used by the user */
-
-  typedef Node node_type;
-
-  Node* get_node()const{return node;}
-
-private:
-  Node* node;
-};
-
-template<typename Node>
-bool operator==(
-  const rnd_node_iterator<Node>& x,
-  const rnd_node_iterator<Node>& y)
-{
-  return x.get_node()==y.get_node();
-}
-
-template<typename Node>
-bool operator<(
-  const rnd_node_iterator<Node>& x,
-  const rnd_node_iterator<Node>& y)
-{
-  return Node::distance(x.get_node(),y.get_node())>0;
-}
-
-template<typename Node>
-typename Node::difference_type operator-(
-  const rnd_node_iterator<Node>& x,
-  const rnd_node_iterator<Node>& y)
-{
-  return Node::distance(y.get_node(),x.get_node());
-}
-
-} /* namespace multi_index::detail */
-
-} /* namespace multi_index */
-
-} /* namespace boost */
-
-#endif
diff --git a/src/boost/multi_index/random_access_index.hpp b/src/boost/multi_index/random_access_index.hpp
deleted file mode 100644
index 96b45658..00000000
--- a/src/boost/multi_index/random_access_index.hpp
+++ /dev/null
@@ -1,1362 +0,0 @@
-/* Copyright 2003-2023 Joaquin M Lopez Munoz.
- * Distributed under the Boost 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/multi_index for library home page.
- */
-
-#ifndef BOOST_MULTI_INDEX_RANDOM_ACCESS_INDEX_HPP
-#define BOOST_MULTI_INDEX_RANDOM_ACCESS_INDEX_HPP
-
-#if defined(_MSC_VER)
-#pragma once
-#endif
-
-#include <boost/config.hpp> /* keep it first to prevent nasty warns in MSVC */
-#include <algorithm>
-#include <boost/bind/bind.hpp>
-#include <boost/call_traits.hpp>
-#include <boost/core/addressof.hpp>
-#include <boost/core/no_exceptions_support.hpp>
-#include <boost/detail/workaround.hpp>
-#include <boost/iterator/reverse_iterator.hpp>
-#include <boost/move/core.hpp>
-#include <boost/move/utility_core.hpp>
-#include <boost/mpl/bool.hpp>
-#include <boost/mpl/not.hpp>
-#include <boost/mpl/push_front.hpp>
-#include <boost/multi_index/detail/access_specifier.hpp>
-#include <boost/multi_index/detail/allocator_traits.hpp>
-#include <boost/multi_index/detail/do_not_copy_elements_tag.hpp>
-#include <boost/multi_index/detail/index_node_base.hpp>
-#include <boost/multi_index/detail/node_handle.hpp>
-#include <boost/multi_index/detail/rnd_node_iterator.hpp>
-#include <boost/multi_index/detail/rnd_index_node.hpp>
-#include <boost/multi_index/detail/rnd_index_ops.hpp>
-#include <boost/multi_index/detail/rnd_index_ptr_array.hpp>
-#include <boost/multi_index/detail/safe_mode.hpp>
-#include <boost/multi_index/detail/scope_guard.hpp>
-#include <boost/multi_index/detail/vartempl_support.hpp>
-#include <boost/multi_index/random_access_index_fwd.hpp>
-#include <boost/throw_exception.hpp> 
-#include <boost/tuple/tuple.hpp>
-#include <boost/type_traits/is_copy_constructible.hpp>
-#include <boost/type_traits/is_integral.hpp>
-#include <functional>
-#include <stdexcept> 
-#include <utility>
-
-#if !defined(BOOST_NO_CXX11_HDR_INITIALIZER_LIST)
-#include<initializer_list>
-#endif
-
-#if !defined(BOOST_MULTI_INDEX_DISABLE_SERIALIZATION)
-#include <boost/multi_index/detail/rnd_index_loader.hpp>
-#endif
-
-#if defined(BOOST_MULTI_INDEX_ENABLE_INVARIANT_CHECKING)
-#define BOOST_MULTI_INDEX_RND_INDEX_CHECK_INVARIANT_OF(x)                    \
-  detail::scope_guard BOOST_JOIN(check_invariant_,__LINE__)=                 \
-    detail::make_obj_guard(x,&random_access_index::check_invariant_);        \
-  BOOST_JOIN(check_invariant_,__LINE__).touch();
-#define BOOST_MULTI_INDEX_RND_INDEX_CHECK_INVARIANT                          \
-  BOOST_MULTI_INDEX_RND_INDEX_CHECK_INVARIANT_OF(*this)
-#else
-#define BOOST_MULTI_INDEX_RND_INDEX_CHECK_INVARIANT_OF(x)
-#define BOOST_MULTI_INDEX_RND_INDEX_CHECK_INVARIANT
-#endif
-
-namespace boost{
-
-namespace multi_index{
-
-namespace detail{
-
-/* random_access_index adds a layer of random access indexing
- * to a given Super
- */
-
-#if defined(BOOST_MSVC)
-#pragma warning(push)
-#pragma warning(disable:4355) /* this used in base member initializer list */
-#endif
-
-template<typename SuperMeta,typename TagList>
-class random_access_index:
-  BOOST_MULTI_INDEX_PROTECTED_IF_MEMBER_TEMPLATE_FRIENDS SuperMeta::type
-{ 
-#if defined(BOOST_MULTI_INDEX_ENABLE_INVARIANT_CHECKING)&&\
-    BOOST_WORKAROUND(__MWERKS__,<=0x3003)
-/* The "ISO C++ Template Parser" option in CW8.3 has a problem with the
- * lifetime of const references bound to temporaries --precisely what
- * scopeguards are.
- */
-
-#pragma parse_mfunc_templ off
-#endif
-
-#if !defined(BOOST_NO_MEMBER_TEMPLATE_FRIENDS)
-  /* cross-index access */
-
-  template <typename,typename,typename> friend class index_base;
-#endif
-
-  typedef typename SuperMeta::type               super;
-
-protected:
-  typedef random_access_index_node<
-    typename super::index_node_type>             index_node_type;
-
-private:
-  typedef typename index_node_type::impl_type    node_impl_type;
-  typedef random_access_index_ptr_array<
-    typename super::final_allocator_type>        ptr_array;
-  typedef typename ptr_array::pointer            node_impl_ptr_pointer;
-
-public:
-  /* types */
-
-  typedef typename index_node_type::value_type   value_type;
-  typedef tuples::null_type                      ctor_args;
-  typedef typename super::final_allocator_type   allocator_type;
-  typedef value_type&                            reference;
-  typedef const value_type&                      const_reference;
-
-#if defined(BOOST_MULTI_INDEX_ENABLE_SAFE_MODE)
-  typedef safe_mode::safe_iterator<
-    rnd_node_iterator<index_node_type> >        iterator;
-#else
-  typedef rnd_node_iterator<index_node_type>    iterator;
-#endif
-
-  typedef iterator                               const_iterator;
-
-private:
-  typedef allocator_traits<allocator_type>       alloc_traits;
-
-public:
-  typedef typename alloc_traits::pointer         pointer;
-  typedef typename alloc_traits::const_pointer   const_pointer;
-  typedef typename alloc_traits::size_type       size_type;
-  typedef typename alloc_traits::difference_type difference_type;
-  typedef typename
-    boost::reverse_iterator<iterator>            reverse_iterator;
-  typedef typename
-    boost::reverse_iterator<const_iterator>      const_reverse_iterator;
-  typedef typename super::final_node_handle_type node_type;
-  typedef detail::insert_return_type<
-    iterator,node_type>                          insert_return_type;
-  typedef TagList                                tag_list;
-
-protected:
-  typedef typename super::final_node_type     final_node_type;
-  typedef tuples::cons<
-    ctor_args, 
-    typename super::ctor_args_list>           ctor_args_list;
-  typedef typename mpl::push_front<
-    typename super::index_type_list,
-    random_access_index>::type                index_type_list;
-  typedef typename mpl::push_front<
-    typename super::iterator_type_list,
-    iterator>::type                           iterator_type_list;
-  typedef typename mpl::push_front<
-    typename super::const_iterator_type_list,
-    const_iterator>::type                     const_iterator_type_list;
-  typedef typename super::copy_map_type       copy_map_type;
-
-#if !defined(BOOST_MULTI_INDEX_DISABLE_SERIALIZATION)
-  typedef typename super::index_saver_type    index_saver_type;
-  typedef typename super::index_loader_type   index_loader_type;
-#endif
-
-private:
-#if defined(BOOST_MULTI_INDEX_ENABLE_SAFE_MODE)
-  typedef safe_mode::safe_container<iterator> safe_container;
-#endif
-
-  typedef typename call_traits<
-    value_type>::param_type                   value_param_type;
-
-  /* needed to avoid commas in some macros */
-
-  typedef std::pair<iterator,bool>            pair_return_type;
-
-public:
-
-  /* construct/copy/destroy
-   * Default and copy ctors are in the protected section as indices are
-   * not supposed to be created on their own. No range ctor either.
-   */
-
-  random_access_index<SuperMeta,TagList>& operator=(
-    const random_access_index<SuperMeta,TagList>& x)
-  {
-    this->final()=x.final();
-    return *this;
-  }
-
-#if !defined(BOOST_NO_CXX11_HDR_INITIALIZER_LIST)
-  random_access_index<SuperMeta,TagList>& operator=(
-    std::initializer_list<value_type> list)
-  {
-    this->final()=list;
-    return *this;
-  }
-#endif
-
-  template <class InputIterator>
-  void assign(InputIterator first,InputIterator last)
-  {
-    assign_iter(first,last,mpl::not_<is_integral<InputIterator> >());
-  }
-
-#if !defined(BOOST_NO_CXX11_HDR_INITIALIZER_LIST)
-  void assign(std::initializer_list<value_type> list)
-  {
-    assign(list.begin(),list.end());
-  }
-#endif
-
-  void assign(size_type n,value_param_type value)
-  {
-    BOOST_MULTI_INDEX_RND_INDEX_CHECK_INVARIANT;
-    clear();
-    for(size_type i=0;i<n;++i)push_back(value);
-  }
-    
-  allocator_type get_allocator()const BOOST_NOEXCEPT
-  {
-    return this->final().get_allocator();
-  }
-
-  /* iterators */
-
-  iterator begin()BOOST_NOEXCEPT
-    {return make_iterator(index_node_type::from_impl(*ptrs.begin()));}
-  const_iterator begin()const BOOST_NOEXCEPT
-    {return make_iterator(index_node_type::from_impl(*ptrs.begin()));}
-  iterator
-    end()BOOST_NOEXCEPT{return make_iterator(header());}
-  const_iterator
-    end()const BOOST_NOEXCEPT{return make_iterator(header());}
-  reverse_iterator
-    rbegin()BOOST_NOEXCEPT{return boost::make_reverse_iterator(end());}
-  const_reverse_iterator
-    rbegin()const BOOST_NOEXCEPT{return boost::make_reverse_iterator(end());}
-  reverse_iterator
-    rend()BOOST_NOEXCEPT{return boost::make_reverse_iterator(begin());}
-  const_reverse_iterator
-    rend()const BOOST_NOEXCEPT{return boost::make_reverse_iterator(begin());}
-  const_iterator
-    cbegin()const BOOST_NOEXCEPT{return begin();}
-  const_iterator
-    cend()const BOOST_NOEXCEPT{return end();}
-  const_reverse_iterator
-    crbegin()const BOOST_NOEXCEPT{return rbegin();}
-  const_reverse_iterator
-    crend()const BOOST_NOEXCEPT{return rend();}
-
-  iterator iterator_to(const value_type& x)
-  {
-    return make_iterator(
-      node_from_value<index_node_type>(boost::addressof(x)));
-  }
-
-  const_iterator iterator_to(const value_type& x)const
-  {
-    return make_iterator(
-      node_from_value<index_node_type>(boost::addressof(x)));
-  }
-
-  /* capacity */
-
-  bool      empty()const BOOST_NOEXCEPT{return this->final_empty_();}
-  size_type size()const BOOST_NOEXCEPT{return this->final_size_();}
-  size_type max_size()const BOOST_NOEXCEPT{return this->final_max_size_();}
-  size_type capacity()const BOOST_NOEXCEPT{return ptrs.capacity();}
-
-  void reserve(size_type n)
-  {
-    BOOST_MULTI_INDEX_RND_INDEX_CHECK_INVARIANT;
-    ptrs.reserve(n);
-  }
-  
-  void shrink_to_fit()
-  {
-    BOOST_MULTI_INDEX_RND_INDEX_CHECK_INVARIANT;
-    ptrs.shrink_to_fit();
-  }
-
-  void resize(size_type n)
-  {
-    BOOST_MULTI_INDEX_RND_INDEX_CHECK_INVARIANT;
-    if(n>size())
-      for(size_type m=n-size();m--;)
-        this->final_emplace_(BOOST_MULTI_INDEX_NULL_PARAM_PACK);
-    else if(n<size())erase(begin()+n,end());
-  }
-
-  void resize(size_type n,value_param_type x)
-  {
-    BOOST_MULTI_INDEX_RND_INDEX_CHECK_INVARIANT;
-    if(n>size())for(size_type m=n-size();m--;)this->final_insert_(x); 
-    else if(n<size())erase(begin()+n,end());
-  }
-
-  /* access: no non-const versions provided as random_access_index
-   * handles const elements.
-   */
-
-  const_reference operator[](size_type n)const
-  {
-    BOOST_MULTI_INDEX_SAFE_MODE_ASSERT(n<size(),safe_mode::out_of_bounds);
-    return index_node_type::from_impl(*ptrs.at(n))->value();
-  }
-
-  const_reference at(size_type n)const
-  {
-    if(n>=size())throw_exception(std::out_of_range("random access index"));
-    return index_node_type::from_impl(*ptrs.at(n))->value();
-  }
-
-  const_reference front()const{return operator[](0);}
-  const_reference back()const{return operator[](size()-1);}
-
-  /* modifiers */
-
-  BOOST_MULTI_INDEX_OVERLOADS_TO_VARTEMPL(
-    pair_return_type,emplace_front,emplace_front_impl)
-    
-  std::pair<iterator,bool> push_front(const value_type& x)
-                             {return insert(begin(),x);}
-  std::pair<iterator,bool> push_front(BOOST_RV_REF(value_type) x)
-                             {return insert(begin(),boost::move(x));}
-  void                     pop_front(){erase(begin());}
-
-  BOOST_MULTI_INDEX_OVERLOADS_TO_VARTEMPL(
-    pair_return_type,emplace_back,emplace_back_impl)
-
-  std::pair<iterator,bool> push_back(const value_type& x)
-                             {return insert(end(),x);}
-  std::pair<iterator,bool> push_back(BOOST_RV_REF(value_type) x)
-                             {return insert(end(),boost::move(x));}
-  void                     pop_back(){erase(--end());}
-
-  BOOST_MULTI_INDEX_OVERLOADS_TO_VARTEMPL_EXTRA_ARG(
-    pair_return_type,emplace,emplace_impl,iterator,position)
-    
-  std::pair<iterator,bool> insert(iterator position,const value_type& x)
-  {
-    BOOST_MULTI_INDEX_CHECK_VALID_ITERATOR(position);
-    BOOST_MULTI_INDEX_CHECK_IS_OWNER(position,*this);
-    BOOST_MULTI_INDEX_RND_INDEX_CHECK_INVARIANT;
-    std::pair<final_node_type*,bool> p=this->final_insert_(x);
-    if(p.second&&position.get_node()!=header()){
-      relocate(position.get_node(),p.first);
-    }
-    return std::pair<iterator,bool>(make_iterator(p.first),p.second);
-  }
-
-  std::pair<iterator,bool> insert(iterator position,BOOST_RV_REF(value_type) x)
-  {
-    BOOST_MULTI_INDEX_CHECK_VALID_ITERATOR(position);
-    BOOST_MULTI_INDEX_CHECK_IS_OWNER(position,*this);
-    BOOST_MULTI_INDEX_RND_INDEX_CHECK_INVARIANT;
-    std::pair<final_node_type*,bool> p=this->final_insert_rv_(x);
-    if(p.second&&position.get_node()!=header()){
-      relocate(position.get_node(),p.first);
-    }
-    return std::pair<iterator,bool>(make_iterator(p.first),p.second);
-  }
-
-  void insert(iterator position,size_type n,value_param_type x)
-  {
-    BOOST_MULTI_INDEX_CHECK_VALID_ITERATOR(position);
-    BOOST_MULTI_INDEX_CHECK_IS_OWNER(position,*this);
-    BOOST_MULTI_INDEX_RND_INDEX_CHECK_INVARIANT;
-    size_type s=0;
-    BOOST_TRY{
-      while(n--){
-        if(push_back(x).second)++s;
-      }
-    }
-    BOOST_CATCH(...){
-      relocate(position,end()-s,end());
-      BOOST_RETHROW;
-    }
-    BOOST_CATCH_END
-    relocate(position,end()-s,end());
-  }
- 
-  template<typename InputIterator>
-  void insert(iterator position,InputIterator first,InputIterator last)
-  {
-    insert_iter(position,first,last,mpl::not_<is_integral<InputIterator> >());
-  }
-
-#if !defined(BOOST_NO_CXX11_HDR_INITIALIZER_LIST)
-  void insert(iterator position,std::initializer_list<value_type> list)
-  {
-    insert(position,list.begin(),list.end());
-  }
-#endif
-
-  insert_return_type insert(const_iterator position,BOOST_RV_REF(node_type) nh)
-  {
-    BOOST_MULTI_INDEX_CHECK_VALID_ITERATOR(position);
-    BOOST_MULTI_INDEX_CHECK_IS_OWNER(position,*this);
-    if(nh)BOOST_MULTI_INDEX_CHECK_EQUAL_ALLOCATORS(*this,nh);
-    BOOST_MULTI_INDEX_RND_INDEX_CHECK_INVARIANT;
-    std::pair<final_node_type*,bool> p=this->final_insert_nh_(nh);
-    if(p.second&&position.get_node()!=header()){
-      relocate(position.get_node(),p.first);
-    }
-    return insert_return_type(make_iterator(p.first),p.second,boost::move(nh));
-  }
-
-  node_type extract(const_iterator position)
-  {
-    BOOST_MULTI_INDEX_CHECK_VALID_ITERATOR(position);
-    BOOST_MULTI_INDEX_CHECK_DEREFERENCEABLE_ITERATOR(position);
-    BOOST_MULTI_INDEX_CHECK_IS_OWNER(position,*this);
-    BOOST_MULTI_INDEX_RND_INDEX_CHECK_INVARIANT;
-    return this->final_extract_(
-      static_cast<final_node_type*>(position.get_node()));
-  }
-
-  iterator erase(iterator position)
-  {
-    BOOST_MULTI_INDEX_CHECK_VALID_ITERATOR(position);
-    BOOST_MULTI_INDEX_CHECK_DEREFERENCEABLE_ITERATOR(position);
-    BOOST_MULTI_INDEX_CHECK_IS_OWNER(position,*this);
-    BOOST_MULTI_INDEX_RND_INDEX_CHECK_INVARIANT;
-    this->final_erase_(static_cast<final_node_type*>(position++.get_node()));
-    return position;
-  }
-  
-  iterator erase(iterator first,iterator last)
-  {
-    BOOST_MULTI_INDEX_CHECK_VALID_ITERATOR(first);
-    BOOST_MULTI_INDEX_CHECK_VALID_ITERATOR(last);
-    BOOST_MULTI_INDEX_CHECK_IS_OWNER(first,*this);
-    BOOST_MULTI_INDEX_CHECK_IS_OWNER(last,*this);
-    BOOST_MULTI_INDEX_CHECK_VALID_RANGE(first,last);
-    BOOST_MULTI_INDEX_RND_INDEX_CHECK_INVARIANT;
-    difference_type n=static_cast<difference_type>(last-first);
-    relocate(end(),first,last);
-    while(n--)pop_back();
-    return last;
-  }
-
-  bool replace(iterator position,const value_type& x)
-  {
-    BOOST_MULTI_INDEX_CHECK_VALID_ITERATOR(position);
-    BOOST_MULTI_INDEX_CHECK_DEREFERENCEABLE_ITERATOR(position);
-    BOOST_MULTI_INDEX_CHECK_IS_OWNER(position,*this);
-    BOOST_MULTI_INDEX_RND_INDEX_CHECK_INVARIANT;
-    return this->final_replace_(
-      x,static_cast<final_node_type*>(position.get_node()));
-  }
-
-  bool replace(iterator position,BOOST_RV_REF(value_type) x)
-  {
-    BOOST_MULTI_INDEX_CHECK_VALID_ITERATOR(position);
-    BOOST_MULTI_INDEX_CHECK_DEREFERENCEABLE_ITERATOR(position);
-    BOOST_MULTI_INDEX_CHECK_IS_OWNER(position,*this);
-    BOOST_MULTI_INDEX_RND_INDEX_CHECK_INVARIANT;
-    return this->final_replace_rv_(
-      x,static_cast<final_node_type*>(position.get_node()));
-  }
-
-  template<typename Modifier>
-  bool modify(iterator position,Modifier mod)
-  {
-    BOOST_MULTI_INDEX_CHECK_VALID_ITERATOR(position);
-    BOOST_MULTI_INDEX_CHECK_DEREFERENCEABLE_ITERATOR(position);
-    BOOST_MULTI_INDEX_CHECK_IS_OWNER(position,*this);
-    BOOST_MULTI_INDEX_RND_INDEX_CHECK_INVARIANT;
-
-#if defined(BOOST_MULTI_INDEX_ENABLE_SAFE_MODE)
-    /* MSVC++ 6.0 optimizer on safe mode code chokes if this
-     * this is not added. Left it for all compilers as it does no
-     * harm.
-     */
-
-    position.detach();
-#endif
-
-    return this->final_modify_(
-      mod,static_cast<final_node_type*>(position.get_node()));
-  }
-
-  template<typename Modifier,typename Rollback>
-  bool modify(iterator position,Modifier mod,Rollback back_)
-  {
-    BOOST_MULTI_INDEX_CHECK_VALID_ITERATOR(position);
-    BOOST_MULTI_INDEX_CHECK_DEREFERENCEABLE_ITERATOR(position);
-    BOOST_MULTI_INDEX_CHECK_IS_OWNER(position,*this);
-    BOOST_MULTI_INDEX_RND_INDEX_CHECK_INVARIANT;
-
-#if defined(BOOST_MULTI_INDEX_ENABLE_SAFE_MODE)
-    /* MSVC++ 6.0 optimizer on safe mode code chokes if this
-     * this is not added. Left it for all compilers as it does no
-     * harm.
-     */
-
-    position.detach();
-#endif
-
-    return this->final_modify_(
-      mod,back_,static_cast<final_node_type*>(position.get_node()));
-  }
-
-  void swap(random_access_index<SuperMeta,TagList>& x)
-  {
-    BOOST_MULTI_INDEX_RND_INDEX_CHECK_INVARIANT;
-    BOOST_MULTI_INDEX_RND_INDEX_CHECK_INVARIANT_OF(x);
-    this->final_swap_(x.final());
-  }
-
-  void clear()BOOST_NOEXCEPT
-  {
-    BOOST_MULTI_INDEX_RND_INDEX_CHECK_INVARIANT;
-    this->final_clear_();
-  }
-
-  /* list operations */
-
-  template<typename Index>
-  BOOST_MULTI_INDEX_ENABLE_IF_MERGEABLE(random_access_index,Index,void)
-  splice(iterator position,Index& x)
-  {
-    BOOST_MULTI_INDEX_CHECK_VALID_ITERATOR(position);
-    BOOST_MULTI_INDEX_CHECK_IS_OWNER(position,*this);
-    BOOST_MULTI_INDEX_RND_INDEX_CHECK_INVARIANT;
-    if(x.end().get_node()==this->header()){ /* same container */
-      BOOST_MULTI_INDEX_SAFE_MODE_ASSERT(
-        position==end(),safe_mode::inside_range);
-    }
-    else{
-      external_splice(
-        position,x,x.begin(),x.end(),
-        boost::is_copy_constructible<value_type>());
-    }
-  }
-
-  template<typename Index>
-  BOOST_MULTI_INDEX_ENABLE_IF_MERGEABLE(random_access_index,Index,void)
-  splice(iterator position,BOOST_RV_REF(Index) x)
-  {
-    splice(position,static_cast<Index&>(x));
-  }
-
-  template<typename Index>
-  BOOST_MULTI_INDEX_ENABLE_IF_MERGEABLE(
-    random_access_index,Index,pair_return_type)
-  splice(
-    iterator position,Index& x,BOOST_DEDUCED_TYPENAME Index::iterator i)
-  {
-    BOOST_MULTI_INDEX_CHECK_VALID_ITERATOR(position);
-    BOOST_MULTI_INDEX_CHECK_IS_OWNER(position,*this);
-    BOOST_MULTI_INDEX_CHECK_VALID_ITERATOR(i);
-    BOOST_MULTI_INDEX_CHECK_DEREFERENCEABLE_ITERATOR(i);
-    BOOST_MULTI_INDEX_CHECK_IS_OWNER(i,x);
-    BOOST_MULTI_INDEX_RND_INDEX_CHECK_INVARIANT;
-    if(x.end().get_node()==this->header()){ /* same container */
-      index_node_type* pn=position.get_node();
-      index_node_type* in=static_cast<index_node_type*>(i.get_node());
-      if(pn!=in)relocate(pn,in);
-      return std::pair<iterator,bool>(make_iterator(in),true);
-    }
-    else{
-      std::pair<final_node_type*,bool> p=
-        external_splice(
-          position,x,i,boost::is_copy_constructible<value_type>());
-      return std::pair<iterator,bool>(make_iterator(p.first),p.second);
-    }
-  }
-
-  template<typename Index>
-  BOOST_MULTI_INDEX_ENABLE_IF_MERGEABLE(
-    random_access_index,Index,pair_return_type)
-  splice(
-    iterator position,BOOST_RV_REF(Index) x,
-    BOOST_DEDUCED_TYPENAME Index::iterator i)
-  {
-    return splice(position,static_cast<Index&>(x),i);
-  }
-
-  template<typename Index>
-  BOOST_MULTI_INDEX_ENABLE_IF_MERGEABLE(random_access_index,Index,void)
-  splice(
-    iterator position,Index& x,
-    BOOST_DEDUCED_TYPENAME Index::iterator first,
-    BOOST_DEDUCED_TYPENAME Index::iterator last)
-  {
-    BOOST_MULTI_INDEX_CHECK_VALID_ITERATOR(position);
-    BOOST_MULTI_INDEX_CHECK_IS_OWNER(position,*this);
-    BOOST_MULTI_INDEX_CHECK_VALID_ITERATOR(first);
-    BOOST_MULTI_INDEX_CHECK_VALID_ITERATOR(last);
-    BOOST_MULTI_INDEX_CHECK_IS_OWNER(first,x);
-    BOOST_MULTI_INDEX_CHECK_IS_OWNER(last,x);
-    BOOST_MULTI_INDEX_CHECK_VALID_RANGE(first,last);
-    BOOST_MULTI_INDEX_RND_INDEX_CHECK_INVARIANT;
-    if(x.end().get_node()==this->header()){ /* same container */
-      BOOST_MULTI_INDEX_CHECK_OUTSIDE_RANGE(position,first,last);
-      internal_splice(position,first,last);
-    }
-    else{
-      external_splice(
-        position,x,first,last,boost::is_copy_constructible<value_type>());
-    }
-  }
-
-  template<typename Index>
-  BOOST_MULTI_INDEX_ENABLE_IF_MERGEABLE(random_access_index,Index,void)
-  splice(
-    iterator position,BOOST_RV_REF(Index) x,
-    BOOST_DEDUCED_TYPENAME Index::iterator first,
-    BOOST_DEDUCED_TYPENAME Index::iterator last)
-  {
-    splice(position,static_cast<Index&>(x),first,last);
-  }
-
-  void remove(value_param_type value)
-  {
-    BOOST_MULTI_INDEX_RND_INDEX_CHECK_INVARIANT;
-    difference_type n=
-      end()-make_iterator(
-        random_access_index_remove<index_node_type>(
-          ptrs,
-          ::boost::bind<bool>(
-            std::equal_to<value_type>(),::boost::arg<1>(),value)));
-    while(n--)pop_back();
-  }
-
-  template<typename Predicate>
-  void remove_if(Predicate pred)
-  {
-    BOOST_MULTI_INDEX_RND_INDEX_CHECK_INVARIANT;
-    difference_type n=
-      end()-make_iterator(
-        random_access_index_remove<index_node_type>(ptrs,pred));
-    while(n--)pop_back();
-  }
-
-  void unique()
-  {
-    BOOST_MULTI_INDEX_RND_INDEX_CHECK_INVARIANT;
-    difference_type n=
-      end()-make_iterator(
-        random_access_index_unique<index_node_type>(
-          ptrs,std::equal_to<value_type>()));
-    while(n--)pop_back();
-  }
-
-  template <class BinaryPredicate>
-  void unique(BinaryPredicate binary_pred)
-  {
-    BOOST_MULTI_INDEX_RND_INDEX_CHECK_INVARIANT;
-    difference_type n=
-      end()-make_iterator(
-        random_access_index_unique<index_node_type>(ptrs,binary_pred));
-    while(n--)pop_back();
-  }
-
-  void merge(random_access_index<SuperMeta,TagList>& x)
-  {
-    if(this!=&x){
-      BOOST_MULTI_INDEX_RND_INDEX_CHECK_INVARIANT;
-      size_type s=size();
-      splice(end(),x);
-      random_access_index_inplace_merge<index_node_type>(
-        get_allocator(),ptrs,ptrs.at(s),std::less<value_type>());
-    }
-  }
-
-  template <typename Compare>
-  void merge(random_access_index<SuperMeta,TagList>& x,Compare comp)
-  {
-    if(this!=&x){
-      BOOST_MULTI_INDEX_RND_INDEX_CHECK_INVARIANT;
-      size_type s=size();
-      splice(end(),x);
-      random_access_index_inplace_merge<index_node_type>(
-        get_allocator(),ptrs,ptrs.at(s),comp);
-    }
-  }
-
-  void sort()
-  {
-    BOOST_MULTI_INDEX_RND_INDEX_CHECK_INVARIANT;
-    random_access_index_sort<index_node_type>(
-      get_allocator(),ptrs,std::less<value_type>());
-  }
-
-  template <typename Compare>
-  void sort(Compare comp)
-  {
-    BOOST_MULTI_INDEX_RND_INDEX_CHECK_INVARIANT;
-    random_access_index_sort<index_node_type>(
-      get_allocator(),ptrs,comp);
-  }
-
-  void reverse()BOOST_NOEXCEPT
-  {
-    BOOST_MULTI_INDEX_RND_INDEX_CHECK_INVARIANT;
-    node_impl_type::reverse(ptrs.begin(),ptrs.end());
-  }
-
-  /* rearrange operations */
-
-  void relocate(iterator position,iterator i)
-  {
-    BOOST_MULTI_INDEX_CHECK_VALID_ITERATOR(position);
-    BOOST_MULTI_INDEX_CHECK_IS_OWNER(position,*this);
-    BOOST_MULTI_INDEX_CHECK_VALID_ITERATOR(i);
-    BOOST_MULTI_INDEX_CHECK_DEREFERENCEABLE_ITERATOR(i);
-    BOOST_MULTI_INDEX_CHECK_IS_OWNER(i,*this);
-    BOOST_MULTI_INDEX_RND_INDEX_CHECK_INVARIANT;
-    if(position!=i)relocate(position.get_node(),i.get_node());
-  }
-
-  void relocate(iterator position,iterator first,iterator last)
-  {
-    BOOST_MULTI_INDEX_CHECK_VALID_ITERATOR(position);
-    BOOST_MULTI_INDEX_CHECK_IS_OWNER(position,*this);
-    BOOST_MULTI_INDEX_CHECK_VALID_ITERATOR(first);
-    BOOST_MULTI_INDEX_CHECK_VALID_ITERATOR(last);
-    BOOST_MULTI_INDEX_CHECK_IS_OWNER(first,*this);
-    BOOST_MULTI_INDEX_CHECK_IS_OWNER(last,*this);
-    BOOST_MULTI_INDEX_CHECK_VALID_RANGE(first,last);
-    BOOST_MULTI_INDEX_CHECK_OUTSIDE_RANGE(position,first,last);
-    BOOST_MULTI_INDEX_RND_INDEX_CHECK_INVARIANT;
-    if(position!=last)relocate(
-      position.get_node(),first.get_node(),last.get_node());
-  }
-
-  template<typename InputIterator>
-  void rearrange(InputIterator first)
-  {
-    BOOST_MULTI_INDEX_RND_INDEX_CHECK_INVARIANT;
-    for(node_impl_ptr_pointer p0=ptrs.begin(),p0_end=ptrs.end();
-        p0!=p0_end;++first,++p0){
-      const value_type& v1=*first;
-      node_impl_ptr_pointer p1=node_from_value<index_node_type>(&v1)->up();
-
-      std::swap(*p0,*p1);
-      (*p0)->up()=p0;
-      (*p1)->up()=p1;
-    }
-  }
-    
-BOOST_MULTI_INDEX_PROTECTED_IF_MEMBER_TEMPLATE_FRIENDS:
-  random_access_index(
-    const ctor_args_list& args_list,const allocator_type& al):
-    super(args_list.get_tail(),al),
-    ptrs(al,header()->impl(),0)
-
-#if defined(BOOST_MULTI_INDEX_ENABLE_SAFE_MODE)
-    ,safe(*this)
-#endif
-    
-  {
-  }
-
-  random_access_index(const random_access_index<SuperMeta,TagList>& x):
-    super(x),
-    ptrs(x.get_allocator(),header()->impl(),x.size())
-
-#if defined(BOOST_MULTI_INDEX_ENABLE_SAFE_MODE)
-    ,safe(*this)
-#endif
-
-  {
-    /* The actual copying takes place in subsequent call to copy_().
-     */
-  }
-
-  random_access_index(
-    const random_access_index<SuperMeta,TagList>& x,do_not_copy_elements_tag):
-    super(x,do_not_copy_elements_tag()),
-    ptrs(x.get_allocator(),header()->impl(),0)
-
-#if defined(BOOST_MULTI_INDEX_ENABLE_SAFE_MODE)
-    ,safe(*this)
-#endif
-
-  {
-  }
-
-  ~random_access_index()
-  {
-    /* the container is guaranteed to be empty by now */
-  }
-
-#if defined(BOOST_MULTI_INDEX_ENABLE_SAFE_MODE)
-  iterator       make_iterator(index_node_type* node)
-    {return iterator(node,&safe);}
-  const_iterator make_iterator(index_node_type* node)const
-    {return const_iterator(node,const_cast<safe_container*>(&safe));}
-#else
-  iterator       make_iterator(index_node_type* node){return iterator(node);}
-  const_iterator make_iterator(index_node_type* node)const
-                   {return const_iterator(node);}
-#endif
-
-  void copy_(
-    const random_access_index<SuperMeta,TagList>& x,const copy_map_type& map)
-  {
-    for(node_impl_ptr_pointer begin_org=x.ptrs.begin(),
-                              begin_cpy=ptrs.begin(),
-                              end_org=x.ptrs.end();
-        begin_org!=end_org;++begin_org,++begin_cpy){
-      *begin_cpy=
-         static_cast<index_node_type*>(
-           map.find(
-             static_cast<final_node_type*>(
-               index_node_type::from_impl(*begin_org))))->impl();
-      (*begin_cpy)->up()=begin_cpy;
-    }
-
-    super::copy_(x,map);
-  }
-
-  template<typename Variant>
-  final_node_type* insert_(
-    value_param_type v,final_node_type*& x,Variant variant)
-  {
-    ptrs.room_for_one();
-    final_node_type* res=super::insert_(v,x,variant);
-    if(res==x)ptrs.push_back(static_cast<index_node_type*>(x)->impl());
-    return res;
-  }
-
-  template<typename Variant>
-  final_node_type* insert_(
-    value_param_type v,index_node_type* position,
-    final_node_type*& x,Variant variant)
-  {
-    ptrs.room_for_one();
-    final_node_type* res=super::insert_(v,position,x,variant);
-    if(res==x)ptrs.push_back(static_cast<index_node_type*>(x)->impl());
-    return res;
-  }
-
-  template<typename Dst>
-  void extract_(index_node_type* x,Dst dst)
-  {
-    ptrs.erase(x->impl());
-    super::extract_(x,dst.next());
-
-#if defined(BOOST_MULTI_INDEX_ENABLE_SAFE_MODE)
-    transfer_iterators(dst.get(),x);
-#endif
-  }
-
-  void delete_all_nodes_()
-  {
-    for(node_impl_ptr_pointer x=ptrs.begin(),x_end=ptrs.end();x!=x_end;++x){
-      this->final_delete_node_(
-        static_cast<final_node_type*>(index_node_type::from_impl(*x)));
-    }
-  }
-
-  void clear_()
-  {
-    super::clear_();
-    ptrs.clear();
-
-#if defined(BOOST_MULTI_INDEX_ENABLE_SAFE_MODE)
-    safe.detach_dereferenceable_iterators();
-#endif
-  }
-
-  template<typename BoolConstant>
-  void swap_(
-    random_access_index<SuperMeta,TagList>& x,BoolConstant swap_allocators)
-  {
-    ptrs.swap(x.ptrs,swap_allocators);
-
-#if defined(BOOST_MULTI_INDEX_ENABLE_SAFE_MODE)
-    safe.swap(x.safe);
-#endif
-
-    super::swap_(x,swap_allocators);
-  }
-
-  void swap_elements_(random_access_index<SuperMeta,TagList>& x)
-  {
-    ptrs.swap(x.ptrs);
-
-#if defined(BOOST_MULTI_INDEX_ENABLE_SAFE_MODE)
-    safe.swap(x.safe);
-#endif
-
-    super::swap_elements_(x);
-  }
-
-  template<typename Variant>
-  bool replace_(value_param_type v,index_node_type* x,Variant variant)
-  {
-    return super::replace_(v,x,variant);
-  }
-
-  bool modify_(index_node_type* x)
-  {
-    BOOST_TRY{
-      if(!super::modify_(x)){
-        ptrs.erase(x->impl());
-
-#if defined(BOOST_MULTI_INDEX_ENABLE_SAFE_MODE)
-        detach_iterators(x);
-#endif
-
-        return false;
-      }
-      else return true;
-    }
-    BOOST_CATCH(...){
-      ptrs.erase(x->impl());
-
-#if defined(BOOST_MULTI_INDEX_ENABLE_SAFE_MODE)
-      detach_iterators(x);
-#endif
-
-      BOOST_RETHROW;
-    }
-    BOOST_CATCH_END
-  }
-
-  bool modify_rollback_(index_node_type* x)
-  {
-    return super::modify_rollback_(x);
-  }
-
-  bool check_rollback_(index_node_type* x)const
-  {
-    return super::check_rollback_(x);
-  }
-
-#if !defined(BOOST_MULTI_INDEX_DISABLE_SERIALIZATION)
-  /* serialization */
-
-  template<typename Archive>
-  void save_(
-    Archive& ar,const unsigned int version,const index_saver_type& sm)const
-  {
-    sm.save(begin(),end(),ar,version);
-    super::save_(ar,version,sm);
-  }
-
-  template<typename Archive>
-  void load_(
-    Archive& ar,const unsigned int version,const index_loader_type& lm)
-  {
-    {
-      typedef random_access_index_loader<
-        index_node_type,allocator_type> loader;
-
-      loader ld(get_allocator(),ptrs);
-      lm.load(
-        ::boost::bind(
-          &loader::rearrange,&ld,::boost::arg<1>(),::boost::arg<2>()),
-        ar,version);
-    } /* exit scope so that ld frees its resources */
-    super::load_(ar,version,lm);
-  }
-#endif
-
-#if defined(BOOST_MULTI_INDEX_ENABLE_INVARIANT_CHECKING)
-  /* invariant stuff */
-
-  bool invariant_()const
-  {
-    if(size()>capacity())return false;
-    if(size()==0||begin()==end()){
-      if(size()!=0||begin()!=end())return false;
-    }
-    else{
-      size_type s=0;
-      for(const_iterator it=begin(),it_end=end();;++it,++s){
-        if(*(it.get_node()->up())!=it.get_node()->impl())return false;
-        if(it==it_end)break;
-      }
-      if(s!=size())return false;
-    }
-
-    return super::invariant_();
-  }
-
-  /* This forwarding function eases things for the boost::mem_fn construct
-   * in BOOST_MULTI_INDEX_RND_INDEX_CHECK_INVARIANT. Actually,
-   * final_check_invariant is already an inherited member function of index.
-   */
-  void check_invariant_()const{this->final_check_invariant_();}
-#endif
-
-private:
-  index_node_type* header()const{return this->final_header();}
-
-  static void relocate(index_node_type* position,index_node_type* x)
-  {
-    node_impl_type::relocate(position->up(),x->up());
-  }
-
-  static void relocate(
-    index_node_type* position,index_node_type* first,index_node_type* last)
-  {
-    node_impl_type::relocate(
-      position->up(),first->up(),last->up());
-  }
-
-#if defined(BOOST_MULTI_INDEX_ENABLE_SAFE_MODE)
-  void detach_iterators(index_node_type* x)
-  {
-    iterator it=make_iterator(x);
-    safe_mode::detach_equivalent_iterators(it);
-  }
-
-  template<typename Dst>
-  void transfer_iterators(Dst& dst,index_node_type* x)
-  {
-    iterator it=make_iterator(x);
-    safe_mode::transfer_equivalent_iterators(dst,it);
-  }
-#endif
-
-  template <class InputIterator>
-  void assign_iter(InputIterator first,InputIterator last,mpl::true_)
-  {
-    BOOST_MULTI_INDEX_RND_INDEX_CHECK_INVARIANT;
-    clear();
-    for(;first!=last;++first)this->final_insert_ref_(*first);
-  }
-
-  void assign_iter(size_type n,value_param_type value,mpl::false_)
-  {
-    BOOST_MULTI_INDEX_RND_INDEX_CHECK_INVARIANT;
-    clear();
-    for(size_type i=0;i<n;++i)push_back(value);
-  }
-
-  template<typename InputIterator>
-  void insert_iter(
-    iterator position,InputIterator first,InputIterator last,mpl::true_)
-  {
-    BOOST_MULTI_INDEX_RND_INDEX_CHECK_INVARIANT;
-    size_type s=0;
-    BOOST_TRY{
-      for(;first!=last;++first){
-        if(this->final_insert_ref_(*first).second)++s;
-      }
-    }
-    BOOST_CATCH(...){
-      relocate(position,end()-s,end());
-      BOOST_RETHROW;
-    }
-    BOOST_CATCH_END
-    relocate(position,end()-s,end());
-  }
-
-  void insert_iter(
-    iterator position,size_type n,value_param_type x,mpl::false_)
-  {
-    BOOST_MULTI_INDEX_CHECK_VALID_ITERATOR(position);
-    BOOST_MULTI_INDEX_CHECK_IS_OWNER(position,*this);
-    BOOST_MULTI_INDEX_RND_INDEX_CHECK_INVARIANT;
-    size_type  s=0;
-    BOOST_TRY{
-      while(n--){
-        if(push_back(x).second)++s;
-      }
-    }
-    BOOST_CATCH(...){
-      relocate(position,end()-s,end());
-      BOOST_RETHROW;
-    }
-    BOOST_CATCH_END
-    relocate(position,end()-s,end());
-  }
- 
-  template<BOOST_MULTI_INDEX_TEMPLATE_PARAM_PACK>
-  std::pair<iterator,bool> emplace_front_impl(
-    BOOST_MULTI_INDEX_FUNCTION_PARAM_PACK)
-  {
-    return emplace_impl(begin(),BOOST_MULTI_INDEX_FORWARD_PARAM_PACK);
-  }
-
-  template<BOOST_MULTI_INDEX_TEMPLATE_PARAM_PACK>
-  std::pair<iterator,bool> emplace_back_impl(
-    BOOST_MULTI_INDEX_FUNCTION_PARAM_PACK)
-  {
-    return emplace_impl(end(),BOOST_MULTI_INDEX_FORWARD_PARAM_PACK);
-  }
-
-  template<BOOST_MULTI_INDEX_TEMPLATE_PARAM_PACK>
-  std::pair<iterator,bool> emplace_impl(
-    iterator position,BOOST_MULTI_INDEX_FUNCTION_PARAM_PACK)
-  {
-    BOOST_MULTI_INDEX_CHECK_VALID_ITERATOR(position);
-    BOOST_MULTI_INDEX_CHECK_IS_OWNER(position,*this);
-    BOOST_MULTI_INDEX_RND_INDEX_CHECK_INVARIANT;
-    std::pair<final_node_type*,bool> p=
-      this->final_emplace_(BOOST_MULTI_INDEX_FORWARD_PARAM_PACK);
-    if(p.second&&position.get_node()!=header()){
-      relocate(position.get_node(),p.first);
-    }
-    return std::pair<iterator,bool>(make_iterator(p.first),p.second);
-  }
-
-  template<typename Index>
-  std::pair<final_node_type*,bool> external_splice(
-    iterator position,Index& x,BOOST_DEDUCED_TYPENAME Index::iterator i,
-    boost::true_type /* copy-constructible value */)
-  {
-    if(get_allocator()==x.get_allocator()){
-      return external_splice(position,x,i,boost::false_type());
-    }
-    else{
-      /* backwards compatibility with old, non-transfer-based splice */
-
-      std::pair<iterator,bool> p=insert(position,*i);
-      if(p.second)x.erase(i);
-      return std::pair<final_node_type*,bool>(
-        static_cast<final_node_type*>(p.first.get_node()),p.second);
-    }
-  }
-
-  template<typename Index>
-  std::pair<final_node_type*,bool> external_splice(
-    iterator position,Index& x,BOOST_DEDUCED_TYPENAME Index::iterator i,
-    boost::false_type /* copy-constructible value */)
-  {
-    BOOST_MULTI_INDEX_CHECK_EQUAL_ALLOCATORS(*this,x);
-    std::pair<final_node_type*,bool> p=this->final_transfer_(
-      x,static_cast<final_node_type*>(i.get_node()));
-    if(p.second&&position.get_node()!=header()){
-      relocate(position.get_node(),p.first);
-    }
-    return p;
-  }
-
-  template<typename Iterator>
-  void internal_splice(iterator position,Iterator first,Iterator last)
-  {
-    /* null out [first, last) positions in ptrs array */
-
-    for(Iterator it=first;it!=last;++it){ 
-      *(static_cast<index_node_type*>(it.get_node())->up())=0;
-    }
-
-    node_impl_ptr_pointer pp=node_impl_type::gather_nulls(
-      ptrs.begin(),ptrs.end(),
-      static_cast<index_node_type*>(position.get_node())->up());
-
-    /* relink [first, last) */
-
-    for(Iterator it=first;it!=last;++it,++pp){
-      *pp=static_cast<index_node_type*>(it.get_node());
-      (*pp)->up()=pp;
-    }
-  }
-
-  void internal_splice(iterator position,iterator first,iterator last)
-  {
-    index_node_type* pn=position.get_node();
-    index_node_type* fn=static_cast<index_node_type*>(first.get_node());
-    index_node_type* ln=static_cast<index_node_type*>(last.get_node());
-    if(pn!=ln)relocate(pn,fn,ln);
-  }
-
-  template<typename Index>
-  void external_splice(
-    iterator position,Index& x,
-    BOOST_DEDUCED_TYPENAME Index::iterator first,
-    BOOST_DEDUCED_TYPENAME Index::iterator last,
-    boost::true_type /* copy-constructible value */)
-  {
-    if(get_allocator()==x.get_allocator()){
-      external_splice(position,x,first,last,boost::false_type());
-    }
-    else{
-      /* backwards compatibility with old, non-transfer-based splice */
-
-      size_type n=size();
-      BOOST_TRY{
-        while(first!=last){
-          if(push_back(*first).second)first=x.erase(first);
-          else ++first;
-        }
-      }
-      BOOST_CATCH(...){
-        relocate(position,begin()+n,end());
-        BOOST_RETHROW;
-      }
-      BOOST_CATCH_END
-      relocate(position,begin()+n,end());
-    }
-  }
-
-  template<typename Index>
-  void external_splice(
-    iterator position,Index& x,
-    BOOST_DEDUCED_TYPENAME Index::iterator first,
-    BOOST_DEDUCED_TYPENAME Index::iterator last,
-    boost::false_type /* copy-constructible value */)
-  {
-    BOOST_MULTI_INDEX_CHECK_EQUAL_ALLOCATORS(*this,x);
-    size_type n=size();
-    BOOST_TRY{
-      this->final_transfer_range_(x,first,last);
-    }
-    BOOST_CATCH(...){
-      relocate(position,begin()+n,end());
-      BOOST_RETHROW;
-    }
-    BOOST_CATCH_END
-    relocate(position,begin()+n,end());
-  }
-
-  ptr_array      ptrs;
-
-#if defined(BOOST_MULTI_INDEX_ENABLE_SAFE_MODE)
-  safe_container safe;
-#endif
-
-#if defined(BOOST_MULTI_INDEX_ENABLE_INVARIANT_CHECKING)&&\
-    BOOST_WORKAROUND(__MWERKS__,<=0x3003)
-#pragma parse_mfunc_templ reset
-#endif
-};
-
-#if defined(BOOST_MSVC)
-#pragma warning(pop) /* C4355 */
-#endif
-
-/* comparison */
-
-template<
-  typename SuperMeta1,typename TagList1,
-  typename SuperMeta2,typename TagList2
->
-bool operator==(
-  const random_access_index<SuperMeta1,TagList1>& x,
-  const random_access_index<SuperMeta2,TagList2>& y)
-{
-  return x.size()==y.size()&&std::equal(x.begin(),x.end(),y.begin());
-}
-
-template<
-  typename SuperMeta1,typename TagList1,
-  typename SuperMeta2,typename TagList2
->
-bool operator<(
-  const random_access_index<SuperMeta1,TagList1>& x,
-  const random_access_index<SuperMeta2,TagList2>& y)
-{
-  return std::lexicographical_compare(x.begin(),x.end(),y.begin(),y.end());
-}
-
-template<
-  typename SuperMeta1,typename TagList1,
-  typename SuperMeta2,typename TagList2
->
-bool operator!=(
-  const random_access_index<SuperMeta1,TagList1>& x,
-  const random_access_index<SuperMeta2,TagList2>& y)
-{
-  return !(x==y);
-}
-
-template<
-  typename SuperMeta1,typename TagList1,
-  typename SuperMeta2,typename TagList2
->
-bool operator>(
-  const random_access_index<SuperMeta1,TagList1>& x,
-  const random_access_index<SuperMeta2,TagList2>& y)
-{
-  return y<x;
-}
-
-template<
-  typename SuperMeta1,typename TagList1,
-  typename SuperMeta2,typename TagList2
->
-bool operator>=(
-  const random_access_index<SuperMeta1,TagList1>& x,
-  const random_access_index<SuperMeta2,TagList2>& y)
-{
-  return !(x<y);
-}
-
-template<
-  typename SuperMeta1,typename TagList1,
-  typename SuperMeta2,typename TagList2
->
-bool operator<=(
-  const random_access_index<SuperMeta1,TagList1>& x,
-  const random_access_index<SuperMeta2,TagList2>& y)
-{
-  return !(x>y);
-}
-
-/*  specialized algorithms */
-
-template<typename SuperMeta,typename TagList>
-void swap(
-  random_access_index<SuperMeta,TagList>& x,
-  random_access_index<SuperMeta,TagList>& y)
-{
-  x.swap(y);
-}
-
-} /* namespace multi_index::detail */
-
-/* random access index specifier */
-
-template <typename TagList>
-struct random_access
-{
-  BOOST_STATIC_ASSERT(detail::is_tag<TagList>::value);
-
-  template<typename Super>
-  struct node_class
-  {
-    typedef detail::random_access_index_node<Super> type;
-  };
-
-  template<typename SuperMeta>
-  struct index_class
-  {
-    typedef detail::random_access_index<
-      SuperMeta,typename TagList::type>  type;
-  };
-};
-
-} /* namespace multi_index */
-
-} /* namespace boost */
-
-/* Boost.Foreach compatibility */
-
-namespace boost{
-namespace foreach{
-
-template<typename>
-struct is_noncopyable;
-
-template<typename SuperMeta,typename TagList>
-struct is_noncopyable<
-  boost::multi_index::detail::random_access_index<SuperMeta,TagList>
->:boost::mpl::true_{};
-
-}
-}
-
-#undef BOOST_MULTI_INDEX_RND_INDEX_CHECK_INVARIANT
-#undef BOOST_MULTI_INDEX_RND_INDEX_CHECK_INVARIANT_OF
-
-#endif
diff --git a/src/boost/multi_index/random_access_index_fwd.hpp b/src/boost/multi_index/random_access_index_fwd.hpp
deleted file mode 100644
index 2ea19295..00000000
--- a/src/boost/multi_index/random_access_index_fwd.hpp
+++ /dev/null
@@ -1,91 +0,0 @@
-/* Copyright 2003-2013 Joaquin M Lopez Munoz.
- * Distributed under the Boost 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/multi_index for library home page.
- */
-
-#ifndef BOOST_MULTI_INDEX_RANDOM_ACCESS_INDEX_FWD_HPP
-#define BOOST_MULTI_INDEX_RANDOM_ACCESS_INDEX_FWD_HPP
-
-#if defined(_MSC_VER)
-#pragma once
-#endif
-
-#include <boost/multi_index/tag.hpp>
-
-namespace boost{
-
-namespace multi_index{
-
-namespace detail{
-
-template<typename SuperMeta,typename TagList>
-class random_access_index;
-
-template<
-  typename SuperMeta1,typename TagList1,
-  typename SuperMeta2,typename TagList2
->
-bool operator==(
-  const random_access_index<SuperMeta1,TagList1>& x,
-  const random_access_index<SuperMeta2,TagList2>& y);
-
-template<
-  typename SuperMeta1,typename TagList1,
-  typename SuperMeta2,typename TagList2
->
-bool operator<(
-  const random_access_index<SuperMeta1,TagList1>& x,
-  const random_access_index<SuperMeta2,TagList2>& y);
-
-template<
-  typename SuperMeta1,typename TagList1,
-  typename SuperMeta2,typename TagList2
->
-bool operator!=(
-  const random_access_index<SuperMeta1,TagList1>& x,
-  const random_access_index<SuperMeta2,TagList2>& y);
-
-template<
-  typename SuperMeta1,typename TagList1,
-  typename SuperMeta2,typename TagList2
->
-bool operator>(
-  const random_access_index<SuperMeta1,TagList1>& x,
-  const random_access_index<SuperMeta2,TagList2>& y);
-
-template<
-  typename SuperMeta1,typename TagList1,
-  typename SuperMeta2,typename TagList2
->
-bool operator>=(
-  const random_access_index<SuperMeta1,TagList1>& x,
-  const random_access_index<SuperMeta2,TagList2>& y);
-
-template<
-  typename SuperMeta1,typename TagList1,
-  typename SuperMeta2,typename TagList2
->
-bool operator<=(
-  const random_access_index<SuperMeta1,TagList1>& x,
-  const random_access_index<SuperMeta2,TagList2>& y);
-
-template<typename SuperMeta,typename TagList>
-void swap(
-  random_access_index<SuperMeta,TagList>& x,
-  random_access_index<SuperMeta,TagList>& y);
-
-} /* namespace multi_index::detail */
-
-/* index specifiers */
-
-template <typename TagList=tag<> >
-struct random_access;
-
-} /* namespace multi_index */
-
-} /* namespace boost */
-
-#endif
diff --git a/src/boost/type.hpp b/src/boost/type.hpp
deleted file mode 100644
index ab81c916..00000000
--- a/src/boost/type.hpp
+++ /dev/null
@@ -1,18 +0,0 @@
-// (C) Copyright David Abrahams 2001.
-// Distributed under the Boost Software License, Version 1.0. (See
-// accompanying file LICENSE_1_0.txt or copy at
-// http://www.boost.org/LICENSE_1_0.txt)
-
-#ifndef BOOST_TYPE_DWA20010120_HPP
-# define BOOST_TYPE_DWA20010120_HPP
-
-namespace boost {
-
-  // Just a simple "type envelope". Useful in various contexts, mostly to work
-  // around some MSVC deficiencies.
-  template <class T>
-  struct type {};
-
-}
-
-#endif // BOOST_TYPE_DWA20010120_HPP
diff --git a/src/boost/type_traits/is_unsigned.hpp b/src/boost/type_traits/is_unsigned.hpp
deleted file mode 100644
index 38b91629..00000000
--- a/src/boost/type_traits/is_unsigned.hpp
+++ /dev/null
@@ -1,163 +0,0 @@
-
-//  (C) Copyright John Maddock 2005.  
-//  Use, modification and distribution are subject to the Boost 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/type_traits for most recent version including documentation.
-
-
-#ifndef BOOST_TT_IS_UNSIGNED_HPP_INCLUDED
-#define BOOST_TT_IS_UNSIGNED_HPP_INCLUDED
-
-#include <boost/type_traits/is_integral.hpp>
-#include <boost/type_traits/is_enum.hpp>
-#include <boost/type_traits/remove_cv.hpp>
-
-#include <climits>
-
-namespace boost {
-
-#if !defined( BOOST_CODEGEARC )
-
-#if !(defined(BOOST_MSVC) && BOOST_MSVC <= 1310) &&\
-    !(defined(__EDG_VERSION__) && __EDG_VERSION__ <= 238) &&\
-    !defined(BOOST_NO_INCLASS_MEMBER_INITIALIZATION)
-
-namespace detail{
-
-template <class T>
-struct is_unsigned_values
-{
-   //
-   // Note that we cannot use BOOST_STATIC_CONSTANT here, using enum's
-   // rather than "real" static constants simply doesn't work or give
-   // the correct answer.
-   //
-   typedef typename remove_cv<T>::type no_cv_t;
-   static const no_cv_t minus_one = (static_cast<no_cv_t>(-1));
-   static const no_cv_t zero = (static_cast<no_cv_t>(0));
-};
-
-template <class T>
-struct is_ununsigned_helper
-{
-   BOOST_STATIC_CONSTANT(bool, value = (::boost::detail::is_unsigned_values<T>::minus_one > ::boost::detail::is_unsigned_values<T>::zero));
-};
-
-template <bool integral_type>
-struct is_unsigned_select_helper
-{
-   template <class T>
-   struct rebind
-   {
-      typedef is_ununsigned_helper<T> type;
-   };
-};
-
-template <>
-struct is_unsigned_select_helper<false>
-{
-   template <class T>
-   struct rebind
-   {
-      typedef false_type type;
-   };
-};
-
-template <class T>
-struct is_unsigned
-{
-   typedef ::boost::detail::is_unsigned_select_helper< ::boost::is_integral<T>::value || ::boost::is_enum<T>::value > selector;
-   typedef typename selector::template rebind<T> binder;
-   typedef typename binder::type type;
-   BOOST_STATIC_CONSTANT(bool, value = type::value);
-};
-
-} // namespace detail
-
-template <class T> struct is_unsigned : public integral_constant<bool, boost::detail::is_unsigned<T>::value> {};
-
-#else
-
-template <class T> struct is_unsigned : public false_type{};
-
-#endif
-
-#else // defined( BOOST_CODEGEARC )
-template <class T> struct is_unsigned : public integral_constant<bool, __is_unsigned(T)> {};
-#endif
-
-template <> struct is_unsigned<unsigned char> : public true_type{};
-template <> struct is_unsigned<const unsigned char> : public true_type{};
-template <> struct is_unsigned<volatile unsigned char> : public true_type{};
-template <> struct is_unsigned<const volatile unsigned char> : public true_type{};
-template <> struct is_unsigned<unsigned short> : public true_type{};
-template <> struct is_unsigned<const unsigned short> : public true_type{};
-template <> struct is_unsigned<volatile unsigned short> : public true_type{};
-template <> struct is_unsigned<const volatile unsigned short> : public true_type{};
-template <> struct is_unsigned<unsigned int> : public true_type{};
-template <> struct is_unsigned<const unsigned int> : public true_type{};
-template <> struct is_unsigned<volatile unsigned int> : public true_type{};
-template <> struct is_unsigned<const volatile unsigned int> : public true_type{};
-template <> struct is_unsigned<unsigned long> : public true_type{};
-template <> struct is_unsigned<const unsigned long> : public true_type{};
-template <> struct is_unsigned<volatile unsigned long> : public true_type{};
-template <> struct is_unsigned<const volatile unsigned long> : public true_type{};
-
-template <> struct is_unsigned<signed char> : public false_type{};
-template <> struct is_unsigned<const signed char> : public false_type{};
-template <> struct is_unsigned<volatile signed char> : public false_type{};
-template <> struct is_unsigned<const volatile signed char> : public false_type{};
-template <> struct is_unsigned< short> : public false_type{};
-template <> struct is_unsigned<const  short> : public false_type{};
-template <> struct is_unsigned<volatile  short> : public false_type{};
-template <> struct is_unsigned<const volatile  short> : public false_type{};
-template <> struct is_unsigned< int> : public false_type{};
-template <> struct is_unsigned<const  int> : public false_type{};
-template <> struct is_unsigned<volatile  int> : public false_type{};
-template <> struct is_unsigned<const volatile  int> : public false_type{};
-template <> struct is_unsigned< long> : public false_type{};
-template <> struct is_unsigned<const  long> : public false_type{};
-template <> struct is_unsigned<volatile  long> : public false_type{};
-template <> struct is_unsigned<const volatile  long> : public false_type{};
-#ifdef BOOST_HAS_LONG_LONG
-template <> struct is_unsigned< ::boost::ulong_long_type> : public true_type{};
-template <> struct is_unsigned<const ::boost::ulong_long_type> : public true_type{};
-template <> struct is_unsigned<volatile ::boost::ulong_long_type> : public true_type{};
-template <> struct is_unsigned<const volatile ::boost::ulong_long_type> : public true_type{};
-
-template <> struct is_unsigned< ::boost::long_long_type> : public false_type{};
-template <> struct is_unsigned<const ::boost::long_long_type> : public false_type{};
-template <> struct is_unsigned<volatile ::boost::long_long_type> : public false_type{};
-template <> struct is_unsigned<const volatile ::boost::long_long_type> : public false_type{};
-#endif
-#if defined(CHAR_MIN) 
-#if CHAR_MIN == 0
-template <> struct is_unsigned<char> : public true_type{};
-template <> struct is_unsigned<const char> : public true_type{};
-template <> struct is_unsigned<volatile char> : public true_type{};
-template <> struct is_unsigned<const volatile char> : public true_type{};
-#else
-template <> struct is_unsigned<char> : public false_type{};
-template <> struct is_unsigned<const char> : public false_type{};
-template <> struct is_unsigned<volatile char> : public false_type{};
-template <> struct is_unsigned<const volatile char> : public false_type{};
-#endif
-#endif
-#if !defined(BOOST_NO_INTRINSIC_WCHAR_T) && defined(WCHAR_MIN)
-#if WCHAR_MIN == 0
-template <> struct is_unsigned<wchar_t> : public true_type{};
-template <> struct is_unsigned<const wchar_t> : public true_type{};
-template <> struct is_unsigned<volatile wchar_t> : public true_type{};
-template <> struct is_unsigned<const volatile wchar_t> : public true_type{};
-#else
-template <> struct is_unsigned<wchar_t> : public false_type{};
-template <> struct is_unsigned<const wchar_t> : public false_type{};
-template <> struct is_unsigned<volatile wchar_t> : public false_type{};
-template <> struct is_unsigned<const volatile wchar_t> : public false_type{};
-#endif
-#endif
-} // namespace boost
-
-#endif // BOOST_TT_IS_MEMBER_FUNCTION_POINTER_HPP_INCLUDED
diff --git a/src/boost/unordered/detail/fca.hpp b/src/boost/unordered/detail/fca.hpp
deleted file mode 100644
index 6461bc0f..00000000
--- a/src/boost/unordered/detail/fca.hpp
+++ /dev/null
@@ -1,878 +0,0 @@
-// Copyright (C) 2022-2023 Joaquin M Lopez Munoz.
-// Copyright (C) 2022 Christian Mazakas
-//
-// Distributed under the Boost Software License, Version 1.0. (See accompanying
-// file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
-
-#ifndef BOOST_UNORDERED_DETAIL_FCA_HPP
-#define BOOST_UNORDERED_DETAIL_FCA_HPP
-
-/*
-
-The general structure of the fast closed addressing implementation is that we
-use straight-forward separate chaining (i.e. each bucket contains its own linked
-list) and then improve iteration time by adding an array of "bucket groups".
-
-A bucket group is a constant-width view into a subsection of the buckets array,
-containing a bitmask that indicates which one of the buckets in the subsection
-contains a list of nodes. This allows the code to test N buckets for occupancy
-in a single operation. Additional speed can be found by inter-linking occupied
-bucket groups with one another in a doubly-linked list. To this end, large
-swathes of the bucket groups array no longer need to be iterated and have their
-bitmasks examined for occupancy.
-
-A bucket group iterator contains a pointer to a bucket group along with a
-pointer into the buckets array. The iterator's bucket pointer is guaranteed to
-point to a bucket within the bucket group's view of the array. To advance the
-iterator, we need to determine if we need to skip to the next bucket group or
-simply move to the next occupied bucket as denoted by the bitmask.
-
-To accomplish this, we perform something roughly equivalent to this:
-```
-bucket_iterator itb = ...
-bucket_pointer p = itb.p
-bucket_group_pointer pbg = itb.pbg
-
-offset = p - pbg->buckets
-// because we wish to see if the _next_ bit in the mask is occupied, we'll
-// generate a testing mask from the current offset + 1
-//
-testing_mask = reset_first_bits(offset + 1)
-n = ctz(pbg->bitmask & testing_mask)
-
-if (n < N) {
-  p = pbg->buckets + n
-} else {
-  pbg = pbg->next
-  p = pbg->buckets + ctz(pbg->bitmask)
-}
-```
-
-`reset_first_bits` yields an unsigned integral with the first n bits set to 0
-and then by counting the number of trailing zeroes when AND'd against the bucket
-group's bitmask, we can derive the offset into the buckets array. When the
-calculated offset is equal to N, we know we've reached the end of a bucket group
-and we can advance to the next one.
-
-This is a rough explanation for how iterator incrementation should work for a
-fixed width size of N as 3 for the bucket groups
-```
-N = 3
-p = buckets
-pbg->bitmask = 0b101
-pbg->buckets = buckets
-
-offset = p - pbg->buckets // => 0
-testing_mask = reset_first_bits(offset + 1) // reset_first_bits(1) => 0b110
-
-x = bitmask & testing_mask // => 0b101 & 0b110 => 0b100
-ctz(x) // ctz(0b100) => 2
-// 2 < 3
-=> p = pbg->buckets + 2
-
-// increment again...
-offset = p - pbg->buckets // => 2
-testing_mask = reset_first_bits(offset + 1) // reset_first_bits(3) => 0b000
-
-bitmask & testing_mask // 0b101 & 0b000 => 0b000
-ctz(0b000) => 3
-// 3 < 3 is false now
-pbg = pbg->next
-initial_offset = ctz(pbg->bitmask)
-p = pbg->buckets + initial_offset
-```
-
-For `size_` number of buckets, there are `1 + (size_ / N)` bucket groups where
-`N` is the width of a bucket group, determined at compile-time.
-
-We allocate space for `size_ + 1` buckets, using the last one as a dummy bucket
-which is kept permanently empty so it can act as a sentinel value in the
-implementation of `iterator end();`. We set the last bucket group to act as a
-sentinel.
-
-```
-num_groups = size_ / N + 1
-groups = allocate(num_groups)
-pbg = groups + (num_groups - 1)
-
-// not guaranteed to point to exactly N buckets
-pbg->buckets = buckets + N * (size_ / N)
-
-// this marks the true end of the bucket array
-buckets pbg->bitmask = set_bit(size_ % N)
-
-// links in on itself
-pbg->next = pbg->prev = pbg
-```
-
-To this end, we can devise a safe iteration scheme while also creating a useful
-sentinel to use as the end iterator.
-
-Otherwise, usage of the data structure is relatively straight-forward compared
-to normal separate chaining implementations.
-
-*/
-
-#include <boost/unordered/detail/prime_fmod.hpp>
-#include <boost/unordered/detail/serialize_tracked_address.hpp>
-#include <boost/unordered/detail/opt_storage.hpp>
-
-#include <boost/assert.hpp>
-#include <boost/core/allocator_access.hpp>
-#include <boost/core/bit.hpp>
-#include <boost/core/empty_value.hpp>
-#include <boost/core/invoke_swap.hpp>
-#include <boost/core/no_exceptions_support.hpp>
-#include <boost/core/serialization.hpp>
-#include <boost/cstdint.hpp>
-
-#include <boost/config.hpp>
-
-#include <iterator>
-
-namespace boost {
-  namespace unordered {
-    namespace detail {
-
-      template <class ValueType, class VoidPtr> struct node
-      {
-        typedef ValueType value_type;
-        typedef typename boost::pointer_traits<VoidPtr>::template rebind_to<
-          node>::type node_pointer;
-
-        node_pointer next;
-        opt_storage<value_type> buf;
-
-        node() noexcept : next(), buf() {}
-
-        value_type* value_ptr() noexcept
-        {
-          return buf.address();
-        }
-
-        value_type& value() noexcept
-        {
-          return *buf.address();
-        }
-      };
-
-      template <class Node, class VoidPtr> struct bucket
-      {
-        typedef typename boost::pointer_traits<VoidPtr>::template rebind_to<
-          Node>::type node_pointer;
-
-        typedef typename boost::pointer_traits<VoidPtr>::template rebind_to<
-          bucket>::type bucket_pointer;
-
-        node_pointer next;
-
-        bucket() noexcept : next() {}
-      };
-
-      template <class Bucket> struct bucket_group
-      {
-        typedef typename Bucket::bucket_pointer bucket_pointer;
-        typedef
-          typename boost::pointer_traits<bucket_pointer>::template rebind_to<
-            bucket_group>::type bucket_group_pointer;
-
-        BOOST_STATIC_CONSTANT(std::size_t, N = sizeof(std::size_t) * CHAR_BIT);
-
-        bucket_pointer buckets;
-        std::size_t bitmask;
-        bucket_group_pointer next, prev;
-
-        bucket_group() noexcept : buckets(), bitmask(0), next(), prev() {}
-        ~bucket_group() {}
-      };
-
-      inline std::size_t set_bit(std::size_t n) { return std::size_t(1) << n; }
-
-      inline std::size_t reset_bit(std::size_t n)
-      {
-        return ~(std::size_t(1) << n);
-      }
-
-      inline std::size_t reset_first_bits(std::size_t n) // n>0
-      {
-        return ~(~(std::size_t(0)) >> (sizeof(std::size_t) * 8 - n));
-      }
-
-      template <class Bucket> struct grouped_bucket_iterator
-      {
-      public:
-        typedef typename Bucket::bucket_pointer bucket_pointer;
-        typedef
-          typename boost::pointer_traits<bucket_pointer>::template rebind_to<
-            bucket_group<Bucket> >::type bucket_group_pointer;
-
-        typedef Bucket value_type;
-        typedef typename boost::pointer_traits<bucket_pointer>::difference_type
-          difference_type;
-        typedef Bucket& reference;
-        typedef Bucket* pointer;
-        typedef std::forward_iterator_tag iterator_category;
-
-      private:
-        bucket_pointer p;
-        bucket_group_pointer pbg;
-
-      public:
-        grouped_bucket_iterator() : p(), pbg() {}
-
-        reference operator*() const noexcept { return dereference(); }
-        pointer operator->() const noexcept { return boost::to_address(p); }
-
-        grouped_bucket_iterator& operator++() noexcept
-        {
-          increment();
-          return *this;
-        }
-
-        grouped_bucket_iterator operator++(int) noexcept
-        {
-          grouped_bucket_iterator old = *this;
-          increment();
-          return old;
-        }
-
-        bool operator==(grouped_bucket_iterator const& other) const noexcept
-        {
-          return equal(other);
-        }
-
-        bool operator!=(grouped_bucket_iterator const& other) const noexcept
-        {
-          return !equal(other);
-        }
-
-      private:
-        template <typename, typename, typename>
-        friend class grouped_bucket_array;
-
-        BOOST_STATIC_CONSTANT(std::size_t, N = bucket_group<Bucket>::N);
-
-        grouped_bucket_iterator(bucket_pointer p_, bucket_group_pointer pbg_)
-            : p(p_), pbg(pbg_)
-        {
-        }
-
-        Bucket& dereference() const noexcept { return *p; }
-
-        bool equal(const grouped_bucket_iterator& x) const noexcept
-        {
-          return p == x.p;
-        }
-
-        void increment() noexcept
-        {
-          std::size_t const offset = static_cast<std::size_t>(p - pbg->buckets);
-
-          std::size_t n = std::size_t(boost::core::countr_zero(
-            pbg->bitmask & reset_first_bits(offset + 1)));
-
-          if (n < N) {
-            p = pbg->buckets + static_cast<difference_type>(n);
-          } else {
-            pbg = pbg->next;
-
-            std::ptrdiff_t x = boost::core::countr_zero(pbg->bitmask);
-            p = pbg->buckets + x;
-          }
-        }
-
-        template <typename Archive>
-        friend void serialization_track(
-          Archive& ar, grouped_bucket_iterator const& x)
-        {
-          // requires: not at end() position
-          track_address(ar, x.p);
-          track_address(ar, x.pbg);
-        }
-
-        friend class boost::serialization::access;
-
-        template <typename Archive> void serialize(Archive& ar, unsigned int)
-        {
-          // requires: not at end() position
-          serialize_tracked_address(ar, p);
-          serialize_tracked_address(ar, pbg);
-        }
-      };
-
-      template <class Node> struct const_grouped_local_bucket_iterator;
-
-      template <class Node> struct grouped_local_bucket_iterator
-      {
-        typedef typename Node::node_pointer node_pointer;
-
-      public:
-        typedef typename Node::value_type value_type;
-        typedef value_type element_type;
-        typedef value_type* pointer;
-        typedef value_type& reference;
-        typedef std::ptrdiff_t difference_type;
-        typedef std::forward_iterator_tag iterator_category;
-
-        grouped_local_bucket_iterator() : p() {}
-
-        reference operator*() const noexcept { return dereference(); }
-
-        pointer operator->() const noexcept
-        {
-          return std::addressof(dereference());
-        }
-
-        grouped_local_bucket_iterator& operator++() noexcept
-        {
-          increment();
-          return *this;
-        }
-
-        grouped_local_bucket_iterator operator++(int) noexcept
-        {
-          grouped_local_bucket_iterator old = *this;
-          increment();
-          return old;
-        }
-
-        bool operator==(
-          grouped_local_bucket_iterator const& other) const noexcept
-        {
-          return equal(other);
-        }
-
-        bool operator!=(
-          grouped_local_bucket_iterator const& other) const noexcept
-        {
-          return !equal(other);
-        }
-
-      private:
-        template <typename, typename, typename>
-        friend class grouped_bucket_array;
-
-        template <class> friend struct const_grouped_local_bucket_iterator;
-
-        grouped_local_bucket_iterator(node_pointer p_) : p(p_) {}
-
-        value_type& dereference() const noexcept { return p->value(); }
-
-        bool equal(const grouped_local_bucket_iterator& x) const noexcept
-        {
-          return p == x.p;
-        }
-
-        void increment() noexcept { p = p->next; }
-
-        node_pointer p;
-      };
-
-      template <class Node> struct const_grouped_local_bucket_iterator
-      {
-        typedef typename Node::node_pointer node_pointer;
-
-      public:
-        typedef typename Node::value_type const value_type;
-        typedef value_type const element_type;
-        typedef value_type const* pointer;
-        typedef value_type const& reference;
-        typedef std::ptrdiff_t difference_type;
-        typedef std::forward_iterator_tag iterator_category;
-
-        const_grouped_local_bucket_iterator() : p() {}
-        const_grouped_local_bucket_iterator(
-          grouped_local_bucket_iterator<Node> it)
-            : p(it.p)
-        {
-        }
-
-        reference operator*() const noexcept { return dereference(); }
-
-        pointer operator->() const noexcept
-        {
-          return std::addressof(dereference());
-        }
-
-        const_grouped_local_bucket_iterator& operator++() noexcept
-        {
-          increment();
-          return *this;
-        }
-
-        const_grouped_local_bucket_iterator operator++(int) noexcept
-        {
-          const_grouped_local_bucket_iterator old = *this;
-          increment();
-          return old;
-        }
-
-        bool operator==(
-          const_grouped_local_bucket_iterator const& other) const noexcept
-        {
-          return equal(other);
-        }
-
-        bool operator!=(
-          const_grouped_local_bucket_iterator const& other) const noexcept
-        {
-          return !equal(other);
-        }
-
-      private:
-        template <typename, typename, typename>
-        friend class grouped_bucket_array;
-
-        const_grouped_local_bucket_iterator(node_pointer p_) : p(p_) {}
-
-        value_type& dereference() const noexcept { return p->value(); }
-
-        bool equal(const const_grouped_local_bucket_iterator& x) const noexcept
-        {
-          return p == x.p;
-        }
-
-        void increment() noexcept { p = p->next; }
-
-        node_pointer p;
-      };
-
-      template <class T> struct span
-      {
-        T* begin() const noexcept { return data; }
-        T* end() const noexcept { return data + size; }
-
-        T* data;
-        std::size_t size;
-
-        span(T* data_, std::size_t size_) : data(data_), size(size_) {}
-      };
-
-      template <class Bucket, class Allocator, class SizePolicy>
-      class grouped_bucket_array
-          : boost::empty_value<typename boost::allocator_rebind<Allocator,
-              node<typename boost::allocator_value_type<Allocator>::type,
-                typename boost::allocator_void_pointer<Allocator>::type> >::
-                type>
-      {
-        typedef typename boost::allocator_value_type<Allocator>::type
-          allocator_value_type;
-        typedef
-          typename boost::allocator_void_pointer<Allocator>::type void_pointer;
-        typedef typename boost::allocator_difference_type<Allocator>::type
-          difference_type;
-
-      public:
-        typedef typename boost::allocator_rebind<Allocator,
-          node<allocator_value_type, void_pointer> >::type node_allocator_type;
-
-        typedef node<allocator_value_type, void_pointer> node_type;
-        typedef typename boost::allocator_pointer<node_allocator_type>::type
-          node_pointer;
-        typedef SizePolicy size_policy;
-
-      private:
-        typedef typename boost::allocator_rebind<Allocator, Bucket>::type
-          bucket_allocator_type;
-        typedef typename boost::allocator_pointer<bucket_allocator_type>::type
-          bucket_pointer;
-        typedef boost::pointer_traits<bucket_pointer> bucket_pointer_traits;
-
-        typedef bucket_group<Bucket> group;
-        typedef typename boost::allocator_rebind<Allocator, group>::type
-          group_allocator_type;
-        typedef typename boost::allocator_pointer<group_allocator_type>::type
-          group_pointer;
-        typedef typename boost::pointer_traits<group_pointer>
-          group_pointer_traits;
-
-      public:
-        typedef Bucket value_type;
-        typedef Bucket bucket_type;
-        typedef std::size_t size_type;
-        typedef Allocator allocator_type;
-        typedef grouped_bucket_iterator<Bucket> iterator;
-        typedef grouped_local_bucket_iterator<node_type> local_iterator;
-        typedef const_grouped_local_bucket_iterator<node_type>
-          const_local_iterator;
-
-      private:
-        std::size_t size_index_, size_;
-        bucket_pointer buckets;
-        group_pointer groups;
-
-      public:
-        static std::size_t bucket_count_for(std::size_t num_buckets)
-        {
-          if (num_buckets == 0) {
-            return 0;
-          }
-          return size_policy::size(size_policy::size_index(num_buckets));
-        }
-
-        grouped_bucket_array()
-            : empty_value<node_allocator_type>(
-                empty_init_t(), node_allocator_type()),
-              size_index_(0), size_(0), buckets(), groups()
-        {
-        }
-
-        grouped_bucket_array(size_type n, const Allocator& al)
-            : empty_value<node_allocator_type>(empty_init_t(), al),
-              size_index_(0), size_(0), buckets(), groups()
-        {
-          if (n == 0) {
-            return;
-          }
-
-          size_index_ = size_policy::size_index(n);
-          size_ = size_policy::size(size_index_);
-
-          bucket_allocator_type bucket_alloc = this->get_bucket_allocator();
-          group_allocator_type group_alloc = this->get_group_allocator();
-
-          size_type const num_buckets = buckets_len();
-          size_type const num_groups = groups_len();
-
-          buckets = boost::allocator_allocate(bucket_alloc, num_buckets);
-          BOOST_TRY
-          {
-            groups = boost::allocator_allocate(group_alloc, num_groups);
-
-            bucket_type* pb = boost::to_address(buckets);
-            for (size_type i = 0; i < num_buckets; ++i) {
-              new (pb + i) bucket_type();
-            }
-
-            group* pg = boost::to_address(groups);
-            for (size_type i = 0; i < num_groups; ++i) {
-              new (pg + i) group();
-            }
-          }
-          BOOST_CATCH(...)
-          {
-            boost::allocator_deallocate(bucket_alloc, buckets, num_buckets);
-            BOOST_RETHROW
-          }
-          BOOST_CATCH_END
-
-          size_type const N = group::N;
-          group_pointer pbg =
-            groups + static_cast<difference_type>(num_groups - 1);
-
-          pbg->buckets =
-            buckets + static_cast<difference_type>(N * (size_ / N));
-          pbg->bitmask = set_bit(size_ % N);
-          pbg->next = pbg->prev = pbg;
-        }
-
-        ~grouped_bucket_array() { this->deallocate(); }
-
-        grouped_bucket_array(grouped_bucket_array const&) = delete;
-        grouped_bucket_array& operator=(grouped_bucket_array const&) = delete;
-
-        grouped_bucket_array(grouped_bucket_array&& other) noexcept
-            : empty_value<node_allocator_type>(
-                empty_init_t(), other.get_node_allocator()),
-              size_index_(other.size_index_),
-              size_(other.size_),
-              buckets(other.buckets),
-              groups(other.groups)
-        {
-          other.size_ = 0;
-          other.size_index_ = 0;
-          other.buckets = bucket_pointer();
-          other.groups = group_pointer();
-        }
-
-        grouped_bucket_array& operator=(grouped_bucket_array&& other) noexcept
-        {
-          BOOST_ASSERT(
-            this->get_node_allocator() == other.get_node_allocator());
-
-          if (this == std::addressof(other)) {
-            return *this;
-          }
-
-          this->deallocate();
-          size_index_ = other.size_index_;
-          size_ = other.size_;
-
-          buckets = other.buckets;
-          groups = other.groups;
-
-          other.size_index_ = 0;
-          other.size_ = 0;
-          other.buckets = bucket_pointer();
-          other.groups = group_pointer();
-
-          return *this;
-        }
-
-#if defined(BOOST_MSVC)
-#pragma warning(push)
-#pragma warning(disable : 4100) // unreferenced formal parameter (dtor calls)
-#endif
-
-        void deallocate() noexcept
-        {
-          if (buckets) {
-            size_type const num_buckets = buckets_len();
-            bucket_type* pb = boost::to_address(buckets);
-            (void)pb; // VS complains when dtor is trivial
-
-            for (size_type i = 0; i < num_buckets; ++i) {
-              (pb + i)->~bucket_type();
-            }
-
-            bucket_allocator_type bucket_alloc = this->get_bucket_allocator();
-            boost::allocator_deallocate(bucket_alloc, buckets, num_buckets);
-
-            buckets = bucket_pointer();
-          }
-
-          if (groups) {
-            size_type const num_groups = groups_len();
-            group* pg = boost::to_address(groups);
-            (void)pg; // VS complains when dtor is trivial
-
-            for (size_type i = 0; i < num_groups; ++i) {
-              (pg + i)->~group();
-            }
-
-            group_allocator_type group_alloc = this->get_group_allocator();
-            boost::allocator_deallocate(group_alloc, groups, num_groups);
-
-            groups = group_pointer();
-          }
-        }
-
-#if defined(BOOST_MSVC)
-#pragma warning(pop)
-#endif
-
-        void swap(grouped_bucket_array& other)
-        {
-          std::swap(size_index_, other.size_index_);
-          std::swap(size_, other.size_);
-          std::swap(buckets, other.buckets);
-          std::swap(groups, other.groups);
-
-          bool b = boost::allocator_propagate_on_container_swap<
-            allocator_type>::type::value;
-          if (b) {
-            boost::core::invoke_swap(
-              get_node_allocator(), other.get_node_allocator());
-          }
-        }
-
-        node_allocator_type const& get_node_allocator() const
-        {
-          return empty_value<node_allocator_type>::get();
-        }
-
-        node_allocator_type& get_node_allocator()
-        {
-          return empty_value<node_allocator_type>::get();
-        }
-
-        bucket_allocator_type get_bucket_allocator() const
-        {
-          return this->get_node_allocator();
-        }
-
-        group_allocator_type get_group_allocator() const
-        {
-          return this->get_node_allocator();
-        }
-
-        size_type buckets_len() const noexcept { return size_ + 1; }
-
-        size_type groups_len() const noexcept { return size_ / group::N + 1; }
-
-        void reset_allocator(Allocator const& allocator_)
-        {
-          this->get_node_allocator() = node_allocator_type(allocator_);
-        }
-
-        size_type bucket_count() const { return size_; }
-
-        iterator begin() const { return size_ == 0 ? end() : ++at(size_); }
-
-        iterator end() const
-        {
-          // micro optimization: no need to return the bucket group
-          // as end() is not incrementable
-          iterator pbg;
-          pbg.p =
-            buckets + static_cast<difference_type>(this->buckets_len() - 1);
-          return pbg;
-        }
-
-        local_iterator begin(size_type n) const
-        {
-          if (size_ == 0) {
-            return this->end(n);
-          }
-
-          return local_iterator(
-            (buckets + static_cast<difference_type>(n))->next);
-        }
-
-        local_iterator end(size_type) const { return local_iterator(); }
-
-        size_type capacity() const noexcept { return size_; }
-
-        iterator at(size_type n) const
-        {
-          if (size_ > 0) {
-            std::size_t const N = group::N;
-
-            iterator pbg(buckets + static_cast<difference_type>(n),
-              groups + static_cast<difference_type>(n / N));
-
-            return pbg;
-          } else {
-            return this->end();
-          }
-        }
-
-        span<Bucket> raw()
-        {
-          BOOST_ASSERT(size_ == 0 || size_ < this->buckets_len());
-          return span<Bucket>(boost::to_address(buckets), size_);
-        }
-
-        size_type position(std::size_t hash) const
-        {
-          return size_policy::position(hash, size_index_);
-        }
-
-        void clear()
-        {
-          this->deallocate();
-          size_index_ = 0;
-          size_ = 0;
-        }
-
-        void append_bucket_group(iterator itb) noexcept
-        {
-          std::size_t const N = group::N;
-
-          bool const is_empty_bucket = (!itb->next);
-          if (is_empty_bucket) {
-            bucket_pointer pb = itb.p;
-            group_pointer pbg = itb.pbg;
-
-            std::size_t n =
-              static_cast<std::size_t>(boost::to_address(pb) - &buckets[0]);
-
-            bool const is_empty_group = (!pbg->bitmask);
-            if (is_empty_group) {
-              size_type const num_groups = this->groups_len();
-              group_pointer last_group =
-                groups + static_cast<difference_type>(num_groups - 1);
-
-              pbg->buckets =
-                buckets + static_cast<difference_type>(N * (n / N));
-              pbg->next = last_group->next;
-              pbg->next->prev = pbg;
-              pbg->prev = last_group;
-              pbg->prev->next = pbg;
-            }
-
-            pbg->bitmask |= set_bit(n % N);
-          }
-        }
-
-        void insert_node(iterator itb, node_pointer p) noexcept
-        {
-          this->append_bucket_group(itb);
-
-          p->next = itb->next;
-          itb->next = p;
-        }
-
-        void insert_node_hint(
-          iterator itb, node_pointer p, node_pointer hint) noexcept
-        {
-          this->append_bucket_group(itb);
-
-          if (hint) {
-            p->next = hint->next;
-            hint->next = p;
-          } else {
-            p->next = itb->next;
-            itb->next = p;
-          }
-        }
-
-        void extract_node(iterator itb, node_pointer p) noexcept
-        {
-          node_pointer* pp = std::addressof(itb->next);
-          while ((*pp) != p)
-            pp = std::addressof((*pp)->next);
-          *pp = p->next;
-          if (!itb->next)
-            unlink_bucket(itb);
-        }
-
-        void extract_node_after(iterator itb, node_pointer* pp) noexcept
-        {
-          *pp = (*pp)->next;
-          if (!itb->next)
-            unlink_bucket(itb);
-        }
-
-        void unlink_empty_buckets() noexcept
-        {
-          std::size_t const N = group::N;
-
-          group_pointer pbg = groups,
-                        last = groups + static_cast<difference_type>(
-                                          this->groups_len() - 1);
-
-          for (; pbg != last; ++pbg) {
-            if (!pbg->buckets) {
-              continue;
-            }
-
-            for (std::size_t n = 0; n < N; ++n) {
-              bucket_pointer bs = pbg->buckets;
-              bucket_type& b = bs[static_cast<std::ptrdiff_t>(n)];
-              if (!b.next)
-                pbg->bitmask &= reset_bit(n);
-            }
-            if (!pbg->bitmask && pbg->next)
-              unlink_group(pbg);
-          }
-
-          // do not check end bucket
-          for (std::size_t n = 0; n < size_ % N; ++n) {
-            if (!pbg->buckets[static_cast<std::ptrdiff_t>(n)].next)
-              pbg->bitmask &= reset_bit(n);
-          }
-        }
-
-        void unlink_bucket(iterator itb)
-        {
-          typename iterator::bucket_pointer p = itb.p;
-          typename iterator::bucket_group_pointer pbg = itb.pbg;
-          if (!(pbg->bitmask &=
-                reset_bit(static_cast<std::size_t>(p - pbg->buckets))))
-            unlink_group(pbg);
-        }
-
-      private:
-        void unlink_group(group_pointer pbg)
-        {
-          pbg->next->prev = pbg->prev;
-          pbg->prev->next = pbg->next;
-          pbg->prev = pbg->next = group_pointer();
-        }
-      };
-    } // namespace detail
-  } // namespace unordered
-} // namespace boost
-
-#endif // BOOST_UNORDERED_DETAIL_FCA_HPP
diff --git a/src/boost/unordered/detail/implementation.hpp b/src/boost/unordered/detail/implementation.hpp
deleted file mode 100644
index 858bafd8..00000000
--- a/src/boost/unordered/detail/implementation.hpp
+++ /dev/null
@@ -1,2891 +0,0 @@
-// Copyright (C) 2003-2004 Jeremy B. Maitin-Shepard.
-// Copyright (C) 2005-2016 Daniel James
-// Copyright (C) 2022-2023 Joaquin M Lopez Munoz.
-// Copyright (C) 2022-2023 Christian Mazakas
-//
-// Distributed under the Boost Software License, Version 1.0. (See accompanying
-// file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
-
-#ifndef BOOST_UNORDERED_DETAIL_IMPLEMENTATION_HPP
-#define BOOST_UNORDERED_DETAIL_IMPLEMENTATION_HPP
-
-#include <boost/config.hpp>
-#if defined(BOOST_HAS_PRAGMA_ONCE)
-#pragma once
-#endif
-
-#include <boost/unordered/detail/fca.hpp>
-#include <boost/unordered/detail/opt_storage.hpp>
-#include <boost/unordered/detail/serialize_tracked_address.hpp>
-#include <boost/unordered/detail/static_assert.hpp>
-#include <boost/unordered/detail/type_traits.hpp>
-
-#include <boost/assert.hpp>
-#include <boost/core/allocator_traits.hpp>
-#include <boost/core/bit.hpp>
-#include <boost/core/invoke_swap.hpp>
-#include <boost/core/no_exceptions_support.hpp>
-#include <boost/core/pointer_traits.hpp>
-#include <boost/core/serialization.hpp>
-#include <boost/mp11/algorithm.hpp>
-#include <boost/mp11/list.hpp>
-#include <boost/throw_exception.hpp>
-
-#include <algorithm>
-#include <cmath>
-#include <iterator>
-#include <limits>
-#include <stdexcept>
-#include <type_traits>
-#include <utility>
-
-namespace boost {
-  namespace tuples {
-    struct null_type;
-  }
-} // namespace boost
-
-// BOOST_UNORDERED_SUPPRESS_DEPRECATED
-//
-// Define to stop deprecation attributes
-
-#if defined(BOOST_UNORDERED_SUPPRESS_DEPRECATED)
-#define BOOST_UNORDERED_DEPRECATED(msg)
-#endif
-
-// BOOST_UNORDERED_DEPRECATED
-//
-// Wrapper around various depreaction attributes.
-
-#if defined(__has_cpp_attribute) &&                                            \
-  (!defined(__cplusplus) || __cplusplus >= 201402)
-#if __has_cpp_attribute(deprecated) && !defined(BOOST_UNORDERED_DEPRECATED)
-#define BOOST_UNORDERED_DEPRECATED(msg) [[deprecated(msg)]]
-#endif
-#endif
-
-#if !defined(BOOST_UNORDERED_DEPRECATED)
-#if defined(__GNUC__) && __GNUC__ >= 4
-#define BOOST_UNORDERED_DEPRECATED(msg) __attribute__((deprecated))
-#elif defined(_MSC_VER) && _MSC_VER >= 1400
-#define BOOST_UNORDERED_DEPRECATED(msg) __declspec(deprecated(msg))
-#elif defined(_MSC_VER) && _MSC_VER >= 1310
-#define BOOST_UNORDERED_DEPRECATED(msg) __declspec(deprecated)
-#else
-#define BOOST_UNORDERED_DEPRECATED(msg)
-#endif
-#endif
-
-namespace boost {
-  namespace unordered {
-
-    using std::piecewise_construct;
-    using std::piecewise_construct_t;
-
-    namespace detail {
-
-      template <typename Types> struct table;
-
-      static const float minimum_max_load_factor = 1e-3f;
-      static const std::size_t default_bucket_count = 0;
-
-      struct move_tag
-      {
-      };
-
-      struct empty_emplace
-      {
-      };
-
-      struct no_key
-      {
-        no_key() {}
-        template <class T> no_key(T const&) {}
-      };
-
-      namespace func {
-        template <class T> inline void ignore_unused_variable_warning(T const&)
-        {
-        }
-      } // namespace func
-
-      //////////////////////////////////////////////////////////////////////////
-      // iterator SFINAE
-
-      template <typename I>
-      struct is_forward : std::is_base_of<std::forward_iterator_tag,
-                            typename std::iterator_traits<I>::iterator_category>
-      {
-      };
-
-      template <typename I, typename ReturnType>
-      struct enable_if_forward
-          : std::enable_if<boost::unordered::detail::is_forward<I>::value,
-              ReturnType>
-      {
-      };
-
-      template <typename I, typename ReturnType>
-      struct disable_if_forward
-          : std::enable_if<!boost::unordered::detail::is_forward<I>::value,
-              ReturnType>
-      {
-      };
-    } // namespace detail
-  } // namespace unordered
-} // namespace boost
-
-namespace boost {
-  namespace unordered {
-    namespace detail {
-      //////////////////////////////////////////////////////////////////////////
-      // insert_size/initial_size
-
-      template <class I>
-      inline typename boost::unordered::detail::enable_if_forward<I,
-        std::size_t>::type
-      insert_size(I i, I j)
-      {
-        return static_cast<std::size_t>(std::distance(i, j));
-      }
-
-      template <class I>
-      inline typename boost::unordered::detail::disable_if_forward<I,
-        std::size_t>::type
-      insert_size(I, I)
-      {
-        return 1;
-      }
-
-      template <class I>
-      inline std::size_t initial_size(I i, I j,
-        std::size_t num_buckets =
-          boost::unordered::detail::default_bucket_count)
-      {
-        return (std::max)(
-          boost::unordered::detail::insert_size(i, j), num_buckets);
-      }
-
-      //////////////////////////////////////////////////////////////////////////
-      // compressed
-
-      template <typename T, int Index>
-      struct compressed_base : boost::empty_value<T>
-      {
-        compressed_base(T const& x) : empty_value<T>(boost::empty_init_t(), x)
-        {
-        }
-        compressed_base(T& x, move_tag)
-            : empty_value<T>(boost::empty_init_t(), std::move(x))
-        {
-        }
-
-        T& get() { return empty_value<T>::get(); }
-        T const& get() const { return empty_value<T>::get(); }
-      };
-
-      template <typename T, int Index>
-      struct generate_base : boost::unordered::detail::compressed_base<T, Index>
-      {
-        typedef compressed_base<T, Index> type;
-
-        generate_base() : type() {}
-      };
-
-      template <typename T1, typename T2>
-      struct compressed
-          : private boost::unordered::detail::generate_base<T1, 1>::type,
-            private boost::unordered::detail::generate_base<T2, 2>::type
-      {
-        typedef typename generate_base<T1, 1>::type base1;
-        typedef typename generate_base<T2, 2>::type base2;
-
-        typedef T1 first_type;
-        typedef T2 second_type;
-
-        first_type& first() { return static_cast<base1*>(this)->get(); }
-
-        first_type const& first() const
-        {
-          return static_cast<base1 const*>(this)->get();
-        }
-
-        second_type& second() { return static_cast<base2*>(this)->get(); }
-
-        second_type const& second() const
-        {
-          return static_cast<base2 const*>(this)->get();
-        }
-
-        template <typename First, typename Second>
-        compressed(First const& x1, Second const& x2) : base1(x1), base2(x2)
-        {
-        }
-
-        compressed(compressed const& x) : base1(x.first()), base2(x.second()) {}
-
-        compressed(compressed& x, move_tag m)
-            : base1(x.first(), m), base2(x.second(), m)
-        {
-        }
-
-        void assign(compressed const& x)
-        {
-          first() = x.first();
-          second() = x.second();
-        }
-
-        void move_assign(compressed& x)
-        {
-          first() = std::move(x.first());
-          second() = std::move(x.second());
-        }
-
-        void swap(compressed& x)
-        {
-          boost::core::invoke_swap(first(), x.first());
-          boost::core::invoke_swap(second(), x.second());
-        }
-
-      private:
-        // Prevent assignment just to make use of assign or
-        // move_assign explicit.
-        compressed& operator=(compressed const&);
-      };
-
-      //////////////////////////////////////////////////////////////////////////
-      // pair_traits
-      //
-      // Used to get the types from a pair without instantiating it.
-
-      template <typename Pair> struct pair_traits
-      {
-        typedef typename Pair::first_type first_type;
-        typedef typename Pair::second_type second_type;
-      };
-
-      template <typename T1, typename T2> struct pair_traits<std::pair<T1, T2> >
-      {
-        typedef T1 first_type;
-        typedef T2 second_type;
-      };
-
-#if defined(BOOST_MSVC)
-#pragma warning(push)
-#pragma warning(disable : 4512) // assignment operator could not be generated.
-#pragma warning(disable : 4345) // behavior change: an object of POD type
-// constructed with an initializer of the form ()
-// will be default-initialized.
-#endif
-
-      //////////////////////////////////////////////////////////////////////////
-      // Bits and pieces for implementing traits
-
-      template <typename T> typename std::add_lvalue_reference<T>::type make();
-      struct choice2
-      {
-        typedef char (&type)[2];
-      };
-      struct choice1 : choice2
-      {
-        typedef char (&type)[1];
-      };
-      choice1 choose();
-
-      typedef choice1::type yes_type;
-      typedef choice2::type no_type;
-
-      struct private_type
-      {
-        private_type const& operator,(int) const;
-      };
-
-      template <typename T> no_type is_private_type(T const&);
-      yes_type is_private_type(private_type const&);
-
-      struct convert_from_anything
-      {
-        template <typename T> convert_from_anything(T const&);
-      };
-    } // namespace detail
-  } // namespace unordered
-} // namespace boost
-
-////////////////////////////////////////////////////////////////////////////////
-//
-// Some utilities for implementing allocator_traits, but useful elsewhere so
-// they're always defined.
-
-namespace boost {
-  namespace unordered {
-    namespace detail {
-
-      ////////////////////////////////////////////////////////////////////////////
-      // Explicitly call a destructor
-
-#if defined(BOOST_MSVC)
-#pragma warning(push)
-#pragma warning(disable : 4100) // unreferenced formal parameter
-#endif
-
-      namespace func {
-        template <class T> inline void destroy(T* x) { x->~T(); }
-      } // namespace func
-
-#if defined(BOOST_MSVC)
-#pragma warning(pop)
-#endif
-
-      //////////////////////////////////////////////////////////////////////////
-      // value_base
-      //
-      // Space used to store values.
-
-      template <typename ValueType> struct value_base
-      {
-        typedef ValueType value_type;
-
-        opt_storage<value_type> data_;
-
-        value_base() : data_() {}
-
-        void* address() { return this; }
-
-        value_type& value() { return *(ValueType*)this; }
-
-        value_type const& value() const { return *(ValueType const*)this; }
-
-        value_type* value_ptr() { return (ValueType*)this; }
-
-        value_type const* value_ptr() const { return (ValueType const*)this; }
-
-      private:
-        value_base& operator=(value_base const&);
-      };
-
-      //////////////////////////////////////////////////////////////////////////
-      // optional
-      // TODO: Use std::optional when available.
-
-      template <typename T> class optional
-      {
-        boost::unordered::detail::value_base<T> value_;
-        bool has_value_;
-
-        void destroy()
-        {
-          if (has_value_) {
-            boost::unordered::detail::func::destroy(value_.value_ptr());
-            has_value_ = false;
-          }
-        }
-
-        void move(optional<T>& x)
-        {
-          BOOST_ASSERT(!has_value_ && x.has_value_);
-          new (value_.value_ptr()) T(std::move(x.value_.value()));
-          boost::unordered::detail::func::destroy(x.value_.value_ptr());
-          has_value_ = true;
-          x.has_value_ = false;
-        }
-
-      public:
-        optional() noexcept : has_value_(false) {}
-
-        optional(optional const&) = delete;
-        optional& operator=(optional const&) = delete;
-
-        optional(optional<T>&& x) : has_value_(false)
-        {
-          if (x.has_value_) {
-            move(x);
-          }
-        }
-
-        explicit optional(T const& x) : has_value_(true)
-        {
-          new (value_.value_ptr()) T(x);
-        }
-
-        optional& operator=(optional<T>&& x)
-        {
-          destroy();
-          if (x.has_value_) {
-            move(x);
-          }
-          return *this;
-        }
-
-        ~optional() { destroy(); }
-
-        bool has_value() const { return has_value_; }
-        T& operator*() { return value_.value(); }
-        T const& operator*() const { return value_.value(); }
-        T* operator->() { return value_.value_ptr(); }
-        T const* operator->() const { return value_.value_ptr(); }
-
-        bool operator==(optional<T> const& x) const
-        {
-          return has_value_ ? x.has_value_ && value_.value() == x.value_.value()
-                            : !x.has_value_;
-        }
-
-        bool operator!=(optional<T> const& x) const { return !((*this) == x); }
-
-        void swap(optional<T>& x)
-        {
-          if (has_value_ != x.has_value_) {
-            if (has_value_) {
-              x.move(*this);
-            } else {
-              move(x);
-            }
-          } else if (has_value_) {
-            boost::core::invoke_swap(value_.value(), x.value_.value());
-          }
-        }
-
-        friend void swap(optional<T>& x, optional<T>& y) { x.swap(y); }
-      };
-    } // namespace detail
-  } // namespace unordered
-} // namespace boost
-
-////////////////////////////////////////////////////////////////////////////////
-//
-// Allocator traits
-//
-
-namespace boost {
-  namespace unordered {
-    namespace detail {
-
-      template <typename Alloc>
-      struct allocator_traits : boost::allocator_traits<Alloc>
-      {
-      };
-
-      template <typename Alloc, typename T>
-      struct rebind_wrap : boost::allocator_rebind<Alloc, T>
-      {
-      };
-    } // namespace detail
-  } // namespace unordered
-} // namespace boost
-
-namespace boost {
-  namespace unordered {
-    namespace detail {
-      namespace func {
-        ////////////////////////////////////////////////////////////////////////
-        // Trait to check for piecewise construction.
-
-        template <typename A0> struct use_piecewise
-        {
-          static choice1::type test(choice1, std::piecewise_construct_t);
-
-          static choice2::type test(choice2, ...);
-
-          enum
-          {
-            value = sizeof(choice1::type) ==
-                    sizeof(test(choose(), boost::unordered::detail::make<A0>()))
-          };
-        };
-
-        ////////////////////////////////////////////////////////////////////////
-        // Construct from variadic parameters
-
-        template <typename Alloc, typename T, typename... Args>
-        inline void construct_from_args(
-          Alloc& alloc, T* address, Args&&... args)
-        {
-          boost::allocator_construct(
-            alloc, address, std::forward<Args>(args)...);
-        }
-
-        // For backwards compatibility, implement a special case for
-        // piecewise_construct with boost::tuple
-
-        template <typename A0> struct detect_std_tuple
-        {
-          template <class... Args>
-          static choice1::type test(choice1, std::tuple<Args...> const&);
-
-          static choice2::type test(choice2, ...);
-
-          enum
-          {
-            value = sizeof(choice1::type) ==
-                    sizeof(test(choose(), boost::unordered::detail::make<A0>()))
-          };
-        };
-
-        // Special case for piecewise_construct
-
-        template <template <class...> class Tuple, class... Args,
-          std::size_t... Is, class... TupleArgs>
-        std::tuple<typename std::add_lvalue_reference<Args>::type...>
-        to_std_tuple_impl(boost::mp11::mp_list<Args...>,
-          Tuple<TupleArgs...>& tuple, boost::mp11::index_sequence<Is...>)
-        {
-          (void)tuple;
-          using std::get;
-          return std::tuple<typename std::add_lvalue_reference<Args>::type...>(
-            get<Is>(tuple)...);
-        }
-
-        template <class T>
-        using add_lvalue_reference_t =
-          typename std::add_lvalue_reference<T>::type;
-
-        template <template <class...> class Tuple, class... Args>
-        boost::mp11::mp_transform<add_lvalue_reference_t,
-          boost::mp11::mp_remove<std::tuple<Args...>,
-            boost::tuples::null_type> >
-        to_std_tuple(Tuple<Args...>& tuple)
-        {
-          using list = boost::mp11::mp_remove<boost::mp11::mp_list<Args...>,
-            boost::tuples::null_type>;
-          using list_size = boost::mp11::mp_size<list>;
-          using index_seq = boost::mp11::make_index_sequence<list_size::value>;
-
-          return to_std_tuple_impl(list{}, tuple, index_seq{});
-        }
-
-        template <typename Alloc, typename A, typename B, typename A0,
-          typename A1, typename A2>
-        inline typename std::enable_if<use_piecewise<A0>::value &&
-                                         !detect_std_tuple<A1>::value &&
-                                         !detect_std_tuple<A2>::value,
-          void>::type
-        construct_from_args(
-          Alloc& alloc, std::pair<A, B>* address, A0&&, A1&& a1, A2&& a2)
-        {
-          boost::allocator_construct(alloc, address, std::piecewise_construct,
-            to_std_tuple(a1), to_std_tuple(a2));
-        }
-      } // namespace func
-    } // namespace detail
-  } // namespace unordered
-} // namespace boost
-
-namespace boost {
-  namespace unordered {
-    namespace detail {
-
-      ///////////////////////////////////////////////////////////////////
-      //
-      // Node construction
-
-      template <typename NodeAlloc> struct node_constructor
-      {
-        typedef NodeAlloc node_allocator;
-        typedef boost::unordered::detail::allocator_traits<NodeAlloc>
-          node_allocator_traits;
-        typedef typename node_allocator_traits::value_type node;
-        typedef typename node_allocator_traits::pointer node_pointer;
-        typedef typename node::value_type value_type;
-
-        node_allocator& alloc_;
-        node_pointer node_;
-
-        node_constructor(node_allocator& n) : alloc_(n), node_() {}
-
-        ~node_constructor();
-
-        void create_node();
-
-        // no throw
-        node_pointer release()
-        {
-          BOOST_ASSERT(node_);
-          node_pointer p = node_;
-          node_ = node_pointer();
-          return p;
-        }
-
-      private:
-        node_constructor(node_constructor const&);
-        node_constructor& operator=(node_constructor const&);
-      };
-
-      template <typename Alloc> node_constructor<Alloc>::~node_constructor()
-      {
-        if (node_) {
-          boost::unordered::detail::func::destroy(boost::to_address(node_));
-          node_allocator_traits::deallocate(alloc_, node_, 1);
-        }
-      }
-
-      template <typename Alloc> void node_constructor<Alloc>::create_node()
-      {
-        BOOST_ASSERT(!node_);
-        node_ = node_allocator_traits::allocate(alloc_, 1);
-        new ((void*)boost::to_address(node_)) node();
-      }
-
-      template <typename NodeAlloc> struct node_tmp
-      {
-        typedef typename boost::allocator_value_type<NodeAlloc>::type node;
-        typedef typename boost::allocator_pointer<NodeAlloc>::type node_pointer;
-        typedef typename node::value_type value_type;
-        typedef typename boost::allocator_rebind<NodeAlloc, value_type>::type
-          value_allocator;
-
-        NodeAlloc& alloc_;
-        node_pointer node_;
-
-        explicit node_tmp(node_pointer n, NodeAlloc& a) : alloc_(a), node_(n) {}
-
-        ~node_tmp();
-
-        // no throw
-        node_pointer release()
-        {
-          node_pointer p = node_;
-          node_ = node_pointer();
-          return p;
-        }
-      };
-
-      template <typename Alloc> node_tmp<Alloc>::~node_tmp()
-      {
-        if (node_) {
-          value_allocator val_alloc(alloc_);
-          boost::allocator_destroy(val_alloc, node_->value_ptr());
-          boost::allocator_deallocate(alloc_, node_, 1);
-        }
-      }
-    } // namespace detail
-  } // namespace unordered
-} // namespace boost
-
-namespace boost {
-  namespace unordered {
-    namespace detail {
-      namespace func {
-
-        // Some nicer construct_node functions, might try to
-        // improve implementation later.
-
-        template <typename Alloc, typename... Args>
-        inline typename boost::allocator_pointer<Alloc>::type
-        construct_node_from_args(Alloc& alloc, Args&&... args)
-        {
-          typedef typename boost::allocator_value_type<Alloc>::type node;
-          typedef typename node::value_type value_type;
-          typedef typename boost::allocator_rebind<Alloc, value_type>::type
-            value_allocator;
-
-          value_allocator val_alloc(alloc);
-
-          node_constructor<Alloc> a(alloc);
-          a.create_node();
-          construct_from_args(
-            val_alloc, a.node_->value_ptr(), std::forward<Args>(args)...);
-          return a.release();
-        }
-
-        template <typename Alloc, typename U>
-        inline typename boost::allocator_pointer<Alloc>::type construct_node(
-          Alloc& alloc, U&& x)
-        {
-          node_constructor<Alloc> a(alloc);
-          a.create_node();
-
-          typedef typename boost::allocator_value_type<Alloc>::type node;
-          typedef typename node::value_type value_type;
-          typedef typename boost::allocator_rebind<Alloc, value_type>::type
-            value_allocator;
-
-          value_allocator val_alloc(alloc);
-
-          boost::allocator_construct(
-            val_alloc, a.node_->value_ptr(), std::forward<U>(x));
-          return a.release();
-        }
-
-        template <typename Alloc, typename Key>
-        inline typename boost::allocator_pointer<Alloc>::type
-        construct_node_pair(Alloc& alloc, Key&& k)
-        {
-          node_constructor<Alloc> a(alloc);
-          a.create_node();
-
-          typedef typename boost::allocator_value_type<Alloc>::type node;
-          typedef typename node::value_type value_type;
-          typedef typename boost::allocator_rebind<Alloc, value_type>::type
-            value_allocator;
-
-          value_allocator val_alloc(alloc);
-
-          boost::allocator_construct(val_alloc, a.node_->value_ptr(),
-            std::piecewise_construct,
-            std::forward_as_tuple(std::forward<Key>(k)),
-            std::forward_as_tuple());
-          return a.release();
-        }
-
-        template <typename Alloc, typename Key, typename Mapped>
-        inline typename boost::allocator_pointer<Alloc>::type
-        construct_node_pair(Alloc& alloc, Key&& k, Mapped&& m)
-        {
-          node_constructor<Alloc> a(alloc);
-          a.create_node();
-
-          typedef typename boost::allocator_value_type<Alloc>::type node;
-          typedef typename node::value_type value_type;
-          typedef typename boost::allocator_rebind<Alloc, value_type>::type
-            value_allocator;
-
-          value_allocator val_alloc(alloc);
-
-          boost::allocator_construct(val_alloc, a.node_->value_ptr(),
-            std::piecewise_construct,
-            std::forward_as_tuple(std::forward<Key>(k)),
-            std::forward_as_tuple(std::forward<Mapped>(m)));
-          return a.release();
-        }
-
-        template <typename Alloc, typename Key, typename... Args>
-        inline typename boost::allocator_pointer<Alloc>::type
-        construct_node_pair_from_args(Alloc& alloc, Key&& k, Args&&... args)
-        {
-          node_constructor<Alloc> a(alloc);
-          a.create_node();
-
-          typedef typename boost::allocator_value_type<Alloc>::type node;
-          typedef typename node::value_type value_type;
-          typedef typename boost::allocator_rebind<Alloc, value_type>::type
-            value_allocator;
-
-          value_allocator val_alloc(alloc);
-
-          boost::allocator_construct(val_alloc, a.node_->value_ptr(),
-            std::piecewise_construct,
-            std::forward_as_tuple(std::forward<Key>(k)),
-            std::forward_as_tuple(std::forward<Args>(args)...));
-
-          return a.release();
-        }
-
-        template <typename T, typename Alloc, typename Key>
-        inline typename boost::allocator_pointer<Alloc>::type
-        construct_node_from_key(T*, Alloc& alloc, Key&& k)
-        {
-          return construct_node(alloc, std::forward<Key>(k));
-        }
-
-        template <typename T, typename V, typename Alloc, typename Key>
-        inline typename boost::allocator_pointer<Alloc>::type
-        construct_node_from_key(std::pair<T const, V>*, Alloc& alloc, Key&& k)
-        {
-          return construct_node_pair(alloc, std::forward<Key>(k));
-        }
-      } // namespace func
-    } // namespace detail
-  } // namespace unordered
-} // namespace boost
-
-#if defined(BOOST_MSVC)
-#pragma warning(pop)
-#endif
-
-namespace boost {
-  namespace unordered {
-    namespace detail {
-      //////////////////////////////////////////////////////////////////////////
-      // Functions
-      //
-      // This double buffers the storage for the hash function and key equality
-      // predicate in order to have exception safe copy/swap. To do so,
-      // use 'construct_spare' to construct in the spare space, and then when
-      // ready to use 'switch_functions' to switch to the new functions.
-      // If an exception is thrown between these two calls, use
-      // 'cleanup_spare_functions' to destroy the unused constructed functions.
-
-#if defined(_GLIBCXX_HAVE_BUILTIN_LAUNDER)
-      // gcc-12 warns when accessing the `current_functions` of our `functions`
-      // class below with `-Wmaybe-unitialized`. By laundering the pointer, we
-      // silence the warning and assure the compiler that a valid object exists
-      // in that region of storage. This warning is also generated in C++03
-      // which does not have `std::launder`. The compiler builtin is always
-      // available, regardless of the C++ standard used when compiling.
-      template <class T> T* launder(T* p) noexcept
-      {
-        return __builtin_launder(p);
-      }
-#else
-      template <class T> T* launder(T* p) noexcept { return p; }
-#endif
-
-      template <class H, class P> class functions
-      {
-      public:
-        static const bool nothrow_move_assignable =
-          std::is_nothrow_move_assignable<H>::value &&
-          std::is_nothrow_move_assignable<P>::value;
-        static const bool nothrow_move_constructible =
-          std::is_nothrow_move_constructible<H>::value &&
-          std::is_nothrow_move_constructible<P>::value;
-        static const bool nothrow_swappable =
-          boost::unordered::detail::is_nothrow_swappable<H>::value &&
-          boost::unordered::detail::is_nothrow_swappable<P>::value;
-
-      private:
-        functions& operator=(functions const&);
-
-        typedef compressed<H, P> function_pair;
-
-        unsigned char current_; // 0/1 - Currently active functions
-                                // +2 - Both constructed
-        opt_storage<function_pair> funcs_[2];
-
-      public:
-        functions(H const& hf, P const& eq) : current_(0)
-        {
-          construct_functions(current_, hf, eq);
-        }
-
-        functions(functions const& bf) : current_(0)
-        {
-          construct_functions(current_, bf.current_functions());
-        }
-
-        functions(functions& bf, boost::unordered::detail::move_tag)
-            : current_(0)
-        {
-          construct_functions(current_, bf.current_functions(),
-            std::integral_constant<bool, nothrow_move_constructible>());
-        }
-
-        ~functions()
-        {
-          BOOST_ASSERT(!(current_ & 2));
-          destroy_functions(current_);
-        }
-
-        H const& hash_function() const { return current_functions().first(); }
-
-        P const& key_eq() const { return current_functions().second(); }
-
-        function_pair const& current_functions() const
-        {
-          return *::boost::unordered::detail::launder(
-            static_cast<function_pair const*>(
-              static_cast<void const*>(funcs_[current_ & 1].address())));
-        }
-
-        function_pair& current_functions()
-        {
-          return *::boost::unordered::detail::launder(
-            static_cast<function_pair*>(
-              static_cast<void*>(funcs_[current_ & 1].address())));
-        }
-
-        void construct_spare_functions(function_pair const& f)
-        {
-          BOOST_ASSERT(!(current_ & 2));
-          construct_functions(current_ ^ 1, f);
-          current_ |= 2;
-        }
-
-        void cleanup_spare_functions()
-        {
-          if (current_ & 2) {
-            current_ = static_cast<unsigned char>(current_ & 1);
-            destroy_functions(current_ ^ 1);
-          }
-        }
-
-        void switch_functions()
-        {
-          BOOST_ASSERT(current_ & 2);
-          destroy_functions(static_cast<unsigned char>(current_ & 1));
-          current_ ^= 3;
-        }
-
-      private:
-        void construct_functions(unsigned char which, H const& hf, P const& eq)
-        {
-          BOOST_ASSERT(!(which & 2));
-          new ((void*)&funcs_[which]) function_pair(hf, eq);
-        }
-
-        void construct_functions(
-          unsigned char which, function_pair const& f, std::false_type = {})
-        {
-          BOOST_ASSERT(!(which & 2));
-          new ((void*)&funcs_[which]) function_pair(f);
-        }
-
-        void construct_functions(
-          unsigned char which, function_pair& f, std::true_type)
-        {
-          BOOST_ASSERT(!(which & 2));
-          new ((void*)&funcs_[which])
-            function_pair(f, boost::unordered::detail::move_tag());
-        }
-
-        void destroy_functions(unsigned char which)
-        {
-          BOOST_ASSERT(!(which & 2));
-          boost::unordered::detail::func::destroy(
-            (function_pair*)(&funcs_[which]));
-        }
-      };
-
-#if defined(BOOST_MSVC)
-#pragma warning(push)
-#pragma warning(disable : 4127) // conditional expression is constant
-#endif
-
-      //////////////////////////////////////////////////////////////////////////
-      // convert double to std::size_t
-
-      inline std::size_t double_to_size(double f)
-      {
-        return f >= static_cast<double>(
-                      (std::numeric_limits<std::size_t>::max)())
-                 ? (std::numeric_limits<std::size_t>::max)()
-                 : static_cast<std::size_t>(f);
-      }
-
-      //////////////////////////////////////////////////////////////////////////
-      // iterator definitions
-
-      namespace iterator_detail {
-        template <class Node, class Bucket> class c_iterator;
-
-        template <class Node, class Bucket> class iterator
-        {
-        public:
-          typedef typename Node::value_type value_type;
-          typedef value_type element_type;
-          typedef value_type* pointer;
-          typedef value_type& reference;
-          typedef std::ptrdiff_t difference_type;
-          typedef std::forward_iterator_tag iterator_category;
-
-          iterator() : p(), itb() {}
-
-          reference operator*() const noexcept { return dereference(); }
-          pointer operator->() const noexcept
-          {
-            pointer x = std::addressof(p->value());
-            return x;
-          }
-
-          iterator& operator++() noexcept
-          {
-            increment();
-            return *this;
-          }
-
-          iterator operator++(int) noexcept
-          {
-            iterator old = *this;
-            increment();
-            return old;
-          }
-
-          bool operator==(iterator const& other) const noexcept
-          {
-            return equal(other);
-          }
-
-          bool operator!=(iterator const& other) const noexcept
-          {
-            return !equal(other);
-          }
-
-          bool operator==(
-            boost::unordered::detail::iterator_detail::c_iterator<Node,
-              Bucket> const& other) const noexcept
-          {
-            return equal(other);
-          }
-
-          bool operator!=(
-            boost::unordered::detail::iterator_detail::c_iterator<Node,
-              Bucket> const& other) const noexcept
-          {
-            return !equal(other);
-          }
-
-        private:
-          typedef typename Node::node_pointer node_pointer;
-          typedef grouped_bucket_iterator<Bucket> bucket_iterator;
-
-          node_pointer p;
-          bucket_iterator itb;
-
-          template <class Types> friend struct boost::unordered::detail::table;
-          template <class N, class B> friend class c_iterator;
-
-          iterator(node_pointer p_, bucket_iterator itb_) : p(p_), itb(itb_) {}
-
-          value_type& dereference() const noexcept { return p->value(); }
-
-          bool equal(const iterator& x) const noexcept { return (p == x.p); }
-
-          bool equal(
-            const boost::unordered::detail::iterator_detail::c_iterator<Node,
-              Bucket>& x) const noexcept
-          {
-            return (p == x.p);
-          }
-
-          void increment() noexcept
-          {
-            p = p->next;
-            if (!p) {
-              p = (++itb)->next;
-            }
-          }
-
-          template <typename Archive>
-          friend void serialization_track(Archive& ar, const iterator& x)
-          {
-            if (x.p) {
-              track_address(ar, x.p);
-              serialization_track(ar, x.itb);
-            }
-          }
-
-          friend class boost::serialization::access;
-
-          template <typename Archive> void serialize(Archive& ar, unsigned int)
-          {
-            if (!p)
-              itb = bucket_iterator();
-            serialize_tracked_address(ar, p);
-            ar& core::make_nvp("bucket_iterator", itb);
-          }
-        };
-
-        template <class Node, class Bucket> class c_iterator
-        {
-        public:
-          typedef typename Node::value_type value_type;
-          typedef value_type const element_type;
-          typedef value_type const* pointer;
-          typedef value_type const& reference;
-          typedef std::ptrdiff_t difference_type;
-          typedef std::forward_iterator_tag iterator_category;
-
-          c_iterator() : p(), itb() {}
-          c_iterator(iterator<Node, Bucket> it) : p(it.p), itb(it.itb) {}
-
-          reference operator*() const noexcept { return dereference(); }
-          pointer operator->() const noexcept
-          {
-            pointer x = std::addressof(p->value());
-            return x;
-          }
-
-          c_iterator& operator++() noexcept
-          {
-            increment();
-            return *this;
-          }
-
-          c_iterator operator++(int) noexcept
-          {
-            c_iterator old = *this;
-            increment();
-            return old;
-          }
-
-          bool operator==(c_iterator const& other) const noexcept
-          {
-            return equal(other);
-          }
-
-          bool operator!=(c_iterator const& other) const noexcept
-          {
-            return !equal(other);
-          }
-
-          bool operator==(
-            boost::unordered::detail::iterator_detail::iterator<Node,
-              Bucket> const& other) const noexcept
-          {
-            return equal(other);
-          }
-
-          bool operator!=(
-            boost::unordered::detail::iterator_detail::iterator<Node,
-              Bucket> const& other) const noexcept
-          {
-            return !equal(other);
-          }
-
-        private:
-          typedef typename Node::node_pointer node_pointer;
-          typedef grouped_bucket_iterator<Bucket> bucket_iterator;
-
-          node_pointer p;
-          bucket_iterator itb;
-
-          template <class Types> friend struct boost::unordered::detail::table;
-          template <class, class> friend class iterator;
-
-          c_iterator(node_pointer p_, bucket_iterator itb_) : p(p_), itb(itb_)
-          {
-          }
-
-          value_type const& dereference() const noexcept { return p->value(); }
-
-          bool equal(const c_iterator& x) const noexcept { return (p == x.p); }
-
-          void increment() noexcept
-          {
-            p = p->next;
-            if (!p) {
-              p = (++itb)->next;
-            }
-          }
-
-          template <typename Archive>
-          friend void serialization_track(Archive& ar, const c_iterator& x)
-          {
-            if (x.p) {
-              track_address(ar, x.p);
-              serialization_track(ar, x.itb);
-            }
-          }
-
-          friend class boost::serialization::access;
-
-          template <typename Archive> void serialize(Archive& ar, unsigned int)
-          {
-            if (!p)
-              itb = bucket_iterator();
-            serialize_tracked_address(ar, p);
-            ar& core::make_nvp("bucket_iterator", itb);
-          }
-        };
-      } // namespace iterator_detail
-
-      //////////////////////////////////////////////////////////////////////////
-      // table structure used by the containers
-      template <typename Types>
-      struct table : boost::unordered::detail::functions<typename Types::hasher,
-                       typename Types::key_equal>
-      {
-      private:
-        table(table const&);
-        table& operator=(table const&);
-
-      public:
-        typedef typename Types::hasher hasher;
-        typedef typename Types::key_equal key_equal;
-        typedef typename Types::const_key_type const_key_type;
-        typedef typename Types::extractor extractor;
-        typedef typename Types::value_type value_type;
-        typedef typename Types::table table_impl;
-
-        typedef boost::unordered::detail::functions<typename Types::hasher,
-          typename Types::key_equal>
-          functions;
-
-        typedef typename Types::value_allocator value_allocator;
-        typedef typename boost::allocator_void_pointer<value_allocator>::type
-          void_pointer;
-        typedef node<value_type, void_pointer> node_type;
-
-        typedef boost::unordered::detail::grouped_bucket_array<
-          bucket<node_type, void_pointer>, value_allocator, prime_fmod_size<> >
-          bucket_array_type;
-
-        typedef
-          typename bucket_array_type::node_allocator_type node_allocator_type;
-        typedef typename boost::allocator_pointer<node_allocator_type>::type
-          node_pointer;
-
-        typedef boost::unordered::detail::node_constructor<node_allocator_type>
-          node_constructor;
-        typedef boost::unordered::detail::node_tmp<node_allocator_type>
-          node_tmp;
-
-        typedef typename bucket_array_type::bucket_type bucket_type;
-
-        typedef typename bucket_array_type::iterator bucket_iterator;
-
-        typedef typename bucket_array_type::local_iterator l_iterator;
-        typedef typename bucket_array_type::const_local_iterator cl_iterator;
-
-        typedef std::size_t size_type;
-
-        typedef iterator_detail::iterator<node_type, bucket_type> iterator;
-        typedef iterator_detail::c_iterator<node_type, bucket_type> c_iterator;
-
-        typedef std::pair<iterator, bool> emplace_return;
-
-        ////////////////////////////////////////////////////////////////////////
-        // Members
-
-        std::size_t size_;
-        float mlf_;
-        std::size_t max_load_;
-        bucket_array_type buckets_;
-
-      public:
-        ////////////////////////////////////////////////////////////////////////
-        // Data access
-
-        size_type bucket_count() const { return buckets_.bucket_count(); }
-
-        template <class Key>
-        iterator next_group(Key const& k, c_iterator n) const
-        {
-          c_iterator last = this->end();
-          while (n != last && this->key_eq()(k, extractor::extract(*n))) {
-            ++n;
-          }
-          return iterator(n.p, n.itb);
-        }
-
-        template <class Key> std::size_t group_count(Key const& k) const
-        {
-          if (size_ == 0) {
-            return 0;
-          }
-          std::size_t c = 0;
-          std::size_t const key_hash = this->hash(k);
-          bucket_iterator itb = buckets_.at(buckets_.position(key_hash));
-
-          bool found = false;
-
-          for (node_pointer pos = itb->next; pos; pos = pos->next) {
-            if (this->key_eq()(k, this->get_key(pos))) {
-              ++c;
-              found = true;
-            } else if (found) {
-              break;
-            }
-          }
-          return c;
-        }
-
-        node_allocator_type const& node_alloc() const
-        {
-          return buckets_.get_node_allocator();
-        }
-
-        node_allocator_type& node_alloc()
-        {
-          return buckets_.get_node_allocator();
-        }
-
-        std::size_t max_bucket_count() const
-        {
-          typedef typename bucket_array_type::size_policy size_policy;
-          return size_policy::size(size_policy::size_index(
-            boost::allocator_max_size(this->node_alloc())));
-        }
-
-        iterator begin() const
-        {
-          if (size_ == 0) {
-            return end();
-          }
-
-          bucket_iterator itb = buckets_.begin();
-          return iterator(itb->next, itb);
-        }
-
-        iterator end() const { return iterator(); }
-
-        l_iterator begin(std::size_t bucket_index) const
-        {
-          return buckets_.begin(bucket_index);
-        }
-
-        std::size_t hash_to_bucket(std::size_t hash_value) const
-        {
-          return buckets_.position(hash_value);
-        }
-
-        std::size_t bucket_size(std::size_t index) const
-        {
-          std::size_t count = 0;
-          if (size_ > 0) {
-            bucket_iterator itb = buckets_.at(index);
-            node_pointer n = itb->next;
-            while (n) {
-              ++count;
-              n = n->next;
-            }
-          }
-          return count;
-        }
-
-        ////////////////////////////////////////////////////////////////////////
-        // Load methods
-
-        void recalculate_max_load()
-        {
-          // From 6.3.1/13:
-          // Only resize when size >= mlf_ * count
-          std::size_t const bc = buckets_.bucket_count();
-
-          // it's important we do the `bc == 0` check here because the `mlf_`
-          // can be specified to be infinity. The operation `n * INF` is `INF`
-          // for all `n > 0` but NaN for `n == 0`.
-          //
-          max_load_ =
-            bc == 0 ? 0
-                    : boost::unordered::detail::double_to_size(
-                        static_cast<double>(mlf_) * static_cast<double>(bc));
-        }
-
-        void max_load_factor(float z)
-        {
-          BOOST_ASSERT(z > 0);
-          mlf_ = (std::max)(z, minimum_max_load_factor);
-          recalculate_max_load();
-        }
-
-        ////////////////////////////////////////////////////////////////////////
-        // Constructors
-
-        table()
-            : functions(hasher(), key_equal()), size_(0), mlf_(1.0f),
-              max_load_(0)
-        {
-        }
-
-        table(std::size_t num_buckets, hasher const& hf, key_equal const& eq,
-          node_allocator_type const& a)
-            : functions(hf, eq), size_(0), mlf_(1.0f), max_load_(0),
-              buckets_(num_buckets, a)
-        {
-          recalculate_max_load();
-        }
-
-        table(table const& x, node_allocator_type const& a)
-            : functions(x), size_(0), mlf_(x.mlf_), max_load_(0),
-              buckets_(x.size_, a)
-        {
-          recalculate_max_load();
-        }
-
-        table(table& x, boost::unordered::detail::move_tag m)
-            : functions(x, m), size_(x.size_), mlf_(x.mlf_),
-              max_load_(x.max_load_), buckets_(std::move(x.buckets_))
-        {
-          x.size_ = 0;
-          x.max_load_ = 0;
-        }
-
-        table(table& x, node_allocator_type const& a,
-          boost::unordered::detail::move_tag m)
-            : functions(x, m), size_(0), mlf_(x.mlf_), max_load_(0),
-              buckets_(x.bucket_count(), a)
-        {
-          recalculate_max_load();
-        }
-
-        ////////////////////////////////////////////////////////////////////////
-        // Swap and Move
-
-        void swap_allocators(table& other, std::false_type)
-        {
-          boost::unordered::detail::func::ignore_unused_variable_warning(other);
-
-          // According to 23.2.1.8, if propagate_on_container_swap is
-          // false the behaviour is undefined unless the allocators
-          // are equal.
-          BOOST_ASSERT(node_alloc() == other.node_alloc());
-        }
-
-        // Not nothrow swappable
-        void swap(table& x, std::false_type)
-        {
-          if (this == &x) {
-            return;
-          }
-
-          this->construct_spare_functions(x.current_functions());
-          BOOST_TRY { x.construct_spare_functions(this->current_functions()); }
-          BOOST_CATCH(...)
-          {
-            this->cleanup_spare_functions();
-            BOOST_RETHROW
-          }
-          BOOST_CATCH_END
-          this->switch_functions();
-          x.switch_functions();
-
-          buckets_.swap(x.buckets_);
-          boost::core::invoke_swap(size_, x.size_);
-          std::swap(mlf_, x.mlf_);
-          std::swap(max_load_, x.max_load_);
-        }
-
-        // Nothrow swappable
-        void swap(table& x, std::true_type)
-        {
-          buckets_.swap(x.buckets_);
-          boost::core::invoke_swap(size_, x.size_);
-          std::swap(mlf_, x.mlf_);
-          std::swap(max_load_, x.max_load_);
-          this->current_functions().swap(x.current_functions());
-        }
-
-        // Only swaps the allocators if propagate_on_container_swap.
-        // If not propagate_on_container_swap and allocators aren't
-        // equal, behaviour is undefined.
-        void swap(table& x)
-        {
-          BOOST_ASSERT(boost::allocator_propagate_on_container_swap<
-                         node_allocator_type>::type::value ||
-                       node_alloc() == x.node_alloc());
-          swap(x, std::integral_constant<bool, functions::nothrow_swappable>());
-        }
-
-        // Only call with nodes allocated with the currect allocator, or
-        // one that is equal to it. (Can't assert because other's
-        // allocators might have already been moved).
-        void move_buckets_from(table& other)
-        {
-          buckets_ = std::move(other.buckets_);
-
-          size_ = other.size_;
-          max_load_ = other.max_load_;
-
-          other.size_ = 0;
-          other.max_load_ = 0;
-        }
-
-        // For use in the constructor when allocators might be different.
-        void move_construct_buckets(table& src)
-        {
-          if (this->node_alloc() == src.node_alloc()) {
-            move_buckets_from(src);
-            return;
-          }
-
-          if (src.size_ == 0) {
-            return;
-          }
-
-          BOOST_ASSERT(buckets_.bucket_count() == src.buckets_.bucket_count());
-
-          this->reserve(src.size_);
-          for (iterator pos = src.begin(); pos != src.end(); ++pos) {
-            node_tmp b(detail::func::construct_node(
-                         this->node_alloc(), std::move(pos.p->value())),
-              this->node_alloc());
-
-            const_key_type& k = this->get_key(b.node_);
-            std::size_t key_hash = this->hash(k);
-
-            bucket_iterator itb = buckets_.at(buckets_.position(key_hash));
-            buckets_.insert_node(itb, b.release());
-            ++size_;
-          }
-        }
-
-        ////////////////////////////////////////////////////////////////////////
-        // Delete/destruct
-
-        ~table() { delete_buckets(); }
-
-        void delete_node(node_pointer p)
-        {
-          node_allocator_type alloc = this->node_alloc();
-
-          value_allocator val_alloc(alloc);
-          boost::allocator_destroy(val_alloc, p->value_ptr());
-          boost::unordered::detail::func::destroy(boost::to_address(p));
-          boost::allocator_deallocate(alloc, p, 1);
-        }
-
-        void delete_buckets()
-        {
-          iterator pos = begin(), last = this->end();
-          for (; pos != last;) {
-            node_pointer p = pos.p;
-            bucket_iterator itb = pos.itb;
-            ++pos;
-            buckets_.extract_node(itb, p);
-            delete_node(p);
-            --size_;
-          }
-
-          buckets_.clear();
-        }
-
-        ////////////////////////////////////////////////////////////////////////
-        // Clear
-
-        void clear_impl();
-
-        ////////////////////////////////////////////////////////////////////////
-        // Assignment
-
-        template <typename UniqueType>
-        void assign(table const& x, UniqueType is_unique)
-        {
-          typedef
-            typename boost::allocator_propagate_on_container_copy_assignment<
-              node_allocator_type>::type pocca;
-
-          if (this != &x) {
-            assign(x, is_unique, std::integral_constant<bool, pocca::value>());
-          }
-        }
-
-        template <typename UniqueType>
-        void assign(table const& x, UniqueType is_unique, std::false_type)
-        {
-          // Strong exception safety.
-          this->construct_spare_functions(x.current_functions());
-          BOOST_TRY
-          {
-            mlf_ = x.mlf_;
-            recalculate_max_load();
-
-            this->reserve_for_insert(x.size_);
-            this->clear_impl();
-          }
-          BOOST_CATCH(...)
-          {
-            this->cleanup_spare_functions();
-            BOOST_RETHROW
-          }
-          BOOST_CATCH_END
-          this->switch_functions();
-          copy_buckets(x, is_unique);
-        }
-
-        template <typename UniqueType>
-        void assign(table const& x, UniqueType is_unique, std::true_type)
-        {
-          if (node_alloc() == x.node_alloc()) {
-            buckets_.reset_allocator(x.node_alloc());
-            assign(x, is_unique, std::false_type());
-          } else {
-            bucket_array_type new_buckets(x.size_, x.node_alloc());
-            this->construct_spare_functions(x.current_functions());
-            this->switch_functions();
-
-            // Delete everything with current allocators before assigning
-            // the new ones.
-            delete_buckets();
-            buckets_.reset_allocator(x.node_alloc());
-            buckets_ = std::move(new_buckets);
-
-            // Copy over other data, all no throw.
-            mlf_ = x.mlf_;
-            reserve(x.size_);
-
-            // Finally copy the elements.
-            if (x.size_) {
-              copy_buckets(x, is_unique);
-            }
-          }
-        }
-
-        template <typename UniqueType>
-        void move_assign(table& x, UniqueType is_unique)
-        {
-          if (this != &x) {
-            move_assign(x, is_unique,
-              std::integral_constant<bool,
-                boost::allocator_propagate_on_container_move_assignment<
-                  node_allocator_type>::type::value>());
-          }
-        }
-
-        // Propagate allocator
-        template <typename UniqueType>
-        void move_assign(table& x, UniqueType, std::true_type)
-        {
-          if (!functions::nothrow_move_assignable) {
-            this->construct_spare_functions(x.current_functions());
-            this->switch_functions();
-          } else {
-            this->current_functions().move_assign(x.current_functions());
-          }
-          delete_buckets();
-
-          buckets_.reset_allocator(x.buckets_.get_node_allocator());
-          mlf_ = x.mlf_;
-          move_buckets_from(x);
-        }
-
-        // Don't propagate allocator
-        template <typename UniqueType>
-        void move_assign(table& x, UniqueType is_unique, std::false_type)
-        {
-          if (node_alloc() == x.node_alloc()) {
-            move_assign_equal_alloc(x);
-          } else {
-            move_assign_realloc(x, is_unique);
-          }
-        }
-
-        void move_assign_equal_alloc(table& x)
-        {
-          if (!functions::nothrow_move_assignable) {
-            this->construct_spare_functions(x.current_functions());
-            this->switch_functions();
-          } else {
-            this->current_functions().move_assign(x.current_functions());
-          }
-          delete_buckets();
-          mlf_ = x.mlf_;
-          move_buckets_from(x);
-        }
-
-        template <typename UniqueType>
-        void move_assign_realloc(table& x, UniqueType is_unique)
-        {
-          this->construct_spare_functions(x.current_functions());
-          BOOST_TRY
-          {
-            mlf_ = x.mlf_;
-            recalculate_max_load();
-            if (x.size_ > 0) {
-              this->reserve_for_insert(x.size_);
-            }
-            this->clear_impl();
-          }
-          BOOST_CATCH(...)
-          {
-            this->cleanup_spare_functions();
-            BOOST_RETHROW
-          }
-          BOOST_CATCH_END
-          this->switch_functions();
-          move_assign_buckets(x, is_unique);
-        }
-
-        // Accessors
-
-        const_key_type& get_key(node_pointer n) const
-        {
-          return extractor::extract(n->value());
-        }
-
-        template <class Key> std::size_t hash(Key const& k) const
-        {
-          return this->hash_function()(k);
-        }
-
-        // Find Node
-
-        template <class Key>
-        node_pointer find_node_impl(Key const& x, bucket_iterator itb) const
-        {
-          node_pointer p = node_pointer();
-          if (itb != buckets_.end()) {
-            key_equal const& pred = this->key_eq();
-            p = itb->next;
-            for (; p; p = p->next) {
-              if (pred(x, extractor::extract(p->value()))) {
-                break;
-              }
-            }
-          }
-          return p;
-        }
-
-        template <class Key> node_pointer find_node(Key const& k) const
-        {
-          std::size_t const key_hash = this->hash(k);
-          return find_node_impl(k, buckets_.at(buckets_.position(key_hash)));
-        }
-
-        node_pointer find_node(const_key_type& k, bucket_iterator itb) const
-        {
-          return find_node_impl(k, itb);
-        }
-
-        template <class Key> iterator find(Key const& k) const
-        {
-          return this->transparent_find(
-            k, this->hash_function(), this->key_eq());
-        }
-
-        template <class Key, class Hash, class Pred>
-        inline iterator transparent_find(
-          Key const& k, Hash const& h, Pred const& pred) const
-        {
-          if (size_ > 0) {
-            std::size_t const key_hash = h(k);
-            bucket_iterator itb = buckets_.at(buckets_.position(key_hash));
-            for (node_pointer p = itb->next; p; p = p->next) {
-              if (BOOST_LIKELY(pred(k, extractor::extract(p->value())))) {
-                return iterator(p, itb);
-              }
-            }
-          }
-
-          return this->end();
-        }
-
-        template <class Key>
-        node_pointer* find_prev(Key const& key, bucket_iterator itb)
-        {
-          if (size_ > 0) {
-            key_equal pred = this->key_eq();
-            for (node_pointer* pp = std::addressof(itb->next); *pp;
-                 pp = std::addressof((*pp)->next)) {
-              if (pred(key, extractor::extract((*pp)->value()))) {
-                return pp;
-              }
-            }
-          }
-          typedef node_pointer* node_pointer_pointer;
-          return node_pointer_pointer();
-        }
-
-        // Extract and erase
-
-        template <class Key> node_pointer extract_by_key_impl(Key const& k)
-        {
-          iterator it = this->find(k);
-          if (it == this->end()) {
-            return node_pointer();
-          }
-
-          buckets_.extract_node(it.itb, it.p);
-          --size_;
-
-          return it.p;
-        }
-
-        // Reserve and rehash
-        void transfer_node(
-          node_pointer p, bucket_type&, bucket_array_type& new_buckets)
-        {
-          const_key_type& key = extractor::extract(p->value());
-          std::size_t const h = this->hash(key);
-          bucket_iterator itnewb = new_buckets.at(new_buckets.position(h));
-          new_buckets.insert_node(itnewb, p);
-        }
-
-        static std::size_t min_buckets(std::size_t num_elements, float mlf)
-        {
-          std::size_t num_buckets = static_cast<std::size_t>(
-            std::ceil(static_cast<float>(num_elements) / mlf));
-
-          if (num_buckets == 0 && num_elements > 0) { // mlf == inf
-            num_buckets = 1;
-          }
-          return num_buckets;
-        }
-
-        void rehash(std::size_t);
-        void reserve(std::size_t);
-        void reserve_for_insert(std::size_t);
-        void rehash_impl(std::size_t);
-
-        ////////////////////////////////////////////////////////////////////////
-        // Unique keys
-
-        // equals
-
-        bool equals_unique(table const& other) const
-        {
-          if (this->size_ != other.size_)
-            return false;
-
-          c_iterator pos = this->begin();
-          c_iterator last = this->end();
-
-          while (pos != last) {
-            node_pointer p = pos.p;
-            node_pointer p2 = other.find_node(this->get_key(p));
-            if (!p2 || !(p->value() == p2->value())) {
-              return false;
-            }
-            ++pos;
-          }
-
-          return true;
-        }
-
-        // Emplace/Insert
-
-        template <typename... Args>
-        iterator emplace_hint_unique(
-          c_iterator hint, const_key_type& k, Args&&... args)
-        {
-          if (hint.p && this->key_eq()(k, this->get_key(hint.p))) {
-            return iterator(hint.p, hint.itb);
-          } else {
-            return emplace_unique(k, std::forward<Args>(args)...).first;
-          }
-        }
-
-        template <typename... Args>
-        emplace_return emplace_unique(const_key_type& k, Args&&... args)
-        {
-          std::size_t key_hash = this->hash(k);
-          bucket_iterator itb = buckets_.at(buckets_.position(key_hash));
-          node_pointer pos = this->find_node_impl(k, itb);
-
-          if (pos) {
-            return emplace_return(iterator(pos, itb), false);
-          } else {
-            node_tmp b(boost::unordered::detail::func::construct_node_from_args(
-                         this->node_alloc(), std::forward<Args>(args)...),
-              this->node_alloc());
-
-            if (size_ + 1 > max_load_) {
-              reserve(size_ + 1);
-              itb = buckets_.at(buckets_.position(key_hash));
-            }
-
-            node_pointer p = b.release();
-            buckets_.insert_node(itb, p);
-            ++size_;
-
-            return emplace_return(iterator(p, itb), true);
-          }
-        }
-
-        template <typename... Args>
-        iterator emplace_hint_unique(c_iterator hint, no_key, Args&&... args)
-        {
-          node_tmp b(boost::unordered::detail::func::construct_node_from_args(
-                       this->node_alloc(), std::forward<Args>(args)...),
-            this->node_alloc());
-
-          const_key_type& k = this->get_key(b.node_);
-          if (hint.p && this->key_eq()(k, this->get_key(hint.p))) {
-            return iterator(hint.p, hint.itb);
-          }
-
-          std::size_t const key_hash = this->hash(k);
-          bucket_iterator itb = buckets_.at(buckets_.position(key_hash));
-
-          node_pointer p = this->find_node_impl(k, itb);
-          if (p) {
-            return iterator(p, itb);
-          }
-
-          if (size_ + 1 > max_load_) {
-            this->reserve(size_ + 1);
-            itb = buckets_.at(buckets_.position(key_hash));
-          }
-
-          p = b.release();
-          buckets_.insert_node(itb, p);
-          ++size_;
-          return iterator(p, itb);
-        }
-
-        template <typename... Args>
-        emplace_return emplace_unique(no_key, Args&&... args)
-        {
-          node_tmp b(boost::unordered::detail::func::construct_node_from_args(
-                       this->node_alloc(), std::forward<Args>(args)...),
-            this->node_alloc());
-
-          const_key_type& k = this->get_key(b.node_);
-          std::size_t key_hash = this->hash(k);
-
-          bucket_iterator itb = buckets_.at(buckets_.position(key_hash));
-          node_pointer pos = this->find_node_impl(k, itb);
-
-          if (pos) {
-            return emplace_return(iterator(pos, itb), false);
-          } else {
-            if (size_ + 1 > max_load_) {
-              reserve(size_ + 1);
-              itb = buckets_.at(buckets_.position(key_hash));
-            }
-
-            node_pointer p = b.release();
-            buckets_.insert_node(itb, p);
-            ++size_;
-
-            return emplace_return(iterator(p, itb), true);
-          }
-        }
-
-        template <typename Key> emplace_return try_emplace_unique(Key&& k)
-        {
-          std::size_t key_hash = this->hash(k);
-          bucket_iterator itb = buckets_.at(buckets_.position(key_hash));
-
-          node_pointer pos = this->find_node_impl(k, itb);
-
-          if (pos) {
-            return emplace_return(iterator(pos, itb), false);
-          } else {
-            node_allocator_type alloc = node_alloc();
-
-            value_type* dispatch = BOOST_NULLPTR;
-
-            node_tmp tmp(detail::func::construct_node_from_key(
-                           dispatch, alloc, std::forward<Key>(k)),
-              alloc);
-
-            if (size_ + 1 > max_load_) {
-              reserve(size_ + 1);
-              itb = buckets_.at(buckets_.position(key_hash));
-            }
-
-            node_pointer p = tmp.release();
-            buckets_.insert_node(itb, p);
-
-            ++size_;
-            return emplace_return(iterator(p, itb), true);
-          }
-        }
-
-        template <typename Key>
-        iterator try_emplace_hint_unique(c_iterator hint, Key&& k)
-        {
-          if (hint.p && this->key_eq()(extractor::extract(*hint), k)) {
-            return iterator(hint.p, hint.itb);
-          } else {
-            return try_emplace_unique(k).first;
-          }
-        }
-
-        template <typename Key, typename... Args>
-        emplace_return try_emplace_unique(Key&& k, Args&&... args)
-        {
-          std::size_t key_hash = this->hash(k);
-          bucket_iterator itb = buckets_.at(buckets_.position(key_hash));
-
-          node_pointer pos = this->find_node_impl(k, itb);
-
-          if (pos) {
-            return emplace_return(iterator(pos, itb), false);
-          }
-
-          node_tmp b(
-            boost::unordered::detail::func::construct_node_pair_from_args(
-              this->node_alloc(), k, std::forward<Args>(args)...),
-            this->node_alloc());
-
-          if (size_ + 1 > max_load_) {
-            reserve(size_ + 1);
-            itb = buckets_.at(buckets_.position(key_hash));
-          }
-
-          pos = b.release();
-
-          buckets_.insert_node(itb, pos);
-          ++size_;
-          return emplace_return(iterator(pos, itb), true);
-        }
-
-        template <typename Key, typename... Args>
-        iterator try_emplace_hint_unique(
-          c_iterator hint, Key&& k, Args&&... args)
-        {
-          if (hint.p && this->key_eq()(hint->first, k)) {
-            return iterator(hint.p, hint.itb);
-          } else {
-            return try_emplace_unique(k, std::forward<Args>(args)...).first;
-          }
-        }
-
-        template <typename Key, typename M>
-        emplace_return insert_or_assign_unique(Key&& k, M&& obj)
-        {
-          std::size_t key_hash = this->hash(k);
-          bucket_iterator itb = buckets_.at(buckets_.position(key_hash));
-
-          node_pointer p = this->find_node_impl(k, itb);
-          if (p) {
-            p->value().second = std::forward<M>(obj);
-            return emplace_return(iterator(p, itb), false);
-          }
-
-          node_tmp b(
-            boost::unordered::detail::func::construct_node_pair(
-              this->node_alloc(), std::forward<Key>(k), std::forward<M>(obj)),
-            node_alloc());
-
-          if (size_ + 1 > max_load_) {
-            reserve(size_ + 1);
-            itb = buckets_.at(buckets_.position(key_hash));
-          }
-
-          p = b.release();
-
-          buckets_.insert_node(itb, p);
-          ++size_;
-          return emplace_return(iterator(p, itb), true);
-        }
-
-        template <typename NodeType, typename InsertReturnType>
-        void move_insert_node_type_unique(
-          NodeType& np, InsertReturnType& result)
-        {
-          if (!np) {
-            result.position = this->end();
-            result.inserted = false;
-            return;
-          }
-
-          const_key_type& k = this->get_key(np.ptr_);
-          std::size_t const key_hash = this->hash(k);
-          bucket_iterator itb = buckets_.at(buckets_.position(key_hash));
-          node_pointer p = this->find_node_impl(k, itb);
-
-          if (p) {
-            iterator pos(p, itb);
-            result.node = std::move(np);
-            result.position = pos;
-            result.inserted = false;
-            return;
-          }
-
-          this->reserve_for_insert(size_ + 1);
-
-          p = np.ptr_;
-          itb = buckets_.at(buckets_.position(key_hash));
-
-          buckets_.insert_node(itb, p);
-          np.ptr_ = node_pointer();
-          ++size_;
-
-          result.position = iterator(p, itb);
-          result.inserted = true;
-        }
-
-        template <typename NodeType>
-        iterator move_insert_node_type_with_hint_unique(
-          c_iterator hint, NodeType& np)
-        {
-          if (!np) {
-            return this->end();
-          }
-
-          const_key_type& k = this->get_key(np.ptr_);
-          if (hint.p && this->key_eq()(k, this->get_key(hint.p))) {
-            return iterator(hint.p, hint.itb);
-          }
-
-          std::size_t const key_hash = this->hash(k);
-          bucket_iterator itb = buckets_.at(buckets_.position(key_hash));
-          node_pointer p = this->find_node_impl(k, itb);
-          if (p) {
-            return iterator(p, itb);
-          }
-
-          p = np.ptr_;
-
-          if (size_ + 1 > max_load_) {
-            this->reserve(size_ + 1);
-            itb = buckets_.at(buckets_.position(key_hash));
-          }
-
-          buckets_.insert_node(itb, p);
-          ++size_;
-          np.ptr_ = node_pointer();
-          return iterator(p, itb);
-        }
-
-        template <typename Types2>
-        void merge_unique(boost::unordered::detail::table<Types2>& other)
-        {
-          typedef boost::unordered::detail::table<Types2> other_table;
-          BOOST_UNORDERED_STATIC_ASSERT(
-            (std::is_same<node_type, typename other_table::node_type>::value));
-          BOOST_ASSERT(this->node_alloc() == other.node_alloc());
-
-          if (other.size_ == 0) {
-            return;
-          }
-
-          this->reserve_for_insert(size_ + other.size_);
-
-          iterator last = other.end();
-          for (iterator pos = other.begin(); pos != last;) {
-            const_key_type& key = other.get_key(pos.p);
-            std::size_t const key_hash = this->hash(key);
-
-            bucket_iterator itb = buckets_.at(buckets_.position(key_hash));
-
-            if (this->find_node_impl(key, itb)) {
-              ++pos;
-              continue;
-            }
-
-            iterator old = pos;
-            ++pos;
-
-            node_pointer p = other.extract_by_iterator_unique(old);
-            buckets_.insert_node(itb, p);
-            ++size_;
-          }
-        }
-
-        ////////////////////////////////////////////////////////////////////////
-        // Insert range methods
-        //
-        // if hash function throws, or inserting > 1 element, basic exception
-        // safety strong otherwise
-
-        template <class InputIt>
-        void insert_range_unique(no_key, InputIt i, InputIt j)
-        {
-          hasher const& hf = this->hash_function();
-          node_allocator_type alloc = this->node_alloc();
-
-          for (; i != j; ++i) {
-            node_tmp tmp(detail::func::construct_node(alloc, *i), alloc);
-
-            value_type const& value = tmp.node_->value();
-            const_key_type& key = extractor::extract(value);
-            std::size_t const h = hf(key);
-
-            bucket_iterator itb = buckets_.at(buckets_.position(h));
-            node_pointer it = find_node_impl(key, itb);
-            if (it) {
-              continue;
-            }
-
-            if (size_ + 1 > max_load_) {
-              reserve(size_ + 1);
-              itb = buckets_.at(buckets_.position(h));
-            }
-
-            node_pointer nptr = tmp.release();
-            buckets_.insert_node(itb, nptr);
-            ++size_;
-          }
-        }
-
-        ////////////////////////////////////////////////////////////////////////
-        // Extract
-
-        inline node_pointer extract_by_iterator_unique(c_iterator i)
-        {
-          node_pointer p = i.p;
-          bucket_iterator itb = i.itb;
-
-          buckets_.extract_node(itb, p);
-          --size_;
-
-          return p;
-        }
-
-        ////////////////////////////////////////////////////////////////////////
-        // Erase
-        //
-
-        template <class Key> std::size_t erase_key_unique_impl(Key const& k)
-        {
-          bucket_iterator itb = buckets_.at(buckets_.position(this->hash(k)));
-          node_pointer* pp = this->find_prev(k, itb);
-          if (!pp) {
-            return 0;
-          }
-
-          node_pointer p = *pp;
-          buckets_.extract_node_after(itb, pp);
-          this->delete_node(p);
-          --size_;
-          return 1;
-        }
-
-        iterator erase_node(c_iterator pos)
-        {
-          c_iterator next = pos;
-          ++next;
-
-          bucket_iterator itb = pos.itb;
-          node_pointer* pp = std::addressof(itb->next);
-          while (*pp != pos.p) {
-            pp = std::addressof((*pp)->next);
-          }
-
-          buckets_.extract_node_after(itb, pp);
-          this->delete_node(pos.p);
-          --size_;
-
-          return iterator(next.p, next.itb);
-        }
-
-        iterator erase_nodes_range(c_iterator first, c_iterator last)
-        {
-          if (first == last) {
-            return iterator(last.p, last.itb);
-          }
-
-          // though `first` stores of a copy of a pointer to a node, we wish to
-          // mutate the pointers stored internally by the singly-linked list in
-          // each bucket group so we have to retrieve it manually by iterating
-          //
-          bucket_iterator itb = first.itb;
-          node_pointer* pp = std::addressof(itb->next);
-          while (*pp != first.p) {
-            pp = std::addressof((*pp)->next);
-          }
-
-          while (*pp != last.p) {
-            node_pointer p = *pp;
-            *pp = (*pp)->next;
-
-            this->delete_node(p);
-            --size_;
-
-            bool const at_end = !(*pp);
-            bool const is_empty_bucket = !itb->next;
-
-            if (at_end) {
-              if (is_empty_bucket) {
-                buckets_.unlink_bucket(itb++);
-              } else {
-                ++itb;
-              }
-              pp = std::addressof(itb->next);
-            }
-          }
-
-          return iterator(last.p, last.itb);
-        }
-
-        ////////////////////////////////////////////////////////////////////////
-        // fill_buckets_unique
-
-        void copy_buckets(table const& src, std::true_type)
-        {
-          BOOST_ASSERT(size_ == 0);
-
-          this->reserve_for_insert(src.size_);
-
-          for (iterator pos = src.begin(); pos != src.end(); ++pos) {
-            value_type const& value = *pos;
-            const_key_type& key = extractor::extract(value);
-            std::size_t const key_hash = this->hash(key);
-
-            bucket_iterator itb = buckets_.at(buckets_.position(key_hash));
-
-            node_allocator_type alloc = this->node_alloc();
-            node_tmp tmp(detail::func::construct_node(alloc, value), alloc);
-
-            buckets_.insert_node(itb, tmp.release());
-            ++size_;
-          }
-        }
-
-        void move_assign_buckets(table& src, std::true_type)
-        {
-          BOOST_ASSERT(size_ == 0);
-          BOOST_ASSERT(max_load_ >= src.size_);
-
-          iterator last = src.end();
-          node_allocator_type alloc = this->node_alloc();
-
-          for (iterator pos = src.begin(); pos != last; ++pos) {
-            value_type value = std::move(*pos);
-            const_key_type& key = extractor::extract(value);
-            std::size_t const key_hash = this->hash(key);
-
-            bucket_iterator itb = buckets_.at(buckets_.position(key_hash));
-
-            node_tmp tmp(
-              detail::func::construct_node(alloc, std::move(value)), alloc);
-
-            buckets_.insert_node(itb, tmp.release());
-            ++size_;
-          }
-        }
-
-        ////////////////////////////////////////////////////////////////////////
-        // Equivalent keys
-
-        // Equality
-
-        bool equals_equiv(table const& other) const
-        {
-          if (this->size_ != other.size_)
-            return false;
-
-          iterator last = this->end();
-          for (iterator n1 = this->begin(); n1 != last;) {
-            const_key_type& k = extractor::extract(*n1);
-            iterator n2 = other.find(k);
-            if (n2 == other.end()) {
-              return false;
-            }
-
-            iterator end1 = this->next_group(k, n1);
-            iterator end2 = other.next_group(k, n2);
-
-            if (!group_equals_equiv(n1, end1, n2, end2)) {
-              return false;
-            }
-
-            n1 = end1;
-          }
-
-          return true;
-        }
-
-        static bool group_equals_equiv(
-          iterator n1, iterator end1, iterator n2, iterator end2)
-        {
-          for (;;) {
-            if (*n1 != *n2)
-              break;
-
-            ++n1;
-            ++n2;
-
-            if (n1 == end1)
-              return n2 == end2;
-
-            if (n2 == end2)
-              return false;
-          }
-
-          for (iterator n1a = n1, n2a = n2;;) {
-            ++n1a;
-            ++n2a;
-
-            if (n1a == end1) {
-              if (n2a == end2)
-                break;
-              else
-                return false;
-            }
-
-            if (n2a == end2)
-              return false;
-          }
-
-          iterator start = n1;
-          for (; n1 != end1; ++n1) {
-            value_type const& v = *n1;
-            if (!find_equiv(start, n1, v)) {
-              std::size_t matches = count_equal_equiv(n2, end2, v);
-              if (!matches)
-                return false;
-
-              iterator t = n1;
-              if (matches != 1 + count_equal_equiv(++t, end1, v))
-                return false;
-            }
-          }
-
-          return true;
-        }
-
-        static bool find_equiv(iterator n, iterator last, value_type const& v)
-        {
-          for (; n != last; ++n)
-            if (*n == v)
-              return true;
-          return false;
-        }
-
-        static std::size_t count_equal_equiv(
-          iterator n, iterator last, value_type const& v)
-        {
-          std::size_t count = 0;
-          for (; n != last; ++n)
-            if (*n == v)
-              ++count;
-          return count;
-        }
-
-        // Emplace/Insert
-
-        iterator emplace_equiv(node_pointer n)
-        {
-          node_tmp a(n, this->node_alloc());
-          const_key_type& k = this->get_key(a.node_);
-          std::size_t key_hash = this->hash(k);
-          bucket_iterator itb = buckets_.at(buckets_.position(key_hash));
-          node_pointer hint = this->find_node_impl(k, itb);
-
-          if (size_ + 1 > max_load_) {
-            this->reserve(size_ + 1);
-            itb = buckets_.at(buckets_.position(key_hash));
-          }
-          node_pointer p = a.release();
-          buckets_.insert_node_hint(itb, p, hint);
-          ++size_;
-          return iterator(p, itb);
-        }
-
-        iterator emplace_hint_equiv(c_iterator hint, node_pointer n)
-        {
-          node_tmp a(n, this->node_alloc());
-          const_key_type& k = this->get_key(a.node_);
-          bucket_iterator itb = hint.itb;
-          node_pointer p = hint.p;
-
-          std::size_t key_hash = 0u;
-
-          bool const needs_rehash = (size_ + 1 > max_load_);
-          bool const usable_hint = (p && this->key_eq()(k, this->get_key(p)));
-
-          if (!usable_hint) {
-            key_hash = this->hash(k);
-            itb = buckets_.at(buckets_.position(key_hash));
-            p = this->find_node_impl(k, itb);
-          } else if (usable_hint && needs_rehash) {
-            key_hash = this->hash(k);
-          }
-
-          if (needs_rehash) {
-            this->reserve(size_ + 1);
-            itb = buckets_.at(buckets_.position(key_hash));
-          }
-
-          a.release();
-          buckets_.insert_node_hint(itb, n, p);
-          ++size_;
-          return iterator(n, itb);
-        }
-
-        void emplace_no_rehash_equiv(node_pointer n)
-        {
-          BOOST_ASSERT(size_ + 1 <= max_load_);
-          node_tmp a(n, this->node_alloc());
-          const_key_type& k = this->get_key(a.node_);
-          std::size_t key_hash = this->hash(k);
-          bucket_iterator itb = buckets_.at(buckets_.position(key_hash));
-          node_pointer hint = this->find_node_impl(k, itb);
-          node_pointer p = a.release();
-          buckets_.insert_node_hint(itb, p, hint);
-          ++size_;
-        }
-
-        template <typename NodeType>
-        iterator move_insert_node_type_equiv(NodeType& np)
-        {
-          iterator result;
-
-          if (np) {
-            this->reserve_for_insert(size_ + 1);
-
-            const_key_type& k = this->get_key(np.ptr_);
-            std::size_t key_hash = this->hash(k);
-
-            bucket_iterator itb = buckets_.at(buckets_.position(key_hash));
-
-            node_pointer hint = this->find_node_impl(k, itb);
-            buckets_.insert_node_hint(itb, np.ptr_, hint);
-            ++size_;
-
-            result = iterator(np.ptr_, itb);
-            np.ptr_ = node_pointer();
-          }
-
-          return result;
-        }
-
-        template <typename NodeType>
-        iterator move_insert_node_type_with_hint_equiv(
-          c_iterator hint, NodeType& np)
-        {
-          iterator result;
-          if (np) {
-            bucket_iterator itb = hint.itb;
-            node_pointer pos = hint.p;
-            const_key_type& k = this->get_key(np.ptr_);
-            std::size_t key_hash = this->hash(k);
-            if (size_ + 1 > max_load_) {
-              this->reserve(size_ + 1);
-              itb = buckets_.at(buckets_.position(key_hash));
-            }
-
-            if (hint.p && this->key_eq()(k, this->get_key(hint.p))) {
-            } else {
-              itb = buckets_.at(buckets_.position(key_hash));
-              pos = this->find_node_impl(k, itb);
-            }
-            buckets_.insert_node_hint(itb, np.ptr_, pos);
-            ++size_;
-            result = iterator(np.ptr_, itb);
-
-            np.ptr_ = node_pointer();
-          }
-
-          return result;
-        }
-
-        ////////////////////////////////////////////////////////////////////////
-        // Insert range methods
-
-        // if hash function throws, or inserting > 1 element, basic exception
-        // safety. Strong otherwise
-        template <class I>
-        typename boost::unordered::detail::enable_if_forward<I, void>::type
-        insert_range_equiv(I i, I j)
-        {
-          if (i == j)
-            return;
-
-          std::size_t distance = static_cast<std::size_t>(std::distance(i, j));
-          if (distance == 1) {
-            emplace_equiv(boost::unordered::detail::func::construct_node(
-              this->node_alloc(), *i));
-          } else {
-            // Only require basic exception safety here
-            this->reserve_for_insert(size_ + distance);
-
-            for (; i != j; ++i) {
-              emplace_no_rehash_equiv(
-                boost::unordered::detail::func::construct_node(
-                  this->node_alloc(), *i));
-            }
-          }
-        }
-
-        template <class I>
-        typename boost::unordered::detail::disable_if_forward<I, void>::type
-        insert_range_equiv(I i, I j)
-        {
-          for (; i != j; ++i) {
-            emplace_equiv(boost::unordered::detail::func::construct_node(
-              this->node_alloc(), *i));
-          }
-        }
-
-        ////////////////////////////////////////////////////////////////////////
-        // Extract
-
-        inline node_pointer extract_by_iterator_equiv(c_iterator n)
-        {
-          node_pointer p = n.p;
-          bucket_iterator itb = n.itb;
-          buckets_.extract_node(itb, p);
-          --size_;
-          return p;
-        }
-
-        ////////////////////////////////////////////////////////////////////////
-        // Erase
-        //
-        // no throw
-
-        template <class Key> std::size_t erase_key_equiv_impl(Key const& k)
-        {
-          std::size_t deleted_count = 0;
-
-          bucket_iterator itb = buckets_.at(buckets_.position(this->hash(k)));
-          node_pointer* pp = this->find_prev(k, itb);
-          if (pp) {
-            while (*pp && this->key_eq()(this->get_key(*pp), k)) {
-              node_pointer p = *pp;
-              *pp = (*pp)->next;
-
-              this->delete_node(p);
-              --size_;
-              ++deleted_count;
-            }
-
-            if (!itb->next) {
-              buckets_.unlink_bucket(itb);
-            }
-          }
-          return deleted_count;
-        }
-
-        std::size_t erase_key_equiv(const_key_type& k)
-        {
-          return this->erase_key_equiv_impl(k);
-        }
-
-        ////////////////////////////////////////////////////////////////////////
-        // fill_buckets
-
-        void copy_buckets(table const& src, std::false_type)
-        {
-          BOOST_ASSERT(size_ == 0);
-
-          this->reserve_for_insert(src.size_);
-
-          iterator last = src.end();
-          for (iterator pos = src.begin(); pos != last; ++pos) {
-            value_type const& value = *pos;
-            const_key_type& key = extractor::extract(value);
-            std::size_t const key_hash = this->hash(key);
-
-            bucket_iterator itb = buckets_.at(buckets_.position(key_hash));
-            node_allocator_type alloc = this->node_alloc();
-            node_tmp tmp(detail::func::construct_node(alloc, value), alloc);
-            node_pointer hint = this->find_node_impl(key, itb);
-            buckets_.insert_node_hint(itb, tmp.release(), hint);
-            ++size_;
-          }
-        }
-
-        void move_assign_buckets(table& src, std::false_type)
-        {
-          BOOST_ASSERT(size_ == 0);
-          BOOST_ASSERT(max_load_ >= src.size_);
-
-          iterator last = src.end();
-          node_allocator_type alloc = this->node_alloc();
-
-          for (iterator pos = src.begin(); pos != last; ++pos) {
-            value_type value = std::move(*pos);
-            const_key_type& key = extractor::extract(value);
-            std::size_t const key_hash = this->hash(key);
-
-            bucket_iterator itb = buckets_.at(buckets_.position(key_hash));
-
-            node_pointer hint = this->find_node_impl(key, itb);
-            node_tmp tmp(
-              detail::func::construct_node(alloc, std::move(value)), alloc);
-
-            buckets_.insert_node_hint(itb, tmp.release(), hint);
-            ++size_;
-          }
-        }
-      };
-
-      //////////////////////////////////////////////////////////////////////////
-      // Clear
-
-      template <typename Types> inline void table<Types>::clear_impl()
-      {
-        bucket_iterator itb = buckets_.begin(), last = buckets_.end();
-        for (; itb != last;) {
-          bucket_iterator next_itb = itb;
-          ++next_itb;
-          node_pointer* pp = std::addressof(itb->next);
-          while (*pp) {
-            node_pointer p = *pp;
-            buckets_.extract_node_after(itb, pp);
-            this->delete_node(p);
-            --size_;
-          }
-          itb = next_itb;
-        }
-      }
-
-      //////////////////////////////////////////////////////////////////////////
-      // Reserve & Rehash
-
-      // if hash function throws, basic exception safety
-      // strong otherwise.
-      template <typename Types>
-      inline void table<Types>::rehash(std::size_t num_buckets)
-      {
-        num_buckets = buckets_.bucket_count_for(
-          (std::max)(min_buckets(size_, mlf_), num_buckets));
-
-        if (num_buckets != this->bucket_count()) {
-          this->rehash_impl(num_buckets);
-        }
-      }
-
-      template <class Types>
-      inline void table<Types>::reserve(std::size_t num_elements)
-      {
-        std::size_t num_buckets = min_buckets(num_elements, mlf_);
-        this->rehash(num_buckets);
-      }
-
-      template <class Types>
-      inline void table<Types>::reserve_for_insert(std::size_t num_elements)
-      {
-        if (num_elements > max_load_) {
-          std::size_t const num_buckets = static_cast<std::size_t>(
-            1.0f + std::ceil(static_cast<float>(num_elements) / mlf_));
-
-          this->rehash_impl(num_buckets);
-        }
-      }
-
-      template <class Types>
-      inline void table<Types>::rehash_impl(std::size_t num_buckets)
-      {
-        bucket_array_type new_buckets(
-          num_buckets, buckets_.get_node_allocator());
-
-        BOOST_TRY
-        {
-          boost::unordered::detail::span<bucket_type> bspan = buckets_.raw();
-
-          bucket_type* pos = bspan.data;
-          std::size_t size = bspan.size;
-          bucket_type* last = pos + size;
-
-          for (; pos != last; ++pos) {
-            bucket_type& b = *pos;
-            for (node_pointer p = b.next; p;) {
-              node_pointer next_p = p->next;
-              transfer_node(p, b, new_buckets);
-              p = next_p;
-              b.next = p;
-            }
-          }
-        }
-        BOOST_CATCH(...)
-        {
-          for (bucket_iterator pos = new_buckets.begin();
-               pos != new_buckets.end(); ++pos) {
-            bucket_type& b = *pos;
-            for (node_pointer p = b.next; p;) {
-              node_pointer next_p = p->next;
-              delete_node(p);
-              --size_;
-              p = next_p;
-            }
-          }
-          buckets_.unlink_empty_buckets();
-          BOOST_RETHROW
-        }
-        BOOST_CATCH_END
-
-        buckets_ = std::move(new_buckets);
-        recalculate_max_load();
-      }
-
-#if defined(BOOST_MSVC)
-#pragma warning(pop)
-#endif
-
-      ////////////////////////////////////////////////////////////////////////
-      // key extractors
-      //
-      // no throw
-      //
-      // 'extract_key' is called with the emplace parameters to return a
-      // key if available or 'no_key' is one isn't and will need to be
-      // constructed. This could be done by overloading the emplace
-      // implementation
-      // for the different cases, but that's a bit tricky on compilers without
-      // variadic templates.
-
-      template <typename Key, typename T> struct is_key
-      {
-        template <typename T2> static choice1::type test(T2 const&);
-        static choice2::type test(Key const&);
-
-        enum
-        {
-          value = sizeof(test(boost::unordered::detail::make<T>())) ==
-                  sizeof(choice2::type)
-        };
-
-        typedef typename std::conditional<value, Key const&, no_key>::type type;
-      };
-
-      template <class ValueType> struct set_extractor
-      {
-        typedef ValueType value_type;
-        typedef ValueType key_type;
-
-        static key_type const& extract(value_type const& v) { return v; }
-
-        static key_type const& extract(value_type&& v) { return v; }
-
-        static no_key extract() { return no_key(); }
-
-        template <class Arg> static no_key extract(Arg const&)
-        {
-          return no_key();
-        }
-
-        template <class Arg1, class Arg2, class... Args>
-        static no_key extract(Arg1 const&, Arg2 const&, Args const&...)
-        {
-          return no_key();
-        }
-      };
-
-      template <class ValueType> struct map_extractor
-      {
-        typedef ValueType value_type;
-        typedef typename std::remove_const<typename boost::unordered::detail::
-            pair_traits<ValueType>::first_type>::type key_type;
-
-        static key_type const& extract(value_type const& v) { return v.first; }
-
-        template <class Second>
-        static key_type const& extract(std::pair<key_type, Second> const& v)
-        {
-          return v.first;
-        }
-
-        template <class Second>
-        static key_type const& extract(
-          std::pair<key_type const, Second> const& v)
-        {
-          return v.first;
-        }
-
-        template <class Arg1>
-        static key_type const& extract(key_type const& k, Arg1 const&)
-        {
-          return k;
-        }
-
-        static no_key extract() { return no_key(); }
-
-        template <class Arg> static no_key extract(Arg const&)
-        {
-          return no_key();
-        }
-
-        template <class Arg1, class Arg2>
-        static no_key extract(Arg1 const&, Arg2 const&)
-        {
-          return no_key();
-        }
-
-        template <class Arg1, class Arg2, class Arg3, class... Args>
-        static no_key extract(
-          Arg1 const&, Arg2 const&, Arg3 const&, Args const&...)
-        {
-          return no_key();
-        }
-
-        template <template <class...> class Tuple, typename T2>
-        static no_key extract(
-          std::piecewise_construct_t, Tuple<> const&, T2 const&)
-        {
-          return no_key();
-        }
-
-        template <template <typename...> class Tuple, typename T, typename T2,
-          typename... Args>
-        static auto extract(
-          std::piecewise_construct_t, Tuple<T, Args...> const& k, T2 const&) ->
-          typename std::enable_if<
-            !std::is_same<T, boost::tuples::null_type>::value,
-            typename is_key<key_type, T>::type>::type
-        {
-          using std::get;
-          return typename is_key<key_type, T>::type(get<0>(k));
-        }
-      };
-
-      template <class Container, class Predicate>
-      typename Container::size_type erase_if(Container& c, Predicate& pred)
-      {
-        typedef typename Container::size_type size_type;
-        typedef typename Container::iterator iterator;
-
-        size_type const size = c.size();
-
-        for (iterator pos = c.begin(), last = c.end(); pos != last;) {
-          if (pred(*pos)) {
-            pos = c.erase(pos);
-          } else {
-            ++pos;
-          }
-        }
-
-        return (size - c.size());
-      }
-    } // namespace detail
-  } // namespace unordered
-} // namespace boost
-
-#endif
diff --git a/src/boost/unordered/detail/map.hpp b/src/boost/unordered/detail/map.hpp
deleted file mode 100644
index ccd2508f..00000000
--- a/src/boost/unordered/detail/map.hpp
+++ /dev/null
@@ -1,61 +0,0 @@
-
-// Copyright (C) 2005-2016 Daniel James
-// Copyright (C) 2022 Christian Mazakas
-// Distributed under the Boost Software License, Version 1.0. (See accompanying
-// file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
-
-#include <boost/unordered/detail/implementation.hpp>
-#include <boost/unordered/unordered_map_fwd.hpp>
-
-namespace boost {
-  namespace unordered {
-    namespace detail {
-      template <typename A, typename K, typename M, typename H, typename P>
-      struct map
-      {
-        typedef boost::unordered::detail::map<A, K, M, H, P> types;
-
-        typedef std::pair<K const, M> value_type;
-        typedef H hasher;
-        typedef P key_equal;
-        typedef K const const_key_type;
-
-        typedef
-          typename ::boost::unordered::detail::rebind_wrap<A, value_type>::type
-            value_allocator;
-        typedef boost::unordered::detail::allocator_traits<value_allocator>
-          value_allocator_traits;
-
-        typedef boost::unordered::detail::table<types> table;
-        typedef boost::unordered::detail::map_extractor<value_type> extractor;
-
-        typedef typename boost::allocator_void_pointer<value_allocator>::type
-          void_pointer;
-
-        typedef boost::unordered::node_handle_map<
-          node<value_type, void_pointer>, K, M, A>
-          node_type;
-
-        typedef typename table::iterator iterator;
-        typedef boost::unordered::insert_return_type_map<iterator, node_type> insert_return_type;
-      };
-
-      template <typename K, typename M, typename H, typename P, typename A>
-      class instantiate_map
-      {
-        typedef boost::unordered_map<K, M, H, P, A> container;
-        container x;
-        typename container::node_type node_type;
-        typename container::insert_return_type insert_return_type;
-      };
-
-      template <typename K, typename M, typename H, typename P, typename A>
-      class instantiate_multimap
-      {
-        typedef boost::unordered_multimap<K, M, H, P, A> container;
-        container x;
-        typename container::node_type node_type;
-      };
-    }
-  }
-}
diff --git a/src/boost/unordered/detail/prime_fmod.hpp b/src/boost/unordered/detail/prime_fmod.hpp
deleted file mode 100644
index 1fe55b8c..00000000
--- a/src/boost/unordered/detail/prime_fmod.hpp
+++ /dev/null
@@ -1,214 +0,0 @@
-// Copyright (C) 2022 Joaquin M Lopez Munoz.
-// Copyright (C) 2022-2023 Christian Mazakas
-//
-// Distributed under the Boost Software License, Version 1.0. (See accompanying
-// file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
-
-#ifndef BOOST_UNORDERED_DETAIL_PRIME_FMOD_HPP
-#define BOOST_UNORDERED_DETAIL_PRIME_FMOD_HPP
-
-#include <boost/unordered/detail/narrow_cast.hpp>
-
-#include <boost/config.hpp>
-#include <boost/cstdint.hpp>
-
-#include <climits>
-#include <cstddef>
-
-#if defined(SIZE_MAX)
-#if ((((SIZE_MAX >> 16) >> 16) >> 16) >> 15) != 0
-#define BOOST_UNORDERED_FCA_HAS_64B_SIZE_T
-#endif
-#elif defined(UINTPTR_MAX) /* used as proxy for std::size_t */
-#if ((((UINTPTR_MAX >> 16) >> 16) >> 16) >> 15) != 0
-#define BOOST_UNORDERED_FCA_HAS_64B_SIZE_T
-#endif
-#endif
-
-#if defined(BOOST_UNORDERED_FCA_HAS_64B_SIZE_T) && defined(_MSC_VER)
-#include <intrin.h>
-#endif
-
-namespace boost {
-  namespace unordered {
-    namespace detail {
-      template <class = void> struct prime_fmod_size
-      {
-        constexpr static std::size_t const sizes[] = {13ul, 29ul, 53ul, 97ul,
-          193ul, 389ul, 769ul, 1543ul, 3079ul, 6151ul, 12289ul, 24593ul,
-          49157ul, 98317ul, 196613ul, 393241ul, 786433ul, 1572869ul, 3145739ul,
-          6291469ul, 12582917ul, 25165843ul, 50331653ul, 100663319ul,
-          201326611ul, 402653189ul, 805306457ul, 1610612741ul, 3221225473ul,
-#if !defined(BOOST_UNORDERED_FCA_HAS_64B_SIZE_T)
-          4294967291ul
-#else
-          6442450939ull, 12884901893ull, 25769803751ull, 51539607551ull,
-          103079215111ull, 206158430209ull, 412316860441ull, 824633720831ull,
-          1649267441651ull
-#endif
-        };
-
-        constexpr static std::size_t const sizes_len =
-          sizeof(sizes) / sizeof(sizes[0]);
-
-#if defined(BOOST_UNORDERED_FCA_HAS_64B_SIZE_T)
-        constexpr static boost::uint64_t const inv_sizes32[] = {
-          1418980313362273202ull, 636094623231363849ull, 348051774975651918ull,
-          190172619316593316ull, 95578984837873325ull, 47420935922132524ull,
-          23987963684927896ull, 11955116055547344ull, 5991147799191151ull,
-          2998982941588287ull, 1501077717772769ull, 750081082979285ull,
-          375261795343686ull, 187625172388393ull, 93822606204624ull,
-          46909513691883ull, 23456218233098ull, 11728086747027ull,
-          5864041509391ull, 2932024948977ull, 1466014921160ull, 733007198436ull,
-          366503839517ull, 183251896093ull, 91625960335ull, 45812983922ull,
-          22906489714ull, 11453246088ull, 5726623060ull};
-
-        constexpr static std::size_t const inv_sizes32_len =
-          sizeof(inv_sizes32) / sizeof(inv_sizes32[0]);
-#endif /* defined(BOOST_UNORDERED_FCA_HAS_64B_SIZE_T) */
-
-        template <std::size_t SizeIndex, std::size_t Size = sizes[SizeIndex]>
-        static std::size_t position(std::size_t hash)
-        {
-          return hash % Size;
-        }
-
-        constexpr static std::size_t (*positions[])(std::size_t) = {
-#if !defined(BOOST_UNORDERED_FCA_HAS_64B_SIZE_T)
-          position<0, sizes[0]>,
-          position<1, sizes[1]>,
-          position<2, sizes[2]>,
-          position<3, sizes[3]>,
-          position<4, sizes[4]>,
-          position<5, sizes[5]>,
-          position<6, sizes[6]>,
-          position<7, sizes[7]>,
-          position<8, sizes[8]>,
-          position<9, sizes[9]>,
-          position<10, sizes[10]>,
-          position<11, sizes[11]>,
-          position<12, sizes[12]>,
-          position<13, sizes[13]>,
-          position<14, sizes[14]>,
-          position<15, sizes[15]>,
-          position<16, sizes[16]>,
-          position<17, sizes[17]>,
-          position<18, sizes[18]>,
-          position<19, sizes[19]>,
-          position<20, sizes[20]>,
-          position<21, sizes[21]>,
-          position<22, sizes[22]>,
-          position<23, sizes[23]>,
-          position<24, sizes[24]>,
-          position<25, sizes[25]>,
-          position<26, sizes[26]>,
-          position<27, sizes[27]>,
-          position<28, sizes[28]>,
-          position<29, sizes[29]>,
-#else
-          position<29, sizes[29]>,
-          position<30, sizes[30]>,
-          position<31, sizes[31]>,
-          position<32, sizes[32]>,
-          position<33, sizes[33]>,
-          position<34, sizes[34]>,
-          position<35, sizes[35]>,
-          position<36, sizes[36]>,
-          position<37, sizes[37]>,
-#endif
-        };
-
-        static inline std::size_t size_index(std::size_t n)
-        {
-          std::size_t i = 0;
-          for (; i < (sizes_len - 1); ++i) {
-            if (sizes[i] >= n) {
-              break;
-            }
-          }
-          return i;
-        }
-
-        static inline std::size_t size(std::size_t size_index)
-        {
-          return sizes[size_index];
-        }
-
-#if defined(BOOST_UNORDERED_FCA_HAS_64B_SIZE_T)
-        // We emulate the techniques taken from:
-        // Faster Remainder by Direct Computation: Applications to Compilers and
-        // Software Libraries
-        // https://arxiv.org/abs/1902.01961
-        //
-        // In essence, use fancy math to directly calculate the remainder (aka
-        // modulo) exploiting how compilers transform division
-        //
-
-        static inline boost::uint64_t get_remainder(
-          boost::uint64_t fractional, boost::uint32_t d)
-        {
-#if defined(_MSC_VER)
-          // use MSVC intrinsics when available to avoid promotion to 128 bits
-
-          return __umulh(fractional, d);
-#elif defined(BOOST_HAS_INT128)
-          return static_cast<boost::uint64_t>(
-            ((boost::uint128_type)fractional * d) >> 64);
-#else
-          // portable implementation in the absence of boost::uint128_type on 64
-          // bits, which happens at least in GCC 4.5 and prior
-
-          boost::uint64_t r1 = (fractional & UINT32_MAX) * d;
-          boost::uint64_t r2 = (fractional >> 32) * d;
-          r2 += r1 >> 32;
-          return r2 >> 32;
-#endif /* defined(_MSC_VER) */
-        }
-
-        static inline boost::uint32_t fast_modulo(
-          boost::uint32_t a, boost::uint64_t M, boost::uint32_t d)
-        {
-          boost::uint64_t fractional = M * a;
-          return (boost::uint32_t)(get_remainder(fractional, d));
-        }
-#endif /* defined(BOOST_UNORDERED_FCA_HAS_64B_SIZE_T) */
-
-        static inline std::size_t position(
-          std::size_t hash, std::size_t size_index)
-        {
-#if defined(BOOST_UNORDERED_FCA_HAS_64B_SIZE_T)
-          std::size_t sizes_under_32bit = inv_sizes32_len;
-          if (BOOST_LIKELY(size_index < sizes_under_32bit)) {
-            return fast_modulo(narrow_cast<boost::uint32_t>(hash) +
-                                 narrow_cast<boost::uint32_t>(hash >> 32),
-              inv_sizes32[size_index], boost::uint32_t(sizes[size_index]));
-          } else {
-            return positions[size_index - sizes_under_32bit](hash);
-          }
-#else
-          return positions[size_index](hash);
-#endif /* defined(BOOST_UNORDERED_FCA_HAS_64B_SIZE_T) */
-        }
-      }; // prime_fmod_size
-
-#if defined(BOOST_NO_CXX17_INLINE_VARIABLES)
-      // https://en.cppreference.com/w/cpp/language/static#Constant_static_members
-      // If a const non-inline (since C++17) static data member or a constexpr
-      // static data member (since C++11)(until C++17) is odr-used, a definition
-      // at namespace scope is still required, but it cannot have an
-      // initializer.
-      template <class T> constexpr std::size_t prime_fmod_size<T>::sizes[];
-
-#if defined(BOOST_UNORDERED_FCA_HAS_64B_SIZE_T)
-      template <class T>
-      constexpr boost::uint64_t prime_fmod_size<T>::inv_sizes32[];
-#endif
-
-      template <class T>
-      constexpr std::size_t (*prime_fmod_size<T>::positions[])(std::size_t);
-#endif
-    } // namespace detail
-  } // namespace unordered
-} // namespace boost
-
-#endif // BOOST_UNORDERED_DETAIL_PRIME_FMOD_HPP
diff --git a/src/boost/unordered/detail/serialize_container.hpp b/src/boost/unordered/detail/serialize_container.hpp
deleted file mode 100644
index ea84f85a..00000000
--- a/src/boost/unordered/detail/serialize_container.hpp
+++ /dev/null
@@ -1,204 +0,0 @@
-/* Copyright 2023 Joaquin M Lopez Munoz.
- * Distributed under the Boost Software License, Version 1.0.
- * (See accompanying file LICENSE_1_0.txt or copy at
- * http://www.boost.org/LICENSE_1_0.txt)
- *
- * See https://www.boost.org/libs/unordered for library home page.
- */
-
-#ifndef BOOST_UNORDERED_DETAIL_SERIALIZE_CONTAINER_HPP
-#define BOOST_UNORDERED_DETAIL_SERIALIZE_CONTAINER_HPP
-
-#include <boost/core/serialization.hpp>
-#include <boost/throw_exception.hpp>
-#include <boost/unordered/detail/archive_constructed.hpp>
-#include <boost/unordered/detail/bad_archive_exception.hpp>
-#include <boost/unordered/detail/serialization_version.hpp>
-#include <cstddef>
-
-namespace boost{
-namespace unordered{
-namespace detail{
-
-/* serialize_container(ar,x,v) serializes any of the unordered associative
- * containers in Boost.Unordered. Iterator serialization is also supported
- * through the following protocol: 
- *  - At saving time, for each iterator it in [x.begin(),x.end()),
- *    serialization_track(ar,it) is ADL-called to instruct the archive to
- *    track the positions internally pointed to by the iterator via
- *    track_address().
- *  - At loading time, these addresses are mapped to those of the equivalent
- *    reconstructed positions using again serialization_track(ar,it).
- *  - Serializing an iterator reduces to serializing pointers to previously
- *    tracked addresses via serialize_address().
- */
-
-template<typename Iterator>
-std::pair<Iterator,bool> adapt_insert_return_type(Iterator it)
-{
-  return std::pair<Iterator,bool>(it,true);
-}
-
-template<typename Iterator>
-std::pair<Iterator,bool> adapt_insert_return_type(std::pair<Iterator,bool> p)
-{
-  return p;
-}
-
-template<typename Set,bool IsSaving> struct load_or_save_unordered_set;
-
-template<typename Set> struct load_or_save_unordered_set<Set,true> /* save */
-{
-  template<typename Archive>
-  void operator()(Archive& ar,const Set& x,unsigned int)const
-  {
-    typedef typename Set::value_type     value_type;
-    typedef typename Set::const_iterator const_iterator;
-
-    const std::size_t                       s=x.size();
-    const serialization_version<value_type> value_version;
-
-    ar<<core::make_nvp("count",s);
-    ar<<core::make_nvp("value_version",value_version);
-
-    for(const_iterator first=x.begin(),last=x.end();first!=last;++first){
-      core::save_construct_data_adl(ar,std::addressof(*first),value_version);
-      ar<<core::make_nvp("item",*first);
-      serialization_track(ar,first);
-    }
-  }
-};
-
-template<typename Set> struct load_or_save_unordered_set<Set,false> /* load */
-{
-  template<typename Archive>
-  void operator()(Archive& ar,Set& x,unsigned int)const
-  {
-    typedef typename Set::value_type value_type;
-    typedef typename Set::iterator   iterator;
-
-    std::size_t                       s;
-    serialization_version<value_type> value_version;
-
-    ar>>core::make_nvp("count",s);
-    ar>>core::make_nvp("value_version",value_version);
-
-    x.clear();
-    x.reserve(s); /* critical so that iterator tracking is stable */
-
-    for(std::size_t n=0;n<s;++n){
-      archive_constructed<value_type> value("item",ar,value_version);
-
-      std::pair<iterator,bool> p=adapt_insert_return_type(
-        x.insert(std::move(value.get())));
-      if(!p.second)throw_exception(bad_archive_exception());
-      ar.reset_object_address(
-        std::addressof(*p.first),std::addressof(value.get()));
-      serialization_track(ar,p.first);
-    }
-  }
-};
-
-template<typename Map,bool IsSaving> struct load_or_save_unordered_map;
-
-template<typename Map> struct load_or_save_unordered_map<Map,true> /* save */
-{
-  template<typename Archive>
-  void operator()(Archive& ar,const Map& x,unsigned int)const
-  {
-    typedef typename std::remove_const<
-      typename Map::key_type>::type       key_type;
-    typedef typename std::remove_const<
-      typename Map::mapped_type>::type    mapped_type;
-    typedef typename Map::const_iterator  const_iterator;
-
-    const std::size_t                        s=x.size();
-    const serialization_version<key_type>    key_version;
-    const serialization_version<mapped_type> mapped_version;
-
-    ar<<core::make_nvp("count",s);
-    ar<<core::make_nvp("key_version",key_version);
-    ar<<core::make_nvp("mapped_version",mapped_version);
-
-    for(const_iterator first=x.begin(),last=x.end();first!=last;++first){
-      /* To remain lib-independent from Boost.Serialization and not rely on
-       * the user having included the serialization code for std::pair
-       * (boost/serialization/utility.hpp), we serialize the key and the
-       * mapped value separately.
-       */
-
-      core::save_construct_data_adl(
-        ar,std::addressof(first->first),key_version);
-      ar<<core::make_nvp("key",first->first);
-      core::save_construct_data_adl(
-        ar,std::addressof(first->second),mapped_version);
-      ar<<core::make_nvp("mapped",first->second);
-      serialization_track(ar,first);
-    }
-  }
-};
-
-template<typename Map> struct load_or_save_unordered_map<Map,false> /* load */
-{
-  template<typename Archive>
-  void operator()(Archive& ar,Map& x,unsigned int)const
-  {
-    typedef typename std::remove_const<
-      typename Map::key_type>::type       key_type;
-    typedef typename std::remove_const<
-      typename Map::mapped_type>::type    mapped_type;
-    typedef typename Map::iterator        iterator;
-
-    std::size_t                        s;
-    serialization_version<key_type>    key_version;
-    serialization_version<mapped_type> mapped_version;
-
-    ar>>core::make_nvp("count",s);
-    ar>>core::make_nvp("key_version",key_version);
-    ar>>core::make_nvp("mapped_version",mapped_version);
-
-    x.clear();
-    x.reserve(s); /* critical so that iterator tracking is stable */
-
-    for(std::size_t n=0;n<s;++n){
-      archive_constructed<key_type>    key("key",ar,key_version);
-      archive_constructed<mapped_type> mapped("mapped",ar,mapped_version);
-
-      std::pair<iterator,bool> p=adapt_insert_return_type(
-        x.emplace(std::move(key.get()),std::move(mapped.get())));
-      if(!p.second)throw_exception(bad_archive_exception());
-      ar.reset_object_address(
-        std::addressof(p.first->first),std::addressof(key.get()));
-      ar.reset_object_address(
-        std::addressof(p.first->second),std::addressof(mapped.get()));
-      serialization_track(ar,p.first);
-    }
-  }
-};
-
-template<typename Container,bool IsSet,bool IsSaving>
-struct load_or_save_container;
-  
-template<typename Set,bool IsSaving>
-struct load_or_save_container<Set,true,IsSaving>:
-  load_or_save_unordered_set<Set,IsSaving>{};
-
-template<typename Map,bool IsSaving>
-struct load_or_save_container<Map,false,IsSaving>:
-  load_or_save_unordered_map<Map,IsSaving>{};
-
-template<typename Archive,typename Container>
-void serialize_container(Archive& ar,Container& x,unsigned int version)
-{
-  load_or_save_container<
-    Container,
-    std::is_same<
-      typename Container::key_type,typename Container::value_type>::value,
-    Archive::is_saving::value>()(ar,x,version);
-}
-
-} /* namespace detail */
-} /* namespace unordered */
-} /* namespace boost */
-
-#endif
diff --git a/src/boost/unordered/detail/serialize_fca_container.hpp b/src/boost/unordered/detail/serialize_fca_container.hpp
deleted file mode 100644
index 7555a82e..00000000
--- a/src/boost/unordered/detail/serialize_fca_container.hpp
+++ /dev/null
@@ -1,156 +0,0 @@
-/* Copyright 2023 Joaquin M Lopez Munoz.
- * Distributed under the Boost Software License, Version 1.0.
- * (See accompanying file LICENSE_1_0.txt or copy at
- * http://www.boost.org/LICENSE_1_0.txt)
- *
- * See https://www.boost.org/libs/unordered for library home page.
- */
-
-#ifndef BOOST_UNORDERED_DETAIL_SERIALIZE_FCA_CONTAINER_HPP
-#define BOOST_UNORDERED_DETAIL_SERIALIZE_FCA_CONTAINER_HPP
-
-#include <boost/unordered/detail/serialize_container.hpp>
-
-#if defined(BOOST_UNORDERED_ENABLE_SERIALIZATION_COMPATIBILITY_V0)
-
-#define BOOST_UNORDERED_BLOCK_BOOSTDEP_HEADER \
-  <boost/serialization/archive_input_unordered_map.hpp>
-#include BOOST_UNORDERED_BLOCK_BOOSTDEP_HEADER
-#undef BOOST_UNORDERED_BLOCK_BOOSTDEP_HEADER
-#define BOOST_UNORDERED_BLOCK_BOOSTDEP_HEADER \
-  <boost/serialization/archive_input_unordered_set.hpp>
-#include BOOST_UNORDERED_BLOCK_BOOSTDEP_HEADER
-#undef BOOST_UNORDERED_BLOCK_BOOSTDEP_HEADER
-#define BOOST_UNORDERED_BLOCK_BOOSTDEP_HEADER \
-  <boost/serialization/unordered_collections_load_imp.hpp>
-#include BOOST_UNORDERED_BLOCK_BOOSTDEP_HEADER
-#undef BOOST_UNORDERED_BLOCK_BOOSTDEP_HEADER
-#define BOOST_UNORDERED_BLOCK_BOOSTDEP_HEADER \
-  <boost/serialization/utility.hpp>
-#include BOOST_UNORDERED_BLOCK_BOOSTDEP_HEADER
-#undef BOOST_UNORDERED_BLOCK_BOOSTDEP_HEADER
-
-#include <boost/unordered/unordered_map_fwd.hpp>
-#include <boost/unordered/unordered_set_fwd.hpp>
-
-#else
-
-#include <boost/throw_exception.hpp>
-#include <stdexcept>
-
-#endif
-
-namespace boost{
-namespace unordered{
-namespace detail{
-
-/* Support for boost::unordered_[multi](map|set) loading from legacy archives.
- * Until Boost 1.84, serialization of these containers was provided from
- * Boost.Serialization via boost/serialization/boost_unordered_(map|set).hpp,
- * from that release on support is native in Boost.Unordered. To enable legacy
- * archive loading, BOOST_UNORDERED_ENABLE_SERIALIZATION_COMPATIBILITY_V0
- * must be defined (it implies header dependency from Boost.Serialization).
- */
-
-#if defined(BOOST_UNORDERED_ENABLE_SERIALIZATION_COMPATIBILITY_V0)
-
-template<typename Archive,typename Container>
-struct archive_input;
-
-template<
-  typename Archive,typename K,typename T,typename H,typename P,typename A
->
-struct archive_input<Archive,boost::unordered_map<K,T,H,P,A> >:
-  boost::serialization::stl::archive_input_unordered_map<
-    Archive,
-    boost::unordered_map<K,T,H,P,A>
-  >
-{};
-
-template<
-  typename Archive,typename K,typename T,typename H,typename P,typename A
->
-struct archive_input<Archive,boost::unordered_multimap<K,T,H,P,A> >:
-  boost::serialization::stl::archive_input_unordered_multimap<
-    Archive,
-    boost::unordered_multimap<K,T,H,P,A>
-  >
-{};
-
-template<
-  typename Archive,typename K,typename H,typename P,typename A
->
-struct archive_input<Archive,boost::unordered_set<K,H,P,A> >:
-  boost::serialization::stl::archive_input_unordered_set<
-    Archive,
-    boost::unordered_set<K,H,P,A>
-  >
-{};
-
-template<
-  typename Archive,typename K,typename H,typename P,typename A
->
-struct archive_input<Archive,boost::unordered_multiset<K,H,P,A> >:
-  boost::serialization::stl::archive_input_unordered_multiset<
-    Archive,
-    boost::unordered_multiset<K,H,P,A>
-  >
-{};
-
-#else
-
-struct legacy_archive_exception:std::runtime_error
-{
-  legacy_archive_exception():std::runtime_error(
-    "Legacy archive detected, define "
-    "BOOST_UNORDERED_ENABLE_SERIALIZATION_COMPATIBILITY_V0 to load"){}
-};
-
-#endif
-
-template<typename Container,bool IsSaving>
-struct load_or_save_fca_container;
-
-template<typename Container>
-struct load_or_save_fca_container<Container,true> /* save */
-{
-  template<typename Archive>
-  void operator()(Archive& ar,Container& x,unsigned int version)const
-  {
-    serialize_container(ar,x,version);
-  }
-};
-
-template<typename Container>
-struct load_or_save_fca_container<Container,false> /* load */
-{
-  template<typename Archive>
-  void operator()(Archive& ar,Container& x,unsigned int version)const
-  {
-    if(version==0){
-#if defined(BOOST_UNORDERED_ENABLE_SERIALIZATION_COMPATIBILITY_V0)
-      boost::serialization::stl::load_unordered_collection<
-        Archive,Container,archive_input<Archive,Container>
-      >(ar,x);
-#else
-      throw_exception(legacy_archive_exception());
-#endif
-    }
-    else{
-      serialize_container(ar,x,version);
-    }
-  }
-};
-
-template<typename Archive,typename Container>
-void serialize_fca_container(Archive& ar,Container& x,unsigned int version)
-{
-  load_or_save_fca_container<Container,Archive::is_saving::value>()(
-    ar,x,version);
-}
-
-} /* namespace detail */
-} /* namespace unordered */
-} /* namespace boost */
-
-#endif
diff --git a/src/boost/unordered/detail/serialize_tracked_address.hpp b/src/boost/unordered/detail/serialize_tracked_address.hpp
deleted file mode 100644
index 36faaa94..00000000
--- a/src/boost/unordered/detail/serialize_tracked_address.hpp
+++ /dev/null
@@ -1,104 +0,0 @@
-/* Copyright 2023 Joaquin M Lopez Munoz.
- * Distributed under the Boost Software License, Version 1.0.
- * (See accompanying file LICENSE_1_0.txt or copy at
- * http://www.boost.org/LICENSE_1_0.txt)
- *
- * See https://www.boost.org/libs/unordered for library home page.
- */
-
-#ifndef BOOST_UNORDERED_DETAIL_SERIALIZE_TRACKED_ADDRESS_HPP
-#define BOOST_UNORDERED_DETAIL_SERIALIZE_TRACKED_ADDRESS_HPP
-
-#include <boost/unordered/detail/bad_archive_exception.hpp>
-
-#include <boost/core/pointer_traits.hpp>
-#include <boost/core/serialization.hpp>
-#include <boost/throw_exception.hpp>
-
-#include <type_traits>
-
-namespace boost{
-namespace unordered{
-namespace detail{
-
-/* Tracked address serialization to support iterator serialization as described
- * in serialize_container.hpp. The underlying technique is to reinterpret_cast
- * T pointers to serialization_tracker<T> pointers, which, when dereferenced
- * and serialized, do not emit any serialization payload to the
- * archive, but activate object tracking on the relevant addresses for later
- * use with serialize_tracked_address().
- */
-
-template<typename T>
-struct serialization_tracker
-{
-  /* An attempt to construct a serialization_tracker means a stray address
-   * in the archive, that is, one without a previously tracked address.
-   */
-  serialization_tracker(){throw_exception(bad_archive_exception());}
-
-  template<typename Archive>
-  void serialize(Archive&,unsigned int){} /* no data emitted */
-};
-
-template<typename Archive,typename Ptr>
-void track_address(Archive& ar,Ptr p)
-{
-  typedef typename boost::pointer_traits<Ptr> ptr_traits;
-  typedef typename std::remove_const<
-    typename ptr_traits::element_type>::type  element_type;
-
-  if(p){
-    ar&core::make_nvp(
-      "address",
-      *reinterpret_cast<serialization_tracker<element_type>*>(
-        const_cast<element_type*>(
-          boost::to_address(p))));
-  }
-}
-
-template<typename Archive,typename Ptr>
-void serialize_tracked_address(Archive& ar,Ptr& p,std::true_type /* save */)
-{
-  typedef typename boost::pointer_traits<Ptr> ptr_traits;
-  typedef typename std::remove_const<
-    typename ptr_traits::element_type>::type  element_type;
-  typedef serialization_tracker<element_type> tracker;
-
-  tracker* pt=
-    const_cast<tracker*>(
-      reinterpret_cast<const tracker*>(
-        const_cast<const element_type*>(
-          boost::to_address(p))));
-  ar<<core::make_nvp("pointer",pt);
-}
-
-template<typename Archive,typename Ptr>
-void serialize_tracked_address(Archive& ar,Ptr& p,std::false_type /* load */)
-{
-  typedef typename boost::pointer_traits<Ptr> ptr_traits;
-  typedef typename std::remove_const<
-    typename ptr_traits::element_type>::type  element_type;
-  typedef serialization_tracker<element_type> tracker;
-
-  tracker* pt;
-  ar>>core::make_nvp("pointer",pt);
-  element_type* pn=const_cast<element_type*>(
-    reinterpret_cast<const element_type*>(
-      const_cast<const tracker*>(pt)));
-  p=pn?ptr_traits::pointer_to(*pn):0;
-}
-
-template<typename Archive,typename Ptr>
-void serialize_tracked_address(Archive& ar,Ptr& p)
-{
-  serialize_tracked_address(
-    ar,p,
-    std::integral_constant<bool,Archive::is_saving::value>());
-}
-
-} /* namespace detail */
-} /* namespace unordered */
-} /* namespace boost */
-
-#endif
diff --git a/src/boost/unordered/unordered_map.hpp b/src/boost/unordered/unordered_map.hpp
deleted file mode 100644
index ba10a970..00000000
--- a/src/boost/unordered/unordered_map.hpp
+++ /dev/null
@@ -1,2350 +0,0 @@
-// Copyright (C) 2003-2004 Jeremy B. Maitin-Shepard.
-// Copyright (C) 2005-2011 Daniel James.
-// Copyright (C) 2022-2023 Christian Mazakas
-// Distributed under the Boost 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/unordered for documentation
-
-#ifndef BOOST_UNORDERED_UNORDERED_MAP_HPP_INCLUDED
-#define BOOST_UNORDERED_UNORDERED_MAP_HPP_INCLUDED
-
-#include <boost/config.hpp>
-#if defined(BOOST_HAS_PRAGMA_ONCE)
-#pragma once
-#endif
-
-#include <boost/unordered/detail/map.hpp>
-#include <boost/unordered/detail/serialize_fca_container.hpp>
-#include <boost/unordered/detail/type_traits.hpp>
-
-#include <boost/container_hash/hash.hpp>
-
-#include <initializer_list>
-
-#if defined(BOOST_MSVC)
-#pragma warning(push)
-// conditional expression is constant
-#pragma warning(disable : 4127)
-#if BOOST_MSVC >= 1400
-// the inline specifier cannot be used when a friend declaration refers to a
-// specialization of a function template
-#pragma warning(disable : 4396)
-#endif
-#endif
-
-namespace boost {
-  namespace unordered {
-    template <class K, class T, class H, class P, class A> class unordered_map
-    {
-      template <typename, typename, typename, typename, typename>
-      friend class unordered_multimap;
-
-    public:
-      typedef K key_type;
-      typedef T mapped_type;
-      typedef std::pair<const K, T> value_type;
-      typedef typename boost::unordered::detail::type_identity<H>::type hasher;
-      typedef
-        typename boost::unordered::detail::type_identity<P>::type key_equal;
-      typedef typename boost::unordered::detail::type_identity<A>::type
-        allocator_type;
-
-    private:
-      typedef boost::unordered::detail::map<A, K, T, H, P> types;
-      typedef typename types::value_allocator_traits value_allocator_traits;
-      typedef typename types::table table;
-
-    public:
-      typedef typename value_allocator_traits::pointer pointer;
-      typedef typename value_allocator_traits::const_pointer const_pointer;
-
-      typedef value_type& reference;
-      typedef value_type const& const_reference;
-
-      typedef std::size_t size_type;
-      typedef std::ptrdiff_t difference_type;
-
-      typedef typename table::iterator iterator;
-      typedef typename table::c_iterator const_iterator;
-      typedef typename table::l_iterator local_iterator;
-      typedef typename table::cl_iterator const_local_iterator;
-      typedef typename types::node_type node_type;
-      typedef typename types::insert_return_type insert_return_type;
-
-    private:
-      table table_;
-
-    public:
-      // constructors
-
-      unordered_map();
-
-      explicit unordered_map(size_type, const hasher& = hasher(),
-        const key_equal& = key_equal(),
-        const allocator_type& = allocator_type());
-
-      template <class InputIt>
-      unordered_map(InputIt, InputIt,
-        size_type = boost::unordered::detail::default_bucket_count,
-        const hasher& = hasher(), const key_equal& = key_equal(),
-        const allocator_type& = allocator_type());
-
-      unordered_map(unordered_map const&);
-
-      unordered_map(unordered_map&& other)
-        noexcept(table::nothrow_move_constructible)
-          : table_(other.table_, boost::unordered::detail::move_tag())
-      {
-        // The move is done in table_
-      }
-
-      explicit unordered_map(allocator_type const&);
-
-      unordered_map(unordered_map const&, allocator_type const&);
-
-      unordered_map(unordered_map&&, allocator_type const&);
-
-      unordered_map(std::initializer_list<value_type>,
-        size_type = boost::unordered::detail::default_bucket_count,
-        const hasher& = hasher(), const key_equal& l = key_equal(),
-        const allocator_type& = allocator_type());
-
-      explicit unordered_map(size_type, const allocator_type&);
-
-      explicit unordered_map(size_type, const hasher&, const allocator_type&);
-
-      template <class InputIterator>
-      unordered_map(InputIterator, InputIterator, const allocator_type&);
-
-      template <class InputIt>
-      unordered_map(InputIt, InputIt, size_type, const allocator_type&);
-
-      template <class InputIt>
-      unordered_map(
-        InputIt, InputIt, size_type, const hasher&, const allocator_type&);
-
-      unordered_map(std::initializer_list<value_type>, const allocator_type&);
-
-      unordered_map(
-        std::initializer_list<value_type>, size_type, const allocator_type&);
-
-      unordered_map(std::initializer_list<value_type>, size_type, const hasher&,
-        const allocator_type&);
-
-      // Destructor
-
-      ~unordered_map() noexcept;
-
-      // Assign
-
-      unordered_map& operator=(unordered_map const& x)
-      {
-        table_.assign(x.table_, std::true_type());
-        return *this;
-      }
-
-      unordered_map& operator=(unordered_map&& x)
-        noexcept(value_allocator_traits::is_always_equal::value&&
-            std::is_nothrow_move_assignable<H>::value&&
-              std::is_nothrow_move_assignable<P>::value)
-      {
-        table_.move_assign(x.table_, std::true_type());
-        return *this;
-      }
-
-      unordered_map& operator=(std::initializer_list<value_type>);
-
-      allocator_type get_allocator() const noexcept
-      {
-        return table_.node_alloc();
-      }
-
-      //       // iterators
-
-      iterator begin() noexcept { return table_.begin(); }
-
-      const_iterator begin() const noexcept
-      {
-        return const_iterator(table_.begin());
-      }
-
-      iterator end() noexcept { return iterator(); }
-
-      const_iterator end() const noexcept { return const_iterator(); }
-
-      const_iterator cbegin() const noexcept
-      {
-        return const_iterator(table_.begin());
-      }
-
-      const_iterator cend() const noexcept { return const_iterator(); }
-
-      // size and capacity
-
-      BOOST_ATTRIBUTE_NODISCARD bool empty() const noexcept
-      {
-        return table_.size_ == 0;
-      }
-
-      size_type size() const noexcept { return table_.size_; }
-
-      size_type max_size() const noexcept;
-
-      // emplace
-
-      template <class... Args> std::pair<iterator, bool> emplace(Args&&... args)
-      {
-        return table_.emplace_unique(
-          table::extractor::extract(std::forward<Args>(args)...),
-          std::forward<Args>(args)...);
-      }
-
-      template <class... Args>
-      iterator emplace_hint(const_iterator hint, Args&&... args)
-      {
-        return table_.emplace_hint_unique(hint,
-          table::extractor::extract(std::forward<Args>(args)...),
-          std::forward<Args>(args)...);
-      }
-
-      std::pair<iterator, bool> insert(value_type const& x)
-      {
-        return this->emplace(x);
-      }
-
-      std::pair<iterator, bool> insert(value_type&& x)
-      {
-        return this->emplace(std::move(x));
-      }
-
-      template <class P2>
-      typename boost::enable_if<std::is_constructible<value_type, P2&&>,
-        std::pair<iterator, bool> >::type
-      insert(P2&& obj)
-      {
-        return this->emplace(std::forward<P2>(obj));
-      }
-
-      iterator insert(const_iterator hint, value_type const& x)
-      {
-        return this->emplace_hint(hint, x);
-      }
-
-      iterator insert(const_iterator hint, value_type&& x)
-      {
-        return this->emplace_hint(hint, std::move(x));
-      }
-
-      template <class P2>
-      typename boost::enable_if<std::is_constructible<value_type, P2&&>,
-        iterator>::type
-      insert(const_iterator hint, P2&& obj)
-      {
-        return this->emplace_hint(hint, std::forward<P2>(obj));
-      }
-
-      template <class InputIt> void insert(InputIt, InputIt);
-
-      void insert(std::initializer_list<value_type>);
-
-      // extract
-
-      node_type extract(const_iterator position)
-      {
-        return node_type(
-          table_.extract_by_iterator_unique(position), table_.node_alloc());
-      }
-
-      node_type extract(const key_type& k)
-      {
-        return node_type(table_.extract_by_key_impl(k), table_.node_alloc());
-      }
-
-      template <class Key>
-      typename boost::enable_if_c<
-        detail::transparent_non_iterable<Key, unordered_map>::value,
-        node_type>::type
-      extract(Key&& k)
-      {
-        return node_type(table_.extract_by_key_impl(std::forward<Key>(k)),
-          table_.node_alloc());
-      }
-
-      insert_return_type insert(node_type&& np)
-      {
-        insert_return_type result;
-        table_.move_insert_node_type_unique((node_type&)np, result);
-        return result;
-      }
-
-      iterator insert(const_iterator hint, node_type&& np)
-      {
-        return table_.move_insert_node_type_with_hint_unique(hint, np);
-      }
-
-      template <class... Args>
-      std::pair<iterator, bool> try_emplace(key_type const& k, Args&&... args)
-      {
-        return table_.try_emplace_unique(k, std::forward<Args>(args)...);
-      }
-
-      template <class... Args>
-      std::pair<iterator, bool> try_emplace(key_type&& k, Args&&... args)
-      {
-        return table_.try_emplace_unique(
-          std::move(k), std::forward<Args>(args)...);
-      }
-
-      template <class Key, class... Args>
-      typename boost::enable_if_c<
-        detail::transparent_non_iterable<Key, unordered_map>::value,
-        std::pair<iterator, bool> >::type
-      try_emplace(Key&& k, Args&&... args)
-      {
-        return table_.try_emplace_unique(
-          std::forward<Key>(k), std::forward<Args>(args)...);
-      }
-
-      template <class... Args>
-      iterator try_emplace(
-        const_iterator hint, key_type const& k, Args&&... args)
-      {
-        return table_.try_emplace_hint_unique(
-          hint, k, std::forward<Args>(args)...);
-      }
-
-      template <class... Args>
-      iterator try_emplace(const_iterator hint, key_type&& k, Args&&... args)
-      {
-        return table_.try_emplace_hint_unique(
-          hint, std::move(k), std::forward<Args>(args)...);
-      }
-
-      template <class Key, class... Args>
-      typename boost::enable_if_c<
-        detail::transparent_non_iterable<Key, unordered_map>::value,
-        iterator>::type
-      try_emplace(const_iterator hint, Key&& k, Args&&... args)
-      {
-        return table_.try_emplace_hint_unique(
-          hint, std::forward<Key>(k), std::forward<Args>(args)...);
-      }
-
-      template <class M>
-      std::pair<iterator, bool> insert_or_assign(key_type const& k, M&& obj)
-      {
-        return table_.insert_or_assign_unique(k, std::forward<M>(obj));
-      }
-
-      template <class M>
-      std::pair<iterator, bool> insert_or_assign(key_type&& k, M&& obj)
-      {
-        return table_.insert_or_assign_unique(
-          std::move(k), std::forward<M>(obj));
-      }
-
-      template <class Key, class M>
-      typename boost::enable_if_c<detail::are_transparent<Key, H, P>::value,
-        std::pair<iterator, bool> >::type
-      insert_or_assign(Key&& k, M&& obj)
-      {
-        return table_.insert_or_assign_unique(
-          std::forward<Key>(k), std::forward<M>(obj));
-      }
-
-      template <class M>
-      iterator insert_or_assign(const_iterator, key_type const& k, M&& obj)
-      {
-        return table_.insert_or_assign_unique(k, std::forward<M>(obj)).first;
-      }
-
-      template <class M>
-      iterator insert_or_assign(const_iterator, key_type&& k, M&& obj)
-      {
-        return table_
-          .insert_or_assign_unique(std::move(k), std::forward<M>(obj))
-          .first;
-      }
-
-      template <class Key, class M>
-      typename boost::enable_if_c<detail::are_transparent<Key, H, P>::value,
-        iterator>::type
-      insert_or_assign(const_iterator, Key&& k, M&& obj)
-      {
-        return table_
-          .insert_or_assign_unique(std::forward<Key>(k), std::forward<M>(obj))
-          .first;
-      }
-
-      iterator erase(iterator);
-      iterator erase(const_iterator);
-      size_type erase(const key_type&);
-      iterator erase(const_iterator, const_iterator);
-
-      template <class Key>
-      typename boost::enable_if_c<
-        detail::transparent_non_iterable<Key, unordered_map>::value,
-        size_type>::type
-      erase(Key&& k)
-      {
-        return table_.erase_key_unique_impl(std::forward<Key>(k));
-      }
-
-      BOOST_UNORDERED_DEPRECATED("Use erase instead")
-      void quick_erase(const_iterator it) { erase(it); }
-      BOOST_UNORDERED_DEPRECATED("Use erase instead")
-      void erase_return_void(const_iterator it) { erase(it); }
-
-      void swap(unordered_map&)
-        noexcept(value_allocator_traits::is_always_equal::value&&
-            boost::unordered::detail::is_nothrow_swappable<H>::value&&
-              boost::unordered::detail::is_nothrow_swappable<P>::value);
-      void clear() noexcept { table_.clear_impl(); }
-
-      template <typename H2, typename P2>
-      void merge(boost::unordered_map<K, T, H2, P2, A>& source);
-
-      template <typename H2, typename P2>
-      void merge(boost::unordered_map<K, T, H2, P2, A>&& source);
-
-      template <typename H2, typename P2>
-      void merge(boost::unordered_multimap<K, T, H2, P2, A>& source);
-
-      template <typename H2, typename P2>
-      void merge(boost::unordered_multimap<K, T, H2, P2, A>&& source);
-
-      // observers
-
-      hasher hash_function() const;
-      key_equal key_eq() const;
-
-      // lookup
-
-      iterator find(const key_type&);
-      const_iterator find(const key_type&) const;
-
-      template <class Key>
-      typename boost::enable_if_c<detail::are_transparent<Key, H, P>::value,
-        iterator>::type
-      find(const Key& key)
-      {
-        return table_.find(key);
-      }
-
-      template <class Key>
-      typename boost::enable_if_c<detail::are_transparent<Key, H, P>::value,
-        const_iterator>::type
-      find(const Key& key) const
-      {
-        return const_iterator(table_.find(key));
-      }
-
-      template <class CompatibleKey, class CompatibleHash,
-        class CompatiblePredicate>
-      iterator find(CompatibleKey const&, CompatibleHash const&,
-        CompatiblePredicate const&);
-
-      template <class CompatibleKey, class CompatibleHash,
-        class CompatiblePredicate>
-      const_iterator find(CompatibleKey const&, CompatibleHash const&,
-        CompatiblePredicate const&) const;
-
-      bool contains(const key_type& k) const
-      {
-        return table_.find(k) != this->end();
-      }
-
-      template <class Key>
-      typename boost::enable_if_c<detail::are_transparent<Key, H, P>::value,
-        bool>::type
-      contains(const Key& k) const
-      {
-        return table_.find(k) != this->end();
-      }
-
-      size_type count(const key_type&) const;
-
-      template <class Key>
-      typename boost::enable_if_c<detail::are_transparent<Key, H, P>::value,
-        size_type>::type
-      count(const Key& k) const
-      {
-        return (table_.find(k) != this->end() ? 1 : 0);
-      }
-
-      std::pair<iterator, iterator> equal_range(const key_type&);
-      std::pair<const_iterator, const_iterator> equal_range(
-        const key_type&) const;
-
-      template <class Key>
-      typename boost::enable_if_c<detail::are_transparent<Key, H, P>::value,
-        std::pair<iterator, iterator> >::type
-      equal_range(const Key& key)
-      {
-        iterator first = table_.find(key);
-        iterator last = first;
-        if (last != this->end()) {
-          ++last;
-        }
-
-        return std::make_pair(first, last);
-      }
-
-      template <class Key>
-      typename boost::enable_if_c<detail::are_transparent<Key, H, P>::value,
-        std::pair<const_iterator, const_iterator> >::type
-      equal_range(const Key& key) const
-      {
-        iterator first = table_.find(key);
-        iterator last = first;
-        if (last != this->end()) {
-          ++last;
-        }
-
-        return std::make_pair(first, last);
-      }
-
-      mapped_type& operator[](const key_type&);
-      mapped_type& operator[](key_type&&);
-
-      template <class Key>
-      typename boost::enable_if_c<detail::are_transparent<Key, H, P>::value,
-        mapped_type&>::type
-      operator[](Key&& k);
-
-      mapped_type& at(const key_type&);
-      mapped_type const& at(const key_type&) const;
-
-      template <class Key>
-      typename boost::enable_if_c<detail::are_transparent<Key, H, P>::value,
-        mapped_type&>::type
-      at(Key&& k);
-
-      template <class Key>
-      typename boost::enable_if_c<detail::are_transparent<Key, H, P>::value,
-        mapped_type const&>::type
-      at(Key&& k) const;
-
-      // bucket interface
-
-      size_type bucket_count() const noexcept { return table_.bucket_count(); }
-
-      size_type max_bucket_count() const noexcept
-      {
-        return table_.max_bucket_count();
-      }
-
-      size_type bucket_size(size_type) const;
-
-      size_type bucket(const key_type& k) const
-      {
-        return table_.hash_to_bucket(table_.hash(k));
-      }
-
-      template <class Key>
-      typename boost::enable_if_c<detail::are_transparent<Key, H, P>::value,
-        size_type>::type
-      bucket(Key&& k) const
-      {
-        return table_.hash_to_bucket(table_.hash(std::forward<Key>(k)));
-      }
-
-      local_iterator begin(size_type n) { return table_.begin(n); }
-
-      const_local_iterator begin(size_type n) const
-      {
-        return const_local_iterator(table_.begin(n));
-      }
-
-      local_iterator end(size_type) { return local_iterator(); }
-      const_local_iterator end(size_type) const
-      {
-        return const_local_iterator();
-      }
-
-      const_local_iterator cbegin(size_type n) const
-      {
-        return const_local_iterator(table_.begin(n));
-      }
-
-      const_local_iterator cend(size_type) const
-      {
-        return const_local_iterator();
-      }
-
-      // hash policy
-
-      float load_factor() const noexcept;
-      float max_load_factor() const noexcept { return table_.mlf_; }
-      void max_load_factor(float) noexcept;
-      void rehash(size_type);
-      void reserve(size_type);
-
-#if !BOOST_WORKAROUND(BOOST_BORLANDC, < 0x0582)
-      friend bool operator==
-        <K, T, H, P, A>(unordered_map const&, unordered_map const&);
-      friend bool operator!=
-        <K, T, H, P, A>(unordered_map const&, unordered_map const&);
-#endif
-    }; // class template unordered_map
-
-    template <class Archive, class K, class T, class H, class P, class A>
-    void serialize(
-      Archive& ar, unordered_map<K, T, H, P, A>& m, unsigned int version)
-    {
-      detail::serialize_fca_container(ar, m, version);
-    }
-
-#if BOOST_UNORDERED_TEMPLATE_DEDUCTION_GUIDES
-
-    template <class InputIterator,
-      class Hash =
-        boost::hash<boost::unordered::detail::iter_key_t<InputIterator> >,
-      class Pred =
-        std::equal_to<boost::unordered::detail::iter_key_t<InputIterator> >,
-      class Allocator = std::allocator<
-        boost::unordered::detail::iter_to_alloc_t<InputIterator> >,
-      class = std::enable_if_t<detail::is_input_iterator_v<InputIterator> >,
-      class = std::enable_if_t<detail::is_hash_v<Hash> >,
-      class = std::enable_if_t<detail::is_pred_v<Pred> >,
-      class = std::enable_if_t<detail::is_allocator_v<Allocator> > >
-    unordered_map(InputIterator, InputIterator,
-      std::size_t = boost::unordered::detail::default_bucket_count,
-      Hash = Hash(), Pred = Pred(), Allocator = Allocator())
-      -> unordered_map<boost::unordered::detail::iter_key_t<InputIterator>,
-        boost::unordered::detail::iter_val_t<InputIterator>, Hash, Pred,
-        Allocator>;
-
-    template <class Key, class T,
-      class Hash = boost::hash<std::remove_const_t<Key> >,
-      class Pred = std::equal_to<std::remove_const_t<Key> >,
-      class Allocator = std::allocator<std::pair<const Key, T> >,
-      class = std::enable_if_t<detail::is_hash_v<Hash> >,
-      class = std::enable_if_t<detail::is_pred_v<Pred> >,
-      class = std::enable_if_t<detail::is_allocator_v<Allocator> > >
-    unordered_map(std::initializer_list<std::pair<Key, T> >,
-      std::size_t = boost::unordered::detail::default_bucket_count,
-      Hash = Hash(), Pred = Pred(), Allocator = Allocator())
-      -> unordered_map<std::remove_const_t<Key>, T, Hash, Pred, Allocator>;
-
-    template <class InputIterator, class Allocator,
-      class = std::enable_if_t<detail::is_input_iterator_v<InputIterator> >,
-      class = std::enable_if_t<detail::is_allocator_v<Allocator> > >
-    unordered_map(InputIterator, InputIterator, std::size_t, Allocator)
-      -> unordered_map<boost::unordered::detail::iter_key_t<InputIterator>,
-        boost::unordered::detail::iter_val_t<InputIterator>,
-        boost::hash<boost::unordered::detail::iter_key_t<InputIterator> >,
-        std::equal_to<boost::unordered::detail::iter_key_t<InputIterator> >,
-        Allocator>;
-
-    template <class InputIterator, class Allocator,
-      class = std::enable_if_t<detail::is_input_iterator_v<InputIterator> >,
-      class = std::enable_if_t<detail::is_allocator_v<Allocator> > >
-    unordered_map(InputIterator, InputIterator, Allocator)
-      -> unordered_map<boost::unordered::detail::iter_key_t<InputIterator>,
-        boost::unordered::detail::iter_val_t<InputIterator>,
-        boost::hash<boost::unordered::detail::iter_key_t<InputIterator> >,
-        std::equal_to<boost::unordered::detail::iter_key_t<InputIterator> >,
-        Allocator>;
-
-    template <class InputIterator, class Hash, class Allocator,
-      class = std::enable_if_t<detail::is_hash_v<Hash> >,
-      class = std::enable_if_t<detail::is_input_iterator_v<InputIterator> >,
-      class = std::enable_if_t<detail::is_allocator_v<Allocator> > >
-    unordered_map(InputIterator, InputIterator, std::size_t, Hash, Allocator)
-      -> unordered_map<boost::unordered::detail::iter_key_t<InputIterator>,
-        boost::unordered::detail::iter_val_t<InputIterator>, Hash,
-        std::equal_to<boost::unordered::detail::iter_key_t<InputIterator> >,
-        Allocator>;
-
-    template <class Key, class T, class Allocator,
-      class = std::enable_if_t<detail::is_allocator_v<Allocator> > >
-    unordered_map(std::initializer_list<std::pair<Key, T> >, std::size_t,
-      Allocator) -> unordered_map<std::remove_const_t<Key>, T,
-      boost::hash<std::remove_const_t<Key> >,
-      std::equal_to<std::remove_const_t<Key> >, Allocator>;
-
-    template <class Key, class T, class Allocator,
-      class = std::enable_if_t<detail::is_allocator_v<Allocator> > >
-    unordered_map(std::initializer_list<std::pair<Key, T> >, Allocator)
-      -> unordered_map<std::remove_const_t<Key>, T,
-        boost::hash<std::remove_const_t<Key> >,
-        std::equal_to<std::remove_const_t<Key> >, Allocator>;
-
-    template <class Key, class T, class Hash, class Allocator,
-      class = std::enable_if_t<detail::is_hash_v<Hash> >,
-      class = std::enable_if_t<detail::is_allocator_v<Allocator> > >
-    unordered_map(std::initializer_list<std::pair<Key, T> >, std::size_t, Hash,
-      Allocator) -> unordered_map<std::remove_const_t<Key>, T, Hash,
-      std::equal_to<std::remove_const_t<Key> >, Allocator>;
-
-#endif
-
-    template <class K, class T, class H, class P, class A>
-    class unordered_multimap
-    {
-      template <typename, typename, typename, typename, typename>
-      friend class unordered_map;
-
-    public:
-      typedef K key_type;
-      typedef T mapped_type;
-      typedef std::pair<const K, T> value_type;
-      typedef typename boost::unordered::detail::type_identity<H>::type hasher;
-      typedef
-        typename boost::unordered::detail::type_identity<P>::type key_equal;
-      typedef typename boost::unordered::detail::type_identity<A>::type
-        allocator_type;
-
-    private:
-      typedef boost::unordered::detail::map<A, K, T, H, P> types;
-      typedef typename types::value_allocator_traits value_allocator_traits;
-      typedef typename types::table table;
-
-    public:
-      typedef typename value_allocator_traits::pointer pointer;
-      typedef typename value_allocator_traits::const_pointer const_pointer;
-
-      typedef value_type& reference;
-      typedef value_type const& const_reference;
-
-      typedef std::size_t size_type;
-      typedef std::ptrdiff_t difference_type;
-
-      typedef typename table::iterator iterator;
-      typedef typename table::c_iterator const_iterator;
-      typedef typename table::l_iterator local_iterator;
-      typedef typename table::cl_iterator const_local_iterator;
-      typedef typename types::node_type node_type;
-
-    private:
-      table table_;
-
-    public:
-      // constructors
-
-      unordered_multimap();
-
-      explicit unordered_multimap(size_type, const hasher& = hasher(),
-        const key_equal& = key_equal(),
-        const allocator_type& = allocator_type());
-
-      template <class InputIt>
-      unordered_multimap(InputIt, InputIt,
-        size_type = boost::unordered::detail::default_bucket_count,
-        const hasher& = hasher(), const key_equal& = key_equal(),
-        const allocator_type& = allocator_type());
-
-      unordered_multimap(unordered_multimap const&);
-
-      unordered_multimap(unordered_multimap&& other)
-        noexcept(table::nothrow_move_constructible)
-          : table_(other.table_, boost::unordered::detail::move_tag())
-      {
-        // The move is done in table_
-      }
-
-      explicit unordered_multimap(allocator_type const&);
-
-      unordered_multimap(unordered_multimap const&, allocator_type const&);
-
-      unordered_multimap(unordered_multimap&&, allocator_type const&);
-
-      unordered_multimap(std::initializer_list<value_type>,
-        size_type = boost::unordered::detail::default_bucket_count,
-        const hasher& = hasher(), const key_equal& l = key_equal(),
-        const allocator_type& = allocator_type());
-
-      explicit unordered_multimap(size_type, const allocator_type&);
-
-      explicit unordered_multimap(
-        size_type, const hasher&, const allocator_type&);
-
-      template <class InputIterator>
-      unordered_multimap(InputIterator, InputIterator, const allocator_type&);
-
-      template <class InputIt>
-      unordered_multimap(InputIt, InputIt, size_type, const allocator_type&);
-
-      template <class InputIt>
-      unordered_multimap(
-        InputIt, InputIt, size_type, const hasher&, const allocator_type&);
-
-      unordered_multimap(
-        std::initializer_list<value_type>, const allocator_type&);
-
-      unordered_multimap(
-        std::initializer_list<value_type>, size_type, const allocator_type&);
-
-      unordered_multimap(std::initializer_list<value_type>, size_type,
-        const hasher&, const allocator_type&);
-
-      // Destructor
-
-      ~unordered_multimap() noexcept;
-
-      // Assign
-
-      unordered_multimap& operator=(unordered_multimap const& x)
-      {
-        table_.assign(x.table_, std::false_type());
-        return *this;
-      }
-
-      unordered_multimap& operator=(unordered_multimap&& x)
-        noexcept(value_allocator_traits::is_always_equal::value&&
-            std::is_nothrow_move_assignable<H>::value&&
-              std::is_nothrow_move_assignable<P>::value)
-      {
-        table_.move_assign(x.table_, std::false_type());
-        return *this;
-      }
-
-      unordered_multimap& operator=(std::initializer_list<value_type>);
-
-      allocator_type get_allocator() const noexcept
-      {
-        return table_.node_alloc();
-      }
-
-      // iterators
-
-      iterator begin() noexcept { return iterator(table_.begin()); }
-
-      const_iterator begin() const noexcept
-      {
-        return const_iterator(table_.begin());
-      }
-
-      iterator end() noexcept { return iterator(); }
-
-      const_iterator end() const noexcept { return const_iterator(); }
-
-      const_iterator cbegin() const noexcept
-      {
-        return const_iterator(table_.begin());
-      }
-
-      const_iterator cend() const noexcept { return const_iterator(); }
-
-      // size and capacity
-
-      BOOST_ATTRIBUTE_NODISCARD bool empty() const noexcept
-      {
-        return table_.size_ == 0;
-      }
-
-      size_type size() const noexcept { return table_.size_; }
-
-      size_type max_size() const noexcept;
-
-      // emplace
-
-      template <class... Args> iterator emplace(Args&&... args)
-      {
-        return iterator(table_.emplace_equiv(
-          boost::unordered::detail::func::construct_node_from_args(
-            table_.node_alloc(), std::forward<Args>(args)...)));
-      }
-
-      template <class... Args>
-      iterator emplace_hint(const_iterator hint, Args&&... args)
-      {
-        return iterator(table_.emplace_hint_equiv(
-          hint, boost::unordered::detail::func::construct_node_from_args(
-                  table_.node_alloc(), std::forward<Args>(args)...)));
-      }
-
-      iterator insert(value_type const& x) { return this->emplace(x); }
-
-      iterator insert(value_type&& x) { return this->emplace(std::move(x)); }
-
-      template <class P2>
-      typename boost::enable_if<std::is_constructible<value_type, P2&&>,
-        iterator>::type
-      insert(P2&& obj)
-      {
-        return this->emplace(std::forward<P2>(obj));
-      }
-
-      iterator insert(const_iterator hint, value_type const& x)
-      {
-        return this->emplace_hint(hint, x);
-      }
-
-      iterator insert(const_iterator hint, value_type&& x)
-      {
-        return this->emplace_hint(hint, std::move(x));
-      }
-
-      template <class P2>
-      typename boost::enable_if<std::is_constructible<value_type, P2&&>,
-        iterator>::type
-      insert(const_iterator hint, P2&& obj)
-      {
-        return this->emplace_hint(hint, std::forward<P2>(obj));
-      }
-
-      template <class InputIt> void insert(InputIt, InputIt);
-
-      void insert(std::initializer_list<value_type>);
-
-      // extract
-
-      node_type extract(const_iterator position)
-      {
-        return node_type(
-          table_.extract_by_iterator_equiv(position), table_.node_alloc());
-      }
-
-      node_type extract(const key_type& k)
-      {
-        return node_type(table_.extract_by_key_impl(k), table_.node_alloc());
-      }
-
-      template <class Key>
-      typename boost::enable_if_c<
-        detail::transparent_non_iterable<Key, unordered_multimap>::value,
-        node_type>::type
-      extract(const Key& k)
-      {
-        return node_type(table_.extract_by_key_impl(k), table_.node_alloc());
-      }
-
-      iterator insert(node_type&& np)
-      {
-        return table_.move_insert_node_type_equiv(np);
-      }
-
-      iterator insert(const_iterator hint, node_type&& np)
-      {
-        return table_.move_insert_node_type_with_hint_equiv(hint, np);
-      }
-
-      iterator erase(iterator);
-      iterator erase(const_iterator);
-      size_type erase(const key_type&);
-      iterator erase(const_iterator, const_iterator);
-
-      template <class Key>
-      typename boost::enable_if_c<
-        detail::transparent_non_iterable<Key, unordered_multimap>::value,
-        size_type>::type
-      erase(Key&& k)
-      {
-        return table_.erase_key_equiv_impl(std::forward<Key>(k));
-      }
-
-      BOOST_UNORDERED_DEPRECATED("Use erase instead")
-      void quick_erase(const_iterator it) { erase(it); }
-      BOOST_UNORDERED_DEPRECATED("Use erase instead")
-      void erase_return_void(const_iterator it) { erase(it); }
-
-      void swap(unordered_multimap&)
-        noexcept(value_allocator_traits::is_always_equal::value&&
-            boost::unordered::detail::is_nothrow_swappable<H>::value&&
-              boost::unordered::detail::is_nothrow_swappable<P>::value);
-      void clear() noexcept { table_.clear_impl(); }
-
-      template <typename H2, typename P2>
-      void merge(boost::unordered_multimap<K, T, H2, P2, A>& source);
-
-      template <typename H2, typename P2>
-      void merge(boost::unordered_multimap<K, T, H2, P2, A>&& source);
-
-      template <typename H2, typename P2>
-      void merge(boost::unordered_map<K, T, H2, P2, A>& source);
-
-      template <typename H2, typename P2>
-      void merge(boost::unordered_map<K, T, H2, P2, A>&& source);
-
-      // observers
-
-      hasher hash_function() const;
-      key_equal key_eq() const;
-
-      // lookup
-
-      iterator find(const key_type&);
-      const_iterator find(const key_type&) const;
-
-      template <class Key>
-      typename boost::enable_if_c<detail::are_transparent<Key, H, P>::value,
-        iterator>::type
-      find(const Key& key)
-      {
-        return table_.find(key);
-      }
-
-      template <class Key>
-      typename boost::enable_if_c<detail::are_transparent<Key, H, P>::value,
-        const_iterator>::type
-      find(const Key& key) const
-      {
-        return const_iterator(table_.find(key));
-      }
-
-      template <class CompatibleKey, class CompatibleHash,
-        class CompatiblePredicate>
-      iterator find(CompatibleKey const&, CompatibleHash const&,
-        CompatiblePredicate const&);
-
-      template <class CompatibleKey, class CompatibleHash,
-        class CompatiblePredicate>
-      const_iterator find(CompatibleKey const&, CompatibleHash const&,
-        CompatiblePredicate const&) const;
-
-      bool contains(key_type const& k) const
-      {
-        return table_.find(k) != this->end();
-      }
-
-      template <class Key>
-      typename boost::enable_if_c<detail::are_transparent<Key, H, P>::value,
-        bool>::type
-      contains(const Key& k) const
-      {
-        return table_.find(k) != this->end();
-      }
-
-      size_type count(const key_type&) const;
-
-      template <class Key>
-      typename boost::enable_if_c<detail::are_transparent<Key, H, P>::value,
-        size_type>::type
-      count(const Key& k) const
-      {
-        return table_.group_count(k);
-      }
-
-      std::pair<iterator, iterator> equal_range(const key_type&);
-      std::pair<const_iterator, const_iterator> equal_range(
-        const key_type&) const;
-
-      template <class Key>
-      typename boost::enable_if_c<detail::are_transparent<Key, H, P>::value,
-        std::pair<iterator, iterator> >::type
-      equal_range(const Key& key)
-      {
-        iterator p = table_.find(key);
-        return std::make_pair(p, table_.next_group(key, p));
-      }
-
-      template <class Key>
-      typename boost::enable_if_c<detail::are_transparent<Key, H, P>::value,
-        std::pair<const_iterator, const_iterator> >::type
-      equal_range(const Key& key) const
-      {
-        iterator p = table_.find(key);
-        return std::make_pair(
-          const_iterator(p), const_iterator(table_.next_group(key, p)));
-      }
-
-      // bucket interface
-
-      size_type bucket_count() const noexcept { return table_.bucket_count(); }
-
-      size_type max_bucket_count() const noexcept
-      {
-        return table_.max_bucket_count();
-      }
-
-      size_type bucket_size(size_type) const;
-
-      size_type bucket(const key_type& k) const
-      {
-        return table_.hash_to_bucket(table_.hash(k));
-      }
-
-      template <class Key>
-      typename boost::enable_if_c<detail::are_transparent<Key, H, P>::value,
-        size_type>::type
-      bucket(Key&& k) const
-      {
-        return table_.hash_to_bucket(table_.hash(std::forward<Key>(k)));
-      }
-
-      local_iterator begin(size_type n)
-      {
-        return local_iterator(table_.begin(n));
-      }
-
-      const_local_iterator begin(size_type n) const
-      {
-        return const_local_iterator(table_.begin(n));
-      }
-
-      local_iterator end(size_type) { return local_iterator(); }
-
-      const_local_iterator end(size_type) const
-      {
-        return const_local_iterator();
-      }
-
-      const_local_iterator cbegin(size_type n) const
-      {
-        return const_local_iterator(table_.begin(n));
-      }
-
-      const_local_iterator cend(size_type) const
-      {
-        return const_local_iterator();
-      }
-
-      // hash policy
-
-      float load_factor() const noexcept;
-      float max_load_factor() const noexcept { return table_.mlf_; }
-      void max_load_factor(float) noexcept;
-      void rehash(size_type);
-      void reserve(size_type);
-
-#if !BOOST_WORKAROUND(BOOST_BORLANDC, < 0x0582)
-      friend bool operator==
-        <K, T, H, P, A>(unordered_multimap const&, unordered_multimap const&);
-      friend bool operator!=
-        <K, T, H, P, A>(unordered_multimap const&, unordered_multimap const&);
-#endif
-    }; // class template unordered_multimap
-
-    template <class Archive, class K, class T, class H, class P, class A>
-    void serialize(
-      Archive& ar, unordered_multimap<K, T, H, P, A>& m, unsigned int version)
-    {
-      detail::serialize_fca_container(ar, m, version);
-    }
-
-#if BOOST_UNORDERED_TEMPLATE_DEDUCTION_GUIDES
-
-    template <class InputIterator,
-      class Hash =
-        boost::hash<boost::unordered::detail::iter_key_t<InputIterator> >,
-      class Pred =
-        std::equal_to<boost::unordered::detail::iter_key_t<InputIterator> >,
-      class Allocator = std::allocator<
-        boost::unordered::detail::iter_to_alloc_t<InputIterator> >,
-      class = std::enable_if_t<detail::is_input_iterator_v<InputIterator> >,
-      class = std::enable_if_t<detail::is_hash_v<Hash> >,
-      class = std::enable_if_t<detail::is_pred_v<Pred> >,
-      class = std::enable_if_t<detail::is_allocator_v<Allocator> > >
-    unordered_multimap(InputIterator, InputIterator,
-      std::size_t = boost::unordered::detail::default_bucket_count,
-      Hash = Hash(), Pred = Pred(), Allocator = Allocator())
-      -> unordered_multimap<boost::unordered::detail::iter_key_t<InputIterator>,
-        boost::unordered::detail::iter_val_t<InputIterator>, Hash, Pred,
-        Allocator>;
-
-    template <class Key, class T,
-      class Hash = boost::hash<std::remove_const_t<Key> >,
-      class Pred = std::equal_to<std::remove_const_t<Key> >,
-      class Allocator = std::allocator<std::pair<const Key, T> >,
-      class = std::enable_if_t<detail::is_hash_v<Hash> >,
-      class = std::enable_if_t<detail::is_pred_v<Pred> >,
-      class = std::enable_if_t<detail::is_allocator_v<Allocator> > >
-    unordered_multimap(std::initializer_list<std::pair<Key, T> >,
-      std::size_t = boost::unordered::detail::default_bucket_count,
-      Hash = Hash(), Pred = Pred(), Allocator = Allocator())
-      -> unordered_multimap<std::remove_const_t<Key>, T, Hash, Pred, Allocator>;
-
-    template <class InputIterator, class Allocator,
-      class = std::enable_if_t<detail::is_input_iterator_v<InputIterator> >,
-      class = std::enable_if_t<detail::is_allocator_v<Allocator> > >
-    unordered_multimap(InputIterator, InputIterator, std::size_t, Allocator)
-      -> unordered_multimap<boost::unordered::detail::iter_key_t<InputIterator>,
-        boost::unordered::detail::iter_val_t<InputIterator>,
-        boost::hash<boost::unordered::detail::iter_key_t<InputIterator> >,
-        std::equal_to<boost::unordered::detail::iter_key_t<InputIterator> >,
-        Allocator>;
-
-    template <class InputIterator, class Allocator,
-      class = std::enable_if_t<detail::is_input_iterator_v<InputIterator> >,
-      class = std::enable_if_t<detail::is_allocator_v<Allocator> > >
-    unordered_multimap(InputIterator, InputIterator, Allocator)
-      -> unordered_multimap<boost::unordered::detail::iter_key_t<InputIterator>,
-        boost::unordered::detail::iter_val_t<InputIterator>,
-        boost::hash<boost::unordered::detail::iter_key_t<InputIterator> >,
-        std::equal_to<boost::unordered::detail::iter_key_t<InputIterator> >,
-        Allocator>;
-
-    template <class InputIterator, class Hash, class Allocator,
-      class = std::enable_if_t<detail::is_hash_v<Hash> >,
-      class = std::enable_if_t<detail::is_input_iterator_v<InputIterator> >,
-      class = std::enable_if_t<detail::is_allocator_v<Allocator> > >
-    unordered_multimap(
-      InputIterator, InputIterator, std::size_t, Hash, Allocator)
-      -> unordered_multimap<boost::unordered::detail::iter_key_t<InputIterator>,
-        boost::unordered::detail::iter_val_t<InputIterator>, Hash,
-        std::equal_to<boost::unordered::detail::iter_key_t<InputIterator> >,
-        Allocator>;
-
-    template <class Key, class T, class Allocator,
-      class = std::enable_if_t<detail::is_allocator_v<Allocator> > >
-    unordered_multimap(std::initializer_list<std::pair<Key, T> >, std::size_t,
-      Allocator) -> unordered_multimap<std::remove_const_t<Key>, T,
-      boost::hash<std::remove_const_t<Key> >,
-      std::equal_to<std::remove_const_t<Key> >, Allocator>;
-
-    template <class Key, class T, class Allocator,
-      class = std::enable_if_t<detail::is_allocator_v<Allocator> > >
-    unordered_multimap(std::initializer_list<std::pair<Key, T> >, Allocator)
-      -> unordered_multimap<std::remove_const_t<Key>, T,
-        boost::hash<std::remove_const_t<Key> >,
-        std::equal_to<std::remove_const_t<Key> >, Allocator>;
-
-    template <class Key, class T, class Hash, class Allocator,
-      class = std::enable_if_t<detail::is_hash_v<Hash> >,
-      class = std::enable_if_t<detail::is_allocator_v<Allocator> > >
-    unordered_multimap(std::initializer_list<std::pair<Key, T> >, std::size_t,
-      Hash, Allocator) -> unordered_multimap<std::remove_const_t<Key>, T, Hash,
-      std::equal_to<std::remove_const_t<Key> >, Allocator>;
-
-#endif
-
-    ////////////////////////////////////////////////////////////////////////////
-
-    template <class K, class T, class H, class P, class A>
-    unordered_map<K, T, H, P, A>::unordered_map()
-    {
-    }
-
-    template <class K, class T, class H, class P, class A>
-    unordered_map<K, T, H, P, A>::unordered_map(size_type n, const hasher& hf,
-      const key_equal& eql, const allocator_type& a)
-        : table_(n, hf, eql, a)
-    {
-    }
-
-    template <class K, class T, class H, class P, class A>
-    template <class InputIt>
-    unordered_map<K, T, H, P, A>::unordered_map(InputIt f, InputIt l,
-      size_type n, const hasher& hf, const key_equal& eql,
-      const allocator_type& a)
-        : table_(boost::unordered::detail::initial_size(f, l, n), hf, eql, a)
-    {
-      this->insert(f, l);
-    }
-
-    template <class K, class T, class H, class P, class A>
-    unordered_map<K, T, H, P, A>::unordered_map(unordered_map const& other)
-        : table_(other.table_,
-            unordered_map::value_allocator_traits::
-              select_on_container_copy_construction(other.get_allocator()))
-    {
-      if (other.size()) {
-        table_.copy_buckets(other.table_, std::true_type());
-      }
-    }
-
-    template <class K, class T, class H, class P, class A>
-    unordered_map<K, T, H, P, A>::unordered_map(allocator_type const& a)
-        : table_(boost::unordered::detail::default_bucket_count, hasher(),
-            key_equal(), a)
-    {
-    }
-
-    template <class K, class T, class H, class P, class A>
-    unordered_map<K, T, H, P, A>::unordered_map(
-      unordered_map const& other, allocator_type const& a)
-        : table_(other.table_, a)
-    {
-      if (other.table_.size_) {
-        table_.copy_buckets(other.table_, std::true_type());
-      }
-    }
-
-    template <class K, class T, class H, class P, class A>
-    unordered_map<K, T, H, P, A>::unordered_map(
-      unordered_map&& other, allocator_type const& a)
-        : table_(other.table_, a, boost::unordered::detail::move_tag())
-    {
-      table_.move_construct_buckets(other.table_);
-    }
-
-    template <class K, class T, class H, class P, class A>
-    unordered_map<K, T, H, P, A>::unordered_map(
-      std::initializer_list<value_type> list, size_type n, const hasher& hf,
-      const key_equal& eql, const allocator_type& a)
-        : table_(
-            boost::unordered::detail::initial_size(list.begin(), list.end(), n),
-            hf, eql, a)
-    {
-      this->insert(list.begin(), list.end());
-    }
-
-    template <class K, class T, class H, class P, class A>
-    unordered_map<K, T, H, P, A>::unordered_map(
-      size_type n, const allocator_type& a)
-        : table_(n, hasher(), key_equal(), a)
-    {
-    }
-
-    template <class K, class T, class H, class P, class A>
-    unordered_map<K, T, H, P, A>::unordered_map(
-      size_type n, const hasher& hf, const allocator_type& a)
-        : table_(n, hf, key_equal(), a)
-    {
-    }
-
-    template <class K, class T, class H, class P, class A>
-    template <class InputIterator>
-    unordered_map<K, T, H, P, A>::unordered_map(
-      InputIterator f, InputIterator l, const allocator_type& a)
-        : table_(boost::unordered::detail::initial_size(
-                   f, l, detail::default_bucket_count),
-            hasher(), key_equal(), a)
-    {
-      this->insert(f, l);
-    }
-
-    template <class K, class T, class H, class P, class A>
-    template <class InputIt>
-    unordered_map<K, T, H, P, A>::unordered_map(
-      InputIt f, InputIt l, size_type n, const allocator_type& a)
-        : table_(boost::unordered::detail::initial_size(f, l, n), hasher(),
-            key_equal(), a)
-    {
-      this->insert(f, l);
-    }
-
-    template <class K, class T, class H, class P, class A>
-    template <class InputIt>
-    unordered_map<K, T, H, P, A>::unordered_map(InputIt f, InputIt l,
-      size_type n, const hasher& hf, const allocator_type& a)
-        : table_(
-            boost::unordered::detail::initial_size(f, l, n), hf, key_equal(), a)
-    {
-      this->insert(f, l);
-    }
-
-    template <class K, class T, class H, class P, class A>
-    unordered_map<K, T, H, P, A>::unordered_map(
-      std::initializer_list<value_type> list, const allocator_type& a)
-        : table_(boost::unordered::detail::initial_size(
-                   list.begin(), list.end(), detail::default_bucket_count),
-            hasher(), key_equal(), a)
-    {
-      this->insert(list.begin(), list.end());
-    }
-
-    template <class K, class T, class H, class P, class A>
-    unordered_map<K, T, H, P, A>::unordered_map(
-      std::initializer_list<value_type> list, size_type n,
-      const allocator_type& a)
-        : table_(
-            boost::unordered::detail::initial_size(list.begin(), list.end(), n),
-            hasher(), key_equal(), a)
-    {
-      this->insert(list.begin(), list.end());
-    }
-
-    template <class K, class T, class H, class P, class A>
-    unordered_map<K, T, H, P, A>::unordered_map(
-      std::initializer_list<value_type> list, size_type n, const hasher& hf,
-      const allocator_type& a)
-        : table_(
-            boost::unordered::detail::initial_size(list.begin(), list.end(), n),
-            hf, key_equal(), a)
-    {
-      this->insert(list.begin(), list.end());
-    }
-
-    template <class K, class T, class H, class P, class A>
-    unordered_map<K, T, H, P, A>::~unordered_map() noexcept
-    {
-    }
-
-    template <class K, class T, class H, class P, class A>
-    unordered_map<K, T, H, P, A>& unordered_map<K, T, H, P, A>::operator=(
-      std::initializer_list<value_type> list)
-    {
-      this->clear();
-      this->insert(list.begin(), list.end());
-      return *this;
-    }
-
-    // size and capacity
-
-    template <class K, class T, class H, class P, class A>
-    std::size_t unordered_map<K, T, H, P, A>::max_size() const noexcept
-    {
-      using namespace std;
-
-      // size <= mlf_ * count
-      return boost::unordered::detail::double_to_size(
-               ceil(static_cast<double>(table_.mlf_) *
-                    static_cast<double>(table_.max_bucket_count()))) -
-             1;
-    }
-
-    // modifiers
-
-    template <class K, class T, class H, class P, class A>
-    template <class InputIt>
-    void unordered_map<K, T, H, P, A>::insert(InputIt first, InputIt last)
-    {
-      if (first != last) {
-        table_.insert_range_unique(
-          table::extractor::extract(*first), first, last);
-      }
-    }
-
-    template <class K, class T, class H, class P, class A>
-    void unordered_map<K, T, H, P, A>::insert(
-      std::initializer_list<value_type> list)
-    {
-      this->insert(list.begin(), list.end());
-    }
-
-    template <class K, class T, class H, class P, class A>
-    typename unordered_map<K, T, H, P, A>::iterator
-    unordered_map<K, T, H, P, A>::erase(iterator position)
-    {
-      return table_.erase_node(position);
-    }
-
-    template <class K, class T, class H, class P, class A>
-    typename unordered_map<K, T, H, P, A>::iterator
-    unordered_map<K, T, H, P, A>::erase(const_iterator position)
-    {
-      return table_.erase_node(position);
-    }
-
-    template <class K, class T, class H, class P, class A>
-    typename unordered_map<K, T, H, P, A>::size_type
-    unordered_map<K, T, H, P, A>::erase(const key_type& k)
-    {
-      return table_.erase_key_unique_impl(k);
-    }
-
-    template <class K, class T, class H, class P, class A>
-    typename unordered_map<K, T, H, P, A>::iterator
-    unordered_map<K, T, H, P, A>::erase(
-      const_iterator first, const_iterator last)
-    {
-      return table_.erase_nodes_range(first, last);
-    }
-
-    template <class K, class T, class H, class P, class A>
-    void unordered_map<K, T, H, P, A>::swap(unordered_map& other)
-      noexcept(value_allocator_traits::is_always_equal::value&&
-          boost::unordered::detail::is_nothrow_swappable<H>::value&&
-            boost::unordered::detail::is_nothrow_swappable<P>::value)
-    {
-      table_.swap(other.table_);
-    }
-
-    template <class K, class T, class H, class P, class A>
-    template <typename H2, typename P2>
-    void unordered_map<K, T, H, P, A>::merge(
-      boost::unordered_map<K, T, H2, P2, A>& source)
-    {
-      table_.merge_unique(source.table_);
-    }
-
-    template <class K, class T, class H, class P, class A>
-    template <typename H2, typename P2>
-    void unordered_map<K, T, H, P, A>::merge(
-      boost::unordered_map<K, T, H2, P2, A>&& source)
-    {
-      table_.merge_unique(source.table_);
-    }
-
-    template <class K, class T, class H, class P, class A>
-    template <typename H2, typename P2>
-    void unordered_map<K, T, H, P, A>::merge(
-      boost::unordered_multimap<K, T, H2, P2, A>& source)
-    {
-      table_.merge_unique(source.table_);
-    }
-
-    template <class K, class T, class H, class P, class A>
-    template <typename H2, typename P2>
-    void unordered_map<K, T, H, P, A>::merge(
-      boost::unordered_multimap<K, T, H2, P2, A>&& source)
-    {
-      table_.merge_unique(source.table_);
-    }
-
-    // observers
-
-    template <class K, class T, class H, class P, class A>
-    typename unordered_map<K, T, H, P, A>::hasher
-    unordered_map<K, T, H, P, A>::hash_function() const
-    {
-      return table_.hash_function();
-    }
-
-    template <class K, class T, class H, class P, class A>
-    typename unordered_map<K, T, H, P, A>::key_equal
-    unordered_map<K, T, H, P, A>::key_eq() const
-    {
-      return table_.key_eq();
-    }
-
-    // lookup
-
-    template <class K, class T, class H, class P, class A>
-    typename unordered_map<K, T, H, P, A>::iterator
-    unordered_map<K, T, H, P, A>::find(const key_type& k)
-    {
-      return iterator(table_.find(k));
-    }
-
-    template <class K, class T, class H, class P, class A>
-    typename unordered_map<K, T, H, P, A>::const_iterator
-    unordered_map<K, T, H, P, A>::find(const key_type& k) const
-    {
-      return const_iterator(table_.find(k));
-    }
-
-    template <class K, class T, class H, class P, class A>
-    template <class CompatibleKey, class CompatibleHash,
-      class CompatiblePredicate>
-    typename unordered_map<K, T, H, P, A>::iterator
-    unordered_map<K, T, H, P, A>::find(CompatibleKey const& k,
-      CompatibleHash const& hash, CompatiblePredicate const& eq)
-    {
-      return table_.transparent_find(k, hash, eq);
-    }
-
-    template <class K, class T, class H, class P, class A>
-    template <class CompatibleKey, class CompatibleHash,
-      class CompatiblePredicate>
-    typename unordered_map<K, T, H, P, A>::const_iterator
-    unordered_map<K, T, H, P, A>::find(CompatibleKey const& k,
-      CompatibleHash const& hash, CompatiblePredicate const& eq) const
-    {
-      return table_.transparent_find(k, hash, eq);
-    }
-
-    template <class K, class T, class H, class P, class A>
-    typename unordered_map<K, T, H, P, A>::size_type
-    unordered_map<K, T, H, P, A>::count(const key_type& k) const
-    {
-      return table_.find_node(k) ? 1 : 0;
-    }
-
-    template <class K, class T, class H, class P, class A>
-    std::pair<typename unordered_map<K, T, H, P, A>::iterator,
-      typename unordered_map<K, T, H, P, A>::iterator>
-    unordered_map<K, T, H, P, A>::equal_range(const key_type& k)
-    {
-      iterator first = table_.find(k);
-      iterator second = first;
-      if (second != this->end()) {
-        ++second;
-      }
-      return std::make_pair(first, second);
-    }
-
-    template <class K, class T, class H, class P, class A>
-    std::pair<typename unordered_map<K, T, H, P, A>::const_iterator,
-      typename unordered_map<K, T, H, P, A>::const_iterator>
-    unordered_map<K, T, H, P, A>::equal_range(const key_type& k) const
-    {
-      iterator first = table_.find(k);
-      iterator second = first;
-      if (second != this->end()) {
-        ++second;
-      }
-      return std::make_pair(const_iterator(first), const_iterator(second));
-    }
-
-    template <class K, class T, class H, class P, class A>
-    typename unordered_map<K, T, H, P, A>::mapped_type&
-    unordered_map<K, T, H, P, A>::operator[](const key_type& k)
-    {
-      return table_.try_emplace_unique(k).first->second;
-    }
-
-    template <class K, class T, class H, class P, class A>
-    typename unordered_map<K, T, H, P, A>::mapped_type&
-    unordered_map<K, T, H, P, A>::operator[](key_type&& k)
-    {
-      return table_.try_emplace_unique(std::move(k)).first->second;
-    }
-
-    template <class K, class T, class H, class P, class A>
-    template <class Key>
-    typename boost::enable_if_c<detail::are_transparent<Key, H, P>::value,
-      typename unordered_map<K, T, H, P, A>::mapped_type&>::type
-    unordered_map<K, T, H, P, A>::operator[](Key&& k)
-    {
-      return table_.try_emplace_unique(std::forward<Key>(k)).first->second;
-    }
-
-    template <class K, class T, class H, class P, class A>
-    typename unordered_map<K, T, H, P, A>::mapped_type&
-    unordered_map<K, T, H, P, A>::at(const key_type& k)
-    {
-      typedef typename table::node_pointer node_pointer;
-
-      if (table_.size_) {
-        node_pointer p = table_.find_node(k);
-        if (p)
-          return p->value().second;
-      }
-
-      boost::throw_exception(
-        std::out_of_range("Unable to find key in unordered_map."));
-    }
-
-    template <class K, class T, class H, class P, class A>
-    typename unordered_map<K, T, H, P, A>::mapped_type const&
-    unordered_map<K, T, H, P, A>::at(const key_type& k) const
-    {
-      typedef typename table::node_pointer node_pointer;
-
-      if (table_.size_) {
-        node_pointer p = table_.find_node(k);
-        if (p)
-          return p->value().second;
-      }
-
-      boost::throw_exception(
-        std::out_of_range("Unable to find key in unordered_map."));
-    }
-
-    template <class K, class T, class H, class P, class A>
-    template <class Key>
-    typename boost::enable_if_c<detail::are_transparent<Key, H, P>::value,
-      typename unordered_map<K, T, H, P, A>::mapped_type&>::type
-    unordered_map<K, T, H, P, A>::at(Key&& k)
-    {
-      typedef typename table::node_pointer node_pointer;
-
-      if (table_.size_) {
-        node_pointer p = table_.find_node(std::forward<Key>(k));
-        if (p)
-          return p->value().second;
-      }
-
-      boost::throw_exception(
-        std::out_of_range("Unable to find key in unordered_map."));
-    }
-
-    template <class K, class T, class H, class P, class A>
-    template <class Key>
-    typename boost::enable_if_c<detail::are_transparent<Key, H, P>::value,
-      typename unordered_map<K, T, H, P, A>::mapped_type const&>::type
-    unordered_map<K, T, H, P, A>::at(Key&& k) const
-    {
-      typedef typename table::node_pointer node_pointer;
-
-      if (table_.size_) {
-        node_pointer p = table_.find_node(std::forward<Key>(k));
-        if (p)
-          return p->value().second;
-      }
-
-      boost::throw_exception(
-        std::out_of_range("Unable to find key in unordered_map."));
-    }
-
-    template <class K, class T, class H, class P, class A>
-    typename unordered_map<K, T, H, P, A>::size_type
-    unordered_map<K, T, H, P, A>::bucket_size(size_type n) const
-    {
-      return table_.bucket_size(n);
-    }
-
-    // hash policy
-
-    template <class K, class T, class H, class P, class A>
-    float unordered_map<K, T, H, P, A>::load_factor() const noexcept
-    {
-      if (table_.size_ == 0) {
-        return 0.0f;
-      }
-
-      BOOST_ASSERT(table_.bucket_count() != 0);
-      return static_cast<float>(table_.size_) /
-             static_cast<float>(table_.bucket_count());
-    }
-
-    template <class K, class T, class H, class P, class A>
-    void unordered_map<K, T, H, P, A>::max_load_factor(float m) noexcept
-    {
-      table_.max_load_factor(m);
-    }
-
-    template <class K, class T, class H, class P, class A>
-    void unordered_map<K, T, H, P, A>::rehash(size_type n)
-    {
-      table_.rehash(n);
-    }
-
-    template <class K, class T, class H, class P, class A>
-    void unordered_map<K, T, H, P, A>::reserve(size_type n)
-    {
-      table_.reserve(n);
-    }
-
-    template <class K, class T, class H, class P, class A>
-    inline bool operator==(unordered_map<K, T, H, P, A> const& m1,
-      unordered_map<K, T, H, P, A> const& m2)
-    {
-#if BOOST_WORKAROUND(BOOST_CODEGEARC, BOOST_TESTED_AT(0x0613))
-      struct dummy
-      {
-        unordered_map<K, T, H, P, A> x;
-      };
-#endif
-      return m1.table_.equals_unique(m2.table_);
-    }
-
-    template <class K, class T, class H, class P, class A>
-    inline bool operator!=(unordered_map<K, T, H, P, A> const& m1,
-      unordered_map<K, T, H, P, A> const& m2)
-    {
-#if BOOST_WORKAROUND(BOOST_CODEGEARC, BOOST_TESTED_AT(0x0613))
-      struct dummy
-      {
-        unordered_map<K, T, H, P, A> x;
-      };
-#endif
-      return !m1.table_.equals_unique(m2.table_);
-    }
-
-    template <class K, class T, class H, class P, class A>
-    inline void swap(unordered_map<K, T, H, P, A>& m1,
-      unordered_map<K, T, H, P, A>& m2) noexcept(noexcept(m1.swap(m2)))
-    {
-#if BOOST_WORKAROUND(BOOST_CODEGEARC, BOOST_TESTED_AT(0x0613))
-      struct dummy
-      {
-        unordered_map<K, T, H, P, A> x;
-      };
-#endif
-      m1.swap(m2);
-    }
-
-    template <class K, class T, class H, class P, class A, class Predicate>
-    typename unordered_map<K, T, H, P, A>::size_type erase_if(
-      unordered_map<K, T, H, P, A>& c, Predicate pred)
-    {
-      return detail::erase_if(c, pred);
-    }
-
-    ////////////////////////////////////////////////////////////////////////////
-
-    template <class K, class T, class H, class P, class A>
-    unordered_multimap<K, T, H, P, A>::unordered_multimap()
-    {
-    }
-
-    template <class K, class T, class H, class P, class A>
-    unordered_multimap<K, T, H, P, A>::unordered_multimap(size_type n,
-      const hasher& hf, const key_equal& eql, const allocator_type& a)
-        : table_(n, hf, eql, a)
-    {
-    }
-
-    template <class K, class T, class H, class P, class A>
-    template <class InputIt>
-    unordered_multimap<K, T, H, P, A>::unordered_multimap(InputIt f, InputIt l,
-      size_type n, const hasher& hf, const key_equal& eql,
-      const allocator_type& a)
-        : table_(boost::unordered::detail::initial_size(f, l, n), hf, eql, a)
-    {
-      this->insert(f, l);
-    }
-
-    template <class K, class T, class H, class P, class A>
-    unordered_multimap<K, T, H, P, A>::unordered_multimap(
-      unordered_multimap const& other)
-        : table_(other.table_,
-            unordered_multimap::value_allocator_traits::
-              select_on_container_copy_construction(other.get_allocator()))
-    {
-      if (other.table_.size_) {
-        table_.copy_buckets(other.table_, std::false_type());
-      }
-    }
-
-    template <class K, class T, class H, class P, class A>
-    unordered_multimap<K, T, H, P, A>::unordered_multimap(
-      allocator_type const& a)
-        : table_(boost::unordered::detail::default_bucket_count, hasher(),
-            key_equal(), a)
-    {
-    }
-
-    template <class K, class T, class H, class P, class A>
-    unordered_multimap<K, T, H, P, A>::unordered_multimap(
-      unordered_multimap const& other, allocator_type const& a)
-        : table_(other.table_, a)
-    {
-      if (other.table_.size_) {
-        table_.copy_buckets(other.table_, std::false_type());
-      }
-    }
-
-    template <class K, class T, class H, class P, class A>
-    unordered_multimap<K, T, H, P, A>::unordered_multimap(
-      unordered_multimap&& other, allocator_type const& a)
-        : table_(other.table_, a, boost::unordered::detail::move_tag())
-    {
-      table_.move_construct_buckets(other.table_);
-    }
-
-    template <class K, class T, class H, class P, class A>
-    unordered_multimap<K, T, H, P, A>::unordered_multimap(
-      std::initializer_list<value_type> list, size_type n, const hasher& hf,
-      const key_equal& eql, const allocator_type& a)
-        : table_(
-            boost::unordered::detail::initial_size(list.begin(), list.end(), n),
-            hf, eql, a)
-    {
-      this->insert(list.begin(), list.end());
-    }
-
-    template <class K, class T, class H, class P, class A>
-    unordered_multimap<K, T, H, P, A>::unordered_multimap(
-      size_type n, const allocator_type& a)
-        : table_(n, hasher(), key_equal(), a)
-    {
-    }
-
-    template <class K, class T, class H, class P, class A>
-    unordered_multimap<K, T, H, P, A>::unordered_multimap(
-      size_type n, const hasher& hf, const allocator_type& a)
-        : table_(n, hf, key_equal(), a)
-    {
-    }
-
-    template <class K, class T, class H, class P, class A>
-    template <class InputIterator>
-    unordered_multimap<K, T, H, P, A>::unordered_multimap(
-      InputIterator f, InputIterator l, const allocator_type& a)
-        : table_(boost::unordered::detail::initial_size(
-                   f, l, detail::default_bucket_count),
-            hasher(), key_equal(), a)
-    {
-      this->insert(f, l);
-    }
-
-    template <class K, class T, class H, class P, class A>
-    template <class InputIt>
-    unordered_multimap<K, T, H, P, A>::unordered_multimap(
-      InputIt f, InputIt l, size_type n, const allocator_type& a)
-        : table_(boost::unordered::detail::initial_size(f, l, n), hasher(),
-            key_equal(), a)
-    {
-      this->insert(f, l);
-    }
-
-    template <class K, class T, class H, class P, class A>
-    template <class InputIt>
-    unordered_multimap<K, T, H, P, A>::unordered_multimap(InputIt f, InputIt l,
-      size_type n, const hasher& hf, const allocator_type& a)
-        : table_(
-            boost::unordered::detail::initial_size(f, l, n), hf, key_equal(), a)
-    {
-      this->insert(f, l);
-    }
-
-    template <class K, class T, class H, class P, class A>
-    unordered_multimap<K, T, H, P, A>::unordered_multimap(
-      std::initializer_list<value_type> list, const allocator_type& a)
-        : table_(boost::unordered::detail::initial_size(
-                   list.begin(), list.end(), detail::default_bucket_count),
-            hasher(), key_equal(), a)
-    {
-      this->insert(list.begin(), list.end());
-    }
-
-    template <class K, class T, class H, class P, class A>
-    unordered_multimap<K, T, H, P, A>::unordered_multimap(
-      std::initializer_list<value_type> list, size_type n,
-      const allocator_type& a)
-        : table_(
-            boost::unordered::detail::initial_size(list.begin(), list.end(), n),
-            hasher(), key_equal(), a)
-    {
-      this->insert(list.begin(), list.end());
-    }
-
-    template <class K, class T, class H, class P, class A>
-    unordered_multimap<K, T, H, P, A>::unordered_multimap(
-      std::initializer_list<value_type> list, size_type n, const hasher& hf,
-      const allocator_type& a)
-        : table_(
-            boost::unordered::detail::initial_size(list.begin(), list.end(), n),
-            hf, key_equal(), a)
-    {
-      this->insert(list.begin(), list.end());
-    }
-
-    template <class K, class T, class H, class P, class A>
-    unordered_multimap<K, T, H, P, A>::~unordered_multimap() noexcept
-    {
-    }
-
-    template <class K, class T, class H, class P, class A>
-    unordered_multimap<K, T, H, P, A>&
-    unordered_multimap<K, T, H, P, A>::operator=(
-      std::initializer_list<value_type> list)
-    {
-      this->clear();
-      this->insert(list.begin(), list.end());
-      return *this;
-    }
-
-    // size and capacity
-
-    template <class K, class T, class H, class P, class A>
-    std::size_t unordered_multimap<K, T, H, P, A>::max_size() const noexcept
-    {
-      using namespace std;
-
-      // size <= mlf_ * count
-      return boost::unordered::detail::double_to_size(
-               ceil(static_cast<double>(table_.mlf_) *
-                    static_cast<double>(table_.max_bucket_count()))) -
-             1;
-    }
-
-    // modifiers
-
-    template <class K, class T, class H, class P, class A>
-    template <class InputIt>
-    void unordered_multimap<K, T, H, P, A>::insert(InputIt first, InputIt last)
-    {
-      table_.insert_range_equiv(first, last);
-    }
-
-    template <class K, class T, class H, class P, class A>
-    void unordered_multimap<K, T, H, P, A>::insert(
-      std::initializer_list<value_type> list)
-    {
-      this->insert(list.begin(), list.end());
-    }
-
-    template <class K, class T, class H, class P, class A>
-    typename unordered_multimap<K, T, H, P, A>::iterator
-    unordered_multimap<K, T, H, P, A>::erase(iterator position)
-    {
-      BOOST_ASSERT(position != this->end());
-      return table_.erase_node(position);
-    }
-
-    template <class K, class T, class H, class P, class A>
-    typename unordered_multimap<K, T, H, P, A>::iterator
-    unordered_multimap<K, T, H, P, A>::erase(const_iterator position)
-    {
-      BOOST_ASSERT(position != this->end());
-      return table_.erase_node(position);
-    }
-
-    template <class K, class T, class H, class P, class A>
-    typename unordered_multimap<K, T, H, P, A>::size_type
-    unordered_multimap<K, T, H, P, A>::erase(const key_type& k)
-    {
-      return table_.erase_key_equiv(k);
-    }
-
-    template <class K, class T, class H, class P, class A>
-    typename unordered_multimap<K, T, H, P, A>::iterator
-    unordered_multimap<K, T, H, P, A>::erase(
-      const_iterator first, const_iterator last)
-    {
-      return table_.erase_nodes_range(first, last);
-    }
-
-    template <class K, class T, class H, class P, class A>
-    void unordered_multimap<K, T, H, P, A>::swap(unordered_multimap& other)
-      noexcept(value_allocator_traits::is_always_equal::value&&
-          boost::unordered::detail::is_nothrow_swappable<H>::value&&
-            boost::unordered::detail::is_nothrow_swappable<P>::value)
-    {
-      table_.swap(other.table_);
-    }
-
-    // observers
-
-    template <class K, class T, class H, class P, class A>
-    typename unordered_multimap<K, T, H, P, A>::hasher
-    unordered_multimap<K, T, H, P, A>::hash_function() const
-    {
-      return table_.hash_function();
-    }
-
-    template <class K, class T, class H, class P, class A>
-    typename unordered_multimap<K, T, H, P, A>::key_equal
-    unordered_multimap<K, T, H, P, A>::key_eq() const
-    {
-      return table_.key_eq();
-    }
-
-    template <class K, class T, class H, class P, class A>
-    template <typename H2, typename P2>
-    void unordered_multimap<K, T, H, P, A>::merge(
-      boost::unordered_multimap<K, T, H2, P2, A>& source)
-    {
-      while (!source.empty()) {
-        insert(source.extract(source.begin()));
-      }
-    }
-
-    template <class K, class T, class H, class P, class A>
-    template <typename H2, typename P2>
-    void unordered_multimap<K, T, H, P, A>::merge(
-      boost::unordered_multimap<K, T, H2, P2, A>&& source)
-    {
-      while (!source.empty()) {
-        insert(source.extract(source.begin()));
-      }
-    }
-
-    template <class K, class T, class H, class P, class A>
-    template <typename H2, typename P2>
-    void unordered_multimap<K, T, H, P, A>::merge(
-      boost::unordered_map<K, T, H2, P2, A>& source)
-    {
-      while (!source.empty()) {
-        insert(source.extract(source.begin()));
-      }
-    }
-
-    template <class K, class T, class H, class P, class A>
-    template <typename H2, typename P2>
-    void unordered_multimap<K, T, H, P, A>::merge(
-      boost::unordered_map<K, T, H2, P2, A>&& source)
-    {
-      while (!source.empty()) {
-        insert(source.extract(source.begin()));
-      }
-    }
-
-    // lookup
-
-    template <class K, class T, class H, class P, class A>
-    typename unordered_multimap<K, T, H, P, A>::iterator
-    unordered_multimap<K, T, H, P, A>::find(const key_type& k)
-    {
-      return iterator(table_.find(k));
-    }
-
-    template <class K, class T, class H, class P, class A>
-    typename unordered_multimap<K, T, H, P, A>::const_iterator
-    unordered_multimap<K, T, H, P, A>::find(const key_type& k) const
-    {
-      return const_iterator(table_.find(k));
-    }
-
-    template <class K, class T, class H, class P, class A>
-    template <class CompatibleKey, class CompatibleHash,
-      class CompatiblePredicate>
-    typename unordered_multimap<K, T, H, P, A>::iterator
-    unordered_multimap<K, T, H, P, A>::find(CompatibleKey const& k,
-      CompatibleHash const& hash, CompatiblePredicate const& eq)
-    {
-      return table_.transparent_find(k, hash, eq);
-    }
-
-    template <class K, class T, class H, class P, class A>
-    template <class CompatibleKey, class CompatibleHash,
-      class CompatiblePredicate>
-    typename unordered_multimap<K, T, H, P, A>::const_iterator
-    unordered_multimap<K, T, H, P, A>::find(CompatibleKey const& k,
-      CompatibleHash const& hash, CompatiblePredicate const& eq) const
-    {
-      return const_iterator(
-        table_.find_node_impl(table::policy::apply_hash(hash, k), k, eq));
-    }
-
-    template <class K, class T, class H, class P, class A>
-    typename unordered_multimap<K, T, H, P, A>::size_type
-    unordered_multimap<K, T, H, P, A>::count(const key_type& k) const
-    {
-      return table_.group_count(k);
-    }
-
-    template <class K, class T, class H, class P, class A>
-    std::pair<typename unordered_multimap<K, T, H, P, A>::iterator,
-      typename unordered_multimap<K, T, H, P, A>::iterator>
-    unordered_multimap<K, T, H, P, A>::equal_range(const key_type& k)
-    {
-      iterator n = table_.find(k);
-      return std::make_pair(n, (n == end() ? n : table_.next_group(k, n)));
-    }
-
-    template <class K, class T, class H, class P, class A>
-    std::pair<typename unordered_multimap<K, T, H, P, A>::const_iterator,
-      typename unordered_multimap<K, T, H, P, A>::const_iterator>
-    unordered_multimap<K, T, H, P, A>::equal_range(const key_type& k) const
-    {
-      iterator n = table_.find(k);
-      return std::make_pair(const_iterator(n),
-        const_iterator(n == end() ? n : table_.next_group(k, n)));
-    }
-
-    template <class K, class T, class H, class P, class A>
-    typename unordered_multimap<K, T, H, P, A>::size_type
-    unordered_multimap<K, T, H, P, A>::bucket_size(size_type n) const
-    {
-      return table_.bucket_size(n);
-    }
-
-    // hash policy
-
-    template <class K, class T, class H, class P, class A>
-    float unordered_multimap<K, T, H, P, A>::load_factor() const noexcept
-    {
-      if (table_.size_ == 0) {
-        return 0.0f;
-      }
-
-      BOOST_ASSERT(table_.bucket_count() != 0);
-      return static_cast<float>(table_.size_) /
-             static_cast<float>(table_.bucket_count());
-    }
-
-    template <class K, class T, class H, class P, class A>
-    void unordered_multimap<K, T, H, P, A>::max_load_factor(float m) noexcept
-    {
-      table_.max_load_factor(m);
-    }
-
-    template <class K, class T, class H, class P, class A>
-    void unordered_multimap<K, T, H, P, A>::rehash(size_type n)
-    {
-      table_.rehash(n);
-    }
-
-    template <class K, class T, class H, class P, class A>
-    void unordered_multimap<K, T, H, P, A>::reserve(size_type n)
-    {
-      table_.reserve(n);
-    }
-
-    template <class K, class T, class H, class P, class A>
-    inline bool operator==(unordered_multimap<K, T, H, P, A> const& m1,
-      unordered_multimap<K, T, H, P, A> const& m2)
-    {
-#if BOOST_WORKAROUND(BOOST_CODEGEARC, BOOST_TESTED_AT(0x0613))
-      struct dummy
-      {
-        unordered_multimap<K, T, H, P, A> x;
-      };
-#endif
-      return m1.table_.equals_equiv(m2.table_);
-    }
-
-    template <class K, class T, class H, class P, class A>
-    inline bool operator!=(unordered_multimap<K, T, H, P, A> const& m1,
-      unordered_multimap<K, T, H, P, A> const& m2)
-    {
-#if BOOST_WORKAROUND(BOOST_CODEGEARC, BOOST_TESTED_AT(0x0613))
-      struct dummy
-      {
-        unordered_multimap<K, T, H, P, A> x;
-      };
-#endif
-      return !m1.table_.equals_equiv(m2.table_);
-    }
-
-    template <class K, class T, class H, class P, class A>
-    inline void swap(unordered_multimap<K, T, H, P, A>& m1,
-      unordered_multimap<K, T, H, P, A>& m2) noexcept(noexcept(m1.swap(m2)))
-    {
-#if BOOST_WORKAROUND(BOOST_CODEGEARC, BOOST_TESTED_AT(0x0613))
-      struct dummy
-      {
-        unordered_multimap<K, T, H, P, A> x;
-      };
-#endif
-      m1.swap(m2);
-    }
-
-    template <class K, class T, class H, class P, class A, class Predicate>
-    typename unordered_multimap<K, T, H, P, A>::size_type erase_if(
-      unordered_multimap<K, T, H, P, A>& c, Predicate pred)
-    {
-      return detail::erase_if(c, pred);
-    }
-
-    template <typename N, class K, class T, class A> class node_handle_map
-    {
-      template <typename Types> friend struct ::boost::unordered::detail::table;
-      template <class K2, class T2, class H2, class P2, class A2>
-      friend class boost::unordered::unordered_map;
-      template <class K2, class T2, class H2, class P2, class A2>
-      friend class boost::unordered::unordered_multimap;
-
-      typedef typename boost::allocator_rebind<A, std::pair<K const, T> >::type
-        value_allocator;
-
-      typedef N node;
-      typedef typename boost::allocator_rebind<A, node>::type node_allocator;
-
-      typedef
-        typename boost::allocator_pointer<node_allocator>::type node_pointer;
-
-    public:
-      typedef K key_type;
-      typedef T mapped_type;
-      typedef A allocator_type;
-
-    private:
-      node_pointer ptr_;
-      boost::unordered::detail::optional<value_allocator> alloc_;
-
-      node_handle_map(node_pointer ptr, allocator_type const& a)
-          : ptr_(ptr), alloc_(a)
-      {
-      }
-
-    public:
-      constexpr node_handle_map() noexcept : ptr_(), alloc_() {}
-      node_handle_map(node_handle_map const&) = delete;
-      node_handle_map& operator=(node_handle_map const&) = delete;
-
-      ~node_handle_map()
-      {
-        if (ptr_) {
-          node_allocator node_alloc(*alloc_);
-          boost::unordered::detail::node_tmp<node_allocator> tmp(
-            ptr_, node_alloc);
-        }
-      }
-
-      node_handle_map(node_handle_map&& n) noexcept
-          : ptr_(n.ptr_),
-            alloc_(std::move(n.alloc_))
-      {
-        n.ptr_ = node_pointer();
-      }
-
-      node_handle_map& operator=(node_handle_map&& n)
-      {
-        BOOST_ASSERT(!alloc_.has_value() ||
-                     boost::allocator_propagate_on_container_move_assignment<
-                       value_allocator>::type::value ||
-                     (n.alloc_.has_value() && alloc_ == n.alloc_));
-
-        if (ptr_) {
-          node_allocator node_alloc(*alloc_);
-          boost::unordered::detail::node_tmp<node_allocator> tmp(
-            ptr_, node_alloc);
-          ptr_ = node_pointer();
-        }
-
-        if (!alloc_.has_value() ||
-            boost::allocator_propagate_on_container_move_assignment<
-              value_allocator>::type::value) {
-          alloc_ = std::move(n.alloc_);
-        }
-        ptr_ = n.ptr_;
-        n.ptr_ = node_pointer();
-
-        return *this;
-      }
-
-      key_type& key() const
-      {
-        return const_cast<key_type&>(ptr_->value().first);
-      }
-
-      mapped_type& mapped() const { return ptr_->value().second; }
-
-      allocator_type get_allocator() const { return *alloc_; }
-
-      explicit operator bool() const noexcept
-      {
-        return !this->operator!();
-      }
-
-      bool operator!() const noexcept { return ptr_ ? 0 : 1; }
-
-      BOOST_ATTRIBUTE_NODISCARD bool empty() const noexcept
-      {
-        return ptr_ ? 0 : 1;
-      }
-
-      void swap(node_handle_map& n)
-        noexcept(boost::allocator_propagate_on_container_swap<
-                   value_allocator>::type::value ||
-                 boost::allocator_is_always_equal<value_allocator>::type::value)
-      {
-
-        BOOST_ASSERT(!alloc_.has_value() || !n.alloc_.has_value() ||
-                     boost::allocator_propagate_on_container_swap<
-                       value_allocator>::type::value ||
-                     alloc_ == n.alloc_);
-        if (boost::allocator_propagate_on_container_swap<
-              value_allocator>::type::value ||
-            !alloc_.has_value() || !n.alloc_.has_value()) {
-          boost::core::invoke_swap(alloc_, n.alloc_);
-        }
-        boost::core::invoke_swap(ptr_, n.ptr_);
-      }
-    };
-
-    template <class N, class K, class T, class A>
-    void swap(node_handle_map<N, K, T, A>& x, node_handle_map<N, K, T, A>& y)
-      noexcept(noexcept(x.swap(y)))
-    {
-      x.swap(y);
-    }
-
-    template <class Iter, class NodeType> struct insert_return_type_map
-    {
-    public:
-      Iter position;
-      bool inserted;
-      NodeType node;
-
-      insert_return_type_map() : position(), inserted(false), node() {}
-      insert_return_type_map(insert_return_type_map const&) = delete;
-      insert_return_type_map& operator=(insert_return_type_map const&) = delete;
-
-      insert_return_type_map(insert_return_type_map&& x) noexcept
-          : position(x.position),
-            inserted(x.inserted),
-            node(std::move(x.node))
-      {
-      }
-
-      insert_return_type_map& operator=(insert_return_type_map&& x)
-      {
-        inserted = x.inserted;
-        position = x.position;
-        node = std::move(x.node);
-        return *this;
-      }
-    };
-
-    template <class Iter, class NodeType>
-    void swap(insert_return_type_map<Iter, NodeType>& x,
-      insert_return_type_map<Iter, NodeType>& y)
-    {
-      boost::core::invoke_swap(x.node, y.node);
-      boost::core::invoke_swap(x.inserted, y.inserted);
-      boost::core::invoke_swap(x.position, y.position);
-    }
-  } // namespace unordered
-
-  namespace serialization {
-    template <class K, class T, class H, class P, class A>
-    struct version<boost::unordered_map<K, T, H, P, A> >
-    {
-      BOOST_STATIC_CONSTANT(int, value = 1);
-    };
-
-    template <class K, class T, class H, class P, class A>
-    struct version<boost::unordered_multimap<K, T, H, P, A> >
-    {
-      BOOST_STATIC_CONSTANT(int, value = 1);
-    };
-  } // namespace serialization
-
-} // namespace boost
-
-#if defined(BOOST_MSVC)
-#pragma warning(pop)
-#endif
-
-#endif // BOOST_UNORDERED_UNORDERED_MAP_HPP_INCLUDED
diff --git a/src/boost/unordered/unordered_map_fwd.hpp b/src/boost/unordered/unordered_map_fwd.hpp
deleted file mode 100644
index b374965e..00000000
--- a/src/boost/unordered/unordered_map_fwd.hpp
+++ /dev/null
@@ -1,67 +0,0 @@
-
-// Copyright (C) 2008-2011 Daniel James.
-// Copyright (C) 2022-2023 Christian Mazakas
-// Distributed under the Boost Software License, Version 1.0. (See accompanying
-// file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
-
-#ifndef BOOST_UNORDERED_MAP_FWD_HPP_INCLUDED
-#define BOOST_UNORDERED_MAP_FWD_HPP_INCLUDED
-
-#include <boost/config.hpp>
-#if defined(BOOST_HAS_PRAGMA_ONCE)
-#pragma once
-#endif
-
-#include <boost/container_hash/hash_fwd.hpp>
-#include <functional>
-#include <memory>
-
-namespace boost {
-  namespace unordered {
-    template <class K, class T, class H = boost::hash<K>,
-      class P = std::equal_to<K>,
-      class A = std::allocator<std::pair<const K, T> > >
-    class unordered_map;
-
-    template <class K, class T, class H, class P, class A>
-    inline bool operator==(
-      unordered_map<K, T, H, P, A> const&, unordered_map<K, T, H, P, A> const&);
-    template <class K, class T, class H, class P, class A>
-    inline bool operator!=(
-      unordered_map<K, T, H, P, A> const&, unordered_map<K, T, H, P, A> const&);
-    template <class K, class T, class H, class P, class A>
-    inline void swap(unordered_map<K, T, H, P, A>& m1,
-      unordered_map<K, T, H, P, A>& m2) noexcept(noexcept(m1.swap(m2)));
-
-    template <class K, class T, class H, class P, class A, class Predicate>
-    typename unordered_map<K, T, H, P, A>::size_type erase_if(
-      unordered_map<K, T, H, P, A>& c, Predicate pred);
-
-    template <class K, class T, class H = boost::hash<K>,
-      class P = std::equal_to<K>,
-      class A = std::allocator<std::pair<const K, T> > >
-    class unordered_multimap;
-
-    template <class K, class T, class H, class P, class A>
-    inline bool operator==(unordered_multimap<K, T, H, P, A> const&,
-      unordered_multimap<K, T, H, P, A> const&);
-    template <class K, class T, class H, class P, class A>
-    inline bool operator!=(unordered_multimap<K, T, H, P, A> const&,
-      unordered_multimap<K, T, H, P, A> const&);
-    template <class K, class T, class H, class P, class A>
-    inline void swap(unordered_multimap<K, T, H, P, A>& m1,
-      unordered_multimap<K, T, H, P, A>& m2) noexcept(noexcept(m1.swap(m2)));
-
-    template <class K, class T, class H, class P, class A, class Predicate>
-    typename unordered_multimap<K, T, H, P, A>::size_type erase_if(
-      unordered_multimap<K, T, H, P, A>& c, Predicate pred);
-
-    template <class N, class K, class T, class A> class node_handle_map;
-    template <class Iter, class NodeType> struct insert_return_type_map;
-  } // namespace unordered
-
-  using boost::unordered::unordered_map;
-  using boost::unordered::unordered_multimap;
-} // namespace boost
-
-#endif
diff --git a/src/boost/unordered/unordered_set_fwd.hpp b/src/boost/unordered/unordered_set_fwd.hpp
deleted file mode 100644
index b74c6136..00000000
--- a/src/boost/unordered/unordered_set_fwd.hpp
+++ /dev/null
@@ -1,65 +0,0 @@
-
-// Copyright (C) 2008-2011 Daniel James.
-// Copyright (C) 2022 Christian Mazakas
-// Distributed under the Boost Software License, Version 1.0. (See accompanying
-// file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
-
-#ifndef BOOST_UNORDERED_SET_FWD_HPP_INCLUDED
-#define BOOST_UNORDERED_SET_FWD_HPP_INCLUDED
-
-#include <boost/config.hpp>
-#if defined(BOOST_HAS_PRAGMA_ONCE)
-#pragma once
-#endif
-
-#include <boost/container_hash/hash_fwd.hpp>
-#include <functional>
-#include <memory>
-
-namespace boost {
-  namespace unordered {
-    template <class T, class H = boost::hash<T>, class P = std::equal_to<T>,
-      class A = std::allocator<T> >
-    class unordered_set;
-
-    template <class T, class H, class P, class A>
-    inline bool operator==(
-      unordered_set<T, H, P, A> const&, unordered_set<T, H, P, A> const&);
-    template <class T, class H, class P, class A>
-    inline bool operator!=(
-      unordered_set<T, H, P, A> const&, unordered_set<T, H, P, A> const&);
-    template <class T, class H, class P, class A>
-    inline void swap(unordered_set<T, H, P, A>& m1,
-      unordered_set<T, H, P, A>& m2) noexcept(noexcept(m1.swap(m2)));
-
-    template <class K, class H, class P, class A, class Predicate>
-    typename unordered_set<K, H, P, A>::size_type erase_if(
-      unordered_set<K, H, P, A>& c, Predicate pred);
-
-    template <class T, class H = boost::hash<T>, class P = std::equal_to<T>,
-      class A = std::allocator<T> >
-    class unordered_multiset;
-
-    template <class T, class H, class P, class A>
-    inline bool operator==(unordered_multiset<T, H, P, A> const&,
-      unordered_multiset<T, H, P, A> const&);
-    template <class T, class H, class P, class A>
-    inline bool operator!=(unordered_multiset<T, H, P, A> const&,
-      unordered_multiset<T, H, P, A> const&);
-    template <class T, class H, class P, class A>
-    inline void swap(unordered_multiset<T, H, P, A>& m1,
-      unordered_multiset<T, H, P, A>& m2) noexcept(noexcept(m1.swap(m2)));
-
-    template <class K, class H, class P, class A, class Predicate>
-    typename unordered_multiset<K, H, P, A>::size_type erase_if(
-      unordered_multiset<K, H, P, A>& c, Predicate pred);
-
-    template <class N, class T, class A> class node_handle_set;
-    template <class Iter, class NodeType> struct insert_return_type_set;
-  } // namespace unordered
-
-  using boost::unordered::unordered_multiset;
-  using boost::unordered::unordered_set;
-} // namespace boost
-
-#endif
diff --git a/src/boost/utility/addressof.hpp b/src/boost/utility/addressof.hpp
deleted file mode 100644
index db4da804..00000000
--- a/src/boost/utility/addressof.hpp
+++ /dev/null
@@ -1,17 +0,0 @@
-/*
- * Copyright (c) 2014 Glen Fernandes
- *
- * Distributed under the Boost Software License, Version 1.0. (See
- * accompanying file LICENSE_1_0.txt or copy at
- * http://www.boost.org/LICENSE_1_0.txt)
- */
-
-#ifndef BOOST_UTILITY_ADDRESSOF_HPP
-#define BOOST_UTILITY_ADDRESSOF_HPP
-
-// The header file at this path is deprecated;
-// use boost/core/addressof.hpp instead.
-
-#include <boost/core/addressof.hpp>
-
-#endif
diff --git a/src/boost/visit_each.hpp b/src/boost/visit_each.hpp
deleted file mode 100644
index 6463ca9c..00000000
--- a/src/boost/visit_each.hpp
+++ /dev/null
@@ -1,27 +0,0 @@
-// Boost.Signals library
-
-// Copyright Douglas Gregor 2001-2003. Use, modification and
-// distribution is subject to the Boost Software License, Version
-// 1.0. (See accompanying file LICENSE_1_0.txt or copy at
-// http://www.boost.org/LICENSE_1_0.txt)
-
-// For more information, see http://www.boost.org/libs/signals
-
-#ifndef BOOST_VISIT_EACH_HPP
-#define BOOST_VISIT_EACH_HPP
-
-namespace boost {
-  template<typename Visitor, typename T>
-  inline void visit_each(Visitor& visitor, const T& t, long)
-  {
-    visitor(t);
-  }
-
-  template<typename Visitor, typename T>
-  inline void visit_each(Visitor& visitor, const T& t)
-  {
-    visit_each(visitor, t, 0);
-  }
-}
-
-#endif // BOOST_VISIT_EACH_HPP
diff --git a/src/boost/winapi/basic_types.hpp b/src/boost/winapi/basic_types.hpp
deleted file mode 100644
index 1b09cd61..00000000
--- a/src/boost/winapi/basic_types.hpp
+++ /dev/null
@@ -1,274 +0,0 @@
-/*
- * Copyright 2010 Vicente J. Botet Escriba
- * Copyright 2015-2018 Andrey Semashev
- *
- * Distributed under the Boost Software License, Version 1.0.
- * See http://www.boost.org/LICENSE_1_0.txt
- */
-
-#ifndef BOOST_WINAPI_BASIC_TYPES_HPP_INCLUDED_
-#define BOOST_WINAPI_BASIC_TYPES_HPP_INCLUDED_
-
-#include <boost/winapi/config.hpp>
-
-#ifdef BOOST_HAS_PRAGMA_ONCE
-#pragma once
-#endif
-
-#if defined(BOOST_USE_WINDOWS_H)
-# include <windows.h>
-#elif defined(WIN32) || defined(_WIN32) || defined(__WIN32__) || defined(__CYGWIN__)
-# ifdef UNDER_CE
-#  ifndef WINAPI
-#   ifndef _WIN32_WCE_EMULATION
-#    define WINAPI  __cdecl     // Note this doesn't match the desktop definition
-#   else
-#    define WINAPI  __stdcall
-#   endif
-#  endif
-// Windows CE defines a few functions as inline functions in kfuncs.h
-typedef int BOOL;
-typedef unsigned long DWORD;
-typedef void* HANDLE;
-typedef HANDLE HGLOBAL;
-typedef void* LPVOID;
-#  include <kfuncs.h>
-# endif // UNDER_CE
-#else
-# error "Win32 functions not available"
-#endif
-
-#include <boost/winapi/detail/header.hpp>
-
-#if defined(_M_IX86) || defined(__i386__)
-#define BOOST_WINAPI_DETAIL_STDCALL __stdcall
-#else
-// On architectures other than 32-bit x86 __stdcall is ignored. Clang also issues a warning.
-#define BOOST_WINAPI_DETAIL_STDCALL
-#endif
-
-#if defined(WINAPI)
-#define BOOST_WINAPI_WINAPI_CC WINAPI
-#else
-#define BOOST_WINAPI_WINAPI_CC BOOST_WINAPI_DETAIL_STDCALL
-#endif
-
-#if defined(CALLBACK)
-#define BOOST_WINAPI_CALLBACK_CC CALLBACK
-#else
-#define BOOST_WINAPI_CALLBACK_CC BOOST_WINAPI_DETAIL_STDCALL
-#endif
-
-#if defined(NTAPI)
-#define BOOST_WINAPI_NTAPI_CC NTAPI
-#else
-#define BOOST_WINAPI_NTAPI_CC BOOST_WINAPI_DETAIL_STDCALL
-#endif
-
-#ifndef NO_STRICT
-#ifndef STRICT
-#define STRICT 1
-#endif
-#endif
-
-#if defined(STRICT)
-#define BOOST_WINAPI_DETAIL_DECLARE_HANDLE(x) struct x##__; typedef struct x##__ *x
-#else
-#define BOOST_WINAPI_DETAIL_DECLARE_HANDLE(x) typedef void* x
-#endif
-
-#if !defined(BOOST_USE_WINDOWS_H)
-extern "C" {
-union _LARGE_INTEGER;
-struct _SECURITY_ATTRIBUTES;
-BOOST_WINAPI_DETAIL_DECLARE_HANDLE(HINSTANCE);
-typedef HINSTANCE HMODULE;
-}
-#endif
-
-#if defined(__GNUC__)
-#define BOOST_WINAPI_DETAIL_EXTENSION __extension__
-#else
-#define BOOST_WINAPI_DETAIL_EXTENSION
-#endif
-
-// MinGW64 gcc 4.8.2 fails to compile function declarations with boost::winapi::VOID_ arguments even though
-// the typedef expands to void. In Windows SDK, VOID is a macro which unfolds to void. We use our own macro in such cases.
-#define BOOST_WINAPI_DETAIL_VOID void
-
-namespace boost {
-namespace winapi {
-#if defined(BOOST_USE_WINDOWS_H)
-
-typedef ::BOOL BOOL_;
-typedef ::PBOOL PBOOL_;
-typedef ::LPBOOL LPBOOL_;
-typedef ::BOOLEAN BOOLEAN_;
-typedef ::PBOOLEAN PBOOLEAN_;
-typedef ::BYTE BYTE_;
-typedef ::PBYTE PBYTE_;
-typedef ::LPBYTE LPBYTE_;
-typedef ::UCHAR UCHAR_;
-typedef ::PUCHAR PUCHAR_;
-typedef ::WORD WORD_;
-typedef ::PWORD PWORD_;
-typedef ::LPWORD LPWORD_;
-typedef ::DWORD DWORD_;
-typedef ::PDWORD PDWORD_;
-typedef ::LPDWORD LPDWORD_;
-typedef ::HANDLE HANDLE_;
-typedef ::PHANDLE PHANDLE_;
-typedef ::SHORT SHORT_;
-typedef ::PSHORT PSHORT_;
-typedef ::USHORT USHORT_;
-typedef ::PUSHORT PUSHORT_;
-typedef ::INT INT_;
-typedef ::PINT PINT_;
-typedef ::LPINT LPINT_;
-typedef ::UINT UINT_;
-typedef ::PUINT PUINT_;
-typedef ::LONG LONG_;
-typedef ::PLONG PLONG_;
-typedef ::LPLONG LPLONG_;
-typedef ::ULONG ULONG_;
-typedef ::PULONG PULONG_;
-typedef ::LONGLONG ULONG64_;
-typedef ::ULONGLONG PULONG64_;
-typedef ::LONGLONG LONGLONG_;
-typedef ::ULONGLONG ULONGLONG_;
-typedef ::INT_PTR INT_PTR_;
-typedef ::UINT_PTR UINT_PTR_;
-typedef ::LONG_PTR LONG_PTR_;
-typedef ::ULONG_PTR ULONG_PTR_;
-typedef ::DWORD_PTR DWORD_PTR_;
-typedef ::PDWORD_PTR PDWORD_PTR_;
-typedef ::SIZE_T SIZE_T_;
-typedef ::PSIZE_T PSIZE_T_;
-typedef ::SSIZE_T SSIZE_T_;
-typedef ::PSSIZE_T PSSIZE_T_;
-typedef VOID VOID_; // VOID is a macro
-typedef ::PVOID PVOID_;
-typedef ::LPVOID LPVOID_;
-typedef ::LPCVOID LPCVOID_;
-typedef ::CHAR CHAR_;
-typedef ::LPSTR LPSTR_;
-typedef ::LPCSTR LPCSTR_;
-typedef ::WCHAR WCHAR_;
-typedef ::LPWSTR LPWSTR_;
-typedef ::LPCWSTR LPCWSTR_;
-
-#else // defined( BOOST_USE_WINDOWS_H )
-
-typedef int BOOL_;
-typedef BOOL_* PBOOL_;
-typedef BOOL_* LPBOOL_;
-typedef unsigned char BYTE_;
-typedef BYTE_* PBYTE_;
-typedef BYTE_* LPBYTE_;
-typedef unsigned char UCHAR_;
-typedef UCHAR_* PUCHAR_;
-typedef BYTE_ BOOLEAN_;
-typedef BOOLEAN_* PBOOLEAN_;
-typedef unsigned short WORD_;
-typedef WORD_* PWORD_;
-typedef WORD_* LPWORD_;
-#if !defined(__LP64__)
-typedef unsigned long DWORD_;
-#else
-typedef unsigned int DWORD_;
-#endif
-typedef DWORD_* PDWORD_;
-typedef DWORD_* LPDWORD_;
-typedef void* HANDLE_;
-typedef void** PHANDLE_;
-
-typedef short SHORT_;
-typedef SHORT_* PSHORT_;
-typedef unsigned short USHORT_;
-typedef USHORT_* PUSHORT_;
-typedef int INT_;
-typedef INT_* PINT_;
-typedef INT_* LPINT_;
-typedef unsigned int UINT_;
-typedef UINT_* PUINT_;
-#if !defined(__LP64__)
-typedef long LONG_;
-typedef unsigned long ULONG_;
-#else
-typedef int LONG_;
-typedef unsigned int ULONG_;
-#endif
-typedef LONG_* PLONG_;
-typedef LONG_* LPLONG_;
-typedef ULONG_* PULONG_;
-#if defined(BOOST_HAS_MS_INT64)
-BOOST_WINAPI_DETAIL_EXTENSION typedef __int64 LONGLONG_;
-BOOST_WINAPI_DETAIL_EXTENSION typedef unsigned __int64 ULONGLONG_;
-#else
-BOOST_WINAPI_DETAIL_EXTENSION typedef long long LONGLONG_;
-BOOST_WINAPI_DETAIL_EXTENSION typedef unsigned long long ULONGLONG_;
-#endif
-typedef LONGLONG_ LONG64_, *PLONG64_;
-typedef ULONGLONG_ ULONG64_, *PULONG64_;
-
-#if defined(_WIN64)
-typedef LONGLONG_ INT_PTR_;
-typedef ULONGLONG_ UINT_PTR_;
-typedef LONGLONG_ LONG_PTR_;
-typedef ULONGLONG_ ULONG_PTR_;
-#else
-typedef int INT_PTR_;
-typedef unsigned int UINT_PTR_;
-typedef long LONG_PTR_;
-typedef unsigned long ULONG_PTR_;
-#endif
-
-typedef ULONG_PTR_ DWORD_PTR_, *PDWORD_PTR_;
-typedef ULONG_PTR_ SIZE_T_, *PSIZE_T_;
-typedef LONG_PTR_ SSIZE_T_, *PSSIZE_T_;
-
-typedef void VOID_;
-typedef void *PVOID_;
-typedef void *LPVOID_;
-typedef const void *LPCVOID_;
-
-typedef char CHAR_;
-typedef CHAR_ *LPSTR_;
-typedef const CHAR_ *LPCSTR_;
-
-typedef wchar_t WCHAR_;
-typedef WCHAR_ *LPWSTR_;
-typedef const WCHAR_ *LPCWSTR_;
-
-#endif // defined( BOOST_USE_WINDOWS_H )
-
-// ::NTSTATUS is defined in ntdef.h or winternl.h in different Windows SDKs, and is not included by windows.h by default, so always use LONG_
-typedef LONG_ NTSTATUS_;
-typedef NTSTATUS_ *PNTSTATUS_;
-
-typedef ::HMODULE HMODULE_;
-
-typedef union BOOST_MAY_ALIAS _LARGE_INTEGER {
-    BOOST_WINAPI_DETAIL_EXTENSION struct {
-        DWORD_ LowPart;
-        LONG_ HighPart;
-    };
-    struct {
-        DWORD_ LowPart;
-        LONG_ HighPart;
-    } u;
-    LONGLONG_ QuadPart;
-} LARGE_INTEGER_, *PLARGE_INTEGER_;
-
-typedef struct BOOST_MAY_ALIAS _SECURITY_ATTRIBUTES {
-    DWORD_  nLength;
-    LPVOID_ lpSecurityDescriptor;
-    BOOL_   bInheritHandle;
-} SECURITY_ATTRIBUTES_, *PSECURITY_ATTRIBUTES_, *LPSECURITY_ATTRIBUTES_;
-
-}
-}
-
-#include <boost/winapi/detail/footer.hpp>
-
-#endif // BOOST_WINAPI_BASIC_TYPES_HPP_INCLUDED_
diff --git a/src/boost/winapi/config.hpp b/src/boost/winapi/config.hpp
deleted file mode 100644
index aadc0ae4..00000000
--- a/src/boost/winapi/config.hpp
+++ /dev/null
@@ -1,251 +0,0 @@
-/*
- * Copyright 2013, 2017 Andrey Semashev
- * Copyright 2017 James E. King, III
- *
- * Distributed under the Boost Software License, Version 1.0.
- * See http://www.boost.org/LICENSE_1_0.txt
- */
-
-#ifndef BOOST_WINAPI_CONFIG_HPP_INCLUDED_
-#define BOOST_WINAPI_CONFIG_HPP_INCLUDED_
-
-#include <boost/predef/version_number.h>
-#include <boost/predef/platform.h>
-#if defined(__CYGWIN__)
-// Cygwin 64 compiler does not define _WIN64 and instead defines it in a private header. We can't define _WIN64 ourselves because
-// the header defines the macro unconditionally and if the user includes both Boost.WinAPI and Cygwin WinAPI headers there will be conflict.
-#include <_cygwin.h>
-#endif
-#if defined(__MINGW32__)
-// MinGW and MinGW-w64 define __MINGW32_VERSION_MAJOR/MINOR and __MINGW64_VERSION_MAJOR/MINOR macros in a private header.
-#include <_mingw.h>
-#endif
-
-// BOOST_WINAPI_IS_MINGW indicates that the target Windows SDK is provided by MinGW (http://mingw.org/).
-// BOOST_WINAPI_IS_MINGW_W64 indicates that the target Windows SDK is provided by MinGW-w64 (http://mingw-w64.org).
-// BOOST_WINAPI_IS_CYGWIN indicates that the target Windows SDK is provided by MinGW variant from Cygwin (https://cygwin.com/).
-#if defined(__CYGWIN__)
-#define BOOST_WINAPI_IS_CYGWIN
-#elif BOOST_PLAT_MINGW
-#if defined(__MINGW64_VERSION_MAJOR)
-#define BOOST_WINAPI_IS_MINGW_W64
-#else
-#define BOOST_WINAPI_IS_MINGW
-#endif
-#endif
-
-// These constants reflect _WIN32_WINNT_* macros from sdkddkver.h
-// See also: http://msdn.microsoft.com/en-us/library/windows/desktop/aa383745%28v=vs.85%29.aspx#setting_winver_or__win32_winnt
-#define BOOST_WINAPI_VERSION_NT4 0x0400
-#define BOOST_WINAPI_VERSION_WIN2K 0x0500
-#define BOOST_WINAPI_VERSION_WINXP 0x0501
-#define BOOST_WINAPI_VERSION_WS03 0x0502
-#define BOOST_WINAPI_VERSION_WIN6 0x0600
-#define BOOST_WINAPI_VERSION_VISTA 0x0600
-#define BOOST_WINAPI_VERSION_WS08 0x0600
-#define BOOST_WINAPI_VERSION_LONGHORN 0x0600
-#define BOOST_WINAPI_VERSION_WIN7 0x0601
-#define BOOST_WINAPI_VERSION_WIN8 0x0602
-#define BOOST_WINAPI_VERSION_WINBLUE 0x0603
-#define BOOST_WINAPI_VERSION_WINTHRESHOLD 0x0A00
-#define BOOST_WINAPI_VERSION_WIN10 0x0A00
-
-// These constants reflect NTDDI_* macros from sdkddkver.h
-#define BOOST_WINAPI_NTDDI_WIN2K 0x05000000
-#define BOOST_WINAPI_NTDDI_WIN2KSP1 0x05000100
-#define BOOST_WINAPI_NTDDI_WIN2KSP2 0x05000200
-#define BOOST_WINAPI_NTDDI_WIN2KSP3 0x05000300
-#define BOOST_WINAPI_NTDDI_WIN2KSP4 0x05000400
-
-#define BOOST_WINAPI_NTDDI_WINXP 0x05010000
-#define BOOST_WINAPI_NTDDI_WINXPSP1 0x05010100
-#define BOOST_WINAPI_NTDDI_WINXPSP2 0x05010200
-#define BOOST_WINAPI_NTDDI_WINXPSP3 0x05010300
-#define BOOST_WINAPI_NTDDI_WINXPSP4 0x05010400
-
-#define BOOST_WINAPI_NTDDI_WS03 0x05020000
-#define BOOST_WINAPI_NTDDI_WS03SP1 0x05020100
-#define BOOST_WINAPI_NTDDI_WS03SP2 0x05020200
-#define BOOST_WINAPI_NTDDI_WS03SP3 0x05020300
-#define BOOST_WINAPI_NTDDI_WS03SP4 0x05020400
-
-#define BOOST_WINAPI_NTDDI_WIN6 0x06000000
-#define BOOST_WINAPI_NTDDI_WIN6SP1 0x06000100
-#define BOOST_WINAPI_NTDDI_WIN6SP2 0x06000200
-#define BOOST_WINAPI_NTDDI_WIN6SP3 0x06000300
-#define BOOST_WINAPI_NTDDI_WIN6SP4 0x06000400
-
-#define BOOST_WINAPI_NTDDI_VISTA BOOST_WINAPI_NTDDI_WIN6
-#define BOOST_WINAPI_NTDDI_VISTASP1 BOOST_WINAPI_NTDDI_WIN6SP1
-#define BOOST_WINAPI_NTDDI_VISTASP2 BOOST_WINAPI_NTDDI_WIN6SP2
-#define BOOST_WINAPI_NTDDI_VISTASP3 BOOST_WINAPI_NTDDI_WIN6SP3
-#define BOOST_WINAPI_NTDDI_VISTASP4 BOOST_WINAPI_NTDDI_WIN6SP4
-
-#define BOOST_WINAPI_NTDDI_LONGHORN  BOOST_WINAPI_NTDDI_VISTA
-
-#define BOOST_WINAPI_NTDDI_WS08 BOOST_WINAPI_NTDDI_WIN6SP1
-#define BOOST_WINAPI_NTDDI_WS08SP2 BOOST_WINAPI_NTDDI_WIN6SP2
-#define BOOST_WINAPI_NTDDI_WS08SP3 BOOST_WINAPI_NTDDI_WIN6SP3
-#define BOOST_WINAPI_NTDDI_WS08SP4 BOOST_WINAPI_NTDDI_WIN6SP4
-
-#define BOOST_WINAPI_NTDDI_WIN7 0x06010000
-#define BOOST_WINAPI_NTDDI_WIN7SP1 0x06010100 // Not defined in Windows SDK
-#define BOOST_WINAPI_NTDDI_WIN8 0x06020000
-#define BOOST_WINAPI_NTDDI_WINBLUE 0x06030000
-#define BOOST_WINAPI_NTDDI_WINTHRESHOLD 0x0A000000
-#define BOOST_WINAPI_NTDDI_WIN10 0x0A000000
-#define BOOST_WINAPI_NTDDI_WIN10_TH2 0x0A000001
-#define BOOST_WINAPI_NTDDI_WIN10_RS1 0x0A000002
-#define BOOST_WINAPI_NTDDI_WIN10_RS2 0x0A000003
-#define BOOST_WINAPI_NTDDI_WIN10_RS3 0x0A000004
-
-#define BOOST_WINAPI_DETAIL_MAKE_NTDDI_VERSION2(x) x##0000
-#define BOOST_WINAPI_DETAIL_MAKE_NTDDI_VERSION(x) BOOST_WINAPI_DETAIL_MAKE_NTDDI_VERSION2(x)
-
-#if !defined(BOOST_USE_WINAPI_VERSION)
-#if defined(_WIN32_WINNT)
-#define BOOST_USE_WINAPI_VERSION _WIN32_WINNT
-#elif defined(WINVER)
-#define BOOST_USE_WINAPI_VERSION WINVER
-#else
-// By default use Windows 10 API on compilers that support it and latest versions on the others
-#if (defined(_MSC_VER) && _MSC_VER < 1500) || defined(BOOST_WINAPI_IS_MINGW)
-#define BOOST_USE_WINAPI_VERSION BOOST_WINAPI_VERSION_WINXP
-#elif (defined(_MSC_VER) && _MSC_VER < 1600)
-#define BOOST_USE_WINAPI_VERSION BOOST_WINAPI_VERSION_WIN6
-#elif (defined(_MSC_VER) && _MSC_VER < 1700)
-#define BOOST_USE_WINAPI_VERSION BOOST_WINAPI_VERSION_WIN7
-#elif (defined(_MSC_VER) && _MSC_VER < 1800)
-#define BOOST_USE_WINAPI_VERSION BOOST_WINAPI_VERSION_WIN8
-#elif (defined(_MSC_VER) && _MSC_VER < 1900)
-#define BOOST_USE_WINAPI_VERSION BOOST_WINAPI_VERSION_WINBLUE
-#else
-#define BOOST_USE_WINAPI_VERSION BOOST_WINAPI_VERSION_WIN10
-#endif
-#endif
-#endif
-
-#if !defined(BOOST_USE_NTDDI_VERSION)
-#if defined(NTDDI_VERSION)
-#define BOOST_USE_NTDDI_VERSION NTDDI_VERSION
-// Default to respective Windows version with the latest Service Pack
-#elif BOOST_USE_WINAPI_VERSION == BOOST_WINAPI_VERSION_WIN2K
-#define BOOST_USE_NTDDI_VERSION BOOST_WINAPI_NTDDI_WIN2KSP4
-#elif BOOST_USE_WINAPI_VERSION == BOOST_WINAPI_VERSION_WINXP
-#define BOOST_USE_NTDDI_VERSION BOOST_WINAPI_NTDDI_WINXPSP3
-#elif BOOST_USE_WINAPI_VERSION == BOOST_WINAPI_VERSION_WS03
-#define BOOST_USE_NTDDI_VERSION BOOST_WINAPI_NTDDI_WS03SP2
-#elif BOOST_USE_WINAPI_VERSION == BOOST_WINAPI_VERSION_WIN6
-#define BOOST_USE_NTDDI_VERSION BOOST_WINAPI_NTDDI_WIN6SP2
-#elif BOOST_USE_WINAPI_VERSION == BOOST_WINAPI_VERSION_WIN7
-#define BOOST_USE_NTDDI_VERSION BOOST_WINAPI_NTDDI_WIN7SP1
-#elif BOOST_USE_WINAPI_VERSION == BOOST_WINAPI_VERSION_WIN10
-#define BOOST_USE_NTDDI_VERSION BOOST_WINAPI_NTDDI_WIN10_RS3
-#else
-#define BOOST_USE_NTDDI_VERSION BOOST_WINAPI_DETAIL_MAKE_NTDDI_VERSION(BOOST_USE_WINAPI_VERSION)
-#endif
-#endif
-
-// Known Windows SDK versions, taken from VER_PRODUCTBUILD macro value defined in ntverp.h.
-// These values can be used to compare with BOOST_PLAT_WINDOWS_SDK_VERSION from Boost.Predef.
-#define BOOST_WINAPI_WINDOWS_SDK_MSVC71 BOOST_VERSION_NUMBER(0, 0, 3668) // Windows SDK bundled with MSVC 7.1
-#define BOOST_WINAPI_WINDOWS_SDK_MSVC8 BOOST_VERSION_NUMBER(0, 0, 3790) // Windows SDK bundled with MSVC 8
-#define BOOST_WINAPI_WINDOWS_SDK_6_0 BOOST_VERSION_NUMBER(0, 0, 6000) // Windows SDK 6.0
-#define BOOST_WINAPI_WINDOWS_SDK_7_0 BOOST_VERSION_NUMBER(0, 0, 7600) // Windows SDK 7.0, 7.1
-#define BOOST_WINAPI_WINDOWS_SDK_8_0 BOOST_VERSION_NUMBER(0, 0, 9200) // Windows SDK 8.0
-#define BOOST_WINAPI_WINDOWS_SDK_8_1 BOOST_VERSION_NUMBER(0, 0, 9600) // Windows SDK 8.1
-#define BOOST_WINAPI_WINDOWS_SDK_10_0 BOOST_VERSION_NUMBER(0, 0, 10011) // Windows SDK 10.0
-// MinGW does not have the ntverp.h header but it defines VER_PRODUCTBUILD in ddk/ntifs.h.
-// Cygwin MinGW also defines this version.
-#define BOOST_WINAPI_WINDOWS_SDK_MINGW BOOST_VERSION_NUMBER(0, 0, 10000)
-// MinGW-w64 defines the same version as the Windows SDK bundled with MSVC 8
-#define BOOST_WINAPI_WINDOWS_SDK_MINGW_W64 BOOST_VERSION_NUMBER(0, 0, 3790)
-
-#if !defined(BOOST_USE_WINAPI_FAMILY)
-#if defined(WINAPI_FAMILY)
-#define BOOST_USE_WINAPI_FAMILY WINAPI_FAMILY
-#elif defined(WINAPI_FAMILY_DESKTOP_APP)
-// If none is specified, default to a desktop application which is the most
-// backwards compatible to previous ways of doing things, if families are even
-// defined.
-#define BOOST_USE_WINAPI_FAMILY WINAPI_FAMILY_DESKTOP_APP
-#endif
-#endif
-
-//
-// UWP Support
-//
-// On platforms without windows family partition support it is assumed one
-// has all APIs and access is controlled by _WIN32_WINNT or similar mechanisms.
-//
-// Leveraging Boost.Predef here
-//
-#if BOOST_PLAT_WINDOWS_UWP
-#define BOOST_WINAPI_PARTITION_APP           (BOOST_PLAT_WINDOWS_DESKTOP || BOOST_PLAT_WINDOWS_STORE || BOOST_WINAPI_PARTITION_PHONE)
-#define BOOST_WINAPI_PARTITION_PC            (BOOST_PLAT_WINDOWS_STORE)
-#define BOOST_WINAPI_PARTITION_PHONE         (BOOST_PLAT_WINDOWS_PHONE)
-#define BOOST_WINAPI_PARTITION_SYSTEM        (BOOST_PLAT_WINDOWS_SYSTEM)
-#define BOOST_WINAPI_PARTITION_SERVER        (BOOST_PLAT_WINDOWS_SERVER)
-#define BOOST_WINAPI_PARTITION_DESKTOP       (BOOST_PLAT_WINDOWS_DESKTOP)
-#else // BOOST_PLAT_WINDOWS_UWP
-#define BOOST_WINAPI_PARTITION_APP           (1)
-#define BOOST_WINAPI_PARTITION_PC            (1)
-#define BOOST_WINAPI_PARTITION_PHONE         (1)
-#define BOOST_WINAPI_PARTITION_SYSTEM        (1)
-#define BOOST_WINAPI_PARTITION_SERVER        (1)
-#define BOOST_WINAPI_PARTITION_DESKTOP       (1)
-#endif // BOOST_PLAT_WINDOWS_UWP
-
-//
-// Windows 8.x SDK defines some items in the DESKTOP partition and then Windows SDK 10.0 defines
-// the same items to be in APP or SYSTEM partitions, and APP expands to DESKTOP or PC or PHONE.
-// The definition of BOOST_WINAPI_PARTITION_APP_SYSTEM provides a universal way to get this
-// right as it is seen in a number of places in the SDK.
-//
-#define BOOST_WINAPI_PARTITION_APP_SYSTEM \
-    ( \
-        ((BOOST_PLAT_WINDOWS_SDK_VERSION >= BOOST_WINAPI_WINDOWS_SDK_10_0) && (BOOST_WINAPI_PARTITION_APP || BOOST_WINAPI_PARTITION_SYSTEM)) || \
-        ((BOOST_PLAT_WINDOWS_SDK_VERSION < BOOST_WINAPI_WINDOWS_SDK_10_0) && BOOST_WINAPI_PARTITION_DESKTOP) \
-    )
-
-// Simiarly, some other symbols were re-classified as DESKTOP or SYSTEM
-#define BOOST_WINAPI_PARTITION_DESKTOP_SYSTEM \
-    ( \
-        ((BOOST_PLAT_WINDOWS_SDK_VERSION >= BOOST_WINAPI_WINDOWS_SDK_10_0) && (BOOST_WINAPI_PARTITION_DESKTOP || BOOST_WINAPI_PARTITION_SYSTEM)) || \
-        ((BOOST_PLAT_WINDOWS_SDK_VERSION < BOOST_WINAPI_WINDOWS_SDK_10_0) && BOOST_WINAPI_PARTITION_DESKTOP) \
-    )
-
-#if defined(BOOST_USE_WINDOWS_H) || defined(BOOST_WINAPI_DEFINE_VERSION_MACROS)
-// We have to define the version macros so that windows.h provides the necessary symbols
-#if !defined(_WIN32_WINNT)
-#define _WIN32_WINNT BOOST_USE_WINAPI_VERSION
-#endif
-#if !defined(WINVER)
-#define WINVER BOOST_USE_WINAPI_VERSION
-#endif
-#if !defined(NTDDI_VERSION)
-#define NTDDI_VERSION BOOST_USE_NTDDI_VERSION
-#endif
-#if !defined(WINAPI_FAMILY) && defined(BOOST_USE_WINAPI_FAMILY)
-#define WINAPI_FAMILY BOOST_USE_WINAPI_FAMILY
-#endif
-#endif
-
-#if defined (WIN32_PLATFORM_PSPC)
-#define BOOST_WINAPI_IMPORT BOOST_SYMBOL_IMPORT
-#define BOOST_WINAPI_IMPORT_EXCEPT_WM
-#elif defined (_WIN32_WCE)
-#define BOOST_WINAPI_IMPORT
-#define BOOST_WINAPI_IMPORT_EXCEPT_WM
-#else
-#define BOOST_WINAPI_IMPORT BOOST_SYMBOL_IMPORT
-#define BOOST_WINAPI_IMPORT_EXCEPT_WM BOOST_SYMBOL_IMPORT
-#endif
-
-#include <boost/config.hpp>
-
-#ifdef BOOST_HAS_PRAGMA_ONCE
-#pragma once
-#endif
-
-#endif // BOOST_WINAPI_CONFIG_HPP_INCLUDED_
diff --git a/src/boost/winapi/detail/footer.hpp b/src/boost/winapi/detail/footer.hpp
deleted file mode 100644
index f5865685..00000000
--- a/src/boost/winapi/detail/footer.hpp
+++ /dev/null
@@ -1,21 +0,0 @@
-/*
- *             Copyright Andrey Semashev 2020.
- * Distributed under the Boost Software License, Version 1.0.
- *    (See accompanying file LICENSE_1_0.txt or copy at
- *          http://www.boost.org/LICENSE_1_0.txt)
- */
-
-#if !defined(BOOST_WINAPI_ENABLE_WARNINGS)
-
-#if defined(_MSC_VER) && !(defined(__INTEL_COMPILER) || defined(__clang__))
-
-#pragma warning(pop)
-
-#elif defined(__GNUC__) && !(defined(__INTEL_COMPILER) || defined(__ICL) || defined(__ICC) || defined(__ECC)) \
-    && (__GNUC__ * 100 + __GNUC_MINOR__) >= 406
-
-#pragma GCC diagnostic pop
-
-#endif
-
-#endif // !defined(BOOST_WINAPI_ENABLE_WARNINGS)
diff --git a/src/boost/winapi/detail/header.hpp b/src/boost/winapi/detail/header.hpp
deleted file mode 100644
index c03c42a2..00000000
--- a/src/boost/winapi/detail/header.hpp
+++ /dev/null
@@ -1,27 +0,0 @@
-/*
- *             Copyright Andrey Semashev 2020.
- * Distributed under the Boost Software License, Version 1.0.
- *    (See accompanying file LICENSE_1_0.txt or copy at
- *          http://www.boost.org/LICENSE_1_0.txt)
- */
-
-#if !defined(BOOST_WINAPI_ENABLE_WARNINGS)
-
-#if defined(_MSC_VER) && !(defined(__INTEL_COMPILER) || defined(__clang__))
-
-#pragma warning(push, 3)
-// nonstandard extension used : nameless struct/union
-#pragma warning(disable: 4201)
-// Inconsistent annotation for 'X'
-#pragma warning(disable: 28251)
-
-#elif defined(__GNUC__) && !(defined(__INTEL_COMPILER) || defined(__ICL) || defined(__ICC) || defined(__ECC)) \
-    && (__GNUC__ * 100 + __GNUC_MINOR__) >= 406
-
-#pragma GCC diagnostic push
-// ISO C++ 1998 does not support 'long long'
-#pragma GCC diagnostic ignored "-Wlong-long"
-
-#endif
-
-#endif // !defined(BOOST_WINAPI_ENABLE_WARNINGS)
diff --git a/src/boost/winapi/directory_management.hpp b/src/boost/winapi/directory_management.hpp
deleted file mode 100644
index b219010d..00000000
--- a/src/boost/winapi/directory_management.hpp
+++ /dev/null
@@ -1,106 +0,0 @@
-/*
- * Copyright 2010 Vicente J. Botet Escriba
- * Copyright 2015 Andrey Semashev
- *
- * Distributed under the Boost Software License, Version 1.0.
- * See http://www.boost.org/LICENSE_1_0.txt
- */
-
-#ifndef BOOST_WINAPI_DIRECTORY_MANAGEMENT_HPP_INCLUDED_
-#define BOOST_WINAPI_DIRECTORY_MANAGEMENT_HPP_INCLUDED_
-
-#include <boost/winapi/basic_types.hpp>
-#include <boost/winapi/get_system_directory.hpp>
-#include <boost/winapi/detail/header.hpp>
-
-#ifdef BOOST_HAS_PRAGMA_ONCE
-#pragma once
-#endif
-
-#if !defined( BOOST_USE_WINDOWS_H )
-extern "C" {
-#if !defined( BOOST_NO_ANSI_APIS )
-BOOST_WINAPI_IMPORT boost::winapi::BOOL_ BOOST_WINAPI_WINAPI_CC
-    CreateDirectoryA(boost::winapi::LPCSTR_, ::_SECURITY_ATTRIBUTES*);
-#if BOOST_WINAPI_PARTITION_APP_SYSTEM
-BOOST_WINAPI_IMPORT boost::winapi::DWORD_ BOOST_WINAPI_WINAPI_CC
-    GetTempPathA(boost::winapi::DWORD_ length, boost::winapi::LPSTR_ buffer);
-#endif
-BOOST_WINAPI_IMPORT boost::winapi::BOOL_ BOOST_WINAPI_WINAPI_CC
-    RemoveDirectoryA(boost::winapi::LPCSTR_);
-#endif
-BOOST_WINAPI_IMPORT_EXCEPT_WM boost::winapi::BOOL_ BOOST_WINAPI_WINAPI_CC
-    CreateDirectoryW(boost::winapi::LPCWSTR_, ::_SECURITY_ATTRIBUTES*);
-#if BOOST_WINAPI_PARTITION_APP_SYSTEM
-BOOST_WINAPI_IMPORT_EXCEPT_WM boost::winapi::DWORD_ BOOST_WINAPI_WINAPI_CC
-    GetTempPathW(boost::winapi::DWORD_ length, boost::winapi::LPWSTR_ buffer);
-#endif
-BOOST_WINAPI_IMPORT_EXCEPT_WM boost::winapi::BOOL_ BOOST_WINAPI_WINAPI_CC
-    RemoveDirectoryW(boost::winapi::LPCWSTR_);
-} // extern "C"
-#endif
-
-namespace boost {
-namespace winapi {
-
-#if !defined( BOOST_NO_ANSI_APIS )
-#if BOOST_WINAPI_PARTITION_APP_SYSTEM
-using ::GetTempPathA;
-#endif
-using ::RemoveDirectoryA;
-#endif
-#if BOOST_WINAPI_PARTITION_APP_SYSTEM
-using ::GetTempPathW;
-#endif
-using ::RemoveDirectoryW;
-
-#if !defined( BOOST_NO_ANSI_APIS )
-BOOST_FORCEINLINE BOOL_ CreateDirectoryA(LPCSTR_ pPathName, PSECURITY_ATTRIBUTES_ pSecurityAttributes)
-{
-    return ::CreateDirectoryA(pPathName, reinterpret_cast< ::_SECURITY_ATTRIBUTES* >(pSecurityAttributes));
-}
-#endif
-
-BOOST_FORCEINLINE BOOL_ CreateDirectoryW(LPCWSTR_ pPathName, PSECURITY_ATTRIBUTES_ pSecurityAttributes)
-{
-    return ::CreateDirectoryW(pPathName, reinterpret_cast< ::_SECURITY_ATTRIBUTES* >(pSecurityAttributes));
-}
-
-#if !defined( BOOST_NO_ANSI_APIS )
-BOOST_FORCEINLINE BOOL_ create_directory(LPCSTR_ pPathName, PSECURITY_ATTRIBUTES_ pSecurityAttributes)
-{
-    return ::CreateDirectoryA(pPathName, reinterpret_cast< ::_SECURITY_ATTRIBUTES* >(pSecurityAttributes));
-}
-#if BOOST_WINAPI_PARTITION_APP_SYSTEM
-BOOST_FORCEINLINE DWORD_ get_temp_path(DWORD_ length, LPSTR_ buffer)
-{
-    return ::GetTempPathA(length, buffer);
-}
-#endif
-BOOST_FORCEINLINE BOOL_ remove_directory(LPCSTR_ pPathName)
-{
-    return ::RemoveDirectoryA(pPathName);
-}
-#endif
-
-BOOST_FORCEINLINE BOOL_ create_directory(LPCWSTR_ pPathName, PSECURITY_ATTRIBUTES_ pSecurityAttributes)
-{
-    return ::CreateDirectoryW(pPathName, reinterpret_cast< ::_SECURITY_ATTRIBUTES* >(pSecurityAttributes));
-}
-#if BOOST_WINAPI_PARTITION_APP_SYSTEM
-BOOST_FORCEINLINE DWORD_ get_temp_path(DWORD_ length, LPWSTR_ buffer)
-{
-    return ::GetTempPathW(length, buffer);
-}
-#endif
-BOOST_FORCEINLINE BOOL_ remove_directory(LPCWSTR_ pPathName)
-{
-    return ::RemoveDirectoryW(pPathName);
-}
-
-} // namespace winapi
-} // namespace boost
-
-#include <boost/winapi/detail/footer.hpp>
-
-#endif // BOOST_WINAPI_DIRECTORY_MANAGEMENT_HPP_INCLUDED_
diff --git a/src/boost/winapi/dll.hpp b/src/boost/winapi/dll.hpp
deleted file mode 100644
index a4bb8d0f..00000000
--- a/src/boost/winapi/dll.hpp
+++ /dev/null
@@ -1,199 +0,0 @@
-/*
- * Copyright 2010 Vicente J. Botet Escriba
- * Copyright 2014 Renato Tegon Forti, Antony Polukhin
- * Copyright 2015, 2020 Andrey Semashev
- * Copyright 2015 Antony Polukhin
- *
- * Distributed under the Boost Software License, Version 1.0.
- * See http://www.boost.org/LICENSE_1_0.txt
- */
-
-#ifndef BOOST_WINAPI_DLL_HPP_INCLUDED_
-#define BOOST_WINAPI_DLL_HPP_INCLUDED_
-
-#include <boost/winapi/basic_types.hpp>
-#include <boost/winapi/get_proc_address.hpp>
-#include <boost/winapi/detail/header.hpp>
-
-#ifdef BOOST_HAS_PRAGMA_ONCE
-#pragma once
-#endif
-
-#if BOOST_WINAPI_PARTITION_DESKTOP || BOOST_WINAPI_PARTITION_SYSTEM
-
-#if !defined( BOOST_USE_WINDOWS_H )
-extern "C" {
-
-#if !defined( BOOST_NO_ANSI_APIS )
-BOOST_WINAPI_IMPORT boost::winapi::HMODULE_ BOOST_WINAPI_WINAPI_CC
-LoadLibraryA(boost::winapi::LPCSTR_ lpFileName);
-
-BOOST_WINAPI_IMPORT boost::winapi::HMODULE_ BOOST_WINAPI_WINAPI_CC
-LoadLibraryExA(
-    boost::winapi::LPCSTR_ lpFileName,
-    boost::winapi::HANDLE_ hFile,
-    boost::winapi::DWORD_ dwFlags
-);
-
-BOOST_WINAPI_IMPORT boost::winapi::HMODULE_ BOOST_WINAPI_WINAPI_CC
-GetModuleHandleA(boost::winapi::LPCSTR_ lpFileName);
-
-BOOST_WINAPI_IMPORT boost::winapi::DWORD_ BOOST_WINAPI_WINAPI_CC
-GetModuleFileNameA(
-    boost::winapi::HMODULE_ hModule,
-    boost::winapi::LPSTR_ lpFilename,
-    boost::winapi::DWORD_ nSize
-);
-#endif
-
-BOOST_WINAPI_IMPORT_EXCEPT_WM boost::winapi::HMODULE_ BOOST_WINAPI_WINAPI_CC
-LoadLibraryW(boost::winapi::LPCWSTR_ lpFileName);
-
-BOOST_WINAPI_IMPORT_EXCEPT_WM boost::winapi::HMODULE_ BOOST_WINAPI_WINAPI_CC
-LoadLibraryExW(
-    boost::winapi::LPCWSTR_ lpFileName,
-    boost::winapi::HANDLE_ hFile,
-    boost::winapi::DWORD_ dwFlags
-);
-
-BOOST_WINAPI_IMPORT_EXCEPT_WM boost::winapi::HMODULE_ BOOST_WINAPI_WINAPI_CC
-GetModuleHandleW(boost::winapi::LPCWSTR_ lpFileName);
-
-BOOST_WINAPI_IMPORT_EXCEPT_WM boost::winapi::DWORD_ BOOST_WINAPI_WINAPI_CC
-GetModuleFileNameW(
-    boost::winapi::HMODULE_ hModule,
-    boost::winapi::LPWSTR_ lpFilename,
-    boost::winapi::DWORD_ nSize
-);
-
-struct _MEMORY_BASIC_INFORMATION;
-
-#if !defined( BOOST_WINAPI_IS_MINGW )
-BOOST_WINAPI_IMPORT_EXCEPT_WM boost::winapi::SIZE_T_ BOOST_WINAPI_WINAPI_CC
-VirtualQuery(
-    boost::winapi::LPCVOID_ lpAddress,
-    ::_MEMORY_BASIC_INFORMATION* lpBuffer,
-    boost::winapi::SIZE_T_ dwLength
-);
-#else // !defined( BOOST_WINAPI_IS_MINGW )
-BOOST_WINAPI_IMPORT boost::winapi::DWORD_ BOOST_WINAPI_WINAPI_CC
-VirtualQuery(
-    boost::winapi::LPCVOID_ lpAddress,
-    ::_MEMORY_BASIC_INFORMATION* lpBuffer,
-    boost::winapi::DWORD_ dwLength
-);
-#endif // !defined( BOOST_WINAPI_IS_MINGW )
-} // extern "C"
-#endif // #if !defined( BOOST_USE_WINDOWS_H )
-
-namespace boost {
-namespace winapi {
-
-typedef struct BOOST_MAY_ALIAS MEMORY_BASIC_INFORMATION_ {
-    PVOID_  BaseAddress;
-    PVOID_  AllocationBase;
-    DWORD_  AllocationProtect;
-    SIZE_T_ RegionSize;
-    DWORD_  State;
-    DWORD_  Protect;
-    DWORD_  Type;
-} *PMEMORY_BASIC_INFORMATION_;
-
-#if defined( BOOST_USE_WINDOWS_H )
-BOOST_CONSTEXPR_OR_CONST DWORD_ DONT_RESOLVE_DLL_REFERENCES_           = DONT_RESOLVE_DLL_REFERENCES;
-BOOST_CONSTEXPR_OR_CONST DWORD_ LOAD_WITH_ALTERED_SEARCH_PATH_         = LOAD_WITH_ALTERED_SEARCH_PATH;
-#else // defined( BOOST_USE_WINDOWS_H )
-BOOST_CONSTEXPR_OR_CONST DWORD_ DONT_RESOLVE_DLL_REFERENCES_           = 0x00000001;
-BOOST_CONSTEXPR_OR_CONST DWORD_ LOAD_WITH_ALTERED_SEARCH_PATH_         = 0x00000008;
-#endif // defined( BOOST_USE_WINDOWS_H )
-
-// This one is not defined by MinGW
-BOOST_CONSTEXPR_OR_CONST DWORD_ LOAD_IGNORE_CODE_AUTHZ_LEVEL_          = 0x00000010;
-
-#if !defined( BOOST_NO_ANSI_APIS )
-using ::LoadLibraryA;
-using ::LoadLibraryExA;
-using ::GetModuleHandleA;
-using ::GetModuleFileNameA;
-#endif // !defined( BOOST_NO_ANSI_APIS )
-using ::LoadLibraryW;
-using ::LoadLibraryExW;
-using ::GetModuleHandleW;
-using ::GetModuleFileNameW;
-
-BOOST_FORCEINLINE SIZE_T_ VirtualQuery(LPCVOID_ lpAddress, MEMORY_BASIC_INFORMATION_* lpBuffer, SIZE_T_ dwLength)
-{
-    return ::VirtualQuery(lpAddress, reinterpret_cast< ::_MEMORY_BASIC_INFORMATION* >(lpBuffer), dwLength);
-}
-
-#if !defined( BOOST_NO_ANSI_APIS )
-BOOST_FORCEINLINE HMODULE_ load_library(LPCSTR_ lpFileName)
-{
-    return ::LoadLibraryA(lpFileName);
-}
-
-BOOST_FORCEINLINE HMODULE_ load_library_ex(LPCSTR_ lpFileName, HANDLE_ hFile, DWORD_ dwFlags)
-{
-    return ::LoadLibraryExA(lpFileName, hFile, dwFlags);
-}
-
-BOOST_FORCEINLINE HMODULE_ get_module_handle(LPCSTR_ lpFileName)
-{
-    return ::GetModuleHandleA(lpFileName);
-}
-
-BOOST_FORCEINLINE DWORD_ get_module_file_name(HMODULE_ hModule, LPSTR_ lpFilename, DWORD_ nSize)
-{
-    return ::GetModuleFileNameA(hModule, lpFilename, nSize);
-}
-#endif // #if !defined( BOOST_NO_ANSI_APIS )
-
-BOOST_FORCEINLINE HMODULE_ load_library(LPCWSTR_ lpFileName)
-{
-    return ::LoadLibraryW(lpFileName);
-}
-
-BOOST_FORCEINLINE HMODULE_ load_library_ex(LPCWSTR_ lpFileName, HANDLE_ hFile, DWORD_ dwFlags)
-{
-    return ::LoadLibraryExW(lpFileName, hFile, dwFlags);
-}
-
-BOOST_FORCEINLINE HMODULE_ get_module_handle(LPCWSTR_ lpFileName)
-{
-    return ::GetModuleHandleW(lpFileName);
-}
-
-BOOST_FORCEINLINE DWORD_ get_module_file_name(HMODULE_ hModule, LPWSTR_ lpFilename, DWORD_ nSize)
-{
-    return ::GetModuleFileNameW(hModule, lpFilename, nSize);
-}
-
-} // namespace winapi
-} // namespace boost
-
-#endif // BOOST_WINAPI_PARTITION_DESKTOP || BOOST_WINAPI_PARTITION_SYSTEM
-
-//
-// FreeLibrary is in a different partition set (slightly)
-//
-
-#if BOOST_WINAPI_PARTITION_APP || BOOST_WINAPI_PARTITION_SYSTEM
-
-#if !defined(BOOST_USE_WINDOWS_H)
-extern "C" {
-BOOST_WINAPI_IMPORT_EXCEPT_WM boost::winapi::BOOL_ BOOST_WINAPI_WINAPI_CC
-FreeLibrary(boost::winapi::HMODULE_ hModule);
-}
-#endif
-
-namespace boost {
-namespace winapi {
-using ::FreeLibrary;
-}
-}
-
-#endif // BOOST_WINAPI_PARTITION_APP || BOOST_WINAPI_PARTITION_SYSTEM
-
-#include <boost/winapi/detail/footer.hpp>
-
-#endif // BOOST_WINAPI_DLL_HPP_INCLUDED_
diff --git a/src/boost/winapi/error_codes.hpp b/src/boost/winapi/error_codes.hpp
deleted file mode 100644
index 7c6d71ec..00000000
--- a/src/boost/winapi/error_codes.hpp
+++ /dev/null
@@ -1,3181 +0,0 @@
-/*
- * Copyright 2016-2018 Andrey Semashev
- *
- * Distributed under the Boost Software License, Version 1.0.
- * See http://www.boost.org/LICENSE_1_0.txt
- */
-
-#ifndef BOOST_WINAPI_ERROR_CODES_HPP_INCLUDED_
-#define BOOST_WINAPI_ERROR_CODES_HPP_INCLUDED_
-
-#include <boost/winapi/basic_types.hpp>
-#include <boost/winapi/detail/header.hpp>
-
-#ifdef BOOST_HAS_PRAGMA_ONCE
-#pragma once
-#endif
-
-namespace boost {
-namespace winapi {
-
-BOOST_CONSTEXPR_OR_CONST DWORD_ FACILITY_NULL_ = 0;
-BOOST_CONSTEXPR_OR_CONST DWORD_ FACILITY_RPC_ = 1;
-BOOST_CONSTEXPR_OR_CONST DWORD_ FACILITY_DISPATCH_ = 2;
-BOOST_CONSTEXPR_OR_CONST DWORD_ FACILITY_STORAGE_ = 3;
-BOOST_CONSTEXPR_OR_CONST DWORD_ FACILITY_ITF_ = 4;
-BOOST_CONSTEXPR_OR_CONST DWORD_ FACILITY_WIN32_ = 7;
-BOOST_CONSTEXPR_OR_CONST DWORD_ FACILITY_WINDOWS_ = 8;
-BOOST_CONSTEXPR_OR_CONST DWORD_ FACILITY_SSPI_ = 9;
-BOOST_CONSTEXPR_OR_CONST DWORD_ FACILITY_SECURITY_ = 9;
-BOOST_CONSTEXPR_OR_CONST DWORD_ FACILITY_CONTROL_ = 10;
-BOOST_CONSTEXPR_OR_CONST DWORD_ FACILITY_CERT_ = 11;
-BOOST_CONSTEXPR_OR_CONST DWORD_ FACILITY_INTERNET_ = 12;
-BOOST_CONSTEXPR_OR_CONST DWORD_ FACILITY_MEDIASERVER_ = 13;
-BOOST_CONSTEXPR_OR_CONST DWORD_ FACILITY_MSMQ_ = 14;
-BOOST_CONSTEXPR_OR_CONST DWORD_ FACILITY_SETUPAPI_ = 15;
-BOOST_CONSTEXPR_OR_CONST DWORD_ FACILITY_SCARD_ = 16;
-BOOST_CONSTEXPR_OR_CONST DWORD_ FACILITY_COMPLUS_ = 17;
-BOOST_CONSTEXPR_OR_CONST DWORD_ FACILITY_AAF_ = 18;
-BOOST_CONSTEXPR_OR_CONST DWORD_ FACILITY_URT_ = 19;
-BOOST_CONSTEXPR_OR_CONST DWORD_ FACILITY_ACS_ = 20;
-BOOST_CONSTEXPR_OR_CONST DWORD_ FACILITY_DPLAY_ = 21;
-BOOST_CONSTEXPR_OR_CONST DWORD_ FACILITY_UMI_ = 22;
-BOOST_CONSTEXPR_OR_CONST DWORD_ FACILITY_SXS_ = 23;
-BOOST_CONSTEXPR_OR_CONST DWORD_ FACILITY_WINDOWS_CE_ = 24;
-BOOST_CONSTEXPR_OR_CONST DWORD_ FACILITY_HTTP_ = 25;
-BOOST_CONSTEXPR_OR_CONST DWORD_ FACILITY_USERMODE_COMMONLOG_ = 26;
-BOOST_CONSTEXPR_OR_CONST DWORD_ FACILITY_WER_ = 27;
-BOOST_CONSTEXPR_OR_CONST DWORD_ FACILITY_USERMODE_FILTER_MANAGER_ = 31;
-BOOST_CONSTEXPR_OR_CONST DWORD_ FACILITY_BACKGROUNDCOPY_ = 32;
-BOOST_CONSTEXPR_OR_CONST DWORD_ FACILITY_CONFIGURATION_ = 33;
-BOOST_CONSTEXPR_OR_CONST DWORD_ FACILITY_WIA_ = 33;
-BOOST_CONSTEXPR_OR_CONST DWORD_ FACILITY_STATE_MANAGEMENT_ = 34;
-BOOST_CONSTEXPR_OR_CONST DWORD_ FACILITY_METADIRECTORY_ = 35;
-BOOST_CONSTEXPR_OR_CONST DWORD_ FACILITY_WINDOWSUPDATE_ = 36;
-BOOST_CONSTEXPR_OR_CONST DWORD_ FACILITY_DIRECTORYSERVICE_ = 37;
-BOOST_CONSTEXPR_OR_CONST DWORD_ FACILITY_GRAPHICS_ = 38;
-BOOST_CONSTEXPR_OR_CONST DWORD_ FACILITY_SHELL_ = 39;
-BOOST_CONSTEXPR_OR_CONST DWORD_ FACILITY_NAP_ = 39;
-BOOST_CONSTEXPR_OR_CONST DWORD_ FACILITY_TPM_SERVICES_ = 40;
-BOOST_CONSTEXPR_OR_CONST DWORD_ FACILITY_TPM_SOFTWARE_ = 41;
-BOOST_CONSTEXPR_OR_CONST DWORD_ FACILITY_UI_ = 42;
-BOOST_CONSTEXPR_OR_CONST DWORD_ FACILITY_XAML_ = 43;
-BOOST_CONSTEXPR_OR_CONST DWORD_ FACILITY_ACTION_QUEUE_ = 44;
-BOOST_CONSTEXPR_OR_CONST DWORD_ FACILITY_PLA_ = 48;
-BOOST_CONSTEXPR_OR_CONST DWORD_ FACILITY_WINDOWS_SETUP_ = 48;
-BOOST_CONSTEXPR_OR_CONST DWORD_ FACILITY_FVE_ = 49;
-BOOST_CONSTEXPR_OR_CONST DWORD_ FACILITY_FWP_ = 50;
-BOOST_CONSTEXPR_OR_CONST DWORD_ FACILITY_WINRM_ = 51;
-BOOST_CONSTEXPR_OR_CONST DWORD_ FACILITY_NDIS_ = 52;
-BOOST_CONSTEXPR_OR_CONST DWORD_ FACILITY_USERMODE_HYPERVISOR_ = 53;
-BOOST_CONSTEXPR_OR_CONST DWORD_ FACILITY_CMI_ = 54;
-BOOST_CONSTEXPR_OR_CONST DWORD_ FACILITY_USERMODE_VIRTUALIZATION_ = 55;
-BOOST_CONSTEXPR_OR_CONST DWORD_ FACILITY_USERMODE_VOLMGR_ = 56;
-BOOST_CONSTEXPR_OR_CONST DWORD_ FACILITY_BCD_ = 57;
-BOOST_CONSTEXPR_OR_CONST DWORD_ FACILITY_USERMODE_VHD_ = 58;
-BOOST_CONSTEXPR_OR_CONST DWORD_ FACILITY_USERMODE_HNS_ = 59;
-BOOST_CONSTEXPR_OR_CONST DWORD_ FACILITY_SDIAG_ = 60;
-BOOST_CONSTEXPR_OR_CONST DWORD_ FACILITY_WEBSERVICES_ = 61;
-BOOST_CONSTEXPR_OR_CONST DWORD_ FACILITY_WINPE_ = 61;
-BOOST_CONSTEXPR_OR_CONST DWORD_ FACILITY_WPN_ = 62;
-BOOST_CONSTEXPR_OR_CONST DWORD_ FACILITY_WINDOWS_STORE_ = 63;
-BOOST_CONSTEXPR_OR_CONST DWORD_ FACILITY_INPUT_ = 64;
-BOOST_CONSTEXPR_OR_CONST DWORD_ FACILITY_EAP_ = 66;
-BOOST_CONSTEXPR_OR_CONST DWORD_ FACILITY_WINDOWS_DEFENDER_ = 80;
-BOOST_CONSTEXPR_OR_CONST DWORD_ FACILITY_OPC_ = 81;
-BOOST_CONSTEXPR_OR_CONST DWORD_ FACILITY_XPS_ = 82;
-BOOST_CONSTEXPR_OR_CONST DWORD_ FACILITY_MBN_ = 84;
-BOOST_CONSTEXPR_OR_CONST DWORD_ FACILITY_POWERSHELL_ = 84;
-BOOST_CONSTEXPR_OR_CONST DWORD_ FACILITY_RAS_ = 83;
-BOOST_CONSTEXPR_OR_CONST DWORD_ FACILITY_P2P_INT_ = 98;
-BOOST_CONSTEXPR_OR_CONST DWORD_ FACILITY_P2P_ = 99;
-BOOST_CONSTEXPR_OR_CONST DWORD_ FACILITY_DAF_ = 100;
-BOOST_CONSTEXPR_OR_CONST DWORD_ FACILITY_BLUETOOTH_ATT_ = 101;
-BOOST_CONSTEXPR_OR_CONST DWORD_ FACILITY_AUDIO_ = 102;
-BOOST_CONSTEXPR_OR_CONST DWORD_ FACILITY_STATEREPOSITORY_ = 103;
-BOOST_CONSTEXPR_OR_CONST DWORD_ FACILITY_VISUALCPP_ = 109;
-BOOST_CONSTEXPR_OR_CONST DWORD_ FACILITY_SCRIPT_ = 112;
-BOOST_CONSTEXPR_OR_CONST DWORD_ FACILITY_PARSE_ = 113;
-BOOST_CONSTEXPR_OR_CONST DWORD_ FACILITY_BLB_ = 120;
-BOOST_CONSTEXPR_OR_CONST DWORD_ FACILITY_BLB_CLI_ = 121;
-BOOST_CONSTEXPR_OR_CONST DWORD_ FACILITY_WSBAPP_ = 122;
-BOOST_CONSTEXPR_OR_CONST DWORD_ FACILITY_BLBUI_ = 128;
-BOOST_CONSTEXPR_OR_CONST DWORD_ FACILITY_USN_ = 129;
-BOOST_CONSTEXPR_OR_CONST DWORD_ FACILITY_USERMODE_VOLSNAP_ = 130;
-BOOST_CONSTEXPR_OR_CONST DWORD_ FACILITY_TIERING_ = 131;
-BOOST_CONSTEXPR_OR_CONST DWORD_ FACILITY_WSB_ONLINE_ = 133;
-BOOST_CONSTEXPR_OR_CONST DWORD_ FACILITY_ONLINE_ID_ = 134;
-BOOST_CONSTEXPR_OR_CONST DWORD_ FACILITY_DEVICE_UPDATE_AGENT_ = 135;
-BOOST_CONSTEXPR_OR_CONST DWORD_ FACILITY_DLS_ = 153;
-BOOST_CONSTEXPR_OR_CONST DWORD_ FACILITY_DELIVERY_OPTIMIZATION_ = 208;
-BOOST_CONSTEXPR_OR_CONST DWORD_ FACILITY_USERMODE_SPACES_ = 231;
-BOOST_CONSTEXPR_OR_CONST DWORD_ FACILITY_USER_MODE_SECURITY_CORE_ = 232;
-BOOST_CONSTEXPR_OR_CONST DWORD_ FACILITY_USERMODE_LICENSING_ = 234;
-BOOST_CONSTEXPR_OR_CONST DWORD_ FACILITY_SOS_ = 160;
-BOOST_CONSTEXPR_OR_CONST DWORD_ FACILITY_DEBUGGERS_ = 176;
-BOOST_CONSTEXPR_OR_CONST DWORD_ FACILITY_SPP_ = 256;
-BOOST_CONSTEXPR_OR_CONST DWORD_ FACILITY_RESTORE_ = 256;
-BOOST_CONSTEXPR_OR_CONST DWORD_ FACILITY_DMSERVER_ = 256;
-BOOST_CONSTEXPR_OR_CONST DWORD_ FACILITY_DEPLOYMENT_SERVICES_SERVER_ = 257;
-BOOST_CONSTEXPR_OR_CONST DWORD_ FACILITY_DEPLOYMENT_SERVICES_IMAGING_ = 258;
-BOOST_CONSTEXPR_OR_CONST DWORD_ FACILITY_DEPLOYMENT_SERVICES_MANAGEMENT_ = 259;
-BOOST_CONSTEXPR_OR_CONST DWORD_ FACILITY_DEPLOYMENT_SERVICES_UTIL_ = 260;
-BOOST_CONSTEXPR_OR_CONST DWORD_ FACILITY_DEPLOYMENT_SERVICES_BINLSVC_ = 261;
-BOOST_CONSTEXPR_OR_CONST DWORD_ FACILITY_DEPLOYMENT_SERVICES_PXE_ = 263;
-BOOST_CONSTEXPR_OR_CONST DWORD_ FACILITY_DEPLOYMENT_SERVICES_TFTP_ = 264;
-BOOST_CONSTEXPR_OR_CONST DWORD_ FACILITY_DEPLOYMENT_SERVICES_TRANSPORT_MANAGEMENT_ = 272;
-BOOST_CONSTEXPR_OR_CONST DWORD_ FACILITY_DEPLOYMENT_SERVICES_DRIVER_PROVISIONING_ = 278;
-BOOST_CONSTEXPR_OR_CONST DWORD_ FACILITY_DEPLOYMENT_SERVICES_MULTICAST_SERVER_ = 289;
-BOOST_CONSTEXPR_OR_CONST DWORD_ FACILITY_DEPLOYMENT_SERVICES_MULTICAST_CLIENT_ = 290;
-BOOST_CONSTEXPR_OR_CONST DWORD_ FACILITY_DEPLOYMENT_SERVICES_CONTENT_PROVIDER_ = 293;
-BOOST_CONSTEXPR_OR_CONST DWORD_ FACILITY_LINGUISTIC_SERVICES_ = 305;
-BOOST_CONSTEXPR_OR_CONST DWORD_ FACILITY_AUDIOSTREAMING_ = 1094;
-BOOST_CONSTEXPR_OR_CONST DWORD_ FACILITY_ACCELERATOR_ = 1536;
-BOOST_CONSTEXPR_OR_CONST DWORD_ FACILITY_WMAAECMA_ = 1996;
-BOOST_CONSTEXPR_OR_CONST DWORD_ FACILITY_DIRECTMUSIC_ = 2168;
-BOOST_CONSTEXPR_OR_CONST DWORD_ FACILITY_DIRECT3D10_ = 2169;
-BOOST_CONSTEXPR_OR_CONST DWORD_ FACILITY_DXGI_ = 2170;
-BOOST_CONSTEXPR_OR_CONST DWORD_ FACILITY_DXGI_DDI_ = 2171;
-BOOST_CONSTEXPR_OR_CONST DWORD_ FACILITY_DIRECT3D11_ = 2172;
-BOOST_CONSTEXPR_OR_CONST DWORD_ FACILITY_DIRECT3D11_DEBUG_ = 2173;
-BOOST_CONSTEXPR_OR_CONST DWORD_ FACILITY_DIRECT3D12_ = 2174;
-BOOST_CONSTEXPR_OR_CONST DWORD_ FACILITY_DIRECT3D12_DEBUG_ = 2175;
-BOOST_CONSTEXPR_OR_CONST DWORD_ FACILITY_LEAP_ = 2184;
-BOOST_CONSTEXPR_OR_CONST DWORD_ FACILITY_AUDCLNT_ = 2185;
-BOOST_CONSTEXPR_OR_CONST DWORD_ FACILITY_WINCODEC_DWRITE_DWM_ = 2200;
-BOOST_CONSTEXPR_OR_CONST DWORD_ FACILITY_DIRECT2D_ = 2201;
-BOOST_CONSTEXPR_OR_CONST DWORD_ FACILITY_DEFRAG_ = 2304;
-BOOST_CONSTEXPR_OR_CONST DWORD_ FACILITY_USERMODE_SDBUS_ = 2305;
-BOOST_CONSTEXPR_OR_CONST DWORD_ FACILITY_JSCRIPT_ = 2306;
-BOOST_CONSTEXPR_OR_CONST DWORD_ FACILITY_PIDGENX_ = 2561;
-BOOST_CONSTEXPR_OR_CONST DWORD_ FACILITY_EAS_ = 85;
-BOOST_CONSTEXPR_OR_CONST DWORD_ FACILITY_WEB_ = 885;
-BOOST_CONSTEXPR_OR_CONST DWORD_ FACILITY_WEB_SOCKET_ = 886;
-BOOST_CONSTEXPR_OR_CONST DWORD_ FACILITY_MOBILE_ = 1793;
-BOOST_CONSTEXPR_OR_CONST DWORD_ FACILITY_SQLITE_ = 1967;
-BOOST_CONSTEXPR_OR_CONST DWORD_ FACILITY_UTC_ = 1989;
-BOOST_CONSTEXPR_OR_CONST DWORD_ FACILITY_WEP_ = 2049;
-BOOST_CONSTEXPR_OR_CONST DWORD_ FACILITY_SYNCENGINE_ = 2050;
-BOOST_CONSTEXPR_OR_CONST DWORD_ FACILITY_XBOX_ = 2339;
-BOOST_CONSTEXPR_OR_CONST DWORD_ FACILITY_PIX_ = 2748;
-
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_SUCCESS_ = 0;
-BOOST_CONSTEXPR_OR_CONST DWORD_ NO_ERROR_ = 0;
-
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_INVALID_FUNCTION_ = 1;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_FILE_NOT_FOUND_ = 2;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_PATH_NOT_FOUND_ = 3;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_TOO_MANY_OPEN_FILES_ = 4;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_ACCESS_DENIED_ = 5;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_INVALID_HANDLE_ = 6;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_ARENA_TRASHED_ = 7;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_NOT_ENOUGH_MEMORY_ = 8;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_INVALID_BLOCK_ = 9;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_BAD_ENVIRONMENT_ = 10;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_BAD_FORMAT_ = 11;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_INVALID_ACCESS_ = 12;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_INVALID_DATA_ = 13;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_OUTOFMEMORY_ = 14;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_INVALID_DRIVE_ = 15;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_CURRENT_DIRECTORY_ = 16;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_NOT_SAME_DEVICE_ = 17;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_NO_MORE_FILES_ = 18;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_WRITE_PROTECT_ = 19;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_BAD_UNIT_ = 20;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_NOT_READY_ = 21;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_BAD_COMMAND_ = 22;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_CRC_ = 23;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_BAD_LENGTH_ = 24;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_SEEK_ = 25;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_NOT_DOS_DISK_ = 26;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_SECTOR_NOT_FOUND_ = 27;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_OUT_OF_PAPER_ = 28;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_WRITE_FAULT_ = 29;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_READ_FAULT_ = 30;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_GEN_FAILURE_ = 31;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_SHARING_VIOLATION_ = 32;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_LOCK_VIOLATION_ = 33;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_WRONG_DISK_ = 34;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_SHARING_BUFFER_EXCEEDED_ = 36;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_HANDLE_EOF_ = 38;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_HANDLE_DISK_FULL_ = 39;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_NOT_SUPPORTED_ = 50;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_REM_NOT_LIST_ = 51;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_DUP_NAME_ = 52;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_BAD_NETPATH_ = 53;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_NETWORK_BUSY_ = 54;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_DEV_NOT_EXIST_ = 55;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_TOO_MANY_CMDS_ = 56;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_ADAP_HDW_ERR_ = 57;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_BAD_NET_RESP_ = 58;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_UNEXP_NET_ERR_ = 59;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_BAD_REM_ADAP_ = 60;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_PRINTQ_FULL_ = 61;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_NO_SPOOL_SPACE_ = 62;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_PRINT_CANCELLED_ = 63;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_NETNAME_DELETED_ = 64;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_NETWORK_ACCESS_DENIED_ = 65;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_BAD_DEV_TYPE_ = 66;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_BAD_NET_NAME_ = 67;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_TOO_MANY_NAMES_ = 68;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_TOO_MANY_SESS_ = 69;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_SHARING_PAUSED_ = 70;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_REQ_NOT_ACCEP_ = 71;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_REDIR_PAUSED_ = 72;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_FILE_EXISTS_ = 80;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_CANNOT_MAKE_ = 82;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_FAIL_I24_ = 83;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_OUT_OF_STRUCTURES_ = 84;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_ALREADY_ASSIGNED_ = 85;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_INVALID_PASSWORD_ = 86;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_INVALID_PARAMETER_ = 87;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_NET_WRITE_FAULT_ = 88;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_NO_PROC_SLOTS_ = 89;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_TOO_MANY_SEMAPHORES_ = 100;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_EXCL_SEM_ALREADY_OWNED_ = 101;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_SEM_IS_SET_ = 102;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_TOO_MANY_SEM_REQUESTS_ = 103;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_INVALID_AT_INTERRUPT_TIME_ = 104;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_SEM_OWNER_DIED_ = 105;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_SEM_USER_LIMIT_ = 106;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_DISK_CHANGE_ = 107;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_DRIVE_LOCKED_ = 108;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_BROKEN_PIPE_ = 109;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_OPEN_FAILED_ = 110;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_BUFFER_OVERFLOW_ = 111;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_DISK_FULL_ = 112;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_NO_MORE_SEARCH_HANDLES_ = 113;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_INVALID_TARGET_HANDLE_ = 114;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_INVALID_CATEGORY_ = 117;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_INVALID_VERIFY_SWITCH_ = 118;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_BAD_DRIVER_LEVEL_ = 119;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_CALL_NOT_IMPLEMENTED_ = 120;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_SEM_TIMEOUT_ = 121;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_INSUFFICIENT_BUFFER_ = 122;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_INVALID_NAME_ = 123;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_INVALID_LEVEL_ = 124;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_NO_VOLUME_LABEL_ = 125;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_MOD_NOT_FOUND_ = 126;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_PROC_NOT_FOUND_ = 127;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_WAIT_NO_CHILDREN_ = 128;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_CHILD_NOT_COMPLETE_ = 129;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_DIRECT_ACCESS_HANDLE_ = 130;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_NEGATIVE_SEEK_ = 131;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_SEEK_ON_DEVICE_ = 132;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_IS_JOIN_TARGET_ = 133;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_IS_JOINED_ = 134;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_IS_SUBSTED_ = 135;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_NOT_JOINED_ = 136;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_NOT_SUBSTED_ = 137;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_JOIN_TO_JOIN_ = 138;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_SUBST_TO_SUBST_ = 139;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_JOIN_TO_SUBST_ = 140;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_SUBST_TO_JOIN_ = 141;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_BUSY_DRIVE_ = 142;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_SAME_DRIVE_ = 143;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_DIR_NOT_ROOT_ = 144;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_DIR_NOT_EMPTY_ = 145;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_IS_SUBST_PATH_ = 146;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_IS_JOIN_PATH_ = 147;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_PATH_BUSY_ = 148;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_IS_SUBST_TARGET_ = 149;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_SYSTEM_TRACE_ = 150;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_INVALID_EVENT_COUNT_ = 151;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_TOO_MANY_MUXWAITERS_ = 152;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_INVALID_LIST_FORMAT_ = 153;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_LABEL_TOO_LONG_ = 154;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_TOO_MANY_TCBS_ = 155;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_SIGNAL_REFUSED_ = 156;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_DISCARDED_ = 157;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_NOT_LOCKED_ = 158;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_BAD_THREADID_ADDR_ = 159;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_BAD_ARGUMENTS_ = 160;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_BAD_PATHNAME_ = 161;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_SIGNAL_PENDING_ = 162;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_MAX_THRDS_REACHED_ = 164;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_LOCK_FAILED_ = 167;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_BUSY_ = 170;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_DEVICE_SUPPORT_IN_PROGRESS_ = 171;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_CANCEL_VIOLATION_ = 173;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_ATOMIC_LOCKS_NOT_SUPPORTED_ = 174;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_INVALID_SEGMENT_NUMBER_ = 180;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_INVALID_ORDINAL_ = 182;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_ALREADY_EXISTS_ = 183;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_INVALID_FLAG_NUMBER_ = 186;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_SEM_NOT_FOUND_ = 187;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_INVALID_STARTING_CODESEG_ = 188;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_INVALID_STACKSEG_ = 189;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_INVALID_MODULETYPE_ = 190;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_INVALID_EXE_SIGNATURE_ = 191;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_EXE_MARKED_INVALID_ = 192;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_BAD_EXE_FORMAT_ = 193;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_ITERATED_DATA_EXCEEDS_64k_ = 194;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_INVALID_MINALLOCSIZE_ = 195;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_DYNLINK_FROM_INVALID_RING_ = 196;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_IOPL_NOT_ENABLED_ = 197;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_INVALID_SEGDPL_ = 198;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_AUTODATASEG_EXCEEDS_64k_ = 199;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_RING2SEG_MUST_BE_MOVABLE_ = 200;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_RELOC_CHAIN_XEEDS_SEGLIM_ = 201;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_INFLOOP_IN_RELOC_CHAIN_ = 202;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_ENVVAR_NOT_FOUND_ = 203;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_NO_SIGNAL_SENT_ = 205;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_FILENAME_EXCED_RANGE_ = 206;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_RING2_STACK_IN_USE_ = 207;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_META_EXPANSION_TOO_LONG_ = 208;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_INVALID_SIGNAL_NUMBER_ = 209;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_THREAD_1_INACTIVE_ = 210;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_LOCKED_ = 212;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_TOO_MANY_MODULES_ = 214;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_NESTING_NOT_ALLOWED_ = 215;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_EXE_MACHINE_TYPE_MISMATCH_ = 216;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_EXE_CANNOT_MODIFY_SIGNED_BINARY_ = 217;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_EXE_CANNOT_MODIFY_STRONG_SIGNED_BINARY_ = 218;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_FILE_CHECKED_OUT_ = 220;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_CHECKOUT_REQUIRED_ = 221;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_BAD_FILE_TYPE_ = 222;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_FILE_TOO_LARGE_ = 223;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_FORMS_AUTH_REQUIRED_ = 224;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_VIRUS_INFECTED_ = 225;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_VIRUS_DELETED_ = 226;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_PIPE_LOCAL_ = 229;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_BAD_PIPE_ = 230;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_PIPE_BUSY_ = 231;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_NO_DATA_ = 232;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_PIPE_NOT_CONNECTED_ = 233;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_MORE_DATA_ = 234;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_NO_WORK_DONE_ = 235;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_VC_DISCONNECTED_ = 240;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_INVALID_EA_NAME_ = 254;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_EA_LIST_INCONSISTENT_ = 255;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_NO_MORE_ITEMS_ = 259;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_CANNOT_COPY_ = 266;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_DIRECTORY_ = 267;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_EAS_DIDNT_FIT_ = 275;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_EA_FILE_CORRUPT_ = 276;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_EA_TABLE_FULL_ = 277;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_INVALID_EA_HANDLE_ = 278;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_EAS_NOT_SUPPORTED_ = 282;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_NOT_OWNER_ = 288;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_TOO_MANY_POSTS_ = 298;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_PARTIAL_COPY_ = 299;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_OPLOCK_NOT_GRANTED_ = 300;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_INVALID_OPLOCK_PROTOCOL_ = 301;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_DISK_TOO_FRAGMENTED_ = 302;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_DELETE_PENDING_ = 303;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_INCOMPATIBLE_WITH_GLOBAL_SHORT_NAME_REGISTRY_SETTING_ = 304;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_SHORT_NAMES_NOT_ENABLED_ON_VOLUME_ = 305;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_SECURITY_STREAM_IS_INCONSISTENT_ = 306;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_INVALID_LOCK_RANGE_ = 307;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_IMAGE_SUBSYSTEM_NOT_PRESENT_ = 308;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_NOTIFICATION_GUID_ALREADY_DEFINED_ = 309;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_INVALID_EXCEPTION_HANDLER_ = 310;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_DUPLICATE_PRIVILEGES_ = 311;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_NO_RANGES_PROCESSED_ = 312;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_NOT_ALLOWED_ON_SYSTEM_FILE_ = 313;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_DISK_RESOURCES_EXHAUSTED_ = 314;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_INVALID_TOKEN_ = 315;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_DEVICE_FEATURE_NOT_SUPPORTED_ = 316;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_MR_MID_NOT_FOUND_ = 317;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_SCOPE_NOT_FOUND_ = 318;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_UNDEFINED_SCOPE_ = 319;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_INVALID_CAP_ = 320;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_DEVICE_UNREACHABLE_ = 321;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_DEVICE_NO_RESOURCES_ = 322;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_DATA_CHECKSUM_ERROR_ = 323;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_INTERMIXED_KERNEL_EA_OPERATION_ = 324;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_FILE_LEVEL_TRIM_NOT_SUPPORTED_ = 326;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_OFFSET_ALIGNMENT_VIOLATION_ = 327;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_INVALID_FIELD_IN_PARAMETER_LIST_ = 328;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_OPERATION_IN_PROGRESS_ = 329;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_BAD_DEVICE_PATH_ = 330;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_TOO_MANY_DESCRIPTORS_ = 331;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_SCRUB_DATA_DISABLED_ = 332;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_NOT_REDUNDANT_STORAGE_ = 333;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_RESIDENT_FILE_NOT_SUPPORTED_ = 334;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_COMPRESSED_FILE_NOT_SUPPORTED_ = 335;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_DIRECTORY_NOT_SUPPORTED_ = 336;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_NOT_READ_FROM_COPY_ = 337;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_FT_WRITE_FAILURE_ = 338;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_FT_DI_SCAN_REQUIRED_ = 339;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_INVALID_KERNEL_INFO_VERSION_ = 340;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_INVALID_PEP_INFO_VERSION_ = 341;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_OBJECT_NOT_EXTERNALLY_BACKED_ = 342;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_EXTERNAL_BACKING_PROVIDER_UNKNOWN_ = 343;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_COMPRESSION_NOT_BENEFICIAL_ = 344;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_STORAGE_TOPOLOGY_ID_MISMATCH_ = 345;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_BLOCKED_BY_PARENTAL_CONTROLS_ = 346;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_BLOCK_TOO_MANY_REFERENCES_ = 347;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_MARKED_TO_DISALLOW_WRITES_ = 348;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_ENCLAVE_FAILURE_ = 349;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_FAIL_NOACTION_REBOOT_ = 350;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_FAIL_SHUTDOWN_ = 351;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_FAIL_RESTART_ = 352;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_MAX_SESSIONS_REACHED_ = 353;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_NETWORK_ACCESS_DENIED_EDP_ = 354;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_DEVICE_HINT_NAME_BUFFER_TOO_SMALL_ = 355;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_EDP_POLICY_DENIES_OPERATION_ = 356;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_EDP_DPL_POLICY_CANT_BE_SATISFIED_ = 357;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_CLOUD_FILE_SYNC_ROOT_METADATA_CORRUPT_ = 358;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_DEVICE_IN_MAINTENANCE_ = 359;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_NOT_SUPPORTED_ON_DAX_ = 360;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_DAX_MAPPING_EXISTS_ = 361;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_CLOUD_FILE_PROVIDER_NOT_RUNNING_ = 362;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_CLOUD_FILE_METADATA_CORRUPT_ = 363;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_CLOUD_FILE_METADATA_TOO_LARGE_ = 364;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_CLOUD_FILE_PROPERTY_BLOB_TOO_LARGE_ = 365;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_CLOUD_FILE_PROPERTY_BLOB_CHECKSUM_MISMATCH_ = 366;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_CHILD_PROCESS_BLOCKED_ = 367;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_STORAGE_LOST_DATA_PERSISTENCE_ = 368;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_FILE_SYSTEM_VIRTUALIZATION_UNAVAILABLE_ = 369;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_FILE_SYSTEM_VIRTUALIZATION_METADATA_CORRUPT_ = 370;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_FILE_SYSTEM_VIRTUALIZATION_BUSY_ = 371;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_FILE_SYSTEM_VIRTUALIZATION_PROVIDER_UNKNOWN_ = 372;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_GDI_HANDLE_LEAK_ = 373;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_CLOUD_FILE_TOO_MANY_PROPERTY_BLOBS_ = 374;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_CLOUD_FILE_PROPERTY_VERSION_NOT_SUPPORTED_ = 375;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_NOT_A_CLOUD_FILE_ = 376;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_CLOUD_FILE_NOT_IN_SYNC_ = 377;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_CLOUD_FILE_ALREADY_CONNECTED_ = 378;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_CLOUD_FILE_NOT_SUPPORTED_ = 379;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_CLOUD_FILE_INVALID_REQUEST_ = 380;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_CLOUD_FILE_READ_ONLY_VOLUME_ = 381;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_CLOUD_FILE_CONNECTED_PROVIDER_ONLY_ = 382;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_CLOUD_FILE_VALIDATION_FAILED_ = 383;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_SMB1_NOT_AVAILABLE_ = 384;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_FILE_SYSTEM_VIRTUALIZATION_INVALID_OPERATION_ = 385;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_CLOUD_FILE_AUTHENTICATION_FAILED_ = 386;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_CLOUD_FILE_INSUFFICIENT_RESOURCES_ = 387;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_CLOUD_FILE_NETWORK_UNAVAILABLE_ = 388;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_CLOUD_FILE_UNSUCCESSFUL_ = 389;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_CLOUD_FILE_NOT_UNDER_SYNC_ROOT_ = 390;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_CLOUD_FILE_IN_USE_ = 391;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_CLOUD_FILE_PINNED_ = 392;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_CLOUD_FILE_REQUEST_ABORTED_ = 393;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_CLOUD_FILE_PROPERTY_CORRUPT_ = 394;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_CLOUD_FILE_ACCESS_DENIED_ = 395;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_CLOUD_FILE_INCOMPATIBLE_HARDLINKS_ = 396;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_CLOUD_FILE_PROPERTY_LOCK_CONFLICT_ = 397;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_CLOUD_FILE_REQUEST_CANCELED_ = 398;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_EXTERNAL_SYSKEY_NOT_SUPPORTED_ = 399;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_THREAD_MODE_ALREADY_BACKGROUND_ = 400;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_THREAD_MODE_NOT_BACKGROUND_ = 401;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_PROCESS_MODE_ALREADY_BACKGROUND_ = 402;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_PROCESS_MODE_NOT_BACKGROUND_ = 403;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_CAPAUTHZ_NOT_DEVUNLOCKED_ = 450;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_CAPAUTHZ_CHANGE_TYPE_ = 451;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_CAPAUTHZ_NOT_PROVISIONED_ = 452;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_CAPAUTHZ_NOT_AUTHORIZED_ = 453;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_CAPAUTHZ_NO_POLICY_ = 454;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_CAPAUTHZ_DB_CORRUPTED_ = 455;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_CAPAUTHZ_SCCD_INVALID_CATALOG_ = 456;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_CAPAUTHZ_SCCD_NO_AUTH_ENTITY_ = 457;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_CAPAUTHZ_SCCD_PARSE_ERROR_ = 458;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_CAPAUTHZ_SCCD_DEV_MODE_REQUIRED_ = 459;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_CAPAUTHZ_SCCD_NO_CAPABILITY_MATCH_ = 460;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_PNP_QUERY_REMOVE_DEVICE_TIMEOUT_ = 480;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_PNP_QUERY_REMOVE_RELATED_DEVICE_TIMEOUT_ = 481;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_PNP_QUERY_REMOVE_UNRELATED_DEVICE_TIMEOUT_ = 482;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_DEVICE_HARDWARE_ERROR_ = 483;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_INVALID_ADDRESS_ = 487;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_VRF_CFG_ENABLED_ = 1183;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_PARTITION_TERMINATING_ = 1184;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_USER_PROFILE_LOAD_ = 500;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_ARITHMETIC_OVERFLOW_ = 534;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_PIPE_CONNECTED_ = 535;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_PIPE_LISTENING_ = 536;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_VERIFIER_STOP_ = 537;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_ABIOS_ERROR_ = 538;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_WX86_WARNING_ = 539;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_WX86_ERROR_ = 540;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_TIMER_NOT_CANCELED_ = 541;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_UNWIND_ = 542;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_BAD_STACK_ = 543;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_INVALID_UNWIND_TARGET_ = 544;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_INVALID_PORT_ATTRIBUTES_ = 545;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_PORT_MESSAGE_TOO_LONG_ = 546;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_INVALID_QUOTA_LOWER_ = 547;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_DEVICE_ALREADY_ATTACHED_ = 548;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_INSTRUCTION_MISALIGNMENT_ = 549;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_PROFILING_NOT_STARTED_ = 550;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_PROFILING_NOT_STOPPED_ = 551;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_COULD_NOT_INTERPRET_ = 552;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_PROFILING_AT_LIMIT_ = 553;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_CANT_WAIT_ = 554;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_CANT_TERMINATE_SELF_ = 555;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_UNEXPECTED_MM_CREATE_ERR_ = 556;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_UNEXPECTED_MM_MAP_ERROR_ = 557;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_UNEXPECTED_MM_EXTEND_ERR_ = 558;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_BAD_FUNCTION_TABLE_ = 559;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_NO_GUID_TRANSLATION_ = 560;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_INVALID_LDT_SIZE_ = 561;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_INVALID_LDT_OFFSET_ = 563;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_INVALID_LDT_DESCRIPTOR_ = 564;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_TOO_MANY_THREADS_ = 565;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_THREAD_NOT_IN_PROCESS_ = 566;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_PAGEFILE_QUOTA_EXCEEDED_ = 567;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_LOGON_SERVER_CONFLICT_ = 568;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_SYNCHRONIZATION_REQUIRED_ = 569;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_NET_OPEN_FAILED_ = 570;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_IO_PRIVILEGE_FAILED_ = 571;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_CONTROL_C_EXIT_ = 572;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_MISSING_SYSTEMFILE_ = 573;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_UNHANDLED_EXCEPTION_ = 574;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_APP_INIT_FAILURE_ = 575;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_PAGEFILE_CREATE_FAILED_ = 576;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_INVALID_IMAGE_HASH_ = 577;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_NO_PAGEFILE_ = 578;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_ILLEGAL_FLOAT_CONTEXT_ = 579;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_NO_EVENT_PAIR_ = 580;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_DOMAIN_CTRLR_CONFIG_ERROR_ = 581;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_ILLEGAL_CHARACTER_ = 582;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_UNDEFINED_CHARACTER_ = 583;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_FLOPPY_VOLUME_ = 584;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_BIOS_FAILED_TO_CONNECT_INTERRUPT_ = 585;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_BACKUP_CONTROLLER_ = 586;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_MUTANT_LIMIT_EXCEEDED_ = 587;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_FS_DRIVER_REQUIRED_ = 588;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_CANNOT_LOAD_REGISTRY_FILE_ = 589;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_DEBUG_ATTACH_FAILED_ = 590;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_SYSTEM_PROCESS_TERMINATED_ = 591;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_DATA_NOT_ACCEPTED_ = 592;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_VDM_HARD_ERROR_ = 593;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_DRIVER_CANCEL_TIMEOUT_ = 594;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_REPLY_MESSAGE_MISMATCH_ = 595;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_LOST_WRITEBEHIND_DATA_ = 596;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_CLIENT_SERVER_PARAMETERS_INVALID_ = 597;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_NOT_TINY_STREAM_ = 598;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_STACK_OVERFLOW_READ_ = 599;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_CONVERT_TO_LARGE_ = 600;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_FOUND_OUT_OF_SCOPE_ = 601;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_ALLOCATE_BUCKET_ = 602;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_MARSHALL_OVERFLOW_ = 603;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_INVALID_VARIANT_ = 604;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_BAD_COMPRESSION_BUFFER_ = 605;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_AUDIT_FAILED_ = 606;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_TIMER_RESOLUTION_NOT_SET_ = 607;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_INSUFFICIENT_LOGON_INFO_ = 608;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_BAD_DLL_ENTRYPOINT_ = 609;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_BAD_SERVICE_ENTRYPOINT_ = 610;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_IP_ADDRESS_CONFLICT1_ = 611;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_IP_ADDRESS_CONFLICT2_ = 612;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_REGISTRY_QUOTA_LIMIT_ = 613;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_NO_CALLBACK_ACTIVE_ = 614;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_PWD_TOO_SHORT_ = 615;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_PWD_TOO_RECENT_ = 616;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_PWD_HISTORY_CONFLICT_ = 617;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_UNSUPPORTED_COMPRESSION_ = 618;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_INVALID_HW_PROFILE_ = 619;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_INVALID_PLUGPLAY_DEVICE_PATH_ = 620;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_QUOTA_LIST_INCONSISTENT_ = 621;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_EVALUATION_EXPIRATION_ = 622;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_ILLEGAL_DLL_RELOCATION_ = 623;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_DLL_INIT_FAILED_LOGOFF_ = 624;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_VALIDATE_CONTINUE_ = 625;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_NO_MORE_MATCHES_ = 626;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_RANGE_LIST_CONFLICT_ = 627;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_SERVER_SID_MISMATCH_ = 628;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_CANT_ENABLE_DENY_ONLY_ = 629;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_FLOAT_MULTIPLE_FAULTS_ = 630;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_FLOAT_MULTIPLE_TRAPS_ = 631;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_NOINTERFACE_ = 632;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_DRIVER_FAILED_SLEEP_ = 633;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_CORRUPT_SYSTEM_FILE_ = 634;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_COMMITMENT_MINIMUM_ = 635;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_PNP_RESTART_ENUMERATION_ = 636;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_SYSTEM_IMAGE_BAD_SIGNATURE_ = 637;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_PNP_REBOOT_REQUIRED_ = 638;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_INSUFFICIENT_POWER_ = 639;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_MULTIPLE_FAULT_VIOLATION_ = 640;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_SYSTEM_SHUTDOWN_ = 641;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_PORT_NOT_SET_ = 642;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_DS_VERSION_CHECK_FAILURE_ = 643;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_RANGE_NOT_FOUND_ = 644;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_NOT_SAFE_MODE_DRIVER_ = 646;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_FAILED_DRIVER_ENTRY_ = 647;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_DEVICE_ENUMERATION_ERROR_ = 648;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_MOUNT_POINT_NOT_RESOLVED_ = 649;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_INVALID_DEVICE_OBJECT_PARAMETER_ = 650;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_MCA_OCCURED_ = 651;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_DRIVER_DATABASE_ERROR_ = 652;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_SYSTEM_HIVE_TOO_LARGE_ = 653;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_DRIVER_FAILED_PRIOR_UNLOAD_ = 654;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_VOLSNAP_PREPARE_HIBERNATE_ = 655;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_HIBERNATION_FAILURE_ = 656;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_PWD_TOO_LONG_ = 657;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_FILE_SYSTEM_LIMITATION_ = 665;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_ASSERTION_FAILURE_ = 668;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_ACPI_ERROR_ = 669;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_WOW_ASSERTION_ = 670;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_PNP_BAD_MPS_TABLE_ = 671;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_PNP_TRANSLATION_FAILED_ = 672;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_PNP_IRQ_TRANSLATION_FAILED_ = 673;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_PNP_INVALID_ID_ = 674;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_WAKE_SYSTEM_DEBUGGER_ = 675;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_HANDLES_CLOSED_ = 676;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_EXTRANEOUS_INFORMATION_ = 677;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_RXACT_COMMIT_NECESSARY_ = 678;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_MEDIA_CHECK_ = 679;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_GUID_SUBSTITUTION_MADE_ = 680;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_STOPPED_ON_SYMLINK_ = 681;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_LONGJUMP_ = 682;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_PLUGPLAY_QUERY_VETOED_ = 683;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_UNWIND_CONSOLIDATE_ = 684;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_REGISTRY_HIVE_RECOVERED_ = 685;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_DLL_MIGHT_BE_INSECURE_ = 686;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_DLL_MIGHT_BE_INCOMPATIBLE_ = 687;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_DBG_EXCEPTION_NOT_HANDLED_ = 688;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_DBG_REPLY_LATER_ = 689;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_DBG_UNABLE_TO_PROVIDE_HANDLE_ = 690;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_DBG_TERMINATE_THREAD_ = 691;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_DBG_TERMINATE_PROCESS_ = 692;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_DBG_CONTROL_C_ = 693;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_DBG_PRINTEXCEPTION_C_ = 694;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_DBG_RIPEXCEPTION_ = 695;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_DBG_CONTROL_BREAK_ = 696;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_DBG_COMMAND_EXCEPTION_ = 697;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_OBJECT_NAME_EXISTS_ = 698;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_THREAD_WAS_SUSPENDED_ = 699;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_IMAGE_NOT_AT_BASE_ = 700;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_RXACT_STATE_CREATED_ = 701;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_SEGMENT_NOTIFICATION_ = 702;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_BAD_CURRENT_DIRECTORY_ = 703;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_FT_READ_RECOVERY_FROM_BACKUP_ = 704;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_FT_WRITE_RECOVERY_ = 705;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_IMAGE_MACHINE_TYPE_MISMATCH_ = 706;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_RECEIVE_PARTIAL_ = 707;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_RECEIVE_EXPEDITED_ = 708;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_RECEIVE_PARTIAL_EXPEDITED_ = 709;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_EVENT_DONE_ = 710;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_EVENT_PENDING_ = 711;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_CHECKING_FILE_SYSTEM_ = 712;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_FATAL_APP_EXIT_ = 713;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_PREDEFINED_HANDLE_ = 714;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_WAS_UNLOCKED_ = 715;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_SERVICE_NOTIFICATION_ = 716;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_WAS_LOCKED_ = 717;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_LOG_HARD_ERROR_ = 718;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_ALREADY_WIN32_ = 719;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_IMAGE_MACHINE_TYPE_MISMATCH_EXE_ = 720;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_NO_YIELD_PERFORMED_ = 721;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_TIMER_RESUME_IGNORED_ = 722;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_ARBITRATION_UNHANDLED_ = 723;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_CARDBUS_NOT_SUPPORTED_ = 724;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_MP_PROCESSOR_MISMATCH_ = 725;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_HIBERNATED_ = 726;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_RESUME_HIBERNATION_ = 727;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_FIRMWARE_UPDATED_ = 728;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_DRIVERS_LEAKING_LOCKED_PAGES_ = 729;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_WAKE_SYSTEM_ = 730;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_WAIT_1_ = 731;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_WAIT_2_ = 732;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_WAIT_3_ = 733;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_WAIT_63_ = 734;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_ABANDONED_WAIT_0_ = 735;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_ABANDONED_WAIT_63_ = 736;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_USER_APC_ = 737;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_KERNEL_APC_ = 738;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_ALERTED_ = 739;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_ELEVATION_REQUIRED_ = 740;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_REPARSE_ = 741;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_OPLOCK_BREAK_IN_PROGRESS_ = 742;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_VOLUME_MOUNTED_ = 743;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_RXACT_COMMITTED_ = 744;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_NOTIFY_CLEANUP_ = 745;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_PRIMARY_TRANSPORT_CONNECT_FAILED_ = 746;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_PAGE_FAULT_TRANSITION_ = 747;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_PAGE_FAULT_DEMAND_ZERO_ = 748;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_PAGE_FAULT_COPY_ON_WRITE_ = 749;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_PAGE_FAULT_GUARD_PAGE_ = 750;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_PAGE_FAULT_PAGING_FILE_ = 751;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_CACHE_PAGE_LOCKED_ = 752;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_CRASH_DUMP_ = 753;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_BUFFER_ALL_ZEROS_ = 754;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_REPARSE_OBJECT_ = 755;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_RESOURCE_REQUIREMENTS_CHANGED_ = 756;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_TRANSLATION_COMPLETE_ = 757;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_NOTHING_TO_TERMINATE_ = 758;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_PROCESS_NOT_IN_JOB_ = 759;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_PROCESS_IN_JOB_ = 760;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_VOLSNAP_HIBERNATE_READY_ = 761;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_FSFILTER_OP_COMPLETED_SUCCESSFULLY_ = 762;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_INTERRUPT_VECTOR_ALREADY_CONNECTED_ = 763;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_INTERRUPT_STILL_CONNECTED_ = 764;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_WAIT_FOR_OPLOCK_ = 765;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_DBG_EXCEPTION_HANDLED_ = 766;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_DBG_CONTINUE_ = 767;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_CALLBACK_POP_STACK_ = 768;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_COMPRESSION_DISABLED_ = 769;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_CANTFETCHBACKWARDS_ = 770;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_CANTSCROLLBACKWARDS_ = 771;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_ROWSNOTRELEASED_ = 772;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_BAD_ACCESSOR_FLAGS_ = 773;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_ERRORS_ENCOUNTERED_ = 774;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_NOT_CAPABLE_ = 775;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_REQUEST_OUT_OF_SEQUENCE_ = 776;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_VERSION_PARSE_ERROR_ = 777;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_BADSTARTPOSITION_ = 778;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_MEMORY_HARDWARE_ = 779;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_DISK_REPAIR_DISABLED_ = 780;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_INSUFFICIENT_RESOURCE_FOR_SPECIFIED_SHARED_SECTION_SIZE_ = 781;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_SYSTEM_POWERSTATE_TRANSITION_ = 782;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_SYSTEM_POWERSTATE_COMPLEX_TRANSITION_ = 783;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_MCA_EXCEPTION_ = 784;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_ACCESS_AUDIT_BY_POLICY_ = 785;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_ACCESS_DISABLED_NO_SAFER_UI_BY_POLICY_ = 786;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_ABANDON_HIBERFILE_ = 787;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_LOST_WRITEBEHIND_DATA_NETWORK_DISCONNECTED_ = 788;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_LOST_WRITEBEHIND_DATA_NETWORK_SERVER_ERROR_ = 789;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_LOST_WRITEBEHIND_DATA_LOCAL_DISK_ERROR_ = 790;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_BAD_MCFG_TABLE_ = 791;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_DISK_REPAIR_REDIRECTED_ = 792;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_DISK_REPAIR_UNSUCCESSFUL_ = 793;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_CORRUPT_LOG_OVERFULL_ = 794;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_CORRUPT_LOG_CORRUPTED_ = 795;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_CORRUPT_LOG_UNAVAILABLE_ = 796;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_CORRUPT_LOG_DELETED_FULL_ = 797;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_CORRUPT_LOG_CLEARED_ = 798;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_ORPHAN_NAME_EXHAUSTED_ = 799;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_OPLOCK_SWITCHED_TO_NEW_HANDLE_ = 800;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_CANNOT_GRANT_REQUESTED_OPLOCK_ = 801;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_CANNOT_BREAK_OPLOCK_ = 802;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_OPLOCK_HANDLE_CLOSED_ = 803;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_NO_ACE_CONDITION_ = 804;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_INVALID_ACE_CONDITION_ = 805;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_FILE_HANDLE_REVOKED_ = 806;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_IMAGE_AT_DIFFERENT_BASE_ = 807;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_ENCRYPTED_IO_NOT_POSSIBLE_ = 808;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_FILE_METADATA_OPTIMIZATION_IN_PROGRESS_ = 809;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_QUOTA_ACTIVITY_ = 810;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_HANDLE_REVOKED_ = 811;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_CALLBACK_INVOKE_INLINE_ = 812;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_CPU_SET_INVALID_ = 813;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_ENCLAVE_NOT_TERMINATED_ = 814;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_EA_ACCESS_DENIED_ = 994;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_OPERATION_ABORTED_ = 995;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_IO_INCOMPLETE_ = 996;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_IO_PENDING_ = 997;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_NOACCESS_ = 998;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_SWAPERROR_ = 999;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_STACK_OVERFLOW_ = 1001;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_INVALID_MESSAGE_ = 1002;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_CAN_NOT_COMPLETE_ = 1003;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_INVALID_FLAGS_ = 1004;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_UNRECOGNIZED_VOLUME_ = 1005;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_FILE_INVALID_ = 1006;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_FULLSCREEN_MODE_ = 1007;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_NO_TOKEN_ = 1008;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_BADDB_ = 1009;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_BADKEY_ = 1010;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_CANTOPEN_ = 1011;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_CANTREAD_ = 1012;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_CANTWRITE_ = 1013;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_REGISTRY_RECOVERED_ = 1014;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_REGISTRY_CORRUPT_ = 1015;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_REGISTRY_IO_FAILED_ = 1016;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_NOT_REGISTRY_FILE_ = 1017;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_KEY_DELETED_ = 1018;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_NO_LOG_SPACE_ = 1019;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_KEY_HAS_CHILDREN_ = 1020;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_CHILD_MUST_BE_VOLATILE_ = 1021;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_NOTIFY_ENUM_DIR_ = 1022;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_DEPENDENT_SERVICES_RUNNING_ = 1051;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_INVALID_SERVICE_CONTROL_ = 1052;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_SERVICE_REQUEST_TIMEOUT_ = 1053;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_SERVICE_NO_THREAD_ = 1054;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_SERVICE_DATABASE_LOCKED_ = 1055;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_SERVICE_ALREADY_RUNNING_ = 1056;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_INVALID_SERVICE_ACCOUNT_ = 1057;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_SERVICE_DISABLED_ = 1058;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_CIRCULAR_DEPENDENCY_ = 1059;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_SERVICE_DOES_NOT_EXIST_ = 1060;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_SERVICE_CANNOT_ACCEPT_CTRL_ = 1061;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_SERVICE_NOT_ACTIVE_ = 1062;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_FAILED_SERVICE_CONTROLLER_CONNECT_ = 1063;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_EXCEPTION_IN_SERVICE_ = 1064;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_DATABASE_DOES_NOT_EXIST_ = 1065;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_SERVICE_SPECIFIC_ERROR_ = 1066;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_PROCESS_ABORTED_ = 1067;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_SERVICE_DEPENDENCY_FAIL_ = 1068;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_SERVICE_LOGON_FAILED_ = 1069;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_SERVICE_START_HANG_ = 1070;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_INVALID_SERVICE_LOCK_ = 1071;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_SERVICE_MARKED_FOR_DELETE_ = 1072;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_SERVICE_EXISTS_ = 1073;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_ALREADY_RUNNING_LKG_ = 1074;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_SERVICE_DEPENDENCY_DELETED_ = 1075;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_BOOT_ALREADY_ACCEPTED_ = 1076;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_SERVICE_NEVER_STARTED_ = 1077;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_DUPLICATE_SERVICE_NAME_ = 1078;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_DIFFERENT_SERVICE_ACCOUNT_ = 1079;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_CANNOT_DETECT_DRIVER_FAILURE_ = 1080;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_CANNOT_DETECT_PROCESS_ABORT_ = 1081;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_NO_RECOVERY_PROGRAM_ = 1082;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_SERVICE_NOT_IN_EXE_ = 1083;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_NOT_SAFEBOOT_SERVICE_ = 1084;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_END_OF_MEDIA_ = 1100;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_FILEMARK_DETECTED_ = 1101;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_BEGINNING_OF_MEDIA_ = 1102;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_SETMARK_DETECTED_ = 1103;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_NO_DATA_DETECTED_ = 1104;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_PARTITION_FAILURE_ = 1105;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_INVALID_BLOCK_LENGTH_ = 1106;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_DEVICE_NOT_PARTITIONED_ = 1107;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_UNABLE_TO_LOCK_MEDIA_ = 1108;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_UNABLE_TO_UNLOAD_MEDIA_ = 1109;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_MEDIA_CHANGED_ = 1110;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_BUS_RESET_ = 1111;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_NO_MEDIA_IN_DRIVE_ = 1112;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_NO_UNICODE_TRANSLATION_ = 1113;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_DLL_INIT_FAILED_ = 1114;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_SHUTDOWN_IN_PROGRESS_ = 1115;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_NO_SHUTDOWN_IN_PROGRESS_ = 1116;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_IO_DEVICE_ = 1117;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_SERIAL_NO_DEVICE_ = 1118;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_IRQ_BUSY_ = 1119;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_MORE_WRITES_ = 1120;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_COUNTER_TIMEOUT_ = 1121;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_FLOPPY_ID_MARK_NOT_FOUND_ = 1122;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_FLOPPY_WRONG_CYLINDER_ = 1123;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_FLOPPY_UNKNOWN_ERROR_ = 1124;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_FLOPPY_BAD_REGISTERS_ = 1125;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_DISK_RECALIBRATE_FAILED_ = 1126;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_DISK_OPERATION_FAILED_ = 1127;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_DISK_RESET_FAILED_ = 1128;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_EOM_OVERFLOW_ = 1129;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_NOT_ENOUGH_SERVER_MEMORY_ = 1130;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_POSSIBLE_DEADLOCK_ = 1131;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_MAPPED_ALIGNMENT_ = 1132;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_SET_POWER_STATE_VETOED_ = 1140;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_SET_POWER_STATE_FAILED_ = 1141;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_TOO_MANY_LINKS_ = 1142;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_OLD_WIN_VERSION_ = 1150;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_APP_WRONG_OS_ = 1151;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_SINGLE_INSTANCE_APP_ = 1152;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_RMODE_APP_ = 1153;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_INVALID_DLL_ = 1154;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_NO_ASSOCIATION_ = 1155;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_DDE_FAIL_ = 1156;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_DLL_NOT_FOUND_ = 1157;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_NO_MORE_USER_HANDLES_ = 1158;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_MESSAGE_SYNC_ONLY_ = 1159;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_SOURCE_ELEMENT_EMPTY_ = 1160;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_DESTINATION_ELEMENT_FULL_ = 1161;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_ILLEGAL_ELEMENT_ADDRESS_ = 1162;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_MAGAZINE_NOT_PRESENT_ = 1163;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_DEVICE_REINITIALIZATION_NEEDED_ = 1164;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_DEVICE_REQUIRES_CLEANING_ = 1165;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_DEVICE_DOOR_OPEN_ = 1166;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_DEVICE_NOT_CONNECTED_ = 1167;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_NOT_FOUND_ = 1168;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_NO_MATCH_ = 1169;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_SET_NOT_FOUND_ = 1170;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_POINT_NOT_FOUND_ = 1171;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_NO_TRACKING_SERVICE_ = 1172;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_NO_VOLUME_ID_ = 1173;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_UNABLE_TO_REMOVE_REPLACED_ = 1175;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_UNABLE_TO_MOVE_REPLACEMENT_ = 1176;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_UNABLE_TO_MOVE_REPLACEMENT_2_ = 1177;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_JOURNAL_DELETE_IN_PROGRESS_ = 1178;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_JOURNAL_NOT_ACTIVE_ = 1179;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_POTENTIAL_FILE_FOUND_ = 1180;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_JOURNAL_ENTRY_DELETED_ = 1181;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_SHUTDOWN_IS_SCHEDULED_ = 1190;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_SHUTDOWN_USERS_LOGGED_ON_ = 1191;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_BAD_DEVICE_ = 1200;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_CONNECTION_UNAVAIL_ = 1201;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_DEVICE_ALREADY_REMEMBERED_ = 1202;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_NO_NET_OR_BAD_PATH_ = 1203;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_BAD_PROVIDER_ = 1204;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_CANNOT_OPEN_PROFILE_ = 1205;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_BAD_PROFILE_ = 1206;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_NOT_CONTAINER_ = 1207;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_EXTENDED_ERROR_ = 1208;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_INVALID_GROUPNAME_ = 1209;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_INVALID_COMPUTERNAME_ = 1210;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_INVALID_EVENTNAME_ = 1211;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_INVALID_DOMAINNAME_ = 1212;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_INVALID_SERVICENAME_ = 1213;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_INVALID_NETNAME_ = 1214;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_INVALID_SHARENAME_ = 1215;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_INVALID_PASSWORDNAME_ = 1216;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_INVALID_MESSAGENAME_ = 1217;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_INVALID_MESSAGEDEST_ = 1218;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_SESSION_CREDENTIAL_CONFLICT_ = 1219;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_REMOTE_SESSION_LIMIT_EXCEEDED_ = 1220;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_DUP_DOMAINNAME_ = 1221;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_NO_NETWORK_ = 1222;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_CANCELLED_ = 1223;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_USER_MAPPED_FILE_ = 1224;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_CONNECTION_REFUSED_ = 1225;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_GRACEFUL_DISCONNECT_ = 1226;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_ADDRESS_ALREADY_ASSOCIATED_ = 1227;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_ADDRESS_NOT_ASSOCIATED_ = 1228;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_CONNECTION_INVALID_ = 1229;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_CONNECTION_ACTIVE_ = 1230;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_NETWORK_UNREACHABLE_ = 1231;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_HOST_UNREACHABLE_ = 1232;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_PROTOCOL_UNREACHABLE_ = 1233;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_PORT_UNREACHABLE_ = 1234;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_REQUEST_ABORTED_ = 1235;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_CONNECTION_ABORTED_ = 1236;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_RETRY_ = 1237;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_CONNECTION_COUNT_LIMIT_ = 1238;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_LOGIN_TIME_RESTRICTION_ = 1239;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_LOGIN_WKSTA_RESTRICTION_ = 1240;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_INCORRECT_ADDRESS_ = 1241;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_ALREADY_REGISTERED_ = 1242;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_SERVICE_NOT_FOUND_ = 1243;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_NOT_AUTHENTICATED_ = 1244;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_NOT_LOGGED_ON_ = 1245;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_CONTINUE_ = 1246;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_ALREADY_INITIALIZED_ = 1247;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_NO_MORE_DEVICES_ = 1248;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_NO_SUCH_SITE_ = 1249;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_DOMAIN_CONTROLLER_EXISTS_ = 1250;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_ONLY_IF_CONNECTED_ = 1251;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_OVERRIDE_NOCHANGES_ = 1252;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_BAD_USER_PROFILE_ = 1253;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_NOT_SUPPORTED_ON_SBS_ = 1254;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_SERVER_SHUTDOWN_IN_PROGRESS_ = 1255;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_HOST_DOWN_ = 1256;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_NON_ACCOUNT_SID_ = 1257;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_NON_DOMAIN_SID_ = 1258;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_APPHELP_BLOCK_ = 1259;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_ACCESS_DISABLED_BY_POLICY_ = 1260;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_REG_NAT_CONSUMPTION_ = 1261;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_CSCSHARE_OFFLINE_ = 1262;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_PKINIT_FAILURE_ = 1263;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_SMARTCARD_SUBSYSTEM_FAILURE_ = 1264;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_DOWNGRADE_DETECTED_ = 1265;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_MACHINE_LOCKED_ = 1271;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_SMB_GUEST_LOGON_BLOCKED_ = 1272;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_CALLBACK_SUPPLIED_INVALID_DATA_ = 1273;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_SYNC_FOREGROUND_REFRESH_REQUIRED_ = 1274;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_DRIVER_BLOCKED_ = 1275;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_INVALID_IMPORT_OF_NON_DLL_ = 1276;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_ACCESS_DISABLED_WEBBLADE_ = 1277;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_ACCESS_DISABLED_WEBBLADE_TAMPER_ = 1278;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_RECOVERY_FAILURE_ = 1279;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_ALREADY_FIBER_ = 1280;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_ALREADY_THREAD_ = 1281;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_STACK_BUFFER_OVERRUN_ = 1282;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_PARAMETER_QUOTA_EXCEEDED_ = 1283;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_DEBUGGER_INACTIVE_ = 1284;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_DELAY_LOAD_FAILED_ = 1285;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_VDM_DISALLOWED_ = 1286;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_UNIDENTIFIED_ERROR_ = 1287;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_INVALID_CRUNTIME_PARAMETER_ = 1288;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_BEYOND_VDL_ = 1289;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_INCOMPATIBLE_SERVICE_SID_TYPE_ = 1290;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_DRIVER_PROCESS_TERMINATED_ = 1291;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_IMPLEMENTATION_LIMIT_ = 1292;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_PROCESS_IS_PROTECTED_ = 1293;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_SERVICE_NOTIFY_CLIENT_LAGGING_ = 1294;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_DISK_QUOTA_EXCEEDED_ = 1295;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_CONTENT_BLOCKED_ = 1296;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_INCOMPATIBLE_SERVICE_PRIVILEGE_ = 1297;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_APP_HANG_ = 1298;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_INVALID_LABEL_ = 1299;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_NOT_ALL_ASSIGNED_ = 1300;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_SOME_NOT_MAPPED_ = 1301;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_NO_QUOTAS_FOR_ACCOUNT_ = 1302;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_LOCAL_USER_SESSION_KEY_ = 1303;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_NULL_LM_PASSWORD_ = 1304;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_UNKNOWN_REVISION_ = 1305;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_REVISION_MISMATCH_ = 1306;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_INVALID_OWNER_ = 1307;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_INVALID_PRIMARY_GROUP_ = 1308;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_NO_IMPERSONATION_TOKEN_ = 1309;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_CANT_DISABLE_MANDATORY_ = 1310;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_NO_LOGON_SERVERS_ = 1311;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_NO_SUCH_LOGON_SESSION_ = 1312;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_NO_SUCH_PRIVILEGE_ = 1313;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_PRIVILEGE_NOT_HELD_ = 1314;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_INVALID_ACCOUNT_NAME_ = 1315;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_USER_EXISTS_ = 1316;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_NO_SUCH_USER_ = 1317;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_GROUP_EXISTS_ = 1318;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_NO_SUCH_GROUP_ = 1319;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_MEMBER_IN_GROUP_ = 1320;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_MEMBER_NOT_IN_GROUP_ = 1321;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_LAST_ADMIN_ = 1322;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_WRONG_PASSWORD_ = 1323;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_ILL_FORMED_PASSWORD_ = 1324;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_PASSWORD_RESTRICTION_ = 1325;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_LOGON_FAILURE_ = 1326;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_ACCOUNT_RESTRICTION_ = 1327;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_INVALID_LOGON_HOURS_ = 1328;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_INVALID_WORKSTATION_ = 1329;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_PASSWORD_EXPIRED_ = 1330;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_ACCOUNT_DISABLED_ = 1331;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_NONE_MAPPED_ = 1332;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_TOO_MANY_LUIDS_REQUESTED_ = 1333;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_LUIDS_EXHAUSTED_ = 1334;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_INVALID_SUB_AUTHORITY_ = 1335;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_INVALID_ACL_ = 1336;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_INVALID_SID_ = 1337;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_INVALID_SECURITY_DESCR_ = 1338;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_BAD_INHERITANCE_ACL_ = 1340;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_SERVER_DISABLED_ = 1341;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_SERVER_NOT_DISABLED_ = 1342;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_INVALID_ID_AUTHORITY_ = 1343;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_ALLOTTED_SPACE_EXCEEDED_ = 1344;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_INVALID_GROUP_ATTRIBUTES_ = 1345;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_BAD_IMPERSONATION_LEVEL_ = 1346;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_CANT_OPEN_ANONYMOUS_ = 1347;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_BAD_VALIDATION_CLASS_ = 1348;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_BAD_TOKEN_TYPE_ = 1349;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_NO_SECURITY_ON_OBJECT_ = 1350;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_CANT_ACCESS_DOMAIN_INFO_ = 1351;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_INVALID_SERVER_STATE_ = 1352;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_INVALID_DOMAIN_STATE_ = 1353;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_INVALID_DOMAIN_ROLE_ = 1354;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_NO_SUCH_DOMAIN_ = 1355;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_DOMAIN_EXISTS_ = 1356;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_DOMAIN_LIMIT_EXCEEDED_ = 1357;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_INTERNAL_DB_CORRUPTION_ = 1358;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_INTERNAL_ERROR_ = 1359;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_GENERIC_NOT_MAPPED_ = 1360;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_BAD_DESCRIPTOR_FORMAT_ = 1361;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_NOT_LOGON_PROCESS_ = 1362;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_LOGON_SESSION_EXISTS_ = 1363;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_NO_SUCH_PACKAGE_ = 1364;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_BAD_LOGON_SESSION_STATE_ = 1365;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_LOGON_SESSION_COLLISION_ = 1366;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_INVALID_LOGON_TYPE_ = 1367;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_CANNOT_IMPERSONATE_ = 1368;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_RXACT_INVALID_STATE_ = 1369;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_RXACT_COMMIT_FAILURE_ = 1370;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_SPECIAL_ACCOUNT_ = 1371;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_SPECIAL_GROUP_ = 1372;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_SPECIAL_USER_ = 1373;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_MEMBERS_PRIMARY_GROUP_ = 1374;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_TOKEN_ALREADY_IN_USE_ = 1375;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_NO_SUCH_ALIAS_ = 1376;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_MEMBER_NOT_IN_ALIAS_ = 1377;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_MEMBER_IN_ALIAS_ = 1378;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_ALIAS_EXISTS_ = 1379;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_LOGON_NOT_GRANTED_ = 1380;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_TOO_MANY_SECRETS_ = 1381;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_SECRET_TOO_LONG_ = 1382;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_INTERNAL_DB_ERROR_ = 1383;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_TOO_MANY_CONTEXT_IDS_ = 1384;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_LOGON_TYPE_NOT_GRANTED_ = 1385;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_NT_CROSS_ENCRYPTION_REQUIRED_ = 1386;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_NO_SUCH_MEMBER_ = 1387;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_INVALID_MEMBER_ = 1388;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_TOO_MANY_SIDS_ = 1389;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_LM_CROSS_ENCRYPTION_REQUIRED_ = 1390;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_NO_INHERITANCE_ = 1391;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_FILE_CORRUPT_ = 1392;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_DISK_CORRUPT_ = 1393;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_NO_USER_SESSION_KEY_ = 1394;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_LICENSE_QUOTA_EXCEEDED_ = 1395;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_WRONG_TARGET_NAME_ = 1396;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_MUTUAL_AUTH_FAILED_ = 1397;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_TIME_SKEW_ = 1398;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_CURRENT_DOMAIN_NOT_ALLOWED_ = 1399;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_INVALID_WINDOW_HANDLE_ = 1400;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_INVALID_MENU_HANDLE_ = 1401;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_INVALID_CURSOR_HANDLE_ = 1402;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_INVALID_ACCEL_HANDLE_ = 1403;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_INVALID_HOOK_HANDLE_ = 1404;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_INVALID_DWP_HANDLE_ = 1405;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_TLW_WITH_WSCHILD_ = 1406;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_CANNOT_FIND_WND_CLASS_ = 1407;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_WINDOW_OF_OTHER_THREAD_ = 1408;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_HOTKEY_ALREADY_REGISTERED_ = 1409;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_CLASS_ALREADY_EXISTS_ = 1410;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_CLASS_DOES_NOT_EXIST_ = 1411;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_CLASS_HAS_WINDOWS_ = 1412;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_INVALID_INDEX_ = 1413;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_INVALID_ICON_HANDLE_ = 1414;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_PRIVATE_DIALOG_INDEX_ = 1415;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_LISTBOX_ID_NOT_FOUND_ = 1416;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_NO_WILDCARD_CHARACTERS_ = 1417;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_CLIPBOARD_NOT_OPEN_ = 1418;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_HOTKEY_NOT_REGISTERED_ = 1419;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_WINDOW_NOT_DIALOG_ = 1420;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_CONTROL_ID_NOT_FOUND_ = 1421;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_INVALID_COMBOBOX_MESSAGE_ = 1422;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_WINDOW_NOT_COMBOBOX_ = 1423;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_INVALID_EDIT_HEIGHT_ = 1424;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_DC_NOT_FOUND_ = 1425;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_INVALID_HOOK_FILTER_ = 1426;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_INVALID_FILTER_PROC_ = 1427;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_HOOK_NEEDS_HMOD_ = 1428;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_GLOBAL_ONLY_HOOK_ = 1429;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_JOURNAL_HOOK_SET_ = 1430;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_HOOK_NOT_INSTALLED_ = 1431;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_INVALID_LB_MESSAGE_ = 1432;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_SETCOUNT_ON_BAD_LB_ = 1433;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_LB_WITHOUT_TABSTOPS_ = 1434;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_DESTROY_OBJECT_OF_OTHER_THREAD_ = 1435;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_CHILD_WINDOW_MENU_ = 1436;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_NO_SYSTEM_MENU_ = 1437;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_INVALID_MSGBOX_STYLE_ = 1438;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_INVALID_SPI_VALUE_ = 1439;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_SCREEN_ALREADY_LOCKED_ = 1440;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_HWNDS_HAVE_DIFF_PARENT_ = 1441;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_NOT_CHILD_WINDOW_ = 1442;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_INVALID_GW_COMMAND_ = 1443;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_INVALID_THREAD_ID_ = 1444;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_NON_MDICHILD_WINDOW_ = 1445;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_POPUP_ALREADY_ACTIVE_ = 1446;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_NO_SCROLLBARS_ = 1447;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_INVALID_SCROLLBAR_RANGE_ = 1448;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_INVALID_SHOWWIN_COMMAND_ = 1449;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_NO_SYSTEM_RESOURCES_ = 1450;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_NONPAGED_SYSTEM_RESOURCES_ = 1451;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_PAGED_SYSTEM_RESOURCES_ = 1452;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_WORKING_SET_QUOTA_ = 1453;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_PAGEFILE_QUOTA_ = 1454;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_COMMITMENT_LIMIT_ = 1455;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_MENU_ITEM_NOT_FOUND_ = 1456;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_INVALID_KEYBOARD_HANDLE_ = 1457;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_HOOK_TYPE_NOT_ALLOWED_ = 1458;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_REQUIRES_INTERACTIVE_WINDOWSTATION_ = 1459;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_TIMEOUT_ = 1460;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_INVALID_MONITOR_HANDLE_ = 1461;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_INCORRECT_SIZE_ = 1462;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_SYMLINK_CLASS_DISABLED_ = 1463;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_SYMLINK_NOT_SUPPORTED_ = 1464;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_XML_PARSE_ERROR_ = 1465;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_XMLDSIG_ERROR_ = 1466;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_RESTART_APPLICATION_ = 1467;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_WRONG_COMPARTMENT_ = 1468;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_AUTHIP_FAILURE_ = 1469;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_NO_NVRAM_RESOURCES_ = 1470;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_NOT_GUI_PROCESS_ = 1471;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_EVENTLOG_FILE_CORRUPT_ = 1500;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_EVENTLOG_CANT_START_ = 1501;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_LOG_FILE_FULL_ = 1502;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_EVENTLOG_FILE_CHANGED_ = 1503;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_CONTAINER_ASSIGNED_ = 1504;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_JOB_NO_CONTAINER_ = 1505;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_INVALID_TASK_NAME_ = 1550;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_INVALID_TASK_INDEX_ = 1551;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_THREAD_ALREADY_IN_TASK_ = 1552;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_INSTALL_SERVICE_FAILURE_ = 1601;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_INSTALL_USEREXIT_ = 1602;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_INSTALL_FAILURE_ = 1603;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_INSTALL_SUSPEND_ = 1604;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_UNKNOWN_PRODUCT_ = 1605;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_UNKNOWN_FEATURE_ = 1606;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_UNKNOWN_COMPONENT_ = 1607;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_UNKNOWN_PROPERTY_ = 1608;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_INVALID_HANDLE_STATE_ = 1609;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_BAD_CONFIGURATION_ = 1610;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_INDEX_ABSENT_ = 1611;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_INSTALL_SOURCE_ABSENT_ = 1612;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_INSTALL_PACKAGE_VERSION_ = 1613;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_PRODUCT_UNINSTALLED_ = 1614;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_BAD_QUERY_SYNTAX_ = 1615;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_INVALID_FIELD_ = 1616;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_DEVICE_REMOVED_ = 1617;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_INSTALL_ALREADY_RUNNING_ = 1618;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_INSTALL_PACKAGE_OPEN_FAILED_ = 1619;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_INSTALL_PACKAGE_INVALID_ = 1620;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_INSTALL_UI_FAILURE_ = 1621;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_INSTALL_LOG_FAILURE_ = 1622;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_INSTALL_LANGUAGE_UNSUPPORTED_ = 1623;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_INSTALL_TRANSFORM_FAILURE_ = 1624;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_INSTALL_PACKAGE_REJECTED_ = 1625;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_FUNCTION_NOT_CALLED_ = 1626;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_FUNCTION_FAILED_ = 1627;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_INVALID_TABLE_ = 1628;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_DATATYPE_MISMATCH_ = 1629;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_UNSUPPORTED_TYPE_ = 1630;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_CREATE_FAILED_ = 1631;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_INSTALL_TEMP_UNWRITABLE_ = 1632;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_INSTALL_PLATFORM_UNSUPPORTED_ = 1633;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_INSTALL_NOTUSED_ = 1634;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_PATCH_PACKAGE_OPEN_FAILED_ = 1635;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_PATCH_PACKAGE_INVALID_ = 1636;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_PATCH_PACKAGE_UNSUPPORTED_ = 1637;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_PRODUCT_VERSION_ = 1638;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_INVALID_COMMAND_LINE_ = 1639;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_INSTALL_REMOTE_DISALLOWED_ = 1640;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_SUCCESS_REBOOT_INITIATED_ = 1641;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_PATCH_TARGET_NOT_FOUND_ = 1642;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_PATCH_PACKAGE_REJECTED_ = 1643;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_INSTALL_TRANSFORM_REJECTED_ = 1644;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_INSTALL_REMOTE_PROHIBITED_ = 1645;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_PATCH_REMOVAL_UNSUPPORTED_ = 1646;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_UNKNOWN_PATCH_ = 1647;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_PATCH_NO_SEQUENCE_ = 1648;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_PATCH_REMOVAL_DISALLOWED_ = 1649;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_INVALID_PATCH_XML_ = 1650;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_PATCH_MANAGED_ADVERTISED_PRODUCT_ = 1651;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_INSTALL_SERVICE_SAFEBOOT_ = 1652;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_FAIL_FAST_EXCEPTION_ = 1653;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_INSTALL_REJECTED_ = 1654;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_DYNAMIC_CODE_BLOCKED_ = 1655;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_NOT_SAME_OBJECT_ = 1656;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_STRICT_CFG_VIOLATION_ = 1657;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_SET_CONTEXT_DENIED_ = 1660;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_CROSS_PARTITION_VIOLATION_ = 1661;
-BOOST_CONSTEXPR_OR_CONST DWORD_ RPC_S_INVALID_STRING_BINDING_ = 1700;
-BOOST_CONSTEXPR_OR_CONST DWORD_ RPC_S_WRONG_KIND_OF_BINDING_ = 1701;
-BOOST_CONSTEXPR_OR_CONST DWORD_ RPC_S_INVALID_BINDING_ = 1702;
-BOOST_CONSTEXPR_OR_CONST DWORD_ RPC_S_PROTSEQ_NOT_SUPPORTED_ = 1703;
-BOOST_CONSTEXPR_OR_CONST DWORD_ RPC_S_INVALID_RPC_PROTSEQ_ = 1704;
-BOOST_CONSTEXPR_OR_CONST DWORD_ RPC_S_INVALID_STRING_UUID_ = 1705;
-BOOST_CONSTEXPR_OR_CONST DWORD_ RPC_S_INVALID_ENDPOINT_FORMAT_ = 1706;
-BOOST_CONSTEXPR_OR_CONST DWORD_ RPC_S_INVALID_NET_ADDR_ = 1707;
-BOOST_CONSTEXPR_OR_CONST DWORD_ RPC_S_NO_ENDPOINT_FOUND_ = 1708;
-BOOST_CONSTEXPR_OR_CONST DWORD_ RPC_S_INVALID_TIMEOUT_ = 1709;
-BOOST_CONSTEXPR_OR_CONST DWORD_ RPC_S_OBJECT_NOT_FOUND_ = 1710;
-BOOST_CONSTEXPR_OR_CONST DWORD_ RPC_S_ALREADY_REGISTERED_ = 1711;
-BOOST_CONSTEXPR_OR_CONST DWORD_ RPC_S_TYPE_ALREADY_REGISTERED_ = 1712;
-BOOST_CONSTEXPR_OR_CONST DWORD_ RPC_S_ALREADY_LISTENING_ = 1713;
-BOOST_CONSTEXPR_OR_CONST DWORD_ RPC_S_NO_PROTSEQS_REGISTERED_ = 1714;
-BOOST_CONSTEXPR_OR_CONST DWORD_ RPC_S_NOT_LISTENING_ = 1715;
-BOOST_CONSTEXPR_OR_CONST DWORD_ RPC_S_UNKNOWN_MGR_TYPE_ = 1716;
-BOOST_CONSTEXPR_OR_CONST DWORD_ RPC_S_UNKNOWN_IF_ = 1717;
-BOOST_CONSTEXPR_OR_CONST DWORD_ RPC_S_NO_BINDINGS_ = 1718;
-BOOST_CONSTEXPR_OR_CONST DWORD_ RPC_S_NO_PROTSEQS_ = 1719;
-BOOST_CONSTEXPR_OR_CONST DWORD_ RPC_S_CANT_CREATE_ENDPOINT_ = 1720;
-BOOST_CONSTEXPR_OR_CONST DWORD_ RPC_S_OUT_OF_RESOURCES_ = 1721;
-BOOST_CONSTEXPR_OR_CONST DWORD_ RPC_S_SERVER_UNAVAILABLE_ = 1722;
-BOOST_CONSTEXPR_OR_CONST DWORD_ RPC_S_SERVER_TOO_BUSY_ = 1723;
-BOOST_CONSTEXPR_OR_CONST DWORD_ RPC_S_INVALID_NETWORK_OPTIONS_ = 1724;
-BOOST_CONSTEXPR_OR_CONST DWORD_ RPC_S_NO_CALL_ACTIVE_ = 1725;
-BOOST_CONSTEXPR_OR_CONST DWORD_ RPC_S_CALL_FAILED_ = 1726;
-BOOST_CONSTEXPR_OR_CONST DWORD_ RPC_S_CALL_FAILED_DNE_ = 1727;
-BOOST_CONSTEXPR_OR_CONST DWORD_ RPC_S_PROTOCOL_ERROR_ = 1728;
-BOOST_CONSTEXPR_OR_CONST DWORD_ RPC_S_PROXY_ACCESS_DENIED_ = 1729;
-BOOST_CONSTEXPR_OR_CONST DWORD_ RPC_S_UNSUPPORTED_TRANS_SYN_ = 1730;
-BOOST_CONSTEXPR_OR_CONST DWORD_ RPC_S_UNSUPPORTED_TYPE_ = 1732;
-BOOST_CONSTEXPR_OR_CONST DWORD_ RPC_S_INVALID_TAG_ = 1733;
-BOOST_CONSTEXPR_OR_CONST DWORD_ RPC_S_INVALID_BOUND_ = 1734;
-BOOST_CONSTEXPR_OR_CONST DWORD_ RPC_S_NO_ENTRY_NAME_ = 1735;
-BOOST_CONSTEXPR_OR_CONST DWORD_ RPC_S_INVALID_NAME_SYNTAX_ = 1736;
-BOOST_CONSTEXPR_OR_CONST DWORD_ RPC_S_UNSUPPORTED_NAME_SYNTAX_ = 1737;
-BOOST_CONSTEXPR_OR_CONST DWORD_ RPC_S_UUID_NO_ADDRESS_ = 1739;
-BOOST_CONSTEXPR_OR_CONST DWORD_ RPC_S_DUPLICATE_ENDPOINT_ = 1740;
-BOOST_CONSTEXPR_OR_CONST DWORD_ RPC_S_UNKNOWN_AUTHN_TYPE_ = 1741;
-BOOST_CONSTEXPR_OR_CONST DWORD_ RPC_S_MAX_CALLS_TOO_SMALL_ = 1742;
-BOOST_CONSTEXPR_OR_CONST DWORD_ RPC_S_STRING_TOO_LONG_ = 1743;
-BOOST_CONSTEXPR_OR_CONST DWORD_ RPC_S_PROTSEQ_NOT_FOUND_ = 1744;
-BOOST_CONSTEXPR_OR_CONST DWORD_ RPC_S_PROCNUM_OUT_OF_RANGE_ = 1745;
-BOOST_CONSTEXPR_OR_CONST DWORD_ RPC_S_BINDING_HAS_NO_AUTH_ = 1746;
-BOOST_CONSTEXPR_OR_CONST DWORD_ RPC_S_UNKNOWN_AUTHN_SERVICE_ = 1747;
-BOOST_CONSTEXPR_OR_CONST DWORD_ RPC_S_UNKNOWN_AUTHN_LEVEL_ = 1748;
-BOOST_CONSTEXPR_OR_CONST DWORD_ RPC_S_INVALID_AUTH_IDENTITY_ = 1749;
-BOOST_CONSTEXPR_OR_CONST DWORD_ RPC_S_UNKNOWN_AUTHZ_SERVICE_ = 1750;
-BOOST_CONSTEXPR_OR_CONST DWORD_ EPT_S_INVALID_ENTRY_ = 1751;
-BOOST_CONSTEXPR_OR_CONST DWORD_ EPT_S_CANT_PERFORM_OP_ = 1752;
-BOOST_CONSTEXPR_OR_CONST DWORD_ EPT_S_NOT_REGISTERED_ = 1753;
-BOOST_CONSTEXPR_OR_CONST DWORD_ RPC_S_NOTHING_TO_EXPORT_ = 1754;
-BOOST_CONSTEXPR_OR_CONST DWORD_ RPC_S_INCOMPLETE_NAME_ = 1755;
-BOOST_CONSTEXPR_OR_CONST DWORD_ RPC_S_INVALID_VERS_OPTION_ = 1756;
-BOOST_CONSTEXPR_OR_CONST DWORD_ RPC_S_NO_MORE_MEMBERS_ = 1757;
-BOOST_CONSTEXPR_OR_CONST DWORD_ RPC_S_NOT_ALL_OBJS_UNEXPORTED_ = 1758;
-BOOST_CONSTEXPR_OR_CONST DWORD_ RPC_S_INTERFACE_NOT_FOUND_ = 1759;
-BOOST_CONSTEXPR_OR_CONST DWORD_ RPC_S_ENTRY_ALREADY_EXISTS_ = 1760;
-BOOST_CONSTEXPR_OR_CONST DWORD_ RPC_S_ENTRY_NOT_FOUND_ = 1761;
-BOOST_CONSTEXPR_OR_CONST DWORD_ RPC_S_NAME_SERVICE_UNAVAILABLE_ = 1762;
-BOOST_CONSTEXPR_OR_CONST DWORD_ RPC_S_INVALID_NAF_ID_ = 1763;
-BOOST_CONSTEXPR_OR_CONST DWORD_ RPC_S_CANNOT_SUPPORT_ = 1764;
-BOOST_CONSTEXPR_OR_CONST DWORD_ RPC_S_NO_CONTEXT_AVAILABLE_ = 1765;
-BOOST_CONSTEXPR_OR_CONST DWORD_ RPC_S_INTERNAL_ERROR_ = 1766;
-BOOST_CONSTEXPR_OR_CONST DWORD_ RPC_S_ZERO_DIVIDE_ = 1767;
-BOOST_CONSTEXPR_OR_CONST DWORD_ RPC_S_ADDRESS_ERROR_ = 1768;
-BOOST_CONSTEXPR_OR_CONST DWORD_ RPC_S_FP_DIV_ZERO_ = 1769;
-BOOST_CONSTEXPR_OR_CONST DWORD_ RPC_S_FP_UNDERFLOW_ = 1770;
-BOOST_CONSTEXPR_OR_CONST DWORD_ RPC_S_FP_OVERFLOW_ = 1771;
-BOOST_CONSTEXPR_OR_CONST DWORD_ RPC_X_NO_MORE_ENTRIES_ = 1772;
-BOOST_CONSTEXPR_OR_CONST DWORD_ RPC_X_SS_CHAR_TRANS_OPEN_FAIL_ = 1773;
-BOOST_CONSTEXPR_OR_CONST DWORD_ RPC_X_SS_CHAR_TRANS_SHORT_FILE_ = 1774;
-BOOST_CONSTEXPR_OR_CONST DWORD_ RPC_X_SS_IN_NULL_CONTEXT_ = 1775;
-BOOST_CONSTEXPR_OR_CONST DWORD_ RPC_X_SS_CONTEXT_DAMAGED_ = 1777;
-BOOST_CONSTEXPR_OR_CONST DWORD_ RPC_X_SS_HANDLES_MISMATCH_ = 1778;
-BOOST_CONSTEXPR_OR_CONST DWORD_ RPC_X_SS_CANNOT_GET_CALL_HANDLE_ = 1779;
-BOOST_CONSTEXPR_OR_CONST DWORD_ RPC_X_NULL_REF_POINTER_ = 1780;
-BOOST_CONSTEXPR_OR_CONST DWORD_ RPC_X_ENUM_VALUE_OUT_OF_RANGE_ = 1781;
-BOOST_CONSTEXPR_OR_CONST DWORD_ RPC_X_BYTE_COUNT_TOO_SMALL_ = 1782;
-BOOST_CONSTEXPR_OR_CONST DWORD_ RPC_X_BAD_STUB_DATA_ = 1783;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_INVALID_USER_BUFFER_ = 1784;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_UNRECOGNIZED_MEDIA_ = 1785;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_NO_TRUST_LSA_SECRET_ = 1786;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_NO_TRUST_SAM_ACCOUNT_ = 1787;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_TRUSTED_DOMAIN_FAILURE_ = 1788;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_TRUSTED_RELATIONSHIP_FAILURE_ = 1789;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_TRUST_FAILURE_ = 1790;
-BOOST_CONSTEXPR_OR_CONST DWORD_ RPC_S_CALL_IN_PROGRESS_ = 1791;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_NETLOGON_NOT_STARTED_ = 1792;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_ACCOUNT_EXPIRED_ = 1793;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_REDIRECTOR_HAS_OPEN_HANDLES_ = 1794;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_PRINTER_DRIVER_ALREADY_INSTALLED_ = 1795;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_UNKNOWN_PORT_ = 1796;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_UNKNOWN_PRINTER_DRIVER_ = 1797;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_UNKNOWN_PRINTPROCESSOR_ = 1798;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_INVALID_SEPARATOR_FILE_ = 1799;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_INVALID_PRIORITY_ = 1800;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_INVALID_PRINTER_NAME_ = 1801;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_PRINTER_ALREADY_EXISTS_ = 1802;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_INVALID_PRINTER_COMMAND_ = 1803;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_INVALID_DATATYPE_ = 1804;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_INVALID_ENVIRONMENT_ = 1805;
-BOOST_CONSTEXPR_OR_CONST DWORD_ RPC_S_NO_MORE_BINDINGS_ = 1806;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_NOLOGON_INTERDOMAIN_TRUST_ACCOUNT_ = 1807;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_NOLOGON_WORKSTATION_TRUST_ACCOUNT_ = 1808;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_NOLOGON_SERVER_TRUST_ACCOUNT_ = 1809;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_DOMAIN_TRUST_INCONSISTENT_ = 1810;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_SERVER_HAS_OPEN_HANDLES_ = 1811;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_RESOURCE_DATA_NOT_FOUND_ = 1812;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_RESOURCE_TYPE_NOT_FOUND_ = 1813;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_RESOURCE_NAME_NOT_FOUND_ = 1814;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_RESOURCE_LANG_NOT_FOUND_ = 1815;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_NOT_ENOUGH_QUOTA_ = 1816;
-BOOST_CONSTEXPR_OR_CONST DWORD_ RPC_S_NO_INTERFACES_ = 1817;
-BOOST_CONSTEXPR_OR_CONST DWORD_ RPC_S_CALL_CANCELLED_ = 1818;
-BOOST_CONSTEXPR_OR_CONST DWORD_ RPC_S_BINDING_INCOMPLETE_ = 1819;
-BOOST_CONSTEXPR_OR_CONST DWORD_ RPC_S_COMM_FAILURE_ = 1820;
-BOOST_CONSTEXPR_OR_CONST DWORD_ RPC_S_UNSUPPORTED_AUTHN_LEVEL_ = 1821;
-BOOST_CONSTEXPR_OR_CONST DWORD_ RPC_S_NO_PRINC_NAME_ = 1822;
-BOOST_CONSTEXPR_OR_CONST DWORD_ RPC_S_NOT_RPC_ERROR_ = 1823;
-BOOST_CONSTEXPR_OR_CONST DWORD_ RPC_S_UUID_LOCAL_ONLY_ = 1824;
-BOOST_CONSTEXPR_OR_CONST DWORD_ RPC_S_SEC_PKG_ERROR_ = 1825;
-BOOST_CONSTEXPR_OR_CONST DWORD_ RPC_S_NOT_CANCELLED_ = 1826;
-BOOST_CONSTEXPR_OR_CONST DWORD_ RPC_X_INVALID_ES_ACTION_ = 1827;
-BOOST_CONSTEXPR_OR_CONST DWORD_ RPC_X_WRONG_ES_VERSION_ = 1828;
-BOOST_CONSTEXPR_OR_CONST DWORD_ RPC_X_WRONG_STUB_VERSION_ = 1829;
-BOOST_CONSTEXPR_OR_CONST DWORD_ RPC_X_INVALID_PIPE_OBJECT_ = 1830;
-BOOST_CONSTEXPR_OR_CONST DWORD_ RPC_X_WRONG_PIPE_ORDER_ = 1831;
-BOOST_CONSTEXPR_OR_CONST DWORD_ RPC_X_WRONG_PIPE_VERSION_ = 1832;
-BOOST_CONSTEXPR_OR_CONST DWORD_ RPC_S_COOKIE_AUTH_FAILED_ = 1833;
-BOOST_CONSTEXPR_OR_CONST DWORD_ RPC_S_DO_NOT_DISTURB_ = 1834;
-BOOST_CONSTEXPR_OR_CONST DWORD_ RPC_S_SYSTEM_HANDLE_COUNT_EXCEEDED_ = 1835;
-BOOST_CONSTEXPR_OR_CONST DWORD_ RPC_S_SYSTEM_HANDLE_TYPE_MISMATCH_ = 1836;
-BOOST_CONSTEXPR_OR_CONST DWORD_ RPC_S_GROUP_MEMBER_NOT_FOUND_ = 1898;
-BOOST_CONSTEXPR_OR_CONST DWORD_ EPT_S_CANT_CREATE_ = 1899;
-BOOST_CONSTEXPR_OR_CONST DWORD_ RPC_S_INVALID_OBJECT_ = 1900;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_INVALID_TIME_ = 1901;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_INVALID_FORM_NAME_ = 1902;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_INVALID_FORM_SIZE_ = 1903;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_ALREADY_WAITING_ = 1904;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_PRINTER_DELETED_ = 1905;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_INVALID_PRINTER_STATE_ = 1906;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_PASSWORD_MUST_CHANGE_ = 1907;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_DOMAIN_CONTROLLER_NOT_FOUND_ = 1908;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_ACCOUNT_LOCKED_OUT_ = 1909;
-BOOST_CONSTEXPR_OR_CONST DWORD_ OR_INVALID_OXID_ = 1910;
-BOOST_CONSTEXPR_OR_CONST DWORD_ OR_INVALID_OID_ = 1911;
-BOOST_CONSTEXPR_OR_CONST DWORD_ OR_INVALID_SET_ = 1912;
-BOOST_CONSTEXPR_OR_CONST DWORD_ RPC_S_SEND_INCOMPLETE_ = 1913;
-BOOST_CONSTEXPR_OR_CONST DWORD_ RPC_S_INVALID_ASYNC_HANDLE_ = 1914;
-BOOST_CONSTEXPR_OR_CONST DWORD_ RPC_S_INVALID_ASYNC_CALL_ = 1915;
-BOOST_CONSTEXPR_OR_CONST DWORD_ RPC_X_PIPE_CLOSED_ = 1916;
-BOOST_CONSTEXPR_OR_CONST DWORD_ RPC_X_PIPE_DISCIPLINE_ERROR_ = 1917;
-BOOST_CONSTEXPR_OR_CONST DWORD_ RPC_X_PIPE_EMPTY_ = 1918;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_NO_SITENAME_ = 1919;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_CANT_ACCESS_FILE_ = 1920;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_CANT_RESOLVE_FILENAME_ = 1921;
-BOOST_CONSTEXPR_OR_CONST DWORD_ RPC_S_ENTRY_TYPE_MISMATCH_ = 1922;
-BOOST_CONSTEXPR_OR_CONST DWORD_ RPC_S_NOT_ALL_OBJS_EXPORTED_ = 1923;
-BOOST_CONSTEXPR_OR_CONST DWORD_ RPC_S_INTERFACE_NOT_EXPORTED_ = 1924;
-BOOST_CONSTEXPR_OR_CONST DWORD_ RPC_S_PROFILE_NOT_ADDED_ = 1925;
-BOOST_CONSTEXPR_OR_CONST DWORD_ RPC_S_PRF_ELT_NOT_ADDED_ = 1926;
-BOOST_CONSTEXPR_OR_CONST DWORD_ RPC_S_PRF_ELT_NOT_REMOVED_ = 1927;
-BOOST_CONSTEXPR_OR_CONST DWORD_ RPC_S_GRP_ELT_NOT_ADDED_ = 1928;
-BOOST_CONSTEXPR_OR_CONST DWORD_ RPC_S_GRP_ELT_NOT_REMOVED_ = 1929;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_KM_DRIVER_BLOCKED_ = 1930;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_CONTEXT_EXPIRED_ = 1931;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_PER_USER_TRUST_QUOTA_EXCEEDED_ = 1932;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_ALL_USER_TRUST_QUOTA_EXCEEDED_ = 1933;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_USER_DELETE_TRUST_QUOTA_EXCEEDED_ = 1934;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_AUTHENTICATION_FIREWALL_FAILED_ = 1935;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_REMOTE_PRINT_CONNECTIONS_BLOCKED_ = 1936;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_NTLM_BLOCKED_ = 1937;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_PASSWORD_CHANGE_REQUIRED_ = 1938;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_LOST_MODE_LOGON_RESTRICTION_ = 1939;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_INVALID_PIXEL_FORMAT_ = 2000;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_BAD_DRIVER_ = 2001;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_INVALID_WINDOW_STYLE_ = 2002;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_METAFILE_NOT_SUPPORTED_ = 2003;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_TRANSFORM_NOT_SUPPORTED_ = 2004;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_CLIPPING_NOT_SUPPORTED_ = 2005;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_INVALID_CMM_ = 2010;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_INVALID_PROFILE_ = 2011;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_TAG_NOT_FOUND_ = 2012;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_TAG_NOT_PRESENT_ = 2013;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_DUPLICATE_TAG_ = 2014;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_PROFILE_NOT_ASSOCIATED_WITH_DEVICE_ = 2015;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_PROFILE_NOT_FOUND_ = 2016;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_INVALID_COLORSPACE_ = 2017;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_ICM_NOT_ENABLED_ = 2018;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_DELETING_ICM_XFORM_ = 2019;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_INVALID_TRANSFORM_ = 2020;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_COLORSPACE_MISMATCH_ = 2021;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_INVALID_COLORINDEX_ = 2022;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_PROFILE_DOES_NOT_MATCH_DEVICE_ = 2023;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_CONNECTED_OTHER_PASSWORD_ = 2108;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_CONNECTED_OTHER_PASSWORD_DEFAULT_ = 2109;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_BAD_USERNAME_ = 2202;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_NOT_CONNECTED_ = 2250;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_OPEN_FILES_ = 2401;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_ACTIVE_CONNECTIONS_ = 2402;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_DEVICE_IN_USE_ = 2404;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_UNKNOWN_PRINT_MONITOR_ = 3000;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_PRINTER_DRIVER_IN_USE_ = 3001;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_SPOOL_FILE_NOT_FOUND_ = 3002;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_SPL_NO_STARTDOC_ = 3003;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_SPL_NO_ADDJOB_ = 3004;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_PRINT_PROCESSOR_ALREADY_INSTALLED_ = 3005;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_PRINT_MONITOR_ALREADY_INSTALLED_ = 3006;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_INVALID_PRINT_MONITOR_ = 3007;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_PRINT_MONITOR_IN_USE_ = 3008;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_PRINTER_HAS_JOBS_QUEUED_ = 3009;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_SUCCESS_REBOOT_REQUIRED_ = 3010;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_SUCCESS_RESTART_REQUIRED_ = 3011;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_PRINTER_NOT_FOUND_ = 3012;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_PRINTER_DRIVER_WARNED_ = 3013;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_PRINTER_DRIVER_BLOCKED_ = 3014;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_PRINTER_DRIVER_PACKAGE_IN_USE_ = 3015;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_CORE_DRIVER_PACKAGE_NOT_FOUND_ = 3016;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_FAIL_REBOOT_REQUIRED_ = 3017;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_FAIL_REBOOT_INITIATED_ = 3018;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_PRINTER_DRIVER_DOWNLOAD_NEEDED_ = 3019;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_PRINT_JOB_RESTART_REQUIRED_ = 3020;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_INVALID_PRINTER_DRIVER_MANIFEST_ = 3021;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_PRINTER_NOT_SHAREABLE_ = 3022;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_REQUEST_PAUSED_ = 3050;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_IO_REISSUE_AS_CACHED_ = 3950;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_WINS_INTERNAL_ = 4000;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_CAN_NOT_DEL_LOCAL_WINS_ = 4001;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_STATIC_INIT_ = 4002;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_INC_BACKUP_ = 4003;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_FULL_BACKUP_ = 4004;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_REC_NON_EXISTENT_ = 4005;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_RPL_NOT_ALLOWED_ = 4006;
-BOOST_CONSTEXPR_OR_CONST DWORD_ PEERDIST_ERROR_CONTENTINFO_VERSION_UNSUPPORTED_ = 4050;
-BOOST_CONSTEXPR_OR_CONST DWORD_ PEERDIST_ERROR_CANNOT_PARSE_CONTENTINFO_ = 4051;
-BOOST_CONSTEXPR_OR_CONST DWORD_ PEERDIST_ERROR_MISSING_DATA_ = 4052;
-BOOST_CONSTEXPR_OR_CONST DWORD_ PEERDIST_ERROR_NO_MORE_ = 4053;
-BOOST_CONSTEXPR_OR_CONST DWORD_ PEERDIST_ERROR_NOT_INITIALIZED_ = 4054;
-BOOST_CONSTEXPR_OR_CONST DWORD_ PEERDIST_ERROR_ALREADY_INITIALIZED_ = 4055;
-BOOST_CONSTEXPR_OR_CONST DWORD_ PEERDIST_ERROR_SHUTDOWN_IN_PROGRESS_ = 4056;
-BOOST_CONSTEXPR_OR_CONST DWORD_ PEERDIST_ERROR_INVALIDATED_ = 4057;
-BOOST_CONSTEXPR_OR_CONST DWORD_ PEERDIST_ERROR_ALREADY_EXISTS_ = 4058;
-BOOST_CONSTEXPR_OR_CONST DWORD_ PEERDIST_ERROR_OPERATION_NOTFOUND_ = 4059;
-BOOST_CONSTEXPR_OR_CONST DWORD_ PEERDIST_ERROR_ALREADY_COMPLETED_ = 4060;
-BOOST_CONSTEXPR_OR_CONST DWORD_ PEERDIST_ERROR_OUT_OF_BOUNDS_ = 4061;
-BOOST_CONSTEXPR_OR_CONST DWORD_ PEERDIST_ERROR_VERSION_UNSUPPORTED_ = 4062;
-BOOST_CONSTEXPR_OR_CONST DWORD_ PEERDIST_ERROR_INVALID_CONFIGURATION_ = 4063;
-BOOST_CONSTEXPR_OR_CONST DWORD_ PEERDIST_ERROR_NOT_LICENSED_ = 4064;
-BOOST_CONSTEXPR_OR_CONST DWORD_ PEERDIST_ERROR_SERVICE_UNAVAILABLE_ = 4065;
-BOOST_CONSTEXPR_OR_CONST DWORD_ PEERDIST_ERROR_TRUST_FAILURE_ = 4066;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_DHCP_ADDRESS_CONFLICT_ = 4100;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_WMI_GUID_NOT_FOUND_ = 4200;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_WMI_INSTANCE_NOT_FOUND_ = 4201;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_WMI_ITEMID_NOT_FOUND_ = 4202;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_WMI_TRY_AGAIN_ = 4203;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_WMI_DP_NOT_FOUND_ = 4204;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_WMI_UNRESOLVED_INSTANCE_REF_ = 4205;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_WMI_ALREADY_ENABLED_ = 4206;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_WMI_GUID_DISCONNECTED_ = 4207;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_WMI_SERVER_UNAVAILABLE_ = 4208;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_WMI_DP_FAILED_ = 4209;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_WMI_INVALID_MOF_ = 4210;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_WMI_INVALID_REGINFO_ = 4211;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_WMI_ALREADY_DISABLED_ = 4212;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_WMI_READ_ONLY_ = 4213;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_WMI_SET_FAILURE_ = 4214;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_NOT_APPCONTAINER_ = 4250;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_APPCONTAINER_REQUIRED_ = 4251;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_NOT_SUPPORTED_IN_APPCONTAINER_ = 4252;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_INVALID_PACKAGE_SID_LENGTH_ = 4253;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_INVALID_MEDIA_ = 4300;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_INVALID_LIBRARY_ = 4301;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_INVALID_MEDIA_POOL_ = 4302;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_DRIVE_MEDIA_MISMATCH_ = 4303;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_MEDIA_OFFLINE_ = 4304;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_LIBRARY_OFFLINE_ = 4305;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_EMPTY_ = 4306;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_NOT_EMPTY_ = 4307;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_MEDIA_UNAVAILABLE_ = 4308;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_RESOURCE_DISABLED_ = 4309;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_INVALID_CLEANER_ = 4310;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_UNABLE_TO_CLEAN_ = 4311;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_OBJECT_NOT_FOUND_ = 4312;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_DATABASE_FAILURE_ = 4313;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_DATABASE_FULL_ = 4314;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_MEDIA_INCOMPATIBLE_ = 4315;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_RESOURCE_NOT_PRESENT_ = 4316;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_INVALID_OPERATION_ = 4317;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_MEDIA_NOT_AVAILABLE_ = 4318;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_DEVICE_NOT_AVAILABLE_ = 4319;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_REQUEST_REFUSED_ = 4320;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_INVALID_DRIVE_OBJECT_ = 4321;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_LIBRARY_FULL_ = 4322;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_MEDIUM_NOT_ACCESSIBLE_ = 4323;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_UNABLE_TO_LOAD_MEDIUM_ = 4324;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_UNABLE_TO_INVENTORY_DRIVE_ = 4325;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_UNABLE_TO_INVENTORY_SLOT_ = 4326;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_UNABLE_TO_INVENTORY_TRANSPORT_ = 4327;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_TRANSPORT_FULL_ = 4328;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_CONTROLLING_IEPORT_ = 4329;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_UNABLE_TO_EJECT_MOUNTED_MEDIA_ = 4330;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_CLEANER_SLOT_SET_ = 4331;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_CLEANER_SLOT_NOT_SET_ = 4332;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_CLEANER_CARTRIDGE_SPENT_ = 4333;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_UNEXPECTED_OMID_ = 4334;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_CANT_DELETE_LAST_ITEM_ = 4335;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_MESSAGE_EXCEEDS_MAX_SIZE_ = 4336;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_VOLUME_CONTAINS_SYS_FILES_ = 4337;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_INDIGENOUS_TYPE_ = 4338;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_NO_SUPPORTING_DRIVES_ = 4339;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_CLEANER_CARTRIDGE_INSTALLED_ = 4340;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_IEPORT_FULL_ = 4341;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_FILE_OFFLINE_ = 4350;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_REMOTE_STORAGE_NOT_ACTIVE_ = 4351;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_REMOTE_STORAGE_MEDIA_ERROR_ = 4352;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_NOT_A_REPARSE_POINT_ = 4390;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_REPARSE_ATTRIBUTE_CONFLICT_ = 4391;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_INVALID_REPARSE_DATA_ = 4392;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_REPARSE_TAG_INVALID_ = 4393;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_REPARSE_TAG_MISMATCH_ = 4394;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_REPARSE_POINT_ENCOUNTERED_ = 4395;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_APP_DATA_NOT_FOUND_ = 4400;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_APP_DATA_EXPIRED_ = 4401;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_APP_DATA_CORRUPT_ = 4402;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_APP_DATA_LIMIT_EXCEEDED_ = 4403;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_APP_DATA_REBOOT_REQUIRED_ = 4404;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_SECUREBOOT_ROLLBACK_DETECTED_ = 4420;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_SECUREBOOT_POLICY_VIOLATION_ = 4421;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_SECUREBOOT_INVALID_POLICY_ = 4422;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_SECUREBOOT_POLICY_PUBLISHER_NOT_FOUND_ = 4423;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_SECUREBOOT_POLICY_NOT_SIGNED_ = 4424;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_SECUREBOOT_NOT_ENABLED_ = 4425;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_SECUREBOOT_FILE_REPLACED_ = 4426;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_SECUREBOOT_POLICY_NOT_AUTHORIZED_ = 4427;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_SECUREBOOT_POLICY_UNKNOWN_ = 4428;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_SECUREBOOT_POLICY_MISSING_ANTIROLLBACKVERSION_ = 4429;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_SECUREBOOT_PLATFORM_ID_MISMATCH_ = 4430;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_SECUREBOOT_POLICY_ROLLBACK_DETECTED_ = 4431;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_SECUREBOOT_POLICY_UPGRADE_MISMATCH_ = 4432;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_SECUREBOOT_REQUIRED_POLICY_FILE_MISSING_ = 4433;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_SECUREBOOT_NOT_BASE_POLICY_ = 4434;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_SECUREBOOT_NOT_SUPPLEMENTAL_POLICY_ = 4435;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_OFFLOAD_READ_FLT_NOT_SUPPORTED_ = 4440;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_OFFLOAD_WRITE_FLT_NOT_SUPPORTED_ = 4441;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_OFFLOAD_READ_FILE_NOT_SUPPORTED_ = 4442;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_OFFLOAD_WRITE_FILE_NOT_SUPPORTED_ = 4443;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_ALREADY_HAS_STREAM_ID_ = 4444;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_SMR_GARBAGE_COLLECTION_REQUIRED_ = 4445;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_VOLUME_NOT_SIS_ENABLED_ = 4500;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_SYSTEM_INTEGRITY_ROLLBACK_DETECTED_ = 4550;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_SYSTEM_INTEGRITY_POLICY_VIOLATION_ = 4551;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_SYSTEM_INTEGRITY_INVALID_POLICY_ = 4552;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_SYSTEM_INTEGRITY_POLICY_NOT_SIGNED_ = 4553;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_VSM_NOT_INITIALIZED_ = 4560;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_VSM_DMA_PROTECTION_NOT_IN_USE_ = 4561;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_PLATFORM_MANIFEST_NOT_AUTHORIZED_ = 4570;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_PLATFORM_MANIFEST_INVALID_ = 4571;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_PLATFORM_MANIFEST_FILE_NOT_AUTHORIZED_ = 4572;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_PLATFORM_MANIFEST_CATALOG_NOT_AUTHORIZED_ = 4573;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_PLATFORM_MANIFEST_BINARY_ID_NOT_FOUND_ = 4574;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_PLATFORM_MANIFEST_NOT_ACTIVE_ = 4575;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_PLATFORM_MANIFEST_NOT_SIGNED_ = 4576;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_DEPENDENT_RESOURCE_EXISTS_ = 5001;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_DEPENDENCY_NOT_FOUND_ = 5002;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_DEPENDENCY_ALREADY_EXISTS_ = 5003;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_RESOURCE_NOT_ONLINE_ = 5004;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_HOST_NODE_NOT_AVAILABLE_ = 5005;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_RESOURCE_NOT_AVAILABLE_ = 5006;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_RESOURCE_NOT_FOUND_ = 5007;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_SHUTDOWN_CLUSTER_ = 5008;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_CANT_EVICT_ACTIVE_NODE_ = 5009;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_OBJECT_ALREADY_EXISTS_ = 5010;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_OBJECT_IN_LIST_ = 5011;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_GROUP_NOT_AVAILABLE_ = 5012;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_GROUP_NOT_FOUND_ = 5013;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_GROUP_NOT_ONLINE_ = 5014;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_HOST_NODE_NOT_RESOURCE_OWNER_ = 5015;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_HOST_NODE_NOT_GROUP_OWNER_ = 5016;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_RESMON_CREATE_FAILED_ = 5017;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_RESMON_ONLINE_FAILED_ = 5018;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_RESOURCE_ONLINE_ = 5019;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_QUORUM_RESOURCE_ = 5020;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_NOT_QUORUM_CAPABLE_ = 5021;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_CLUSTER_SHUTTING_DOWN_ = 5022;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_INVALID_STATE_ = 5023;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_RESOURCE_PROPERTIES_STORED_ = 5024;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_NOT_QUORUM_CLASS_ = 5025;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_CORE_RESOURCE_ = 5026;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_QUORUM_RESOURCE_ONLINE_FAILED_ = 5027;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_QUORUMLOG_OPEN_FAILED_ = 5028;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_CLUSTERLOG_CORRUPT_ = 5029;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_CLUSTERLOG_RECORD_EXCEEDS_MAXSIZE_ = 5030;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_CLUSTERLOG_EXCEEDS_MAXSIZE_ = 5031;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_CLUSTERLOG_CHKPOINT_NOT_FOUND_ = 5032;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_CLUSTERLOG_NOT_ENOUGH_SPACE_ = 5033;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_QUORUM_OWNER_ALIVE_ = 5034;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_NETWORK_NOT_AVAILABLE_ = 5035;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_NODE_NOT_AVAILABLE_ = 5036;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_ALL_NODES_NOT_AVAILABLE_ = 5037;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_RESOURCE_FAILED_ = 5038;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_CLUSTER_INVALID_NODE_ = 5039;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_CLUSTER_NODE_EXISTS_ = 5040;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_CLUSTER_JOIN_IN_PROGRESS_ = 5041;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_CLUSTER_NODE_NOT_FOUND_ = 5042;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_CLUSTER_LOCAL_NODE_NOT_FOUND_ = 5043;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_CLUSTER_NETWORK_EXISTS_ = 5044;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_CLUSTER_NETWORK_NOT_FOUND_ = 5045;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_CLUSTER_NETINTERFACE_EXISTS_ = 5046;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_CLUSTER_NETINTERFACE_NOT_FOUND_ = 5047;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_CLUSTER_INVALID_REQUEST_ = 5048;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_CLUSTER_INVALID_NETWORK_PROVIDER_ = 5049;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_CLUSTER_NODE_DOWN_ = 5050;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_CLUSTER_NODE_UNREACHABLE_ = 5051;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_CLUSTER_NODE_NOT_MEMBER_ = 5052;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_CLUSTER_JOIN_NOT_IN_PROGRESS_ = 5053;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_CLUSTER_INVALID_NETWORK_ = 5054;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_CLUSTER_NODE_UP_ = 5056;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_CLUSTER_IPADDR_IN_USE_ = 5057;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_CLUSTER_NODE_NOT_PAUSED_ = 5058;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_CLUSTER_NO_SECURITY_CONTEXT_ = 5059;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_CLUSTER_NETWORK_NOT_INTERNAL_ = 5060;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_CLUSTER_NODE_ALREADY_UP_ = 5061;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_CLUSTER_NODE_ALREADY_DOWN_ = 5062;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_CLUSTER_NETWORK_ALREADY_ONLINE_ = 5063;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_CLUSTER_NETWORK_ALREADY_OFFLINE_ = 5064;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_CLUSTER_NODE_ALREADY_MEMBER_ = 5065;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_CLUSTER_LAST_INTERNAL_NETWORK_ = 5066;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_CLUSTER_NETWORK_HAS_DEPENDENTS_ = 5067;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_INVALID_OPERATION_ON_QUORUM_ = 5068;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_DEPENDENCY_NOT_ALLOWED_ = 5069;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_CLUSTER_NODE_PAUSED_ = 5070;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_NODE_CANT_HOST_RESOURCE_ = 5071;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_CLUSTER_NODE_NOT_READY_ = 5072;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_CLUSTER_NODE_SHUTTING_DOWN_ = 5073;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_CLUSTER_JOIN_ABORTED_ = 5074;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_CLUSTER_INCOMPATIBLE_VERSIONS_ = 5075;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_CLUSTER_MAXNUM_OF_RESOURCES_EXCEEDED_ = 5076;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_CLUSTER_SYSTEM_CONFIG_CHANGED_ = 5077;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_CLUSTER_RESOURCE_TYPE_NOT_FOUND_ = 5078;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_CLUSTER_RESTYPE_NOT_SUPPORTED_ = 5079;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_CLUSTER_RESNAME_NOT_FOUND_ = 5080;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_CLUSTER_NO_RPC_PACKAGES_REGISTERED_ = 5081;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_CLUSTER_OWNER_NOT_IN_PREFLIST_ = 5082;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_CLUSTER_DATABASE_SEQMISMATCH_ = 5083;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_RESMON_INVALID_STATE_ = 5084;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_CLUSTER_GUM_NOT_LOCKER_ = 5085;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_QUORUM_DISK_NOT_FOUND_ = 5086;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_DATABASE_BACKUP_CORRUPT_ = 5087;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_CLUSTER_NODE_ALREADY_HAS_DFS_ROOT_ = 5088;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_RESOURCE_PROPERTY_UNCHANGEABLE_ = 5089;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_NO_ADMIN_ACCESS_POINT_ = 5090;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_CLUSTER_MEMBERSHIP_INVALID_STATE_ = 5890;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_CLUSTER_QUORUMLOG_NOT_FOUND_ = 5891;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_CLUSTER_MEMBERSHIP_HALT_ = 5892;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_CLUSTER_INSTANCE_ID_MISMATCH_ = 5893;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_CLUSTER_NETWORK_NOT_FOUND_FOR_IP_ = 5894;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_CLUSTER_PROPERTY_DATA_TYPE_MISMATCH_ = 5895;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_CLUSTER_EVICT_WITHOUT_CLEANUP_ = 5896;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_CLUSTER_PARAMETER_MISMATCH_ = 5897;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_NODE_CANNOT_BE_CLUSTERED_ = 5898;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_CLUSTER_WRONG_OS_VERSION_ = 5899;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_CLUSTER_CANT_CREATE_DUP_CLUSTER_NAME_ = 5900;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_CLUSCFG_ALREADY_COMMITTED_ = 5901;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_CLUSCFG_ROLLBACK_FAILED_ = 5902;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_CLUSCFG_SYSTEM_DISK_DRIVE_LETTER_CONFLICT_ = 5903;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_CLUSTER_OLD_VERSION_ = 5904;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_CLUSTER_MISMATCHED_COMPUTER_ACCT_NAME_ = 5905;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_CLUSTER_NO_NET_ADAPTERS_ = 5906;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_CLUSTER_POISONED_ = 5907;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_CLUSTER_GROUP_MOVING_ = 5908;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_CLUSTER_RESOURCE_TYPE_BUSY_ = 5909;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_RESOURCE_CALL_TIMED_OUT_ = 5910;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_INVALID_CLUSTER_IPV6_ADDRESS_ = 5911;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_CLUSTER_INTERNAL_INVALID_FUNCTION_ = 5912;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_CLUSTER_PARAMETER_OUT_OF_BOUNDS_ = 5913;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_CLUSTER_PARTIAL_SEND_ = 5914;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_CLUSTER_REGISTRY_INVALID_FUNCTION_ = 5915;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_CLUSTER_INVALID_STRING_TERMINATION_ = 5916;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_CLUSTER_INVALID_STRING_FORMAT_ = 5917;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_CLUSTER_DATABASE_TRANSACTION_IN_PROGRESS_ = 5918;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_CLUSTER_DATABASE_TRANSACTION_NOT_IN_PROGRESS_ = 5919;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_CLUSTER_NULL_DATA_ = 5920;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_CLUSTER_PARTIAL_READ_ = 5921;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_CLUSTER_PARTIAL_WRITE_ = 5922;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_CLUSTER_CANT_DESERIALIZE_DATA_ = 5923;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_DEPENDENT_RESOURCE_PROPERTY_CONFLICT_ = 5924;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_CLUSTER_NO_QUORUM_ = 5925;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_CLUSTER_INVALID_IPV6_NETWORK_ = 5926;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_CLUSTER_INVALID_IPV6_TUNNEL_NETWORK_ = 5927;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_QUORUM_NOT_ALLOWED_IN_THIS_GROUP_ = 5928;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_DEPENDENCY_TREE_TOO_COMPLEX_ = 5929;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_EXCEPTION_IN_RESOURCE_CALL_ = 5930;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_CLUSTER_RHS_FAILED_INITIALIZATION_ = 5931;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_CLUSTER_NOT_INSTALLED_ = 5932;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_CLUSTER_RESOURCES_MUST_BE_ONLINE_ON_THE_SAME_NODE_ = 5933;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_CLUSTER_MAX_NODES_IN_CLUSTER_ = 5934;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_CLUSTER_TOO_MANY_NODES_ = 5935;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_CLUSTER_OBJECT_ALREADY_USED_ = 5936;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_NONCORE_GROUPS_FOUND_ = 5937;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_FILE_SHARE_RESOURCE_CONFLICT_ = 5938;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_CLUSTER_EVICT_INVALID_REQUEST_ = 5939;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_CLUSTER_SINGLETON_RESOURCE_ = 5940;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_CLUSTER_GROUP_SINGLETON_RESOURCE_ = 5941;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_CLUSTER_RESOURCE_PROVIDER_FAILED_ = 5942;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_CLUSTER_RESOURCE_CONFIGURATION_ERROR_ = 5943;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_CLUSTER_GROUP_BUSY_ = 5944;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_CLUSTER_NOT_SHARED_VOLUME_ = 5945;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_CLUSTER_INVALID_SECURITY_DESCRIPTOR_ = 5946;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_CLUSTER_SHARED_VOLUMES_IN_USE_ = 5947;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_CLUSTER_USE_SHARED_VOLUMES_API_ = 5948;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_CLUSTER_BACKUP_IN_PROGRESS_ = 5949;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_NON_CSV_PATH_ = 5950;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_CSV_VOLUME_NOT_LOCAL_ = 5951;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_CLUSTER_WATCHDOG_TERMINATING_ = 5952;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_CLUSTER_RESOURCE_VETOED_MOVE_INCOMPATIBLE_NODES_ = 5953;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_CLUSTER_INVALID_NODE_WEIGHT_ = 5954;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_CLUSTER_RESOURCE_VETOED_CALL_ = 5955;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_RESMON_SYSTEM_RESOURCES_LACKING_ = 5956;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_CLUSTER_RESOURCE_VETOED_MOVE_NOT_ENOUGH_RESOURCES_ON_DESTINATION_ = 5957;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_CLUSTER_RESOURCE_VETOED_MOVE_NOT_ENOUGH_RESOURCES_ON_SOURCE_ = 5958;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_CLUSTER_GROUP_QUEUED_ = 5959;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_CLUSTER_RESOURCE_LOCKED_STATUS_ = 5960;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_CLUSTER_SHARED_VOLUME_FAILOVER_NOT_ALLOWED_ = 5961;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_CLUSTER_NODE_DRAIN_IN_PROGRESS_ = 5962;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_CLUSTER_DISK_NOT_CONNECTED_ = 5963;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_DISK_NOT_CSV_CAPABLE_ = 5964;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_RESOURCE_NOT_IN_AVAILABLE_STORAGE_ = 5965;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_CLUSTER_SHARED_VOLUME_REDIRECTED_ = 5966;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_CLUSTER_SHARED_VOLUME_NOT_REDIRECTED_ = 5967;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_CLUSTER_CANNOT_RETURN_PROPERTIES_ = 5968;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_CLUSTER_RESOURCE_CONTAINS_UNSUPPORTED_DIFF_AREA_FOR_SHARED_VOLUMES_ = 5969;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_CLUSTER_RESOURCE_IS_IN_MAINTENANCE_MODE_ = 5970;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_CLUSTER_AFFINITY_CONFLICT_ = 5971;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_CLUSTER_RESOURCE_IS_REPLICA_VIRTUAL_MACHINE_ = 5972;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_CLUSTER_UPGRADE_INCOMPATIBLE_VERSIONS_ = 5973;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_CLUSTER_UPGRADE_FIX_QUORUM_NOT_SUPPORTED_ = 5974;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_CLUSTER_UPGRADE_RESTART_REQUIRED_ = 5975;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_CLUSTER_UPGRADE_IN_PROGRESS_ = 5976;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_CLUSTER_UPGRADE_INCOMPLETE_ = 5977;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_CLUSTER_NODE_IN_GRACE_PERIOD_ = 5978;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_CLUSTER_CSV_IO_PAUSE_TIMEOUT_ = 5979;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_NODE_NOT_ACTIVE_CLUSTER_MEMBER_ = 5980;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_CLUSTER_RESOURCE_NOT_MONITORED_ = 5981;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_CLUSTER_RESOURCE_DOES_NOT_SUPPORT_UNMONITORED_ = 5982;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_CLUSTER_RESOURCE_IS_REPLICATED_ = 5983;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_CLUSTER_NODE_ISOLATED_ = 5984;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_CLUSTER_NODE_QUARANTINED_ = 5985;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_CLUSTER_DATABASE_UPDATE_CONDITION_FAILED_ = 5986;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_CLUSTER_SPACE_DEGRADED_ = 5987;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_CLUSTER_TOKEN_DELEGATION_NOT_SUPPORTED_ = 5988;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_CLUSTER_CSV_INVALID_HANDLE_ = 5989;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_CLUSTER_CSV_SUPPORTED_ONLY_ON_COORDINATOR_ = 5990;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_GROUPSET_NOT_AVAILABLE_ = 5991;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_GROUPSET_NOT_FOUND_ = 5992;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_GROUPSET_CANT_PROVIDE_ = 5993;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_CLUSTER_FAULT_DOMAIN_PARENT_NOT_FOUND_ = 5994;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_CLUSTER_FAULT_DOMAIN_INVALID_HIERARCHY_ = 5995;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_CLUSTER_FAULT_DOMAIN_FAILED_S2D_VALIDATION_ = 5996;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_CLUSTER_FAULT_DOMAIN_S2D_CONNECTIVITY_LOSS_ = 5997;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_CLUSTER_INVALID_INFRASTRUCTURE_FILESERVER_NAME_ = 5998;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_CLUSTERSET_MANAGEMENT_CLUSTER_UNREACHABLE_ = 5999;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_ENCRYPTION_FAILED_ = 6000;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_DECRYPTION_FAILED_ = 6001;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_FILE_ENCRYPTED_ = 6002;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_NO_RECOVERY_POLICY_ = 6003;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_NO_EFS_ = 6004;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_WRONG_EFS_ = 6005;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_NO_USER_KEYS_ = 6006;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_FILE_NOT_ENCRYPTED_ = 6007;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_NOT_EXPORT_FORMAT_ = 6008;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_FILE_READ_ONLY_ = 6009;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_DIR_EFS_DISALLOWED_ = 6010;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_EFS_SERVER_NOT_TRUSTED_ = 6011;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_BAD_RECOVERY_POLICY_ = 6012;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_EFS_ALG_BLOB_TOO_BIG_ = 6013;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_VOLUME_NOT_SUPPORT_EFS_ = 6014;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_EFS_DISABLED_ = 6015;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_EFS_VERSION_NOT_SUPPORT_ = 6016;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_CS_ENCRYPTION_INVALID_SERVER_RESPONSE_ = 6017;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_CS_ENCRYPTION_UNSUPPORTED_SERVER_ = 6018;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_CS_ENCRYPTION_EXISTING_ENCRYPTED_FILE_ = 6019;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_CS_ENCRYPTION_NEW_ENCRYPTED_FILE_ = 6020;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_CS_ENCRYPTION_FILE_NOT_CSE_ = 6021;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_ENCRYPTION_POLICY_DENIES_OPERATION_ = 6022;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_NO_BROWSER_SERVERS_FOUND_ = 6118;
-BOOST_CONSTEXPR_OR_CONST DWORD_ SCHED_E_SERVICE_NOT_LOCALSYSTEM_ = 6200;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_LOG_SECTOR_INVALID_ = 6600;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_LOG_SECTOR_PARITY_INVALID_ = 6601;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_LOG_SECTOR_REMAPPED_ = 6602;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_LOG_BLOCK_INCOMPLETE_ = 6603;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_LOG_INVALID_RANGE_ = 6604;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_LOG_BLOCKS_EXHAUSTED_ = 6605;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_LOG_READ_CONTEXT_INVALID_ = 6606;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_LOG_RESTART_INVALID_ = 6607;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_LOG_BLOCK_VERSION_ = 6608;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_LOG_BLOCK_INVALID_ = 6609;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_LOG_READ_MODE_INVALID_ = 6610;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_LOG_NO_RESTART_ = 6611;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_LOG_METADATA_CORRUPT_ = 6612;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_LOG_METADATA_INVALID_ = 6613;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_LOG_METADATA_INCONSISTENT_ = 6614;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_LOG_RESERVATION_INVALID_ = 6615;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_LOG_CANT_DELETE_ = 6616;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_LOG_CONTAINER_LIMIT_EXCEEDED_ = 6617;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_LOG_START_OF_LOG_ = 6618;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_LOG_POLICY_ALREADY_INSTALLED_ = 6619;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_LOG_POLICY_NOT_INSTALLED_ = 6620;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_LOG_POLICY_INVALID_ = 6621;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_LOG_POLICY_CONFLICT_ = 6622;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_LOG_PINNED_ARCHIVE_TAIL_ = 6623;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_LOG_RECORD_NONEXISTENT_ = 6624;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_LOG_RECORDS_RESERVED_INVALID_ = 6625;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_LOG_SPACE_RESERVED_INVALID_ = 6626;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_LOG_TAIL_INVALID_ = 6627;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_LOG_FULL_ = 6628;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_COULD_NOT_RESIZE_LOG_ = 6629;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_LOG_MULTIPLEXED_ = 6630;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_LOG_DEDICATED_ = 6631;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_LOG_ARCHIVE_NOT_IN_PROGRESS_ = 6632;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_LOG_ARCHIVE_IN_PROGRESS_ = 6633;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_LOG_EPHEMERAL_ = 6634;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_LOG_NOT_ENOUGH_CONTAINERS_ = 6635;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_LOG_CLIENT_ALREADY_REGISTERED_ = 6636;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_LOG_CLIENT_NOT_REGISTERED_ = 6637;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_LOG_FULL_HANDLER_IN_PROGRESS_ = 6638;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_LOG_CONTAINER_READ_FAILED_ = 6639;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_LOG_CONTAINER_WRITE_FAILED_ = 6640;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_LOG_CONTAINER_OPEN_FAILED_ = 6641;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_LOG_CONTAINER_STATE_INVALID_ = 6642;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_LOG_STATE_INVALID_ = 6643;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_LOG_PINNED_ = 6644;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_LOG_METADATA_FLUSH_FAILED_ = 6645;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_LOG_INCONSISTENT_SECURITY_ = 6646;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_LOG_APPENDED_FLUSH_FAILED_ = 6647;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_LOG_PINNED_RESERVATION_ = 6648;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_INVALID_TRANSACTION_ = 6700;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_TRANSACTION_NOT_ACTIVE_ = 6701;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_TRANSACTION_REQUEST_NOT_VALID_ = 6702;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_TRANSACTION_NOT_REQUESTED_ = 6703;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_TRANSACTION_ALREADY_ABORTED_ = 6704;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_TRANSACTION_ALREADY_COMMITTED_ = 6705;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_TM_INITIALIZATION_FAILED_ = 6706;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_RESOURCEMANAGER_READ_ONLY_ = 6707;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_TRANSACTION_NOT_JOINED_ = 6708;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_TRANSACTION_SUPERIOR_EXISTS_ = 6709;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_CRM_PROTOCOL_ALREADY_EXISTS_ = 6710;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_TRANSACTION_PROPAGATION_FAILED_ = 6711;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_CRM_PROTOCOL_NOT_FOUND_ = 6712;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_TRANSACTION_INVALID_MARSHALL_BUFFER_ = 6713;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_CURRENT_TRANSACTION_NOT_VALID_ = 6714;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_TRANSACTION_NOT_FOUND_ = 6715;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_RESOURCEMANAGER_NOT_FOUND_ = 6716;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_ENLISTMENT_NOT_FOUND_ = 6717;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_TRANSACTIONMANAGER_NOT_FOUND_ = 6718;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_TRANSACTIONMANAGER_NOT_ONLINE_ = 6719;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_TRANSACTIONMANAGER_RECOVERY_NAME_COLLISION_ = 6720;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_TRANSACTION_NOT_ROOT_ = 6721;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_TRANSACTION_OBJECT_EXPIRED_ = 6722;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_TRANSACTION_RESPONSE_NOT_ENLISTED_ = 6723;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_TRANSACTION_RECORD_TOO_LONG_ = 6724;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_IMPLICIT_TRANSACTION_NOT_SUPPORTED_ = 6725;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_TRANSACTION_INTEGRITY_VIOLATED_ = 6726;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_TRANSACTIONMANAGER_IDENTITY_MISMATCH_ = 6727;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_RM_CANNOT_BE_FROZEN_FOR_SNAPSHOT_ = 6728;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_TRANSACTION_MUST_WRITETHROUGH_ = 6729;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_TRANSACTION_NO_SUPERIOR_ = 6730;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_HEURISTIC_DAMAGE_POSSIBLE_ = 6731;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_TRANSACTIONAL_CONFLICT_ = 6800;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_RM_NOT_ACTIVE_ = 6801;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_RM_METADATA_CORRUPT_ = 6802;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_DIRECTORY_NOT_RM_ = 6803;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_TRANSACTIONS_UNSUPPORTED_REMOTE_ = 6805;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_LOG_RESIZE_INVALID_SIZE_ = 6806;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_OBJECT_NO_LONGER_EXISTS_ = 6807;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_STREAM_MINIVERSION_NOT_FOUND_ = 6808;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_STREAM_MINIVERSION_NOT_VALID_ = 6809;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_MINIVERSION_INACCESSIBLE_FROM_SPECIFIED_TRANSACTION_ = 6810;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_CANT_OPEN_MINIVERSION_WITH_MODIFY_INTENT_ = 6811;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_CANT_CREATE_MORE_STREAM_MINIVERSIONS_ = 6812;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_REMOTE_FILE_VERSION_MISMATCH_ = 6814;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_HANDLE_NO_LONGER_VALID_ = 6815;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_NO_TXF_METADATA_ = 6816;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_LOG_CORRUPTION_DETECTED_ = 6817;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_CANT_RECOVER_WITH_HANDLE_OPEN_ = 6818;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_RM_DISCONNECTED_ = 6819;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_ENLISTMENT_NOT_SUPERIOR_ = 6820;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_RECOVERY_NOT_NEEDED_ = 6821;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_RM_ALREADY_STARTED_ = 6822;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_FILE_IDENTITY_NOT_PERSISTENT_ = 6823;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_CANT_BREAK_TRANSACTIONAL_DEPENDENCY_ = 6824;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_CANT_CROSS_RM_BOUNDARY_ = 6825;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_TXF_DIR_NOT_EMPTY_ = 6826;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_INDOUBT_TRANSACTIONS_EXIST_ = 6827;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_TM_VOLATILE_ = 6828;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_ROLLBACK_TIMER_EXPIRED_ = 6829;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_TXF_ATTRIBUTE_CORRUPT_ = 6830;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_EFS_NOT_ALLOWED_IN_TRANSACTION_ = 6831;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_TRANSACTIONAL_OPEN_NOT_ALLOWED_ = 6832;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_LOG_GROWTH_FAILED_ = 6833;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_TRANSACTED_MAPPING_UNSUPPORTED_REMOTE_ = 6834;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_TXF_METADATA_ALREADY_PRESENT_ = 6835;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_TRANSACTION_SCOPE_CALLBACKS_NOT_SET_ = 6836;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_TRANSACTION_REQUIRED_PROMOTION_ = 6837;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_CANNOT_EXECUTE_FILE_IN_TRANSACTION_ = 6838;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_TRANSACTIONS_NOT_FROZEN_ = 6839;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_TRANSACTION_FREEZE_IN_PROGRESS_ = 6840;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_NOT_SNAPSHOT_VOLUME_ = 6841;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_NO_SAVEPOINT_WITH_OPEN_FILES_ = 6842;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_DATA_LOST_REPAIR_ = 6843;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_SPARSE_NOT_ALLOWED_IN_TRANSACTION_ = 6844;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_TM_IDENTITY_MISMATCH_ = 6845;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_FLOATED_SECTION_ = 6846;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_CANNOT_ACCEPT_TRANSACTED_WORK_ = 6847;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_CANNOT_ABORT_TRANSACTIONS_ = 6848;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_BAD_CLUSTERS_ = 6849;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_COMPRESSION_NOT_ALLOWED_IN_TRANSACTION_ = 6850;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_VOLUME_DIRTY_ = 6851;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_NO_LINK_TRACKING_IN_TRANSACTION_ = 6852;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_OPERATION_NOT_SUPPORTED_IN_TRANSACTION_ = 6853;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_EXPIRED_HANDLE_ = 6854;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_TRANSACTION_NOT_ENLISTED_ = 6855;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_CTX_WINSTATION_NAME_INVALID_ = 7001;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_CTX_INVALID_PD_ = 7002;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_CTX_PD_NOT_FOUND_ = 7003;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_CTX_WD_NOT_FOUND_ = 7004;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_CTX_CANNOT_MAKE_EVENTLOG_ENTRY_ = 7005;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_CTX_SERVICE_NAME_COLLISION_ = 7006;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_CTX_CLOSE_PENDING_ = 7007;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_CTX_NO_OUTBUF_ = 7008;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_CTX_MODEM_INF_NOT_FOUND_ = 7009;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_CTX_INVALID_MODEMNAME_ = 7010;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_CTX_MODEM_RESPONSE_ERROR_ = 7011;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_CTX_MODEM_RESPONSE_TIMEOUT_ = 7012;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_CTX_MODEM_RESPONSE_NO_CARRIER_ = 7013;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_CTX_MODEM_RESPONSE_NO_DIALTONE_ = 7014;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_CTX_MODEM_RESPONSE_BUSY_ = 7015;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_CTX_MODEM_RESPONSE_VOICE_ = 7016;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_CTX_TD_ERROR_ = 7017;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_CTX_WINSTATION_NOT_FOUND_ = 7022;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_CTX_WINSTATION_ALREADY_EXISTS_ = 7023;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_CTX_WINSTATION_BUSY_ = 7024;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_CTX_BAD_VIDEO_MODE_ = 7025;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_CTX_GRAPHICS_INVALID_ = 7035;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_CTX_LOGON_DISABLED_ = 7037;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_CTX_NOT_CONSOLE_ = 7038;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_CTX_CLIENT_QUERY_TIMEOUT_ = 7040;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_CTX_CONSOLE_DISCONNECT_ = 7041;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_CTX_CONSOLE_CONNECT_ = 7042;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_CTX_SHADOW_DENIED_ = 7044;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_CTX_WINSTATION_ACCESS_DENIED_ = 7045;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_CTX_INVALID_WD_ = 7049;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_CTX_SHADOW_INVALID_ = 7050;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_CTX_SHADOW_DISABLED_ = 7051;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_CTX_CLIENT_LICENSE_IN_USE_ = 7052;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_CTX_CLIENT_LICENSE_NOT_SET_ = 7053;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_CTX_LICENSE_NOT_AVAILABLE_ = 7054;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_CTX_LICENSE_CLIENT_INVALID_ = 7055;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_CTX_LICENSE_EXPIRED_ = 7056;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_CTX_SHADOW_NOT_RUNNING_ = 7057;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_CTX_SHADOW_ENDED_BY_MODE_CHANGE_ = 7058;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_ACTIVATION_COUNT_EXCEEDED_ = 7059;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_CTX_WINSTATIONS_DISABLED_ = 7060;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_CTX_ENCRYPTION_LEVEL_REQUIRED_ = 7061;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_CTX_SESSION_IN_USE_ = 7062;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_CTX_NO_FORCE_LOGOFF_ = 7063;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_CTX_ACCOUNT_RESTRICTION_ = 7064;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_RDP_PROTOCOL_ERROR_ = 7065;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_CTX_CDM_CONNECT_ = 7066;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_CTX_CDM_DISCONNECT_ = 7067;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_CTX_SECURITY_LAYER_ERROR_ = 7068;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_TS_INCOMPATIBLE_SESSIONS_ = 7069;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_TS_VIDEO_SUBSYSTEM_ERROR_ = 7070;
-BOOST_CONSTEXPR_OR_CONST DWORD_ FRS_ERR_INVALID_API_SEQUENCE_ = 8001;
-BOOST_CONSTEXPR_OR_CONST DWORD_ FRS_ERR_STARTING_SERVICE_ = 8002;
-BOOST_CONSTEXPR_OR_CONST DWORD_ FRS_ERR_STOPPING_SERVICE_ = 8003;
-BOOST_CONSTEXPR_OR_CONST DWORD_ FRS_ERR_INTERNAL_API_ = 8004;
-BOOST_CONSTEXPR_OR_CONST DWORD_ FRS_ERR_INTERNAL_ = 8005;
-BOOST_CONSTEXPR_OR_CONST DWORD_ FRS_ERR_SERVICE_COMM_ = 8006;
-BOOST_CONSTEXPR_OR_CONST DWORD_ FRS_ERR_INSUFFICIENT_PRIV_ = 8007;
-BOOST_CONSTEXPR_OR_CONST DWORD_ FRS_ERR_AUTHENTICATION_ = 8008;
-BOOST_CONSTEXPR_OR_CONST DWORD_ FRS_ERR_PARENT_INSUFFICIENT_PRIV_ = 8009;
-BOOST_CONSTEXPR_OR_CONST DWORD_ FRS_ERR_PARENT_AUTHENTICATION_ = 8010;
-BOOST_CONSTEXPR_OR_CONST DWORD_ FRS_ERR_CHILD_TO_PARENT_COMM_ = 8011;
-BOOST_CONSTEXPR_OR_CONST DWORD_ FRS_ERR_PARENT_TO_CHILD_COMM_ = 8012;
-BOOST_CONSTEXPR_OR_CONST DWORD_ FRS_ERR_SYSVOL_POPULATE_ = 8013;
-BOOST_CONSTEXPR_OR_CONST DWORD_ FRS_ERR_SYSVOL_POPULATE_TIMEOUT_ = 8014;
-BOOST_CONSTEXPR_OR_CONST DWORD_ FRS_ERR_SYSVOL_IS_BUSY_ = 8015;
-BOOST_CONSTEXPR_OR_CONST DWORD_ FRS_ERR_SYSVOL_DEMOTE_ = 8016;
-BOOST_CONSTEXPR_OR_CONST DWORD_ FRS_ERR_INVALID_SERVICE_PARAMETER_ = 8017;
-BOOST_CONSTEXPR_OR_CONST DWORD_ DS_S_SUCCESS_ = NO_ERROR_;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_DS_NOT_INSTALLED_ = 8200;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_DS_MEMBERSHIP_EVALUATED_LOCALLY_ = 8201;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_DS_NO_ATTRIBUTE_OR_VALUE_ = 8202;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_DS_INVALID_ATTRIBUTE_SYNTAX_ = 8203;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_DS_ATTRIBUTE_TYPE_UNDEFINED_ = 8204;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_DS_ATTRIBUTE_OR_VALUE_EXISTS_ = 8205;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_DS_BUSY_ = 8206;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_DS_UNAVAILABLE_ = 8207;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_DS_NO_RIDS_ALLOCATED_ = 8208;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_DS_NO_MORE_RIDS_ = 8209;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_DS_INCORRECT_ROLE_OWNER_ = 8210;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_DS_RIDMGR_INIT_ERROR_ = 8211;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_DS_OBJ_CLASS_VIOLATION_ = 8212;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_DS_CANT_ON_NON_LEAF_ = 8213;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_DS_CANT_ON_RDN_ = 8214;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_DS_CANT_MOD_OBJ_CLASS_ = 8215;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_DS_CROSS_DOM_MOVE_ERROR_ = 8216;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_DS_GC_NOT_AVAILABLE_ = 8217;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_SHARED_POLICY_ = 8218;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_POLICY_OBJECT_NOT_FOUND_ = 8219;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_POLICY_ONLY_IN_DS_ = 8220;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_PROMOTION_ACTIVE_ = 8221;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_NO_PROMOTION_ACTIVE_ = 8222;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_DS_OPERATIONS_ERROR_ = 8224;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_DS_PROTOCOL_ERROR_ = 8225;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_DS_TIMELIMIT_EXCEEDED_ = 8226;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_DS_SIZELIMIT_EXCEEDED_ = 8227;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_DS_ADMIN_LIMIT_EXCEEDED_ = 8228;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_DS_COMPARE_FALSE_ = 8229;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_DS_COMPARE_TRUE_ = 8230;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_DS_AUTH_METHOD_NOT_SUPPORTED_ = 8231;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_DS_STRONG_AUTH_REQUIRED_ = 8232;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_DS_INAPPROPRIATE_AUTH_ = 8233;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_DS_AUTH_UNKNOWN_ = 8234;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_DS_REFERRAL_ = 8235;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_DS_UNAVAILABLE_CRIT_EXTENSION_ = 8236;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_DS_CONFIDENTIALITY_REQUIRED_ = 8237;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_DS_INAPPROPRIATE_MATCHING_ = 8238;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_DS_CONSTRAINT_VIOLATION_ = 8239;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_DS_NO_SUCH_OBJECT_ = 8240;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_DS_ALIAS_PROBLEM_ = 8241;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_DS_INVALID_DN_SYNTAX_ = 8242;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_DS_IS_LEAF_ = 8243;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_DS_ALIAS_DEREF_PROBLEM_ = 8244;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_DS_UNWILLING_TO_PERFORM_ = 8245;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_DS_LOOP_DETECT_ = 8246;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_DS_NAMING_VIOLATION_ = 8247;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_DS_OBJECT_RESULTS_TOO_LARGE_ = 8248;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_DS_AFFECTS_MULTIPLE_DSAS_ = 8249;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_DS_SERVER_DOWN_ = 8250;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_DS_LOCAL_ERROR_ = 8251;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_DS_ENCODING_ERROR_ = 8252;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_DS_DECODING_ERROR_ = 8253;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_DS_FILTER_UNKNOWN_ = 8254;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_DS_PARAM_ERROR_ = 8255;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_DS_NOT_SUPPORTED_ = 8256;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_DS_NO_RESULTS_RETURNED_ = 8257;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_DS_CONTROL_NOT_FOUND_ = 8258;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_DS_CLIENT_LOOP_ = 8259;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_DS_REFERRAL_LIMIT_EXCEEDED_ = 8260;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_DS_SORT_CONTROL_MISSING_ = 8261;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_DS_OFFSET_RANGE_ERROR_ = 8262;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_DS_RIDMGR_DISABLED_ = 8263;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_DS_ROOT_MUST_BE_NC_ = 8301;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_DS_ADD_REPLICA_INHIBITED_ = 8302;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_DS_ATT_NOT_DEF_IN_SCHEMA_ = 8303;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_DS_MAX_OBJ_SIZE_EXCEEDED_ = 8304;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_DS_OBJ_STRING_NAME_EXISTS_ = 8305;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_DS_NO_RDN_DEFINED_IN_SCHEMA_ = 8306;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_DS_RDN_DOESNT_MATCH_SCHEMA_ = 8307;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_DS_NO_REQUESTED_ATTS_FOUND_ = 8308;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_DS_USER_BUFFER_TO_SMALL_ = 8309;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_DS_ATT_IS_NOT_ON_OBJ_ = 8310;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_DS_ILLEGAL_MOD_OPERATION_ = 8311;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_DS_OBJ_TOO_LARGE_ = 8312;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_DS_BAD_INSTANCE_TYPE_ = 8313;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_DS_MASTERDSA_REQUIRED_ = 8314;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_DS_OBJECT_CLASS_REQUIRED_ = 8315;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_DS_MISSING_REQUIRED_ATT_ = 8316;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_DS_ATT_NOT_DEF_FOR_CLASS_ = 8317;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_DS_ATT_ALREADY_EXISTS_ = 8318;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_DS_CANT_ADD_ATT_VALUES_ = 8320;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_DS_SINGLE_VALUE_CONSTRAINT_ = 8321;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_DS_RANGE_CONSTRAINT_ = 8322;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_DS_ATT_VAL_ALREADY_EXISTS_ = 8323;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_DS_CANT_REM_MISSING_ATT_ = 8324;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_DS_CANT_REM_MISSING_ATT_VAL_ = 8325;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_DS_ROOT_CANT_BE_SUBREF_ = 8326;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_DS_NO_CHAINING_ = 8327;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_DS_NO_CHAINED_EVAL_ = 8328;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_DS_NO_PARENT_OBJECT_ = 8329;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_DS_PARENT_IS_AN_ALIAS_ = 8330;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_DS_CANT_MIX_MASTER_AND_REPS_ = 8331;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_DS_CHILDREN_EXIST_ = 8332;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_DS_OBJ_NOT_FOUND_ = 8333;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_DS_ALIASED_OBJ_MISSING_ = 8334;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_DS_BAD_NAME_SYNTAX_ = 8335;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_DS_ALIAS_POINTS_TO_ALIAS_ = 8336;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_DS_CANT_DEREF_ALIAS_ = 8337;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_DS_OUT_OF_SCOPE_ = 8338;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_DS_OBJECT_BEING_REMOVED_ = 8339;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_DS_CANT_DELETE_DSA_OBJ_ = 8340;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_DS_GENERIC_ERROR_ = 8341;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_DS_DSA_MUST_BE_INT_MASTER_ = 8342;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_DS_CLASS_NOT_DSA_ = 8343;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_DS_INSUFF_ACCESS_RIGHTS_ = 8344;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_DS_ILLEGAL_SUPERIOR_ = 8345;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_DS_ATTRIBUTE_OWNED_BY_SAM_ = 8346;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_DS_NAME_TOO_MANY_PARTS_ = 8347;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_DS_NAME_TOO_LONG_ = 8348;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_DS_NAME_VALUE_TOO_LONG_ = 8349;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_DS_NAME_UNPARSEABLE_ = 8350;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_DS_NAME_TYPE_UNKNOWN_ = 8351;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_DS_NOT_AN_OBJECT_ = 8352;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_DS_SEC_DESC_TOO_SHORT_ = 8353;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_DS_SEC_DESC_INVALID_ = 8354;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_DS_NO_DELETED_NAME_ = 8355;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_DS_SUBREF_MUST_HAVE_PARENT_ = 8356;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_DS_NCNAME_MUST_BE_NC_ = 8357;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_DS_CANT_ADD_SYSTEM_ONLY_ = 8358;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_DS_CLASS_MUST_BE_CONCRETE_ = 8359;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_DS_INVALID_DMD_ = 8360;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_DS_OBJ_GUID_EXISTS_ = 8361;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_DS_NOT_ON_BACKLINK_ = 8362;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_DS_NO_CROSSREF_FOR_NC_ = 8363;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_DS_SHUTTING_DOWN_ = 8364;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_DS_UNKNOWN_OPERATION_ = 8365;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_DS_INVALID_ROLE_OWNER_ = 8366;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_DS_COULDNT_CONTACT_FSMO_ = 8367;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_DS_CROSS_NC_DN_RENAME_ = 8368;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_DS_CANT_MOD_SYSTEM_ONLY_ = 8369;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_DS_REPLICATOR_ONLY_ = 8370;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_DS_OBJ_CLASS_NOT_DEFINED_ = 8371;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_DS_OBJ_CLASS_NOT_SUBCLASS_ = 8372;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_DS_NAME_REFERENCE_INVALID_ = 8373;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_DS_CROSS_REF_EXISTS_ = 8374;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_DS_CANT_DEL_MASTER_CROSSREF_ = 8375;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_DS_SUBTREE_NOTIFY_NOT_NC_HEAD_ = 8376;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_DS_NOTIFY_FILTER_TOO_COMPLEX_ = 8377;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_DS_DUP_RDN_ = 8378;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_DS_DUP_OID_ = 8379;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_DS_DUP_MAPI_ID_ = 8380;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_DS_DUP_SCHEMA_ID_GUID_ = 8381;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_DS_DUP_LDAP_DISPLAY_NAME_ = 8382;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_DS_SEMANTIC_ATT_TEST_ = 8383;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_DS_SYNTAX_MISMATCH_ = 8384;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_DS_EXISTS_IN_MUST_HAVE_ = 8385;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_DS_EXISTS_IN_MAY_HAVE_ = 8386;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_DS_NONEXISTENT_MAY_HAVE_ = 8387;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_DS_NONEXISTENT_MUST_HAVE_ = 8388;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_DS_AUX_CLS_TEST_FAIL_ = 8389;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_DS_NONEXISTENT_POSS_SUP_ = 8390;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_DS_SUB_CLS_TEST_FAIL_ = 8391;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_DS_BAD_RDN_ATT_ID_SYNTAX_ = 8392;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_DS_EXISTS_IN_AUX_CLS_ = 8393;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_DS_EXISTS_IN_SUB_CLS_ = 8394;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_DS_EXISTS_IN_POSS_SUP_ = 8395;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_DS_RECALCSCHEMA_FAILED_ = 8396;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_DS_TREE_DELETE_NOT_FINISHED_ = 8397;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_DS_CANT_DELETE_ = 8398;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_DS_ATT_SCHEMA_REQ_ID_ = 8399;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_DS_BAD_ATT_SCHEMA_SYNTAX_ = 8400;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_DS_CANT_CACHE_ATT_ = 8401;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_DS_CANT_CACHE_CLASS_ = 8402;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_DS_CANT_REMOVE_ATT_CACHE_ = 8403;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_DS_CANT_REMOVE_CLASS_CACHE_ = 8404;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_DS_CANT_RETRIEVE_DN_ = 8405;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_DS_MISSING_SUPREF_ = 8406;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_DS_CANT_RETRIEVE_INSTANCE_ = 8407;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_DS_CODE_INCONSISTENCY_ = 8408;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_DS_DATABASE_ERROR_ = 8409;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_DS_GOVERNSID_MISSING_ = 8410;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_DS_MISSING_EXPECTED_ATT_ = 8411;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_DS_NCNAME_MISSING_CR_REF_ = 8412;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_DS_SECURITY_CHECKING_ERROR_ = 8413;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_DS_SCHEMA_NOT_LOADED_ = 8414;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_DS_SCHEMA_ALLOC_FAILED_ = 8415;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_DS_ATT_SCHEMA_REQ_SYNTAX_ = 8416;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_DS_GCVERIFY_ERROR_ = 8417;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_DS_DRA_SCHEMA_MISMATCH_ = 8418;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_DS_CANT_FIND_DSA_OBJ_ = 8419;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_DS_CANT_FIND_EXPECTED_NC_ = 8420;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_DS_CANT_FIND_NC_IN_CACHE_ = 8421;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_DS_CANT_RETRIEVE_CHILD_ = 8422;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_DS_SECURITY_ILLEGAL_MODIFY_ = 8423;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_DS_CANT_REPLACE_HIDDEN_REC_ = 8424;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_DS_BAD_HIERARCHY_FILE_ = 8425;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_DS_BUILD_HIERARCHY_TABLE_FAILED_ = 8426;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_DS_CONFIG_PARAM_MISSING_ = 8427;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_DS_COUNTING_AB_INDICES_FAILED_ = 8428;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_DS_HIERARCHY_TABLE_MALLOC_FAILED_ = 8429;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_DS_INTERNAL_FAILURE_ = 8430;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_DS_UNKNOWN_ERROR_ = 8431;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_DS_ROOT_REQUIRES_CLASS_TOP_ = 8432;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_DS_REFUSING_FSMO_ROLES_ = 8433;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_DS_MISSING_FSMO_SETTINGS_ = 8434;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_DS_UNABLE_TO_SURRENDER_ROLES_ = 8435;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_DS_DRA_GENERIC_ = 8436;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_DS_DRA_INVALID_PARAMETER_ = 8437;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_DS_DRA_BUSY_ = 8438;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_DS_DRA_BAD_DN_ = 8439;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_DS_DRA_BAD_NC_ = 8440;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_DS_DRA_DN_EXISTS_ = 8441;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_DS_DRA_INTERNAL_ERROR_ = 8442;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_DS_DRA_INCONSISTENT_DIT_ = 8443;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_DS_DRA_CONNECTION_FAILED_ = 8444;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_DS_DRA_BAD_INSTANCE_TYPE_ = 8445;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_DS_DRA_OUT_OF_MEM_ = 8446;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_DS_DRA_MAIL_PROBLEM_ = 8447;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_DS_DRA_REF_ALREADY_EXISTS_ = 8448;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_DS_DRA_REF_NOT_FOUND_ = 8449;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_DS_DRA_OBJ_IS_REP_SOURCE_ = 8450;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_DS_DRA_DB_ERROR_ = 8451;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_DS_DRA_NO_REPLICA_ = 8452;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_DS_DRA_ACCESS_DENIED_ = 8453;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_DS_DRA_NOT_SUPPORTED_ = 8454;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_DS_DRA_RPC_CANCELLED_ = 8455;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_DS_DRA_SOURCE_DISABLED_ = 8456;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_DS_DRA_SINK_DISABLED_ = 8457;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_DS_DRA_NAME_COLLISION_ = 8458;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_DS_DRA_SOURCE_REINSTALLED_ = 8459;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_DS_DRA_MISSING_PARENT_ = 8460;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_DS_DRA_PREEMPTED_ = 8461;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_DS_DRA_ABANDON_SYNC_ = 8462;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_DS_DRA_SHUTDOWN_ = 8463;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_DS_DRA_INCOMPATIBLE_PARTIAL_SET_ = 8464;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_DS_DRA_SOURCE_IS_PARTIAL_REPLICA_ = 8465;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_DS_DRA_EXTN_CONNECTION_FAILED_ = 8466;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_DS_INSTALL_SCHEMA_MISMATCH_ = 8467;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_DS_DUP_LINK_ID_ = 8468;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_DS_NAME_ERROR_RESOLVING_ = 8469;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_DS_NAME_ERROR_NOT_FOUND_ = 8470;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_DS_NAME_ERROR_NOT_UNIQUE_ = 8471;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_DS_NAME_ERROR_NO_MAPPING_ = 8472;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_DS_NAME_ERROR_DOMAIN_ONLY_ = 8473;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_DS_NAME_ERROR_NO_SYNTACTICAL_MAPPING_ = 8474;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_DS_CONSTRUCTED_ATT_MOD_ = 8475;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_DS_WRONG_OM_OBJ_CLASS_ = 8476;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_DS_DRA_REPL_PENDING_ = 8477;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_DS_DS_REQUIRED_ = 8478;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_DS_INVALID_LDAP_DISPLAY_NAME_ = 8479;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_DS_NON_BASE_SEARCH_ = 8480;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_DS_CANT_RETRIEVE_ATTS_ = 8481;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_DS_BACKLINK_WITHOUT_LINK_ = 8482;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_DS_EPOCH_MISMATCH_ = 8483;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_DS_SRC_NAME_MISMATCH_ = 8484;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_DS_SRC_AND_DST_NC_IDENTICAL_ = 8485;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_DS_DST_NC_MISMATCH_ = 8486;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_DS_NOT_AUTHORITIVE_FOR_DST_NC_ = 8487;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_DS_SRC_GUID_MISMATCH_ = 8488;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_DS_CANT_MOVE_DELETED_OBJECT_ = 8489;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_DS_PDC_OPERATION_IN_PROGRESS_ = 8490;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_DS_CROSS_DOMAIN_CLEANUP_REQD_ = 8491;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_DS_ILLEGAL_XDOM_MOVE_OPERATION_ = 8492;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_DS_CANT_WITH_ACCT_GROUP_MEMBERSHPS_ = 8493;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_DS_NC_MUST_HAVE_NC_PARENT_ = 8494;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_DS_CR_IMPOSSIBLE_TO_VALIDATE_ = 8495;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_DS_DST_DOMAIN_NOT_NATIVE_ = 8496;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_DS_MISSING_INFRASTRUCTURE_CONTAINER_ = 8497;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_DS_CANT_MOVE_ACCOUNT_GROUP_ = 8498;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_DS_CANT_MOVE_RESOURCE_GROUP_ = 8499;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_DS_INVALID_SEARCH_FLAG_ = 8500;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_DS_NO_TREE_DELETE_ABOVE_NC_ = 8501;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_DS_COULDNT_LOCK_TREE_FOR_DELETE_ = 8502;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_DS_COULDNT_IDENTIFY_OBJECTS_FOR_TREE_DELETE_ = 8503;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_DS_SAM_INIT_FAILURE_ = 8504;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_DS_SENSITIVE_GROUP_VIOLATION_ = 8505;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_DS_CANT_MOD_PRIMARYGROUPID_ = 8506;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_DS_ILLEGAL_BASE_SCHEMA_MOD_ = 8507;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_DS_NONSAFE_SCHEMA_CHANGE_ = 8508;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_DS_SCHEMA_UPDATE_DISALLOWED_ = 8509;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_DS_CANT_CREATE_UNDER_SCHEMA_ = 8510;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_DS_INSTALL_NO_SRC_SCH_VERSION_ = 8511;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_DS_INSTALL_NO_SCH_VERSION_IN_INIFILE_ = 8512;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_DS_INVALID_GROUP_TYPE_ = 8513;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_DS_NO_NEST_GLOBALGROUP_IN_MIXEDDOMAIN_ = 8514;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_DS_NO_NEST_LOCALGROUP_IN_MIXEDDOMAIN_ = 8515;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_DS_GLOBAL_CANT_HAVE_LOCAL_MEMBER_ = 8516;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_DS_GLOBAL_CANT_HAVE_UNIVERSAL_MEMBER_ = 8517;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_DS_UNIVERSAL_CANT_HAVE_LOCAL_MEMBER_ = 8518;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_DS_GLOBAL_CANT_HAVE_CROSSDOMAIN_MEMBER_ = 8519;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_DS_LOCAL_CANT_HAVE_CROSSDOMAIN_LOCAL_MEMBER_ = 8520;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_DS_HAVE_PRIMARY_MEMBERS_ = 8521;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_DS_STRING_SD_CONVERSION_FAILED_ = 8522;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_DS_NAMING_MASTER_GC_ = 8523;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_DS_DNS_LOOKUP_FAILURE_ = 8524;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_DS_COULDNT_UPDATE_SPNS_ = 8525;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_DS_CANT_RETRIEVE_SD_ = 8526;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_DS_KEY_NOT_UNIQUE_ = 8527;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_DS_WRONG_LINKED_ATT_SYNTAX_ = 8528;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_DS_SAM_NEED_BOOTKEY_PASSWORD_ = 8529;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_DS_SAM_NEED_BOOTKEY_FLOPPY_ = 8530;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_DS_CANT_START_ = 8531;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_DS_INIT_FAILURE_ = 8532;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_DS_NO_PKT_PRIVACY_ON_CONNECTION_ = 8533;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_DS_SOURCE_DOMAIN_IN_FOREST_ = 8534;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_DS_DESTINATION_DOMAIN_NOT_IN_FOREST_ = 8535;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_DS_DESTINATION_AUDITING_NOT_ENABLED_ = 8536;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_DS_CANT_FIND_DC_FOR_SRC_DOMAIN_ = 8537;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_DS_SRC_OBJ_NOT_GROUP_OR_USER_ = 8538;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_DS_SRC_SID_EXISTS_IN_FOREST_ = 8539;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_DS_SRC_AND_DST_OBJECT_CLASS_MISMATCH_ = 8540;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_SAM_INIT_FAILURE_ = 8541;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_DS_DRA_SCHEMA_INFO_SHIP_ = 8542;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_DS_DRA_SCHEMA_CONFLICT_ = 8543;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_DS_DRA_EARLIER_SCHEMA_CONFLICT_ = 8544;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_DS_DRA_OBJ_NC_MISMATCH_ = 8545;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_DS_NC_STILL_HAS_DSAS_ = 8546;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_DS_GC_REQUIRED_ = 8547;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_DS_LOCAL_MEMBER_OF_LOCAL_ONLY_ = 8548;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_DS_NO_FPO_IN_UNIVERSAL_GROUPS_ = 8549;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_DS_CANT_ADD_TO_GC_ = 8550;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_DS_NO_CHECKPOINT_WITH_PDC_ = 8551;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_DS_SOURCE_AUDITING_NOT_ENABLED_ = 8552;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_DS_CANT_CREATE_IN_NONDOMAIN_NC_ = 8553;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_DS_INVALID_NAME_FOR_SPN_ = 8554;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_DS_FILTER_USES_CONTRUCTED_ATTRS_ = 8555;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_DS_UNICODEPWD_NOT_IN_QUOTES_ = 8556;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_DS_MACHINE_ACCOUNT_QUOTA_EXCEEDED_ = 8557;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_DS_MUST_BE_RUN_ON_DST_DC_ = 8558;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_DS_SRC_DC_MUST_BE_SP4_OR_GREATER_ = 8559;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_DS_CANT_TREE_DELETE_CRITICAL_OBJ_ = 8560;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_DS_INIT_FAILURE_CONSOLE_ = 8561;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_DS_SAM_INIT_FAILURE_CONSOLE_ = 8562;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_DS_FOREST_VERSION_TOO_HIGH_ = 8563;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_DS_DOMAIN_VERSION_TOO_HIGH_ = 8564;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_DS_FOREST_VERSION_TOO_LOW_ = 8565;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_DS_DOMAIN_VERSION_TOO_LOW_ = 8566;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_DS_INCOMPATIBLE_VERSION_ = 8567;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_DS_LOW_DSA_VERSION_ = 8568;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_DS_NO_BEHAVIOR_VERSION_IN_MIXEDDOMAIN_ = 8569;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_DS_NOT_SUPPORTED_SORT_ORDER_ = 8570;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_DS_NAME_NOT_UNIQUE_ = 8571;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_DS_MACHINE_ACCOUNT_CREATED_PRENT4_ = 8572;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_DS_OUT_OF_VERSION_STORE_ = 8573;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_DS_INCOMPATIBLE_CONTROLS_USED_ = 8574;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_DS_NO_REF_DOMAIN_ = 8575;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_DS_RESERVED_LINK_ID_ = 8576;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_DS_LINK_ID_NOT_AVAILABLE_ = 8577;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_DS_AG_CANT_HAVE_UNIVERSAL_MEMBER_ = 8578;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_DS_MODIFYDN_DISALLOWED_BY_INSTANCE_TYPE_ = 8579;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_DS_NO_OBJECT_MOVE_IN_SCHEMA_NC_ = 8580;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_DS_MODIFYDN_DISALLOWED_BY_FLAG_ = 8581;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_DS_MODIFYDN_WRONG_GRANDPARENT_ = 8582;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_DS_NAME_ERROR_TRUST_REFERRAL_ = 8583;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_NOT_SUPPORTED_ON_STANDARD_SERVER_ = 8584;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_DS_CANT_ACCESS_REMOTE_PART_OF_AD_ = 8585;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_DS_CR_IMPOSSIBLE_TO_VALIDATE_V2_ = 8586;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_DS_THREAD_LIMIT_EXCEEDED_ = 8587;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_DS_NOT_CLOSEST_ = 8588;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_DS_CANT_DERIVE_SPN_WITHOUT_SERVER_REF_ = 8589;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_DS_SINGLE_USER_MODE_FAILED_ = 8590;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_DS_NTDSCRIPT_SYNTAX_ERROR_ = 8591;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_DS_NTDSCRIPT_PROCESS_ERROR_ = 8592;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_DS_DIFFERENT_REPL_EPOCHS_ = 8593;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_DS_DRS_EXTENSIONS_CHANGED_ = 8594;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_DS_REPLICA_SET_CHANGE_NOT_ALLOWED_ON_DISABLED_CR_ = 8595;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_DS_NO_MSDS_INTID_ = 8596;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_DS_DUP_MSDS_INTID_ = 8597;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_DS_EXISTS_IN_RDNATTID_ = 8598;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_DS_AUTHORIZATION_FAILED_ = 8599;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_DS_INVALID_SCRIPT_ = 8600;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_DS_REMOTE_CROSSREF_OP_FAILED_ = 8601;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_DS_CROSS_REF_BUSY_ = 8602;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_DS_CANT_DERIVE_SPN_FOR_DELETED_DOMAIN_ = 8603;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_DS_CANT_DEMOTE_WITH_WRITEABLE_NC_ = 8604;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_DS_DUPLICATE_ID_FOUND_ = 8605;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_DS_INSUFFICIENT_ATTR_TO_CREATE_OBJECT_ = 8606;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_DS_GROUP_CONVERSION_ERROR_ = 8607;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_DS_CANT_MOVE_APP_BASIC_GROUP_ = 8608;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_DS_CANT_MOVE_APP_QUERY_GROUP_ = 8609;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_DS_ROLE_NOT_VERIFIED_ = 8610;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_DS_WKO_CONTAINER_CANNOT_BE_SPECIAL_ = 8611;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_DS_DOMAIN_RENAME_IN_PROGRESS_ = 8612;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_DS_EXISTING_AD_CHILD_NC_ = 8613;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_DS_REPL_LIFETIME_EXCEEDED_ = 8614;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_DS_DISALLOWED_IN_SYSTEM_CONTAINER_ = 8615;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_DS_LDAP_SEND_QUEUE_FULL_ = 8616;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_DS_DRA_OUT_SCHEDULE_WINDOW_ = 8617;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_DS_POLICY_NOT_KNOWN_ = 8618;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_NO_SITE_SETTINGS_OBJECT_ = 8619;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_NO_SECRETS_ = 8620;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_NO_WRITABLE_DC_FOUND_ = 8621;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_DS_NO_SERVER_OBJECT_ = 8622;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_DS_NO_NTDSA_OBJECT_ = 8623;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_DS_NON_ASQ_SEARCH_ = 8624;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_DS_AUDIT_FAILURE_ = 8625;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_DS_INVALID_SEARCH_FLAG_SUBTREE_ = 8626;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_DS_INVALID_SEARCH_FLAG_TUPLE_ = 8627;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_DS_HIERARCHY_TABLE_TOO_DEEP_ = 8628;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_DS_DRA_CORRUPT_UTD_VECTOR_ = 8629;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_DS_DRA_SECRETS_DENIED_ = 8630;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_DS_RESERVED_MAPI_ID_ = 8631;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_DS_MAPI_ID_NOT_AVAILABLE_ = 8632;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_DS_DRA_MISSING_KRBTGT_SECRET_ = 8633;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_DS_DOMAIN_NAME_EXISTS_IN_FOREST_ = 8634;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_DS_FLAT_NAME_EXISTS_IN_FOREST_ = 8635;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_INVALID_USER_PRINCIPAL_NAME_ = 8636;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_DS_OID_MAPPED_GROUP_CANT_HAVE_MEMBERS_ = 8637;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_DS_OID_NOT_FOUND_ = 8638;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_DS_DRA_RECYCLED_TARGET_ = 8639;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_DS_DISALLOWED_NC_REDIRECT_ = 8640;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_DS_HIGH_ADLDS_FFL_ = 8641;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_DS_HIGH_DSA_VERSION_ = 8642;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_DS_LOW_ADLDS_FFL_ = 8643;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_DOMAIN_SID_SAME_AS_LOCAL_WORKSTATION_ = 8644;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_DS_UNDELETE_SAM_VALIDATION_FAILED_ = 8645;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_INCORRECT_ACCOUNT_TYPE_ = 8646;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_DS_SPN_VALUE_NOT_UNIQUE_IN_FOREST_ = 8647;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_DS_UPN_VALUE_NOT_UNIQUE_IN_FOREST_ = 8648;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_DS_MISSING_FOREST_TRUST_ = 8649;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_DS_VALUE_KEY_NOT_UNIQUE_ = 8650;
-BOOST_CONSTEXPR_OR_CONST DWORD_ DNS_ERROR_RESPONSE_CODES_BASE_ = 9000;
-BOOST_CONSTEXPR_OR_CONST DWORD_ DNS_ERROR_RCODE_NO_ERROR_ = NO_ERROR_;
-BOOST_CONSTEXPR_OR_CONST DWORD_ DNS_ERROR_MASK_ = 0x00002328;
-BOOST_CONSTEXPR_OR_CONST DWORD_ DNS_ERROR_RCODE_FORMAT_ERROR_ = 9001;
-BOOST_CONSTEXPR_OR_CONST DWORD_ DNS_ERROR_RCODE_SERVER_FAILURE_ = 9002;
-BOOST_CONSTEXPR_OR_CONST DWORD_ DNS_ERROR_RCODE_NAME_ERROR_ = 9003;
-BOOST_CONSTEXPR_OR_CONST DWORD_ DNS_ERROR_RCODE_NOT_IMPLEMENTED_ = 9004;
-BOOST_CONSTEXPR_OR_CONST DWORD_ DNS_ERROR_RCODE_REFUSED_ = 9005;
-BOOST_CONSTEXPR_OR_CONST DWORD_ DNS_ERROR_RCODE_YXDOMAIN_ = 9006;
-BOOST_CONSTEXPR_OR_CONST DWORD_ DNS_ERROR_RCODE_YXRRSET_ = 9007;
-BOOST_CONSTEXPR_OR_CONST DWORD_ DNS_ERROR_RCODE_NXRRSET_ = 9008;
-BOOST_CONSTEXPR_OR_CONST DWORD_ DNS_ERROR_RCODE_NOTAUTH_ = 9009;
-BOOST_CONSTEXPR_OR_CONST DWORD_ DNS_ERROR_RCODE_NOTZONE_ = 9010;
-BOOST_CONSTEXPR_OR_CONST DWORD_ DNS_ERROR_RCODE_BADSIG_ = 9016;
-BOOST_CONSTEXPR_OR_CONST DWORD_ DNS_ERROR_RCODE_BADKEY_ = 9017;
-BOOST_CONSTEXPR_OR_CONST DWORD_ DNS_ERROR_RCODE_BADTIME_ = 9018;
-BOOST_CONSTEXPR_OR_CONST DWORD_ DNS_ERROR_RCODE_LAST_ = DNS_ERROR_RCODE_BADTIME_;
-BOOST_CONSTEXPR_OR_CONST DWORD_ DNS_ERROR_DNSSEC_BASE_ = 9100;
-BOOST_CONSTEXPR_OR_CONST DWORD_ DNS_ERROR_KEYMASTER_REQUIRED_ = 9101;
-BOOST_CONSTEXPR_OR_CONST DWORD_ DNS_ERROR_NOT_ALLOWED_ON_SIGNED_ZONE_ = 9102;
-BOOST_CONSTEXPR_OR_CONST DWORD_ DNS_ERROR_NSEC3_INCOMPATIBLE_WITH_RSA_SHA1_ = 9103;
-BOOST_CONSTEXPR_OR_CONST DWORD_ DNS_ERROR_NOT_ENOUGH_SIGNING_KEY_DESCRIPTORS_ = 9104;
-BOOST_CONSTEXPR_OR_CONST DWORD_ DNS_ERROR_UNSUPPORTED_ALGORITHM_ = 9105;
-BOOST_CONSTEXPR_OR_CONST DWORD_ DNS_ERROR_INVALID_KEY_SIZE_ = 9106;
-BOOST_CONSTEXPR_OR_CONST DWORD_ DNS_ERROR_SIGNING_KEY_NOT_ACCESSIBLE_ = 9107;
-BOOST_CONSTEXPR_OR_CONST DWORD_ DNS_ERROR_KSP_DOES_NOT_SUPPORT_PROTECTION_ = 9108;
-BOOST_CONSTEXPR_OR_CONST DWORD_ DNS_ERROR_UNEXPECTED_DATA_PROTECTION_ERROR_ = 9109;
-BOOST_CONSTEXPR_OR_CONST DWORD_ DNS_ERROR_UNEXPECTED_CNG_ERROR_ = 9110;
-BOOST_CONSTEXPR_OR_CONST DWORD_ DNS_ERROR_UNKNOWN_SIGNING_PARAMETER_VERSION_ = 9111;
-BOOST_CONSTEXPR_OR_CONST DWORD_ DNS_ERROR_KSP_NOT_ACCESSIBLE_ = 9112;
-BOOST_CONSTEXPR_OR_CONST DWORD_ DNS_ERROR_TOO_MANY_SKDS_ = 9113;
-BOOST_CONSTEXPR_OR_CONST DWORD_ DNS_ERROR_INVALID_ROLLOVER_PERIOD_ = 9114;
-BOOST_CONSTEXPR_OR_CONST DWORD_ DNS_ERROR_INVALID_INITIAL_ROLLOVER_OFFSET_ = 9115;
-BOOST_CONSTEXPR_OR_CONST DWORD_ DNS_ERROR_ROLLOVER_IN_PROGRESS_ = 9116;
-BOOST_CONSTEXPR_OR_CONST DWORD_ DNS_ERROR_STANDBY_KEY_NOT_PRESENT_ = 9117;
-BOOST_CONSTEXPR_OR_CONST DWORD_ DNS_ERROR_NOT_ALLOWED_ON_ZSK_ = 9118;
-BOOST_CONSTEXPR_OR_CONST DWORD_ DNS_ERROR_NOT_ALLOWED_ON_ACTIVE_SKD_ = 9119;
-BOOST_CONSTEXPR_OR_CONST DWORD_ DNS_ERROR_ROLLOVER_ALREADY_QUEUED_ = 9120;
-BOOST_CONSTEXPR_OR_CONST DWORD_ DNS_ERROR_NOT_ALLOWED_ON_UNSIGNED_ZONE_ = 9121;
-BOOST_CONSTEXPR_OR_CONST DWORD_ DNS_ERROR_BAD_KEYMASTER_ = 9122;
-BOOST_CONSTEXPR_OR_CONST DWORD_ DNS_ERROR_INVALID_SIGNATURE_VALIDITY_PERIOD_ = 9123;
-BOOST_CONSTEXPR_OR_CONST DWORD_ DNS_ERROR_INVALID_NSEC3_ITERATION_COUNT_ = 9124;
-BOOST_CONSTEXPR_OR_CONST DWORD_ DNS_ERROR_DNSSEC_IS_DISABLED_ = 9125;
-BOOST_CONSTEXPR_OR_CONST DWORD_ DNS_ERROR_INVALID_XML_ = 9126;
-BOOST_CONSTEXPR_OR_CONST DWORD_ DNS_ERROR_NO_VALID_TRUST_ANCHORS_ = 9127;
-BOOST_CONSTEXPR_OR_CONST DWORD_ DNS_ERROR_ROLLOVER_NOT_POKEABLE_ = 9128;
-BOOST_CONSTEXPR_OR_CONST DWORD_ DNS_ERROR_NSEC3_NAME_COLLISION_ = 9129;
-BOOST_CONSTEXPR_OR_CONST DWORD_ DNS_ERROR_NSEC_INCOMPATIBLE_WITH_NSEC3_RSA_SHA1_ = 9130;
-BOOST_CONSTEXPR_OR_CONST DWORD_ DNS_ERROR_PACKET_FMT_BASE_ = 9500;
-BOOST_CONSTEXPR_OR_CONST DWORD_ DNS_INFO_NO_RECORDS_ = 9501;
-BOOST_CONSTEXPR_OR_CONST DWORD_ DNS_ERROR_BAD_PACKET_ = 9502;
-BOOST_CONSTEXPR_OR_CONST DWORD_ DNS_ERROR_NO_PACKET_ = 9503;
-BOOST_CONSTEXPR_OR_CONST DWORD_ DNS_ERROR_RCODE_ = 9504;
-BOOST_CONSTEXPR_OR_CONST DWORD_ DNS_ERROR_UNSECURE_PACKET_ = 9505;
-BOOST_CONSTEXPR_OR_CONST DWORD_ DNS_STATUS_PACKET_UNSECURE_ = DNS_ERROR_UNSECURE_PACKET_;
-BOOST_CONSTEXPR_OR_CONST DWORD_ DNS_REQUEST_PENDING_ = 9506;
-BOOST_CONSTEXPR_OR_CONST DWORD_ DNS_ERROR_NO_MEMORY_ = ERROR_OUTOFMEMORY_;
-BOOST_CONSTEXPR_OR_CONST DWORD_ DNS_ERROR_INVALID_NAME_ = ERROR_INVALID_NAME_;
-BOOST_CONSTEXPR_OR_CONST DWORD_ DNS_ERROR_INVALID_DATA_ = ERROR_INVALID_DATA_;
-BOOST_CONSTEXPR_OR_CONST DWORD_ DNS_ERROR_GENERAL_API_BASE_ = 9550;
-BOOST_CONSTEXPR_OR_CONST DWORD_ DNS_ERROR_INVALID_TYPE_ = 9551;
-BOOST_CONSTEXPR_OR_CONST DWORD_ DNS_ERROR_INVALID_IP_ADDRESS_ = 9552;
-BOOST_CONSTEXPR_OR_CONST DWORD_ DNS_ERROR_INVALID_PROPERTY_ = 9553;
-BOOST_CONSTEXPR_OR_CONST DWORD_ DNS_ERROR_TRY_AGAIN_LATER_ = 9554;
-BOOST_CONSTEXPR_OR_CONST DWORD_ DNS_ERROR_NOT_UNIQUE_ = 9555;
-BOOST_CONSTEXPR_OR_CONST DWORD_ DNS_ERROR_NON_RFC_NAME_ = 9556;
-BOOST_CONSTEXPR_OR_CONST DWORD_ DNS_STATUS_FQDN_ = 9557;
-BOOST_CONSTEXPR_OR_CONST DWORD_ DNS_STATUS_DOTTED_NAME_ = 9558;
-BOOST_CONSTEXPR_OR_CONST DWORD_ DNS_STATUS_SINGLE_PART_NAME_ = 9559;
-BOOST_CONSTEXPR_OR_CONST DWORD_ DNS_ERROR_INVALID_NAME_CHAR_ = 9560;
-BOOST_CONSTEXPR_OR_CONST DWORD_ DNS_ERROR_NUMERIC_NAME_ = 9561;
-BOOST_CONSTEXPR_OR_CONST DWORD_ DNS_ERROR_NOT_ALLOWED_ON_ROOT_SERVER_ = 9562;
-BOOST_CONSTEXPR_OR_CONST DWORD_ DNS_ERROR_NOT_ALLOWED_UNDER_DELEGATION_ = 9563;
-BOOST_CONSTEXPR_OR_CONST DWORD_ DNS_ERROR_CANNOT_FIND_ROOT_HINTS_ = 9564;
-BOOST_CONSTEXPR_OR_CONST DWORD_ DNS_ERROR_INCONSISTENT_ROOT_HINTS_ = 9565;
-BOOST_CONSTEXPR_OR_CONST DWORD_ DNS_ERROR_DWORD_VALUE_TOO_SMALL_ = 9566;
-BOOST_CONSTEXPR_OR_CONST DWORD_ DNS_ERROR_DWORD_VALUE_TOO_LARGE_ = 9567;
-BOOST_CONSTEXPR_OR_CONST DWORD_ DNS_ERROR_BACKGROUND_LOADING_ = 9568;
-BOOST_CONSTEXPR_OR_CONST DWORD_ DNS_ERROR_NOT_ALLOWED_ON_RODC_ = 9569;
-BOOST_CONSTEXPR_OR_CONST DWORD_ DNS_ERROR_NOT_ALLOWED_UNDER_DNAME_ = 9570;
-BOOST_CONSTEXPR_OR_CONST DWORD_ DNS_ERROR_DELEGATION_REQUIRED_ = 9571;
-BOOST_CONSTEXPR_OR_CONST DWORD_ DNS_ERROR_INVALID_POLICY_TABLE_ = 9572;
-BOOST_CONSTEXPR_OR_CONST DWORD_ DNS_ERROR_ADDRESS_REQUIRED_ = 9573;
-BOOST_CONSTEXPR_OR_CONST DWORD_ DNS_ERROR_ZONE_BASE_ = 9600;
-BOOST_CONSTEXPR_OR_CONST DWORD_ DNS_ERROR_ZONE_DOES_NOT_EXIST_ = 9601;
-BOOST_CONSTEXPR_OR_CONST DWORD_ DNS_ERROR_NO_ZONE_INFO_ = 9602;
-BOOST_CONSTEXPR_OR_CONST DWORD_ DNS_ERROR_INVALID_ZONE_OPERATION_ = 9603;
-BOOST_CONSTEXPR_OR_CONST DWORD_ DNS_ERROR_ZONE_CONFIGURATION_ERROR_ = 9604;
-BOOST_CONSTEXPR_OR_CONST DWORD_ DNS_ERROR_ZONE_HAS_NO_SOA_RECORD_ = 9605;
-BOOST_CONSTEXPR_OR_CONST DWORD_ DNS_ERROR_ZONE_HAS_NO_NS_RECORDS_ = 9606;
-BOOST_CONSTEXPR_OR_CONST DWORD_ DNS_ERROR_ZONE_LOCKED_ = 9607;
-BOOST_CONSTEXPR_OR_CONST DWORD_ DNS_ERROR_ZONE_CREATION_FAILED_ = 9608;
-BOOST_CONSTEXPR_OR_CONST DWORD_ DNS_ERROR_ZONE_ALREADY_EXISTS_ = 9609;
-BOOST_CONSTEXPR_OR_CONST DWORD_ DNS_ERROR_AUTOZONE_ALREADY_EXISTS_ = 9610;
-BOOST_CONSTEXPR_OR_CONST DWORD_ DNS_ERROR_INVALID_ZONE_TYPE_ = 9611;
-BOOST_CONSTEXPR_OR_CONST DWORD_ DNS_ERROR_SECONDARY_REQUIRES_MASTER_IP_ = 9612;
-BOOST_CONSTEXPR_OR_CONST DWORD_ DNS_ERROR_ZONE_NOT_SECONDARY_ = 9613;
-BOOST_CONSTEXPR_OR_CONST DWORD_ DNS_ERROR_NEED_SECONDARY_ADDRESSES_ = 9614;
-BOOST_CONSTEXPR_OR_CONST DWORD_ DNS_ERROR_WINS_INIT_FAILED_ = 9615;
-BOOST_CONSTEXPR_OR_CONST DWORD_ DNS_ERROR_NEED_WINS_SERVERS_ = 9616;
-BOOST_CONSTEXPR_OR_CONST DWORD_ DNS_ERROR_NBSTAT_INIT_FAILED_ = 9617;
-BOOST_CONSTEXPR_OR_CONST DWORD_ DNS_ERROR_SOA_DELETE_INVALID_ = 9618;
-BOOST_CONSTEXPR_OR_CONST DWORD_ DNS_ERROR_FORWARDER_ALREADY_EXISTS_ = 9619;
-BOOST_CONSTEXPR_OR_CONST DWORD_ DNS_ERROR_ZONE_REQUIRES_MASTER_IP_ = 9620;
-BOOST_CONSTEXPR_OR_CONST DWORD_ DNS_ERROR_ZONE_IS_SHUTDOWN_ = 9621;
-BOOST_CONSTEXPR_OR_CONST DWORD_ DNS_ERROR_ZONE_LOCKED_FOR_SIGNING_ = 9622;
-BOOST_CONSTEXPR_OR_CONST DWORD_ DNS_ERROR_DATAFILE_BASE_ = 9650;
-BOOST_CONSTEXPR_OR_CONST DWORD_ DNS_ERROR_PRIMARY_REQUIRES_DATAFILE_ = 9651;
-BOOST_CONSTEXPR_OR_CONST DWORD_ DNS_ERROR_INVALID_DATAFILE_NAME_ = 9652;
-BOOST_CONSTEXPR_OR_CONST DWORD_ DNS_ERROR_DATAFILE_OPEN_FAILURE_ = 9653;
-BOOST_CONSTEXPR_OR_CONST DWORD_ DNS_ERROR_FILE_WRITEBACK_FAILED_ = 9654;
-BOOST_CONSTEXPR_OR_CONST DWORD_ DNS_ERROR_DATAFILE_PARSING_ = 9655;
-BOOST_CONSTEXPR_OR_CONST DWORD_ DNS_ERROR_DATABASE_BASE_ = 9700;
-BOOST_CONSTEXPR_OR_CONST DWORD_ DNS_ERROR_RECORD_DOES_NOT_EXIST_ = 9701;
-BOOST_CONSTEXPR_OR_CONST DWORD_ DNS_ERROR_RECORD_FORMAT_ = 9702;
-BOOST_CONSTEXPR_OR_CONST DWORD_ DNS_ERROR_NODE_CREATION_FAILED_ = 9703;
-BOOST_CONSTEXPR_OR_CONST DWORD_ DNS_ERROR_UNKNOWN_RECORD_TYPE_ = 9704;
-BOOST_CONSTEXPR_OR_CONST DWORD_ DNS_ERROR_RECORD_TIMED_OUT_ = 9705;
-BOOST_CONSTEXPR_OR_CONST DWORD_ DNS_ERROR_NAME_NOT_IN_ZONE_ = 9706;
-BOOST_CONSTEXPR_OR_CONST DWORD_ DNS_ERROR_CNAME_LOOP_ = 9707;
-BOOST_CONSTEXPR_OR_CONST DWORD_ DNS_ERROR_NODE_IS_CNAME_ = 9708;
-BOOST_CONSTEXPR_OR_CONST DWORD_ DNS_ERROR_CNAME_COLLISION_ = 9709;
-BOOST_CONSTEXPR_OR_CONST DWORD_ DNS_ERROR_RECORD_ONLY_AT_ZONE_ROOT_ = 9710;
-BOOST_CONSTEXPR_OR_CONST DWORD_ DNS_ERROR_RECORD_ALREADY_EXISTS_ = 9711;
-BOOST_CONSTEXPR_OR_CONST DWORD_ DNS_ERROR_SECONDARY_DATA_ = 9712;
-BOOST_CONSTEXPR_OR_CONST DWORD_ DNS_ERROR_NO_CREATE_CACHE_DATA_ = 9713;
-BOOST_CONSTEXPR_OR_CONST DWORD_ DNS_ERROR_NAME_DOES_NOT_EXIST_ = 9714;
-BOOST_CONSTEXPR_OR_CONST DWORD_ DNS_WARNING_PTR_CREATE_FAILED_ = 9715;
-BOOST_CONSTEXPR_OR_CONST DWORD_ DNS_WARNING_DOMAIN_UNDELETED_ = 9716;
-BOOST_CONSTEXPR_OR_CONST DWORD_ DNS_ERROR_DS_UNAVAILABLE_ = 9717;
-BOOST_CONSTEXPR_OR_CONST DWORD_ DNS_ERROR_DS_ZONE_ALREADY_EXISTS_ = 9718;
-BOOST_CONSTEXPR_OR_CONST DWORD_ DNS_ERROR_NO_BOOTFILE_IF_DS_ZONE_ = 9719;
-BOOST_CONSTEXPR_OR_CONST DWORD_ DNS_ERROR_NODE_IS_DNAME_ = 9720;
-BOOST_CONSTEXPR_OR_CONST DWORD_ DNS_ERROR_DNAME_COLLISION_ = 9721;
-BOOST_CONSTEXPR_OR_CONST DWORD_ DNS_ERROR_ALIAS_LOOP_ = 9722;
-BOOST_CONSTEXPR_OR_CONST DWORD_ DNS_ERROR_OPERATION_BASE_ = 9750;
-BOOST_CONSTEXPR_OR_CONST DWORD_ DNS_INFO_AXFR_COMPLETE_ = 9751;
-BOOST_CONSTEXPR_OR_CONST DWORD_ DNS_ERROR_AXFR_ = 9752;
-BOOST_CONSTEXPR_OR_CONST DWORD_ DNS_INFO_ADDED_LOCAL_WINS_ = 9753;
-BOOST_CONSTEXPR_OR_CONST DWORD_ DNS_ERROR_SECURE_BASE_ = 9800;
-BOOST_CONSTEXPR_OR_CONST DWORD_ DNS_STATUS_CONTINUE_NEEDED_ = 9801;
-BOOST_CONSTEXPR_OR_CONST DWORD_ DNS_ERROR_SETUP_BASE_ = 9850;
-BOOST_CONSTEXPR_OR_CONST DWORD_ DNS_ERROR_NO_TCPIP_ = 9851;
-BOOST_CONSTEXPR_OR_CONST DWORD_ DNS_ERROR_NO_DNS_SERVERS_ = 9852;
-BOOST_CONSTEXPR_OR_CONST DWORD_ DNS_ERROR_DP_BASE_ = 9900;
-BOOST_CONSTEXPR_OR_CONST DWORD_ DNS_ERROR_DP_DOES_NOT_EXIST_ = 9901;
-BOOST_CONSTEXPR_OR_CONST DWORD_ DNS_ERROR_DP_ALREADY_EXISTS_ = 9902;
-BOOST_CONSTEXPR_OR_CONST DWORD_ DNS_ERROR_DP_NOT_ENLISTED_ = 9903;
-BOOST_CONSTEXPR_OR_CONST DWORD_ DNS_ERROR_DP_ALREADY_ENLISTED_ = 9904;
-BOOST_CONSTEXPR_OR_CONST DWORD_ DNS_ERROR_DP_NOT_AVAILABLE_ = 9905;
-BOOST_CONSTEXPR_OR_CONST DWORD_ DNS_ERROR_DP_FSMO_ERROR_ = 9906;
-BOOST_CONSTEXPR_OR_CONST DWORD_ DNS_ERROR_RRL_NOT_ENABLED_ = 9911;
-BOOST_CONSTEXPR_OR_CONST DWORD_ DNS_ERROR_RRL_INVALID_WINDOW_SIZE_ = 9912;
-BOOST_CONSTEXPR_OR_CONST DWORD_ DNS_ERROR_RRL_INVALID_IPV4_PREFIX_ = 9913;
-BOOST_CONSTEXPR_OR_CONST DWORD_ DNS_ERROR_RRL_INVALID_IPV6_PREFIX_ = 9914;
-BOOST_CONSTEXPR_OR_CONST DWORD_ DNS_ERROR_RRL_INVALID_TC_RATE_ = 9915;
-BOOST_CONSTEXPR_OR_CONST DWORD_ DNS_ERROR_RRL_INVALID_LEAK_RATE_ = 9916;
-BOOST_CONSTEXPR_OR_CONST DWORD_ DNS_ERROR_RRL_LEAK_RATE_LESSTHAN_TC_RATE_ = 9917;
-BOOST_CONSTEXPR_OR_CONST DWORD_ DNS_ERROR_VIRTUALIZATION_INSTANCE_ALREADY_EXISTS_ = 9921;
-BOOST_CONSTEXPR_OR_CONST DWORD_ DNS_ERROR_VIRTUALIZATION_INSTANCE_DOES_NOT_EXIST_ = 9922;
-BOOST_CONSTEXPR_OR_CONST DWORD_ DNS_ERROR_VIRTUALIZATION_TREE_LOCKED_ = 9923;
-BOOST_CONSTEXPR_OR_CONST DWORD_ DNS_ERROR_INVAILD_VIRTUALIZATION_INSTANCE_NAME_ = 9924;
-BOOST_CONSTEXPR_OR_CONST DWORD_ DNS_ERROR_DEFAULT_VIRTUALIZATION_INSTANCE_ = 9925;
-BOOST_CONSTEXPR_OR_CONST DWORD_ DNS_ERROR_ZONESCOPE_ALREADY_EXISTS_ = 9951;
-BOOST_CONSTEXPR_OR_CONST DWORD_ DNS_ERROR_ZONESCOPE_DOES_NOT_EXIST_ = 9952;
-BOOST_CONSTEXPR_OR_CONST DWORD_ DNS_ERROR_DEFAULT_ZONESCOPE_ = 9953;
-BOOST_CONSTEXPR_OR_CONST DWORD_ DNS_ERROR_INVALID_ZONESCOPE_NAME_ = 9954;
-BOOST_CONSTEXPR_OR_CONST DWORD_ DNS_ERROR_NOT_ALLOWED_WITH_ZONESCOPES_ = 9955;
-BOOST_CONSTEXPR_OR_CONST DWORD_ DNS_ERROR_LOAD_ZONESCOPE_FAILED_ = 9956;
-BOOST_CONSTEXPR_OR_CONST DWORD_ DNS_ERROR_ZONESCOPE_FILE_WRITEBACK_FAILED_ = 9957;
-BOOST_CONSTEXPR_OR_CONST DWORD_ DNS_ERROR_INVALID_SCOPE_NAME_ = 9958;
-BOOST_CONSTEXPR_OR_CONST DWORD_ DNS_ERROR_SCOPE_DOES_NOT_EXIST_ = 9959;
-BOOST_CONSTEXPR_OR_CONST DWORD_ DNS_ERROR_DEFAULT_SCOPE_ = 9960;
-BOOST_CONSTEXPR_OR_CONST DWORD_ DNS_ERROR_INVALID_SCOPE_OPERATION_ = 9961;
-BOOST_CONSTEXPR_OR_CONST DWORD_ DNS_ERROR_SCOPE_LOCKED_ = 9962;
-BOOST_CONSTEXPR_OR_CONST DWORD_ DNS_ERROR_SCOPE_ALREADY_EXISTS_ = 9963;
-BOOST_CONSTEXPR_OR_CONST DWORD_ DNS_ERROR_POLICY_ALREADY_EXISTS_ = 9971;
-BOOST_CONSTEXPR_OR_CONST DWORD_ DNS_ERROR_POLICY_DOES_NOT_EXIST_ = 9972;
-BOOST_CONSTEXPR_OR_CONST DWORD_ DNS_ERROR_POLICY_INVALID_CRITERIA_ = 9973;
-BOOST_CONSTEXPR_OR_CONST DWORD_ DNS_ERROR_POLICY_INVALID_SETTINGS_ = 9974;
-BOOST_CONSTEXPR_OR_CONST DWORD_ DNS_ERROR_CLIENT_SUBNET_IS_ACCESSED_ = 9975;
-BOOST_CONSTEXPR_OR_CONST DWORD_ DNS_ERROR_CLIENT_SUBNET_DOES_NOT_EXIST_ = 9976;
-BOOST_CONSTEXPR_OR_CONST DWORD_ DNS_ERROR_CLIENT_SUBNET_ALREADY_EXISTS_ = 9977;
-BOOST_CONSTEXPR_OR_CONST DWORD_ DNS_ERROR_SUBNET_DOES_NOT_EXIST_ = 9978;
-BOOST_CONSTEXPR_OR_CONST DWORD_ DNS_ERROR_SUBNET_ALREADY_EXISTS_ = 9979;
-BOOST_CONSTEXPR_OR_CONST DWORD_ DNS_ERROR_POLICY_LOCKED_ = 9980;
-BOOST_CONSTEXPR_OR_CONST DWORD_ DNS_ERROR_POLICY_INVALID_WEIGHT_ = 9981;
-BOOST_CONSTEXPR_OR_CONST DWORD_ DNS_ERROR_POLICY_INVALID_NAME_ = 9982;
-BOOST_CONSTEXPR_OR_CONST DWORD_ DNS_ERROR_POLICY_MISSING_CRITERIA_ = 9983;
-BOOST_CONSTEXPR_OR_CONST DWORD_ DNS_ERROR_INVALID_CLIENT_SUBNET_NAME_ = 9984;
-BOOST_CONSTEXPR_OR_CONST DWORD_ DNS_ERROR_POLICY_PROCESSING_ORDER_INVALID_ = 9985;
-BOOST_CONSTEXPR_OR_CONST DWORD_ DNS_ERROR_POLICY_SCOPE_MISSING_ = 9986;
-BOOST_CONSTEXPR_OR_CONST DWORD_ DNS_ERROR_POLICY_SCOPE_NOT_ALLOWED_ = 9987;
-BOOST_CONSTEXPR_OR_CONST DWORD_ DNS_ERROR_SERVERSCOPE_IS_REFERENCED_ = 9988;
-BOOST_CONSTEXPR_OR_CONST DWORD_ DNS_ERROR_ZONESCOPE_IS_REFERENCED_ = 9989;
-BOOST_CONSTEXPR_OR_CONST DWORD_ DNS_ERROR_POLICY_INVALID_CRITERIA_CLIENT_SUBNET_ = 9990;
-BOOST_CONSTEXPR_OR_CONST DWORD_ DNS_ERROR_POLICY_INVALID_CRITERIA_TRANSPORT_PROTOCOL_ = 9991;
-BOOST_CONSTEXPR_OR_CONST DWORD_ DNS_ERROR_POLICY_INVALID_CRITERIA_NETWORK_PROTOCOL_ = 9992;
-BOOST_CONSTEXPR_OR_CONST DWORD_ DNS_ERROR_POLICY_INVALID_CRITERIA_INTERFACE_ = 9993;
-BOOST_CONSTEXPR_OR_CONST DWORD_ DNS_ERROR_POLICY_INVALID_CRITERIA_FQDN_ = 9994;
-BOOST_CONSTEXPR_OR_CONST DWORD_ DNS_ERROR_POLICY_INVALID_CRITERIA_QUERY_TYPE_ = 9995;
-BOOST_CONSTEXPR_OR_CONST DWORD_ DNS_ERROR_POLICY_INVALID_CRITERIA_TIME_OF_DAY_ = 9996;
-BOOST_CONSTEXPR_OR_CONST DWORD_ WSABASEERR_ = 10000;
-BOOST_CONSTEXPR_OR_CONST DWORD_ WSAEINTR_ = 10004;
-BOOST_CONSTEXPR_OR_CONST DWORD_ WSAEBADF_ = 10009;
-BOOST_CONSTEXPR_OR_CONST DWORD_ WSAEACCES_ = 10013;
-BOOST_CONSTEXPR_OR_CONST DWORD_ WSAEFAULT_ = 10014;
-BOOST_CONSTEXPR_OR_CONST DWORD_ WSAEINVAL_ = 10022;
-BOOST_CONSTEXPR_OR_CONST DWORD_ WSAEMFILE_ = 10024;
-BOOST_CONSTEXPR_OR_CONST DWORD_ WSAEWOULDBLOCK_ = 10035;
-BOOST_CONSTEXPR_OR_CONST DWORD_ WSAEINPROGRESS_ = 10036;
-BOOST_CONSTEXPR_OR_CONST DWORD_ WSAEALREADY_ = 10037;
-BOOST_CONSTEXPR_OR_CONST DWORD_ WSAENOTSOCK_ = 10038;
-BOOST_CONSTEXPR_OR_CONST DWORD_ WSAEDESTADDRREQ_ = 10039;
-BOOST_CONSTEXPR_OR_CONST DWORD_ WSAEMSGSIZE_ = 10040;
-BOOST_CONSTEXPR_OR_CONST DWORD_ WSAEPROTOTYPE_ = 10041;
-BOOST_CONSTEXPR_OR_CONST DWORD_ WSAENOPROTOOPT_ = 10042;
-BOOST_CONSTEXPR_OR_CONST DWORD_ WSAEPROTONOSUPPORT_ = 10043;
-BOOST_CONSTEXPR_OR_CONST DWORD_ WSAESOCKTNOSUPPORT_ = 10044;
-BOOST_CONSTEXPR_OR_CONST DWORD_ WSAEOPNOTSUPP_ = 10045;
-BOOST_CONSTEXPR_OR_CONST DWORD_ WSAEPFNOSUPPORT_ = 10046;
-BOOST_CONSTEXPR_OR_CONST DWORD_ WSAEAFNOSUPPORT_ = 10047;
-BOOST_CONSTEXPR_OR_CONST DWORD_ WSAEADDRINUSE_ = 10048;
-BOOST_CONSTEXPR_OR_CONST DWORD_ WSAEADDRNOTAVAIL_ = 10049;
-BOOST_CONSTEXPR_OR_CONST DWORD_ WSAENETDOWN_ = 10050;
-BOOST_CONSTEXPR_OR_CONST DWORD_ WSAENETUNREACH_ = 10051;
-BOOST_CONSTEXPR_OR_CONST DWORD_ WSAENETRESET_ = 10052;
-BOOST_CONSTEXPR_OR_CONST DWORD_ WSAECONNABORTED_ = 10053;
-BOOST_CONSTEXPR_OR_CONST DWORD_ WSAECONNRESET_ = 10054;
-BOOST_CONSTEXPR_OR_CONST DWORD_ WSAENOBUFS_ = 10055;
-BOOST_CONSTEXPR_OR_CONST DWORD_ WSAEISCONN_ = 10056;
-BOOST_CONSTEXPR_OR_CONST DWORD_ WSAENOTCONN_ = 10057;
-BOOST_CONSTEXPR_OR_CONST DWORD_ WSAESHUTDOWN_ = 10058;
-BOOST_CONSTEXPR_OR_CONST DWORD_ WSAETOOMANYREFS_ = 10059;
-BOOST_CONSTEXPR_OR_CONST DWORD_ WSAETIMEDOUT_ = 10060;
-BOOST_CONSTEXPR_OR_CONST DWORD_ WSAECONNREFUSED_ = 10061;
-BOOST_CONSTEXPR_OR_CONST DWORD_ WSAELOOP_ = 10062;
-BOOST_CONSTEXPR_OR_CONST DWORD_ WSAENAMETOOLONG_ = 10063;
-BOOST_CONSTEXPR_OR_CONST DWORD_ WSAEHOSTDOWN_ = 10064;
-BOOST_CONSTEXPR_OR_CONST DWORD_ WSAEHOSTUNREACH_ = 10065;
-BOOST_CONSTEXPR_OR_CONST DWORD_ WSAENOTEMPTY_ = 10066;
-BOOST_CONSTEXPR_OR_CONST DWORD_ WSAEPROCLIM_ = 10067;
-BOOST_CONSTEXPR_OR_CONST DWORD_ WSAEUSERS_ = 10068;
-BOOST_CONSTEXPR_OR_CONST DWORD_ WSAEDQUOT_ = 10069;
-BOOST_CONSTEXPR_OR_CONST DWORD_ WSAESTALE_ = 10070;
-BOOST_CONSTEXPR_OR_CONST DWORD_ WSAEREMOTE_ = 10071;
-BOOST_CONSTEXPR_OR_CONST DWORD_ WSASYSNOTREADY_ = 10091;
-BOOST_CONSTEXPR_OR_CONST DWORD_ WSAVERNOTSUPPORTED_ = 10092;
-BOOST_CONSTEXPR_OR_CONST DWORD_ WSANOTINITIALISED_ = 10093;
-BOOST_CONSTEXPR_OR_CONST DWORD_ WSAEDISCON_ = 10101;
-BOOST_CONSTEXPR_OR_CONST DWORD_ WSAENOMORE_ = 10102;
-BOOST_CONSTEXPR_OR_CONST DWORD_ WSAECANCELLED_ = 10103;
-BOOST_CONSTEXPR_OR_CONST DWORD_ WSAEINVALIDPROCTABLE_ = 10104;
-BOOST_CONSTEXPR_OR_CONST DWORD_ WSAEINVALIDPROVIDER_ = 10105;
-BOOST_CONSTEXPR_OR_CONST DWORD_ WSAEPROVIDERFAILEDINIT_ = 10106;
-BOOST_CONSTEXPR_OR_CONST DWORD_ WSASYSCALLFAILURE_ = 10107;
-BOOST_CONSTEXPR_OR_CONST DWORD_ WSASERVICE_NOT_FOUND_ = 10108;
-BOOST_CONSTEXPR_OR_CONST DWORD_ WSATYPE_NOT_FOUND_ = 10109;
-BOOST_CONSTEXPR_OR_CONST DWORD_ WSA_E_NO_MORE_ = 10110;
-BOOST_CONSTEXPR_OR_CONST DWORD_ WSA_E_CANCELLED_ = 10111;
-BOOST_CONSTEXPR_OR_CONST DWORD_ WSAEREFUSED_ = 10112;
-BOOST_CONSTEXPR_OR_CONST DWORD_ WSAHOST_NOT_FOUND_ = 11001;
-BOOST_CONSTEXPR_OR_CONST DWORD_ WSATRY_AGAIN_ = 11002;
-BOOST_CONSTEXPR_OR_CONST DWORD_ WSANO_RECOVERY_ = 11003;
-BOOST_CONSTEXPR_OR_CONST DWORD_ WSANO_DATA_ = 11004;
-BOOST_CONSTEXPR_OR_CONST DWORD_ WSA_QOS_RECEIVERS_ = 11005;
-BOOST_CONSTEXPR_OR_CONST DWORD_ WSA_QOS_SENDERS_ = 11006;
-BOOST_CONSTEXPR_OR_CONST DWORD_ WSA_QOS_NO_SENDERS_ = 11007;
-BOOST_CONSTEXPR_OR_CONST DWORD_ WSA_QOS_NO_RECEIVERS_ = 11008;
-BOOST_CONSTEXPR_OR_CONST DWORD_ WSA_QOS_REQUEST_CONFIRMED_ = 11009;
-BOOST_CONSTEXPR_OR_CONST DWORD_ WSA_QOS_ADMISSION_FAILURE_ = 11010;
-BOOST_CONSTEXPR_OR_CONST DWORD_ WSA_QOS_POLICY_FAILURE_ = 11011;
-BOOST_CONSTEXPR_OR_CONST DWORD_ WSA_QOS_BAD_STYLE_ = 11012;
-BOOST_CONSTEXPR_OR_CONST DWORD_ WSA_QOS_BAD_OBJECT_ = 11013;
-BOOST_CONSTEXPR_OR_CONST DWORD_ WSA_QOS_TRAFFIC_CTRL_ERROR_ = 11014;
-BOOST_CONSTEXPR_OR_CONST DWORD_ WSA_QOS_GENERIC_ERROR_ = 11015;
-BOOST_CONSTEXPR_OR_CONST DWORD_ WSA_QOS_ESERVICETYPE_ = 11016;
-BOOST_CONSTEXPR_OR_CONST DWORD_ WSA_QOS_EFLOWSPEC_ = 11017;
-BOOST_CONSTEXPR_OR_CONST DWORD_ WSA_QOS_EPROVSPECBUF_ = 11018;
-BOOST_CONSTEXPR_OR_CONST DWORD_ WSA_QOS_EFILTERSTYLE_ = 11019;
-BOOST_CONSTEXPR_OR_CONST DWORD_ WSA_QOS_EFILTERTYPE_ = 11020;
-BOOST_CONSTEXPR_OR_CONST DWORD_ WSA_QOS_EFILTERCOUNT_ = 11021;
-BOOST_CONSTEXPR_OR_CONST DWORD_ WSA_QOS_EOBJLENGTH_ = 11022;
-BOOST_CONSTEXPR_OR_CONST DWORD_ WSA_QOS_EFLOWCOUNT_ = 11023;
-BOOST_CONSTEXPR_OR_CONST DWORD_ WSA_QOS_EUNKOWNPSOBJ_ = 11024;
-BOOST_CONSTEXPR_OR_CONST DWORD_ WSA_QOS_EPOLICYOBJ_ = 11025;
-BOOST_CONSTEXPR_OR_CONST DWORD_ WSA_QOS_EFLOWDESC_ = 11026;
-BOOST_CONSTEXPR_OR_CONST DWORD_ WSA_QOS_EPSFLOWSPEC_ = 11027;
-BOOST_CONSTEXPR_OR_CONST DWORD_ WSA_QOS_EPSFILTERSPEC_ = 11028;
-BOOST_CONSTEXPR_OR_CONST DWORD_ WSA_QOS_ESDMODEOBJ_ = 11029;
-BOOST_CONSTEXPR_OR_CONST DWORD_ WSA_QOS_ESHAPERATEOBJ_ = 11030;
-BOOST_CONSTEXPR_OR_CONST DWORD_ WSA_QOS_RESERVED_PETYPE_ = 11031;
-BOOST_CONSTEXPR_OR_CONST DWORD_ WSA_SECURE_HOST_NOT_FOUND_ = 11032;
-BOOST_CONSTEXPR_OR_CONST DWORD_ WSA_IPSEC_NAME_POLICY_ERROR_ = 11033;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_IPSEC_QM_POLICY_EXISTS_ = 13000;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_IPSEC_QM_POLICY_NOT_FOUND_ = 13001;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_IPSEC_QM_POLICY_IN_USE_ = 13002;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_IPSEC_MM_POLICY_EXISTS_ = 13003;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_IPSEC_MM_POLICY_NOT_FOUND_ = 13004;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_IPSEC_MM_POLICY_IN_USE_ = 13005;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_IPSEC_MM_FILTER_EXISTS_ = 13006;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_IPSEC_MM_FILTER_NOT_FOUND_ = 13007;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_IPSEC_TRANSPORT_FILTER_EXISTS_ = 13008;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_IPSEC_TRANSPORT_FILTER_NOT_FOUND_ = 13009;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_IPSEC_MM_AUTH_EXISTS_ = 13010;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_IPSEC_MM_AUTH_NOT_FOUND_ = 13011;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_IPSEC_MM_AUTH_IN_USE_ = 13012;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_IPSEC_DEFAULT_MM_POLICY_NOT_FOUND_ = 13013;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_IPSEC_DEFAULT_MM_AUTH_NOT_FOUND_ = 13014;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_IPSEC_DEFAULT_QM_POLICY_NOT_FOUND_ = 13015;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_IPSEC_TUNNEL_FILTER_EXISTS_ = 13016;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_IPSEC_TUNNEL_FILTER_NOT_FOUND_ = 13017;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_IPSEC_MM_FILTER_PENDING_DELETION_ = 13018;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_IPSEC_TRANSPORT_FILTER_PENDING_DELETION_ = 13019;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_IPSEC_TUNNEL_FILTER_PENDING_DELETION_ = 13020;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_IPSEC_MM_POLICY_PENDING_DELETION_ = 13021;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_IPSEC_MM_AUTH_PENDING_DELETION_ = 13022;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_IPSEC_QM_POLICY_PENDING_DELETION_ = 13023;
-BOOST_CONSTEXPR_OR_CONST DWORD_ WARNING_IPSEC_MM_POLICY_PRUNED_ = 13024;
-BOOST_CONSTEXPR_OR_CONST DWORD_ WARNING_IPSEC_QM_POLICY_PRUNED_ = 13025;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_IPSEC_IKE_NEG_STATUS_BEGIN_ = 13800;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_IPSEC_IKE_AUTH_FAIL_ = 13801;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_IPSEC_IKE_ATTRIB_FAIL_ = 13802;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_IPSEC_IKE_NEGOTIATION_PENDING_ = 13803;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_IPSEC_IKE_GENERAL_PROCESSING_ERROR_ = 13804;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_IPSEC_IKE_TIMED_OUT_ = 13805;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_IPSEC_IKE_NO_CERT_ = 13806;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_IPSEC_IKE_SA_DELETED_ = 13807;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_IPSEC_IKE_SA_REAPED_ = 13808;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_IPSEC_IKE_MM_ACQUIRE_DROP_ = 13809;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_IPSEC_IKE_QM_ACQUIRE_DROP_ = 13810;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_IPSEC_IKE_QUEUE_DROP_MM_ = 13811;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_IPSEC_IKE_QUEUE_DROP_NO_MM_ = 13812;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_IPSEC_IKE_DROP_NO_RESPONSE_ = 13813;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_IPSEC_IKE_MM_DELAY_DROP_ = 13814;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_IPSEC_IKE_QM_DELAY_DROP_ = 13815;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_IPSEC_IKE_ERROR_ = 13816;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_IPSEC_IKE_CRL_FAILED_ = 13817;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_IPSEC_IKE_INVALID_KEY_USAGE_ = 13818;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_IPSEC_IKE_INVALID_CERT_TYPE_ = 13819;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_IPSEC_IKE_NO_PRIVATE_KEY_ = 13820;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_IPSEC_IKE_SIMULTANEOUS_REKEY_ = 13821;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_IPSEC_IKE_DH_FAIL_ = 13822;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_IPSEC_IKE_CRITICAL_PAYLOAD_NOT_RECOGNIZED_ = 13823;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_IPSEC_IKE_INVALID_HEADER_ = 13824;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_IPSEC_IKE_NO_POLICY_ = 13825;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_IPSEC_IKE_INVALID_SIGNATURE_ = 13826;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_IPSEC_IKE_KERBEROS_ERROR_ = 13827;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_IPSEC_IKE_NO_PUBLIC_KEY_ = 13828;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_IPSEC_IKE_PROCESS_ERR_ = 13829;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_IPSEC_IKE_PROCESS_ERR_SA_ = 13830;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_IPSEC_IKE_PROCESS_ERR_PROP_ = 13831;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_IPSEC_IKE_PROCESS_ERR_TRANS_ = 13832;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_IPSEC_IKE_PROCESS_ERR_KE_ = 13833;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_IPSEC_IKE_PROCESS_ERR_ID_ = 13834;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_IPSEC_IKE_PROCESS_ERR_CERT_ = 13835;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_IPSEC_IKE_PROCESS_ERR_CERT_REQ_ = 13836;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_IPSEC_IKE_PROCESS_ERR_HASH_ = 13837;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_IPSEC_IKE_PROCESS_ERR_SIG_ = 13838;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_IPSEC_IKE_PROCESS_ERR_NONCE_ = 13839;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_IPSEC_IKE_PROCESS_ERR_NOTIFY_ = 13840;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_IPSEC_IKE_PROCESS_ERR_DELETE_ = 13841;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_IPSEC_IKE_PROCESS_ERR_VENDOR_ = 13842;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_IPSEC_IKE_INVALID_PAYLOAD_ = 13843;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_IPSEC_IKE_LOAD_SOFT_SA_ = 13844;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_IPSEC_IKE_SOFT_SA_TORN_DOWN_ = 13845;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_IPSEC_IKE_INVALID_COOKIE_ = 13846;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_IPSEC_IKE_NO_PEER_CERT_ = 13847;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_IPSEC_IKE_PEER_CRL_FAILED_ = 13848;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_IPSEC_IKE_POLICY_CHANGE_ = 13849;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_IPSEC_IKE_NO_MM_POLICY_ = 13850;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_IPSEC_IKE_NOTCBPRIV_ = 13851;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_IPSEC_IKE_SECLOADFAIL_ = 13852;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_IPSEC_IKE_FAILSSPINIT_ = 13853;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_IPSEC_IKE_FAILQUERYSSP_ = 13854;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_IPSEC_IKE_SRVACQFAIL_ = 13855;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_IPSEC_IKE_SRVQUERYCRED_ = 13856;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_IPSEC_IKE_GETSPIFAIL_ = 13857;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_IPSEC_IKE_INVALID_FILTER_ = 13858;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_IPSEC_IKE_OUT_OF_MEMORY_ = 13859;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_IPSEC_IKE_ADD_UPDATE_KEY_FAILED_ = 13860;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_IPSEC_IKE_INVALID_POLICY_ = 13861;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_IPSEC_IKE_UNKNOWN_DOI_ = 13862;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_IPSEC_IKE_INVALID_SITUATION_ = 13863;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_IPSEC_IKE_DH_FAILURE_ = 13864;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_IPSEC_IKE_INVALID_GROUP_ = 13865;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_IPSEC_IKE_ENCRYPT_ = 13866;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_IPSEC_IKE_DECRYPT_ = 13867;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_IPSEC_IKE_POLICY_MATCH_ = 13868;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_IPSEC_IKE_UNSUPPORTED_ID_ = 13869;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_IPSEC_IKE_INVALID_HASH_ = 13870;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_IPSEC_IKE_INVALID_HASH_ALG_ = 13871;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_IPSEC_IKE_INVALID_HASH_SIZE_ = 13872;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_IPSEC_IKE_INVALID_ENCRYPT_ALG_ = 13873;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_IPSEC_IKE_INVALID_AUTH_ALG_ = 13874;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_IPSEC_IKE_INVALID_SIG_ = 13875;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_IPSEC_IKE_LOAD_FAILED_ = 13876;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_IPSEC_IKE_RPC_DELETE_ = 13877;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_IPSEC_IKE_BENIGN_REINIT_ = 13878;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_IPSEC_IKE_INVALID_RESPONDER_LIFETIME_NOTIFY_ = 13879;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_IPSEC_IKE_INVALID_MAJOR_VERSION_ = 13880;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_IPSEC_IKE_INVALID_CERT_KEYLEN_ = 13881;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_IPSEC_IKE_MM_LIMIT_ = 13882;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_IPSEC_IKE_NEGOTIATION_DISABLED_ = 13883;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_IPSEC_IKE_QM_LIMIT_ = 13884;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_IPSEC_IKE_MM_EXPIRED_ = 13885;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_IPSEC_IKE_PEER_MM_ASSUMED_INVALID_ = 13886;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_IPSEC_IKE_CERT_CHAIN_POLICY_MISMATCH_ = 13887;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_IPSEC_IKE_UNEXPECTED_MESSAGE_ID_ = 13888;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_IPSEC_IKE_INVALID_AUTH_PAYLOAD_ = 13889;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_IPSEC_IKE_DOS_COOKIE_SENT_ = 13890;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_IPSEC_IKE_SHUTTING_DOWN_ = 13891;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_IPSEC_IKE_CGA_AUTH_FAILED_ = 13892;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_IPSEC_IKE_PROCESS_ERR_NATOA_ = 13893;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_IPSEC_IKE_INVALID_MM_FOR_QM_ = 13894;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_IPSEC_IKE_QM_EXPIRED_ = 13895;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_IPSEC_IKE_TOO_MANY_FILTERS_ = 13896;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_IPSEC_IKE_NEG_STATUS_END_ = 13897;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_IPSEC_IKE_KILL_DUMMY_NAP_TUNNEL_ = 13898;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_IPSEC_IKE_INNER_IP_ASSIGNMENT_FAILURE_ = 13899;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_IPSEC_IKE_REQUIRE_CP_PAYLOAD_MISSING_ = 13900;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_IPSEC_KEY_MODULE_IMPERSONATION_NEGOTIATION_PENDING_ = 13901;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_IPSEC_IKE_COEXISTENCE_SUPPRESS_ = 13902;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_IPSEC_IKE_RATELIMIT_DROP_ = 13903;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_IPSEC_IKE_PEER_DOESNT_SUPPORT_MOBIKE_ = 13904;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_IPSEC_IKE_AUTHORIZATION_FAILURE_ = 13905;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_IPSEC_IKE_STRONG_CRED_AUTHORIZATION_FAILURE_ = 13906;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_IPSEC_IKE_AUTHORIZATION_FAILURE_WITH_OPTIONAL_RETRY_ = 13907;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_IPSEC_IKE_STRONG_CRED_AUTHORIZATION_AND_CERTMAP_FAILURE_ = 13908;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_IPSEC_IKE_NEG_STATUS_EXTENDED_END_ = 13909;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_IPSEC_BAD_SPI_ = 13910;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_IPSEC_SA_LIFETIME_EXPIRED_ = 13911;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_IPSEC_WRONG_SA_ = 13912;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_IPSEC_REPLAY_CHECK_FAILED_ = 13913;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_IPSEC_INVALID_PACKET_ = 13914;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_IPSEC_INTEGRITY_CHECK_FAILED_ = 13915;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_IPSEC_CLEAR_TEXT_DROP_ = 13916;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_IPSEC_AUTH_FIREWALL_DROP_ = 13917;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_IPSEC_THROTTLE_DROP_ = 13918;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_IPSEC_DOSP_BLOCK_ = 13925;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_IPSEC_DOSP_RECEIVED_MULTICAST_ = 13926;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_IPSEC_DOSP_INVALID_PACKET_ = 13927;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_IPSEC_DOSP_STATE_LOOKUP_FAILED_ = 13928;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_IPSEC_DOSP_MAX_ENTRIES_ = 13929;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_IPSEC_DOSP_KEYMOD_NOT_ALLOWED_ = 13930;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_IPSEC_DOSP_NOT_INSTALLED_ = 13931;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_IPSEC_DOSP_MAX_PER_IP_RATELIMIT_QUEUES_ = 13932;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_SXS_SECTION_NOT_FOUND_ = 14000;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_SXS_CANT_GEN_ACTCTX_ = 14001;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_SXS_INVALID_ACTCTXDATA_FORMAT_ = 14002;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_SXS_ASSEMBLY_NOT_FOUND_ = 14003;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_SXS_MANIFEST_FORMAT_ERROR_ = 14004;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_SXS_MANIFEST_PARSE_ERROR_ = 14005;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_SXS_ACTIVATION_CONTEXT_DISABLED_ = 14006;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_SXS_KEY_NOT_FOUND_ = 14007;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_SXS_VERSION_CONFLICT_ = 14008;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_SXS_WRONG_SECTION_TYPE_ = 14009;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_SXS_THREAD_QUERIES_DISABLED_ = 14010;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_SXS_PROCESS_DEFAULT_ALREADY_SET_ = 14011;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_SXS_UNKNOWN_ENCODING_GROUP_ = 14012;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_SXS_UNKNOWN_ENCODING_ = 14013;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_SXS_INVALID_XML_NAMESPACE_URI_ = 14014;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_SXS_ROOT_MANIFEST_DEPENDENCY_NOT_INSTALLED_ = 14015;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_SXS_LEAF_MANIFEST_DEPENDENCY_NOT_INSTALLED_ = 14016;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_SXS_INVALID_ASSEMBLY_IDENTITY_ATTRIBUTE_ = 14017;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_SXS_MANIFEST_MISSING_REQUIRED_DEFAULT_NAMESPACE_ = 14018;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_SXS_MANIFEST_INVALID_REQUIRED_DEFAULT_NAMESPACE_ = 14019;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_SXS_PRIVATE_MANIFEST_CROSS_PATH_WITH_REPARSE_POINT_ = 14020;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_SXS_DUPLICATE_DLL_NAME_ = 14021;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_SXS_DUPLICATE_WINDOWCLASS_NAME_ = 14022;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_SXS_DUPLICATE_CLSID_ = 14023;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_SXS_DUPLICATE_IID_ = 14024;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_SXS_DUPLICATE_TLBID_ = 14025;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_SXS_DUPLICATE_PROGID_ = 14026;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_SXS_DUPLICATE_ASSEMBLY_NAME_ = 14027;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_SXS_FILE_HASH_MISMATCH_ = 14028;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_SXS_POLICY_PARSE_ERROR_ = 14029;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_SXS_XML_E_MISSINGQUOTE_ = 14030;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_SXS_XML_E_COMMENTSYNTAX_ = 14031;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_SXS_XML_E_BADSTARTNAMECHAR_ = 14032;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_SXS_XML_E_BADNAMECHAR_ = 14033;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_SXS_XML_E_BADCHARINSTRING_ = 14034;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_SXS_XML_E_XMLDECLSYNTAX_ = 14035;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_SXS_XML_E_BADCHARDATA_ = 14036;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_SXS_XML_E_MISSINGWHITESPACE_ = 14037;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_SXS_XML_E_EXPECTINGTAGEND_ = 14038;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_SXS_XML_E_MISSINGSEMICOLON_ = 14039;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_SXS_XML_E_UNBALANCEDPAREN_ = 14040;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_SXS_XML_E_INTERNALERROR_ = 14041;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_SXS_XML_E_UNEXPECTED_WHITESPACE_ = 14042;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_SXS_XML_E_INCOMPLETE_ENCODING_ = 14043;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_SXS_XML_E_MISSING_PAREN_ = 14044;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_SXS_XML_E_EXPECTINGCLOSEQUOTE_ = 14045;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_SXS_XML_E_MULTIPLE_COLONS_ = 14046;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_SXS_XML_E_INVALID_DECIMAL_ = 14047;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_SXS_XML_E_INVALID_HEXIDECIMAL_ = 14048;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_SXS_XML_E_INVALID_UNICODE_ = 14049;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_SXS_XML_E_WHITESPACEORQUESTIONMARK_ = 14050;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_SXS_XML_E_UNEXPECTEDENDTAG_ = 14051;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_SXS_XML_E_UNCLOSEDTAG_ = 14052;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_SXS_XML_E_DUPLICATEATTRIBUTE_ = 14053;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_SXS_XML_E_MULTIPLEROOTS_ = 14054;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_SXS_XML_E_INVALIDATROOTLEVEL_ = 14055;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_SXS_XML_E_BADXMLDECL_ = 14056;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_SXS_XML_E_MISSINGROOT_ = 14057;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_SXS_XML_E_UNEXPECTEDEOF_ = 14058;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_SXS_XML_E_BADPEREFINSUBSET_ = 14059;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_SXS_XML_E_UNCLOSEDSTARTTAG_ = 14060;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_SXS_XML_E_UNCLOSEDENDTAG_ = 14061;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_SXS_XML_E_UNCLOSEDSTRING_ = 14062;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_SXS_XML_E_UNCLOSEDCOMMENT_ = 14063;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_SXS_XML_E_UNCLOSEDDECL_ = 14064;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_SXS_XML_E_UNCLOSEDCDATA_ = 14065;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_SXS_XML_E_RESERVEDNAMESPACE_ = 14066;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_SXS_XML_E_INVALIDENCODING_ = 14067;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_SXS_XML_E_INVALIDSWITCH_ = 14068;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_SXS_XML_E_BADXMLCASE_ = 14069;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_SXS_XML_E_INVALID_STANDALONE_ = 14070;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_SXS_XML_E_UNEXPECTED_STANDALONE_ = 14071;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_SXS_XML_E_INVALID_VERSION_ = 14072;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_SXS_XML_E_MISSINGEQUALS_ = 14073;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_SXS_PROTECTION_RECOVERY_FAILED_ = 14074;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_SXS_PROTECTION_PUBLIC_KEY_TOO_SHORT_ = 14075;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_SXS_PROTECTION_CATALOG_NOT_VALID_ = 14076;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_SXS_UNTRANSLATABLE_HRESULT_ = 14077;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_SXS_PROTECTION_CATALOG_FILE_MISSING_ = 14078;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_SXS_MISSING_ASSEMBLY_IDENTITY_ATTRIBUTE_ = 14079;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_SXS_INVALID_ASSEMBLY_IDENTITY_ATTRIBUTE_NAME_ = 14080;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_SXS_ASSEMBLY_MISSING_ = 14081;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_SXS_CORRUPT_ACTIVATION_STACK_ = 14082;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_SXS_CORRUPTION_ = 14083;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_SXS_EARLY_DEACTIVATION_ = 14084;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_SXS_INVALID_DEACTIVATION_ = 14085;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_SXS_MULTIPLE_DEACTIVATION_ = 14086;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_SXS_PROCESS_TERMINATION_REQUESTED_ = 14087;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_SXS_RELEASE_ACTIVATION_CONTEXT_ = 14088;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_SXS_SYSTEM_DEFAULT_ACTIVATION_CONTEXT_EMPTY_ = 14089;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_SXS_INVALID_IDENTITY_ATTRIBUTE_VALUE_ = 14090;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_SXS_INVALID_IDENTITY_ATTRIBUTE_NAME_ = 14091;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_SXS_IDENTITY_DUPLICATE_ATTRIBUTE_ = 14092;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_SXS_IDENTITY_PARSE_ERROR_ = 14093;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_MALFORMED_SUBSTITUTION_STRING_ = 14094;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_SXS_INCORRECT_PUBLIC_KEY_TOKEN_ = 14095;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_UNMAPPED_SUBSTITUTION_STRING_ = 14096;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_SXS_ASSEMBLY_NOT_LOCKED_ = 14097;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_SXS_COMPONENT_STORE_CORRUPT_ = 14098;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_ADVANCED_INSTALLER_FAILED_ = 14099;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_XML_ENCODING_MISMATCH_ = 14100;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_SXS_MANIFEST_IDENTITY_SAME_BUT_CONTENTS_DIFFERENT_ = 14101;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_SXS_IDENTITIES_DIFFERENT_ = 14102;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_SXS_ASSEMBLY_IS_NOT_A_DEPLOYMENT_ = 14103;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_SXS_FILE_NOT_PART_OF_ASSEMBLY_ = 14104;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_SXS_MANIFEST_TOO_BIG_ = 14105;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_SXS_SETTING_NOT_REGISTERED_ = 14106;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_SXS_TRANSACTION_CLOSURE_INCOMPLETE_ = 14107;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_SMI_PRIMITIVE_INSTALLER_FAILED_ = 14108;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_GENERIC_COMMAND_FAILED_ = 14109;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_SXS_FILE_HASH_MISSING_ = 14110;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_EVT_INVALID_CHANNEL_PATH_ = 15000;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_EVT_INVALID_QUERY_ = 15001;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_EVT_PUBLISHER_METADATA_NOT_FOUND_ = 15002;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_EVT_EVENT_TEMPLATE_NOT_FOUND_ = 15003;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_EVT_INVALID_PUBLISHER_NAME_ = 15004;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_EVT_INVALID_EVENT_DATA_ = 15005;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_EVT_CHANNEL_NOT_FOUND_ = 15007;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_EVT_MALFORMED_XML_TEXT_ = 15008;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_EVT_SUBSCRIPTION_TO_DIRECT_CHANNEL_ = 15009;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_EVT_CONFIGURATION_ERROR_ = 15010;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_EVT_QUERY_RESULT_STALE_ = 15011;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_EVT_QUERY_RESULT_INVALID_POSITION_ = 15012;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_EVT_NON_VALIDATING_MSXML_ = 15013;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_EVT_FILTER_ALREADYSCOPED_ = 15014;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_EVT_FILTER_NOTELTSET_ = 15015;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_EVT_FILTER_INVARG_ = 15016;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_EVT_FILTER_INVTEST_ = 15017;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_EVT_FILTER_INVTYPE_ = 15018;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_EVT_FILTER_PARSEERR_ = 15019;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_EVT_FILTER_UNSUPPORTEDOP_ = 15020;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_EVT_FILTER_UNEXPECTEDTOKEN_ = 15021;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_EVT_INVALID_OPERATION_OVER_ENABLED_DIRECT_CHANNEL_ = 15022;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_EVT_INVALID_CHANNEL_PROPERTY_VALUE_ = 15023;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_EVT_INVALID_PUBLISHER_PROPERTY_VALUE_ = 15024;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_EVT_CHANNEL_CANNOT_ACTIVATE_ = 15025;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_EVT_FILTER_TOO_COMPLEX_ = 15026;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_EVT_MESSAGE_NOT_FOUND_ = 15027;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_EVT_MESSAGE_ID_NOT_FOUND_ = 15028;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_EVT_UNRESOLVED_VALUE_INSERT_ = 15029;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_EVT_UNRESOLVED_PARAMETER_INSERT_ = 15030;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_EVT_MAX_INSERTS_REACHED_ = 15031;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_EVT_EVENT_DEFINITION_NOT_FOUND_ = 15032;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_EVT_MESSAGE_LOCALE_NOT_FOUND_ = 15033;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_EVT_VERSION_TOO_OLD_ = 15034;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_EVT_VERSION_TOO_NEW_ = 15035;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_EVT_CANNOT_OPEN_CHANNEL_OF_QUERY_ = 15036;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_EVT_PUBLISHER_DISABLED_ = 15037;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_EVT_FILTER_OUT_OF_RANGE_ = 15038;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_EC_SUBSCRIPTION_CANNOT_ACTIVATE_ = 15080;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_EC_LOG_DISABLED_ = 15081;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_EC_CIRCULAR_FORWARDING_ = 15082;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_EC_CREDSTORE_FULL_ = 15083;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_EC_CRED_NOT_FOUND_ = 15084;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_EC_NO_ACTIVE_CHANNEL_ = 15085;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_MUI_FILE_NOT_FOUND_ = 15100;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_MUI_INVALID_FILE_ = 15101;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_MUI_INVALID_RC_CONFIG_ = 15102;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_MUI_INVALID_LOCALE_NAME_ = 15103;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_MUI_INVALID_ULTIMATEFALLBACK_NAME_ = 15104;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_MUI_FILE_NOT_LOADED_ = 15105;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_RESOURCE_ENUM_USER_STOP_ = 15106;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_MUI_INTLSETTINGS_UILANG_NOT_INSTALLED_ = 15107;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_MUI_INTLSETTINGS_INVALID_LOCALE_NAME_ = 15108;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_MRM_RUNTIME_NO_DEFAULT_OR_NEUTRAL_RESOURCE_ = 15110;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_MRM_INVALID_PRICONFIG_ = 15111;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_MRM_INVALID_FILE_TYPE_ = 15112;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_MRM_UNKNOWN_QUALIFIER_ = 15113;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_MRM_INVALID_QUALIFIER_VALUE_ = 15114;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_MRM_NO_CANDIDATE_ = 15115;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_MRM_NO_MATCH_OR_DEFAULT_CANDIDATE_ = 15116;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_MRM_RESOURCE_TYPE_MISMATCH_ = 15117;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_MRM_DUPLICATE_MAP_NAME_ = 15118;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_MRM_DUPLICATE_ENTRY_ = 15119;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_MRM_INVALID_RESOURCE_IDENTIFIER_ = 15120;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_MRM_FILEPATH_TOO_LONG_ = 15121;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_MRM_UNSUPPORTED_DIRECTORY_TYPE_ = 15122;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_MRM_INVALID_PRI_FILE_ = 15126;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_MRM_NAMED_RESOURCE_NOT_FOUND_ = 15127;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_MRM_MAP_NOT_FOUND_ = 15135;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_MRM_UNSUPPORTED_PROFILE_TYPE_ = 15136;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_MRM_INVALID_QUALIFIER_OPERATOR_ = 15137;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_MRM_INDETERMINATE_QUALIFIER_VALUE_ = 15138;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_MRM_AUTOMERGE_ENABLED_ = 15139;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_MRM_TOO_MANY_RESOURCES_ = 15140;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_MRM_UNSUPPORTED_FILE_TYPE_FOR_MERGE_ = 15141;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_MRM_UNSUPPORTED_FILE_TYPE_FOR_LOAD_UNLOAD_PRI_FILE_ = 15142;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_MRM_NO_CURRENT_VIEW_ON_THREAD_ = 15143;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_DIFFERENT_PROFILE_RESOURCE_MANAGER_EXIST_ = 15144;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_OPERATION_NOT_ALLOWED_FROM_SYSTEM_COMPONENT_ = 15145;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_MRM_DIRECT_REF_TO_NON_DEFAULT_RESOURCE_ = 15146;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_MRM_GENERATION_COUNT_MISMATCH_ = 15147;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_PRI_MERGE_VERSION_MISMATCH_ = 15148;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_PRI_MERGE_MISSING_SCHEMA_ = 15149;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_PRI_MERGE_LOAD_FILE_FAILED_ = 15150;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_PRI_MERGE_ADD_FILE_FAILED_ = 15151;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_PRI_MERGE_WRITE_FILE_FAILED_ = 15152;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_PRI_MERGE_MULTIPLE_PACKAGE_FAMILIES_NOT_ALLOWED_ = 15153;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_PRI_MERGE_MULTIPLE_MAIN_PACKAGES_NOT_ALLOWED_ = 15154;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_PRI_MERGE_BUNDLE_PACKAGES_NOT_ALLOWED_ = 15155;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_PRI_MERGE_MAIN_PACKAGE_REQUIRED_ = 15156;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_PRI_MERGE_RESOURCE_PACKAGE_REQUIRED_ = 15157;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_PRI_MERGE_INVALID_FILE_NAME_ = 15158;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_MCA_INVALID_CAPABILITIES_STRING_ = 15200;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_MCA_INVALID_VCP_VERSION_ = 15201;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_MCA_MONITOR_VIOLATES_MCCS_SPECIFICATION_ = 15202;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_MCA_MCCS_VERSION_MISMATCH_ = 15203;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_MCA_UNSUPPORTED_MCCS_VERSION_ = 15204;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_MCA_INTERNAL_ERROR_ = 15205;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_MCA_INVALID_TECHNOLOGY_TYPE_RETURNED_ = 15206;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_MCA_UNSUPPORTED_COLOR_TEMPERATURE_ = 15207;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_AMBIGUOUS_SYSTEM_DEVICE_ = 15250;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_SYSTEM_DEVICE_NOT_FOUND_ = 15299;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_HASH_NOT_SUPPORTED_ = 15300;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_HASH_NOT_PRESENT_ = 15301;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_SECONDARY_IC_PROVIDER_NOT_REGISTERED_ = 15321;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_GPIO_CLIENT_INFORMATION_INVALID_ = 15322;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_GPIO_VERSION_NOT_SUPPORTED_ = 15323;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_GPIO_INVALID_REGISTRATION_PACKET_ = 15324;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_GPIO_OPERATION_DENIED_ = 15325;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_GPIO_INCOMPATIBLE_CONNECT_MODE_ = 15326;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_GPIO_INTERRUPT_ALREADY_UNMASKED_ = 15327;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_CANNOT_SWITCH_RUNLEVEL_ = 15400;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_INVALID_RUNLEVEL_SETTING_ = 15401;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_RUNLEVEL_SWITCH_TIMEOUT_ = 15402;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_RUNLEVEL_SWITCH_AGENT_TIMEOUT_ = 15403;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_RUNLEVEL_SWITCH_IN_PROGRESS_ = 15404;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_SERVICES_FAILED_AUTOSTART_ = 15405;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_COM_TASK_STOP_PENDING_ = 15501;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_INSTALL_OPEN_PACKAGE_FAILED_ = 15600;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_INSTALL_PACKAGE_NOT_FOUND_ = 15601;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_INSTALL_INVALID_PACKAGE_ = 15602;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_INSTALL_RESOLVE_DEPENDENCY_FAILED_ = 15603;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_INSTALL_OUT_OF_DISK_SPACE_ = 15604;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_INSTALL_NETWORK_FAILURE_ = 15605;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_INSTALL_REGISTRATION_FAILURE_ = 15606;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_INSTALL_DEREGISTRATION_FAILURE_ = 15607;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_INSTALL_CANCEL_ = 15608;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_INSTALL_FAILED_ = 15609;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_REMOVE_FAILED_ = 15610;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_PACKAGE_ALREADY_EXISTS_ = 15611;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_NEEDS_REMEDIATION_ = 15612;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_INSTALL_PREREQUISITE_FAILED_ = 15613;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_PACKAGE_REPOSITORY_CORRUPTED_ = 15614;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_INSTALL_POLICY_FAILURE_ = 15615;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_PACKAGE_UPDATING_ = 15616;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_DEPLOYMENT_BLOCKED_BY_POLICY_ = 15617;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_PACKAGES_IN_USE_ = 15618;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_RECOVERY_FILE_CORRUPT_ = 15619;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_INVALID_STAGED_SIGNATURE_ = 15620;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_DELETING_EXISTING_APPLICATIONDATA_STORE_FAILED_ = 15621;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_INSTALL_PACKAGE_DOWNGRADE_ = 15622;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_SYSTEM_NEEDS_REMEDIATION_ = 15623;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_APPX_INTEGRITY_FAILURE_CLR_NGEN_ = 15624;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_RESILIENCY_FILE_CORRUPT_ = 15625;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_INSTALL_FIREWALL_SERVICE_NOT_RUNNING_ = 15626;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_PACKAGE_MOVE_FAILED_ = 15627;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_INSTALL_VOLUME_NOT_EMPTY_ = 15628;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_INSTALL_VOLUME_OFFLINE_ = 15629;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_INSTALL_VOLUME_CORRUPT_ = 15630;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_NEEDS_REGISTRATION_ = 15631;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_INSTALL_WRONG_PROCESSOR_ARCHITECTURE_ = 15632;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_DEV_SIDELOAD_LIMIT_EXCEEDED_ = 15633;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_INSTALL_OPTIONAL_PACKAGE_REQUIRES_MAIN_PACKAGE_ = 15634;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_PACKAGE_NOT_SUPPORTED_ON_FILESYSTEM_ = 15635;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_PACKAGE_MOVE_BLOCKED_BY_STREAMING_ = 15636;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_INSTALL_OPTIONAL_PACKAGE_APPLICATIONID_NOT_UNIQUE_ = 15637;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_PACKAGE_STAGING_ONHOLD_ = 15638;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_INSTALL_INVALID_RELATED_SET_UPDATE_ = 15639;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_INSTALL_OPTIONAL_PACKAGE_REQUIRES_MAIN_PACKAGE_FULLTRUST_CAPABILITY_ = 15640;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_DEPLOYMENT_BLOCKED_BY_USER_LOG_OFF_ = 15641;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_PROVISION_OPTIONAL_PACKAGE_REQUIRES_MAIN_PACKAGE_PROVISIONED_ = 15642;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_PACKAGES_REPUTATION_CHECK_FAILED_ = 15643;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_PACKAGES_REPUTATION_CHECK_TIMEDOUT_ = 15644;
-BOOST_CONSTEXPR_OR_CONST DWORD_ APPMODEL_ERROR_NO_PACKAGE_ = 15700;
-BOOST_CONSTEXPR_OR_CONST DWORD_ APPMODEL_ERROR_PACKAGE_RUNTIME_CORRUPT_ = 15701;
-BOOST_CONSTEXPR_OR_CONST DWORD_ APPMODEL_ERROR_PACKAGE_IDENTITY_CORRUPT_ = 15702;
-BOOST_CONSTEXPR_OR_CONST DWORD_ APPMODEL_ERROR_NO_APPLICATION_ = 15703;
-BOOST_CONSTEXPR_OR_CONST DWORD_ APPMODEL_ERROR_DYNAMIC_PROPERTY_READ_FAILED_ = 15704;
-BOOST_CONSTEXPR_OR_CONST DWORD_ APPMODEL_ERROR_DYNAMIC_PROPERTY_INVALID_ = 15705;
-BOOST_CONSTEXPR_OR_CONST DWORD_ APPMODEL_ERROR_PACKAGE_NOT_AVAILABLE_ = 15706;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_STATE_LOAD_STORE_FAILED_ = 15800;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_STATE_GET_VERSION_FAILED_ = 15801;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_STATE_SET_VERSION_FAILED_ = 15802;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_STATE_STRUCTURED_RESET_FAILED_ = 15803;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_STATE_OPEN_CONTAINER_FAILED_ = 15804;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_STATE_CREATE_CONTAINER_FAILED_ = 15805;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_STATE_DELETE_CONTAINER_FAILED_ = 15806;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_STATE_READ_SETTING_FAILED_ = 15807;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_STATE_WRITE_SETTING_FAILED_ = 15808;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_STATE_DELETE_SETTING_FAILED_ = 15809;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_STATE_QUERY_SETTING_FAILED_ = 15810;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_STATE_READ_COMPOSITE_SETTING_FAILED_ = 15811;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_STATE_WRITE_COMPOSITE_SETTING_FAILED_ = 15812;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_STATE_ENUMERATE_CONTAINER_FAILED_ = 15813;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_STATE_ENUMERATE_SETTINGS_FAILED_ = 15814;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_STATE_COMPOSITE_SETTING_VALUE_SIZE_LIMIT_EXCEEDED_ = 15815;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_STATE_SETTING_VALUE_SIZE_LIMIT_EXCEEDED_ = 15816;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_STATE_SETTING_NAME_SIZE_LIMIT_EXCEEDED_ = 15817;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_STATE_CONTAINER_NAME_SIZE_LIMIT_EXCEEDED_ = 15818;
-BOOST_CONSTEXPR_OR_CONST DWORD_ ERROR_API_UNAVAILABLE_ = 15841;
-BOOST_CONSTEXPR_OR_CONST DWORD_ STORE_ERROR_UNLICENSED_ = 15861;
-BOOST_CONSTEXPR_OR_CONST DWORD_ STORE_ERROR_UNLICENSED_USER_ = 15862;
-BOOST_CONSTEXPR_OR_CONST DWORD_ STORE_ERROR_PENDING_COM_TRANSACTION_ = 15863;
-BOOST_CONSTEXPR_OR_CONST DWORD_ STORE_ERROR_LICENSE_REVOKED_ = 15864;
-
-} // namespace winapi
-} // namespace boost
-
-#include <boost/winapi/detail/footer.hpp>
-
-#endif // BOOST_WINAPI_ERROR_CODES_HPP_INCLUDED_
diff --git a/src/boost/winapi/error_handling.hpp b/src/boost/winapi/error_handling.hpp
deleted file mode 100644
index ee157a65..00000000
--- a/src/boost/winapi/error_handling.hpp
+++ /dev/null
@@ -1,156 +0,0 @@
-/*
- * Copyright 2010 Vicente J. Botet Escriba
- * Copyright 2015 Andrey Semashev
- * Copyright 2016 Jorge Lodos
- *
- * Distributed under the Boost Software License, Version 1.0.
- * See http://www.boost.org/LICENSE_1_0.txt
- */
-
-#ifndef BOOST_WINAPI_ERROR_HANDLING_HPP_INCLUDED_
-#define BOOST_WINAPI_ERROR_HANDLING_HPP_INCLUDED_
-
-#include <stdarg.h>
-#include <boost/winapi/basic_types.hpp>
-#include <boost/winapi/get_last_error.hpp>
-#include <boost/winapi/detail/header.hpp>
-
-#ifdef BOOST_HAS_PRAGMA_ONCE
-#pragma once
-#endif
-
-#if !defined( BOOST_USE_WINDOWS_H )
-extern "C" {
-#if !defined( BOOST_NO_ANSI_APIS )
-BOOST_WINAPI_IMPORT boost::winapi::DWORD_ BOOST_WINAPI_WINAPI_CC
-FormatMessageA(
-    boost::winapi::DWORD_ dwFlags,
-    boost::winapi::LPCVOID_ lpSource,
-    boost::winapi::DWORD_ dwMessageId,
-    boost::winapi::DWORD_ dwLanguageId,
-    boost::winapi::LPSTR_ lpBuffer,
-    boost::winapi::DWORD_ nSize,
-    va_list *Arguments);
-#endif
-
-BOOST_WINAPI_IMPORT_EXCEPT_WM boost::winapi::DWORD_ BOOST_WINAPI_WINAPI_CC
-FormatMessageW(
-    boost::winapi::DWORD_ dwFlags,
-    boost::winapi::LPCVOID_ lpSource,
-    boost::winapi::DWORD_ dwMessageId,
-    boost::winapi::DWORD_ dwLanguageId,
-    boost::winapi::LPWSTR_ lpBuffer,
-    boost::winapi::DWORD_ nSize,
-    va_list *Arguments);
-
-#if BOOST_WINAPI_PARTITION_DESKTOP || BOOST_WINAPI_PARTITION_SYSTEM
-BOOST_WINAPI_IMPORT boost::winapi::UINT_ BOOST_WINAPI_WINAPI_CC
-SetErrorMode(boost::winapi::UINT_ uMode);
-#endif
-} // extern "C"
-#endif
-
-namespace boost {
-namespace winapi {
-
-#if defined( BOOST_USE_WINDOWS_H )
-
-#if BOOST_WINAPI_PARTITION_APP_SYSTEM
-BOOST_CONSTEXPR_OR_CONST DWORD_ FORMAT_MESSAGE_ALLOCATE_BUFFER_= FORMAT_MESSAGE_ALLOCATE_BUFFER;
-#endif
-
-BOOST_CONSTEXPR_OR_CONST DWORD_ FORMAT_MESSAGE_IGNORE_INSERTS_=  FORMAT_MESSAGE_IGNORE_INSERTS;
-BOOST_CONSTEXPR_OR_CONST DWORD_ FORMAT_MESSAGE_FROM_STRING_=     FORMAT_MESSAGE_FROM_STRING;
-BOOST_CONSTEXPR_OR_CONST DWORD_ FORMAT_MESSAGE_FROM_HMODULE_=    FORMAT_MESSAGE_FROM_HMODULE;
-BOOST_CONSTEXPR_OR_CONST DWORD_ FORMAT_MESSAGE_FROM_SYSTEM_=     FORMAT_MESSAGE_FROM_SYSTEM;
-BOOST_CONSTEXPR_OR_CONST DWORD_ FORMAT_MESSAGE_ARGUMENT_ARRAY_=  FORMAT_MESSAGE_ARGUMENT_ARRAY;
-BOOST_CONSTEXPR_OR_CONST DWORD_ FORMAT_MESSAGE_MAX_WIDTH_MASK_=  FORMAT_MESSAGE_MAX_WIDTH_MASK;
-
-BOOST_CONSTEXPR_OR_CONST WORD_ LANG_NEUTRAL_=                  LANG_NEUTRAL;
-BOOST_CONSTEXPR_OR_CONST WORD_ LANG_INVARIANT_=                LANG_INVARIANT;
-
-BOOST_CONSTEXPR_OR_CONST WORD_ SUBLANG_DEFAULT_=               SUBLANG_DEFAULT;    // user default
-
-BOOST_FORCEINLINE BOOST_CONSTEXPR WORD_ MAKELANGID_(WORD_ p, WORD_ s) BOOST_NOEXCEPT
-{
-    return static_cast< WORD_ >(MAKELANGID(p, s));
-}
-
-#if BOOST_WINAPI_PARTITION_DESKTOP
-BOOST_CONSTEXPR_OR_CONST DWORD_ SEM_FAILCRITICALERRORS_ =     SEM_FAILCRITICALERRORS;
-BOOST_CONSTEXPR_OR_CONST DWORD_ SEM_NOGPFAULTERRORBOX_ =      SEM_NOGPFAULTERRORBOX;
-BOOST_CONSTEXPR_OR_CONST DWORD_ SEM_NOALIGNMENTFAULTEXCEPT_ = SEM_NOALIGNMENTFAULTEXCEPT;
-BOOST_CONSTEXPR_OR_CONST DWORD_ SEM_NOOPENFILEERRORBOX_ =     SEM_NOOPENFILEERRORBOX;
-#endif
-
-#else
-
-#if BOOST_WINAPI_PARTITION_APP_SYSTEM
-BOOST_CONSTEXPR_OR_CONST DWORD_ FORMAT_MESSAGE_ALLOCATE_BUFFER_= 0x00000100;
-#endif
-BOOST_CONSTEXPR_OR_CONST DWORD_ FORMAT_MESSAGE_IGNORE_INSERTS_=  0x00000200;
-BOOST_CONSTEXPR_OR_CONST DWORD_ FORMAT_MESSAGE_FROM_STRING_=     0x00000400;
-BOOST_CONSTEXPR_OR_CONST DWORD_ FORMAT_MESSAGE_FROM_HMODULE_=    0x00000800;
-BOOST_CONSTEXPR_OR_CONST DWORD_ FORMAT_MESSAGE_FROM_SYSTEM_=     0x00001000;
-BOOST_CONSTEXPR_OR_CONST DWORD_ FORMAT_MESSAGE_ARGUMENT_ARRAY_=  0x00002000;
-BOOST_CONSTEXPR_OR_CONST DWORD_ FORMAT_MESSAGE_MAX_WIDTH_MASK_=  0x000000FF;
-
-BOOST_CONSTEXPR_OR_CONST WORD_ LANG_NEUTRAL_=                  0x00;
-BOOST_CONSTEXPR_OR_CONST WORD_ LANG_INVARIANT_=                0x7f;
-
-BOOST_CONSTEXPR_OR_CONST WORD_ SUBLANG_DEFAULT_=               0x01;    // user default
-
-BOOST_FORCEINLINE BOOST_CONSTEXPR WORD_ MAKELANGID_(WORD_ p, WORD_ s) BOOST_NOEXCEPT
-{
-    return static_cast< WORD_ >((static_cast< DWORD_ >(s) << 10u) | p);
-}
-
-#if BOOST_WINAPI_PARTITION_DESKTOP
-BOOST_CONSTEXPR_OR_CONST DWORD_ SEM_FAILCRITICALERRORS_ =     0x0001;
-BOOST_CONSTEXPR_OR_CONST DWORD_ SEM_NOGPFAULTERRORBOX_ =      0x0002;
-BOOST_CONSTEXPR_OR_CONST DWORD_ SEM_NOALIGNMENTFAULTEXCEPT_ = 0x0004;
-BOOST_CONSTEXPR_OR_CONST DWORD_ SEM_NOOPENFILEERRORBOX_ =     0x8000;
-#endif
-
-#endif
-
-#if !defined( BOOST_NO_ANSI_APIS )
-using ::FormatMessageA;
-#endif
-using ::FormatMessageW;
-#if BOOST_WINAPI_PARTITION_DESKTOP || BOOST_WINAPI_PARTITION_SYSTEM
-using ::SetErrorMode;
-#endif
-
-#if !defined( BOOST_NO_ANSI_APIS )
-BOOST_FORCEINLINE DWORD_ format_message(
-    DWORD_ dwFlags,
-    LPCVOID_ lpSource,
-    DWORD_ dwMessageId,
-    DWORD_ dwLanguageId,
-    LPSTR_ lpBuffer,
-    DWORD_ nSize,
-    va_list *Arguments)
-{
-    return ::FormatMessageA(dwFlags, lpSource, dwMessageId, dwLanguageId, lpBuffer, nSize, Arguments);
-}
-#endif
-
-BOOST_FORCEINLINE DWORD_ format_message(
-    DWORD_ dwFlags,
-    LPCVOID_ lpSource,
-    DWORD_ dwMessageId,
-    DWORD_ dwLanguageId,
-    LPWSTR_ lpBuffer,
-    DWORD_ nSize,
-    va_list *Arguments)
-{
-    return ::FormatMessageW(dwFlags, lpSource, dwMessageId, dwLanguageId, lpBuffer, nSize, Arguments);
-}
-
-}
-}
-
-#include <boost/winapi/detail/footer.hpp>
-
-#endif // BOOST_WINAPI_ERROR_HANDLING_HPP_INCLUDED_
diff --git a/src/boost/winapi/file_management.hpp b/src/boost/winapi/file_management.hpp
deleted file mode 100644
index b4da8f8b..00000000
--- a/src/boost/winapi/file_management.hpp
+++ /dev/null
@@ -1,597 +0,0 @@
-/*
- * Copyright 2010 Vicente J. Botet Escriba
- * Copyright 2015 Andrey Semashev
- * Copyright 2016 Jorge Lodos
- * Copyright 2017 James E. King, III
- *
- * Distributed under the Boost Software License, Version 1.0.
- * See http://www.boost.org/LICENSE_1_0.txt
- */
-
-#ifndef BOOST_WINAPI_FILE_MANAGEMENT_HPP_INCLUDED_
-#define BOOST_WINAPI_FILE_MANAGEMENT_HPP_INCLUDED_
-
-#include <boost/winapi/basic_types.hpp>
-#include <boost/winapi/limits.hpp>
-#include <boost/winapi/time.hpp>
-#include <boost/winapi/overlapped.hpp>
-#include <boost/winapi/detail/header.hpp>
-
-#ifdef BOOST_HAS_PRAGMA_ONCE
-#pragma once
-#endif
-
-/*
- * UWP:
- * API                         SDK 8     SDK 10            _WIN32_WINNT
- * AreFileApisANSI             DESKTOP - DESKTOP | SYSTEM
- * CreateFile                  DESKTOP - DESKTOP | SYSTEM
- * DeleteFile                  APP     - APP     | SYSTEM
- * FindClose                   APP     - APP     | SYSTEM
- * FindFirstFile               DESKTOP > APP     | SYSTEM
- * FindNextFile                DESKTOP > APP     | SYSTEM
- * GetFileAttributes           DESKTOP > APP     | SYSTEM
- * GetFileInformationByHandle  DESKTOP - DESKTOP | SYSTEM
- * GetFileSizeEx               DESKTOP > APP     | SYSTEM
- * LockFile                    DESKTOP - DESKTOP | SYSTEM
- * MoveFileEx                  APP     - APP     | SYSTEM
- * ReadFile                    APP     - APP     | SYSTEM
- * SetEndOfFile                APP     - APP     | SYSTEM
- * SetFilePointer              DESKTOP > APP     | SYSTEM
- * SetFileValidData            DESKTOP - DESKTOP | SYSTEM  >= 0x0501
- * UnlockFile                  DESKTOP - DESKTOP | SYSTEM
- * WriteFile                   APP     - APP     | SYSTEM
- */
-
-#if !defined( BOOST_USE_WINDOWS_H )
-extern "C" {
-
-#if BOOST_WINAPI_PARTITION_DESKTOP || BOOST_WINAPI_PARTITION_SYSTEM
-#if !defined( BOOST_NO_ANSI_APIS )
-BOOST_WINAPI_IMPORT boost::winapi::BOOL_ BOOST_WINAPI_WINAPI_CC
-AreFileApisANSI(BOOST_WINAPI_DETAIL_VOID);
-
-BOOST_WINAPI_IMPORT boost::winapi::HANDLE_ BOOST_WINAPI_WINAPI_CC
-CreateFileA(
-    boost::winapi::LPCSTR_ lpFileName,
-    boost::winapi::DWORD_ dwDesiredAccess,
-    boost::winapi::DWORD_ dwShareMode,
-    ::_SECURITY_ATTRIBUTES* lpSecurityAttributes,
-    boost::winapi::DWORD_ dwCreationDisposition,
-    boost::winapi::DWORD_ dwFlagsAndAttributes,
-    boost::winapi::HANDLE_ hTemplateFile);
-
-struct _WIN32_FIND_DATAA;
-BOOST_WINAPI_IMPORT boost::winapi::HANDLE_ BOOST_WINAPI_WINAPI_CC
-FindFirstFileA(boost::winapi::LPCSTR_ lpFileName, ::_WIN32_FIND_DATAA* lpFindFileData);
-
-BOOST_WINAPI_IMPORT boost::winapi::BOOL_ BOOST_WINAPI_WINAPI_CC
-FindNextFileA(boost::winapi::HANDLE_ hFindFile, ::_WIN32_FIND_DATAA* lpFindFileData);
-#endif
-
-BOOST_WINAPI_IMPORT_EXCEPT_WM boost::winapi::HANDLE_ BOOST_WINAPI_WINAPI_CC
-CreateFileW(
-    boost::winapi::LPCWSTR_ lpFileName,
-    boost::winapi::DWORD_ dwDesiredAccess,
-    boost::winapi::DWORD_ dwShareMode,
-    ::_SECURITY_ATTRIBUTES* lpSecurityAttributes,
-    boost::winapi::DWORD_ dwCreationDisposition,
-    boost::winapi::DWORD_ dwFlagsAndAttributes,
-    boost::winapi::HANDLE_ hTemplateFile);
-
-struct _WIN32_FIND_DATAW;
-BOOST_WINAPI_IMPORT_EXCEPT_WM boost::winapi::HANDLE_ BOOST_WINAPI_WINAPI_CC
-FindFirstFileW(boost::winapi::LPCWSTR_ lpFileName, ::_WIN32_FIND_DATAW* lpFindFileData);
-
-BOOST_WINAPI_IMPORT_EXCEPT_WM boost::winapi::BOOL_ BOOST_WINAPI_WINAPI_CC
-FindNextFileW(boost::winapi::HANDLE_ hFindFile, ::_WIN32_FIND_DATAW* lpFindFileData);
-
-struct _BY_HANDLE_FILE_INFORMATION;
-BOOST_WINAPI_IMPORT_EXCEPT_WM boost::winapi::BOOL_ BOOST_WINAPI_WINAPI_CC
-GetFileInformationByHandle(
-    boost::winapi::HANDLE_ hFile,
-    ::_BY_HANDLE_FILE_INFORMATION* lpFileInformation);
-
-BOOST_WINAPI_IMPORT boost::winapi::BOOL_ BOOST_WINAPI_WINAPI_CC
-LockFile(
-    boost::winapi::HANDLE_ hFile,
-    boost::winapi::DWORD_ dwFileOffsetLow,
-    boost::winapi::DWORD_ dwFileOffsetHigh,
-    boost::winapi::DWORD_ nNumberOfBytesToLockLow,
-    boost::winapi::DWORD_ nNumberOfBytesToLockHigh);
-
-BOOST_WINAPI_IMPORT_EXCEPT_WM boost::winapi::BOOL_ BOOST_WINAPI_WINAPI_CC
-LockFileEx(
-    boost::winapi::HANDLE_ hFile,
-    boost::winapi::DWORD_ dwFlags,
-    boost::winapi::DWORD_ dwReserved,
-    boost::winapi::DWORD_ nNumberOfBytesToLockLow,
-    boost::winapi::DWORD_ nNumberOfBytesToLockHigh,
-    ::_OVERLAPPED* lpOverlapped);
-
-#if BOOST_USE_WINAPI_VERSION >= BOOST_WINAPI_VERSION_WINXP
-BOOST_WINAPI_IMPORT boost::winapi::BOOL_ BOOST_WINAPI_WINAPI_CC
-SetFileValidData(
-    boost::winapi::HANDLE_ hFile, 
-    boost::winapi::LONGLONG_ ValidDataLength);
-#endif
-
-BOOST_WINAPI_IMPORT boost::winapi::BOOL_ BOOST_WINAPI_WINAPI_CC
-UnlockFile(
-    boost::winapi::HANDLE_ hFile,
-    boost::winapi::DWORD_ dwFileOffsetLow,
-    boost::winapi::DWORD_ dwFileOffsetHigh,
-    boost::winapi::DWORD_ nNumberOfBytesToUnlockLow,
-    boost::winapi::DWORD_ nNumberOfBytesToUnlockHigh);
-
-BOOST_WINAPI_IMPORT_EXCEPT_WM boost::winapi::BOOL_ BOOST_WINAPI_WINAPI_CC
-UnlockFileEx(
-    boost::winapi::HANDLE_ hFile,
-    boost::winapi::DWORD_ dwReserved,
-    boost::winapi::DWORD_ nNumberOfBytesToUnlockLow,
-    boost::winapi::DWORD_ nNumberOfBytesToUnlockHigh,
-    ::_OVERLAPPED* lpOverlapped);
-#endif
-
-#if BOOST_WINAPI_PARTITION_APP || BOOST_WINAPI_PARTITION_SYSTEM
-#if !defined( BOOST_NO_ANSI_APIS )
-BOOST_WINAPI_IMPORT boost::winapi::BOOL_ BOOST_WINAPI_WINAPI_CC
-DeleteFileA(boost::winapi::LPCSTR_ lpFileName);
-
-BOOST_WINAPI_IMPORT boost::winapi::BOOL_ BOOST_WINAPI_WINAPI_CC
-MoveFileExA(
-    boost::winapi::LPCSTR_ lpExistingFileName,
-    boost::winapi::LPCSTR_ lpNewFileName,
-    boost::winapi::DWORD_ dwFlags);
-#endif
-
-BOOST_WINAPI_IMPORT_EXCEPT_WM boost::winapi::BOOL_ BOOST_WINAPI_WINAPI_CC
-DeleteFileW(boost::winapi::LPCWSTR_ lpFileName);
-
-BOOST_WINAPI_IMPORT_EXCEPT_WM boost::winapi::BOOL_ BOOST_WINAPI_WINAPI_CC
-FindClose(boost::winapi::HANDLE_ hFindFile);
-
-BOOST_WINAPI_IMPORT boost::winapi::BOOL_ BOOST_WINAPI_WINAPI_CC
-MoveFileExW(
-    boost::winapi::LPCWSTR_ lpExistingFileName,
-    boost::winapi::LPCWSTR_ lpNewFileName,
-    boost::winapi::DWORD_ dwFlags);
-
-BOOST_WINAPI_IMPORT_EXCEPT_WM boost::winapi::BOOL_ BOOST_WINAPI_WINAPI_CC
-ReadFile(
-    boost::winapi::HANDLE_ hFile,
-    boost::winapi::LPVOID_ lpBuffer,
-    boost::winapi::DWORD_ nNumberOfBytesToRead,
-    boost::winapi::LPDWORD_ lpNumberOfBytesRead,
-    ::_OVERLAPPED* lpOverlapped);
-
-BOOST_WINAPI_IMPORT_EXCEPT_WM boost::winapi::BOOL_ BOOST_WINAPI_WINAPI_CC
-SetEndOfFile(boost::winapi::HANDLE_ hFile);
-
-BOOST_WINAPI_IMPORT_EXCEPT_WM boost::winapi::BOOL_ BOOST_WINAPI_WINAPI_CC
-WriteFile(
-    boost::winapi::HANDLE_ hFile,
-    boost::winapi::LPCVOID_ lpBuffer,
-    boost::winapi::DWORD_ nNumberOfBytesToWrite,
-    boost::winapi::LPDWORD_ lpNumberOfBytesWritten,
-    ::_OVERLAPPED* lpOverlapped);
-#endif // BOOST_WINAPI_PARTITION_APP || BOOST_WINAPI_PARTITION_SYSTEM
-
-#if BOOST_WINAPI_PARTITION_APP_SYSTEM
-#if !defined( BOOST_NO_ANSI_APIS )
-BOOST_WINAPI_IMPORT boost::winapi::DWORD_ BOOST_WINAPI_WINAPI_CC
-GetFileAttributesA(boost::winapi::LPCSTR_ lpFileName);
-#endif
-
-BOOST_WINAPI_IMPORT_EXCEPT_WM boost::winapi::DWORD_ BOOST_WINAPI_WINAPI_CC
-GetFileAttributesW(boost::winapi::LPCWSTR_ lpFileName);
-
-BOOST_WINAPI_IMPORT boost::winapi::BOOL_ BOOST_WINAPI_WINAPI_CC
-GetFileSizeEx(boost::winapi::HANDLE_ hFile, ::_LARGE_INTEGER* lpFileSize);
-
-BOOST_WINAPI_IMPORT_EXCEPT_WM boost::winapi::DWORD_ BOOST_WINAPI_WINAPI_CC
-SetFilePointer(
-    boost::winapi::HANDLE_ hFile,
-    boost::winapi::LONG_ lpDistanceToMove,
-    boost::winapi::PLONG_ lpDistanceToMoveHigh,
-    boost::winapi::DWORD_ dwMoveMethod);
-#endif // BOOST_WINAPI_PARTITION_APP_SYSTEM
-
-} // extern "C"
-#endif // !defined(BOOST_USE_WINDOWS_H)
-
-namespace boost {
-namespace winapi {
-
-#if defined( BOOST_USE_WINDOWS_H )
-
-BOOST_CONSTEXPR_OR_CONST DWORD_ INVALID_FILE_SIZE_ = INVALID_FILE_SIZE;
-BOOST_CONSTEXPR_OR_CONST DWORD_ INVALID_SET_FILE_POINTER_ = INVALID_SET_FILE_POINTER;
-BOOST_CONSTEXPR_OR_CONST DWORD_ INVALID_FILE_ATTRIBUTES_ = INVALID_FILE_ATTRIBUTES;
-
-BOOST_CONSTEXPR_OR_CONST DWORD_ FILE_ATTRIBUTE_READONLY_ = FILE_ATTRIBUTE_READONLY;
-BOOST_CONSTEXPR_OR_CONST DWORD_ FILE_ATTRIBUTE_HIDDEN_ = FILE_ATTRIBUTE_HIDDEN;
-BOOST_CONSTEXPR_OR_CONST DWORD_ FILE_ATTRIBUTE_SYSTEM_ = FILE_ATTRIBUTE_SYSTEM;
-BOOST_CONSTEXPR_OR_CONST DWORD_ FILE_ATTRIBUTE_DIRECTORY_ = FILE_ATTRIBUTE_DIRECTORY;
-BOOST_CONSTEXPR_OR_CONST DWORD_ FILE_ATTRIBUTE_ARCHIVE_ = FILE_ATTRIBUTE_ARCHIVE;
-BOOST_CONSTEXPR_OR_CONST DWORD_ FILE_ATTRIBUTE_DEVICE_ = FILE_ATTRIBUTE_DEVICE;
-BOOST_CONSTEXPR_OR_CONST DWORD_ FILE_ATTRIBUTE_NORMAL_ = FILE_ATTRIBUTE_NORMAL;
-BOOST_CONSTEXPR_OR_CONST DWORD_ FILE_ATTRIBUTE_TEMPORARY_ = FILE_ATTRIBUTE_TEMPORARY;
-BOOST_CONSTEXPR_OR_CONST DWORD_ FILE_ATTRIBUTE_SPARSE_FILE_ = FILE_ATTRIBUTE_SPARSE_FILE;
-BOOST_CONSTEXPR_OR_CONST DWORD_ FILE_ATTRIBUTE_REPARSE_POINT_ = FILE_ATTRIBUTE_REPARSE_POINT;
-BOOST_CONSTEXPR_OR_CONST DWORD_ FILE_ATTRIBUTE_COMPRESSED_ = FILE_ATTRIBUTE_COMPRESSED;
-BOOST_CONSTEXPR_OR_CONST DWORD_ FILE_ATTRIBUTE_OFFLINE_ = FILE_ATTRIBUTE_OFFLINE;
-BOOST_CONSTEXPR_OR_CONST DWORD_ FILE_ATTRIBUTE_NOT_CONTENT_INDEXED_ = FILE_ATTRIBUTE_NOT_CONTENT_INDEXED;
-BOOST_CONSTEXPR_OR_CONST DWORD_ FILE_ATTRIBUTE_ENCRYPTED_ = FILE_ATTRIBUTE_ENCRYPTED;
-
-BOOST_CONSTEXPR_OR_CONST DWORD_ CREATE_NEW_ = CREATE_NEW;
-BOOST_CONSTEXPR_OR_CONST DWORD_ CREATE_ALWAYS_ = CREATE_ALWAYS;
-BOOST_CONSTEXPR_OR_CONST DWORD_ OPEN_EXISTING_ = OPEN_EXISTING;
-BOOST_CONSTEXPR_OR_CONST DWORD_ OPEN_ALWAYS_ = OPEN_ALWAYS;
-BOOST_CONSTEXPR_OR_CONST DWORD_ TRUNCATE_EXISTING_ = TRUNCATE_EXISTING;
-
-BOOST_CONSTEXPR_OR_CONST DWORD_ FILE_SHARE_READ_ = FILE_SHARE_READ;
-BOOST_CONSTEXPR_OR_CONST DWORD_ FILE_SHARE_WRITE_ = FILE_SHARE_WRITE;
-BOOST_CONSTEXPR_OR_CONST DWORD_ FILE_SHARE_DELETE_ = FILE_SHARE_DELETE;
-
-BOOST_CONSTEXPR_OR_CONST DWORD_ FILE_BEGIN_ = FILE_BEGIN;
-BOOST_CONSTEXPR_OR_CONST DWORD_ FILE_CURRENT_ = FILE_CURRENT;
-BOOST_CONSTEXPR_OR_CONST DWORD_ FILE_END_ = FILE_END;
-
-#else // defined( BOOST_USE_WINDOWS_H )
-
-BOOST_CONSTEXPR_OR_CONST DWORD_ INVALID_FILE_SIZE_ = ((DWORD_)0xFFFFFFFF);
-BOOST_CONSTEXPR_OR_CONST DWORD_ INVALID_SET_FILE_POINTER_ = ((DWORD_)-1);
-BOOST_CONSTEXPR_OR_CONST DWORD_ INVALID_FILE_ATTRIBUTES_ = ((DWORD_)-1);
-
-BOOST_CONSTEXPR_OR_CONST DWORD_ FILE_ATTRIBUTE_READONLY_ = 0x00000001;
-BOOST_CONSTEXPR_OR_CONST DWORD_ FILE_ATTRIBUTE_HIDDEN_ = 0x00000002;
-BOOST_CONSTEXPR_OR_CONST DWORD_ FILE_ATTRIBUTE_SYSTEM_ = 0x00000004;
-BOOST_CONSTEXPR_OR_CONST DWORD_ FILE_ATTRIBUTE_DIRECTORY_ = 0x00000010;
-BOOST_CONSTEXPR_OR_CONST DWORD_ FILE_ATTRIBUTE_ARCHIVE_ = 0x00000020;
-BOOST_CONSTEXPR_OR_CONST DWORD_ FILE_ATTRIBUTE_DEVICE_ = 0x00000040;
-BOOST_CONSTEXPR_OR_CONST DWORD_ FILE_ATTRIBUTE_NORMAL_ = 0x00000080;
-BOOST_CONSTEXPR_OR_CONST DWORD_ FILE_ATTRIBUTE_TEMPORARY_ = 0x00000100;
-BOOST_CONSTEXPR_OR_CONST DWORD_ FILE_ATTRIBUTE_SPARSE_FILE_ = 0x00000200;
-BOOST_CONSTEXPR_OR_CONST DWORD_ FILE_ATTRIBUTE_REPARSE_POINT_ = 0x00000400;
-BOOST_CONSTEXPR_OR_CONST DWORD_ FILE_ATTRIBUTE_COMPRESSED_ = 0x00000800;
-BOOST_CONSTEXPR_OR_CONST DWORD_ FILE_ATTRIBUTE_OFFLINE_ = 0x00001000;
-BOOST_CONSTEXPR_OR_CONST DWORD_ FILE_ATTRIBUTE_NOT_CONTENT_INDEXED_ = 0x00002000;
-BOOST_CONSTEXPR_OR_CONST DWORD_ FILE_ATTRIBUTE_ENCRYPTED_ = 0x00004000;
-
-BOOST_CONSTEXPR_OR_CONST DWORD_ CREATE_NEW_ = 1;
-BOOST_CONSTEXPR_OR_CONST DWORD_ CREATE_ALWAYS_ = 2;
-BOOST_CONSTEXPR_OR_CONST DWORD_ OPEN_EXISTING_ = 3;
-BOOST_CONSTEXPR_OR_CONST DWORD_ OPEN_ALWAYS_ = 4;
-BOOST_CONSTEXPR_OR_CONST DWORD_ TRUNCATE_EXISTING_ = 5;
-
-BOOST_CONSTEXPR_OR_CONST DWORD_ FILE_SHARE_READ_ = 0x00000001;
-BOOST_CONSTEXPR_OR_CONST DWORD_ FILE_SHARE_WRITE_ = 0x00000002;
-BOOST_CONSTEXPR_OR_CONST DWORD_ FILE_SHARE_DELETE_ = 0x00000004;
-
-BOOST_CONSTEXPR_OR_CONST DWORD_ FILE_BEGIN_ = 0;
-BOOST_CONSTEXPR_OR_CONST DWORD_ FILE_CURRENT_ = 1;
-BOOST_CONSTEXPR_OR_CONST DWORD_ FILE_END_ = 2;
-
-#endif // defined( BOOST_USE_WINDOWS_H )
-
-// Some of these constants are not defined by Windows SDK in MinGW or older MSVC
-BOOST_CONSTEXPR_OR_CONST DWORD_ FILE_FLAG_WRITE_THROUGH_ = 0x80000000;
-BOOST_CONSTEXPR_OR_CONST DWORD_ FILE_FLAG_OVERLAPPED_ = 0x40000000;
-BOOST_CONSTEXPR_OR_CONST DWORD_ FILE_FLAG_NO_BUFFERING_ = 0x20000000;
-BOOST_CONSTEXPR_OR_CONST DWORD_ FILE_FLAG_RANDOM_ACCESS_ = 0x10000000;
-BOOST_CONSTEXPR_OR_CONST DWORD_ FILE_FLAG_SEQUENTIAL_SCAN_ = 0x08000000;
-BOOST_CONSTEXPR_OR_CONST DWORD_ FILE_FLAG_DELETE_ON_CLOSE_ = 0x04000000;
-BOOST_CONSTEXPR_OR_CONST DWORD_ FILE_FLAG_BACKUP_SEMANTICS_ = 0x02000000;
-BOOST_CONSTEXPR_OR_CONST DWORD_ FILE_FLAG_POSIX_SEMANTICS_ = 0x01000000;
-BOOST_CONSTEXPR_OR_CONST DWORD_ FILE_FLAG_SESSION_AWARE_ = 0x00800000;
-BOOST_CONSTEXPR_OR_CONST DWORD_ FILE_FLAG_OPEN_REPARSE_POINT_ = 0x00200000;
-BOOST_CONSTEXPR_OR_CONST DWORD_ FILE_FLAG_OPEN_NO_RECALL_ = 0x00100000;
-BOOST_CONSTEXPR_OR_CONST DWORD_ FILE_FLAG_FIRST_PIPE_INSTANCE_ = 0x00080000;
-
-#if BOOST_USE_WINAPI_VERSION >= BOOST_WINAPI_VERSION_WIN8
-BOOST_CONSTEXPR_OR_CONST DWORD_ FILE_FLAG_OPEN_REQUIRING_OPLOCK_ = 0x00040000;
-#endif
-
-// This constant is not defined in Windows SDK up until 6.0A
-BOOST_CONSTEXPR_OR_CONST DWORD_ FILE_ATTRIBUTE_VIRTUAL_ = 0x00010000;
-
-// These constants are not defined in Windows SDK up until 8.0 and MinGW/MinGW-w64 (as of 2016-02-14).
-// They are documented to be supported only since Windows 8/Windows Server 2012
-// but defined unconditionally.
-BOOST_CONSTEXPR_OR_CONST DWORD_ FILE_ATTRIBUTE_INTEGRITY_STREAM_ = 0x00008000;
-BOOST_CONSTEXPR_OR_CONST DWORD_ FILE_ATTRIBUTE_NO_SCRUB_DATA_ = 0x00020000;
-// Undocumented
-BOOST_CONSTEXPR_OR_CONST DWORD_ FILE_ATTRIBUTE_EA_ = 0x00040000;
-
-#if BOOST_WINAPI_PARTITION_DESKTOP || BOOST_WINAPI_PARTITION_SYSTEM
-#if !defined( BOOST_NO_ANSI_APIS )
-using ::AreFileApisANSI;
-
-BOOST_FORCEINLINE HANDLE_ CreateFileA(
-    LPCSTR_ lpFileName,
-    DWORD_ dwDesiredAccess,
-    DWORD_ dwShareMode,
-    SECURITY_ATTRIBUTES_* lpSecurityAttributes,
-    DWORD_ dwCreationDisposition,
-    DWORD_ dwFlagsAndAttributes,
-    HANDLE_ hTemplateFile)
-{
-    return ::CreateFileA(
-        lpFileName,
-        dwDesiredAccess,
-        dwShareMode,
-        reinterpret_cast< ::_SECURITY_ATTRIBUTES* >(lpSecurityAttributes),
-        dwCreationDisposition,
-        dwFlagsAndAttributes,
-        hTemplateFile);
-}
-
-BOOST_FORCEINLINE HANDLE_ create_file(
-    LPCSTR_ lpFileName,
-    DWORD_ dwDesiredAccess,
-    DWORD_ dwShareMode,
-    SECURITY_ATTRIBUTES_* lpSecurityAttributes,
-    DWORD_ dwCreationDisposition,
-    DWORD_ dwFlagsAndAttributes,
-    HANDLE_ hTemplateFile)
-{
-    return ::CreateFileA(
-        lpFileName,
-        dwDesiredAccess,
-        dwShareMode,
-        reinterpret_cast< ::_SECURITY_ATTRIBUTES* >(lpSecurityAttributes),
-        dwCreationDisposition,
-        dwFlagsAndAttributes,
-        hTemplateFile);
-}
-
-typedef struct BOOST_MAY_ALIAS _WIN32_FIND_DATAA {
-    DWORD_ dwFileAttributes;
-    FILETIME_ ftCreationTime;
-    FILETIME_ ftLastAccessTime;
-    FILETIME_ ftLastWriteTime;
-    DWORD_ nFileSizeHigh;
-    DWORD_ nFileSizeLow;
-    DWORD_ dwReserved0;
-    DWORD_ dwReserved1;
-    CHAR_   cFileName[MAX_PATH_];
-    CHAR_   cAlternateFileName[14];
-#ifdef _MAC
-    DWORD_ dwFileType;
-    DWORD_ dwCreatorType;
-    WORD_  wFinderFlags;
-#endif
-} WIN32_FIND_DATAA_, *PWIN32_FIND_DATAA_, *LPWIN32_FIND_DATAA_;
-
-BOOST_FORCEINLINE HANDLE_ FindFirstFileA(LPCSTR_ lpFileName, WIN32_FIND_DATAA_* lpFindFileData)
-{
-    return ::FindFirstFileA(lpFileName, reinterpret_cast< ::_WIN32_FIND_DATAA* >(lpFindFileData));
-}
-
-BOOST_FORCEINLINE HANDLE_ find_first_file(LPCSTR_ lpFileName, WIN32_FIND_DATAA_* lpFindFileData)
-{
-    return ::FindFirstFileA(lpFileName, reinterpret_cast< ::_WIN32_FIND_DATAA* >(lpFindFileData));
-}
-
-BOOST_FORCEINLINE BOOL_ FindNextFileA(HANDLE_ hFindFile, WIN32_FIND_DATAA_* lpFindFileData)
-{
-    return ::FindNextFileA(hFindFile, reinterpret_cast< ::_WIN32_FIND_DATAA* >(lpFindFileData));
-}
-
-BOOST_FORCEINLINE BOOL_ find_next_file(HANDLE_ hFindFile, WIN32_FIND_DATAA_* lpFindFileData)
-{
-    return ::FindNextFileA(hFindFile, reinterpret_cast< ::_WIN32_FIND_DATAA* >(lpFindFileData));
-}
-
-#endif // !defined( BOOST_NO_ANSI_APIS )
-
-BOOST_FORCEINLINE HANDLE_ CreateFileW(
-    LPCWSTR_ lpFileName,
-    DWORD_ dwDesiredAccess,
-    DWORD_ dwShareMode,
-    SECURITY_ATTRIBUTES_* lpSecurityAttributes,
-    DWORD_ dwCreationDisposition,
-    DWORD_ dwFlagsAndAttributes,
-    HANDLE_ hTemplateFile)
-{
-    return ::CreateFileW(
-        lpFileName,
-        dwDesiredAccess,
-        dwShareMode,
-        reinterpret_cast< ::_SECURITY_ATTRIBUTES* >(lpSecurityAttributes),
-        dwCreationDisposition,
-        dwFlagsAndAttributes,
-        hTemplateFile);
-}
-
-BOOST_FORCEINLINE HANDLE_ create_file(
-    LPCWSTR_ lpFileName,
-    DWORD_ dwDesiredAccess,
-    DWORD_ dwShareMode,
-    SECURITY_ATTRIBUTES_* lpSecurityAttributes,
-    DWORD_ dwCreationDisposition,
-    DWORD_ dwFlagsAndAttributes,
-    HANDLE_ hTemplateFile)
-{
-    return ::CreateFileW(
-        lpFileName,
-        dwDesiredAccess,
-        dwShareMode,
-        reinterpret_cast< ::_SECURITY_ATTRIBUTES* >(lpSecurityAttributes),
-        dwCreationDisposition,
-        dwFlagsAndAttributes,
-        hTemplateFile);
-}
-
-typedef struct BOOST_MAY_ALIAS _WIN32_FIND_DATAW {
-    DWORD_ dwFileAttributes;
-    FILETIME_ ftCreationTime;
-    FILETIME_ ftLastAccessTime;
-    FILETIME_ ftLastWriteTime;
-    DWORD_ nFileSizeHigh;
-    DWORD_ nFileSizeLow;
-    DWORD_ dwReserved0;
-    DWORD_ dwReserved1;
-    WCHAR_  cFileName[MAX_PATH_];
-    WCHAR_  cAlternateFileName[14];
-#ifdef _MAC
-    DWORD_ dwFileType;
-    DWORD_ dwCreatorType;
-    WORD_  wFinderFlags;
-#endif
-} WIN32_FIND_DATAW_, *PWIN32_FIND_DATAW_, *LPWIN32_FIND_DATAW_;
-
-typedef struct BOOST_MAY_ALIAS _BY_HANDLE_FILE_INFORMATION {
-    DWORD_ dwFileAttributes;
-    FILETIME_ ftCreationTime;
-    FILETIME_ ftLastAccessTime;
-    FILETIME_ ftLastWriteTime;
-    DWORD_ dwVolumeSerialNumber;
-    DWORD_ nFileSizeHigh;
-    DWORD_ nFileSizeLow;
-    DWORD_ nNumberOfLinks;
-    DWORD_ nFileIndexHigh;
-    DWORD_ nFileIndexLow;
-} BY_HANDLE_FILE_INFORMATION_, *PBY_HANDLE_FILE_INFORMATION_, *LPBY_HANDLE_FILE_INFORMATION_;
-
-BOOST_FORCEINLINE HANDLE_ FindFirstFileW(LPCWSTR_ lpFileName, WIN32_FIND_DATAW_* lpFindFileData)
-{
-    return ::FindFirstFileW(lpFileName, reinterpret_cast< ::_WIN32_FIND_DATAW* >(lpFindFileData));
-}
-
-BOOST_FORCEINLINE HANDLE_ find_first_file(LPCWSTR_ lpFileName, WIN32_FIND_DATAW_* lpFindFileData)
-{
-    return ::FindFirstFileW(lpFileName, reinterpret_cast< ::_WIN32_FIND_DATAW* >(lpFindFileData));
-}
-
-BOOST_FORCEINLINE BOOL_ FindNextFileW(HANDLE_ hFindFile, WIN32_FIND_DATAW_* lpFindFileData)
-{
-    return ::FindNextFileW(hFindFile, reinterpret_cast< ::_WIN32_FIND_DATAW* >(lpFindFileData));
-}
-
-BOOST_FORCEINLINE BOOL_ find_next_file(HANDLE_ hFindFile, WIN32_FIND_DATAW_* lpFindFileData)
-{
-    return ::FindNextFileW(hFindFile, reinterpret_cast< ::_WIN32_FIND_DATAW* >(lpFindFileData));
-}
-
-BOOST_FORCEINLINE BOOL_ GetFileInformationByHandle(HANDLE_ h, BY_HANDLE_FILE_INFORMATION_* info)
-{
-    return ::GetFileInformationByHandle(h, reinterpret_cast< ::_BY_HANDLE_FILE_INFORMATION* >(info));
-}
-
-using ::LockFile;
-
-BOOST_FORCEINLINE BOOL_ LockFileEx(
-    HANDLE_ hFile,
-    DWORD_ dwFlags,
-    DWORD_ dwReserved,
-    DWORD_ nNumberOfBytesToLockLow,
-    DWORD_ nNumberOfBytesToLockHigh,
-    OVERLAPPED_* lpOverlapped)
-{
-    return ::LockFileEx(hFile, dwFlags, dwReserved, nNumberOfBytesToLockLow, nNumberOfBytesToLockHigh, reinterpret_cast< ::_OVERLAPPED* >(lpOverlapped));
-}
-
-#if BOOST_USE_WINAPI_VERSION >= BOOST_WINAPI_VERSION_WINXP
-using ::SetFileValidData;
-#endif
-
-using ::UnlockFile;
-
-BOOST_FORCEINLINE BOOL_ UnlockFileEx(
-    HANDLE_ hFile,
-    DWORD_ dwReserved,
-    DWORD_ nNumberOfBytesToUnlockLow,
-    DWORD_ nNumberOfBytesToUnlockHigh,
-    OVERLAPPED_* lpOverlapped)
-{
-    return ::UnlockFileEx(hFile, dwReserved, nNumberOfBytesToUnlockLow, nNumberOfBytesToUnlockHigh, reinterpret_cast< ::_OVERLAPPED* >(lpOverlapped));
-}
-#endif // BOOST_WINAPI_PARTITION_DESKTOP || BOOST_WINAPI_PARTITION_SYSTEM
-
-#if BOOST_WINAPI_PARTITION_APP || BOOST_WINAPI_PARTITION_SYSTEM
-#if !defined( BOOST_NO_ANSI_APIS )
-using ::DeleteFileA;
-
-BOOST_FORCEINLINE BOOL_ delete_file(LPCSTR_ lpFileName)
-{
-    return ::DeleteFileA(lpFileName);
-}
-
-using ::MoveFileExA;
-
-BOOST_FORCEINLINE BOOL_ move_file(LPCSTR_ lpExistingFileName, LPCSTR_ lpNewFileName, DWORD_ dwFlags)
-{
-    return ::MoveFileExA(lpExistingFileName, lpNewFileName, dwFlags);
-}
-
-#endif
-using ::DeleteFileW;
-
-BOOST_FORCEINLINE BOOL_ delete_file(LPCWSTR_ lpFileName)
-{
-    return ::DeleteFileW(lpFileName);
-}
-
-using ::FindClose;
-using ::MoveFileExW;
-
-BOOST_FORCEINLINE BOOL_ move_file(LPCWSTR_ lpExistingFileName, LPCWSTR_ lpNewFileName, DWORD_ dwFlags)
-{
-    return ::MoveFileExW(lpExistingFileName, lpNewFileName, dwFlags);
-}
-
-BOOST_FORCEINLINE BOOL_ ReadFile(
-    HANDLE_ hFile,
-    LPVOID_ lpBuffer,
-    DWORD_ nNumberOfBytesToWrite,
-    LPDWORD_ lpNumberOfBytesWritten,
-    OVERLAPPED_* lpOverlapped)
-{
-    return ::ReadFile(hFile, lpBuffer, nNumberOfBytesToWrite, lpNumberOfBytesWritten, reinterpret_cast< ::_OVERLAPPED* >(lpOverlapped));
-}
-
-using ::SetEndOfFile;
-
-BOOST_FORCEINLINE BOOL_ WriteFile(
-    HANDLE_ hFile,
-    LPCVOID_ lpBuffer,
-    DWORD_ nNumberOfBytesToWrite,
-    LPDWORD_ lpNumberOfBytesWritten,
-    OVERLAPPED_* lpOverlapped)
-{
-    return ::WriteFile(hFile, lpBuffer, nNumberOfBytesToWrite, lpNumberOfBytesWritten, reinterpret_cast< ::_OVERLAPPED* >(lpOverlapped));
-}
-#endif // BOOST_WINAPI_PARTITION_APP || BOOST_WINAPI_PARTITION_SYSTEM
-
-#if BOOST_WINAPI_PARTITION_APP_SYSTEM
-#if !defined( BOOST_NO_ANSI_APIS )
-using ::GetFileAttributesA;
-
-BOOST_FORCEINLINE DWORD_ get_file_attributes(LPCSTR_ lpFileName)
-{
-    return ::GetFileAttributesA(lpFileName);
-}
-#endif
-using ::GetFileAttributesW;
-
-BOOST_FORCEINLINE DWORD_ get_file_attributes(LPCWSTR_ lpFileName)
-{
-    return ::GetFileAttributesW(lpFileName);
-}
-
-BOOST_FORCEINLINE BOOL_ GetFileSizeEx(HANDLE_ hFile, LARGE_INTEGER_* lpFileSize)
-{
-    return ::GetFileSizeEx(hFile, reinterpret_cast< ::_LARGE_INTEGER* >(lpFileSize));
-}
-
-using ::SetFilePointer;
-#endif // BOOST_WINAPI_PARTITION_APP_SYSTEM
-
-}
-}
-
-#include <boost/winapi/detail/footer.hpp>
-
-#endif // BOOST_WINAPI_FILE_MANAGEMENT_HPP_INCLUDED_
diff --git a/src/boost/winapi/file_mapping.hpp b/src/boost/winapi/file_mapping.hpp
deleted file mode 100644
index 9a5e2380..00000000
--- a/src/boost/winapi/file_mapping.hpp
+++ /dev/null
@@ -1,262 +0,0 @@
-/*
- * Copyright 2010 Vicente J. Botet Escriba
- * Copyright 2015 Andrey Semashev
- * Copyright 2016 Jorge Lodos
- * Copyright 2017 James E. King, III
- *
- * Distributed under the Boost Software License, Version 1.0.
- * See http://www.boost.org/LICENSE_1_0.txt
- */
-
-#ifndef BOOST_WINAPI_FILE_MAPPING_HPP_INCLUDED_
-#define BOOST_WINAPI_FILE_MAPPING_HPP_INCLUDED_
-
-#include <boost/winapi/basic_types.hpp>
-#include <boost/winapi/detail/header.hpp>
-
-#ifdef BOOST_HAS_PRAGMA_ONCE
-#pragma once
-#endif
-
-/*
- * UWP:
- * API                SDK 8     SDK 10
- * CreateFileMapping  DESKTOP - DESKTOP | SYSTEM
- * FlushViewOfFile    APP     - APP     | SYSTEM
- * MapViewOfFile      DESKTOP - DESKTOP | SYSTEM
- * MapViewOfFileEx    DESKTOP - DESKTOP | SYSTEM
- * OpenFileMapping    DESKTOP - DESKTOP | SYSTEM
- * UnmapViewOfFile    APP     - APP     | SYSTEM
- */
-
-#if !defined( BOOST_USE_WINDOWS_H )
-extern "C" {
-
-#if BOOST_WINAPI_PARTITION_DESKTOP
-#if !defined( BOOST_NO_ANSI_APIS )
-BOOST_WINAPI_IMPORT boost::winapi::HANDLE_ BOOST_WINAPI_WINAPI_CC
-CreateFileMappingA(
-    boost::winapi::HANDLE_ hFile,
-    ::_SECURITY_ATTRIBUTES* lpFileMappingAttributes,
-    boost::winapi::DWORD_ flProtect,
-    boost::winapi::DWORD_ dwMaximumSizeHigh,
-    boost::winapi::DWORD_ dwMaximumSizeLow,
-    boost::winapi::LPCSTR_ lpName);
-
-BOOST_WINAPI_IMPORT boost::winapi::HANDLE_ BOOST_WINAPI_WINAPI_CC
-OpenFileMappingA(
-    boost::winapi::DWORD_ dwDesiredAccess,
-    boost::winapi::BOOL_ bInheritHandle,
-    boost::winapi::LPCSTR_ lpName);
-#endif // !defined( BOOST_NO_ANSI_APIS )
-#endif // BOOST_WINAPI_PARTITION_DESKTOP
-
-#if BOOST_WINAPI_PARTITION_DESKTOP || BOOST_WINAPI_PARTITION_SYSTEM
-BOOST_WINAPI_IMPORT_EXCEPT_WM boost::winapi::HANDLE_ BOOST_WINAPI_WINAPI_CC
-CreateFileMappingW(
-    boost::winapi::HANDLE_ hFile,
-    ::_SECURITY_ATTRIBUTES* lpFileMappingAttributes,
-    boost::winapi::DWORD_ flProtect,
-    boost::winapi::DWORD_ dwMaximumSizeHigh,
-    boost::winapi::DWORD_ dwMaximumSizeLow,
-    boost::winapi::LPCWSTR_ lpName);
-
-BOOST_WINAPI_IMPORT_EXCEPT_WM boost::winapi::LPVOID_ BOOST_WINAPI_WINAPI_CC
-MapViewOfFile(
-    boost::winapi::HANDLE_ hFileMappingObject,
-    boost::winapi::DWORD_ dwDesiredAccess,
-    boost::winapi::DWORD_ dwFileOffsetHigh,
-    boost::winapi::DWORD_ dwFileOffsetLow,
-    boost::winapi::SIZE_T_ dwNumberOfBytesToMap);
-
-BOOST_WINAPI_IMPORT boost::winapi::LPVOID_ BOOST_WINAPI_WINAPI_CC
-MapViewOfFileEx(
-    boost::winapi::HANDLE_ hFileMappingObject,
-    boost::winapi::DWORD_ dwDesiredAccess,
-    boost::winapi::DWORD_ dwFileOffsetHigh,
-    boost::winapi::DWORD_ dwFileOffsetLow,
-    boost::winapi::SIZE_T_ dwNumberOfBytesToMap,
-    boost::winapi::LPVOID_ lpBaseAddress);
-
-BOOST_WINAPI_IMPORT boost::winapi::HANDLE_ BOOST_WINAPI_WINAPI_CC
-OpenFileMappingW(
-    boost::winapi::DWORD_ dwDesiredAccess,
-    boost::winapi::BOOL_ bInheritHandle,
-    boost::winapi::LPCWSTR_ lpName);
-#endif // BOOST_WINAPI_PARTITION_DESKTOP || BOOST_WINAPI_PARTITION_SYSTEM
-
-#if BOOST_WINAPI_PARTITION_APP || BOOST_WINAPI_PARTITION_SYSTEM
-BOOST_WINAPI_IMPORT_EXCEPT_WM boost::winapi::BOOL_ BOOST_WINAPI_WINAPI_CC
-FlushViewOfFile(
-    boost::winapi::LPCVOID_ lpBaseAddress,
-    boost::winapi::SIZE_T_ dwNumberOfBytesToFlush);
-
-BOOST_WINAPI_IMPORT_EXCEPT_WM boost::winapi::BOOL_ BOOST_WINAPI_WINAPI_CC
-UnmapViewOfFile(boost::winapi::LPCVOID_ lpBaseAddress);
-#endif // BOOST_WINAPI_PARTITION_APP || BOOST_WINAPI_PARTITION_SYSTEM
-
-} // extern "C"
-#endif // !defined( BOOST_USE_WINDOWS_H )
-
-namespace boost {
-namespace winapi {
-
-#if defined( BOOST_USE_WINDOWS_H )
-
-BOOST_CONSTEXPR_OR_CONST DWORD_ SEC_FILE_ = SEC_FILE;
-BOOST_CONSTEXPR_OR_CONST DWORD_ SEC_IMAGE_ = SEC_IMAGE;
-BOOST_CONSTEXPR_OR_CONST DWORD_ SEC_RESERVE_ = SEC_RESERVE;
-BOOST_CONSTEXPR_OR_CONST DWORD_ SEC_COMMIT_ = SEC_COMMIT;
-BOOST_CONSTEXPR_OR_CONST DWORD_ SEC_NOCACHE_ = SEC_NOCACHE;
-
-// These permission flags are undocumented and some of them are equivalent to the FILE_MAP_* flags.
-// SECTION_QUERY enables NtQuerySection.
-// http://undocumented.ntinternals.net/index.html?page=UserMode%2FUndocumented%20Functions%2FNT%20Objects%2FSection%2FNtQuerySection.html
-BOOST_CONSTEXPR_OR_CONST DWORD_ SECTION_QUERY_ = SECTION_QUERY;
-BOOST_CONSTEXPR_OR_CONST DWORD_ SECTION_MAP_WRITE_ = SECTION_MAP_WRITE;
-BOOST_CONSTEXPR_OR_CONST DWORD_ SECTION_MAP_READ_ = SECTION_MAP_READ;
-BOOST_CONSTEXPR_OR_CONST DWORD_ SECTION_MAP_EXECUTE_ = SECTION_MAP_EXECUTE;
-BOOST_CONSTEXPR_OR_CONST DWORD_ SECTION_EXTEND_SIZE_ = SECTION_EXTEND_SIZE;
-BOOST_CONSTEXPR_OR_CONST DWORD_ SECTION_ALL_ACCESS_ = SECTION_ALL_ACCESS;
-
-BOOST_CONSTEXPR_OR_CONST DWORD_ FILE_MAP_COPY_ = FILE_MAP_COPY;
-BOOST_CONSTEXPR_OR_CONST DWORD_ FILE_MAP_WRITE_ = FILE_MAP_WRITE;
-BOOST_CONSTEXPR_OR_CONST DWORD_ FILE_MAP_READ_ = FILE_MAP_READ;
-BOOST_CONSTEXPR_OR_CONST DWORD_ FILE_MAP_ALL_ACCESS_ = FILE_MAP_ALL_ACCESS;
-
-#else // defined( BOOST_USE_WINDOWS_H )
-
-BOOST_CONSTEXPR_OR_CONST DWORD_ SEC_FILE_ = 0x800000;
-BOOST_CONSTEXPR_OR_CONST DWORD_ SEC_IMAGE_ = 0x1000000;
-BOOST_CONSTEXPR_OR_CONST DWORD_ SEC_RESERVE_ = 0x4000000;
-BOOST_CONSTEXPR_OR_CONST DWORD_ SEC_COMMIT_ = 0x8000000;
-BOOST_CONSTEXPR_OR_CONST DWORD_ SEC_NOCACHE_ = 0x10000000;
-
-// These permission flags are undocumented and some of them are equivalent to the FILE_MAP_* flags.
-// SECTION_QUERY enables NtQuerySection.
-// http://undocumented.ntinternals.net/index.html?page=UserMode%2FUndocumented%20Functions%2FNT%20Objects%2FSection%2FNtQuerySection.html
-BOOST_CONSTEXPR_OR_CONST DWORD_ SECTION_QUERY_ = 0x00000001;
-BOOST_CONSTEXPR_OR_CONST DWORD_ SECTION_MAP_WRITE_ = 0x00000002;
-BOOST_CONSTEXPR_OR_CONST DWORD_ SECTION_MAP_READ_ = 0x00000004;
-BOOST_CONSTEXPR_OR_CONST DWORD_ SECTION_MAP_EXECUTE_ = 0x00000008;
-BOOST_CONSTEXPR_OR_CONST DWORD_ SECTION_EXTEND_SIZE_ = 0x00000010;
-BOOST_CONSTEXPR_OR_CONST DWORD_ SECTION_ALL_ACCESS_ = 0x000F001F; // STANDARD_RIGHTS_REQUIRED | SECTION_*
-
-BOOST_CONSTEXPR_OR_CONST DWORD_ FILE_MAP_COPY_ = SECTION_QUERY_;
-BOOST_CONSTEXPR_OR_CONST DWORD_ FILE_MAP_WRITE_ = SECTION_MAP_WRITE_;
-BOOST_CONSTEXPR_OR_CONST DWORD_ FILE_MAP_READ_ = SECTION_MAP_READ_;
-BOOST_CONSTEXPR_OR_CONST DWORD_ FILE_MAP_ALL_ACCESS_ = SECTION_ALL_ACCESS_;
-
-#endif // defined( BOOST_USE_WINDOWS_H )
-
-// These constants are not defined in Windows SDK up until the one shipped with MSVC 8 and MinGW (as of 2016-02-14)
-BOOST_CONSTEXPR_OR_CONST DWORD_ SECTION_MAP_EXECUTE_EXPLICIT_ = 0x00000020; // not included in SECTION_ALL_ACCESS
-BOOST_CONSTEXPR_OR_CONST DWORD_ FILE_MAP_EXECUTE_ = SECTION_MAP_EXECUTE_EXPLICIT_; // not included in FILE_MAP_ALL_ACCESS
-
-// These constants are not defined in Windows SDK up until 6.0A and MinGW (as of 2016-02-14)
-BOOST_CONSTEXPR_OR_CONST DWORD_ SEC_PROTECTED_IMAGE_ = 0x2000000;
-BOOST_CONSTEXPR_OR_CONST DWORD_ SEC_WRITECOMBINE_ = 0x40000000;
-BOOST_CONSTEXPR_OR_CONST DWORD_ SEC_LARGE_PAGES_ = 0x80000000;
-BOOST_CONSTEXPR_OR_CONST DWORD_ SEC_IMAGE_NO_EXECUTE_ = (SEC_IMAGE_ | SEC_NOCACHE_);
-
-#if BOOST_WINAPI_PARTITION_DESKTOP
-#if !defined( BOOST_NO_ANSI_APIS )
-BOOST_FORCEINLINE HANDLE_ CreateFileMappingA(
-    HANDLE_ hFile,
-    SECURITY_ATTRIBUTES_* lpFileMappingAttributes,
-    DWORD_ flProtect,
-    DWORD_ dwMaximumSizeHigh,
-    DWORD_ dwMaximumSizeLow,
-    LPCSTR_ lpName)
-{
-    return ::CreateFileMappingA(
-        hFile,
-        reinterpret_cast< ::_SECURITY_ATTRIBUTES* >(lpFileMappingAttributes),
-        flProtect,
-        dwMaximumSizeHigh,
-        dwMaximumSizeLow,
-        lpName);
-}
-
-BOOST_FORCEINLINE HANDLE_ create_file_mapping(
-    HANDLE_ hFile,
-    SECURITY_ATTRIBUTES_* lpFileMappingAttributes,
-    DWORD_ flProtect,
-    DWORD_ dwMaximumSizeHigh,
-    DWORD_ dwMaximumSizeLow,
-    LPCSTR_ lpName)
-{
-    return ::CreateFileMappingA(
-        hFile,
-        reinterpret_cast< ::_SECURITY_ATTRIBUTES* >(lpFileMappingAttributes),
-        flProtect,
-        dwMaximumSizeHigh,
-        dwMaximumSizeLow,
-        lpName);
-}
-
-using ::OpenFileMappingA;
-
-BOOST_FORCEINLINE HANDLE_ open_file_mapping(DWORD_ dwDesiredAccess, BOOL_ bInheritHandle, LPCSTR_ lpName)
-{
-    return ::OpenFileMappingA(dwDesiredAccess, bInheritHandle, lpName);
-}
-#endif
-#endif // BOOST_WINAPI_PARTITION_DESKTOP
-
-#if BOOST_WINAPI_PARTITION_DESKTOP || BOOST_WINAPI_PARTITION_SYSTEM
-BOOST_FORCEINLINE HANDLE_ CreateFileMappingW(
-    HANDLE_ hFile,
-    SECURITY_ATTRIBUTES_* lpFileMappingAttributes,
-    DWORD_ flProtect,
-    DWORD_ dwMaximumSizeHigh,
-    DWORD_ dwMaximumSizeLow,
-    LPCWSTR_ lpName)
-{
-    return ::CreateFileMappingW(
-        hFile,
-        reinterpret_cast< ::_SECURITY_ATTRIBUTES* >(lpFileMappingAttributes),
-        flProtect,
-        dwMaximumSizeHigh,
-        dwMaximumSizeLow,
-        lpName);
-}
-
-BOOST_FORCEINLINE HANDLE_ create_file_mapping(
-    HANDLE_ hFile,
-    SECURITY_ATTRIBUTES_* lpFileMappingAttributes,
-    DWORD_ flProtect,
-    DWORD_ dwMaximumSizeHigh,
-    DWORD_ dwMaximumSizeLow,
-    LPCWSTR_ lpName)
-{
-    return ::CreateFileMappingW(
-        hFile,
-        reinterpret_cast< ::_SECURITY_ATTRIBUTES* >(lpFileMappingAttributes),
-        flProtect,
-        dwMaximumSizeHigh,
-        dwMaximumSizeLow,
-        lpName);
-}
-
-using ::MapViewOfFile;
-using ::MapViewOfFileEx;
-using ::OpenFileMappingW;
-
-BOOST_FORCEINLINE HANDLE_ open_file_mapping(DWORD_ dwDesiredAccess, BOOL_ bInheritHandle, LPCWSTR_ lpName)
-{
-    return ::OpenFileMappingW(dwDesiredAccess, bInheritHandle, lpName);
-}
-#endif // BOOST_WINAPI_PARTITION_DESKTOP || BOOST_WINAPI_PARTITION_SYSTEM
-
-#if BOOST_WINAPI_PARTITION_APP || BOOST_WINAPI_PARTITION_SYSTEM
-using ::FlushViewOfFile;
-using ::UnmapViewOfFile;
-#endif // BOOST_WINAPI_PARTITION_APP || BOOST_WINAPI_PARTITION_SYSTEM
-
-}
-}
-
-#include <boost/winapi/detail/footer.hpp>
-
-#endif // BOOST_WINAPI_FILE_MAPPING_HPP_INCLUDED_
diff --git a/src/boost/winapi/get_current_process.hpp b/src/boost/winapi/get_current_process.hpp
deleted file mode 100644
index 15052ef3..00000000
--- a/src/boost/winapi/get_current_process.hpp
+++ /dev/null
@@ -1,34 +0,0 @@
-/*
- * Copyright 2010 Vicente J. Botet Escriba
- * Copyright 2015 Andrey Semashev
- *
- * Distributed under the Boost Software License, Version 1.0.
- * See http://www.boost.org/LICENSE_1_0.txt
- */
-
-#ifndef BOOST_WINAPI_GET_CURRENT_PROCESS_HPP_INCLUDED_
-#define BOOST_WINAPI_GET_CURRENT_PROCESS_HPP_INCLUDED_
-
-#include <boost/winapi/basic_types.hpp>
-#include <boost/winapi/detail/header.hpp>
-
-#ifdef BOOST_HAS_PRAGMA_ONCE
-#pragma once
-#endif
-
-// Windows CE define GetCurrentProcess as an inline function in kfuncs.h
-#if !defined( BOOST_USE_WINDOWS_H ) && !defined( UNDER_CE )
-extern "C" {
-BOOST_WINAPI_IMPORT boost::winapi::HANDLE_ BOOST_WINAPI_WINAPI_CC GetCurrentProcess(BOOST_WINAPI_DETAIL_VOID);
-}
-#endif
-
-namespace boost {
-namespace winapi {
-using ::GetCurrentProcess;
-}
-}
-
-#include <boost/winapi/detail/footer.hpp>
-
-#endif // BOOST_WINAPI_GET_CURRENT_PROCESS_HPP_INCLUDED_
diff --git a/src/boost/winapi/get_current_process_id.hpp b/src/boost/winapi/get_current_process_id.hpp
deleted file mode 100644
index b1a3ea12..00000000
--- a/src/boost/winapi/get_current_process_id.hpp
+++ /dev/null
@@ -1,33 +0,0 @@
-/*
- * Copyright 2010 Vicente J. Botet Escriba
- *
- * Distributed under the Boost Software License, Version 1.0.
- * See http://www.boost.org/LICENSE_1_0.txt
- */
-
-#ifndef BOOST_WINAPI_GET_CURRENT_PROCESS_ID_HPP_INCLUDED_
-#define BOOST_WINAPI_GET_CURRENT_PROCESS_ID_HPP_INCLUDED_
-
-#include <boost/winapi/basic_types.hpp>
-#include <boost/winapi/detail/header.hpp>
-
-#ifdef BOOST_HAS_PRAGMA_ONCE
-#pragma once
-#endif
-
-// Windows CE define GetCurrentProcessId as an inline function in kfuncs.h
-#if !defined( BOOST_USE_WINDOWS_H ) && !defined( UNDER_CE )
-extern "C" {
-BOOST_WINAPI_IMPORT boost::winapi::DWORD_ BOOST_WINAPI_WINAPI_CC GetCurrentProcessId(BOOST_WINAPI_DETAIL_VOID);
-}
-#endif
-
-namespace boost {
-namespace winapi {
-using ::GetCurrentProcessId;
-}
-}
-
-#include <boost/winapi/detail/footer.hpp>
-
-#endif // BOOST_WINAPI_GET_CURRENT_PROCESS_ID_HPP_INCLUDED_
diff --git a/src/boost/winapi/get_current_thread.hpp b/src/boost/winapi/get_current_thread.hpp
deleted file mode 100644
index b00f8660..00000000
--- a/src/boost/winapi/get_current_thread.hpp
+++ /dev/null
@@ -1,34 +0,0 @@
-/*
- * Copyright 2010 Vicente J. Botet Escriba
- * Copyright 2015 Andrey Semashev
- *
- * Distributed under the Boost Software License, Version 1.0.
- * See http://www.boost.org/LICENSE_1_0.txt
- */
-
-#ifndef BOOST_WINAPI_GET_CURRENT_THREAD_HPP_INCLUDED_
-#define BOOST_WINAPI_GET_CURRENT_THREAD_HPP_INCLUDED_
-
-#include <boost/winapi/basic_types.hpp>
-#include <boost/winapi/detail/header.hpp>
-
-#ifdef BOOST_HAS_PRAGMA_ONCE
-#pragma once
-#endif
-
-// Windows CE define GetCurrentThread as an inline function in kfuncs.h
-#if !defined( BOOST_USE_WINDOWS_H ) && !defined( UNDER_CE )
-extern "C" {
-BOOST_WINAPI_IMPORT boost::winapi::HANDLE_ BOOST_WINAPI_WINAPI_CC GetCurrentThread(BOOST_WINAPI_DETAIL_VOID);
-}
-#endif
-
-namespace boost {
-namespace winapi {
-using ::GetCurrentThread;
-}
-}
-
-#include <boost/winapi/detail/footer.hpp>
-
-#endif // BOOST_WINAPI_GET_CURRENT_THREAD_HPP_INCLUDED_
diff --git a/src/boost/winapi/get_current_thread_id.hpp b/src/boost/winapi/get_current_thread_id.hpp
deleted file mode 100644
index 6f78f551..00000000
--- a/src/boost/winapi/get_current_thread_id.hpp
+++ /dev/null
@@ -1,34 +0,0 @@
-/*
- * Copyright 2010 Vicente J. Botet Escriba
- * Copyright 2015 Andrey Semashev
- *
- * Distributed under the Boost Software License, Version 1.0.
- * See http://www.boost.org/LICENSE_1_0.txt
- */
-
-#ifndef BOOST_WINAPI_GET_CURRENT_THREAD_ID_HPP_INCLUDED_
-#define BOOST_WINAPI_GET_CURRENT_THREAD_ID_HPP_INCLUDED_
-
-#include <boost/winapi/basic_types.hpp>
-#include <boost/winapi/detail/header.hpp>
-
-#ifdef BOOST_HAS_PRAGMA_ONCE
-#pragma once
-#endif
-
-// Windows CE define GetCurrentThreadId as an inline function in kfuncs.h
-#if !defined( BOOST_USE_WINDOWS_H ) && !defined( UNDER_CE )
-extern "C" {
-BOOST_WINAPI_IMPORT boost::winapi::DWORD_ BOOST_WINAPI_WINAPI_CC GetCurrentThreadId(BOOST_WINAPI_DETAIL_VOID);
-}
-#endif
-
-namespace boost {
-namespace winapi {
-using ::GetCurrentThreadId;
-}
-}
-
-#include <boost/winapi/detail/footer.hpp>
-
-#endif // BOOST_WINAPI_GET_CURRENT_THREAD_ID_HPP_INCLUDED_
diff --git a/src/boost/winapi/get_last_error.hpp b/src/boost/winapi/get_last_error.hpp
deleted file mode 100644
index a809c846..00000000
--- a/src/boost/winapi/get_last_error.hpp
+++ /dev/null
@@ -1,33 +0,0 @@
-/*
- * Copyright 2010 Vicente J. Botet Escriba
- * Copyright 2015 Andrey Semashev
- *
- * Distributed under the Boost Software License, Version 1.0.
- * See http://www.boost.org/LICENSE_1_0.txt
- */
-
-#ifndef BOOST_WINAPI_GET_LAST_ERROR_HPP_INCLUDED_
-#define BOOST_WINAPI_GET_LAST_ERROR_HPP_INCLUDED_
-
-#include <boost/winapi/basic_types.hpp>
-#include <boost/winapi/detail/header.hpp>
-
-#ifdef BOOST_HAS_PRAGMA_ONCE
-#pragma once
-#endif
-
-#if !defined( BOOST_USE_WINDOWS_H )
-extern "C" {
-BOOST_WINAPI_IMPORT_EXCEPT_WM boost::winapi::DWORD_ BOOST_WINAPI_WINAPI_CC GetLastError(BOOST_WINAPI_DETAIL_VOID);
-}
-#endif
-
-namespace boost {
-namespace winapi {
-using ::GetLastError;
-}
-}
-
-#include <boost/winapi/detail/footer.hpp>
-
-#endif // BOOST_WINAPI_GET_LAST_ERROR_HPP_INCLUDED_
diff --git a/src/boost/winapi/get_proc_address.hpp b/src/boost/winapi/get_proc_address.hpp
deleted file mode 100644
index 2240930c..00000000
--- a/src/boost/winapi/get_proc_address.hpp
+++ /dev/null
@@ -1,81 +0,0 @@
-/*
- * Copyright 2020 Andrey Semashev
- *
- * Distributed under the Boost Software License, Version 1.0.
- * See http://www.boost.org/LICENSE_1_0.txt
- */
-
-#ifndef BOOST_WINAPI_GET_PROC_ADDRESS_HPP_INCLUDED_
-#define BOOST_WINAPI_GET_PROC_ADDRESS_HPP_INCLUDED_
-
-#include <boost/winapi/basic_types.hpp>
-
-#ifdef BOOST_HAS_PRAGMA_ONCE
-#pragma once
-#endif
-
-#if BOOST_WINAPI_PARTITION_DESKTOP || BOOST_WINAPI_PARTITION_SYSTEM
-
-#include <boost/winapi/detail/header.hpp>
-
-#if !defined(BOOST_USE_WINDOWS_H)
-namespace boost { namespace winapi {
-#ifdef _WIN64
-typedef INT_PTR_ (BOOST_WINAPI_WINAPI_CC *FARPROC_)();
-typedef INT_PTR_ (BOOST_WINAPI_WINAPI_CC *NEARPROC_)();
-typedef INT_PTR_ (BOOST_WINAPI_WINAPI_CC *PROC_)();
-#else
-typedef int (BOOST_WINAPI_WINAPI_CC *FARPROC_)();
-typedef int (BOOST_WINAPI_WINAPI_CC *NEARPROC_)();
-typedef int (BOOST_WINAPI_WINAPI_CC *PROC_)();
-#endif // _WIN64
-}} // namespace boost::winapi
-
-extern "C" {
-#if !defined(UNDER_CE)
-BOOST_WINAPI_IMPORT boost::winapi::FARPROC_ BOOST_WINAPI_WINAPI_CC
-GetProcAddress(boost::winapi::HMODULE_ hModule, boost::winapi::LPCSTR_ lpProcName);
-#else
-// On Windows CE there are two functions: GetProcAddressA (since Windows CE 3.0) and GetProcAddressW.
-// GetProcAddress is a macro that is _always_ defined to GetProcAddressW.
-BOOST_WINAPI_IMPORT_EXCEPT_WM boost::winapi::FARPROC_ BOOST_WINAPI_WINAPI_CC
-GetProcAddressA(boost::winapi::HMODULE_ hModule, boost::winapi::LPCSTR_ lpProcName);
-BOOST_WINAPI_IMPORT_EXCEPT_WM boost::winapi::FARPROC_ BOOST_WINAPI_WINAPI_CC
-GetProcAddressW(boost::winapi::HMODULE_ hModule, boost::winapi::LPCWSTR_ lpProcName);
-#endif
-} // extern "C"
-#endif // !defined(BOOST_USE_WINDOWS_H)
-
-namespace boost {
-namespace winapi {
-
-#if defined(BOOST_USE_WINDOWS_H)
-typedef ::FARPROC FARPROC_;
-typedef ::NEARPROC NEARPROC_;
-typedef ::PROC PROC_;
-#endif // defined(BOOST_USE_WINDOWS_H)
-
-#if !defined(UNDER_CE)
-// For backward compatibility, don't use directly. Use get_proc_address instead.
-using ::GetProcAddress;
-#else
-using ::GetProcAddressA;
-using ::GetProcAddressW;
-#endif
-
-BOOST_FORCEINLINE FARPROC_ get_proc_address(HMODULE_ hModule, LPCSTR_ lpProcName)
-{
-#if !defined(UNDER_CE)
-    return ::GetProcAddress(hModule, lpProcName);
-#else
-    return ::GetProcAddressA(hModule, lpProcName);
-#endif
-}
-
-} // namespace winapi
-} // namespace boost
-
-#include <boost/winapi/detail/footer.hpp>
-
-#endif // BOOST_WINAPI_PARTITION_DESKTOP || BOOST_WINAPI_PARTITION_SYSTEM
-#endif // BOOST_WINAPI_GET_PROC_ADDRESS_HPP_INCLUDED_
diff --git a/src/boost/winapi/get_process_times.hpp b/src/boost/winapi/get_process_times.hpp
deleted file mode 100644
index 91de1451..00000000
--- a/src/boost/winapi/get_process_times.hpp
+++ /dev/null
@@ -1,63 +0,0 @@
-/*
- * Copyright 2010 Vicente J. Botet Escriba
- *
- * Distributed under the Boost Software License, Version 1.0.
- * See http://www.boost.org/LICENSE_1_0.txt
- */
-
-#ifndef BOOST_WINAPI_GET_PROCESS_TIMES_HPP_INCLUDED_
-#define BOOST_WINAPI_GET_PROCESS_TIMES_HPP_INCLUDED_
-
-#include <boost/winapi/config.hpp>
-
-#ifdef BOOST_HAS_PRAGMA_ONCE
-#pragma once
-#endif
-
-// Windows CE does not define GetProcessTimes
-#if !defined( UNDER_CE )
-
-#if BOOST_WINAPI_PARTITION_APP_SYSTEM
-
-#include <boost/winapi/basic_types.hpp>
-#include <boost/winapi/time.hpp>
-#include <boost/winapi/detail/header.hpp>
-
-#if !defined( BOOST_USE_WINDOWS_H )
-extern "C" {
-BOOST_WINAPI_IMPORT boost::winapi::BOOL_ BOOST_WINAPI_WINAPI_CC
-GetProcessTimes(
-    boost::winapi::HANDLE_ hProcess,
-    ::_FILETIME* lpCreationTime,
-    ::_FILETIME* lpExitTime,
-    ::_FILETIME* lpKernelTime,
-    ::_FILETIME* lpUserTime);
-}
-#endif
-
-namespace boost {
-namespace winapi {
-
-BOOST_FORCEINLINE BOOL_ GetProcessTimes(
-    HANDLE_ hProcess,
-    LPFILETIME_ lpCreationTime,
-    LPFILETIME_ lpExitTime,
-    LPFILETIME_ lpKernelTime,
-    LPFILETIME_ lpUserTime)
-{
-    return ::GetProcessTimes(
-        hProcess,
-        reinterpret_cast< ::_FILETIME* >(lpCreationTime),
-        reinterpret_cast< ::_FILETIME* >(lpExitTime),
-        reinterpret_cast< ::_FILETIME* >(lpKernelTime),
-        reinterpret_cast< ::_FILETIME* >(lpUserTime));
-}
-
-}
-}
-
-#include <boost/winapi/detail/footer.hpp>
-
-#endif // BOOST_WINAPI_PARTITION_APP_SYSTEM
-#endif // !defined( UNDER_CE )
-#endif // BOOST_WINAPI_GET_PROCESS_TIMES_HPP_INCLUDED_
diff --git a/src/boost/winapi/get_system_directory.hpp b/src/boost/winapi/get_system_directory.hpp
deleted file mode 100644
index 636808a9..00000000
--- a/src/boost/winapi/get_system_directory.hpp
+++ /dev/null
@@ -1,64 +0,0 @@
-/*
- * Copyright 2016 Klemens D. Morgenstern
- *
- * Distributed under the Boost Software License, Version 1.0.
- * See http://www.boost.org/LICENSE_1_0.txt
- */
-
-#ifndef BOOST_WINAPI_GET_SYSTEM_DIRECTORY_HPP_INCLUDED_
-#define BOOST_WINAPI_GET_SYSTEM_DIRECTORY_HPP_INCLUDED_
-
-#include <boost/winapi/basic_types.hpp>
-
-#ifdef BOOST_HAS_PRAGMA_ONCE
-#pragma once
-#endif
-
-#if BOOST_WINAPI_PARTITION_DESKTOP
-
-#include <boost/winapi/detail/header.hpp>
-
-#if !defined( BOOST_USE_WINDOWS_H )
-extern "C" {
-#if !defined( BOOST_NO_ANSI_APIS )
-BOOST_WINAPI_IMPORT boost::winapi::UINT_ BOOST_WINAPI_WINAPI_CC
-GetSystemDirectoryA(
-    boost::winapi::LPSTR_  lpBuffer,
-    boost::winapi::UINT_   uSize);
-#endif
-
-BOOST_WINAPI_IMPORT boost::winapi::UINT_ BOOST_WINAPI_WINAPI_CC
-GetSystemDirectoryW(
-    boost::winapi::LPWSTR_ lpBuffer,
-    boost::winapi::UINT_   uSize);
-} // extern "C"
-#endif
-
-namespace boost {
-namespace winapi {
-
-#if !defined( BOOST_NO_ANSI_APIS )
-using ::GetSystemDirectoryA;
-#endif
-using ::GetSystemDirectoryW;
-
-#if !defined( BOOST_NO_ANSI_APIS )
-BOOST_FORCEINLINE UINT_ get_system_directory(LPSTR_ lpBuffer,  UINT_ uSize)
-{
-    return ::GetSystemDirectoryA(lpBuffer, uSize);
-}
-#endif
-
-BOOST_FORCEINLINE UINT_ get_system_directory(LPWSTR_ lpBuffer,  UINT_ uSize)
-{
-    return ::GetSystemDirectoryW(lpBuffer, uSize);
-}
-
-}
-}
-
-#include <boost/winapi/detail/footer.hpp>
-
-#endif // BOOST_WINAPI_PARTITION_DESKTOP
-
-#endif // BOOST_WINAPI_GET_SYSTEM_DIRECTORY_HPP_INCLUDED_
diff --git a/src/boost/winapi/handles.hpp b/src/boost/winapi/handles.hpp
deleted file mode 100644
index 0f19658d..00000000
--- a/src/boost/winapi/handles.hpp
+++ /dev/null
@@ -1,75 +0,0 @@
-/*
- * Copyright 2010 Vicente J. Botet Escriba
- * Copyright 2015 Andrey Semashev
- *
- * Distributed under the Boost Software License, Version 1.0.
- * See http://www.boost.org/LICENSE_1_0.txt
- */
-
-#ifndef BOOST_WINAPI_HANDLES_HPP_INCLUDED_
-#define BOOST_WINAPI_HANDLES_HPP_INCLUDED_
-
-#include <boost/winapi/basic_types.hpp>
-#include <boost/winapi/detail/header.hpp>
-
-#ifdef BOOST_HAS_PRAGMA_ONCE
-#pragma once
-#endif
-
-#if !defined( BOOST_USE_WINDOWS_H )
-extern "C" {
-BOOST_WINAPI_IMPORT_EXCEPT_WM boost::winapi::BOOL_ BOOST_WINAPI_WINAPI_CC
-CloseHandle(boost::winapi::HANDLE_ handle);
-
-BOOST_WINAPI_IMPORT_EXCEPT_WM boost::winapi::BOOL_ BOOST_WINAPI_WINAPI_CC
-DuplicateHandle(
-    boost::winapi::HANDLE_ hSourceProcessHandle,
-    boost::winapi::HANDLE_ hSourceHandle,
-    boost::winapi::HANDLE_ hTargetProcessHandle,
-    boost::winapi::HANDLE_* lpTargetHandle,
-    boost::winapi::DWORD_ dwDesiredAccess,
-    boost::winapi::BOOL_ bInheritHandle,
-    boost::winapi::DWORD_ dwOptions);
-
-#if BOOST_USE_WINAPI_VERSION >= BOOST_WINAPI_VERSION_WIN10 && (BOOST_WINAPI_PARTITION_APP || BOOST_WINAPI_PARTITION_SYSTEM)
-BOOST_WINAPI_IMPORT boost::winapi::BOOL_ BOOST_WINAPI_WINAPI_CC
-CompareObjectHandles(
-    boost::winapi::HANDLE_ hFirstObjectHandle,
-    boost::winapi::HANDLE_ hSecondObjectHandle);
-#endif
-} // extern "C"
-#endif
-
-namespace boost {
-namespace winapi {
-
-using ::CloseHandle;
-using ::DuplicateHandle;
-
-#if BOOST_USE_WINAPI_VERSION >= BOOST_WINAPI_VERSION_WIN10 && (BOOST_WINAPI_PARTITION_APP || BOOST_WINAPI_PARTITION_SYSTEM)
-using ::CompareObjectHandles;
-#endif
-
-// Note: MSVC-14.1 does not interpret INVALID_HANDLE_VALUE_ initializer as a constant expression
-#if defined( BOOST_USE_WINDOWS_H )
-BOOST_CONSTEXPR_OR_CONST DWORD_ DUPLICATE_CLOSE_SOURCE_ = DUPLICATE_CLOSE_SOURCE;
-BOOST_CONSTEXPR_OR_CONST DWORD_ DUPLICATE_SAME_ACCESS_ = DUPLICATE_SAME_ACCESS;
-const HANDLE_ INVALID_HANDLE_VALUE_ = INVALID_HANDLE_VALUE;
-#else
-BOOST_CONSTEXPR_OR_CONST DWORD_ DUPLICATE_CLOSE_SOURCE_ = 1;
-BOOST_CONSTEXPR_OR_CONST DWORD_ DUPLICATE_SAME_ACCESS_ = 2;
-const HANDLE_ INVALID_HANDLE_VALUE_ = (HANDLE_)(-1);
-#endif
-
-BOOST_CONSTEXPR_OR_CONST DWORD_ duplicate_close_source = DUPLICATE_CLOSE_SOURCE_;
-BOOST_CONSTEXPR_OR_CONST DWORD_ duplicate_same_access = DUPLICATE_SAME_ACCESS_;
-// Note: The "unused" attribute here should not be necessary because the variable is a constant.
-//       However, MinGW gcc 5.3 spams warnings about this particular constant.
-const HANDLE_ invalid_handle_value BOOST_ATTRIBUTE_UNUSED = INVALID_HANDLE_VALUE_;
-
-}
-}
-
-#include <boost/winapi/detail/footer.hpp>
-
-#endif // BOOST_WINAPI_HANDLES_HPP_INCLUDED_
diff --git a/src/boost/winapi/limits.hpp b/src/boost/winapi/limits.hpp
deleted file mode 100644
index 0a628d70..00000000
--- a/src/boost/winapi/limits.hpp
+++ /dev/null
@@ -1,52 +0,0 @@
-/*
- * Copyright 2016 Andrey Semashev
- *
- * Distributed under the Boost Software License, Version 1.0.
- * See http://www.boost.org/LICENSE_1_0.txt
- */
-
-#ifndef BOOST_WINAPI_LIMITS_HPP_INCLUDED_
-#define BOOST_WINAPI_LIMITS_HPP_INCLUDED_
-
-#include <boost/winapi/basic_types.hpp>
-#include <boost/winapi/detail/header.hpp>
-
-#ifdef BOOST_HAS_PRAGMA_ONCE
-#pragma once
-#endif
-
-namespace boost {
-namespace winapi {
-
-#if defined( BOOST_USE_WINDOWS_H )
-
-BOOST_CONSTEXPR_OR_CONST DWORD_ MAX_PATH_ = MAX_PATH;
-
-#else
-
-BOOST_CONSTEXPR_OR_CONST DWORD_ MAX_PATH_ = 260;
-
-#endif
-
-#if defined( BOOST_USE_WINDOWS_H ) && !defined( BOOST_WINAPI_IS_MINGW )
-
-BOOST_CONSTEXPR_OR_CONST DWORD_ UNICODE_STRING_MAX_BYTES_ = UNICODE_STRING_MAX_BYTES;
-BOOST_CONSTEXPR_OR_CONST DWORD_ UNICODE_STRING_MAX_CHARS_ = UNICODE_STRING_MAX_CHARS;
-
-#else
-
-BOOST_CONSTEXPR_OR_CONST DWORD_ UNICODE_STRING_MAX_BYTES_ = 65534;
-BOOST_CONSTEXPR_OR_CONST DWORD_ UNICODE_STRING_MAX_CHARS_ = 32767;
-
-#endif
-
-BOOST_CONSTEXPR_OR_CONST DWORD_ max_path = MAX_PATH_;
-BOOST_CONSTEXPR_OR_CONST DWORD_ unicode_string_max_bytes = UNICODE_STRING_MAX_BYTES_;
-BOOST_CONSTEXPR_OR_CONST DWORD_ unicode_string_max_chars = UNICODE_STRING_MAX_CHARS_;
-
-}
-}
-
-#include <boost/winapi/detail/footer.hpp>
-
-#endif // BOOST_WINAPI_LIMITS_HPP_INCLUDED_
diff --git a/src/boost/winapi/local_memory.hpp b/src/boost/winapi/local_memory.hpp
deleted file mode 100644
index baa5552c..00000000
--- a/src/boost/winapi/local_memory.hpp
+++ /dev/null
@@ -1,71 +0,0 @@
-/*
- * Copyright 2010 Vicente J. Botet Escriba
- * Copyright 2015 Andrey Semashev
- *
- * Distributed under the Boost Software License, Version 1.0.
- * See http://www.boost.org/LICENSE_1_0.txt
- */
-
-#ifndef BOOST_WINAPI_LOCAL_MEMORY_HPP_INCLUDED_
-#define BOOST_WINAPI_LOCAL_MEMORY_HPP_INCLUDED_
-
-#include <boost/winapi/basic_types.hpp>
-
-#ifdef BOOST_HAS_PRAGMA_ONCE
-#pragma once
-#endif
-
-#if BOOST_WINAPI_PARTITION_APP_SYSTEM
-
-#include <boost/winapi/detail/header.hpp>
-
-#if !defined( BOOST_USE_WINDOWS_H )
-namespace boost { namespace winapi {
-typedef HANDLE_ HLOCAL_;
-}}
-
-extern "C" {
-
-#if defined (_WIN32_WCE )
-BOOST_WINAPI_IMPORT_EXCEPT_WM boost::winapi::HLOCAL_ BOOST_WINAPI_WINAPI_CC
-LocalAlloc(
-    boost::winapi::UINT_ uFlags,
-    boost::winapi::UINT_ uBytes);
-
-BOOST_WINAPI_IMPORT_EXCEPT_WM boost::winapi::HLOCAL_ BOOST_WINAPI_WINAPI_CC
-LocalReAlloc(
-    boost::winapi::HLOCAL_ hMem,
-    boost::winapi::UINT_ uBytes,
-    boost::winapi::UINT_ uFlags);
-#else
-BOOST_WINAPI_IMPORT_EXCEPT_WM boost::winapi::HLOCAL_ BOOST_WINAPI_WINAPI_CC
-LocalAlloc(
-    boost::winapi::UINT_ uFlags,
-    boost::winapi::SIZE_T_ uBytes);
-
-BOOST_WINAPI_IMPORT_EXCEPT_WM boost::winapi::HLOCAL_ BOOST_WINAPI_WINAPI_CC
-LocalReAlloc(
-    boost::winapi::HLOCAL_ hMem,
-    boost::winapi::SIZE_T_ uBytes,
-    boost::winapi::UINT_ uFlags);
-#endif
-
-BOOST_WINAPI_IMPORT_EXCEPT_WM boost::winapi::HLOCAL_ BOOST_WINAPI_WINAPI_CC LocalFree(boost::winapi::HLOCAL_ hMem);
-} // extern "C"
-#endif
-
-namespace boost {
-namespace winapi {
-#if defined( BOOST_USE_WINDOWS_H )
-typedef ::HLOCAL HLOCAL_;
-#endif
-using ::LocalAlloc;
-using ::LocalReAlloc;
-using ::LocalFree;
-}
-}
-
-#include <boost/winapi/detail/footer.hpp>
-
-#endif // BOOST_WINAPI_PARTITION_APP_SYSTEM
-#endif // BOOST_WINAPI_LOCAL_MEMORY_HPP_INCLUDED_
diff --git a/src/boost/winapi/mutex.hpp b/src/boost/winapi/mutex.hpp
deleted file mode 100644
index c708c543..00000000
--- a/src/boost/winapi/mutex.hpp
+++ /dev/null
@@ -1,185 +0,0 @@
-/*
- * Copyright 2010 Vicente J. Botet Escriba
- * Copyright 2015, 2017 Andrey Semashev
- *
- * Distributed under the Boost Software License, Version 1.0.
- * See http://www.boost.org/LICENSE_1_0.txt
- */
-
-#ifndef BOOST_WINAPI_MUTEX_HPP_INCLUDED_
-#define BOOST_WINAPI_MUTEX_HPP_INCLUDED_
-
-#include <boost/winapi/basic_types.hpp>
-#include <boost/winapi/detail/header.hpp>
-
-#ifdef BOOST_HAS_PRAGMA_ONCE
-#pragma once
-#endif
-
-#if !defined( BOOST_USE_WINDOWS_H ) && BOOST_WINAPI_PARTITION_APP_SYSTEM
-extern "C" {
-#if !defined( BOOST_NO_ANSI_APIS )
-BOOST_WINAPI_IMPORT boost::winapi::HANDLE_ BOOST_WINAPI_WINAPI_CC
-CreateMutexA(
-    ::_SECURITY_ATTRIBUTES* lpMutexAttributes,
-    boost::winapi::BOOL_ bInitialOwner,
-    boost::winapi::LPCSTR_ lpName);
-#endif
-
-BOOST_WINAPI_IMPORT_EXCEPT_WM boost::winapi::HANDLE_ BOOST_WINAPI_WINAPI_CC
-CreateMutexW(
-    ::_SECURITY_ATTRIBUTES* lpMutexAttributes,
-    boost::winapi::BOOL_ bInitialOwner,
-    boost::winapi::LPCWSTR_ lpName);
-} // extern "C"
-#endif // !defined( BOOST_USE_WINDOWS_H ) && BOOST_WINAPI_PARTITION_APP_SYSTEM
-
-#if !defined( BOOST_USE_WINDOWS_H )
-extern "C" {
-#if !defined( BOOST_NO_ANSI_APIS )
-#if BOOST_USE_WINAPI_VERSION >= BOOST_WINAPI_VERSION_WIN6
-BOOST_WINAPI_IMPORT boost::winapi::HANDLE_ BOOST_WINAPI_WINAPI_CC
-CreateMutexExA(
-    ::_SECURITY_ATTRIBUTES* lpMutexAttributes,
-    boost::winapi::LPCSTR_ lpName,
-    boost::winapi::DWORD_ dwFlags,
-    boost::winapi::DWORD_ dwDesiredAccess);
-#endif
-
-BOOST_WINAPI_IMPORT boost::winapi::HANDLE_ BOOST_WINAPI_WINAPI_CC
-OpenMutexA(
-    boost::winapi::DWORD_ dwDesiredAccess,
-    boost::winapi::BOOL_ bInheritHandle,
-    boost::winapi::LPCSTR_ lpName);
-#endif // !defined( BOOST_NO_ANSI_APIS )
-
-#if BOOST_USE_WINAPI_VERSION >= BOOST_WINAPI_VERSION_WIN6
-BOOST_WINAPI_IMPORT boost::winapi::HANDLE_ BOOST_WINAPI_WINAPI_CC
-CreateMutexExW(
-    ::_SECURITY_ATTRIBUTES* lpMutexAttributes,
-    boost::winapi::LPCWSTR_ lpName,
-    boost::winapi::DWORD_ dwFlags,
-    boost::winapi::DWORD_ dwDesiredAccess);
-#endif
-
-BOOST_WINAPI_IMPORT boost::winapi::HANDLE_ BOOST_WINAPI_WINAPI_CC
-OpenMutexW(
-    boost::winapi::DWORD_ dwDesiredAccess,
-    boost::winapi::BOOL_ bInheritHandle,
-    boost::winapi::LPCWSTR_ lpName);
-
-BOOST_WINAPI_IMPORT_EXCEPT_WM boost::winapi::BOOL_ BOOST_WINAPI_WINAPI_CC
-ReleaseMutex(boost::winapi::HANDLE_ hMutex);
-} // extern "C"
-#endif
-
-namespace boost {
-namespace winapi {
-
-#if !defined( BOOST_NO_ANSI_APIS )
-using ::OpenMutexA;
-#endif
-using ::OpenMutexW;
-using ::ReleaseMutex;
-
-#if defined( BOOST_USE_WINDOWS_H )
-
-BOOST_CONSTEXPR_OR_CONST DWORD_ MUTEX_ALL_ACCESS_ = MUTEX_ALL_ACCESS;
-BOOST_CONSTEXPR_OR_CONST DWORD_ MUTEX_MODIFY_STATE_ = MUTEX_MODIFY_STATE;
-#if BOOST_USE_WINAPI_VERSION >= BOOST_WINAPI_VERSION_WIN6
-BOOST_CONSTEXPR_OR_CONST DWORD_ CREATE_MUTEX_INITIAL_OWNER_ = CREATE_MUTEX_INITIAL_OWNER;
-#endif
-
-#else // defined( BOOST_USE_WINDOWS_H )
-
-BOOST_CONSTEXPR_OR_CONST DWORD_ MUTEX_ALL_ACCESS_ = 0x001F0001;
-BOOST_CONSTEXPR_OR_CONST DWORD_ MUTEX_MODIFY_STATE_ = 0x00000001;
-#if BOOST_USE_WINAPI_VERSION >= BOOST_WINAPI_VERSION_WIN6
-BOOST_CONSTEXPR_OR_CONST DWORD_ CREATE_MUTEX_INITIAL_OWNER_ = 0x00000001;
-#endif
-
-#endif // defined( BOOST_USE_WINDOWS_H )
-
-BOOST_CONSTEXPR_OR_CONST DWORD_ mutex_all_access = MUTEX_ALL_ACCESS_;
-BOOST_CONSTEXPR_OR_CONST DWORD_ mutex_modify_state = MUTEX_MODIFY_STATE_;
-#if BOOST_USE_WINAPI_VERSION >= BOOST_WINAPI_VERSION_WIN6
-BOOST_CONSTEXPR_OR_CONST DWORD_ create_mutex_initial_owner = CREATE_MUTEX_INITIAL_OWNER_;
-#endif
-
-#if !defined( BOOST_NO_ANSI_APIS )
-BOOST_FORCEINLINE HANDLE_ CreateMutexA(SECURITY_ATTRIBUTES_* lpMutexAttributes, BOOL_ bInitialOwner, LPCSTR_ lpName)
-{
-#if !BOOST_WINAPI_PARTITION_APP_SYSTEM && BOOST_USE_WINAPI_VERSION >= BOOST_WINAPI_VERSION_WIN6
-    const DWORD_ flags = bInitialOwner ? create_mutex_initial_owner : 0u;
-    return ::CreateMutexExA(reinterpret_cast< ::_SECURITY_ATTRIBUTES* >(lpMutexAttributes), lpName, flags, mutex_all_access);
-#else
-    return ::CreateMutexA(reinterpret_cast< ::_SECURITY_ATTRIBUTES* >(lpMutexAttributes), bInitialOwner, lpName);
-#endif
-}
-
-#if BOOST_USE_WINAPI_VERSION >= BOOST_WINAPI_VERSION_WIN6
-BOOST_FORCEINLINE HANDLE_ CreateMutexExA(
-    SECURITY_ATTRIBUTES_* lpMutexAttributes,
-    LPCSTR_ lpName,
-    DWORD_ dwFlags,
-    DWORD_ dwDesiredAccess)
-{
-    return ::CreateMutexExA(reinterpret_cast< ::_SECURITY_ATTRIBUTES* >(lpMutexAttributes), lpName, dwFlags, dwDesiredAccess);
-}
-#endif
-#endif
-
-BOOST_FORCEINLINE HANDLE_ CreateMutexW(SECURITY_ATTRIBUTES_* lpMutexAttributes, BOOL_ bInitialOwner, LPCWSTR_ lpName)
-{
-#if !BOOST_WINAPI_PARTITION_APP_SYSTEM && BOOST_USE_WINAPI_VERSION >= BOOST_WINAPI_VERSION_WIN6
-    const DWORD_ flags = bInitialOwner ? create_mutex_initial_owner : 0u;
-    return ::CreateMutexExW(reinterpret_cast< ::_SECURITY_ATTRIBUTES* >(lpMutexAttributes), lpName, flags, mutex_all_access);
-#else
-    return ::CreateMutexW(reinterpret_cast< ::_SECURITY_ATTRIBUTES* >(lpMutexAttributes), bInitialOwner, lpName);
-#endif
-}
-
-#if BOOST_USE_WINAPI_VERSION >= BOOST_WINAPI_VERSION_WIN6
-BOOST_FORCEINLINE HANDLE_ CreateMutexExW(
-    SECURITY_ATTRIBUTES_* lpMutexAttributes,
-    LPCWSTR_ lpName,
-    DWORD_ dwFlags,
-    DWORD_ dwDesiredAccess)
-{
-    return ::CreateMutexExW(reinterpret_cast< ::_SECURITY_ATTRIBUTES* >(lpMutexAttributes), lpName, dwFlags, dwDesiredAccess);
-}
-#endif
-
-#if !defined( BOOST_NO_ANSI_APIS )
-BOOST_FORCEINLINE HANDLE_ create_mutex(SECURITY_ATTRIBUTES_* lpAttributes, BOOL_ bInitialOwner, LPCSTR_ lpName)
-{
-    return winapi::CreateMutexA(lpAttributes, bInitialOwner, lpName);
-}
-
-BOOST_FORCEINLINE HANDLE_ open_mutex(DWORD_ dwDesiredAccess, BOOL_ bInheritHandle, LPCSTR_ lpName)
-{
-    return ::OpenMutexA(dwDesiredAccess, bInheritHandle, lpName);
-}
-#endif
-
-BOOST_FORCEINLINE HANDLE_ create_mutex(SECURITY_ATTRIBUTES_* lpAttributes, BOOL_ bInitialOwner, LPCWSTR_ lpName)
-{
-    return winapi::CreateMutexW(lpAttributes, bInitialOwner, lpName);
-}
-
-BOOST_FORCEINLINE HANDLE_ open_mutex(DWORD_ dwDesiredAccess, BOOL_ bInheritHandle, LPCWSTR_ lpName)
-{
-    return ::OpenMutexW(dwDesiredAccess, bInheritHandle, lpName);
-}
-
-BOOST_FORCEINLINE HANDLE_ create_anonymous_mutex(SECURITY_ATTRIBUTES_* lpAttributes, BOOL_ bInitialOwner)
-{
-    return winapi::CreateMutexW(lpAttributes, bInitialOwner, 0);
-}
-
-}
-}
-
-#include <boost/winapi/detail/footer.hpp>
-
-#endif // BOOST_WINAPI_MUTEX_HPP_INCLUDED_
diff --git a/src/boost/winapi/overlapped.hpp b/src/boost/winapi/overlapped.hpp
deleted file mode 100644
index 8027b356..00000000
--- a/src/boost/winapi/overlapped.hpp
+++ /dev/null
@@ -1,45 +0,0 @@
-/*
- * Copyright 2016 Klemens D. Morgenstern
- *
- * Distributed under the Boost Software License, Version 1.0.
- * See http://www.boost.org/LICENSE_1_0.txt
- */
-
-#ifndef BOOST_WINAPI_OVERLAPPED_HPP_INCLUDED_
-#define BOOST_WINAPI_OVERLAPPED_HPP_INCLUDED_
-
-#include <boost/winapi/basic_types.hpp>
-#include <boost/winapi/detail/header.hpp>
-
-#ifdef BOOST_HAS_PRAGMA_ONCE
-#pragma once
-#endif
-
-#if !defined( BOOST_USE_WINDOWS_H )
-extern "C" {
-struct _OVERLAPPED;
-}
-#endif
-
-namespace boost {
-namespace winapi {
-
-typedef struct BOOST_MAY_ALIAS _OVERLAPPED {
-    ULONG_PTR_ Internal;
-    ULONG_PTR_ InternalHigh;
-    union {
-        BOOST_WINAPI_DETAIL_EXTENSION struct {
-            DWORD_ Offset;
-            DWORD_ OffsetHigh;
-        };
-        PVOID_  Pointer;
-    };
-    HANDLE_    hEvent;
-} OVERLAPPED_, *LPOVERLAPPED_;
-
-} // namespace winapi
-} // namespace boost
-
-#include <boost/winapi/detail/footer.hpp>
-
-#endif // BOOST_WINAPI_OVERLAPPED_HPP_INCLUDED_
diff --git a/src/boost/winapi/security.hpp b/src/boost/winapi/security.hpp
deleted file mode 100644
index 80a2d952..00000000
--- a/src/boost/winapi/security.hpp
+++ /dev/null
@@ -1,89 +0,0 @@
-/*
- * Copyright 2010 Vicente J. Botet Escriba
- * Copyright 2015 Andrey Semashev
- *
- * Distributed under the Boost Software License, Version 1.0.
- * See http://www.boost.org/LICENSE_1_0.txt
- */
-
-#ifndef BOOST_WINAPI_SECURITY_HPP_INCLUDED_
-#define BOOST_WINAPI_SECURITY_HPP_INCLUDED_
-
-#include <boost/winapi/basic_types.hpp>
-
-#ifdef BOOST_HAS_PRAGMA_ONCE
-#pragma once
-#endif
-
-#if BOOST_WINAPI_PARTITION_APP_SYSTEM
-
-#include <boost/winapi/detail/header.hpp>
-
-#if !defined( BOOST_USE_WINDOWS_H )
-extern "C" {
-struct _ACL;
-struct _SECURITY_DESCRIPTOR;
-#if defined( BOOST_WINAPI_IS_MINGW )
-typedef _SECURITY_DESCRIPTOR *PSECURITY_DESCRIPTOR;
-#else
-typedef boost::winapi::PVOID_ PSECURITY_DESCRIPTOR;
-#endif
-
-BOOST_WINAPI_IMPORT boost::winapi::BOOL_ BOOST_WINAPI_WINAPI_CC
-InitializeSecurityDescriptor(
-    PSECURITY_DESCRIPTOR pSecurityDescriptor,
-    boost::winapi::DWORD_ dwRevision);
-BOOST_WINAPI_IMPORT boost::winapi::BOOL_ BOOST_WINAPI_WINAPI_CC
-SetSecurityDescriptorDacl(
-    PSECURITY_DESCRIPTOR pSecurityDescriptor,
-    boost::winapi::BOOL_ bDaclPresent,
-    ::_ACL* pDacl,
-    boost::winapi::BOOL_ bDaclDefaulted);
-}
-#endif
-
-namespace boost {
-namespace winapi {
-
-typedef PVOID_ PSID_;
-typedef WORD_ SECURITY_DESCRIPTOR_CONTROL_, *PSECURITY_DESCRIPTOR_CONTROL_;
-
-typedef struct BOOST_MAY_ALIAS _ACL {
-    BYTE_ AclRevision;
-    BYTE_ Sbz1;
-    WORD_ AclSize;
-    WORD_ AceCount;
-    WORD_ Sbz2;
-} ACL_, *PACL_;
-
-typedef struct BOOST_MAY_ALIAS _SECURITY_DESCRIPTOR {
-    BYTE_ Revision;
-    BYTE_ Sbz1;
-    SECURITY_DESCRIPTOR_CONTROL_ Control;
-    PSID_ Owner;
-    PSID_ Group;
-    PACL_ Sacl;
-    PACL_ Dacl;
-} SECURITY_DESCRIPTOR_, *PISECURITY_DESCRIPTOR_;
-
-// To abstract away the different ::PSECURITY_DESCRIPTOR on MinGW, we use PVOID_ universally here
-// and cast the pointers to ::PSECURITY_DESCRIPTOR in wrapper functions.
-typedef PVOID_ PSECURITY_DESCRIPTOR_;
-
-BOOST_FORCEINLINE BOOL_ InitializeSecurityDescriptor(PSECURITY_DESCRIPTOR_ pSecurityDescriptor, DWORD_ dwRevision)
-{
-    return ::InitializeSecurityDescriptor(reinterpret_cast< ::PSECURITY_DESCRIPTOR >(pSecurityDescriptor), dwRevision);
-}
-
-BOOST_FORCEINLINE BOOL_ SetSecurityDescriptorDacl(PSECURITY_DESCRIPTOR_ pSecurityDescriptor, BOOL_ bDaclPresent, PACL_ pDacl, BOOL_ bDaclDefaulted)
-{
-    return ::SetSecurityDescriptorDacl(reinterpret_cast< ::PSECURITY_DESCRIPTOR >(pSecurityDescriptor), bDaclPresent, reinterpret_cast< ::_ACL* >(pDacl), bDaclDefaulted);
-}
-
-}
-}
-
-#include <boost/winapi/detail/footer.hpp>
-
-#endif // BOOST_WINAPI_PARTITION_APP_SYSTEM
-#endif // BOOST_WINAPI_SECURITY_HPP_INCLUDED_
diff --git a/src/boost/winapi/semaphore.hpp b/src/boost/winapi/semaphore.hpp
deleted file mode 100644
index 0071f717..00000000
--- a/src/boost/winapi/semaphore.hpp
+++ /dev/null
@@ -1,189 +0,0 @@
-/*
- * Copyright 2010 Vicente J. Botet Escriba
- * Copyright 2015 Andrey Semashev
- *
- * Distributed under the Boost Software License, Version 1.0.
- * See http://www.boost.org/LICENSE_1_0.txt
- */
-
-#ifndef BOOST_WINAPI_SEMAPHORE_HPP_INCLUDED_
-#define BOOST_WINAPI_SEMAPHORE_HPP_INCLUDED_
-
-#include <boost/winapi/basic_types.hpp>
-#include <boost/winapi/detail/header.hpp>
-
-#ifdef BOOST_HAS_PRAGMA_ONCE
-#pragma once
-#endif
-
-#if !defined( BOOST_USE_WINDOWS_H )
-extern "C" {
-
-#if BOOST_WINAPI_PARTITION_APP_SYSTEM
-#if !defined( BOOST_NO_ANSI_APIS )
-
-BOOST_WINAPI_IMPORT boost::winapi::HANDLE_ BOOST_WINAPI_WINAPI_CC
-CreateSemaphoreA(
-    ::_SECURITY_ATTRIBUTES* lpSemaphoreAttributes,
-    boost::winapi::LONG_ lInitialCount,
-    boost::winapi::LONG_ lMaximumCount,
-    boost::winapi::LPCSTR_ lpName);
-
-#if BOOST_USE_WINAPI_VERSION >= BOOST_WINAPI_VERSION_WIN6
-BOOST_WINAPI_IMPORT boost::winapi::HANDLE_ BOOST_WINAPI_WINAPI_CC
-CreateSemaphoreExA(
-    ::_SECURITY_ATTRIBUTES* lpSemaphoreAttributes,
-    boost::winapi::LONG_ lInitialCount,
-    boost::winapi::LONG_ lMaximumCount,
-    boost::winapi::LPCSTR_ lpName,
-    boost::winapi::DWORD_ dwFlags,
-    boost::winapi::DWORD_ dwDesiredAccess);
-#endif
-
-#endif // !defined( BOOST_NO_ANSI_APIS )
-
-BOOST_WINAPI_IMPORT_EXCEPT_WM boost::winapi::HANDLE_ BOOST_WINAPI_WINAPI_CC
-CreateSemaphoreW(
-    ::_SECURITY_ATTRIBUTES* lpSemaphoreAttributes,
-    boost::winapi::LONG_ lInitialCount,
-    boost::winapi::LONG_ lMaximumCount,
-    boost::winapi::LPCWSTR_ lpName);
-
-#if BOOST_USE_WINAPI_VERSION >= BOOST_WINAPI_VERSION_WIN6
-BOOST_WINAPI_IMPORT_EXCEPT_WM boost::winapi::HANDLE_ BOOST_WINAPI_WINAPI_CC
-CreateSemaphoreExW(
-    ::_SECURITY_ATTRIBUTES* lpSemaphoreAttributes,
-    boost::winapi::LONG_ lInitialCount,
-    boost::winapi::LONG_ lMaximumCount,
-    boost::winapi::LPCWSTR_ lpName,
-    boost::winapi::DWORD_ dwFlags,
-    boost::winapi::DWORD_ dwDesiredAccess);
-#endif
-
-BOOST_WINAPI_IMPORT_EXCEPT_WM boost::winapi::BOOL_ BOOST_WINAPI_WINAPI_CC
-ReleaseSemaphore(
-    boost::winapi::HANDLE_ hSemaphore,
-    boost::winapi::LONG_ lReleaseCount,
-    boost::winapi::LPLONG_ lpPreviousCount);
-
-#endif // BOOST_WINAPI_PARTITION_APP_SYSTEM
-
-#if BOOST_WINAPI_PARTITION_DESKTOP_SYSTEM
-
-#if !defined( BOOST_NO_ANSI_APIS )
-BOOST_WINAPI_IMPORT boost::winapi::HANDLE_ BOOST_WINAPI_WINAPI_CC
-OpenSemaphoreA(
-    boost::winapi::DWORD_ dwDesiredAccess,
-    boost::winapi::BOOL_ bInheritHandle,
-    boost::winapi::LPCSTR_ lpName);
-#endif // !defined( BOOST_NO_ANSI_APIS )
-
-BOOST_WINAPI_IMPORT boost::winapi::HANDLE_ BOOST_WINAPI_WINAPI_CC
-OpenSemaphoreW(
-    boost::winapi::DWORD_ dwDesiredAccess,
-    boost::winapi::BOOL_ bInheritHandle,
-    boost::winapi::LPCWSTR_ lpName);
-
-#endif // BOOST_WINAPI_PARTITION_DESKTOP_SYSTEM
-
-} // extern "C"
-#endif // !defined( BOOST_USE_WINDOWS_H )
-
-namespace boost {
-namespace winapi {
-
-#if BOOST_WINAPI_PARTITION_APP_SYSTEM
-
-using ::ReleaseSemaphore;
-
-#if defined( BOOST_USE_WINDOWS_H )
-
-BOOST_CONSTEXPR_OR_CONST DWORD_ SEMAPHORE_ALL_ACCESS_ = SEMAPHORE_ALL_ACCESS;
-BOOST_CONSTEXPR_OR_CONST DWORD_ SEMAPHORE_MODIFY_STATE_ = SEMAPHORE_MODIFY_STATE;
-
-#else // defined( BOOST_USE_WINDOWS_H )
-
-BOOST_CONSTEXPR_OR_CONST DWORD_ SEMAPHORE_ALL_ACCESS_ = 0x001F0003;
-BOOST_CONSTEXPR_OR_CONST DWORD_ SEMAPHORE_MODIFY_STATE_ = 0x00000002;
-
-#endif // defined( BOOST_USE_WINDOWS_H )
-
-// Undocumented and not present in Windows SDK. Enables NtQuerySemaphore.
-// http://undocumented.ntinternals.net/index.html?page=UserMode%2FUndocumented%20Functions%2FNT%20Objects%2FEvent%2FNtQueryEvent.html
-BOOST_CONSTEXPR_OR_CONST DWORD_ SEMAPHORE_QUERY_STATE_ = 0x00000001;
-
-BOOST_CONSTEXPR_OR_CONST DWORD_ semaphore_all_access = SEMAPHORE_ALL_ACCESS_;
-BOOST_CONSTEXPR_OR_CONST DWORD_ semaphore_modify_state = SEMAPHORE_MODIFY_STATE_;
-
-
-#if !defined( BOOST_NO_ANSI_APIS )
-BOOST_FORCEINLINE HANDLE_ CreateSemaphoreA(SECURITY_ATTRIBUTES_* lpSemaphoreAttributes, LONG_ lInitialCount, LONG_ lMaximumCount, LPCSTR_ lpName)
-{
-    return ::CreateSemaphoreA(reinterpret_cast< ::_SECURITY_ATTRIBUTES* >(lpSemaphoreAttributes), lInitialCount, lMaximumCount, lpName);
-}
-
-#if BOOST_USE_WINAPI_VERSION >= BOOST_WINAPI_VERSION_WIN6
-BOOST_FORCEINLINE HANDLE_ CreateSemaphoreExA(SECURITY_ATTRIBUTES_* lpSemaphoreAttributes, LONG_ lInitialCount, LONG_ lMaximumCount, LPCSTR_ lpName, DWORD_ dwFlags, DWORD_ dwDesiredAccess)
-{
-    return ::CreateSemaphoreExA(reinterpret_cast< ::_SECURITY_ATTRIBUTES* >(lpSemaphoreAttributes), lInitialCount, lMaximumCount, lpName, dwFlags, dwDesiredAccess);
-}
-#endif
-#endif // !defined( BOOST_NO_ANSI_APIS )
-
-BOOST_FORCEINLINE HANDLE_ CreateSemaphoreW(SECURITY_ATTRIBUTES_* lpSemaphoreAttributes, LONG_ lInitialCount, LONG_ lMaximumCount, LPCWSTR_ lpName)
-{
-    return ::CreateSemaphoreW(reinterpret_cast< ::_SECURITY_ATTRIBUTES* >(lpSemaphoreAttributes), lInitialCount, lMaximumCount, lpName);
-}
-
-#if BOOST_USE_WINAPI_VERSION >= BOOST_WINAPI_VERSION_WIN6
-BOOST_FORCEINLINE HANDLE_ CreateSemaphoreExW(SECURITY_ATTRIBUTES_* lpSemaphoreAttributes, LONG_ lInitialCount, LONG_ lMaximumCount, LPCWSTR_ lpName, DWORD_ dwFlags, DWORD_ dwDesiredAccess)
-{
-    return ::CreateSemaphoreExW(reinterpret_cast< ::_SECURITY_ATTRIBUTES* >(lpSemaphoreAttributes), lInitialCount, lMaximumCount, lpName, dwFlags, dwDesiredAccess);
-}
-#endif
-
-#if !defined( BOOST_NO_ANSI_APIS )
-BOOST_FORCEINLINE HANDLE_ create_semaphore(SECURITY_ATTRIBUTES_* lpSemaphoreAttributes, LONG_ lInitialCount, LONG_ lMaximumCount, LPCSTR_ lpName)
-{
-    return winapi::CreateSemaphoreA(lpSemaphoreAttributes, lInitialCount, lMaximumCount, lpName);
-}
-#endif
-
-BOOST_FORCEINLINE HANDLE_ create_semaphore(SECURITY_ATTRIBUTES_* lpSemaphoreAttributes, LONG_ lInitialCount, LONG_ lMaximumCount, LPCWSTR_ lpName)
-{
-    return winapi::CreateSemaphoreW(lpSemaphoreAttributes, lInitialCount, lMaximumCount, lpName);
-}
-
-BOOST_FORCEINLINE HANDLE_ create_anonymous_semaphore(SECURITY_ATTRIBUTES_* lpSemaphoreAttributes, LONG_ lInitialCount, LONG_ lMaximumCount)
-{
-    return winapi::CreateSemaphoreW(lpSemaphoreAttributes, lInitialCount, lMaximumCount, 0);
-}
-
-#endif // BOOST_WINAPI_PARTITION_APP_SYSTEM
-
-#if BOOST_WINAPI_PARTITION_DESKTOP_SYSTEM
-
-#if !defined( BOOST_NO_ANSI_APIS )
-using ::OpenSemaphoreA;
-
-BOOST_FORCEINLINE HANDLE_ open_semaphore(DWORD_ dwDesiredAccess, BOOL_ bInheritHandle, LPCSTR_ lpName)
-{
-    return ::OpenSemaphoreA(dwDesiredAccess, bInheritHandle, lpName);
-}
-#endif // !defined( BOOST_NO_ANSI_APIS )
-
-using ::OpenSemaphoreW;
-
-BOOST_FORCEINLINE HANDLE_ open_semaphore(DWORD_ dwDesiredAccess, BOOL_ bInheritHandle, LPCWSTR_ lpName)
-{
-    return ::OpenSemaphoreW(dwDesiredAccess, bInheritHandle, lpName);
-}
-
-#endif // BOOST_WINAPI_PARTITION_DESKTOP_SYSTEM
-
-}
-}
-
-#include <boost/winapi/detail/footer.hpp>
-
-#endif // BOOST_WINAPI_SEMAPHORE_HPP_INCLUDED_
diff --git a/src/boost/winapi/system.hpp b/src/boost/winapi/system.hpp
deleted file mode 100644
index 9f8bddf5..00000000
--- a/src/boost/winapi/system.hpp
+++ /dev/null
@@ -1,80 +0,0 @@
-/*
- * Copyright 2010 Vicente J. Botet Escriba
- * Copyright (c) Microsoft Corporation 2014
- * Copyright 2015 Andrey Semashev
- *
- * Distributed under the Boost Software License, Version 1.0.
- * See http://www.boost.org/LICENSE_1_0.txt
- */
-
-#ifndef BOOST_WINAPI_SYSTEM_HPP_INCLUDED_
-#define BOOST_WINAPI_SYSTEM_HPP_INCLUDED_
-
-#include <boost/winapi/basic_types.hpp>
-#include <boost/winapi/detail/header.hpp>
-
-#ifdef BOOST_HAS_PRAGMA_ONCE
-#pragma once
-#endif
-
-#if !defined( BOOST_USE_WINDOWS_H )
-extern "C" {
-struct _SYSTEM_INFO;
-
-#if BOOST_WINAPI_PARTITION_APP_SYSTEM
-BOOST_WINAPI_IMPORT_EXCEPT_WM boost::winapi::VOID_ BOOST_WINAPI_WINAPI_CC
-GetSystemInfo(::_SYSTEM_INFO* lpSystemInfo);
-#endif
-
-#if BOOST_WINAPI_PARTITION_APP || BOOST_WINAPI_PARTITION_SYSTEM
-#if BOOST_USE_WINAPI_VERSION >= BOOST_WINAPI_VERSION_WINXP
-BOOST_WINAPI_IMPORT boost::winapi::VOID_ BOOST_WINAPI_WINAPI_CC
-GetNativeSystemInfo(::_SYSTEM_INFO* lpSystemInfo);
-#endif
-#endif
-}
-#endif
-
-namespace boost {
-namespace winapi {
-
-typedef struct BOOST_MAY_ALIAS _SYSTEM_INFO {
-    BOOST_WINAPI_DETAIL_EXTENSION union {
-        DWORD_ dwOemId;
-        BOOST_WINAPI_DETAIL_EXTENSION struct {
-            WORD_ wProcessorArchitecture;
-            WORD_ wReserved;
-        };
-    };
-    DWORD_ dwPageSize;
-    LPVOID_ lpMinimumApplicationAddress;
-    LPVOID_ lpMaximumApplicationAddress;
-    DWORD_PTR_ dwActiveProcessorMask;
-    DWORD_ dwNumberOfProcessors;
-    DWORD_ dwProcessorType;
-    DWORD_ dwAllocationGranularity;
-    WORD_ wProcessorLevel;
-    WORD_ wProcessorRevision;
-} SYSTEM_INFO_, *LPSYSTEM_INFO_;
-
-#if BOOST_WINAPI_PARTITION_APP_SYSTEM
-BOOST_FORCEINLINE VOID_ GetSystemInfo(LPSYSTEM_INFO_ lpSystemInfo)
-{
-    ::GetSystemInfo(reinterpret_cast< ::_SYSTEM_INFO* >(lpSystemInfo));
-}
-#endif
-
-#if BOOST_WINAPI_PARTITION_APP || BOOST_WINAPI_PARTITION_SYSTEM
-#if BOOST_USE_WINAPI_VERSION >= BOOST_WINAPI_VERSION_WINXP
-BOOST_FORCEINLINE VOID_ GetNativeSystemInfo(LPSYSTEM_INFO_ lpSystemInfo)
-{
-    ::GetNativeSystemInfo(reinterpret_cast< ::_SYSTEM_INFO* >(lpSystemInfo));
-}
-#endif
-#endif
-}
-}
-
-#include <boost/winapi/detail/footer.hpp>
-
-#endif // BOOST_WINAPI_SYSTEM_HPP_INCLUDED_
diff --git a/src/boost/winapi/thread.hpp b/src/boost/winapi/thread.hpp
deleted file mode 100644
index 45ceb9c9..00000000
--- a/src/boost/winapi/thread.hpp
+++ /dev/null
@@ -1,46 +0,0 @@
-/*
- * Copyright 2010 Vicente J. Botet Escriba
- * Copyright 2015 Andrey Semashev
- *
- * Distributed under the Boost Software License, Version 1.0.
- * See http://www.boost.org/LICENSE_1_0.txt
- */
-
-#ifndef BOOST_WINAPI_THREAD_HPP_INCLUDED_
-#define BOOST_WINAPI_THREAD_HPP_INCLUDED_
-
-#include <boost/winapi/basic_types.hpp>
-#include <boost/winapi/get_current_thread.hpp>
-#include <boost/winapi/get_current_thread_id.hpp>
-
-#ifdef BOOST_HAS_PRAGMA_ONCE
-#pragma once
-#endif
-
-#if BOOST_WINAPI_PARTITION_APP_SYSTEM
-
-#include <boost/winapi/detail/header.hpp>
-
-#if !defined( BOOST_USE_WINDOWS_H )
-extern "C" {
-BOOST_WINAPI_IMPORT boost::winapi::DWORD_ BOOST_WINAPI_WINAPI_CC
-SleepEx(
-    boost::winapi::DWORD_ dwMilliseconds,
-    boost::winapi::BOOL_ bAlertable);
-BOOST_WINAPI_IMPORT_EXCEPT_WM boost::winapi::VOID_ BOOST_WINAPI_WINAPI_CC Sleep(boost::winapi::DWORD_ dwMilliseconds);
-BOOST_WINAPI_IMPORT boost::winapi::BOOL_ BOOST_WINAPI_WINAPI_CC SwitchToThread(BOOST_WINAPI_DETAIL_VOID);
-} // extern "C"
-#endif
-
-namespace boost {
-namespace winapi {
-using ::SleepEx;
-using ::Sleep;
-using ::SwitchToThread;
-}
-}
-
-#include <boost/winapi/detail/footer.hpp>
-
-#endif // BOOST_WINAPI_PARTITION_APP_SYSTEM
-#endif // BOOST_WINAPI_THREAD_HPP_INCLUDED_
diff --git a/src/boost/winapi/time.hpp b/src/boost/winapi/time.hpp
deleted file mode 100644
index 59e969bf..00000000
--- a/src/boost/winapi/time.hpp
+++ /dev/null
@@ -1,143 +0,0 @@
-/*
- * Copyright 2010 Vicente J. Botet Escriba
- * Copyright (c) Microsoft Corporation 2014
- * Copyright 2015, 2017 Andrey Semashev
- *
- * Distributed under the Boost Software License, Version 1.0.
- * See http://www.boost.org/LICENSE_1_0.txt
- */
-
-#ifndef BOOST_WINAPI_TIME_HPP_INCLUDED_
-#define BOOST_WINAPI_TIME_HPP_INCLUDED_
-
-#include <boost/winapi/basic_types.hpp>
-#include <boost/winapi/detail/header.hpp>
-
-#ifdef BOOST_HAS_PRAGMA_ONCE
-#pragma once
-#endif
-
-#if !defined( BOOST_USE_WINDOWS_H )
-extern "C" {
-struct _FILETIME;
-struct _SYSTEMTIME;
-
-BOOST_WINAPI_IMPORT_EXCEPT_WM boost::winapi::VOID_ BOOST_WINAPI_WINAPI_CC
-GetSystemTime(::_SYSTEMTIME* lpSystemTime);
-
-#ifdef BOOST_HAS_GETSYSTEMTIMEASFILETIME  // Windows CE does not define GetSystemTimeAsFileTime
-BOOST_WINAPI_IMPORT boost::winapi::VOID_ BOOST_WINAPI_WINAPI_CC
-GetSystemTimeAsFileTime(::_FILETIME* lpSystemTimeAsFileTime);
-#endif
-
-BOOST_WINAPI_IMPORT_EXCEPT_WM boost::winapi::BOOL_ BOOST_WINAPI_WINAPI_CC
-SystemTimeToFileTime(
-    const ::_SYSTEMTIME* lpSystemTime,
-    ::_FILETIME* lpFileTime);
-
-BOOST_WINAPI_IMPORT_EXCEPT_WM boost::winapi::BOOL_ BOOST_WINAPI_WINAPI_CC
-FileTimeToSystemTime(
-    const ::_FILETIME* lpFileTime,
-    ::_SYSTEMTIME* lpSystemTime);
-
-#if BOOST_WINAPI_PARTITION_APP_SYSTEM
-
-BOOST_WINAPI_IMPORT_EXCEPT_WM boost::winapi::BOOL_ BOOST_WINAPI_WINAPI_CC
-FileTimeToLocalFileTime(
-    const ::_FILETIME* lpFileTime,
-    ::_FILETIME* lpLocalFileTime);
-
-BOOST_WINAPI_IMPORT_EXCEPT_WM boost::winapi::BOOL_ BOOST_WINAPI_WINAPI_CC
-LocalFileTimeToFileTime(
-    const ::_FILETIME* lpLocalFileTime,
-    ::_FILETIME* lpFileTime);
-
-#endif // BOOST_WINAPI_PARTITION_APP_SYSTEM
-
-#if BOOST_WINAPI_PARTITION_DESKTOP_SYSTEM
-BOOST_WINAPI_IMPORT_EXCEPT_WM boost::winapi::DWORD_ BOOST_WINAPI_WINAPI_CC
-GetTickCount(BOOST_WINAPI_DETAIL_VOID);
-#endif // BOOST_WINAPI_PARTITION_DESKTOP_SYSTEM
-
-#if BOOST_USE_WINAPI_VERSION >= BOOST_WINAPI_VERSION_WIN6
-BOOST_WINAPI_IMPORT boost::winapi::ULONGLONG_ BOOST_WINAPI_WINAPI_CC
-GetTickCount64(BOOST_WINAPI_DETAIL_VOID);
-#endif
-
-} // extern "C"
-#endif // !defined( BOOST_USE_WINDOWS_H )
-
-namespace boost {
-namespace winapi {
-
-typedef struct BOOST_MAY_ALIAS _FILETIME {
-    DWORD_ dwLowDateTime;
-    DWORD_ dwHighDateTime;
-} FILETIME_, *PFILETIME_, *LPFILETIME_;
-
-typedef struct BOOST_MAY_ALIAS _SYSTEMTIME {
-    WORD_ wYear;
-    WORD_ wMonth;
-    WORD_ wDayOfWeek;
-    WORD_ wDay;
-    WORD_ wHour;
-    WORD_ wMinute;
-    WORD_ wSecond;
-    WORD_ wMilliseconds;
-} SYSTEMTIME_, *PSYSTEMTIME_, *LPSYSTEMTIME_;
-
-#if BOOST_WINAPI_PARTITION_DESKTOP_SYSTEM
-using ::GetTickCount;
-#endif
-#if BOOST_USE_WINAPI_VERSION >= BOOST_WINAPI_VERSION_WIN6
-using ::GetTickCount64;
-#endif
-
-BOOST_FORCEINLINE VOID_ GetSystemTime(LPSYSTEMTIME_ lpSystemTime)
-{
-    ::GetSystemTime(reinterpret_cast< ::_SYSTEMTIME* >(lpSystemTime));
-}
-
-BOOST_FORCEINLINE BOOL_ SystemTimeToFileTime(const SYSTEMTIME_* lpSystemTime, FILETIME_* lpFileTime)
-{
-    return ::SystemTimeToFileTime(reinterpret_cast< const ::_SYSTEMTIME* >(lpSystemTime), reinterpret_cast< ::_FILETIME* >(lpFileTime));
-}
-
-BOOST_FORCEINLINE BOOL_ FileTimeToSystemTime(const FILETIME_* lpFileTime, SYSTEMTIME_* lpSystemTime)
-{
-    return ::FileTimeToSystemTime(reinterpret_cast< const ::_FILETIME* >(lpFileTime), reinterpret_cast< ::_SYSTEMTIME* >(lpSystemTime));
-}
-
-#if BOOST_WINAPI_PARTITION_APP_SYSTEM
-BOOST_FORCEINLINE BOOL_ FileTimeToLocalFileTime(const FILETIME_* lpFileTime, FILETIME_* lpLocalFileTime)
-{
-    return ::FileTimeToLocalFileTime(reinterpret_cast< const ::_FILETIME* >(lpFileTime), reinterpret_cast< ::_FILETIME* >(lpLocalFileTime));
-}
-
-BOOST_FORCEINLINE BOOL_ LocalFileTimeToFileTime(const FILETIME_* lpLocalFileTime, FILETIME_* lpFileTime)
-{
-    return ::LocalFileTimeToFileTime(reinterpret_cast< const ::_FILETIME* >(lpLocalFileTime), reinterpret_cast< ::_FILETIME* >(lpFileTime));
-}
-#endif // BOOST_WINAPI_PARTITION_APP_SYSTEM
-
-#if defined( BOOST_HAS_GETSYSTEMTIMEASFILETIME )
-BOOST_FORCEINLINE VOID_ GetSystemTimeAsFileTime(LPFILETIME_ lpSystemTimeAsFileTime)
-{
-    ::GetSystemTimeAsFileTime(reinterpret_cast< ::_FILETIME* >(lpSystemTimeAsFileTime));
-}
-#else
-// Windows CE does not define GetSystemTimeAsFileTime
-BOOST_FORCEINLINE VOID_ GetSystemTimeAsFileTime(FILETIME_* lpFileTime)
-{
-    boost::winapi::SYSTEMTIME_ st;
-    boost::winapi::GetSystemTime(&st);
-    boost::winapi::SystemTimeToFileTime(&st, lpFileTime);
-}
-#endif
-
-}
-}
-
-#include <boost/winapi/detail/footer.hpp>
-
-#endif // BOOST_WINAPI_TIME_HPP_INCLUDED_
diff --git a/src/boost/winapi/timers.hpp b/src/boost/winapi/timers.hpp
deleted file mode 100644
index 146c870b..00000000
--- a/src/boost/winapi/timers.hpp
+++ /dev/null
@@ -1,48 +0,0 @@
-/*
- * Copyright 2010 Vicente J. Botet Escriba
- * Copyright 2015 Andrey Semashev
- *
- * Distributed under the Boost Software License, Version 1.0.
- * See http://www.boost.org/LICENSE_1_0.txt
- */
-
-#ifndef BOOST_WINAPI_TIMERS_HPP_INCLUDED_
-#define BOOST_WINAPI_TIMERS_HPP_INCLUDED_
-
-#include <boost/winapi/basic_types.hpp>
-#include <boost/winapi/detail/header.hpp>
-
-#ifdef BOOST_HAS_PRAGMA_ONCE
-#pragma once
-#endif
-
-#if !defined( BOOST_USE_WINDOWS_H )
-extern "C" {
-BOOST_WINAPI_IMPORT_EXCEPT_WM boost::winapi::BOOL_ BOOST_WINAPI_WINAPI_CC
-QueryPerformanceCounter(::_LARGE_INTEGER* lpPerformanceCount);
-
-BOOST_WINAPI_IMPORT_EXCEPT_WM boost::winapi::BOOL_ BOOST_WINAPI_WINAPI_CC
-QueryPerformanceFrequency(::_LARGE_INTEGER* lpFrequency);
-} // extern "C"
-#endif
-
-
-namespace boost {
-namespace winapi {
-
-BOOST_FORCEINLINE BOOL_ QueryPerformanceCounter(LARGE_INTEGER_* lpPerformanceCount)
-{
-    return ::QueryPerformanceCounter(reinterpret_cast< ::_LARGE_INTEGER* >(lpPerformanceCount));
-}
-
-BOOST_FORCEINLINE BOOL_ QueryPerformanceFrequency(LARGE_INTEGER_* lpFrequency)
-{
-    return ::QueryPerformanceFrequency(reinterpret_cast< ::_LARGE_INTEGER* >(lpFrequency));
-}
-
-}
-}
-
-#include <boost/winapi/detail/footer.hpp>
-
-#endif // BOOST_WINAPI_TIMERS_HPP_INCLUDED_
diff --git a/src/boost/winapi/wait.hpp b/src/boost/winapi/wait.hpp
deleted file mode 100644
index 23409b1d..00000000
--- a/src/boost/winapi/wait.hpp
+++ /dev/null
@@ -1,91 +0,0 @@
-/*
- * Copyright 2010 Vicente J. Botet Escriba
- * Copyright 2015 Andrey Semashev
- * Copyright 2017 James E. King, III
- *
- * Distributed under the Boost Software License, Version 1.0.
- * See http://www.boost.org/LICENSE_1_0.txt
- */
-
-#ifndef BOOST_WINAPI_WAIT_HPP_INCLUDED_
-#define BOOST_WINAPI_WAIT_HPP_INCLUDED_
-
-#include <boost/winapi/basic_types.hpp>
-#include <boost/winapi/wait_constants.hpp>
-#include <boost/winapi/detail/header.hpp>
-
-#ifdef BOOST_HAS_PRAGMA_ONCE
-#pragma once
-#endif
-
-#if !defined( BOOST_USE_WINDOWS_H )
-extern "C" {
-
-#if BOOST_WINAPI_PARTITION_APP || BOOST_WINAPI_PARTITION_SYSTEM
-BOOST_WINAPI_IMPORT boost::winapi::DWORD_ BOOST_WINAPI_WINAPI_CC
-WaitForSingleObjectEx(
-    boost::winapi::HANDLE_ hHandle,
-    boost::winapi::DWORD_ dwMilliseconds,
-    boost::winapi::BOOL_ bAlertable);
-#endif
-
-#if BOOST_WINAPI_PARTITION_DESKTOP || BOOST_WINAPI_PARTITION_SYSTEM
-#if BOOST_USE_WINAPI_VERSION >= BOOST_WINAPI_VERSION_NT4
-BOOST_WINAPI_IMPORT boost::winapi::DWORD_ BOOST_WINAPI_WINAPI_CC
-SignalObjectAndWait(
-    boost::winapi::HANDLE_ hObjectToSignal,
-    boost::winapi::HANDLE_ hObjectToWaitOn,
-    boost::winapi::DWORD_ dwMilliseconds,
-    boost::winapi::BOOL_ bAlertable);
-#endif
-#endif
-
-#if BOOST_WINAPI_PARTITION_APP_SYSTEM
-BOOST_WINAPI_IMPORT_EXCEPT_WM boost::winapi::DWORD_ BOOST_WINAPI_WINAPI_CC
-WaitForSingleObject(
-    boost::winapi::HANDLE_ hHandle,
-    boost::winapi::DWORD_ dwMilliseconds);
-
-BOOST_WINAPI_IMPORT_EXCEPT_WM boost::winapi::DWORD_ BOOST_WINAPI_WINAPI_CC
-WaitForMultipleObjects(
-    boost::winapi::DWORD_ nCount,
-    boost::winapi::HANDLE_ const* lpHandles,
-    boost::winapi::BOOL_ bWaitAll,
-    boost::winapi::DWORD_ dwMilliseconds);
-
-BOOST_WINAPI_IMPORT boost::winapi::DWORD_ BOOST_WINAPI_WINAPI_CC
-WaitForMultipleObjectsEx(
-    boost::winapi::DWORD_ nCount,
-    boost::winapi::HANDLE_ const* lpHandles,
-    boost::winapi::BOOL_ bWaitAll,
-    boost::winapi::DWORD_ dwMilliseconds,
-    boost::winapi::BOOL_ bAlertable);
-#endif // BOOST_WINAPI_PARTITION_APP_SYSTEM
-
-} // extern "C"
-#endif
-
-namespace boost {
-namespace winapi {
-
-#if BOOST_WINAPI_PARTITION_APP || BOOST_WINAPI_PARTITION_SYSTEM
-using ::WaitForSingleObjectEx;
-#endif
-#if BOOST_WINAPI_PARTITION_DESKTOP || BOOST_WINAPI_PARTITION_SYSTEM
-#if BOOST_USE_WINAPI_VERSION >= BOOST_WINAPI_VERSION_NT4
-using ::SignalObjectAndWait;
-#endif
-#endif
-
-#if BOOST_WINAPI_PARTITION_APP_SYSTEM
-using ::WaitForMultipleObjects;
-using ::WaitForMultipleObjectsEx;
-using ::WaitForSingleObject;
-#endif
-
-}
-}
-
-#include <boost/winapi/detail/footer.hpp>
-
-#endif // BOOST_WINAPI_WAIT_HPP_INCLUDED_
diff --git a/src/boost/winapi/wait_constants.hpp b/src/boost/winapi/wait_constants.hpp
deleted file mode 100644
index 867b74fe..00000000
--- a/src/boost/winapi/wait_constants.hpp
+++ /dev/null
@@ -1,52 +0,0 @@
-/*
- * Copyright 2020 Andrey Semashev
- *
- * Distributed under the Boost Software License, Version 1.0.
- * See http://www.boost.org/LICENSE_1_0.txt
- */
-
-#ifndef BOOST_WINAPI_WAIT_CONSTANTS_HPP_INCLUDED_
-#define BOOST_WINAPI_WAIT_CONSTANTS_HPP_INCLUDED_
-
-#include <boost/winapi/basic_types.hpp>
-#include <boost/winapi/detail/header.hpp>
-
-#ifdef BOOST_HAS_PRAGMA_ONCE
-#pragma once
-#endif
-
-namespace boost {
-namespace winapi {
-
-#if defined( BOOST_USE_WINDOWS_H )
-
-BOOST_CONSTEXPR_OR_CONST DWORD_ INFINITE_ = INFINITE;
-BOOST_CONSTEXPR_OR_CONST DWORD_ WAIT_ABANDONED_ = WAIT_ABANDONED;
-BOOST_CONSTEXPR_OR_CONST DWORD_ WAIT_OBJECT_0_ = WAIT_OBJECT_0;
-BOOST_CONSTEXPR_OR_CONST DWORD_ WAIT_TIMEOUT_ = WAIT_TIMEOUT;
-BOOST_CONSTEXPR_OR_CONST DWORD_ WAIT_FAILED_ = WAIT_FAILED;
-
-#else // defined( BOOST_USE_WINDOWS_H )
-
-BOOST_CONSTEXPR_OR_CONST DWORD_ INFINITE_ = (DWORD_)0xFFFFFFFF;
-BOOST_CONSTEXPR_OR_CONST DWORD_ WAIT_ABANDONED_ = 0x00000080L;
-BOOST_CONSTEXPR_OR_CONST DWORD_ WAIT_OBJECT_0_ = 0x00000000L;
-BOOST_CONSTEXPR_OR_CONST DWORD_ WAIT_TIMEOUT_ = 0x00000102L;
-BOOST_CONSTEXPR_OR_CONST DWORD_ WAIT_FAILED_ = (DWORD_)0xFFFFFFFF;
-
-#endif // defined( BOOST_USE_WINDOWS_H )
-
-BOOST_CONSTEXPR_OR_CONST DWORD_ infinite = INFINITE_;
-BOOST_CONSTEXPR_OR_CONST DWORD_ wait_abandoned = WAIT_ABANDONED_;
-BOOST_CONSTEXPR_OR_CONST DWORD_ wait_object_0 = WAIT_OBJECT_0_;
-BOOST_CONSTEXPR_OR_CONST DWORD_ wait_timeout = WAIT_TIMEOUT_;
-BOOST_CONSTEXPR_OR_CONST DWORD_ wait_failed = WAIT_FAILED_;
-
-BOOST_CONSTEXPR_OR_CONST DWORD_ max_non_infinite_wait = (DWORD_)0xFFFFFFFE;
-
-}
-}
-
-#include <boost/winapi/detail/footer.hpp>
-
-#endif // BOOST_WINAPI_WAIT_CONSTANTS_HPP_INCLUDED_
diff --git a/src/policy_cache.hpp b/src/policy_cache.hpp
index 4fe11aa9..e40a0cb1 100644
--- a/src/policy_cache.hpp
+++ b/src/policy_cache.hpp
@@ -37,6 +37,7 @@
 class PolicyCache
 {
 public:
+  typedef boost::flyweight::flyweight<std::string> Val;
   typedef boost::concurrent_flat_map<uint64_t,const char*> Map;
 
 public: