PageRenderTime 26ms CodeModel.GetById 14ms app.highlight 9ms RepoModel.GetById 1ms app.codeStats 0ms

/Src/Dependencies/Boost/boost/range/algorithm/stable_partition.hpp

http://hadesmem.googlecode.com/
C++ Header | 73 lines | 48 code | 8 blank | 17 comment | 0 complexity | 0a558595760f69fb90e908f05c543b17 MD5 | raw file
 1//  Copyright Neil Groves 2009. Use, modification and
 2//  distribution is subject to the Boost Software License, Version
 3//  1.0. (See accompanying file LICENSE_1_0.txt or copy at
 4//  http://www.boost.org/LICENSE_1_0.txt)
 5//
 6//
 7// For more information, see http://www.boost.org/libs/range/
 8//
 9#ifndef BOOST_RANGE_ALGORITHM_STABLE_PARTITION_HPP_INCLUDED
10#define BOOST_RANGE_ALGORITHM_STABLE_PARTITION_HPP_INCLUDED
11
12#include <boost/concept_check.hpp>
13#include <boost/range/begin.hpp>
14#include <boost/range/end.hpp>
15#include <boost/range/concepts.hpp>
16#include <boost/range/detail/range_return.hpp>
17#include <algorithm>
18
19namespace boost
20{
21    namespace range
22    {
23
24/// \brief template function stable_partition
25///
26/// range-based version of the stable_partition std algorithm
27///
28/// \pre BidirectionalRange is a model of the BidirectionalRangeConcept
29/// \pre UnaryPredicate is a model of the UnaryPredicateConcept
30template<class BidirectionalRange, class UnaryPredicate>
31inline BOOST_DEDUCED_TYPENAME range_iterator<BidirectionalRange>::type
32stable_partition(BidirectionalRange& rng, UnaryPredicate pred)
33{
34    BOOST_RANGE_CONCEPT_ASSERT(( BidirectionalRangeConcept<BidirectionalRange> ));
35    return std::stable_partition(boost::begin(rng), boost::end(rng), pred);
36}
37
38/// \overload
39template<class BidirectionalRange, class UnaryPredicate>
40inline BOOST_DEDUCED_TYPENAME range_iterator<const BidirectionalRange>::type
41stable_partition(const BidirectionalRange& rng, UnaryPredicate pred)
42{
43    BOOST_RANGE_CONCEPT_ASSERT(( BidirectionalRangeConcept<const BidirectionalRange> ));
44    return std::stable_partition(boost::begin(rng),boost::end(rng),pred);
45}
46
47// range_return overloads
48template<range_return_value re, class BidirectionalRange, class UnaryPredicate>
49inline BOOST_DEDUCED_TYPENAME range_return<BidirectionalRange,re>::type
50stable_partition(BidirectionalRange& rng, UnaryPredicate pred)
51{
52    BOOST_RANGE_CONCEPT_ASSERT(( BidirectionalRangeConcept<BidirectionalRange> ));
53    return range_return<BidirectionalRange,re>::pack(
54        std::stable_partition(boost::begin(rng), boost::end(rng), pred),
55        rng);
56}
57
58/// \overload
59template<range_return_value re, class BidirectionalRange, class UnaryPredicate>
60inline BOOST_DEDUCED_TYPENAME range_return<const BidirectionalRange,re>::type
61stable_partition(const BidirectionalRange& rng, UnaryPredicate pred)
62{
63    BOOST_RANGE_CONCEPT_ASSERT(( BidirectionalRangeConcept<const BidirectionalRange> ));
64    return range_return<const BidirectionalRange,re>::pack(
65        std::stable_partition(boost::begin(rng),boost::end(rng),pred),
66        rng);
67}
68
69    } // namespace range
70    using range::stable_partition;
71} // namespace boost
72
73#endif // include guard