2 Copyright 2010 Neil Groves
3 Distributed under the Boost Software License, Version 1.0.
4 (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
6 [section:next_permutation next_permutation]
11 template<class BidirectionalRange>
12 bool next_permutation(BidirectionalRange& rng);
14 template<class BidirectionalRange>
15 bool next_permutation(const BidirectionalRange& rng);
17 template<class BidirectionalRange, class Compare>
18 bool next_permutation(BidirectionalRange& rng, Compare pred);
20 template<class BidirectionalRange, class Compare>
21 bool next_permutation(const BidirectionalRange& rng, Compare pred);
26 `next_permutation` transforms the range of elements `rng` into the lexicographically next greater permutation of the elements if such a permutation exists. If one does not exist then the range is transformed into the lexicographically smallest permutation and `false` is returned. `true` is returned when the next greater permutation is successfully generated.
28 The ordering relationship is determined by using `operator<` in the non-predicate versions, and by evaluating `pred` in the predicate versions.
32 Defined in the header file `boost/range/algorithm/permutation.hpp`
34 [heading Requirements]
36 [*For the non-predicate versions:]
38 * `BidirectionalRange` is a model of the __bidirectional_range__ Concept.
39 * `BidirectionalRange` is mutable.
40 * `BidirectionalRange`'s value type is a model of the `LessThanComparableConcept`.
41 * The ordering of objects of type `BidirectionalRange`'s value type is a [*/strict weak ordering/], as defined in the `LessThanComparableConcept` requirements.
43 [*For the predicate versions:]
45 * `BidirectionalRange` is a model of the __bidirectional_range__ Concept.
46 * `BidirectionalRange` is mutable.
47 * `Compare` is a model of the `StrictWeakOrderingConcept`.
48 * `BidirectionalRange`'s value type is convertible to both of `Compare`'s argument types.
52 Linear. At most `distance(rng) / 2` swaps.