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

reverse.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_ALGORITHM_REVERSE_HPP #define ADOBE_ALGORITHM_REVERSE_HPP #include <adobe/config.hpp> #include <boost/range/begin.hpp> #include <boost/range/end.hpp> #include <boost/range/iterator.hpp> #include <adobe/iterator/set_next.hpp> #include <algorithm> #include <utility> /*************************************************************************************************/ namespace adobe { /*************************************************************************************************/ /*************************************************************************************************/ namespace unsafe { /*************************************************************************************************/ template <typename I> // I models NodeIterator I reverse_append(I first, I last, I result) { while (first != last) { I prior(first); ++first; adobe::unsafe::set_next(prior, result); result = prior; } return result; } template <typename R, // R models NodeRange typename I> // I models NodeIterator inline I reverse_append(R& range, I result) { return adobe::unsafe::reverse_append(boost::begin(range), boost::end(range), result); } template <typename I> // I models NodeIterator inline I reverse_nodes(I first, I last) { return adobe::unsafe::reverse_append(first, last, last); } template <typename R> // R models NodeRange inline typename boost::range_iterator<R>::type reverse_nodes(R& range) { return adobe::unsafe::reverse_nodes(boost::begin(range), boost::end(range)); } /*************************************************************************************************/ } // namspace unsafe /*************************************************************************************************/ template <class BidirectionalRange> inline void reverse(BidirectionalRange& range) { std::reverse(boost::begin(range), boost::end(range)); } template <class BidirectionalRange, class OutputIterator> inline void reverse_copy(BidirectionalRange& range, OutputIterator result) { std::reverse_copy(boost::begin(range), boost::end(range), result); } template <class BidirectionalRange, class OutputIterator> inline void reverse_copy(const BidirectionalRange& range, OutputIterator result) { std::reverse_copy(boost::begin(range), boost::end(range), result); } /*************************************************************************************************/ template <typename I> // I models Bidirectional Iterator std::pair<I, I> reverse_until(I f, I m, I l) { while (f != m && m != l) { --l; std::iter_swap(f, l); ++f; } return std::pair<I, I>(f, l); } /*************************************************************************************************/ } // 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