////////////////////////////////////////////////////////////////////////////// // // (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/container for documentation. // ////////////////////////////////////////////////////////////////////////////// #ifndef BOOST_CONTAINER_DETAIL_UTILITIES_HPP #define BOOST_CONTAINER_DETAIL_UTILITIES_HPP #include "config_begin.hpp" #include #include #include #include #include #include #include #include #include #include #include namespace boost { namespace container { namespace container_detail { template inline T* addressof(T& obj) { return static_cast( static_cast( const_cast( &reinterpret_cast(obj) ))); } template const T &max_value(const T &a, const T &b) { return a > b ? a : b; } template const T &min_value(const T &a, const T &b) { return a < b ? a : b; } template SizeType get_next_capacity(const SizeType max_size ,const SizeType capacity ,const SizeType n) { // if (n > max_size - capacity) // throw std::length_error("get_next_capacity"); const SizeType m3 = max_size/3; if (capacity < m3) return capacity + max_value(3*(capacity+1)/5, n); if (capacity < m3*2) return capacity + max_value((capacity+1)/2, n); return max_size; } template inline T* to_raw_pointer(T* p) { return p; } template inline typename Pointer::element_type* to_raw_pointer(const Pointer &p) { return boost::container::container_detail::to_raw_pointer(p.operator->()); } //!To avoid ADL problems with swap template inline void do_swap(T& x, T& y) { using std::swap; swap(x, y); } template inline void swap_alloc(AllocatorType &, AllocatorType &, container_detail::false_type) BOOST_CONTAINER_NOEXCEPT {} template inline void swap_alloc(AllocatorType &l, AllocatorType &r, container_detail::true_type) { container_detail::do_swap(l, r); } template inline void assign_alloc(AllocatorType &, const AllocatorType &, container_detail::false_type) BOOST_CONTAINER_NOEXCEPT {} template inline void assign_alloc(AllocatorType &l, const AllocatorType &r, container_detail::true_type) { l = r; } template inline void move_alloc(AllocatorType &, AllocatorType &, container_detail::false_type) BOOST_CONTAINER_NOEXCEPT {} template inline void move_alloc(AllocatorType &l, AllocatorType &r, container_detail::true_type) { l = ::boost::move(r); } //Rounds "orig_size" by excess to round_to bytes template inline SizeType get_rounded_size(SizeType orig_size, SizeType round_to) { return ((orig_size-1)/round_to+1)*round_to; } template struct ct_rounded_size { enum { value = ((OrigSize-1)/RoundTo+1)*RoundTo }; }; template struct move_const_ref_type : if_c // < ::boost::is_fundamental::value || ::boost::is_pointer::value || ::boost::is_member_pointer::value || ::boost::is_enum::value < !::boost::is_class::value ,const T & ,BOOST_CATCH_CONST_RLVALUE(T) > {}; } //namespace container_detail { ////////////////////////////////////////////////////////////////////////////// // // uninitialized_move_alloc // ////////////////////////////////////////////////////////////////////////////// //! Effects: //! \code //! for (; first != last; ++result, ++first) //! allocator_traits::construct(a, &*result, boost::move(*first)); //! \endcode //! //! Returns: result template // F models ForwardIterator F uninitialized_move_alloc(A &a, I f, I l, F r) { while (f != l) { allocator_traits::construct(a, container_detail::to_raw_pointer(&*r), boost::move(*f)); ++f; ++r; } return r; } ////////////////////////////////////////////////////////////////////////////// // // uninitialized_copy_alloc // ////////////////////////////////////////////////////////////////////////////// //! Effects: //! \code //! for (; first != last; ++result, ++first) //! allocator_traits::construct(a, &*result, *first); //! \endcode //! //! Returns: result template // F models ForwardIterator F uninitialized_copy_alloc(A &a, I f, I l, F r) { while (f != l) { allocator_traits::construct(a, container_detail::to_raw_pointer(&*r), *f); ++f; ++r; } return r; } ////////////////////////////////////////////////////////////////////////////// // // uninitialized_copy_alloc // ////////////////////////////////////////////////////////////////////////////// //! Effects: //! \code //! for (; first != last; ++result, ++first) //! allocator_traits::construct(a, &*result, *first); //! \endcode //! //! Returns: result template void uninitialized_fill_alloc(A &a, F f, F l, const T &t) { while (f != l) { allocator_traits::construct(a, container_detail::to_raw_pointer(&*f), t); ++f; } } ////////////////////////////////////////////////////////////////////////////// // // uninitialized_copy_or_move_alloc // ////////////////////////////////////////////////////////////////////////////// template // F models ForwardIterator F uninitialized_copy_or_move_alloc (A &a, I f, I l, F r ,typename boost::container::container_detail::enable_if < boost::move_detail::is_move_iterator >::type* = 0) { return ::boost::container::uninitialized_move_alloc(a, f, l, r); } template // F models ForwardIterator F uninitialized_copy_or_move_alloc (A &a, I f, I l, F r ,typename boost::container::container_detail::disable_if < boost::move_detail::is_move_iterator >::type* = 0) { return ::boost::container::uninitialized_copy_alloc(a, f, l, r); } } //namespace container { } //namespace boost { #include #endif //#ifndef BOOST_CONTAINER_DETAIL_UTILITIES_HPP