Documentation Overview Building ASL Documentation Library Wiki Docs Indices Browse Perforce More Info Release Notes Wiki Site Search License Success Stories Contributors Media Download Perforce Depots Support ASL SourceForge Home Mailing Lists Discussion Forums Report Bugs Suggest Features Contribute to ASL RSS Short-text news Full-text news File releases Other Adobe Projects Adobe Air Adobe GIL C++ Benchmarks Adobe Labs Adobe Media Gallery Adobe XMP Tamarin project (Mozilla Foundation) Other Resources Boost RIAForge SGI STL

move.hpp Go to the documentation of this file. /* Copyright 2005-2007 Adobe Systems Incorporated Distributed under the MIT License (see accompanying file LICENSE_1_0_0.txt or a copy at http://stlab.adobe.com/licenses.html) */ /*************************************************************************************************/ #ifndef ADOBE_MOVE_HPP #define ADOBE_MOVE_HPP #include <cassert> #include <iterator> #include <memory> #include <boost/iterator/iterator_adaptor.hpp> #include <boost/mpl/bool.hpp> #include <boost/mpl/and.hpp> #include <boost/mpl/or.hpp> #include <boost/mpl/not.hpp> #include <boost/mpl/assert.hpp> #include <boost/range/begin.hpp> #include <boost/range/end.hpp> #include <boost/type_traits/is_convertible.hpp> #include <boost/type_traits/is_same.hpp> #include <boost/type_traits/is_class.hpp> #include <boost/utility/enable_if.hpp> /*************************************************************************************************/ namespace adobe { /*************************************************************************************************/ namespace implementation { /*************************************************************************************************/ template <typename T> struct class_has_move_assign { class type { typedef T& (T::*E)(T t); typedef char (&no_type)[1]; typedef char (&yes_type)[2]; template <E e> struct sfinae { typedef yes_type type; }; template <class U> static typename sfinae<&U::operator=>::type test(int); template <class U> static no_type test(...); public: enum {value = sizeof(test<T>(1)) == sizeof(yes_type)}; }; }; /*************************************************************************************************/ template<typename T> struct has_move_assign : boost::mpl::and_<boost::is_class<T>, class_has_move_assign<T> > {}; /*************************************************************************************************/ class test_can_convert_anything { }; /*************************************************************************************************/ } //namespace implementation /*************************************************************************************************/ /* REVISIT (sparent@adobe.com): This is a work around for Boost 1.34.1 and VC++ 2008 where boost::is_convertible<T, T> fails to compile. */ template <typename T, typename U> struct is_convertible : boost::mpl::or_< boost::is_same<T, U>, boost::is_convertible<T, U> > { }; template <typename T> struct move_from { explicit move_from(T& x) : source(x) { } T& source; }; template <typename T> struct is_movable : boost::mpl::and_< boost::is_convertible<move_from<T>, T>, implementation::has_move_assign<T>, boost::mpl::not_<boost::is_convertible<implementation::test_can_convert_anything, T> > > { }; /*************************************************************************************************/ template <typename T, typename U = T, typename R = void*> struct copy_sink : boost::enable_if< boost::mpl::and_< adobe::is_convertible<T, U>, boost::mpl::not_<is_movable<T> > >, R > { }; /*************************************************************************************************/ template <typename T, typename U = T, typename R = void*> struct move_sink : boost::enable_if< boost::mpl::and_< adobe::is_convertible<T, U>, is_movable<T> >, R > { }; /*************************************************************************************************/ template <typename T> T move(T& x, typename move_sink<T>::type = 0) { return T(move_from<T>(x)); } /*************************************************************************************************/ template <typename T> T& move(T& x, typename copy_sink<T>::type = 0) { return x; } /*************************************************************************************************/ template <typename I, // I models InputIterator typename O> // O models OutputIterator O move(I f, I l, O result) { while (f != l) { *result = move(*f); ++f; ++result; } return result; } /*************************************************************************************************/ template <typename I, // I models InputRange typename O> // O models OutputIterator inline O move(I& in, O out) { return move(boost::begin(in), boost::end(in), out); } /*************************************************************************************************/ 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 = move(*l); } return result; } /*************************************************************************************************/ template <typename I, // I models BidirectionalRange typename O> // O models BidirectionalIterator inline O move_backward(I& in, O out) { return move_backward(boost::begin(in), boost::end(in), out); } /*************************************************************************************************/ template <typename C> // C models Container class back_move_iterator : public std::iterator<std::output_iterator_tag, void, void, void, void> { C* container_m; public: typedef C container_type; explicit back_move_iterator(C& x) : container_m(&x) { } back_move_iterator& operator=(typename C::value_type x) { container_m->push_back(move(x)); return *this; } back_move_iterator& operator*() { return *this; } back_move_iterator& operator++() { return *this; } back_move_iterator& operator++(int) { return *this; } }; /*************************************************************************************************/ template <typename C> // C models Container inline back_move_iterator<C> back_mover(C& x) { return back_move_iterator<C>(x); } /*************************************************************************************************/ template <typename T, typename U> // T models Regular inline void move_construct(T* p, U& x, typename move_sink<U, T>::type = 0) { ::new(static_cast<void*>(p)) T(move(x)); } /*************************************************************************************************/ template <typename T, typename U> // T models Regular inline void move_construct(T* p, const U& x, typename copy_sink<U, T>::type = 0) { ::new(static_cast<void*>(p)) T(x); } /*************************************************************************************************/ template <typename I, // I models InputIterator typename F> // F models ForwardIterator F uninitialized_move(I f, I l, F r, typename move_sink<typename std::iterator_traits<I>::value_type>::type = 0) { while (f != l) { move_construct(&*r, *f); ++f; ++r; } return r; } /*************************************************************************************************/ template <typename I, // I models InputIterator typename F> // F models ForwardIterator F uninitialized_move(I f, I l, F r, typename copy_sink<typename std::iterator_traits<I>::value_type>::type = 0) { return std::uninitialized_copy(f, l, r); } /*************************************************************************************************/ } // namespace adobe /*************************************************************************************************/ #endif /*************************************************************************************************/

• Company | 
• Online Privacy Policy | 
• Terms of Use | 
• Contact Us | 
• Accessibility | 
• Report Piracy | 
• Permissions & Trademarks | 
• Product License Agreements | 
• Send Feedback

Copyright © 2006-2007 Adobe Systems Incorporated.

Use of this website signifies your agreement to the Terms of Use and Online Privacy Policy.

Search powered by Google