|
Boost-Commit : |
Subject: [Boost-commit] svn:boost r61211 - in trunk: boost/range/algorithm boost/range/algorithm_ext libs/range/doc/html libs/range/doc/html/range libs/range/doc/html/range/concepts libs/range/doc/html/range/reference libs/range/doc/html/range/reference/adaptors libs/range/doc/html/range/reference/algorithms libs/range/doc/html/range/reference/algorithms/heap_algorithms libs/range/doc/html/range/reference/algorithms/permutation_algorithms libs/range/doc/html/range/reference/algorithms/range_algorithm_mutating_algorithms libs/range/doc/html/range/reference/algorithms/range_algorithm_new_algorithms libs/range/doc/html/range/reference/algorithms/range_algorithm_non_mutating_algorithms libs/range/doc/html/range/reference/algorithms/range_numeric libs/range/doc/html/range/reference/algorithms/set_algorithms libs/range/doc/html/range/reference/ranges libs/range/doc/html/range/utilities libs/range/doc/reference libs/range/doc/reference/algorithm libs/range/doc/reference/algorithm_ext
From: neil_at_[hidden]
Date: 2010-04-11 18:05:13
Author: neilgroves
Date: 2010-04-11 18:05:02 EDT (Sun, 11 Apr 2010)
New Revision: 61211
URL: http://svn.boost.org/trac/boost/changeset/61211
Log:
Boost.Range updated the return types of various algorithms to improve consistency. This is to address a specific request made during the formal review of Boost.RangeEx.
Added:
trunk/libs/range/doc/html/range/reference/algorithms/heap_algorithms/sort_heap.html (contents, props changed)
trunk/libs/range/doc/html/range/reference/algorithms/range_algorithm_mutating_algorithms/fill_n.html (contents, props changed)
trunk/libs/range/doc/reference/algorithm/fill_n.qbk (contents, props changed)
Text files modified:
trunk/boost/range/algorithm/fill_n.hpp | 1
trunk/boost/range/algorithm/heap_algorithm.hpp | 45 ++++++++++++++++++++++++++-------------
trunk/boost/range/algorithm/nth_element.hpp | 12 +++++++---
trunk/boost/range/algorithm/partial_sort.hpp | 12 +++++++---
trunk/boost/range/algorithm_ext/erase.hpp | 9 +++++--
trunk/boost/range/algorithm_ext/insert.hpp | 7 +++--
trunk/boost/range/algorithm_ext/iota.hpp | 4 ++
trunk/boost/range/algorithm_ext/push_back.hpp | 3 +
trunk/boost/range/algorithm_ext/push_front.hpp | 3 +
trunk/libs/range/doc/html/index.html | 4 +-
trunk/libs/range/doc/html/quickbook_HTML.manifest | 2 +
trunk/libs/range/doc/html/range/concepts/bidirectional_range.html | 16 +++++++-------
trunk/libs/range/doc/html/range/concepts/concept_checking.html | 2
trunk/libs/range/doc/html/range/concepts/forward_range.html | 10 ++++----
trunk/libs/range/doc/html/range/concepts/random_access_range.html | 12 +++++-----
trunk/libs/range/doc/html/range/concepts/single_pass_range.html | 16 +++++++-------
trunk/libs/range/doc/html/range/mfc_atl.html | 4 +-
trunk/libs/range/doc/html/range/reference/adaptors/adaptors_introduction.html | 6 ++--
trunk/libs/range/doc/html/range/reference/algorithms/heap_algorithms.html | 2 +
trunk/libs/range/doc/html/range/reference/algorithms/heap_algorithms/make_heap.html | 24 ++++++++++----------
trunk/libs/range/doc/html/range/reference/algorithms/heap_algorithms/pop_heap.html | 20 ++++++++--------
trunk/libs/range/doc/html/range/reference/algorithms/heap_algorithms/push_heap.html | 20 ++++++++--------
trunk/libs/range/doc/html/range/reference/algorithms/permutation_algorithms.html | 6 ++--
trunk/libs/range/doc/html/range/reference/algorithms/permutation_algorithms/next_permutation.html | 18 ++++++++--------
trunk/libs/range/doc/html/range/reference/algorithms/permutation_algorithms/prev_permutation.html | 18 ++++++++--------
trunk/libs/range/doc/html/range/reference/algorithms/range_algorithm_mutating_algorithms.html | 2 +
trunk/libs/range/doc/html/range/reference/algorithms/range_algorithm_mutating_algorithms/copy.html | 12 +++++-----
trunk/libs/range/doc/html/range/reference/algorithms/range_algorithm_mutating_algorithms/copy_backward.html | 12 +++++-----
trunk/libs/range/doc/html/range/reference/algorithms/range_algorithm_mutating_algorithms/fill.html | 21 ++++++++----------
trunk/libs/range/doc/html/range/reference/algorithms/range_algorithm_mutating_algorithms/generate.html | 18 ++++++++--------
trunk/libs/range/doc/html/range/reference/algorithms/range_algorithm_mutating_algorithms/inplace_merge.html | 16 +++++++-------
trunk/libs/range/doc/html/range/reference/algorithms/range_algorithm_mutating_algorithms/merge.html | 16 +++++++-------
trunk/libs/range/doc/html/range/reference/algorithms/range_algorithm_mutating_algorithms/nth_element.html | 40 +++++++++++++++++++----------------
trunk/libs/range/doc/html/range/reference/algorithms/range_algorithm_mutating_algorithms/partial_sort.html | 40 +++++++++++++++++++----------------
trunk/libs/range/doc/html/range/reference/algorithms/range_algorithm_mutating_algorithms/partition.html | 10 ++++----
trunk/libs/range/doc/html/range/reference/algorithms/range_algorithm_mutating_algorithms/random_shuffle.html | 12 +++++-----
trunk/libs/range/doc/html/range/reference/algorithms/range_algorithm_mutating_algorithms/remove.html | 10 ++++----
trunk/libs/range/doc/html/range/reference/algorithms/range_algorithm_mutating_algorithms/remove_if.html | 10 ++++----
trunk/libs/range/doc/html/range/reference/algorithms/range_algorithm_mutating_algorithms/replace.html | 10 ++++----
trunk/libs/range/doc/html/range/reference/algorithms/range_algorithm_mutating_algorithms/replace_if.html | 10 ++++----
trunk/libs/range/doc/html/range/reference/algorithms/range_algorithm_mutating_algorithms/rotate.html | 12 +++++-----
trunk/libs/range/doc/html/range/reference/algorithms/range_algorithm_mutating_algorithms/sort.html | 10 ++++----
trunk/libs/range/doc/html/range/reference/algorithms/range_algorithm_mutating_algorithms/stable_partition.html | 10 ++++----
trunk/libs/range/doc/html/range/reference/algorithms/range_algorithm_mutating_algorithms/stable_sort.html | 10 ++++----
trunk/libs/range/doc/html/range/reference/algorithms/range_algorithm_mutating_algorithms/transform.html | 12 +++++-----
trunk/libs/range/doc/html/range/reference/algorithms/range_algorithm_mutating_algorithms/unique.html | 10 ++++----
trunk/libs/range/doc/html/range/reference/algorithms/range_algorithm_new_algorithms/erase.html | 28 +++++++++++++++---------
trunk/libs/range/doc/html/range/reference/algorithms/range_algorithm_new_algorithms/for_each.html | 10 ++++----
trunk/libs/range/doc/html/range/reference/algorithms/range_algorithm_new_algorithms/insert.html | 16 +++++++-------
trunk/libs/range/doc/html/range/reference/algorithms/range_algorithm_new_algorithms/iota.html | 22 +++++++++---------
trunk/libs/range/doc/html/range/reference/algorithms/range_algorithm_new_algorithms/overwrite.html | 10 ++++----
trunk/libs/range/doc/html/range/reference/algorithms/range_algorithm_new_algorithms/push_back.html | 14 ++++++------
trunk/libs/range/doc/html/range/reference/algorithms/range_algorithm_new_algorithms/push_front.html | 14 ++++++------
trunk/libs/range/doc/html/range/reference/algorithms/range_algorithm_new_algorithms/remove_erase.html | 21 ++++++++----------
trunk/libs/range/doc/html/range/reference/algorithms/range_algorithm_new_algorithms/remove_erase_if.html | 19 +++++++---------
trunk/libs/range/doc/html/range/reference/algorithms/range_algorithm_non_mutating_algorithms/adjacent_find.html | 10 ++++----
trunk/libs/range/doc/html/range/reference/algorithms/range_algorithm_non_mutating_algorithms/binary_search.html | 12 +++++-----
trunk/libs/range/doc/html/range/reference/algorithms/range_algorithm_non_mutating_algorithms/count.html | 10 ++++----
trunk/libs/range/doc/html/range/reference/algorithms/range_algorithm_non_mutating_algorithms/equal.html | 10 ++++----
trunk/libs/range/doc/html/range/reference/algorithms/range_algorithm_non_mutating_algorithms/equal_range.html | 12 +++++-----
trunk/libs/range/doc/html/range/reference/algorithms/range_algorithm_non_mutating_algorithms/find.html | 10 ++++----
trunk/libs/range/doc/html/range/reference/algorithms/range_algorithm_non_mutating_algorithms/find_end.html | 10 ++++----
trunk/libs/range/doc/html/range/reference/algorithms/range_algorithm_non_mutating_algorithms/find_first_of.html | 10 ++++----
trunk/libs/range/doc/html/range/reference/algorithms/range_algorithm_non_mutating_algorithms/find_if.html | 12 +++++-----
trunk/libs/range/doc/html/range/reference/algorithms/range_algorithm_non_mutating_algorithms/for_each.html | 10 ++++----
trunk/libs/range/doc/html/range/reference/algorithms/range_algorithm_non_mutating_algorithms/lexicographical_compare.html | 10 ++++----
trunk/libs/range/doc/html/range/reference/algorithms/range_algorithm_non_mutating_algorithms/lower_bound.html | 12 +++++-----
trunk/libs/range/doc/html/range/reference/algorithms/range_algorithm_non_mutating_algorithms/max_element.html | 10 ++++----
trunk/libs/range/doc/html/range/reference/algorithms/range_algorithm_non_mutating_algorithms/min_element.html | 10 ++++----
trunk/libs/range/doc/html/range/reference/algorithms/range_algorithm_non_mutating_algorithms/mismatch.html | 12 +++++-----
trunk/libs/range/doc/html/range/reference/algorithms/range_algorithm_non_mutating_algorithms/search.html | 10 ++++----
trunk/libs/range/doc/html/range/reference/algorithms/range_algorithm_non_mutating_algorithms/upper_bound.html | 12 +++++-----
trunk/libs/range/doc/html/range/reference/algorithms/range_numeric/accumulate.html | 14 ++++++------
trunk/libs/range/doc/html/range/reference/algorithms/range_numeric/adjacent_difference.html | 16 +++++++-------
trunk/libs/range/doc/html/range/reference/algorithms/range_numeric/inner_product.html | 16 +++++++-------
trunk/libs/range/doc/html/range/reference/algorithms/range_numeric/partial_sum.html | 16 +++++++-------
trunk/libs/range/doc/html/range/reference/algorithms/set_algorithms/includes.html | 12 +++++-----
trunk/libs/range/doc/html/range/reference/algorithms/set_algorithms/set_difference.html | 12 +++++-----
trunk/libs/range/doc/html/range/reference/algorithms/set_algorithms/set_intersection.html | 12 +++++-----
trunk/libs/range/doc/html/range/reference/algorithms/set_algorithms/set_symmetric_difference.html | 12 +++++-----
trunk/libs/range/doc/html/range/reference/algorithms/set_algorithms/set_union.html | 12 +++++-----
trunk/libs/range/doc/html/range/reference/ranges/counting_range.html | 8 +++---
trunk/libs/range/doc/html/range/reference/ranges/irange.html | 10 ++++----
trunk/libs/range/doc/html/range/reference/ranges/istream_range.html | 6 ++--
trunk/libs/range/doc/html/range/reference/semantics.html | 2
trunk/libs/range/doc/html/range/utilities/iterator_range.html | 6 ++--
trunk/libs/range/doc/html/range/utilities/join.html | 4 +-
trunk/libs/range/doc/html/range/utilities/sub_range.html | 2
trunk/libs/range/doc/reference/algorithm/fill.qbk | 5 ---
trunk/libs/range/doc/reference/algorithm/make_heap.qbk | 10 ++++----
trunk/libs/range/doc/reference/algorithm/next_permutation.qbk | 10 ++++----
trunk/libs/range/doc/reference/algorithm/nth_element.qbk | 30 +++++++++++++++-----------
trunk/libs/range/doc/reference/algorithm/partial_sort.qbk | 30 +++++++++++++++-----------
trunk/libs/range/doc/reference/algorithm/pop_heap.qbk | 10 ++++----
trunk/libs/range/doc/reference/algorithm/prev_permutation.qbk | 10 ++++----
trunk/libs/range/doc/reference/algorithm/push_heap.qbk | 10 ++++----
trunk/libs/range/doc/reference/algorithm/sort_heap.qbk | 10 ++++----
trunk/libs/range/doc/reference/algorithm_ext/erase.qbk | 14 +++++++-----
trunk/libs/range/doc/reference/algorithm_ext/insert.qbk | 6 ++--
trunk/libs/range/doc/reference/algorithm_ext/iota.qbk | 6 ++--
trunk/libs/range/doc/reference/algorithm_ext/push_back.qbk | 4 +-
trunk/libs/range/doc/reference/algorithm_ext/push_front.qbk | 4 +-
trunk/libs/range/doc/reference/algorithm_ext/remove_erase.qbk | 11 +++------
trunk/libs/range/doc/reference/algorithm_ext/remove_erase_if.qbk | 9 ++-----
trunk/libs/range/doc/reference/algorithms.qbk | 2 +
105 files changed, 651 insertions(+), 605 deletions(-)
Modified: trunk/boost/range/algorithm/fill_n.hpp
==============================================================================
--- trunk/boost/range/algorithm/fill_n.hpp (original)
+++ trunk/boost/range/algorithm/fill_n.hpp 2010-04-11 18:05:02 EDT (Sun, 11 Apr 2010)
@@ -26,6 +26,7 @@
/// range-based version of the fill_n std algorithm
///
/// \pre ForwardRange is a model of the ForwardRangeConcept
+/// \pre n <= std::distance(boost::begin(rng), boost::end(rng))
template< class ForwardRange, class Size, class Value >
inline ForwardRange& fill_n(ForwardRange& rng, Size n, const Value& val)
{
Modified: trunk/boost/range/algorithm/heap_algorithm.hpp
==============================================================================
--- trunk/boost/range/algorithm/heap_algorithm.hpp (original)
+++ trunk/boost/range/algorithm/heap_algorithm.hpp 2010-04-11 18:05:02 EDT (Sun, 11 Apr 2010)
@@ -35,26 +35,29 @@
/// \overload
template<class RandomAccessRange>
-inline void push_heap(const RandomAccessRange& rng)
+inline const RandomAccessRange& push_heap(const RandomAccessRange& rng)
{
BOOST_RANGE_CONCEPT_ASSERT(( RandomAccessRangeConcept<const RandomAccessRange> ));
std::push_heap(boost::begin(rng), boost::end(rng));
+ return rng;
}
/// \overload
template<class RandomAccessRange, class Compare>
-inline void push_heap(RandomAccessRange& rng, Compare comp_pred)
+inline RandomAccessRange& push_heap(RandomAccessRange& rng, Compare comp_pred)
{
BOOST_RANGE_CONCEPT_ASSERT(( RandomAccessRangeConcept<RandomAccessRange> ));
std::push_heap(boost::begin(rng), boost::end(rng), comp_pred);
+ return rng;
}
/// \overload
template<class RandomAccessRange, class Compare>
-inline void push_heap(const RandomAccessRange& rng, Compare comp_pred)
+inline const RandomAccessRange& push_heap(const RandomAccessRange& rng, Compare comp_pred)
{
BOOST_RANGE_CONCEPT_ASSERT(( RandomAccessRangeConcept<const RandomAccessRange> ));
std::push_heap(boost::begin(rng), boost::end(rng), comp_pred);
+ return rng;
}
/// \brief template function pop_heap
@@ -64,34 +67,38 @@
/// \pre RandomAccessRange is a model of the RandomAccessRangeConcept
/// \pre Compare is a model of the BinaryPredicateConcept
template<class RandomAccessRange>
-inline void pop_heap(RandomAccessRange& rng)
+inline RandomAccessRange& pop_heap(RandomAccessRange& rng)
{
BOOST_RANGE_CONCEPT_ASSERT(( RandomAccessRangeConcept<RandomAccessRange> ));
std::pop_heap(boost::begin(rng), boost::end(rng));
+ return rng;
}
/// \overload
template<class RandomAccessRange>
-inline void pop_heap(const RandomAccessRange& rng)
+inline const RandomAccessRange& pop_heap(const RandomAccessRange& rng)
{
BOOST_RANGE_CONCEPT_ASSERT(( RandomAccessRangeConcept<const RandomAccessRange> ));
std::pop_heap(boost::begin(rng),boost::end(rng));
+ return rng;
}
/// \overload
template<class RandomAccessRange, class Compare>
-inline void pop_heap(RandomAccessRange& rng, Compare comp_pred)
+inline RandomAccessRange& pop_heap(RandomAccessRange& rng, Compare comp_pred)
{
BOOST_RANGE_CONCEPT_ASSERT(( RandomAccessRangeConcept<RandomAccessRange> ));
std::pop_heap(boost::begin(rng), boost::end(rng), comp_pred);
+ return rng;
}
/// \overload
template<class RandomAccessRange, class Compare>
-inline void pop_heap(const RandomAccessRange& rng, Compare comp_pred)
+inline const RandomAccessRange& pop_heap(const RandomAccessRange& rng, Compare comp_pred)
{
BOOST_RANGE_CONCEPT_ASSERT(( RandomAccessRangeConcept<const RandomAccessRange> ));
std::pop_heap(boost::begin(rng), boost::end(rng), comp_pred);
+ return rng;
}
/// \brief template function make_heap
@@ -101,34 +108,38 @@
/// \pre RandomAccessRange is a model of the RandomAccessRangeConcept
/// \pre Compare is a model of the BinaryPredicateConcept
template<class RandomAccessRange>
-inline void make_heap(RandomAccessRange& rng)
+inline RandomAccessRange& make_heap(RandomAccessRange& rng)
{
BOOST_RANGE_CONCEPT_ASSERT(( RandomAccessRangeConcept<RandomAccessRange> ));
std::make_heap(boost::begin(rng), boost::end(rng));
+ return rng;
}
/// \overload
template<class RandomAccessRange>
-inline void make_heap(const RandomAccessRange& rng)
+inline RandomAccessRange& make_heap(const RandomAccessRange& rng)
{
BOOST_RANGE_CONCEPT_ASSERT(( RandomAccessRangeConcept<const RandomAccessRange> ));
std::make_heap(boost::begin(rng),boost::end(rng));
+ return rng;
}
/// \overload
template<class RandomAccessRange, class Compare>
-inline void make_heap(RandomAccessRange& rng, Compare comp_pred)
+inline RandomAccessRange& make_heap(RandomAccessRange& rng, Compare comp_pred)
{
BOOST_RANGE_CONCEPT_ASSERT(( RandomAccessRangeConcept<RandomAccessRange> ));
std::make_heap(boost::begin(rng), boost::end(rng), comp_pred);
+ return rng;
}
/// \overload
template<class RandomAccessRange, class Compare>
-inline void make_heap(const RandomAccessRange& rng, Compare comp_pred)
+inline const RandomAccessRange& make_heap(const RandomAccessRange& rng, Compare comp_pred)
{
BOOST_RANGE_CONCEPT_ASSERT(( RandomAccessRangeConcept<const RandomAccessRange> ));
std::make_heap(boost::begin(rng), boost::end(rng), comp_pred);
+ return rng;
}
/// \brief template function sort_heap
@@ -138,34 +149,38 @@
/// \pre RandomAccessRange is a model of the RandomAccessRangeConcept
/// \pre Compare is a model of the BinaryPredicateConcept
template<class RandomAccessRange>
-inline void sort_heap(RandomAccessRange& rng)
+inline RandomAccessRange& sort_heap(RandomAccessRange& rng)
{
BOOST_RANGE_CONCEPT_ASSERT(( RandomAccessRangeConcept<RandomAccessRange> ));
std::sort_heap(boost::begin(rng), boost::end(rng));
+ return rng;
}
/// \overload
template<class RandomAccessRange>
-inline void sort_heap(const RandomAccessRange& rng)
+inline const RandomAccessRange& sort_heap(const RandomAccessRange& rng)
{
BOOST_RANGE_CONCEPT_ASSERT(( RandomAccessRangeConcept<const RandomAccessRange> ));
std::sort_heap(boost::begin(rng), boost::end(rng));
+ return rng;
}
/// \overload
template<class RandomAccessRange, class Compare>
-inline void sort_heap(RandomAccessRange& rng, Compare comp_pred)
+inline RandomAccessRange& sort_heap(RandomAccessRange& rng, Compare comp_pred)
{
BOOST_RANGE_CONCEPT_ASSERT(( RandomAccessRangeConcept<RandomAccessRange> ));
std::sort_heap(boost::begin(rng), boost::end(rng), comp_pred);
+ return rng;
}
/// \overload
template<class RandomAccessRange, class Compare>
-inline void sort_heap(const RandomAccessRange& rng, Compare comp_pred)
+inline const RandomAccessRange& sort_heap(const RandomAccessRange& rng, Compare comp_pred)
{
BOOST_RANGE_CONCEPT_ASSERT(( RandomAccessRangeConcept<const RandomAccessRange> ));
std::sort_heap(boost::begin(rng), boost::end(rng), comp_pred);
+ return rng;
}
} // namespace range
Modified: trunk/boost/range/algorithm/nth_element.hpp
==============================================================================
--- trunk/boost/range/algorithm/nth_element.hpp (original)
+++ trunk/boost/range/algorithm/nth_element.hpp 2010-04-11 18:05:02 EDT (Sun, 11 Apr 2010)
@@ -27,40 +27,44 @@
/// \pre RandomAccessRange is a model of the RandomAccessRangeConcept
/// \pre BinaryPredicate is a model of the BinaryPredicateConcept
template<class RandomAccessRange>
-inline void nth_element(RandomAccessRange& rng,
+inline RandomAccessRange& nth_element(RandomAccessRange& rng,
BOOST_DEDUCED_TYPENAME range_iterator<RandomAccessRange>::type nth)
{
BOOST_RANGE_CONCEPT_ASSERT(( RandomAccessRangeConcept<RandomAccessRange> ));
std::nth_element(boost::begin(rng), nth, boost::end(rng));
+ return rng;
}
/// \overload
template<class RandomAccessRange>
-inline void nth_element(const RandomAccessRange& rng,
+inline const RandomAccessRange& nth_element(const RandomAccessRange& rng,
BOOST_DEDUCED_TYPENAME range_iterator<const RandomAccessRange>::type nth)
{
BOOST_RANGE_CONCEPT_ASSERT(( RandomAccessRangeConcept<const RandomAccessRange> ));
std::nth_element(boost::begin(rng),nth,boost::end(rng));
+ return rng;
}
/// \overload
template<class RandomAccessRange, class BinaryPredicate>
-inline void nth_element(RandomAccessRange& rng,
+inline RandomAccessRange& nth_element(RandomAccessRange& rng,
BOOST_DEDUCED_TYPENAME range_iterator<RandomAccessRange>::type nth,
BinaryPredicate sort_pred)
{
BOOST_RANGE_CONCEPT_ASSERT(( RandomAccessRangeConcept<RandomAccessRange> ));
std::nth_element(boost::begin(rng), nth, boost::end(rng), sort_pred);
+ return rng;
}
/// \overload
template<class RandomAccessRange, class BinaryPredicate>
-inline void nth_element(const RandomAccessRange& rng,
+inline const RandomAccessRange& nth_element(const RandomAccessRange& rng,
BOOST_DEDUCED_TYPENAME range_iterator<const RandomAccessRange>::type nth,
BinaryPredicate sort_pred)
{
BOOST_RANGE_CONCEPT_ASSERT(( RandomAccessRangeConcept<const RandomAccessRange> ));
std::nth_element(boost::begin(rng),nth,boost::end(rng), sort_pred);
+ return rng;
}
} // namespace range
Modified: trunk/boost/range/algorithm/partial_sort.hpp
==============================================================================
--- trunk/boost/range/algorithm/partial_sort.hpp (original)
+++ trunk/boost/range/algorithm/partial_sort.hpp 2010-04-11 18:05:02 EDT (Sun, 11 Apr 2010)
@@ -27,41 +27,45 @@
/// \pre RandomAccessRange is a model of the RandomAccessRangeConcept
/// \pre BinaryPredicate is a model of the BinaryPredicateConcept
template<class RandomAccessRange>
-inline void partial_sort(RandomAccessRange& rng,
+inline RandomAccessRange& partial_sort(RandomAccessRange& rng,
BOOST_DEDUCED_TYPENAME range_iterator<RandomAccessRange>::type middle)
{
BOOST_RANGE_CONCEPT_ASSERT(( RandomAccessRangeConcept<RandomAccessRange> ));
std::partial_sort(boost::begin(rng), middle, boost::end(rng));
+ return rng;
}
/// \overload
template<class RandomAccessRange>
-inline void partial_sort(const RandomAccessRange& rng,
+inline const RandomAccessRange& partial_sort(const RandomAccessRange& rng,
BOOST_DEDUCED_TYPENAME range_iterator<const RandomAccessRange>::type middle)
{
BOOST_RANGE_CONCEPT_ASSERT(( RandomAccessRangeConcept<const RandomAccessRange> ));
std::partial_sort(boost::begin(rng), middle, boost::end(rng));
+ return rng;
}
/// \overload
template<class RandomAccessRange, class BinaryPredicate>
-inline void partial_sort(RandomAccessRange& rng,
+inline RandomAccessRange& partial_sort(RandomAccessRange& rng,
BOOST_DEDUCED_TYPENAME range_iterator<RandomAccessRange>::type middle,
BinaryPredicate sort_pred)
{
BOOST_RANGE_CONCEPT_ASSERT(( RandomAccessRangeConcept<RandomAccessRange> ));
std::partial_sort(boost::begin(rng), middle, boost::end(rng),
sort_pred);
+ return rng;
}
/// \overload
template<class RandomAccessRange, class BinaryPredicate>
-inline void partial_sort(const RandomAccessRange& rng,
+inline const RandomAccessRange& partial_sort(const RandomAccessRange& rng,
BOOST_DEDUCED_TYPENAME range_iterator<const RandomAccessRange>::type middle,
BinaryPredicate sort_pred)
{
BOOST_RANGE_CONCEPT_ASSERT(( RandomAccessRangeConcept<const RandomAccessRange> ));
std::partial_sort(boost::begin(rng), middle, boost::end(rng), sort_pred);
+ return rng;
}
} // namespace range
Modified: trunk/boost/range/algorithm_ext/erase.hpp
==============================================================================
--- trunk/boost/range/algorithm_ext/erase.hpp (original)
+++ trunk/boost/range/algorithm_ext/erase.hpp 2010-04-11 18:05:02 EDT (Sun, 11 Apr 2010)
@@ -24,29 +24,32 @@
{
template< class Container >
-inline void erase( Container& on,
+inline Container& erase( Container& on,
iterator_range<BOOST_DEDUCED_TYPENAME Container::iterator> to_erase )
{
BOOST_RANGE_CONCEPT_ASSERT(( ForwardRangeConcept<Container> ));
on.erase( boost::begin(to_erase), boost::end(to_erase) );
+ return on;
}
template< class Container, class T >
-inline void remove_erase( Container& on, const T& val )
+inline Container& remove_erase( Container& on, const T& val )
{
BOOST_RANGE_CONCEPT_ASSERT(( ForwardRangeConcept<Container> ));
on.erase(
std::remove(boost::begin(on), boost::end(on), val),
boost::end(on));
+ return on;
}
template< class Container, class Pred >
-inline void remove_erase_if( Container& on, Pred pred )
+inline Container& remove_erase_if( Container& on, Pred pred )
{
BOOST_RANGE_CONCEPT_ASSERT(( ForwardRangeConcept<Container> ));
on.erase(
std::remove_if(boost::begin(on), boost::end(on), pred),
boost::end(on));
+ return on;
}
} // namespace range
Modified: trunk/boost/range/algorithm_ext/insert.hpp
==============================================================================
--- trunk/boost/range/algorithm_ext/insert.hpp (original)
+++ trunk/boost/range/algorithm_ext/insert.hpp 2010-04-11 18:05:02 EDT (Sun, 11 Apr 2010)
@@ -23,15 +23,16 @@
{
template< class Container, class Range >
-inline void insert( Container& on,
- BOOST_DEDUCED_TYPENAME Container::iterator before,
- const Range& from )
+inline Container& insert( Container& on,
+ BOOST_DEDUCED_TYPENAME Container::iterator before,
+ const Range& from )
{
BOOST_RANGE_CONCEPT_ASSERT(( ForwardRangeConcept<Container> ));
BOOST_RANGE_CONCEPT_ASSERT(( SinglePassRangeConcept<Range> ));
BOOST_ASSERT( (void*)&on != (void*)&from &&
"cannot copy from a container to itself" );
on.insert( before, boost::begin(from), boost::end(from) );
+ return on;
}
} // namespace range
Modified: trunk/boost/range/algorithm_ext/iota.hpp
==============================================================================
--- trunk/boost/range/algorithm_ext/iota.hpp (original)
+++ trunk/boost/range/algorithm_ext/iota.hpp 2010-04-11 18:05:02 EDT (Sun, 11 Apr 2010)
@@ -22,7 +22,7 @@
{
template< class ForwardRange, class Value >
-inline void iota( ForwardRange& rng, Value x )
+inline ForwardRange& iota( ForwardRange& rng, Value x )
{
BOOST_CONCEPT_ASSERT(( ForwardRangeConcept<ForwardRange> ));
typedef BOOST_DEDUCED_TYPENAME range_iterator<ForwardRange>::type iterator_t;
@@ -30,6 +30,8 @@
iterator_t last_target = ::boost::end(rng);
for (iterator_t target = ::boost::begin(rng); target != last_target; ++target, ++x)
*target = x;
+
+ return rng;
}
} // namespace range
Modified: trunk/boost/range/algorithm_ext/push_back.hpp
==============================================================================
--- trunk/boost/range/algorithm_ext/push_back.hpp (original)
+++ trunk/boost/range/algorithm_ext/push_back.hpp 2010-04-11 18:05:02 EDT (Sun, 11 Apr 2010)
@@ -23,13 +23,14 @@
{
template< class Container, class Range >
-inline void push_back( Container& on, const Range& from )
+inline Container& push_back( Container& on, const Range& from )
{
BOOST_RANGE_CONCEPT_ASSERT(( SinglePassRangeConcept<Container> ));
BOOST_RANGE_CONCEPT_ASSERT(( SinglePassRangeConcept<const Range> ));
BOOST_ASSERT( (void*)&on != (void*)&from &&
"cannot copy from a container to itself" );
on.insert( on.end(), boost::begin(from), boost::end(from) );
+ return on;
}
} // namespace range
Modified: trunk/boost/range/algorithm_ext/push_front.hpp
==============================================================================
--- trunk/boost/range/algorithm_ext/push_front.hpp (original)
+++ trunk/boost/range/algorithm_ext/push_front.hpp 2010-04-11 18:05:02 EDT (Sun, 11 Apr 2010)
@@ -23,13 +23,14 @@
{
template< class Container, class Range >
-inline void push_front( Container& on, const Range& from )
+inline Container& push_front( Container& on, const Range& from )
{
BOOST_RANGE_CONCEPT_ASSERT(( SinglePassRangeConcept<Container> ));
BOOST_RANGE_CONCEPT_ASSERT(( SinglePassRangeConcept<const Range> ));
BOOST_ASSERT( (void*)&on != (void*)&from &&
"cannot copy from a container to itself" );
on.insert( on.begin(), boost::begin(from), boost::end(from) );
+ return on;
}
} // namespace range
Modified: trunk/libs/range/doc/html/index.html
==============================================================================
--- trunk/libs/range/doc/html/index.html (original)
+++ trunk/libs/range/doc/html/index.html 2010-04-11 18:05:02 EDT (Sun, 11 Apr 2010)
@@ -30,7 +30,7 @@
</h3></div></div>
<div><p class="copyright">Copyright © 2003 -2010 Thorsten Ottosen, Neil Groves</p></div>
<div><div class="legalnotice" title="Legal Notice">
-<a name="id2851403"></a><p>
+<a name="id3005003"></a><p>
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)
</p>
@@ -135,7 +135,7 @@
</p>
</div>
<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
-<td align="left"><p><small>Last revised: April 08, 2010 at 18:38:56 GMT</small></p></td>
+<td align="left"><p><small>Last revised: April 11, 2010 at 21:49:16 GMT</small></p></td>
<td align="right"><div class="copyright-footer"></div></td>
</tr></table>
<hr>
Modified: trunk/libs/range/doc/html/quickbook_HTML.manifest
==============================================================================
--- trunk/libs/range/doc/html/quickbook_HTML.manifest (original)
+++ trunk/libs/range/doc/html/quickbook_HTML.manifest 2010-04-11 18:05:02 EDT (Sun, 11 Apr 2010)
@@ -39,6 +39,7 @@
range/reference/algorithms/range_algorithm_mutating_algorithms/copy.html
range/reference/algorithms/range_algorithm_mutating_algorithms/copy_backward.html
range/reference/algorithms/range_algorithm_mutating_algorithms/fill.html
+range/reference/algorithms/range_algorithm_mutating_algorithms/fill_n.html
range/reference/algorithms/range_algorithm_mutating_algorithms/generate.html
range/reference/algorithms/range_algorithm_mutating_algorithms/inplace_merge.html
range/reference/algorithms/range_algorithm_mutating_algorithms/merge.html
@@ -84,6 +85,7 @@
range/reference/algorithms/heap_algorithms/push_heap.html
range/reference/algorithms/heap_algorithms/pop_heap.html
range/reference/algorithms/heap_algorithms/make_heap.html
+range/reference/algorithms/heap_algorithms/sort_heap.html
range/reference/algorithms/permutation_algorithms.html
range/reference/algorithms/permutation_algorithms/next_permutation.html
range/reference/algorithms/permutation_algorithms/prev_permutation.html
Modified: trunk/libs/range/doc/html/range/concepts/bidirectional_range.html
==============================================================================
--- trunk/libs/range/doc/html/range/concepts/bidirectional_range.html (original)
+++ trunk/libs/range/doc/html/range/concepts/bidirectional_range.html 2010-04-11 18:05:02 EDT (Sun, 11 Apr 2010)
@@ -27,7 +27,7 @@
<a name="range.concepts.bidirectional_range"></a><a class="link" href="bidirectional_range.html" title="Bidirectional Range">Bidirectional Range</a>
</h3></div></div></div>
<a name="range.concepts.bidirectional_range.notation"></a><h5>
-<a name="id2863810"></a>
+<a name="id3017410"></a>
<a class="link" href="bidirectional_range.html#range.concepts.bidirectional_range.notation">Notation</a>
</h5>
<div class="informaltable"><table class="table">
@@ -65,7 +65,7 @@
</tbody>
</table></div>
<a name="range.concepts.bidirectional_range.description"></a><h5>
-<a name="id2863908"></a>
+<a name="id3017508"></a>
<a class="link" href="bidirectional_range.html#range.concepts.bidirectional_range.description">Description</a>
</h5>
<p>
@@ -75,7 +75,7 @@
Traversal Iterator</a>.
</p>
<a name="range.concepts.bidirectional_range.refinement_of"></a><h5>
-<a name="id2863974"></a>
+<a name="id3017574"></a>
<a class="link" href="bidirectional_range.html#range.concepts.bidirectional_range.refinement_of">Refinement
of</a>
</h5>
@@ -83,7 +83,7 @@
<a class="link" href="forward_range.html" title="Forward Range">Forward Range</a>
</p>
<a name="range.concepts.bidirectional_range.associated_types"></a><h5>
-<a name="id2864002"></a>
+<a name="id3017602"></a>
<a class="link" href="bidirectional_range.html#range.concepts.bidirectional_range.associated_types">Associated
types</a>
</h5>
@@ -136,7 +136,7 @@
</tbody>
</table></div>
<a name="range.concepts.bidirectional_range.valid_expressions"></a><h5>
-<a name="id2864168"></a>
+<a name="id3017768"></a>
<a class="link" href="bidirectional_range.html#range.concepts.bidirectional_range.valid_expressions">Valid
expressions</a>
</h5>
@@ -221,7 +221,7 @@
</tbody>
</table></div>
<a name="range.concepts.bidirectional_range.complexity_guarantees"></a><h5>
-<a name="id2864647"></a>
+<a name="id3018247"></a>
<a class="link" href="bidirectional_range.html#range.concepts.bidirectional_range.complexity_guarantees">Complexity
guarantees</a>
</h5>
@@ -232,7 +232,7 @@
<a class="link" href="forward_range.html" title="Forward Range">Forward Range</a>.
</p>
<a name="range.concepts.bidirectional_range.invariants"></a><h5>
-<a name="id2864798"></a>
+<a name="id3018398"></a>
<a class="link" href="bidirectional_range.html#range.concepts.bidirectional_range.invariants">Invariants</a>
</h5>
<div class="informaltable"><table class="table">
@@ -272,7 +272,7 @@
</tbody>
</table></div>
<a name="range.concepts.bidirectional_range.see_also"></a><h5>
-<a name="id2865059"></a>
+<a name="id3018659"></a>
<a class="link" href="bidirectional_range.html#range.concepts.bidirectional_range.see_also">See also</a>
</h5>
<p>
Modified: trunk/libs/range/doc/html/range/concepts/concept_checking.html
==============================================================================
--- trunk/libs/range/doc/html/range/concepts/concept_checking.html (original)
+++ trunk/libs/range/doc/html/range/concepts/concept_checking.html 2010-04-11 18:05:02 EDT (Sun, 11 Apr 2010)
@@ -79,7 +79,7 @@
</li>
</ul></div>
<a name="range.concepts.concept_checking.see_also"></a><h5>
-<a name="id2866069"></a>
+<a name="id3019669"></a>
<a class="link" href="concept_checking.html#range.concepts.concept_checking.see_also">See also</a>
</h5>
<p>
Modified: trunk/libs/range/doc/html/range/concepts/forward_range.html
==============================================================================
--- trunk/libs/range/doc/html/range/concepts/forward_range.html (original)
+++ trunk/libs/range/doc/html/range/concepts/forward_range.html 2010-04-11 18:05:02 EDT (Sun, 11 Apr 2010)
@@ -27,7 +27,7 @@
<a name="range.concepts.forward_range"></a><a class="link" href="forward_range.html" title="Forward Range">Forward Range</a>
</h3></div></div></div>
<a name="range.concepts.forward_range.notation"></a><h5>
-<a name="id2863403"></a>
+<a name="id3017003"></a>
<a class="link" href="forward_range.html#range.concepts.forward_range.notation">Notation</a>
</h5>
<div class="informaltable"><table class="table">
@@ -65,7 +65,7 @@
</tbody>
</table></div>
<a name="range.concepts.forward_range.description"></a><h5>
-<a name="id2863499"></a>
+<a name="id3017099"></a>
<a class="link" href="forward_range.html#range.concepts.forward_range.description">Description</a>
</h5>
<p>
@@ -73,14 +73,14 @@
Traversal Iterator</a>.
</p>
<a name="range.concepts.forward_range.refinement_of"></a><h5>
-<a name="id2863571"></a>
+<a name="id3017171"></a>
<a class="link" href="forward_range.html#range.concepts.forward_range.refinement_of">Refinement of</a>
</h5>
<p>
<a class="link" href="single_pass_range.html" title="Single Pass Range">Single Pass Range</a>
</p>
<a name="range.concepts.forward_range.associated_types"></a><h5>
-<a name="id2863600"></a>
+<a name="id3017200"></a>
<a class="link" href="forward_range.html#range.concepts.forward_range.associated_types">Associated
types</a>
</h5>
@@ -132,7 +132,7 @@
</tbody>
</table></div>
<a name="range.concepts.forward_range.see_also"></a><h5>
-<a name="id2863757"></a>
+<a name="id3017357"></a>
<a class="link" href="forward_range.html#range.concepts.forward_range.see_also">See also</a>
</h5>
<p>
Modified: trunk/libs/range/doc/html/range/concepts/random_access_range.html
==============================================================================
--- trunk/libs/range/doc/html/range/concepts/random_access_range.html (original)
+++ trunk/libs/range/doc/html/range/concepts/random_access_range.html 2010-04-11 18:05:02 EDT (Sun, 11 Apr 2010)
@@ -27,7 +27,7 @@
<a name="range.concepts.random_access_range"></a><a class="link" href="random_access_range.html" title="Random Access Range">Random Access Range</a>
</h3></div></div></div>
<a name="range.concepts.random_access_range.description"></a><h5>
-<a name="id2865112"></a>
+<a name="id3018712"></a>
<a class="link" href="random_access_range.html#range.concepts.random_access_range.description">Description</a>
</h5>
<p>
@@ -35,7 +35,7 @@
Access Traversal Iterator</a>.
</p>
<a name="range.concepts.random_access_range.refinement_of"></a><h5>
-<a name="id2865184"></a>
+<a name="id3018784"></a>
<a class="link" href="random_access_range.html#range.concepts.random_access_range.refinement_of">Refinement
of</a>
</h5>
@@ -43,7 +43,7 @@
<a class="link" href="bidirectional_range.html" title="Bidirectional Range">Bidirectional Range</a>
</p>
<a name="range.concepts.random_access_range.valid_expressions"></a><h5>
-<a name="id2865212"></a>
+<a name="id3018812"></a>
<a class="link" href="random_access_range.html#range.concepts.random_access_range.valid_expressions">Valid
expressions</a>
</h5>
@@ -89,7 +89,7 @@
</tr></tbody>
</table></div>
<a name="range.concepts.random_access_range.expression_semantics"></a><h5>
-<a name="id2865359"></a>
+<a name="id3018959"></a>
<a class="link" href="random_access_range.html#range.concepts.random_access_range.expression_semantics">Expression
semantics</a>
</h5>
@@ -139,7 +139,7 @@
</tr></tbody>
</table></div>
<a name="range.concepts.random_access_range.complexity_guarantees"></a><h5>
-<a name="id2865585"></a>
+<a name="id3019185"></a>
<a class="link" href="random_access_range.html#range.concepts.random_access_range.complexity_guarantees">Complexity
guarantees</a>
</h5>
@@ -147,7 +147,7 @@
<code class="computeroutput"><span class="identifier">boost</span><span class="special">::</span><span class="identifier">size</span><span class="special">(</span><span class="identifier">a</span><span class="special">)</span></code> completes in amortized constant time.
</p>
<a name="range.concepts.random_access_range.invariants"></a><h5>
-<a name="id2865639"></a>
+<a name="id3019239"></a>
<a class="link" href="random_access_range.html#range.concepts.random_access_range.invariants">Invariants</a>
</h5>
<div class="informaltable"><table class="table">
Modified: trunk/libs/range/doc/html/range/concepts/single_pass_range.html
==============================================================================
--- trunk/libs/range/doc/html/range/concepts/single_pass_range.html (original)
+++ trunk/libs/range/doc/html/range/concepts/single_pass_range.html 2010-04-11 18:05:02 EDT (Sun, 11 Apr 2010)
@@ -27,7 +27,7 @@
<a name="range.concepts.single_pass_range"></a><a class="link" href="single_pass_range.html" title="Single Pass Range">Single Pass Range</a>
</h3></div></div></div>
<a name="range.concepts.single_pass_range.notation"></a><h5>
-<a name="id2862025"></a>
+<a name="id3015625"></a>
<a class="link" href="single_pass_range.html#range.concepts.single_pass_range.notation">Notation</a>
</h5>
<div class="informaltable"><table class="table">
@@ -65,7 +65,7 @@
</tbody>
</table></div>
<a name="range.concepts.single_pass_range.description"></a><h5>
-<a name="id2862127"></a>
+<a name="id3015727"></a>
<a class="link" href="single_pass_range.html#range.concepts.single_pass_range.description">Description</a>
</h5>
<p>
@@ -73,7 +73,7 @@
Pass Iterator</a>.
</p>
<a name="range.concepts.single_pass_range.associated_types"></a><h5>
-<a name="id2862199"></a>
+<a name="id3015799"></a>
<a class="link" href="single_pass_range.html#range.concepts.single_pass_range.associated_types">Associated
types</a>
</h5>
@@ -126,7 +126,7 @@
</tbody>
</table></div>
<a name="range.concepts.single_pass_range.valid_expressions"></a><h5>
-<a name="id2862373"></a>
+<a name="id3015973"></a>
<a class="link" href="single_pass_range.html#range.concepts.single_pass_range.valid_expressions">Valid
expressions</a>
</h5>
@@ -198,7 +198,7 @@
</tbody>
</table></div>
<a name="range.concepts.single_pass_range.expression_semantics"></a><h5>
-<a name="id2862707"></a>
+<a name="id3016307"></a>
<a class="link" href="single_pass_range.html#range.concepts.single_pass_range.expression_semantics">Expression
semantics</a>
</h5>
@@ -266,7 +266,7 @@
</tbody>
</table></div>
<a name="range.concepts.single_pass_range.complexity_guarantees"></a><h5>
-<a name="id2862978"></a>
+<a name="id3016578"></a>
<a class="link" href="single_pass_range.html#range.concepts.single_pass_range.complexity_guarantees">Complexity
guarantees</a>
</h5>
@@ -276,7 +276,7 @@
constant time.
</p>
<a name="range.concepts.single_pass_range.invariants"></a><h5>
-<a name="id2863061"></a>
+<a name="id3016661"></a>
<a class="link" href="single_pass_range.html#range.concepts.single_pass_range.invariants">Invariants</a>
</h5>
<div class="informaltable"><table class="table">
@@ -316,7 +316,7 @@
</tbody>
</table></div>
<a name="range.concepts.single_pass_range.see_also"></a><h5>
-<a name="id2863332"></a>
+<a name="id3016932"></a>
<a class="link" href="single_pass_range.html#range.concepts.single_pass_range.see_also">See also</a>
</h5>
<p>
Modified: trunk/libs/range/doc/html/range/mfc_atl.html
==============================================================================
--- trunk/libs/range/doc/html/range/mfc_atl.html (original)
+++ trunk/libs/range/doc/html/range/mfc_atl.html 2010-04-11 18:05:02 EDT (Sun, 11 Apr 2010)
@@ -34,7 +34,7 @@
<dt><span class="section"> References</span></dt>
</dl></div>
<a name="range.mfc_atl.introduction"></a><h5>
-<a name="id2973418"></a>
+<a name="id3128780"></a>
<a class="link" href="mfc_atl.html#range.mfc_atl.introduction">Introduction</a>
</h5>
<p>
@@ -100,7 +100,7 @@
</tbody>
</table></div>
<a name="range.mfc_atl.overview"></a><h5>
-<a name="id2973556"></a>
+<a name="id3128918"></a>
<a class="link" href="mfc_atl.html#range.mfc_atl.overview">Overview</a>
</h5>
<p>
Modified: trunk/libs/range/doc/html/range/reference/adaptors/adaptors_introduction.html
==============================================================================
--- trunk/libs/range/doc/html/range/reference/adaptors/adaptors_introduction.html (original)
+++ trunk/libs/range/doc/html/range/reference/adaptors/adaptors_introduction.html 2010-04-11 18:05:02 EDT (Sun, 11 Apr 2010)
@@ -122,7 +122,7 @@
situations, you will really appreciate the succinctness of <code class="computeroutput"><span class="keyword">operator</span><span class="special">|()</span></code>.
</p>
<a name="range.reference.adaptors.adaptors_introduction.composition_of_adaptors"></a><h6>
-<a name="id2873037"></a>
+<a name="id3026637"></a>
<a class="link" href="adaptors_introduction.html#range.reference.adaptors.adaptors_introduction.composition_of_adaptors">Composition
of Adaptors</a>
</h6>
@@ -159,7 +159,7 @@
is the design solution to this problem.
</p>
<a name="range.reference.adaptors.adaptors_introduction.range_adaptor_alternative_to_copy_if_algorithm"></a><h6>
-<a name="id2873347"></a>
+<a name="id3026947"></a>
<a class="link" href="adaptors_introduction.html#range.reference.adaptors.adaptors_introduction.range_adaptor_alternative_to_copy_if_algorithm">Range
Adaptor alternative to copy_if algorithm</a>
</h6>
@@ -176,7 +176,7 @@
<p>
</p>
<a name="range.reference.adaptors.adaptors_introduction.range_adaptor_alternative_to_count_if_algorithm"></a><h6>
-<a name="id2873516"></a>
+<a name="id3027116"></a>
<a class="link" href="adaptors_introduction.html#range.reference.adaptors.adaptors_introduction.range_adaptor_alternative_to_count_if_algorithm">Range
Adaptor alternative to count_if algorithm</a>
</h6>
Modified: trunk/libs/range/doc/html/range/reference/algorithms/heap_algorithms.html
==============================================================================
--- trunk/libs/range/doc/html/range/reference/algorithms/heap_algorithms.html (original)
+++ trunk/libs/range/doc/html/range/reference/algorithms/heap_algorithms.html 2010-04-11 18:05:02 EDT (Sun, 11 Apr 2010)
@@ -33,6 +33,8 @@
pop_heap</a></span></dt>
<dt><span class="section"><a href="heap_algorithms/make_heap.html">
make_heap</a></span></dt>
+<dt><span class="section"><a href="heap_algorithms/sort_heap.html">
+ sort_heap</a></span></dt>
</dl></div>
</div>
<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
Modified: trunk/libs/range/doc/html/range/reference/algorithms/heap_algorithms/make_heap.html
==============================================================================
--- trunk/libs/range/doc/html/range/reference/algorithms/heap_algorithms/make_heap.html (original)
+++ trunk/libs/range/doc/html/range/reference/algorithms/heap_algorithms/make_heap.html 2010-04-11 18:05:02 EDT (Sun, 11 Apr 2010)
@@ -7,7 +7,7 @@
<link rel="home" href="../../../../index.html" title="Chapter 1. Range 2.0">
<link rel="up" href="../heap_algorithms.html" title="Heap algorithms">
<link rel="prev" href="pop_heap.html" title="pop_heap">
-<link rel="next" href="../permutation_algorithms.html" title="Permutation algorithms">
+<link rel="next" href="sort_heap.html" title="sort_heap">
</head>
<body bgcolor="white" text="black" link="#0000FF" vlink="#840084" alink="#0000FF">
<table cellpadding="2" width="100%"><tr>
@@ -20,7 +20,7 @@
</tr></table>
<hr>
<div class="spirit-nav">
-<a accesskey="p" href="pop_heap.html"><img src="../../../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../heap_algorithms.html"><img src="../../../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../../../index.html"><img src="../../../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="../permutation_algorithms.html"><img src="../../../../../../../../doc/html/images/next.png" alt="Next"></a>
+<a accesskey="p" href="pop_heap.html"><img src="../../../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../heap_algorithms.html"><img src="../../../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../../../index.html"><img src="../../../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="sort_heap.html"><img src="../../../../../../../../doc/html/images/next.png" alt="Next"></a>
</div>
<div class="section" title="make_heap">
<div class="titlepage"><div><div><h5 class="title">
@@ -28,28 +28,28 @@
make_heap</a>
</h5></div></div></div>
<a name="range.reference.algorithms.heap_algorithms.make_heap.prototype"></a><h6>
-<a name="id2945038"></a>
+<a name="id3099191"></a>
<a class="link" href="make_heap.html#range.reference.algorithms.heap_algorithms.make_heap.prototype">Prototype</a>
</h6>
<p>
</p>
<pre class="programlisting"><span class="keyword">template</span><span class="special"><</span><span class="keyword">class</span> <span class="identifier">RandomAccessRange</span><span class="special">></span>
-<span class="keyword">void</span> <span class="identifier">make_heap</span><span class="special">(</span><span class="identifier">RandomAccessRange</span><span class="special">&</span> <span class="identifier">rng</span><span class="special">);</span>
+<span class="identifier">RandomAccessRange</span><span class="special">&</span> <span class="identifier">make_heap</span><span class="special">(</span><span class="identifier">RandomAccessRange</span><span class="special">&</span> <span class="identifier">rng</span><span class="special">);</span>
<span class="keyword">template</span><span class="special"><</span><span class="keyword">class</span> <span class="identifier">RandomAccessRange</span><span class="special">></span>
-<span class="keyword">void</span> <span class="identifier">make_heap</span><span class="special">(</span><span class="keyword">const</span> <span class="identifier">RandomAccessRange</span><span class="special">&</span> <span class="identifier">rng</span><span class="special">);</span>
+<span class="keyword">const</span> <span class="identifier">RandomAccessRange</span><span class="special">&</span> <span class="identifier">make_heap</span><span class="special">(</span><span class="keyword">const</span> <span class="identifier">RandomAccessRange</span><span class="special">&</span> <span class="identifier">rng</span><span class="special">);</span>
<span class="keyword">template</span><span class="special"><</span><span class="keyword">class</span> <span class="identifier">RandomAccessRange</span><span class="special">,</span> <span class="keyword">class</span> <span class="identifier">Compare</span><span class="special">></span>
-<span class="keyword">void</span> <span class="identifier">make_heap</span><span class="special">(</span><span class="identifier">RandomAccessRange</span><span class="special">&</span> <span class="identifier">rng</span><span class="special">,</span> <span class="identifier">Compare</span> <span class="identifier">pred</span><span class="special">);</span>
+<span class="identifier">RandomAccessRange</span><span class="special">&</span> <span class="identifier">make_heap</span><span class="special">(</span><span class="identifier">RandomAccessRange</span><span class="special">&</span> <span class="identifier">rng</span><span class="special">,</span> <span class="identifier">Compare</span> <span class="identifier">pred</span><span class="special">);</span>
<span class="keyword">template</span><span class="special"><</span><span class="keyword">class</span> <span class="identifier">RandomAccessRange</span><span class="special">,</span> <span class="keyword">class</span> <span class="identifier">Compare</span><span class="special">></span>
-<span class="keyword">void</span> <span class="identifier">make_heap</span><span class="special">(</span><span class="keyword">const</span> <span class="identifier">RandomAccessRange</span><span class="special">&</span> <span class="identifier">rng</span><span class="special">,</span> <span class="identifier">Compare</span> <span class="identifier">pred</span><span class="special">);</span>
+<span class="keyword">const</span> <span class="identifier">RandomAccessRange</span><span class="special">&</span> <span class="identifier">make_heap</span><span class="special">(</span><span class="keyword">const</span> <span class="identifier">RandomAccessRange</span><span class="special">&</span> <span class="identifier">rng</span><span class="special">,</span> <span class="identifier">Compare</span> <span class="identifier">pred</span><span class="special">);</span>
</pre>
<p>
</p>
<a name="range.reference.algorithms.heap_algorithms.make_heap.description"></a><h6>
-<a name="id2945388"></a>
+<a name="id3099573"></a>
<a class="link" href="make_heap.html#range.reference.algorithms.heap_algorithms.make_heap.description">Description</a>
</h6>
<p>
@@ -61,14 +61,14 @@
the predicate versions.
</p>
<a name="range.reference.algorithms.heap_algorithms.make_heap.definition"></a><h6>
-<a name="id2945468"></a>
+<a name="id3099653"></a>
<a class="link" href="make_heap.html#range.reference.algorithms.heap_algorithms.make_heap.definition">Definition</a>
</h6>
<p>
Defined in the header file <code class="computeroutput"><span class="identifier">boost</span><span class="special">/</span><span class="identifier">range</span><span class="special">/</span><span class="identifier">algorithm</span><span class="special">/</span><span class="identifier">heap_algorithm</span><span class="special">.</span><span class="identifier">hpp</span></code>
</p>
<a name="range.reference.algorithms.heap_algorithms.make_heap.requirements"></a><h6>
-<a name="id2945542"></a>
+<a name="id3099726"></a>
<a class="link" href="make_heap.html#range.reference.algorithms.heap_algorithms.make_heap.requirements">Requirements</a>
</h6>
<p>
@@ -119,7 +119,7 @@
</li>
</ul></div>
<a name="range.reference.algorithms.heap_algorithms.make_heap.complexity"></a><h6>
-<a name="id2945778"></a>
+<a name="id3099962"></a>
<a class="link" href="make_heap.html#range.reference.algorithms.heap_algorithms.make_heap.complexity">Complexity</a>
</h6>
<p>
@@ -138,7 +138,7 @@
</tr></table>
<hr>
<div class="spirit-nav">
-<a accesskey="p" href="pop_heap.html"><img src="../../../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../heap_algorithms.html"><img src="../../../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../../../index.html"><img src="../../../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="../permutation_algorithms.html"><img src="../../../../../../../../doc/html/images/next.png" alt="Next"></a>
+<a accesskey="p" href="pop_heap.html"><img src="../../../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../heap_algorithms.html"><img src="../../../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../../../index.html"><img src="../../../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="sort_heap.html"><img src="../../../../../../../../doc/html/images/next.png" alt="Next"></a>
</div>
</body>
</html>
Modified: trunk/libs/range/doc/html/range/reference/algorithms/heap_algorithms/pop_heap.html
==============================================================================
--- trunk/libs/range/doc/html/range/reference/algorithms/heap_algorithms/pop_heap.html (original)
+++ trunk/libs/range/doc/html/range/reference/algorithms/heap_algorithms/pop_heap.html 2010-04-11 18:05:02 EDT (Sun, 11 Apr 2010)
@@ -28,28 +28,28 @@
pop_heap</a>
</h5></div></div></div>
<a name="range.reference.algorithms.heap_algorithms.pop_heap.prototype"></a><h6>
-<a name="id2944059"></a>
+<a name="id3098182"></a>
<a class="link" href="pop_heap.html#range.reference.algorithms.heap_algorithms.pop_heap.prototype">Prototype</a>
</h6>
<p>
</p>
<pre class="programlisting"><span class="keyword">template</span><span class="special"><</span><span class="keyword">class</span> <span class="identifier">RandomAccessRange</span><span class="special">></span>
-<span class="keyword">void</span> <span class="identifier">pop_heap</span><span class="special">(</span><span class="identifier">RandomAccessRange</span><span class="special">&</span> <span class="identifier">rng</span><span class="special">);</span>
+<span class="identifier">RandomAccessRange</span><span class="special">&</span> <span class="identifier">pop_heap</span><span class="special">(</span><span class="identifier">RandomAccessRange</span><span class="special">&</span> <span class="identifier">rng</span><span class="special">);</span>
<span class="keyword">template</span><span class="special"><</span><span class="keyword">class</span> <span class="identifier">RandomAccessRange</span><span class="special">></span>
-<span class="keyword">void</span> <span class="identifier">pop_heap</span><span class="special">(</span><span class="keyword">const</span> <span class="identifier">RandomAccessRange</span><span class="special">&</span> <span class="identifier">rng</span><span class="special">);</span>
+<span class="keyword">const</span> <span class="identifier">RandomAccessRange</span><span class="special">&</span> <span class="identifier">pop_heap</span><span class="special">(</span><span class="keyword">const</span> <span class="identifier">RandomAccessRange</span><span class="special">&</span> <span class="identifier">rng</span><span class="special">);</span>
<span class="keyword">template</span><span class="special"><</span><span class="keyword">class</span> <span class="identifier">RandomAccessRange</span><span class="special">,</span> <span class="keyword">class</span> <span class="identifier">Compare</span><span class="special">></span>
-<span class="keyword">void</span> <span class="identifier">pop_heap</span><span class="special">(</span><span class="identifier">RandomAccessRange</span><span class="special">&</span> <span class="identifier">rng</span><span class="special">,</span> <span class="identifier">Compare</span> <span class="identifier">pred</span><span class="special">);</span>
+<span class="identifier">RandomAccessRange</span><span class="special">&</span> <span class="identifier">pop_heap</span><span class="special">(</span><span class="identifier">RandomAccessRange</span><span class="special">&</span> <span class="identifier">rng</span><span class="special">,</span> <span class="identifier">Compare</span> <span class="identifier">pred</span><span class="special">);</span>
<span class="keyword">template</span><span class="special"><</span><span class="keyword">class</span> <span class="identifier">RandomAccessRange</span><span class="special">,</span> <span class="keyword">class</span> <span class="identifier">Compare</span><span class="special">></span>
-<span class="keyword">void</span> <span class="identifier">pop_heap</span><span class="special">(</span><span class="keyword">const</span> <span class="identifier">RandomAccessRange</span><span class="special">&</span> <span class="identifier">rng</span><span class="special">,</span> <span class="identifier">Compare</span> <span class="identifier">pred</span><span class="special">);</span>
+<span class="keyword">const</span> <span class="identifier">RandomAccessRange</span><span class="special">&</span> <span class="identifier">pop_heap</span><span class="special">(</span><span class="keyword">const</span> <span class="identifier">RandomAccessRange</span><span class="special">&</span> <span class="identifier">rng</span><span class="special">,</span> <span class="identifier">Compare</span> <span class="identifier">pred</span><span class="special">);</span>
</pre>
<p>
</p>
<a name="range.reference.algorithms.heap_algorithms.pop_heap.description"></a><h6>
-<a name="id2944409"></a>
+<a name="id3098562"></a>
<a class="link" href="pop_heap.html#range.reference.algorithms.heap_algorithms.pop_heap.description">Description</a>
</h6>
<p>
@@ -63,14 +63,14 @@
the predicate versions.
</p>
<a name="range.reference.algorithms.heap_algorithms.pop_heap.definition"></a><h6>
-<a name="id2944569"></a>
+<a name="id3098722"></a>
<a class="link" href="pop_heap.html#range.reference.algorithms.heap_algorithms.pop_heap.definition">Definition</a>
</h6>
<p>
Defined in the header file <code class="computeroutput"><span class="identifier">boost</span><span class="special">/</span><span class="identifier">range</span><span class="special">/</span><span class="identifier">algorithm</span><span class="special">/</span><span class="identifier">heap_algorithm</span><span class="special">.</span><span class="identifier">hpp</span></code>
</p>
<a name="range.reference.algorithms.heap_algorithms.pop_heap.requirements"></a><h6>
-<a name="id2944642"></a>
+<a name="id3098795"></a>
<a class="link" href="pop_heap.html#range.reference.algorithms.heap_algorithms.pop_heap.requirements">Requirements</a>
</h6>
<p>
@@ -121,7 +121,7 @@
</li>
</ul></div>
<a name="range.reference.algorithms.heap_algorithms.pop_heap.precondition_"></a><h6>
-<a name="id2944877"></a>
+<a name="id3099031"></a>
<a class="link" href="pop_heap.html#range.reference.algorithms.heap_algorithms.pop_heap.precondition_">Precondition:</a>
</h6>
<div class="itemizedlist"><ul class="itemizedlist" type="disc">
@@ -131,7 +131,7 @@
</li>
</ul></div>
<a name="range.reference.algorithms.heap_algorithms.pop_heap.complexity"></a><h6>
-<a name="id2944948"></a>
+<a name="id3099102"></a>
<a class="link" href="pop_heap.html#range.reference.algorithms.heap_algorithms.pop_heap.complexity">Complexity</a>
</h6>
<p>
Modified: trunk/libs/range/doc/html/range/reference/algorithms/heap_algorithms/push_heap.html
==============================================================================
--- trunk/libs/range/doc/html/range/reference/algorithms/heap_algorithms/push_heap.html (original)
+++ trunk/libs/range/doc/html/range/reference/algorithms/heap_algorithms/push_heap.html 2010-04-11 18:05:02 EDT (Sun, 11 Apr 2010)
@@ -28,28 +28,28 @@
push_heap</a>
</h5></div></div></div>
<a name="range.reference.algorithms.heap_algorithms.push_heap.prototype"></a><h6>
-<a name="id2943039"></a>
+<a name="id3097132"></a>
<a class="link" href="push_heap.html#range.reference.algorithms.heap_algorithms.push_heap.prototype">Prototype</a>
</h6>
<p>
</p>
<pre class="programlisting"><span class="keyword">template</span><span class="special"><</span><span class="keyword">class</span> <span class="identifier">RandomAccessRange</span><span class="special">></span>
-<span class="keyword">void</span> <span class="identifier">push_heap</span><span class="special">(</span><span class="identifier">RandomAccessRange</span><span class="special">&</span> <span class="identifier">rng</span><span class="special">);</span>
+<span class="identifier">RandomAccessRange</span><span class="special">&</span> <span class="identifier">push_heap</span><span class="special">(</span><span class="identifier">RandomAccessRange</span><span class="special">&</span> <span class="identifier">rng</span><span class="special">);</span>
<span class="keyword">template</span><span class="special"><</span><span class="keyword">class</span> <span class="identifier">RandomAccessRange</span><span class="special">></span>
-<span class="keyword">void</span> <span class="identifier">push_heap</span><span class="special">(</span><span class="keyword">const</span> <span class="identifier">RandomAccessRange</span><span class="special">&</span> <span class="identifier">rng</span><span class="special">);</span>
+<span class="keyword">const</span> <span class="identifier">RandomAccessRange</span><span class="special">&</span> <span class="identifier">push_heap</span><span class="special">(</span><span class="keyword">const</span> <span class="identifier">RandomAccessRange</span><span class="special">&</span> <span class="identifier">rng</span><span class="special">);</span>
<span class="keyword">template</span><span class="special"><</span><span class="keyword">class</span> <span class="identifier">RandomAccessRange</span><span class="special">,</span> <span class="keyword">class</span> <span class="identifier">Compare</span><span class="special">></span>
-<span class="keyword">void</span> <span class="identifier">push_heap</span><span class="special">(</span><span class="identifier">RandomAccessRange</span><span class="special">&</span> <span class="identifier">rng</span><span class="special">,</span> <span class="identifier">Compare</span> <span class="identifier">pred</span><span class="special">);</span>
+<span class="identifier">RandomAccessRange</span><span class="special">&</span> <span class="identifier">push_heap</span><span class="special">(</span><span class="identifier">RandomAccessRange</span><span class="special">&</span> <span class="identifier">rng</span><span class="special">,</span> <span class="identifier">Compare</span> <span class="identifier">pred</span><span class="special">);</span>
<span class="keyword">template</span><span class="special"><</span><span class="keyword">class</span> <span class="identifier">RandomAccessRange</span><span class="special">,</span> <span class="keyword">class</span> <span class="identifier">Compare</span><span class="special">></span>
-<span class="keyword">void</span> <span class="identifier">push_heap</span><span class="special">(</span><span class="keyword">const</span> <span class="identifier">RandomAccessRange</span><span class="special">&</span> <span class="identifier">rng</span><span class="special">,</span> <span class="identifier">Compare</span> <span class="identifier">pred</span><span class="special">);</span>
+<span class="keyword">const</span> <span class="identifier">RandomAccessRange</span><span class="special">&</span> <span class="identifier">push_heap</span><span class="special">(</span><span class="keyword">const</span> <span class="identifier">RandomAccessRange</span><span class="special">&</span> <span class="identifier">rng</span><span class="special">,</span> <span class="identifier">Compare</span> <span class="identifier">pred</span><span class="special">);</span>
</pre>
<p>
</p>
<a name="range.reference.algorithms.heap_algorithms.push_heap.description"></a><h6>
-<a name="id2943390"></a>
+<a name="id3097513"></a>
<a class="link" href="push_heap.html#range.reference.algorithms.heap_algorithms.push_heap.description">Description</a>
</h6>
<p>
@@ -63,14 +63,14 @@
the predicate versions.
</p>
<a name="range.reference.algorithms.heap_algorithms.push_heap.definition"></a><h6>
-<a name="id2943554"></a>
+<a name="id3097678"></a>
<a class="link" href="push_heap.html#range.reference.algorithms.heap_algorithms.push_heap.definition">Definition</a>
</h6>
<p>
Defined in the header file <code class="computeroutput"><span class="identifier">boost</span><span class="special">/</span><span class="identifier">range</span><span class="special">/</span><span class="identifier">algorithm</span><span class="special">/</span><span class="identifier">heap_algorithm</span><span class="special">.</span><span class="identifier">hpp</span></code>
</p>
<a name="range.reference.algorithms.heap_algorithms.push_heap.requirements"></a><h6>
-<a name="id2943628"></a>
+<a name="id3097751"></a>
<a class="link" href="push_heap.html#range.reference.algorithms.heap_algorithms.push_heap.requirements">Requirements</a>
</h6>
<p>
@@ -121,7 +121,7 @@
</li>
</ul></div>
<a name="range.reference.algorithms.heap_algorithms.push_heap.precondition_"></a><h6>
-<a name="id2943864"></a>
+<a name="id3097987"></a>
<a class="link" href="push_heap.html#range.reference.algorithms.heap_algorithms.push_heap.precondition_">Precondition:</a>
</h6>
<div class="itemizedlist"><ul class="itemizedlist" type="disc">
@@ -131,7 +131,7 @@
</li>
</ul></div>
<a name="range.reference.algorithms.heap_algorithms.push_heap.complexity"></a><h6>
-<a name="id2943981"></a>
+<a name="id3098104"></a>
<a class="link" href="push_heap.html#range.reference.algorithms.heap_algorithms.push_heap.complexity">Complexity</a>
</h6>
<p>
Added: trunk/libs/range/doc/html/range/reference/algorithms/heap_algorithms/sort_heap.html
==============================================================================
--- (empty file)
+++ trunk/libs/range/doc/html/range/reference/algorithms/heap_algorithms/sort_heap.html 2010-04-11 18:05:02 EDT (Sun, 11 Apr 2010)
@@ -0,0 +1,153 @@
+<html>
+<head>
+<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
+<title>sort_heap</title>
+<link rel="stylesheet" href="../../../../../../../../doc/html/boostbook.css" type="text/css">
+<meta name="generator" content="DocBook XSL Stylesheets V1.75.1">
+<link rel="home" href="../../../../index.html" title="Chapter 1. Range 2.0">
+<link rel="up" href="../heap_algorithms.html" title="Heap algorithms">
+<link rel="prev" href="make_heap.html" title="make_heap">
+<link rel="next" href="../permutation_algorithms.html" title="Permutation algorithms">
+</head>
+<body bgcolor="white" text="black" link="#0000FF" vlink="#840084" alink="#0000FF">
+<table cellpadding="2" width="100%"><tr>
+<td valign="top"><img alt="Boost C++ Libraries" width="277" height="86" src="../../../../../../../../boost.png"></td>
+<td align="center">Home</td>
+<td align="center">Libraries</td>
+<td align="center">People</td>
+<td align="center">FAQ</td>
+<td align="center">More</td>
+</tr></table>
+<hr>
+<div class="spirit-nav">
+<a accesskey="p" href="make_heap.html"><img src="../../../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../heap_algorithms.html"><img src="../../../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../../../index.html"><img src="../../../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="../permutation_algorithms.html"><img src="../../../../../../../../doc/html/images/next.png" alt="Next"></a>
+</div>
+<div class="section" title="sort_heap">
+<div class="titlepage"><div><div><h5 class="title">
+<a name="range.reference.algorithms.heap_algorithms.sort_heap"></a><a class="link" href="sort_heap.html" title="sort_heap">
+ sort_heap</a>
+</h5></div></div></div>
+<a name="range.reference.algorithms.heap_algorithms.sort_heap.prototype"></a><h6>
+<a name="id3100042"></a>
+ <a class="link" href="sort_heap.html#range.reference.algorithms.heap_algorithms.sort_heap.prototype">Prototype</a>
+ </h6>
+<p>
+
+</p>
+<pre class="programlisting"><span class="keyword">template</span><span class="special"><</span><span class="keyword">class</span> <span class="identifier">RandomAccessRange</span><span class="special">></span>
+<span class="identifier">RandomAccessRange</span><span class="special">&</span> <span class="identifier">sort_heap</span><span class="special">(</span><span class="identifier">RandomAccessRange</span><span class="special">&</span> <span class="identifier">rng</span><span class="special">);</span>
+
+<span class="keyword">template</span><span class="special"><</span><span class="keyword">class</span> <span class="identifier">RandomAccessRange</span><span class="special">></span>
+<span class="keyword">const</span> <span class="identifier">RandomAccessRange</span><span class="special">&</span> <span class="identifier">sort_heap</span><span class="special">(</span><span class="keyword">const</span> <span class="identifier">RandomAccessRange</span><span class="special">&</span> <span class="identifier">rng</span><span class="special">);</span>
+
+<span class="keyword">template</span><span class="special"><</span><span class="keyword">class</span> <span class="identifier">RandomAccessRange</span><span class="special">,</span> <span class="keyword">class</span> <span class="identifier">Compare</span><span class="special">></span>
+<span class="identifier">RandomAccessRange</span><span class="special">&</span> <span class="identifier">sort_heap</span><span class="special">(</span><span class="identifier">RandomAccessRange</span><span class="special">&</span> <span class="identifier">rng</span><span class="special">,</span> <span class="identifier">Compare</span> <span class="identifier">pred</span><span class="special">);</span>
+
+<span class="keyword">template</span><span class="special"><</span><span class="keyword">class</span> <span class="identifier">RandomAccessRange</span><span class="special">,</span> <span class="keyword">class</span> <span class="identifier">Compare</span><span class="special">></span>
+<span class="keyword">const</span> <span class="identifier">RandomAccessRange</span><span class="special">&</span> <span class="identifier">sort_heap</span><span class="special">(</span><span class="keyword">const</span> <span class="identifier">RandomAccessRange</span><span class="special">&</span> <span class="identifier">rng</span><span class="special">,</span> <span class="identifier">Compare</span> <span class="identifier">pred</span><span class="special">);</span>
+</pre>
+<p>
+ </p>
+<a name="range.reference.algorithms.heap_algorithms.sort_heap.description"></a><h6>
+<a name="id3100424"></a>
+ <a class="link" href="sort_heap.html#range.reference.algorithms.heap_algorithms.sort_heap.description">Description</a>
+ </h6>
+<p>
+ <code class="computeroutput"><span class="identifier">sort_heap</span></code> turns a heap
+ into a sorted range.
+ </p>
+<p>
+ The ordering relationship is determined by using <code class="computeroutput"><span class="keyword">operator</span><span class="special"><</span></code> in the non-predicate versions, and
+ by evaluating <code class="computeroutput"><span class="identifier">pred</span></code> in
+ the predicate versions.
+ </p>
+<a name="range.reference.algorithms.heap_algorithms.sort_heap.definition"></a><h6>
+<a name="id3100494"></a>
+ <a class="link" href="sort_heap.html#range.reference.algorithms.heap_algorithms.sort_heap.definition">Definition</a>
+ </h6>
+<p>
+ Defined in the header file <code class="computeroutput"><span class="identifier">boost</span><span class="special">/</span><span class="identifier">range</span><span class="special">/</span><span class="identifier">algorithm</span><span class="special">/</span><span class="identifier">heap_algorithm</span><span class="special">.</span><span class="identifier">hpp</span></code>
+ </p>
+<a name="range.reference.algorithms.heap_algorithms.sort_heap.requirements"></a><h6>
+<a name="id3100567"></a>
+ <a class="link" href="sort_heap.html#range.reference.algorithms.heap_algorithms.sort_heap.requirements">Requirements</a>
+ </h6>
+<p>
+ <span class="bold"><strong>For the non-predicate versions:</strong></span>
+ </p>
+<div class="itemizedlist"><ul class="itemizedlist" type="disc">
+<li class="listitem">
+<code class="computeroutput"><span class="identifier">RandomAccessRange</span></code> is
+ a model of the <a class="link" href="../../../concepts/random_access_range.html" title="Random Access Range">Random
+ Access Range</a> Concept.
+ </li>
+<li class="listitem">
+<code class="computeroutput"><span class="identifier">RandomAccessRange</span></code> is
+ mutable.
+ </li>
+<li class="listitem">
+<code class="computeroutput"><span class="identifier">RandomAccessRange</span></code>'s
+ value type is a model of the <code class="computeroutput"><span class="identifier">LessThanComparableConcept</span></code>.
+ </li>
+<li class="listitem">
+ The ordering of objects of type <code class="computeroutput"><span class="identifier">RandomAccessRange</span></code>'s
+ value type is a <span class="bold"><strong><span class="emphasis"><em>strict weak ordering</em></span></strong></span>,
+ as defined in the <code class="computeroutput"><span class="identifier">LessThanComparableConcept</span></code>
+ requirements.
+ </li>
+</ul></div>
+<p>
+ <span class="bold"><strong>For the predicate versions:</strong></span>
+ </p>
+<div class="itemizedlist"><ul class="itemizedlist" type="disc">
+<li class="listitem">
+<code class="computeroutput"><span class="identifier">RandomAccessRange</span></code> is
+ a model of the <a class="link" href="../../../concepts/random_access_range.html" title="Random Access Range">Random
+ Access Range</a> Concept.
+ </li>
+<li class="listitem">
+<code class="computeroutput"><span class="identifier">RandomAccessRange</span></code> is
+ mutable.
+ </li>
+<li class="listitem">
+<code class="computeroutput"><span class="identifier">Compare</span></code> is a model
+ of the <code class="computeroutput"><span class="identifier">StrictWeakOrderingConcept</span></code>.
+ </li>
+<li class="listitem">
+<code class="computeroutput"><span class="identifier">RandomAccessRange</span></code>'s
+ value type is convertible to both of <code class="computeroutput"><span class="identifier">Compare</span></code>'s
+ argument types.
+ </li>
+</ul></div>
+<a name="range.reference.algorithms.heap_algorithms.sort_heap.precondition_"></a><h6>
+<a name="id3100803"></a>
+ <a class="link" href="sort_heap.html#range.reference.algorithms.heap_algorithms.sort_heap.precondition_">Precondition:</a>
+ </h6>
+<p>
+ <code class="computeroutput"><span class="identifier">rng</span></code> is a heap.
+ </p>
+<a name="range.reference.algorithms.heap_algorithms.sort_heap.complexity"></a><h6>
+<a name="id3100840"></a>
+ <a class="link" href="sort_heap.html#range.reference.algorithms.heap_algorithms.sort_heap.complexity">Complexity</a>
+ </h6>
+<p>
+ At most <code class="computeroutput"><span class="identifier">N</span> <span class="special">*</span>
+ <span class="identifier">log</span><span class="special">(</span><span class="identifier">N</span><span class="special">)</span></code>
+ comparisons, where <code class="computeroutput"><span class="identifier">N</span></code>
+ is <code class="computeroutput"><span class="identifier">distance</span><span class="special">(</span><span class="identifier">rng</span><span class="special">)</span></code>.
+ </p>
+</div>
+<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
+<td align="left"></td>
+<td align="right"><div class="copyright-footer">Copyright © 2003 -2010 Thorsten Ottosen, Neil Groves<p>
+ 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)
+ </p>
+</div></td>
+</tr></table>
+<hr>
+<div class="spirit-nav">
+<a accesskey="p" href="make_heap.html"><img src="../../../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../heap_algorithms.html"><img src="../../../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../../../index.html"><img src="../../../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="../permutation_algorithms.html"><img src="../../../../../../../../doc/html/images/next.png" alt="Next"></a>
+</div>
+</body>
+</html>
Modified: trunk/libs/range/doc/html/range/reference/algorithms/permutation_algorithms.html
==============================================================================
--- trunk/libs/range/doc/html/range/reference/algorithms/permutation_algorithms.html (original)
+++ trunk/libs/range/doc/html/range/reference/algorithms/permutation_algorithms.html 2010-04-11 18:05:02 EDT (Sun, 11 Apr 2010)
@@ -6,7 +6,7 @@
<meta name="generator" content="DocBook XSL Stylesheets V1.75.1">
<link rel="home" href="../../../index.html" title="Chapter 1. Range 2.0">
<link rel="up" href="../algorithms.html" title="Range Algorithm">
-<link rel="prev" href="heap_algorithms/make_heap.html" title="make_heap">
+<link rel="prev" href="heap_algorithms/sort_heap.html" title="sort_heap">
<link rel="next" href="permutation_algorithms/next_permutation.html" title="next_permutation">
</head>
<body bgcolor="white" text="black" link="#0000FF" vlink="#840084" alink="#0000FF">
@@ -20,7 +20,7 @@
</tr></table>
<hr>
<div class="spirit-nav">
-<a accesskey="p" href="heap_algorithms/make_heap.html"><img src="../../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../algorithms.html"><img src="../../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../../index.html"><img src="../../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="permutation_algorithms/next_permutation.html"><img src="../../../../../../../doc/html/images/next.png" alt="Next"></a>
+<a accesskey="p" href="heap_algorithms/sort_heap.html"><img src="../../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../algorithms.html"><img src="../../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../../index.html"><img src="../../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="permutation_algorithms/next_permutation.html"><img src="../../../../../../../doc/html/images/next.png" alt="Next"></a>
</div>
<div class="section" title="Permutation algorithms">
<div class="titlepage"><div><div><h4 class="title">
@@ -44,7 +44,7 @@
</tr></table>
<hr>
<div class="spirit-nav">
-<a accesskey="p" href="heap_algorithms/make_heap.html"><img src="../../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../algorithms.html"><img src="../../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../../index.html"><img src="../../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="permutation_algorithms/next_permutation.html"><img src="../../../../../../../doc/html/images/next.png" alt="Next"></a>
+<a accesskey="p" href="heap_algorithms/sort_heap.html"><img src="../../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../algorithms.html"><img src="../../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../../index.html"><img src="../../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="permutation_algorithms/next_permutation.html"><img src="../../../../../../../doc/html/images/next.png" alt="Next"></a>
</div>
</body>
</html>
Modified: trunk/libs/range/doc/html/range/reference/algorithms/permutation_algorithms/next_permutation.html
==============================================================================
--- trunk/libs/range/doc/html/range/reference/algorithms/permutation_algorithms/next_permutation.html (original)
+++ trunk/libs/range/doc/html/range/reference/algorithms/permutation_algorithms/next_permutation.html 2010-04-11 18:05:02 EDT (Sun, 11 Apr 2010)
@@ -28,28 +28,28 @@
next_permutation</a>
</h5></div></div></div>
<a name="range.reference.algorithms.permutation_algorithms.next_permutation.prototype"></a><h6>
-<a name="id2945879"></a>
+<a name="id3100976"></a>
<a class="link" href="next_permutation.html#range.reference.algorithms.permutation_algorithms.next_permutation.prototype">Prototype</a>
</h6>
<p>
</p>
<pre class="programlisting"><span class="keyword">template</span><span class="special"><</span><span class="keyword">class</span> <span class="identifier">BidirectionalRange</span><span class="special">></span>
-<span class="keyword">void</span> <span class="identifier">next_permutation</span><span class="special">(</span><span class="identifier">BidirectionalRange</span><span class="special">&</span> <span class="identifier">rng</span><span class="special">);</span>
+<span class="keyword">bool</span> <span class="identifier">next_permutation</span><span class="special">(</span><span class="identifier">BidirectionalRange</span><span class="special">&</span> <span class="identifier">rng</span><span class="special">);</span>
<span class="keyword">template</span><span class="special"><</span><span class="keyword">class</span> <span class="identifier">BidirectionalRange</span><span class="special">></span>
-<span class="keyword">void</span> <span class="identifier">next_permutation</span><span class="special">(</span><span class="keyword">const</span> <span class="identifier">BidirectionalRange</span><span class="special">&</span> <span class="identifier">rng</span><span class="special">);</span>
+<span class="keyword">bool</span> <span class="identifier">next_permutation</span><span class="special">(</span><span class="keyword">const</span> <span class="identifier">BidirectionalRange</span><span class="special">&</span> <span class="identifier">rng</span><span class="special">);</span>
<span class="keyword">template</span><span class="special"><</span><span class="keyword">class</span> <span class="identifier">BidirectionalRange</span><span class="special">,</span> <span class="keyword">class</span> <span class="identifier">Compare</span><span class="special">></span>
-<span class="keyword">void</span> <span class="identifier">next_permutation</span><span class="special">(</span><span class="identifier">BidirectionalRange</span><span class="special">&</span> <span class="identifier">rng</span><span class="special">,</span> <span class="identifier">Compare</span> <span class="identifier">pred</span><span class="special">);</span>
+<span class="keyword">bool</span> <span class="identifier">next_permutation</span><span class="special">(</span><span class="identifier">BidirectionalRange</span><span class="special">&</span> <span class="identifier">rng</span><span class="special">,</span> <span class="identifier">Compare</span> <span class="identifier">pred</span><span class="special">);</span>
<span class="keyword">template</span><span class="special"><</span><span class="keyword">class</span> <span class="identifier">BidirectionalRange</span><span class="special">,</span> <span class="keyword">class</span> <span class="identifier">Compare</span><span class="special">></span>
-<span class="keyword">void</span> <span class="identifier">next_permutation</span><span class="special">(</span><span class="keyword">const</span> <span class="identifier">BidirectionalRange</span><span class="special">&</span> <span class="identifier">rng</span><span class="special">,</span> <span class="identifier">Compare</span> <span class="identifier">pred</span><span class="special">);</span>
+<span class="keyword">bool</span> <span class="identifier">next_permutation</span><span class="special">(</span><span class="keyword">const</span> <span class="identifier">BidirectionalRange</span><span class="special">&</span> <span class="identifier">rng</span><span class="special">,</span> <span class="identifier">Compare</span> <span class="identifier">pred</span><span class="special">);</span>
</pre>
<p>
</p>
<a name="range.reference.algorithms.permutation_algorithms.next_permutation.description"></a><h6>
-<a name="id2946231"></a>
+<a name="id3101328"></a>
<a class="link" href="next_permutation.html#range.reference.algorithms.permutation_algorithms.next_permutation.description">Description</a>
</h6>
<p>
@@ -67,14 +67,14 @@
the predicate versions.
</p>
<a name="range.reference.algorithms.permutation_algorithms.next_permutation.definition"></a><h6>
-<a name="id2946338"></a>
+<a name="id3101435"></a>
<a class="link" href="next_permutation.html#range.reference.algorithms.permutation_algorithms.next_permutation.definition">Definition</a>
</h6>
<p>
Defined in the header file <code class="computeroutput"><span class="identifier">boost</span><span class="special">/</span><span class="identifier">range</span><span class="special">/</span><span class="identifier">algorithm</span><span class="special">/</span><span class="identifier">permutation</span><span class="special">.</span><span class="identifier">hpp</span></code>
</p>
<a name="range.reference.algorithms.permutation_algorithms.next_permutation.requirements"></a><h6>
-<a name="id2946412"></a>
+<a name="id3101510"></a>
<a class="link" href="next_permutation.html#range.reference.algorithms.permutation_algorithms.next_permutation.requirements">Requirements</a>
</h6>
<p>
@@ -125,7 +125,7 @@
</li>
</ul></div>
<a name="range.reference.algorithms.permutation_algorithms.next_permutation.complexity"></a><h6>
-<a name="id2946649"></a>
+<a name="id3101746"></a>
<a class="link" href="next_permutation.html#range.reference.algorithms.permutation_algorithms.next_permutation.complexity">Complexity</a>
</h6>
<p>
Modified: trunk/libs/range/doc/html/range/reference/algorithms/permutation_algorithms/prev_permutation.html
==============================================================================
--- trunk/libs/range/doc/html/range/reference/algorithms/permutation_algorithms/prev_permutation.html (original)
+++ trunk/libs/range/doc/html/range/reference/algorithms/permutation_algorithms/prev_permutation.html 2010-04-11 18:05:02 EDT (Sun, 11 Apr 2010)
@@ -28,28 +28,28 @@
prev_permutation</a>
</h5></div></div></div>
<a name="range.reference.algorithms.permutation_algorithms.prev_permutation.prototype"></a><h6>
-<a name="id2946733"></a>
+<a name="id3101830"></a>
<a class="link" href="prev_permutation.html#range.reference.algorithms.permutation_algorithms.prev_permutation.prototype">Prototype</a>
</h6>
<p>
</p>
<pre class="programlisting"><span class="keyword">template</span><span class="special"><</span><span class="keyword">class</span> <span class="identifier">BidirectionalRange</span><span class="special">></span>
-<span class="keyword">void</span> <span class="identifier">prev_permutation</span><span class="special">(</span><span class="identifier">BidirectionalRange</span><span class="special">&</span> <span class="identifier">rng</span><span class="special">);</span>
+<span class="keyword">bool</span> <span class="identifier">prev_permutation</span><span class="special">(</span><span class="identifier">BidirectionalRange</span><span class="special">&</span> <span class="identifier">rng</span><span class="special">);</span>
<span class="keyword">template</span><span class="special"><</span><span class="keyword">class</span> <span class="identifier">BidirectionalRange</span><span class="special">></span>
-<span class="keyword">void</span> <span class="identifier">prev_permutation</span><span class="special">(</span><span class="keyword">const</span> <span class="identifier">BidirectionalRange</span><span class="special">&</span> <span class="identifier">rng</span><span class="special">);</span>
+<span class="keyword">bool</span> <span class="identifier">prev_permutation</span><span class="special">(</span><span class="keyword">const</span> <span class="identifier">BidirectionalRange</span><span class="special">&</span> <span class="identifier">rng</span><span class="special">);</span>
<span class="keyword">template</span><span class="special"><</span><span class="keyword">class</span> <span class="identifier">BidirectionalRange</span><span class="special">,</span> <span class="keyword">class</span> <span class="identifier">Compare</span><span class="special">></span>
-<span class="keyword">void</span> <span class="identifier">prev_permutation</span><span class="special">(</span><span class="identifier">BidirectionalRange</span><span class="special">&</span> <span class="identifier">rng</span><span class="special">,</span> <span class="identifier">Compare</span> <span class="identifier">pred</span><span class="special">);</span>
+<span class="keyword">bool</span> <span class="identifier">prev_permutation</span><span class="special">(</span><span class="identifier">BidirectionalRange</span><span class="special">&</span> <span class="identifier">rng</span><span class="special">,</span> <span class="identifier">Compare</span> <span class="identifier">pred</span><span class="special">);</span>
<span class="keyword">template</span><span class="special"><</span><span class="keyword">class</span> <span class="identifier">BidirectionalRange</span><span class="special">,</span> <span class="keyword">class</span> <span class="identifier">Compare</span><span class="special">></span>
-<span class="keyword">void</span> <span class="identifier">prev_permutation</span><span class="special">(</span><span class="keyword">const</span> <span class="identifier">BidirectionalRange</span><span class="special">&</span> <span class="identifier">rng</span><span class="special">,</span> <span class="identifier">Compare</span> <span class="identifier">pred</span><span class="special">);</span>
+<span class="keyword">bool</span> <span class="identifier">prev_permutation</span><span class="special">(</span><span class="keyword">const</span> <span class="identifier">BidirectionalRange</span><span class="special">&</span> <span class="identifier">rng</span><span class="special">,</span> <span class="identifier">Compare</span> <span class="identifier">pred</span><span class="special">);</span>
</pre>
<p>
</p>
<a name="range.reference.algorithms.permutation_algorithms.prev_permutation.description"></a><h6>
-<a name="id2947084"></a>
+<a name="id3102182"></a>
<a class="link" href="prev_permutation.html#range.reference.algorithms.permutation_algorithms.prev_permutation.description">Description</a>
</h6>
<p>
@@ -67,14 +67,14 @@
the predicate versions.
</p>
<a name="range.reference.algorithms.permutation_algorithms.prev_permutation.definition"></a><h6>
-<a name="id2947193"></a>
+<a name="id3102290"></a>
<a class="link" href="prev_permutation.html#range.reference.algorithms.permutation_algorithms.prev_permutation.definition">Definition</a>
</h6>
<p>
Defined in the header file <code class="computeroutput"><span class="identifier">boost</span><span class="special">/</span><span class="identifier">range</span><span class="special">/</span><span class="identifier">algorithm</span><span class="special">/</span><span class="identifier">permutation</span><span class="special">.</span><span class="identifier">hpp</span></code>
</p>
<a name="range.reference.algorithms.permutation_algorithms.prev_permutation.requirements"></a><h6>
-<a name="id2947267"></a>
+<a name="id3102364"></a>
<a class="link" href="prev_permutation.html#range.reference.algorithms.permutation_algorithms.prev_permutation.requirements">Requirements</a>
</h6>
<p>
@@ -125,7 +125,7 @@
</li>
</ul></div>
<a name="range.reference.algorithms.permutation_algorithms.prev_permutation.complexity"></a><h6>
-<a name="id2947504"></a>
+<a name="id3102600"></a>
<a class="link" href="prev_permutation.html#range.reference.algorithms.permutation_algorithms.prev_permutation.complexity">Complexity</a>
</h6>
<p>
Modified: trunk/libs/range/doc/html/range/reference/algorithms/range_algorithm_mutating_algorithms.html
==============================================================================
--- trunk/libs/range/doc/html/range/reference/algorithms/range_algorithm_mutating_algorithms.html (original)
+++ trunk/libs/range/doc/html/range/reference/algorithms/range_algorithm_mutating_algorithms.html 2010-04-11 18:05:02 EDT (Sun, 11 Apr 2010)
@@ -34,6 +34,8 @@
Range Algorithm - copy_backward</a></span></dt>
<dt><span class="section"><a href="range_algorithm_mutating_algorithms/fill.html">
Range Algorithm - fill</a></span></dt>
+<dt><span class="section"><a href="range_algorithm_mutating_algorithms/fill_n.html">
+ Range Algorithm - fill_n</a></span></dt>
<dt><span class="section"><a href="range_algorithm_mutating_algorithms/generate.html">
Range Algorithm - generate</a></span></dt>
<dt><span class="section"><a href="range_algorithm_mutating_algorithms/inplace_merge.html">
Modified: trunk/libs/range/doc/html/range/reference/algorithms/range_algorithm_mutating_algorithms/copy.html
==============================================================================
--- trunk/libs/range/doc/html/range/reference/algorithms/range_algorithm_mutating_algorithms/copy.html (original)
+++ trunk/libs/range/doc/html/range/reference/algorithms/range_algorithm_mutating_algorithms/copy.html 2010-04-11 18:05:02 EDT (Sun, 11 Apr 2010)
@@ -28,7 +28,7 @@
Range Algorithm - copy</a>
</h5></div></div></div>
<a name="range.reference.algorithms.range_algorithm_mutating_algorithms.copy.prototype"></a><h6>
-<a name="id2894536"></a>
+<a name="id3048136"></a>
<a class="link" href="copy.html#range.reference.algorithms.range_algorithm_mutating_algorithms.copy.prototype">Prototype</a>
</h6>
<p>
@@ -40,7 +40,7 @@
<p>
</p>
<a name="range.reference.algorithms.range_algorithm_mutating_algorithms.copy.description"></a><h6>
-<a name="id2894668"></a>
+<a name="id3048268"></a>
<a class="link" href="copy.html#range.reference.algorithms.range_algorithm_mutating_algorithms.copy.description">Description</a>
</h6>
<p>
@@ -51,14 +51,14 @@
<span class="identifier">distance</span><span class="special">(</span><span class="identifier">source_rng</span><span class="special">)</span></code>
</p>
<a name="range.reference.algorithms.range_algorithm_mutating_algorithms.copy.definition"></a><h6>
-<a name="id2894803"></a>
+<a name="id3048403"></a>
<a class="link" href="copy.html#range.reference.algorithms.range_algorithm_mutating_algorithms.copy.definition">Definition</a>
</h6>
<p>
Defined in the header file <code class="computeroutput"><span class="identifier">boost</span><span class="special">/</span><span class="identifier">range</span><span class="special">/</span><span class="identifier">algorithm</span><span class="special">/</span><span class="identifier">copy</span><span class="special">.</span><span class="identifier">hpp</span></code>
</p>
<a name="range.reference.algorithms.range_algorithm_mutating_algorithms.copy.requirements"></a><h6>
-<a name="id2894877"></a>
+<a name="id3048477"></a>
<a class="link" href="copy.html#range.reference.algorithms.range_algorithm_mutating_algorithms.copy.requirements">Requirements</a>
</h6>
<div class="itemizedlist"><ul class="itemizedlist" type="disc">
@@ -79,7 +79,7 @@
</li>
</ul></div>
<a name="range.reference.algorithms.range_algorithm_mutating_algorithms.copy.precondition_"></a><h6>
-<a name="id2894988"></a>
+<a name="id3048588"></a>
<a class="link" href="copy.html#range.reference.algorithms.range_algorithm_mutating_algorithms.copy.precondition_">Precondition:</a>
</h6>
<div class="itemizedlist"><ul class="itemizedlist" type="disc">
@@ -93,7 +93,7 @@
</li>
</ul></div>
<a name="range.reference.algorithms.range_algorithm_mutating_algorithms.copy.complexity"></a><h6>
-<a name="id2895094"></a>
+<a name="id3048694"></a>
<a class="link" href="copy.html#range.reference.algorithms.range_algorithm_mutating_algorithms.copy.complexity">Complexity</a>
</h6>
<p>
Modified: trunk/libs/range/doc/html/range/reference/algorithms/range_algorithm_mutating_algorithms/copy_backward.html
==============================================================================
--- trunk/libs/range/doc/html/range/reference/algorithms/range_algorithm_mutating_algorithms/copy_backward.html (original)
+++ trunk/libs/range/doc/html/range/reference/algorithms/range_algorithm_mutating_algorithms/copy_backward.html 2010-04-11 18:05:02 EDT (Sun, 11 Apr 2010)
@@ -28,7 +28,7 @@
Range Algorithm - copy_backward</a>
</h5></div></div></div>
<a name="range.reference.algorithms.range_algorithm_mutating_algorithms.copy_backward.prototype"></a><h6>
-<a name="id2895166"></a>
+<a name="id3048766"></a>
<a class="link" href="copy_backward.html#range.reference.algorithms.range_algorithm_mutating_algorithms.copy_backward.prototype">Prototype</a>
</h6>
<p>
@@ -42,7 +42,7 @@
<p>
</p>
<a name="range.reference.algorithms.range_algorithm_mutating_algorithms.copy_backward.description"></a><h6>
-<a name="id2895300"></a>
+<a name="id3048900"></a>
<a class="link" href="copy_backward.html#range.reference.algorithms.range_algorithm_mutating_algorithms.copy_backward.description">Description</a>
</h6>
<p>
@@ -60,14 +60,14 @@
denotes the <span class="bold"><strong>end</strong></span> of the output sequence.
</p>
<a name="range.reference.algorithms.range_algorithm_mutating_algorithms.copy_backward.definition"></a><h6>
-<a name="id2895460"></a>
+<a name="id3049060"></a>
<a class="link" href="copy_backward.html#range.reference.algorithms.range_algorithm_mutating_algorithms.copy_backward.definition">Definition</a>
</h6>
<p>
Defined in the header file <code class="computeroutput"><span class="identifier">boost</span><span class="special">/</span><span class="identifier">range</span><span class="special">/</span><span class="identifier">algorithm</span><span class="special">/</span><span class="identifier">copy_backward</span><span class="special">.</span><span class="identifier">hpp</span></code>
</p>
<a name="range.reference.algorithms.range_algorithm_mutating_algorithms.copy_backward.requirements"></a><h6>
-<a name="id2895534"></a>
+<a name="id3049134"></a>
<a class="link" href="copy_backward.html#range.reference.algorithms.range_algorithm_mutating_algorithms.copy_backward.requirements">Requirements</a>
</h6>
<div class="itemizedlist"><ul class="itemizedlist" type="disc">
@@ -88,7 +88,7 @@
</li>
</ul></div>
<a name="range.reference.algorithms.range_algorithm_mutating_algorithms.copy_backward.precondition_"></a><h6>
-<a name="id2895645"></a>
+<a name="id3049245"></a>
<a class="link" href="copy_backward.html#range.reference.algorithms.range_algorithm_mutating_algorithms.copy_backward.precondition_">Precondition:</a>
</h6>
<div class="itemizedlist"><ul class="itemizedlist" type="disc">
@@ -102,7 +102,7 @@
</li>
</ul></div>
<a name="range.reference.algorithms.range_algorithm_mutating_algorithms.copy_backward.complexity"></a><h6>
-<a name="id2895752"></a>
+<a name="id3049352"></a>
<a class="link" href="copy_backward.html#range.reference.algorithms.range_algorithm_mutating_algorithms.copy_backward.complexity">Complexity</a>
</h6>
<p>
Modified: trunk/libs/range/doc/html/range/reference/algorithms/range_algorithm_mutating_algorithms/fill.html
==============================================================================
--- trunk/libs/range/doc/html/range/reference/algorithms/range_algorithm_mutating_algorithms/fill.html (original)
+++ trunk/libs/range/doc/html/range/reference/algorithms/range_algorithm_mutating_algorithms/fill.html 2010-04-11 18:05:02 EDT (Sun, 11 Apr 2010)
@@ -7,7 +7,7 @@
<link rel="home" href="../../../../index.html" title="Chapter 1. Range 2.0">
<link rel="up" href="../range_algorithm_mutating_algorithms.html" title="Mutating algorithms">
<link rel="prev" href="copy_backward.html" title="Range Algorithm - copy_backward">
-<link rel="next" href="generate.html" title="Range Algorithm - generate">
+<link rel="next" href="fill_n.html" title="Range Algorithm - fill_n">
</head>
<body bgcolor="white" text="black" link="#0000FF" vlink="#840084" alink="#0000FF">
<table cellpadding="2" width="100%"><tr>
@@ -20,7 +20,7 @@
</tr></table>
<hr>
<div class="spirit-nav">
-<a accesskey="p" href="copy_backward.html"><img src="../../../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../range_algorithm_mutating_algorithms.html"><img src="../../../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../../../index.html"><img src="../../../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="generate.html"><img src="../../../../../../../../doc/html/images/next.png" alt="Next"></a>
+<a accesskey="p" href="copy_backward.html"><img src="../../../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../range_algorithm_mutating_algorithms.html"><img src="../../../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../../../index.html"><img src="../../../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="fill_n.html"><img src="../../../../../../../../doc/html/images/next.png" alt="Next"></a>
</div>
<div class="section" title="Range Algorithm - fill">
<div class="titlepage"><div><div><h5 class="title">
@@ -28,22 +28,19 @@
Range Algorithm - fill</a>
</h5></div></div></div>
<a name="range.reference.algorithms.range_algorithm_mutating_algorithms.fill.prototype"></a><h6>
-<a name="id2895824"></a>
+<a name="id3049424"></a>
<a class="link" href="fill.html#range.reference.algorithms.range_algorithm_mutating_algorithms.fill.prototype">Prototype</a>
</h6>
<p>
</p>
<pre class="programlisting"><span class="keyword">template</span><span class="special"><</span><span class="keyword">class</span> <span class="identifier">ForwardRange</span><span class="special">,</span> <span class="keyword">class</span> <span class="identifier">Value</span><span class="special">></span>
-<span class="keyword">void</span> <span class="identifier">fill</span><span class="special">(</span> <span class="identifier">ForwardRange</span><span class="special">&</span> <span class="identifier">rng</span><span class="special">,</span> <span class="keyword">const</span> <span class="identifier">Value</span><span class="special">&</span> <span class="identifier">val</span> <span class="special">);</span>
-
-<span class="keyword">template</span><span class="special"><</span><span class="keyword">class</span> <span class="identifier">ForwardRange</span><span class="special">,</span> <span class="keyword">class</span> <span class="identifier">Value</span><span class="special">></span>
-<span class="keyword">void</span> <span class="identifier">fill</span><span class="special">(</span> <span class="keyword">const</span> <span class="identifier">ForwardRange</span><span class="special">&</span> <span class="identifier">rng</span><span class="special">,</span> <span class="keyword">const</span> <span class="identifier">Value</span><span class="special">&</span> <span class="identifier">val</span> <span class="special">);</span>
+<span class="identifier">ForwardRange</span><span class="special">&</span> <span class="identifier">fill</span><span class="special">(</span> <span class="identifier">ForwardRange</span><span class="special">&</span> <span class="identifier">rng</span><span class="special">,</span> <span class="keyword">const</span> <span class="identifier">Value</span><span class="special">&</span> <span class="identifier">val</span> <span class="special">);</span>
</pre>
<p>
</p>
<a name="range.reference.algorithms.range_algorithm_mutating_algorithms.fill.description"></a><h6>
-<a name="id2896073"></a>
+<a name="id3049568"></a>
<a class="link" href="fill.html#range.reference.algorithms.range_algorithm_mutating_algorithms.fill.description">Description</a>
</h6>
<p>
@@ -52,14 +49,14 @@
in the range <code class="computeroutput"><span class="identifier">rng</span></code>.
</p>
<a name="range.reference.algorithms.range_algorithm_mutating_algorithms.fill.definition"></a><h6>
-<a name="id2896133"></a>
+<a name="id3049627"></a>
<a class="link" href="fill.html#range.reference.algorithms.range_algorithm_mutating_algorithms.fill.definition">Definition</a>
</h6>
<p>
Defined in the header file <code class="computeroutput"><span class="identifier">boost</span><span class="special">/</span><span class="identifier">range</span><span class="special">/</span><span class="identifier">algorithm</span><span class="special">/</span><span class="identifier">fill</span><span class="special">.</span><span class="identifier">hpp</span></code>
</p>
<a name="range.reference.algorithms.range_algorithm_mutating_algorithms.fill.requirements"></a><h6>
-<a name="id2896207"></a>
+<a name="id3049701"></a>
<a class="link" href="fill.html#range.reference.algorithms.range_algorithm_mutating_algorithms.fill.requirements">Requirements</a>
</h6>
<div class="itemizedlist"><ul class="itemizedlist" type="disc">
@@ -82,7 +79,7 @@
</li>
</ul></div>
<a name="range.reference.algorithms.range_algorithm_mutating_algorithms.fill.complexity"></a><h6>
-<a name="id2896321"></a>
+<a name="id3049816"></a>
<a class="link" href="fill.html#range.reference.algorithms.range_algorithm_mutating_algorithms.fill.complexity">Complexity</a>
</h6>
<p>
@@ -99,7 +96,7 @@
</tr></table>
<hr>
<div class="spirit-nav">
-<a accesskey="p" href="copy_backward.html"><img src="../../../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../range_algorithm_mutating_algorithms.html"><img src="../../../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../../../index.html"><img src="../../../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="generate.html"><img src="../../../../../../../../doc/html/images/next.png" alt="Next"></a>
+<a accesskey="p" href="copy_backward.html"><img src="../../../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../range_algorithm_mutating_algorithms.html"><img src="../../../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../../../index.html"><img src="../../../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="fill_n.html"><img src="../../../../../../../../doc/html/images/next.png" alt="Next"></a>
</div>
</body>
</html>
Added: trunk/libs/range/doc/html/range/reference/algorithms/range_algorithm_mutating_algorithms/fill_n.html
==============================================================================
--- (empty file)
+++ trunk/libs/range/doc/html/range/reference/algorithms/range_algorithm_mutating_algorithms/fill_n.html 2010-04-11 18:05:02 EDT (Sun, 11 Apr 2010)
@@ -0,0 +1,102 @@
+<html>
+<head>
+<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
+<title>Range Algorithm - fill_n</title>
+<link rel="stylesheet" href="../../../../../../../../doc/html/boostbook.css" type="text/css">
+<meta name="generator" content="DocBook XSL Stylesheets V1.75.1">
+<link rel="home" href="../../../../index.html" title="Chapter 1. Range 2.0">
+<link rel="up" href="../range_algorithm_mutating_algorithms.html" title="Mutating algorithms">
+<link rel="prev" href="fill.html" title="Range Algorithm - fill">
+<link rel="next" href="generate.html" title="Range Algorithm - generate">
+</head>
+<body bgcolor="white" text="black" link="#0000FF" vlink="#840084" alink="#0000FF">
+<table cellpadding="2" width="100%"><tr>
+<td valign="top"><img alt="Boost C++ Libraries" width="277" height="86" src="../../../../../../../../boost.png"></td>
+<td align="center">Home</td>
+<td align="center">Libraries</td>
+<td align="center">People</td>
+<td align="center">FAQ</td>
+<td align="center">More</td>
+</tr></table>
+<hr>
+<div class="spirit-nav">
+<a accesskey="p" href="fill.html"><img src="../../../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../range_algorithm_mutating_algorithms.html"><img src="../../../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../../../index.html"><img src="../../../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="generate.html"><img src="../../../../../../../../doc/html/images/next.png" alt="Next"></a>
+</div>
+<div class="section" title="Range Algorithm - fill_n">
+<div class="titlepage"><div><div><h5 class="title">
+<a name="range.reference.algorithms.range_algorithm_mutating_algorithms.fill_n"></a><a class="link" href="fill_n.html" title="Range Algorithm - fill_n">
+ Range Algorithm - fill_n</a>
+</h5></div></div></div>
+<a name="range.reference.algorithms.range_algorithm_mutating_algorithms.fill_n.prototype"></a><h6>
+<a name="id3049888"></a>
+ <a class="link" href="fill_n.html#range.reference.algorithms.range_algorithm_mutating_algorithms.fill_n.prototype">Prototype</a>
+ </h6>
+<p>
+
+</p>
+<pre class="programlisting"><span class="keyword">template</span><span class="special"><</span><span class="keyword">class</span> <span class="identifier">ForwardRange</span><span class="special">,</span> <span class="keyword">class</span> <span class="identifier">Size</span><span class="special">,</span> <span class="keyword">class</span> <span class="identifier">Value</span><span class="special">></span>
+<span class="identifier">ForwardRange</span><span class="special">&</span> <span class="identifier">fill</span><span class="special">(</span> <span class="identifier">ForwardRange</span><span class="special">&</span> <span class="identifier">rng</span><span class="special">,</span> <span class="identifier">Size</span> <span class="identifier">n</span><span class="special">,</span> <span class="keyword">const</span> <span class="identifier">Value</span><span class="special">&</span> <span class="identifier">val</span> <span class="special">);</span>
+</pre>
+<p>
+ </p>
+<a name="range.reference.algorithms.range_algorithm_mutating_algorithms.fill_n.description"></a><h6>
+<a name="id3050063"></a>
+ <a class="link" href="fill_n.html#range.reference.algorithms.range_algorithm_mutating_algorithms.fill_n.description">Description</a>
+ </h6>
+<p>
+ <code class="computeroutput"><span class="identifier">fill_n</span></code> assigns the value
+ <code class="computeroutput"><span class="identifier">val</span></code> to <code class="computeroutput"><span class="identifier">n</span></code> elements in the range <code class="computeroutput"><span class="identifier">rng</span></code> begining with <code class="computeroutput"><span class="identifier">boost</span><span class="special">::</span><span class="identifier">begin</span><span class="special">(</span><span class="identifier">rng</span><span class="special">)</span></code>.
+ </p>
+<a name="range.reference.algorithms.range_algorithm_mutating_algorithms.fill_n.definition"></a><h6>
+<a name="id3050167"></a>
+ <a class="link" href="fill_n.html#range.reference.algorithms.range_algorithm_mutating_algorithms.fill_n.definition">Definition</a>
+ </h6>
+<p>
+ Defined in the header file <code class="computeroutput"><span class="identifier">boost</span><span class="special">/</span><span class="identifier">range</span><span class="special">/</span><span class="identifier">algorithm</span><span class="special">/</span><span class="identifier">fill_n</span><span class="special">.</span><span class="identifier">hpp</span></code>
+ </p>
+<a name="range.reference.algorithms.range_algorithm_mutating_algorithms.fill_n.requirements"></a><h6>
+<a name="id3050241"></a>
+ <a class="link" href="fill_n.html#range.reference.algorithms.range_algorithm_mutating_algorithms.fill_n.requirements">Requirements</a>
+ </h6>
+<div class="itemizedlist"><ul class="itemizedlist" type="disc">
+<li class="listitem">
+<code class="computeroutput"><span class="identifier">ForwardRange</span></code> is a model
+ of the <a class="link" href="../../../concepts/forward_range.html" title="Forward Range">Forward Range</a>
+ Concept.
+ </li>
+<li class="listitem">
+<code class="computeroutput"><span class="identifier">ForwardRange</span></code> is mutable.
+ </li>
+<li class="listitem">
+<code class="computeroutput"><span class="identifier">Value</span></code> is a model of
+ the <code class="computeroutput"><span class="identifier">AssignableConcept</span></code>.
+ </li>
+<li class="listitem">
+<code class="computeroutput"><span class="identifier">Value</span></code> is convertible
+ to <code class="computeroutput"><span class="identifier">ForwardRange</span></code>'s value
+ type.
+ </li>
+</ul></div>
+<a name="range.reference.algorithms.range_algorithm_mutating_algorithms.fill_n.complexity"></a><h6>
+<a name="id3050355"></a>
+ <a class="link" href="fill_n.html#range.reference.algorithms.range_algorithm_mutating_algorithms.fill_n.complexity">Complexity</a>
+ </h6>
+<p>
+ Linear. Exactly <code class="computeroutput"><span class="identifier">n</span></code> assignments
+ are performed.
+ </p>
+</div>
+<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
+<td align="left"></td>
+<td align="right"><div class="copyright-footer">Copyright © 2003 -2010 Thorsten Ottosen, Neil Groves<p>
+ 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)
+ </p>
+</div></td>
+</tr></table>
+<hr>
+<div class="spirit-nav">
+<a accesskey="p" href="fill.html"><img src="../../../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../range_algorithm_mutating_algorithms.html"><img src="../../../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../../../index.html"><img src="../../../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="generate.html"><img src="../../../../../../../../doc/html/images/next.png" alt="Next"></a>
+</div>
+</body>
+</html>
Modified: trunk/libs/range/doc/html/range/reference/algorithms/range_algorithm_mutating_algorithms/generate.html
==============================================================================
--- trunk/libs/range/doc/html/range/reference/algorithms/range_algorithm_mutating_algorithms/generate.html (original)
+++ trunk/libs/range/doc/html/range/reference/algorithms/range_algorithm_mutating_algorithms/generate.html 2010-04-11 18:05:02 EDT (Sun, 11 Apr 2010)
@@ -6,7 +6,7 @@
<meta name="generator" content="DocBook XSL Stylesheets V1.75.1">
<link rel="home" href="../../../../index.html" title="Chapter 1. Range 2.0">
<link rel="up" href="../range_algorithm_mutating_algorithms.html" title="Mutating algorithms">
-<link rel="prev" href="fill.html" title="Range Algorithm - fill">
+<link rel="prev" href="fill_n.html" title="Range Algorithm - fill_n">
<link rel="next" href="inplace_merge.html" title="Range Algorithm - inplace_merge">
</head>
<body bgcolor="white" text="black" link="#0000FF" vlink="#840084" alink="#0000FF">
@@ -20,7 +20,7 @@
</tr></table>
<hr>
<div class="spirit-nav">
-<a accesskey="p" href="fill.html"><img src="../../../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../range_algorithm_mutating_algorithms.html"><img src="../../../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../../../index.html"><img src="../../../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="inplace_merge.html"><img src="../../../../../../../../doc/html/images/next.png" alt="Next"></a>
+<a accesskey="p" href="fill_n.html"><img src="../../../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../range_algorithm_mutating_algorithms.html"><img src="../../../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../../../index.html"><img src="../../../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="inplace_merge.html"><img src="../../../../../../../../doc/html/images/next.png" alt="Next"></a>
</div>
<div class="section" title="Range Algorithm - generate">
<div class="titlepage"><div><div><h5 class="title">
@@ -28,7 +28,7 @@
Range Algorithm - generate</a>
</h5></div></div></div>
<a name="range.reference.algorithms.range_algorithm_mutating_algorithms.generate.prototype"></a><h6>
-<a name="id2896393"></a>
+<a name="id3050413"></a>
<a class="link" href="generate.html#range.reference.algorithms.range_algorithm_mutating_algorithms.generate.prototype">Prototype</a>
</h6>
<p>
@@ -43,7 +43,7 @@
<p>
</p>
<a name="range.reference.algorithms.range_algorithm_mutating_algorithms.generate.description"></a><h6>
-<a name="id2896636"></a>
+<a name="id3050656"></a>
<a class="link" href="generate.html#range.reference.algorithms.range_algorithm_mutating_algorithms.generate.description">Description</a>
</h6>
<p>
@@ -53,14 +53,14 @@
Returns the resultant range.
</p>
<a name="range.reference.algorithms.range_algorithm_mutating_algorithms.generate.definition"></a><h6>
-<a name="id2896700"></a>
+<a name="id3050720"></a>
<a class="link" href="generate.html#range.reference.algorithms.range_algorithm_mutating_algorithms.generate.definition">Definition</a>
</h6>
<p>
Defined in the header file <code class="computeroutput"><span class="identifier">boost</span><span class="special">/</span><span class="identifier">range</span><span class="special">/</span><span class="identifier">algorithm</span><span class="special">/</span><span class="identifier">generate</span><span class="special">.</span><span class="identifier">hpp</span></code>
</p>
<a name="range.reference.algorithms.range_algorithm_mutating_algorithms.generate.requirements"></a><h6>
-<a name="id2896775"></a>
+<a name="id3050795"></a>
<a class="link" href="generate.html#range.reference.algorithms.range_algorithm_mutating_algorithms.generate.requirements">Requirements</a>
</h6>
<div class="itemizedlist"><ul class="itemizedlist" type="disc">
@@ -84,7 +84,7 @@
</li>
</ul></div>
<a name="range.reference.algorithms.range_algorithm_mutating_algorithms.generate.precondition_"></a><h6>
-<a name="id2896902"></a>
+<a name="id3050922"></a>
<a class="link" href="generate.html#range.reference.algorithms.range_algorithm_mutating_algorithms.generate.precondition_">Precondition:</a>
</h6>
<div class="itemizedlist"><ul class="itemizedlist" type="disc">
@@ -98,7 +98,7 @@
</li>
</ul></div>
<a name="range.reference.algorithms.range_algorithm_mutating_algorithms.generate.complexity"></a><h6>
-<a name="id2897008"></a>
+<a name="id3051028"></a>
<a class="link" href="generate.html#range.reference.algorithms.range_algorithm_mutating_algorithms.generate.complexity">Complexity</a>
</h6>
<p>
@@ -115,7 +115,7 @@
</tr></table>
<hr>
<div class="spirit-nav">
-<a accesskey="p" href="fill.html"><img src="../../../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../range_algorithm_mutating_algorithms.html"><img src="../../../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../../../index.html"><img src="../../../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="inplace_merge.html"><img src="../../../../../../../../doc/html/images/next.png" alt="Next"></a>
+<a accesskey="p" href="fill_n.html"><img src="../../../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../range_algorithm_mutating_algorithms.html"><img src="../../../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../../../index.html"><img src="../../../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="inplace_merge.html"><img src="../../../../../../../../doc/html/images/next.png" alt="Next"></a>
</div>
</body>
</html>
Modified: trunk/libs/range/doc/html/range/reference/algorithms/range_algorithm_mutating_algorithms/inplace_merge.html
==============================================================================
--- trunk/libs/range/doc/html/range/reference/algorithms/range_algorithm_mutating_algorithms/inplace_merge.html (original)
+++ trunk/libs/range/doc/html/range/reference/algorithms/range_algorithm_mutating_algorithms/inplace_merge.html 2010-04-11 18:05:02 EDT (Sun, 11 Apr 2010)
@@ -28,7 +28,7 @@
Range Algorithm - inplace_merge</a>
</h5></div></div></div>
<a name="range.reference.algorithms.range_algorithm_mutating_algorithms.inplace_merge.prototype"></a><h6>
-<a name="id2897080"></a>
+<a name="id3051100"></a>
<a class="link" href="inplace_merge.html#range.reference.algorithms.range_algorithm_mutating_algorithms.inplace_merge.prototype">Prototype</a>
</h6>
<p>
@@ -59,7 +59,7 @@
<p>
</p>
<a name="range.reference.algorithms.range_algorithm_mutating_algorithms.inplace_merge.description"></a><h6>
-<a name="id2897645"></a>
+<a name="id3051664"></a>
<a class="link" href="inplace_merge.html#range.reference.algorithms.range_algorithm_mutating_algorithms.inplace_merge.description">Description</a>
</h6>
<p>
@@ -72,14 +72,14 @@
input range is preserved.
</p>
<a name="range.reference.algorithms.range_algorithm_mutating_algorithms.inplace_merge.definition"></a><h6>
-<a name="id2897872"></a>
+<a name="id3051892"></a>
<a class="link" href="inplace_merge.html#range.reference.algorithms.range_algorithm_mutating_algorithms.inplace_merge.definition">Definition</a>
</h6>
<p>
Defined in the header file <code class="computeroutput"><span class="identifier">boost</span><span class="special">/</span><span class="identifier">range</span><span class="special">/</span><span class="identifier">algorithm</span><span class="special">/</span><span class="identifier">inplace_merge</span><span class="special">.</span><span class="identifier">hpp</span></code>
</p>
<a name="range.reference.algorithms.range_algorithm_mutating_algorithms.inplace_merge.requirements"></a><h6>
-<a name="id2897946"></a>
+<a name="id3051966"></a>
<a class="link" href="inplace_merge.html#range.reference.algorithms.range_algorithm_mutating_algorithms.inplace_merge.requirements">Requirements</a>
</h6>
<p>
@@ -116,11 +116,11 @@
argument types.
</p>
<a name="range.reference.algorithms.range_algorithm_mutating_algorithms.inplace_merge.precondition_"></a><h6>
-<a name="id2898202"></a>
+<a name="id3052222"></a>
<a class="link" href="inplace_merge.html#range.reference.algorithms.range_algorithm_mutating_algorithms.inplace_merge.precondition_">Precondition:</a>
</h6>
<a name="range.reference.algorithms.range_algorithm_mutating_algorithms.inplace_merge.for_the_non_predicate_version_"></a><h6>
-<a name="id2898227"></a>
+<a name="id3052246"></a>
<a class="link" href="inplace_merge.html#range.reference.algorithms.range_algorithm_mutating_algorithms.inplace_merge.for_the_non_predicate_version_">For
the non-predicate version:</a>
</h6>
@@ -143,7 +143,7 @@
</li>
</ul></div>
<a name="range.reference.algorithms.range_algorithm_mutating_algorithms.inplace_merge.for_the_predicate_version_"></a><h6>
-<a name="id2898489"></a>
+<a name="id3052508"></a>
<a class="link" href="inplace_merge.html#range.reference.algorithms.range_algorithm_mutating_algorithms.inplace_merge.for_the_predicate_version_">For
the predicate version:</a>
</h6>
@@ -164,7 +164,7 @@
</li>
</ul></div>
<a name="range.reference.algorithms.range_algorithm_mutating_algorithms.inplace_merge.complexity"></a><h6>
-<a name="id2898772"></a>
+<a name="id3052791"></a>
<a class="link" href="inplace_merge.html#range.reference.algorithms.range_algorithm_mutating_algorithms.inplace_merge.complexity">Complexity</a>
</h6>
<p>
Modified: trunk/libs/range/doc/html/range/reference/algorithms/range_algorithm_mutating_algorithms/merge.html
==============================================================================
--- trunk/libs/range/doc/html/range/reference/algorithms/range_algorithm_mutating_algorithms/merge.html (original)
+++ trunk/libs/range/doc/html/range/reference/algorithms/range_algorithm_mutating_algorithms/merge.html 2010-04-11 18:05:02 EDT (Sun, 11 Apr 2010)
@@ -28,7 +28,7 @@
Range Algorithm - merge</a>
</h5></div></div></div>
<a name="range.reference.algorithms.range_algorithm_mutating_algorithms.merge.prototype"></a><h6>
-<a name="id2898856"></a>
+<a name="id3052876"></a>
<a class="link" href="merge.html#range.reference.algorithms.range_algorithm_mutating_algorithms.merge.prototype">Prototype</a>
</h6>
<p>
@@ -57,7 +57,7 @@
<p>
</p>
<a name="range.reference.algorithms.range_algorithm_mutating_algorithms.merge.description"></a><h6>
-<a name="id2899207"></a>
+<a name="id3053227"></a>
<a class="link" href="merge.html#range.reference.algorithms.range_algorithm_mutating_algorithms.merge.description">Description</a>
</h6>
<p>
@@ -76,14 +76,14 @@
version uses the predicate instead of <code class="computeroutput"><span class="keyword">operator</span><span class="special"><()</span></code>.
</p>
<a name="range.reference.algorithms.range_algorithm_mutating_algorithms.merge.definition"></a><h6>
-<a name="id2899391"></a>
+<a name="id3053411"></a>
<a class="link" href="merge.html#range.reference.algorithms.range_algorithm_mutating_algorithms.merge.definition">Definition</a>
</h6>
<p>
Defined in the header file <code class="computeroutput"><span class="identifier">boost</span><span class="special">/</span><span class="identifier">range</span><span class="special">/</span><span class="identifier">algorithm</span><span class="special">/</span><span class="identifier">merge</span><span class="special">.</span><span class="identifier">hpp</span></code>
</p>
<a name="range.reference.algorithms.range_algorithm_mutating_algorithms.merge.requirements"></a><h6>
-<a name="id2899465"></a>
+<a name="id3053484"></a>
<a class="link" href="merge.html#range.reference.algorithms.range_algorithm_mutating_algorithms.merge.requirements">Requirements</a>
</h6>
<p>
@@ -151,11 +151,11 @@
</li>
</ul></div>
<a name="range.reference.algorithms.range_algorithm_mutating_algorithms.merge.precondition_"></a><h6>
-<a name="id2899970"></a>
+<a name="id3053989"></a>
<a class="link" href="merge.html#range.reference.algorithms.range_algorithm_mutating_algorithms.merge.precondition_">Precondition:</a>
</h6>
<a name="range.reference.algorithms.range_algorithm_mutating_algorithms.merge.for_the_non_predicate_version_"></a><h6>
-<a name="id2899993"></a>
+<a name="id3054013"></a>
<a class="link" href="merge.html#range.reference.algorithms.range_algorithm_mutating_algorithms.merge.for_the_non_predicate_version_">For
the non-predicate version:</a>
</h6>
@@ -190,7 +190,7 @@
</li>
</ul></div>
<a name="range.reference.algorithms.range_algorithm_mutating_algorithms.merge.for_the_predicate_version_"></a><h6>
-<a name="id2900454"></a>
+<a name="id3054474"></a>
<a class="link" href="merge.html#range.reference.algorithms.range_algorithm_mutating_algorithms.merge.for_the_predicate_version_">For
the predicate version:</a>
</h6>
@@ -221,7 +221,7 @@
</li>
</ul></div>
<a name="range.reference.algorithms.range_algorithm_mutating_algorithms.merge.complexity"></a><h6>
-<a name="id2900939"></a>
+<a name="id3054959"></a>
<a class="link" href="merge.html#range.reference.algorithms.range_algorithm_mutating_algorithms.merge.complexity">Complexity</a>
</h6>
<p>
Modified: trunk/libs/range/doc/html/range/reference/algorithms/range_algorithm_mutating_algorithms/nth_element.html
==============================================================================
--- trunk/libs/range/doc/html/range/reference/algorithms/range_algorithm_mutating_algorithms/nth_element.html (original)
+++ trunk/libs/range/doc/html/range/reference/algorithms/range_algorithm_mutating_algorithms/nth_element.html 2010-04-11 18:05:02 EDT (Sun, 11 Apr 2010)
@@ -28,34 +28,38 @@
Range Algorithm - nth_element</a>
</h5></div></div></div>
<a name="range.reference.algorithms.range_algorithm_mutating_algorithms.nth_element.prototype"></a><h6>
-<a name="id2901070"></a>
+<a name="id3055090"></a>
<a class="link" href="nth_element.html#range.reference.algorithms.range_algorithm_mutating_algorithms.nth_element.prototype">Prototype</a>
</h6>
<p>
</p>
<pre class="programlisting"><span class="keyword">template</span><span class="special"><</span><span class="keyword">class</span> <span class="identifier">RandomAccessRange</span><span class="special">></span>
-<span class="keyword">void</span> <span class="identifier">nth_element</span><span class="special">(</span><span class="identifier">RandomAccessRange</span><span class="special">&</span> <span class="identifier">rng</span><span class="special">,</span>
- <span class="keyword">typename</span> <span class="identifier">range_iterator</span><span class="special"><</span><span class="identifier">RandomAccessRange</span><span class="special">>::</span><span class="identifier">type</span> <span class="identifier">nth</span><span class="special">);</span>
-
+<span class="identifier">RandomAccessRange</span><span class="special">&</span> <span class="identifier">nth_element</span><span class="special">(</span>
+ <span class="identifier">RandomAccessRange</span><span class="special">&</span> <span class="identifier">rng</span><span class="special">,</span>
+ <span class="keyword">typename</span> <span class="identifier">range_iterator</span><span class="special"><</span><span class="identifier">RandomAccessRange</span><span class="special">>::</span><span class="identifier">type</span> <span class="identifier">nth</span><span class="special">);</span>
+
<span class="keyword">template</span><span class="special"><</span><span class="keyword">class</span> <span class="identifier">RandomAccessRange</span><span class="special">></span>
-<span class="keyword">void</span> <span class="identifier">nth_element</span><span class="special">(</span><span class="keyword">const</span> <span class="identifier">RandomAccessRange</span><span class="special">&</span> <span class="identifier">rng</span><span class="special">,</span>
- <span class="keyword">typename</span> <span class="identifier">range_iterator</span><span class="special"><</span><span class="keyword">const</span> <span class="identifier">RandomAccessRange</span><span class="special">>::</span><span class="identifier">type</span> <span class="identifier">nth</span><span class="special">);</span>
-
+<span class="keyword">const</span> <span class="identifier">RandomAccessRange</span><span class="special">&</span> <span class="identifier">nth_element</span><span class="special">(</span>
+ <span class="keyword">const</span> <span class="identifier">RandomAccessRange</span><span class="special">&</span> <span class="identifier">rng</span><span class="special">,</span>
+ <span class="keyword">typename</span> <span class="identifier">range_iterator</span><span class="special"><</span><span class="keyword">const</span> <span class="identifier">RandomAccessRange</span><span class="special">>::</span><span class="identifier">type</span> <span class="identifier">nth</span><span class="special">);</span>
+
<span class="keyword">template</span><span class="special"><</span><span class="keyword">class</span> <span class="identifier">RandomAccessRange</span><span class="special">></span>
-<span class="keyword">void</span> <span class="identifier">nth_element</span><span class="special">(</span><span class="identifier">RandomAccessRange</span><span class="special">&</span> <span class="identifier">rng</span><span class="special">,</span>
- <span class="keyword">typename</span> <span class="identifier">range_iterator</span><span class="special"><</span><span class="identifier">RandomAccessRange</span><span class="special">>::</span><span class="identifier">type</span> <span class="identifier">nth</span><span class="special">,</span>
- <span class="identifier">BinaryPredicate</span> <span class="identifier">sort_pred</span><span class="special">);</span>
-
+<span class="identifier">RandomAccessRange</span><span class="special">&</span> <span class="identifier">nth_element</span><span class="special">(</span>
+ <span class="identifier">RandomAccessRange</span><span class="special">&</span> <span class="identifier">rng</span><span class="special">,</span>
+ <span class="keyword">typename</span> <span class="identifier">range_iterator</span><span class="special"><</span><span class="identifier">RandomAccessRange</span><span class="special">>::</span><span class="identifier">type</span> <span class="identifier">nth</span><span class="special">,</span>
+ <span class="identifier">BinaryPredicate</span> <span class="identifier">sort_pred</span><span class="special">);</span>
+
<span class="keyword">template</span><span class="special"><</span><span class="keyword">class</span> <span class="identifier">RandomAccessRange</span><span class="special">></span>
-<span class="keyword">void</span> <span class="identifier">nth_element</span><span class="special">(</span><span class="keyword">const</span> <span class="identifier">RandomAccessRange</span><span class="special">&</span> <span class="identifier">rng</span><span class="special">,</span>
- <span class="keyword">typename</span> <span class="identifier">range_iterator</span><span class="special"><</span><span class="keyword">const</span> <span class="identifier">RandomAccessRange</span><span class="special">>::</span><span class="identifier">type</span> <span class="identifier">nth</span><span class="special">,</span>
- <span class="identifier">BinaryPredicate</span> <span class="identifier">sort_pred</span><span class="special">);</span>
+<span class="keyword">const</span> <span class="identifier">RandomAccessRange</span><span class="special">&</span> <span class="identifier">nth_element</span><span class="special">(</span>
+ <span class="keyword">const</span> <span class="identifier">RandomAccessRange</span><span class="special">&</span> <span class="identifier">rng</span><span class="special">,</span>
+ <span class="keyword">typename</span> <span class="identifier">range_iterator</span><span class="special"><</span><span class="keyword">const</span> <span class="identifier">RandomAccessRange</span><span class="special">>::</span><span class="identifier">type</span> <span class="identifier">nth</span><span class="special">,</span>
+ <span class="identifier">BinaryPredicate</span> <span class="identifier">sort_pred</span><span class="special">);</span>
</pre>
<p>
</p>
<a name="range.reference.algorithms.range_algorithm_mutating_algorithms.nth_element.description"></a><h6>
-<a name="id2901563"></a>
+<a name="id3055618"></a>
<a class="link" href="nth_element.html#range.reference.algorithms.range_algorithm_mutating_algorithms.nth_element.description">Description</a>
</h6>
<p>
@@ -66,14 +70,14 @@
is the same as the element that would be in that position if <code class="computeroutput"><span class="identifier">rng</span></code> has been sorted.
</p>
<a name="range.reference.algorithms.range_algorithm_mutating_algorithms.nth_element.definition"></a><h6>
-<a name="id2901646"></a>
+<a name="id3055700"></a>
<a class="link" href="nth_element.html#range.reference.algorithms.range_algorithm_mutating_algorithms.nth_element.definition">Definition</a>
</h6>
<p>
Defined in the header file <code class="computeroutput"><span class="identifier">boost</span><span class="special">/</span><span class="identifier">range</span><span class="special">/</span><span class="identifier">algorithm</span><span class="special">/</span><span class="identifier">nth_element</span><span class="special">.</span><span class="identifier">hpp</span></code>
</p>
<a name="range.reference.algorithms.range_algorithm_mutating_algorithms.nth_element.requirements"></a><h6>
-<a name="id2901720"></a>
+<a name="id3055775"></a>
<a class="link" href="nth_element.html#range.reference.algorithms.range_algorithm_mutating_algorithms.nth_element.requirements">Requirements</a>
</h6>
<p>
@@ -124,7 +128,7 @@
</li>
</ul></div>
<a name="range.reference.algorithms.range_algorithm_mutating_algorithms.nth_element.complexity"></a><h6>
-<a name="id2901957"></a>
+<a name="id3056012"></a>
<a class="link" href="nth_element.html#range.reference.algorithms.range_algorithm_mutating_algorithms.nth_element.complexity">Complexity</a>
</h6>
<p>
Modified: trunk/libs/range/doc/html/range/reference/algorithms/range_algorithm_mutating_algorithms/partial_sort.html
==============================================================================
--- trunk/libs/range/doc/html/range/reference/algorithms/range_algorithm_mutating_algorithms/partial_sort.html (original)
+++ trunk/libs/range/doc/html/range/reference/algorithms/range_algorithm_mutating_algorithms/partial_sort.html 2010-04-11 18:05:02 EDT (Sun, 11 Apr 2010)
@@ -28,34 +28,38 @@
Range Algorithm - partial_sort</a>
</h5></div></div></div>
<a name="range.reference.algorithms.range_algorithm_mutating_algorithms.partial_sort.prototype"></a><h6>
-<a name="id2902028"></a>
+<a name="id3056083"></a>
<a class="link" href="partial_sort.html#range.reference.algorithms.range_algorithm_mutating_algorithms.partial_sort.prototype">Prototype</a>
</h6>
<p>
</p>
<pre class="programlisting"><span class="keyword">template</span><span class="special"><</span><span class="keyword">class</span> <span class="identifier">RandomAccessRange</span><span class="special">></span>
-<span class="keyword">void</span> <span class="identifier">partial_sort</span><span class="special">(</span><span class="identifier">RandomAccessRange</span><span class="special">&</span> <span class="identifier">rng</span><span class="special">,</span>
- <span class="keyword">typename</span> <span class="identifier">range_iterator</span><span class="special"><</span><span class="identifier">RandomAccessRange</span><span class="special">>::</span><span class="identifier">type</span> <span class="identifier">middle</span><span class="special">);</span>
-
+<span class="identifier">RandomAccessRange</span><span class="special">&</span> <span class="identifier">partial_sort</span><span class="special">(</span>
+ <span class="identifier">RandomAccessRange</span><span class="special">&</span> <span class="identifier">rng</span><span class="special">,</span>
+ <span class="keyword">typename</span> <span class="identifier">range_iterator</span><span class="special"><</span><span class="identifier">RandomAccessRange</span><span class="special">>::</span><span class="identifier">type</span> <span class="identifier">middle</span><span class="special">);</span>
+
<span class="keyword">template</span><span class="special"><</span><span class="keyword">class</span> <span class="identifier">RandomAccessRange</span><span class="special">></span>
-<span class="keyword">void</span> <span class="identifier">partial_sort</span><span class="special">(</span><span class="keyword">const</span> <span class="identifier">RandomAccessRange</span><span class="special">&</span> <span class="identifier">rng</span><span class="special">,</span>
- <span class="keyword">typename</span> <span class="identifier">range_iterator</span><span class="special"><</span><span class="keyword">const</span> <span class="identifier">RandomAccessRange</span><span class="special">>::</span><span class="identifier">type</span> <span class="identifier">middle</span><span class="special">);</span>
-
+<span class="keyword">const</span> <span class="identifier">RandomAccessRange</span><span class="special">&</span> <span class="identifier">partial_sort</span><span class="special">(</span>
+ <span class="keyword">const</span> <span class="identifier">RandomAccessRange</span><span class="special">&</span> <span class="identifier">rng</span><span class="special">,</span>
+ <span class="keyword">typename</span> <span class="identifier">range_iterator</span><span class="special"><</span><span class="keyword">const</span> <span class="identifier">RandomAccessRange</span><span class="special">>::</span><span class="identifier">type</span> <span class="identifier">middle</span><span class="special">);</span>
+
<span class="keyword">template</span><span class="special"><</span><span class="keyword">class</span> <span class="identifier">RandomAccessRange</span><span class="special">></span>
-<span class="keyword">void</span> <span class="identifier">partial_sort</span><span class="special">(</span><span class="identifier">RandomAccessRange</span><span class="special">&</span> <span class="identifier">rng</span><span class="special">,</span>
- <span class="keyword">typename</span> <span class="identifier">range_iterator</span><span class="special"><</span><span class="identifier">RandomAccessRange</span><span class="special">>::</span><span class="identifier">type</span> <span class="identifier">middle</span><span class="special">,</span>
- <span class="identifier">BinaryPredicate</span> <span class="identifier">sort_pred</span><span class="special">);</span>
-
+<span class="identifier">RandomAccessRange</span><span class="special">&</span> <span class="identifier">partial_sort</span><span class="special">(</span>
+ <span class="identifier">RandomAccessRange</span><span class="special">&</span> <span class="identifier">rng</span><span class="special">,</span>
+ <span class="keyword">typename</span> <span class="identifier">range_iterator</span><span class="special"><</span><span class="identifier">RandomAccessRange</span><span class="special">>::</span><span class="identifier">type</span> <span class="identifier">middle</span><span class="special">,</span>
+ <span class="identifier">BinaryPredicate</span> <span class="identifier">sort_pred</span><span class="special">);</span>
+
<span class="keyword">template</span><span class="special"><</span><span class="keyword">class</span> <span class="identifier">RandomAccessRange</span><span class="special">></span>
-<span class="keyword">void</span> <span class="identifier">partial_sort</span><span class="special">(</span><span class="keyword">const</span> <span class="identifier">RandomAccessRange</span><span class="special">&</span> <span class="identifier">rng</span><span class="special">,</span>
- <span class="keyword">typename</span> <span class="identifier">range_iterator</span><span class="special"><</span><span class="keyword">const</span> <span class="identifier">RandomAccessRange</span><span class="special">>::</span><span class="identifier">type</span> <span class="identifier">middle</span><span class="special">,</span>
- <span class="identifier">BinaryPredicate</span> <span class="identifier">sort_pred</span><span class="special">);</span>
+<span class="keyword">const</span> <span class="identifier">RandomAccessRange</span><span class="special">&</span> <span class="identifier">partial_sort</span><span class="special">(</span>
+ <span class="keyword">const</span> <span class="identifier">RandomAccessRange</span><span class="special">&</span> <span class="identifier">rng</span><span class="special">,</span>
+ <span class="keyword">typename</span> <span class="identifier">range_iterator</span><span class="special"><</span><span class="keyword">const</span> <span class="identifier">RandomAccessRange</span><span class="special">>::</span><span class="identifier">type</span> <span class="identifier">middle</span><span class="special">,</span>
+ <span class="identifier">BinaryPredicate</span> <span class="identifier">sort_pred</span><span class="special">);</span>
</pre>
<p>
</p>
<a name="range.reference.algorithms.range_algorithm_mutating_algorithms.partial_sort.description"></a><h6>
-<a name="id2902522"></a>
+<a name="id3056612"></a>
<a class="link" href="partial_sort.html#range.reference.algorithms.range_algorithm_mutating_algorithms.partial_sort.description">Description</a>
</h6>
<p>
@@ -71,14 +75,14 @@
predicate instead.
</p>
<a name="range.reference.algorithms.range_algorithm_mutating_algorithms.partial_sort.definition"></a><h6>
-<a name="id2902709"></a>
+<a name="id3056798"></a>
<a class="link" href="partial_sort.html#range.reference.algorithms.range_algorithm_mutating_algorithms.partial_sort.definition">Definition</a>
</h6>
<p>
Defined in the header file <code class="computeroutput"><span class="identifier">boost</span><span class="special">/</span><span class="identifier">range</span><span class="special">/</span><span class="identifier">algorithm</span><span class="special">/</span><span class="identifier">partial_sort</span><span class="special">.</span><span class="identifier">hpp</span></code>
</p>
<a name="range.reference.algorithms.range_algorithm_mutating_algorithms.partial_sort.requirements"></a><h6>
-<a name="id2902783"></a>
+<a name="id3056873"></a>
<a class="link" href="partial_sort.html#range.reference.algorithms.range_algorithm_mutating_algorithms.partial_sort.requirements">Requirements</a>
</h6>
<p>
@@ -129,7 +133,7 @@
</li>
</ul></div>
<a name="range.reference.algorithms.range_algorithm_mutating_algorithms.partial_sort.complexity"></a><h6>
-<a name="id2903021"></a>
+<a name="id3057110"></a>
<a class="link" href="partial_sort.html#range.reference.algorithms.range_algorithm_mutating_algorithms.partial_sort.complexity">Complexity</a>
</h6>
<p>
Modified: trunk/libs/range/doc/html/range/reference/algorithms/range_algorithm_mutating_algorithms/partition.html
==============================================================================
--- trunk/libs/range/doc/html/range/reference/algorithms/range_algorithm_mutating_algorithms/partition.html (original)
+++ trunk/libs/range/doc/html/range/reference/algorithms/range_algorithm_mutating_algorithms/partition.html 2010-04-11 18:05:02 EDT (Sun, 11 Apr 2010)
@@ -28,7 +28,7 @@
Range Algorithm - partition</a>
</h5></div></div></div>
<a name="range.reference.algorithms.range_algorithm_mutating_algorithms.partition.prototype"></a><h6>
-<a name="id2903145"></a>
+<a name="id3057234"></a>
<a class="link" href="partition.html#range.reference.algorithms.range_algorithm_mutating_algorithms.partition.prototype">Prototype</a>
</h6>
<p>
@@ -67,7 +67,7 @@
<p>
</p>
<a name="range.reference.algorithms.range_algorithm_mutating_algorithms.partition.description"></a><h6>
-<a name="id2903731"></a>
+<a name="id3057821"></a>
<a class="link" href="partition.html#range.reference.algorithms.range_algorithm_mutating_algorithms.partition.description">Description</a>
</h6>
<p>
@@ -81,14 +81,14 @@
corresponds to the middle iterator.
</p>
<a name="range.reference.algorithms.range_algorithm_mutating_algorithms.partition.definition"></a><h6>
-<a name="id2903817"></a>
+<a name="id3057908"></a>
<a class="link" href="partition.html#range.reference.algorithms.range_algorithm_mutating_algorithms.partition.definition">Definition</a>
</h6>
<p>
Defined in the header file <code class="computeroutput"><span class="identifier">boost</span><span class="special">/</span><span class="identifier">range</span><span class="special">/</span><span class="identifier">algorithm</span><span class="special">/</span><span class="identifier">partition</span><span class="special">.</span><span class="identifier">hpp</span></code>
</p>
<a name="range.reference.algorithms.range_algorithm_mutating_algorithms.partition.requirements"></a><h6>
-<a name="id2903891"></a>
+<a name="id3057981"></a>
<a class="link" href="partition.html#range.reference.algorithms.range_algorithm_mutating_algorithms.partition.requirements">Requirements</a>
</h6>
<div class="itemizedlist"><ul class="itemizedlist" type="disc">
@@ -108,7 +108,7 @@
</li>
</ul></div>
<a name="range.reference.algorithms.range_algorithm_mutating_algorithms.partition.complexity"></a><h6>
-<a name="id2903993"></a>
+<a name="id3058084"></a>
<a class="link" href="partition.html#range.reference.algorithms.range_algorithm_mutating_algorithms.partition.complexity">Complexity</a>
</h6>
<p>
Modified: trunk/libs/range/doc/html/range/reference/algorithms/range_algorithm_mutating_algorithms/random_shuffle.html
==============================================================================
--- trunk/libs/range/doc/html/range/reference/algorithms/range_algorithm_mutating_algorithms/random_shuffle.html (original)
+++ trunk/libs/range/doc/html/range/reference/algorithms/range_algorithm_mutating_algorithms/random_shuffle.html 2010-04-11 18:05:02 EDT (Sun, 11 Apr 2010)
@@ -28,7 +28,7 @@
Range Algorithm - random_shuffle</a>
</h5></div></div></div>
<a name="range.reference.algorithms.range_algorithm_mutating_algorithms.random_shuffle.prototype"></a><h6>
-<a name="id2904111"></a>
+<a name="id3058202"></a>
<a class="link" href="random_shuffle.html#range.reference.algorithms.range_algorithm_mutating_algorithms.random_shuffle.prototype">Prototype</a>
</h6>
<p>
@@ -49,7 +49,7 @@
<p>
</p>
<a name="range.reference.algorithms.range_algorithm_mutating_algorithms.random_shuffle.description"></a><h6>
-<a name="id2904502"></a>
+<a name="id3058593"></a>
<a class="link" href="random_shuffle.html#range.reference.algorithms.range_algorithm_mutating_algorithms.random_shuffle.description">Description</a>
</h6>
<p>
@@ -61,14 +61,14 @@
the shuffles range.
</p>
<a name="range.reference.algorithms.range_algorithm_mutating_algorithms.random_shuffle.definition"></a><h6>
-<a name="id2904598"></a>
+<a name="id3058689"></a>
<a class="link" href="random_shuffle.html#range.reference.algorithms.range_algorithm_mutating_algorithms.random_shuffle.definition">Definition</a>
</h6>
<p>
Defined in the header file <code class="computeroutput"><span class="identifier">boost</span><span class="special">/</span><span class="identifier">range</span><span class="special">/</span><span class="identifier">algorithm</span><span class="special">/</span><span class="identifier">random_shuffle</span><span class="special">.</span><span class="identifier">hpp</span></code>
</p>
<a name="range.reference.algorithms.range_algorithm_mutating_algorithms.random_shuffle.requirements"></a><h6>
-<a name="id2904673"></a>
+<a name="id3058764"></a>
<a class="link" href="random_shuffle.html#range.reference.algorithms.range_algorithm_mutating_algorithms.random_shuffle.requirements">Requirements</a>
</h6>
<p>
@@ -99,7 +99,7 @@
</li>
</ul></div>
<a name="range.reference.algorithms.range_algorithm_mutating_algorithms.random_shuffle.precondition_"></a><h6>
-<a name="id2904820"></a>
+<a name="id3058911"></a>
<a class="link" href="random_shuffle.html#range.reference.algorithms.range_algorithm_mutating_algorithms.random_shuffle.precondition_">Precondition:</a>
</h6>
<div class="itemizedlist"><ul class="itemizedlist" type="disc"><li class="listitem">
@@ -108,7 +108,7 @@
maximum value.
</li></ul></div>
<a name="range.reference.algorithms.range_algorithm_mutating_algorithms.random_shuffle.complexity"></a><h6>
-<a name="id2904886"></a>
+<a name="id3058977"></a>
<a class="link" href="random_shuffle.html#range.reference.algorithms.range_algorithm_mutating_algorithms.random_shuffle.complexity">Complexity</a>
</h6>
<p>
Modified: trunk/libs/range/doc/html/range/reference/algorithms/range_algorithm_mutating_algorithms/remove.html
==============================================================================
--- trunk/libs/range/doc/html/range/reference/algorithms/range_algorithm_mutating_algorithms/remove.html (original)
+++ trunk/libs/range/doc/html/range/reference/algorithms/range_algorithm_mutating_algorithms/remove.html 2010-04-11 18:05:02 EDT (Sun, 11 Apr 2010)
@@ -28,7 +28,7 @@
Range Algorithm - remove</a>
</h5></div></div></div>
<a name="range.reference.algorithms.range_algorithm_mutating_algorithms.remove.prototype"></a><h6>
-<a name="id2904998"></a>
+<a name="id3059089"></a>
<a class="link" href="remove.html#range.reference.algorithms.range_algorithm_mutating_algorithms.remove.prototype">Prototype</a>
</h6>
<p>
@@ -67,7 +67,7 @@
<p>
</p>
<a name="range.reference.algorithms.range_algorithm_mutating_algorithms.remove.description"></a><h6>
-<a name="id2905620"></a>
+<a name="id3059711"></a>
<a class="link" href="remove.html#range.reference.algorithms.range_algorithm_mutating_algorithms.remove.description">Description</a>
</h6>
<p>
@@ -84,14 +84,14 @@
are dereferenceable, but the elements are unspecified.
</p>
<a name="range.reference.algorithms.range_algorithm_mutating_algorithms.remove.definition"></a><h6>
-<a name="id2905858"></a>
+<a name="id3059949"></a>
<a class="link" href="remove.html#range.reference.algorithms.range_algorithm_mutating_algorithms.remove.definition">Definition</a>
</h6>
<p>
Defined in the header file <code class="computeroutput"><span class="identifier">boost</span><span class="special">/</span><span class="identifier">range</span><span class="special">/</span><span class="identifier">algorithm</span><span class="special">/</span><span class="identifier">remove</span><span class="special">.</span><span class="identifier">hpp</span></code>
</p>
<a name="range.reference.algorithms.range_algorithm_mutating_algorithms.remove.requirements"></a><h6>
-<a name="id2905932"></a>
+<a name="id3060023"></a>
<a class="link" href="remove.html#range.reference.algorithms.range_algorithm_mutating_algorithms.remove.requirements">Requirements</a>
</h6>
<div class="itemizedlist"><ul class="itemizedlist" type="disc">
@@ -114,7 +114,7 @@
</li>
</ul></div>
<a name="range.reference.algorithms.range_algorithm_mutating_algorithms.remove.complexity"></a><h6>
-<a name="id2906048"></a>
+<a name="id3060139"></a>
<a class="link" href="remove.html#range.reference.algorithms.range_algorithm_mutating_algorithms.remove.complexity">Complexity</a>
</h6>
<p>
Modified: trunk/libs/range/doc/html/range/reference/algorithms/range_algorithm_mutating_algorithms/remove_if.html
==============================================================================
--- trunk/libs/range/doc/html/range/reference/algorithms/range_algorithm_mutating_algorithms/remove_if.html (original)
+++ trunk/libs/range/doc/html/range/reference/algorithms/range_algorithm_mutating_algorithms/remove_if.html 2010-04-11 18:05:02 EDT (Sun, 11 Apr 2010)
@@ -28,7 +28,7 @@
Range Algorithm - remove_if</a>
</h5></div></div></div>
<a name="range.reference.algorithms.range_algorithm_mutating_algorithms.remove_if.prototype"></a><h6>
-<a name="id2906132"></a>
+<a name="id3060223"></a>
<a class="link" href="remove_if.html#range.reference.algorithms.range_algorithm_mutating_algorithms.remove_if.prototype">Prototype</a>
</h6>
<p>
@@ -67,7 +67,7 @@
<p>
</p>
<a name="range.reference.algorithms.range_algorithm_mutating_algorithms.remove_if.description"></a><h6>
-<a name="id2906715"></a>
+<a name="id3060807"></a>
<a class="link" href="remove_if.html#range.reference.algorithms.range_algorithm_mutating_algorithms.remove_if.description">Description</a>
</h6>
<p>
@@ -83,14 +83,14 @@
are unspecified.
</p>
<a name="range.reference.algorithms.range_algorithm_mutating_algorithms.remove_if.definition"></a><h6>
-<a name="id2906948"></a>
+<a name="id3061039"></a>
<a class="link" href="remove_if.html#range.reference.algorithms.range_algorithm_mutating_algorithms.remove_if.definition">Definition</a>
</h6>
<p>
Defined in the header file <code class="computeroutput"><span class="identifier">boost</span><span class="special">/</span><span class="identifier">range</span><span class="special">/</span><span class="identifier">algorithm</span><span class="special">/</span><span class="identifier">remove_if</span><span class="special">.</span><span class="identifier">hpp</span></code>
</p>
<a name="range.reference.algorithms.range_algorithm_mutating_algorithms.remove_if.requirements"></a><h6>
-<a name="id2907022"></a>
+<a name="id3061113"></a>
<a class="link" href="remove_if.html#range.reference.algorithms.range_algorithm_mutating_algorithms.remove_if.requirements">Requirements</a>
</h6>
<div class="itemizedlist"><ul class="itemizedlist" type="disc">
@@ -113,7 +113,7 @@
</li>
</ul></div>
<a name="range.reference.algorithms.range_algorithm_mutating_algorithms.remove_if.complexity"></a><h6>
-<a name="id2907138"></a>
+<a name="id3061230"></a>
<a class="link" href="remove_if.html#range.reference.algorithms.range_algorithm_mutating_algorithms.remove_if.complexity">Complexity</a>
</h6>
<p>
Modified: trunk/libs/range/doc/html/range/reference/algorithms/range_algorithm_mutating_algorithms/replace.html
==============================================================================
--- trunk/libs/range/doc/html/range/reference/algorithms/range_algorithm_mutating_algorithms/replace.html (original)
+++ trunk/libs/range/doc/html/range/reference/algorithms/range_algorithm_mutating_algorithms/replace.html 2010-04-11 18:05:02 EDT (Sun, 11 Apr 2010)
@@ -28,7 +28,7 @@
Range Algorithm - replace</a>
</h5></div></div></div>
<a name="range.reference.algorithms.range_algorithm_mutating_algorithms.replace.prototype"></a><h6>
-<a name="id2907231"></a>
+<a name="id3061322"></a>
<a class="link" href="replace.html#range.reference.algorithms.range_algorithm_mutating_algorithms.replace.prototype">Prototype</a>
</h6>
<p>
@@ -49,7 +49,7 @@
<p>
</p>
<a name="range.reference.algorithms.range_algorithm_mutating_algorithms.replace.description"></a><h6>
-<a name="id2907549"></a>
+<a name="id3061640"></a>
<a class="link" href="replace.html#range.reference.algorithms.range_algorithm_mutating_algorithms.replace.description">Description</a>
</h6>
<p>
@@ -58,14 +58,14 @@
Return a reference to <code class="computeroutput"><span class="identifier">rng</span></code>.
</p>
<a name="range.reference.algorithms.range_algorithm_mutating_algorithms.replace.definition"></a><h6>
-<a name="id2907630"></a>
+<a name="id3061721"></a>
<a class="link" href="replace.html#range.reference.algorithms.range_algorithm_mutating_algorithms.replace.definition">Definition</a>
</h6>
<p>
Defined in the header file <code class="computeroutput"><span class="identifier">boost</span><span class="special">/</span><span class="identifier">range</span><span class="special">/</span><span class="identifier">algorithm</span><span class="special">/</span><span class="identifier">replace</span><span class="special">.</span><span class="identifier">hpp</span></code>
</p>
<a name="range.reference.algorithms.range_algorithm_mutating_algorithms.replace.requirements"></a><h6>
-<a name="id2907704"></a>
+<a name="id3061795"></a>
<a class="link" href="replace.html#range.reference.algorithms.range_algorithm_mutating_algorithms.replace.requirements">Requirements</a>
</h6>
<div class="itemizedlist"><ul class="itemizedlist" type="disc">
@@ -94,7 +94,7 @@
</li>
</ul></div>
<a name="range.reference.algorithms.range_algorithm_mutating_algorithms.replace.complexity"></a><h6>
-<a name="id2907856"></a>
+<a name="id3061947"></a>
<a class="link" href="replace.html#range.reference.algorithms.range_algorithm_mutating_algorithms.replace.complexity">Complexity</a>
</h6>
<p>
Modified: trunk/libs/range/doc/html/range/reference/algorithms/range_algorithm_mutating_algorithms/replace_if.html
==============================================================================
--- trunk/libs/range/doc/html/range/reference/algorithms/range_algorithm_mutating_algorithms/replace_if.html (original)
+++ trunk/libs/range/doc/html/range/reference/algorithms/range_algorithm_mutating_algorithms/replace_if.html 2010-04-11 18:05:02 EDT (Sun, 11 Apr 2010)
@@ -28,7 +28,7 @@
Range Algorithm - replace_if</a>
</h5></div></div></div>
<a name="range.reference.algorithms.range_algorithm_mutating_algorithms.replace_if.prototype"></a><h6>
-<a name="id2907966"></a>
+<a name="id3062057"></a>
<a class="link" href="replace_if.html#range.reference.algorithms.range_algorithm_mutating_algorithms.replace_if.prototype">Prototype</a>
</h6>
<p>
@@ -43,7 +43,7 @@
<p>
</p>
<a name="range.reference.algorithms.range_algorithm_mutating_algorithms.replace_if.description"></a><h6>
-<a name="id2908290"></a>
+<a name="id3062382"></a>
<a class="link" href="replace_if.html#range.reference.algorithms.range_algorithm_mutating_algorithms.replace_if.description">Description</a>
</h6>
<p>
@@ -52,14 +52,14 @@
Returns a reference to <code class="computeroutput"><span class="identifier">rng</span></code>.
</p>
<a name="range.reference.algorithms.range_algorithm_mutating_algorithms.replace_if.definition"></a><h6>
-<a name="id2908408"></a>
+<a name="id3062499"></a>
<a class="link" href="replace_if.html#range.reference.algorithms.range_algorithm_mutating_algorithms.replace_if.definition">Definition</a>
</h6>
<p>
Defined in the header file <code class="computeroutput"><span class="identifier">boost</span><span class="special">/</span><span class="identifier">range</span><span class="special">/</span><span class="identifier">algorithm</span><span class="special">/</span><span class="identifier">replace_if</span><span class="special">.</span><span class="identifier">hpp</span></code>
</p>
<a name="range.reference.algorithms.range_algorithm_mutating_algorithms.replace_if.requirements"></a><h6>
-<a name="id2908483"></a>
+<a name="id3062574"></a>
<a class="link" href="replace_if.html#range.reference.algorithms.range_algorithm_mutating_algorithms.replace_if.requirements">Requirements</a>
</h6>
<div class="itemizedlist"><ul class="itemizedlist" type="disc">
@@ -91,7 +91,7 @@
</li>
</ul></div>
<a name="range.reference.algorithms.range_algorithm_mutating_algorithms.replace_if.complexity"></a><h6>
-<a name="id2908651"></a>
+<a name="id3062742"></a>
<a class="link" href="replace_if.html#range.reference.algorithms.range_algorithm_mutating_algorithms.replace_if.complexity">Complexity</a>
</h6>
<p>
Modified: trunk/libs/range/doc/html/range/reference/algorithms/range_algorithm_mutating_algorithms/rotate.html
==============================================================================
--- trunk/libs/range/doc/html/range/reference/algorithms/range_algorithm_mutating_algorithms/rotate.html (original)
+++ trunk/libs/range/doc/html/range/reference/algorithms/range_algorithm_mutating_algorithms/rotate.html 2010-04-11 18:05:02 EDT (Sun, 11 Apr 2010)
@@ -28,7 +28,7 @@
Range Algorithm - rotate</a>
</h5></div></div></div>
<a name="range.reference.algorithms.range_algorithm_mutating_algorithms.rotate.prototype"></a><h6>
-<a name="id2908770"></a>
+<a name="id3062861"></a>
<a class="link" href="rotate.html#range.reference.algorithms.range_algorithm_mutating_algorithms.rotate.prototype">Prototype</a>
</h6>
<p>
@@ -45,7 +45,7 @@
<p>
</p>
<a name="range.reference.algorithms.range_algorithm_mutating_algorithms.rotate.description"></a><h6>
-<a name="id2909031"></a>
+<a name="id3063123"></a>
<a class="link" href="rotate.html#range.reference.algorithms.range_algorithm_mutating_algorithms.rotate.description">Description</a>
</h6>
<p>
@@ -54,14 +54,14 @@
and <code class="computeroutput"><span class="special">[</span><span class="identifier">middle</span><span class="special">,</span> <span class="identifier">end</span><span class="special">(</span><span class="identifier">rng</span><span class="special">))</span></code>. Returns a reference to <code class="computeroutput"><span class="identifier">rng</span></code>.
</p>
<a name="range.reference.algorithms.range_algorithm_mutating_algorithms.rotate.definition"></a><h6>
-<a name="id2909159"></a>
+<a name="id3063250"></a>
<a class="link" href="rotate.html#range.reference.algorithms.range_algorithm_mutating_algorithms.rotate.definition">Definition</a>
</h6>
<p>
Defined in the header file <code class="computeroutput"><span class="identifier">boost</span><span class="special">/</span><span class="identifier">range</span><span class="special">/</span><span class="identifier">algorithm</span><span class="special">/</span><span class="identifier">rotate</span><span class="special">.</span><span class="identifier">hpp</span></code>
</p>
<a name="range.reference.algorithms.range_algorithm_mutating_algorithms.rotate.requirements"></a><h6>
-<a name="id2909234"></a>
+<a name="id3063325"></a>
<a class="link" href="rotate.html#range.reference.algorithms.range_algorithm_mutating_algorithms.rotate.requirements">Requirements</a>
</h6>
<div class="itemizedlist"><ul class="itemizedlist" type="disc">
@@ -75,7 +75,7 @@
</li>
</ul></div>
<a name="range.reference.algorithms.range_algorithm_mutating_algorithms.rotate.precondition_"></a><h6>
-<a name="id2909298"></a>
+<a name="id3063389"></a>
<a class="link" href="rotate.html#range.reference.algorithms.range_algorithm_mutating_algorithms.rotate.precondition_">Precondition:</a>
</h6>
<div class="itemizedlist"><ul class="itemizedlist" type="disc">
@@ -87,7 +87,7 @@
</li>
</ul></div>
<a name="range.reference.algorithms.range_algorithm_mutating_algorithms.rotate.complexity"></a><h6>
-<a name="id2909409"></a>
+<a name="id3063500"></a>
<a class="link" href="rotate.html#range.reference.algorithms.range_algorithm_mutating_algorithms.rotate.complexity">Complexity</a>
</h6>
<p>
Modified: trunk/libs/range/doc/html/range/reference/algorithms/range_algorithm_mutating_algorithms/sort.html
==============================================================================
--- trunk/libs/range/doc/html/range/reference/algorithms/range_algorithm_mutating_algorithms/sort.html (original)
+++ trunk/libs/range/doc/html/range/reference/algorithms/range_algorithm_mutating_algorithms/sort.html 2010-04-11 18:05:02 EDT (Sun, 11 Apr 2010)
@@ -28,7 +28,7 @@
Range Algorithm - sort</a>
</h5></div></div></div>
<a name="range.reference.algorithms.range_algorithm_mutating_algorithms.sort.prototype"></a><h6>
-<a name="id2909482"></a>
+<a name="id3063573"></a>
<a class="link" href="sort.html#range.reference.algorithms.range_algorithm_mutating_algorithms.sort.prototype">Prototype</a>
</h6>
<p>
@@ -49,7 +49,7 @@
<p>
</p>
<a name="range.reference.algorithms.range_algorithm_mutating_algorithms.sort.description"></a><h6>
-<a name="id2909864"></a>
+<a name="id3063955"></a>
<a class="link" href="sort.html#range.reference.algorithms.range_algorithm_mutating_algorithms.sort.description">Description</a>
</h6>
<p>
@@ -72,14 +72,14 @@
<code class="computeroutput"><span class="special">[</span><span class="identifier">x</span><span class="special">,</span><span class="identifier">y</span><span class="special">]</span></code>, <code class="computeroutput"><span class="identifier">pred</span><span class="special">(</span><span class="identifier">y</span><span class="special">,</span> <span class="identifier">x</span><span class="special">)</span> <span class="special">==</span> <span class="keyword">false</span></code>.
</p>
<a name="range.reference.algorithms.range_algorithm_mutating_algorithms.sort.definition"></a><h6>
-<a name="id2910119"></a>
+<a name="id3064210"></a>
<a class="link" href="sort.html#range.reference.algorithms.range_algorithm_mutating_algorithms.sort.definition">Definition</a>
</h6>
<p>
Defined in the header file <code class="computeroutput"><span class="identifier">boost</span><span class="special">/</span><span class="identifier">range</span><span class="special">/</span><span class="identifier">algorithm</span><span class="special">/</span><span class="identifier">sort</span><span class="special">.</span><span class="identifier">hpp</span></code>
</p>
<a name="range.reference.algorithms.range_algorithm_mutating_algorithms.sort.requirements"></a><h6>
-<a name="id2910193"></a>
+<a name="id3064284"></a>
<a class="link" href="sort.html#range.reference.algorithms.range_algorithm_mutating_algorithms.sort.requirements">Requirements</a>
</h6>
<p>
@@ -130,7 +130,7 @@
</li>
</ul></div>
<a name="range.reference.algorithms.range_algorithm_mutating_algorithms.sort.complexity"></a><h6>
-<a name="id2910429"></a>
+<a name="id3064520"></a>
<a class="link" href="sort.html#range.reference.algorithms.range_algorithm_mutating_algorithms.sort.complexity">Complexity</a>
</h6>
<p>
Modified: trunk/libs/range/doc/html/range/reference/algorithms/range_algorithm_mutating_algorithms/stable_partition.html
==============================================================================
--- trunk/libs/range/doc/html/range/reference/algorithms/range_algorithm_mutating_algorithms/stable_partition.html (original)
+++ trunk/libs/range/doc/html/range/reference/algorithms/range_algorithm_mutating_algorithms/stable_partition.html 2010-04-11 18:05:02 EDT (Sun, 11 Apr 2010)
@@ -28,7 +28,7 @@
Range Algorithm - stable_partition</a>
</h5></div></div></div>
<a name="range.reference.algorithms.range_algorithm_mutating_algorithms.stable_partition.prototype"></a><h6>
-<a name="id2910550"></a>
+<a name="id3064641"></a>
<a class="link" href="stable_partition.html#range.reference.algorithms.range_algorithm_mutating_algorithms.stable_partition.prototype">Prototype</a>
</h6>
<p>
@@ -61,7 +61,7 @@
<p>
</p>
<a name="range.reference.algorithms.range_algorithm_mutating_algorithms.stable_partition.description"></a><h6>
-<a name="id2911131"></a>
+<a name="id3065223"></a>
<a class="link" href="stable_partition.html#range.reference.algorithms.range_algorithm_mutating_algorithms.stable_partition.description">Description</a>
</h6>
<p>
@@ -83,14 +83,14 @@
the iterator to the first element that fails to satisfy <code class="computeroutput"><span class="identifier">pred</span></code>.
</p>
<a name="range.reference.algorithms.range_algorithm_mutating_algorithms.stable_partition.definition"></a><h6>
-<a name="id2911284"></a>
+<a name="id3065376"></a>
<a class="link" href="stable_partition.html#range.reference.algorithms.range_algorithm_mutating_algorithms.stable_partition.definition">Definition</a>
</h6>
<p>
Defined in the header file <code class="computeroutput"><span class="identifier">boost</span><span class="special">/</span><span class="identifier">range</span><span class="special">/</span><span class="identifier">algorithm</span><span class="special">/</span><span class="identifier">stable_partition</span><span class="special">.</span><span class="identifier">hpp</span></code>
</p>
<a name="range.reference.algorithms.range_algorithm_mutating_algorithms.stable_partition.requirements"></a><h6>
-<a name="id2911360"></a>
+<a name="id3065451"></a>
<a class="link" href="stable_partition.html#range.reference.algorithms.range_algorithm_mutating_algorithms.stable_partition.requirements">Requirements</a>
</h6>
<div class="itemizedlist"><ul class="itemizedlist" type="disc">
@@ -108,7 +108,7 @@
</li>
</ul></div>
<a name="range.reference.algorithms.range_algorithm_mutating_algorithms.stable_partition.complexity"></a><h6>
-<a name="id2911451"></a>
+<a name="id3065542"></a>
<a class="link" href="stable_partition.html#range.reference.algorithms.range_algorithm_mutating_algorithms.stable_partition.complexity">Complexity</a>
</h6>
<p>
Modified: trunk/libs/range/doc/html/range/reference/algorithms/range_algorithm_mutating_algorithms/stable_sort.html
==============================================================================
--- trunk/libs/range/doc/html/range/reference/algorithms/range_algorithm_mutating_algorithms/stable_sort.html (original)
+++ trunk/libs/range/doc/html/range/reference/algorithms/range_algorithm_mutating_algorithms/stable_sort.html 2010-04-11 18:05:02 EDT (Sun, 11 Apr 2010)
@@ -28,7 +28,7 @@
Range Algorithm - stable_sort</a>
</h5></div></div></div>
<a name="range.reference.algorithms.range_algorithm_mutating_algorithms.stable_sort.prototype"></a><h6>
-<a name="id2911626"></a>
+<a name="id3065717"></a>
<a class="link" href="stable_sort.html#range.reference.algorithms.range_algorithm_mutating_algorithms.stable_sort.prototype">Prototype</a>
</h6>
<p>
@@ -49,7 +49,7 @@
<p>
</p>
<a name="range.reference.algorithms.range_algorithm_mutating_algorithms.stable_sort.description"></a><h6>
-<a name="id2912009"></a>
+<a name="id3066100"></a>
<a class="link" href="stable_sort.html#range.reference.algorithms.range_algorithm_mutating_algorithms.stable_sort.description">Description</a>
</h6>
<p>
@@ -72,14 +72,14 @@
<code class="computeroutput"><span class="special">[</span><span class="identifier">x</span><span class="special">,</span><span class="identifier">y</span><span class="special">]</span></code>, <code class="computeroutput"><span class="identifier">pred</span><span class="special">(</span><span class="identifier">y</span><span class="special">,</span><span class="identifier">x</span><span class="special">)</span> <span class="special">==</span> <span class="keyword">false</span></code>.
</p>
<a name="range.reference.algorithms.range_algorithm_mutating_algorithms.stable_sort.definition"></a><h6>
-<a name="id2912264"></a>
+<a name="id3066355"></a>
<a class="link" href="stable_sort.html#range.reference.algorithms.range_algorithm_mutating_algorithms.stable_sort.definition">Definition</a>
</h6>
<p>
Defined in the header file <code class="computeroutput"><span class="identifier">boost</span><span class="special">/</span><span class="identifier">range</span><span class="special">/</span><span class="identifier">algorithm</span><span class="special">/</span><span class="identifier">stable_sort</span><span class="special">.</span><span class="identifier">hpp</span></code>
</p>
<a name="range.reference.algorithms.range_algorithm_mutating_algorithms.stable_sort.requirements"></a><h6>
-<a name="id2912338"></a>
+<a name="id3066430"></a>
<a class="link" href="stable_sort.html#range.reference.algorithms.range_algorithm_mutating_algorithms.stable_sort.requirements">Requirements</a>
</h6>
<p>
@@ -130,7 +130,7 @@
</li>
</ul></div>
<a name="range.reference.algorithms.range_algorithm_mutating_algorithms.stable_sort.complexity"></a><h6>
-<a name="id2912575"></a>
+<a name="id3066667"></a>
<a class="link" href="stable_sort.html#range.reference.algorithms.range_algorithm_mutating_algorithms.stable_sort.complexity">Complexity</a>
</h6>
<p>
Modified: trunk/libs/range/doc/html/range/reference/algorithms/range_algorithm_mutating_algorithms/transform.html
==============================================================================
--- trunk/libs/range/doc/html/range/reference/algorithms/range_algorithm_mutating_algorithms/transform.html (original)
+++ trunk/libs/range/doc/html/range/reference/algorithms/range_algorithm_mutating_algorithms/transform.html 2010-04-11 18:05:02 EDT (Sun, 11 Apr 2010)
@@ -28,7 +28,7 @@
Range Algorithm - transform</a>
</h5></div></div></div>
<a name="range.reference.algorithms.range_algorithm_mutating_algorithms.transform.prototype"></a><h6>
-<a name="id2912764"></a>
+<a name="id3066856"></a>
<a class="link" href="transform.html#range.reference.algorithms.range_algorithm_mutating_algorithms.transform.prototype">Prototype</a>
</h6>
<p>
@@ -57,7 +57,7 @@
<p>
</p>
<a name="range.reference.algorithms.range_algorithm_mutating_algorithms.transform.description"></a><h6>
-<a name="id2913106"></a>
+<a name="id3067196"></a>
<a class="link" href="transform.html#range.reference.algorithms.range_algorithm_mutating_algorithms.transform.description">Description</a>
</h6>
<p>
@@ -93,14 +93,14 @@
The return value is <code class="computeroutput"><span class="identifier">out</span> <span class="special">+</span> <span class="identifier">min</span><span class="special">(</span><span class="identifier">distance</span><span class="special">(</span><span class="identifier">rng1</span><span class="special">),</span> <span class="identifier">distance</span><span class="special">(</span><span class="identifier">rng2</span><span class="special">))</span></code>.
</p>
<a name="range.reference.algorithms.range_algorithm_mutating_algorithms.transform.definition"></a><h6>
-<a name="id2913658"></a>
+<a name="id3067749"></a>
<a class="link" href="transform.html#range.reference.algorithms.range_algorithm_mutating_algorithms.transform.definition">Definition</a>
</h6>
<p>
Defined in the header file <code class="computeroutput"><span class="identifier">boost</span><span class="special">/</span><span class="identifier">range</span><span class="special">/</span><span class="identifier">algorithm</span><span class="special">/</span><span class="identifier">transform</span><span class="special">.</span><span class="identifier">hpp</span></code>
</p>
<a name="range.reference.algorithms.range_algorithm_mutating_algorithms.transform.requirements"></a><h6>
-<a name="id2913733"></a>
+<a name="id3067824"></a>
<a class="link" href="transform.html#range.reference.algorithms.range_algorithm_mutating_algorithms.transform.requirements">Requirements</a>
</h6>
<p>
@@ -170,7 +170,7 @@
</li>
</ul></div>
<a name="range.reference.algorithms.range_algorithm_mutating_algorithms.transform.precondition_"></a><h6>
-<a name="id2914087"></a>
+<a name="id3068178"></a>
<a class="link" href="transform.html#range.reference.algorithms.range_algorithm_mutating_algorithms.transform.precondition_">Precondition:</a>
</h6>
<p>
@@ -202,7 +202,7 @@
</li>
</ul></div>
<a name="range.reference.algorithms.range_algorithm_mutating_algorithms.transform.complexity"></a><h6>
-<a name="id2914504"></a>
+<a name="id3068595"></a>
<a class="link" href="transform.html#range.reference.algorithms.range_algorithm_mutating_algorithms.transform.complexity">Complexity</a>
</h6>
<p>
Modified: trunk/libs/range/doc/html/range/reference/algorithms/range_algorithm_mutating_algorithms/unique.html
==============================================================================
--- trunk/libs/range/doc/html/range/reference/algorithms/range_algorithm_mutating_algorithms/unique.html (original)
+++ trunk/libs/range/doc/html/range/reference/algorithms/range_algorithm_mutating_algorithms/unique.html 2010-04-11 18:05:02 EDT (Sun, 11 Apr 2010)
@@ -28,7 +28,7 @@
Range Algorithm - unique</a>
</h5></div></div></div>
<a name="range.reference.algorithms.range_algorithm_mutating_algorithms.unique.prototype"></a><h6>
-<a name="id2914631"></a>
+<a name="id3068722"></a>
<a class="link" href="unique.html#range.reference.algorithms.range_algorithm_mutating_algorithms.unique.prototype">Prototype</a>
</h6>
<p>
@@ -69,7 +69,7 @@
<p>
</p>
<a name="range.reference.algorithms.range_algorithm_mutating_algorithms.unique.description"></a><h6>
-<a name="id2915663"></a>
+<a name="id3069755"></a>
<a class="link" href="unique.html#range.reference.algorithms.range_algorithm_mutating_algorithms.unique.description">Description</a>
</h6>
<p>
@@ -87,14 +87,14 @@
type.
</p>
<a name="range.reference.algorithms.range_algorithm_mutating_algorithms.unique.definition"></a><h6>
-<a name="id2915788"></a>
+<a name="id3069879"></a>
<a class="link" href="unique.html#range.reference.algorithms.range_algorithm_mutating_algorithms.unique.definition">Definition</a>
</h6>
<p>
Defined in the header file <code class="computeroutput"><span class="identifier">boost</span><span class="special">/</span><span class="identifier">range</span><span class="special">/</span><span class="identifier">algorithm</span><span class="special">/</span><span class="identifier">unique</span><span class="special">.</span><span class="identifier">hpp</span></code>
</p>
<a name="range.reference.algorithms.range_algorithm_mutating_algorithms.unique.requirements"></a><h6>
-<a name="id2915863"></a>
+<a name="id3069954"></a>
<a class="link" href="unique.html#range.reference.algorithms.range_algorithm_mutating_algorithms.unique.requirements">Requirements</a>
</h6>
<p>
@@ -138,7 +138,7 @@
</li>
</ul></div>
<a name="range.reference.algorithms.range_algorithm_mutating_algorithms.unique.complexity"></a><h6>
-<a name="id2916076"></a>
+<a name="id3070168"></a>
<a class="link" href="unique.html#range.reference.algorithms.range_algorithm_mutating_algorithms.unique.complexity">Complexity</a>
</h6>
<p>
Modified: trunk/libs/range/doc/html/range/reference/algorithms/range_algorithm_new_algorithms/erase.html
==============================================================================
--- trunk/libs/range/doc/html/range/reference/algorithms/range_algorithm_new_algorithms/erase.html (original)
+++ trunk/libs/range/doc/html/range/reference/algorithms/range_algorithm_new_algorithms/erase.html 2010-04-11 18:05:02 EDT (Sun, 11 Apr 2010)
@@ -28,23 +28,21 @@
erase</a>
</h5></div></div></div>
<a name="range.reference.algorithms.range_algorithm_new_algorithms.erase.prototype"></a><h6>
-<a name="id2947607"></a>
+<a name="id3102704"></a>
<a class="link" href="erase.html#range.reference.algorithms.range_algorithm_new_algorithms.erase.prototype">Prototype</a>
</h6>
<p>
</p>
-<pre class="programlisting"><span class="keyword">template</span><span class="special"><</span>
- <span class="keyword">class</span> <span class="identifier">Container</span><span class="special">,</span>
- <span class="keyword">class</span> <span class="identifier">SinglePassRange</span>
- <span class="special">></span>
-<span class="keyword">void</span> <span class="identifier">erase</span><span class="special">(</span><span class="identifier">Container</span><span class="special">&</span> <span class="identifier">target</span><span class="special">,</span>
- <span class="identifier">iterator_range</span><span class="special"><</span><span class="keyword">typename</span> <span class="identifier">Container</span><span class="special">::</span><span class="identifier">iterator</span><span class="special">></span> <span class="identifier">to_erase</span><span class="special">);</span>
+<pre class="programlisting"><span class="keyword">template</span><span class="special"><</span><span class="keyword">class</span> <span class="identifier">Container</span><span class="special">></span>
+<span class="identifier">Container</span><span class="special">&</span> <span class="identifier">erase</span><span class="special">(</span>
+ <span class="identifier">Container</span><span class="special">&</span> <span class="identifier">target</span><span class="special">,</span>
+ <span class="identifier">iterator_range</span><span class="special"><</span><span class="keyword">typename</span> <span class="identifier">Container</span><span class="special">::</span><span class="identifier">iterator</span><span class="special">></span> <span class="identifier">to_erase</span><span class="special">);</span>
</pre>
<p>
</p>
<a name="range.reference.algorithms.range_algorithm_new_algorithms.erase.description"></a><h6>
-<a name="id2947764"></a>
+<a name="id3102848"></a>
<a class="link" href="erase.html#range.reference.algorithms.range_algorithm_new_algorithms.erase.description">Description</a>
</h6>
<p>
@@ -52,15 +50,23 @@
<code class="computeroutput"><span class="identifier">to_erase</span></code> from the container
<code class="computeroutput"><span class="identifier">target</span></code>.
</p>
+<p>
+ <code class="computeroutput"><span class="identifier">remove_erase</span></code> performs
+ the frequently used combination equivalent to <code class="computeroutput"><span class="identifier">target</span><span class="special">.</span><span class="identifier">erase</span><span class="special">(</span><span class="identifier">std</span><span class="special">::</span><span class="identifier">remove</span><span class="special">(</span><span class="identifier">target</span><span class="special">.</span><span class="identifier">begin</span><span class="special">(),</span> <span class="identifier">target</span><span class="special">.</span><span class="identifier">end</span><span class="special">(),</span> <span class="identifier">value</span><span class="special">),</span> <span class="identifier">target</span><span class="special">.</span><span class="identifier">end</span><span class="special">());</span></code>
+ </p>
+<p>
+ <code class="computeroutput"><span class="identifier">remove_erase_if</span></code> performs
+ the frequently used combination equivalent to <code class="computeroutput"><span class="identifier">target</span><span class="special">.</span><span class="identifier">erase</span><span class="special">(</span><span class="identifier">std</span><span class="special">::</span><span class="identifier">remove_if</span><span class="special">(</span><span class="identifier">target</span><span class="special">.</span><span class="identifier">begin</span><span class="special">(),</span> <span class="identifier">target</span><span class="special">.</span><span class="identifier">end</span><span class="special">(),</span> <span class="identifier">pred</span><span class="special">),</span> <span class="identifier">target</span><span class="special">.</span><span class="identifier">end</span><span class="special">());</span></code>
+ </p>
<a name="range.reference.algorithms.range_algorithm_new_algorithms.erase.definition"></a><h6>
-<a name="id2947824"></a>
+<a name="id3103154"></a>
<a class="link" href="erase.html#range.reference.algorithms.range_algorithm_new_algorithms.erase.definition">Definition</a>
</h6>
<p>
Defined in the header file <code class="computeroutput"><span class="identifier">boost</span><span class="special">/</span><span class="identifier">range</span><span class="special">/</span><span class="identifier">algorithm_ext</span><span class="special">/</span><span class="identifier">erase</span><span class="special">.</span><span class="identifier">hpp</span></code>
</p>
<a name="range.reference.algorithms.range_algorithm_new_algorithms.erase.requirements"></a><h6>
-<a name="id2947899"></a>
+<a name="id3103229"></a>
<a class="link" href="erase.html#range.reference.algorithms.range_algorithm_new_algorithms.erase.requirements">Requirements</a>
</h6>
<div class="orderedlist"><ol class="orderedlist" type="1"><li class="listitem">
@@ -68,7 +74,7 @@
erase of an iterator range.
</li></ol></div>
<a name="range.reference.algorithms.range_algorithm_new_algorithms.erase.complexity"></a><h6>
-<a name="id2947944"></a>
+<a name="id3103276"></a>
<a class="link" href="erase.html#range.reference.algorithms.range_algorithm_new_algorithms.erase.complexity">Complexity</a>
</h6>
<p>
Modified: trunk/libs/range/doc/html/range/reference/algorithms/range_algorithm_new_algorithms/for_each.html
==============================================================================
--- trunk/libs/range/doc/html/range/reference/algorithms/range_algorithm_new_algorithms/for_each.html (original)
+++ trunk/libs/range/doc/html/range/reference/algorithms/range_algorithm_new_algorithms/for_each.html 2010-04-11 18:05:02 EDT (Sun, 11 Apr 2010)
@@ -28,7 +28,7 @@
for_each</a>
</h5></div></div></div>
<a name="range.reference.algorithms.range_algorithm_new_algorithms.for_each.prototype"></a><h6>
-<a name="id2948016"></a>
+<a name="id3103348"></a>
<a class="link" href="for_each.html#range.reference.algorithms.range_algorithm_new_algorithms.for_each.prototype">Prototype</a>
</h6>
<p>
@@ -73,7 +73,7 @@
<p>
</p>
<a name="range.reference.algorithms.range_algorithm_new_algorithms.for_each.description"></a><h6>
-<a name="id2948600"></a>
+<a name="id3103932"></a>
<a class="link" href="for_each.html#range.reference.algorithms.range_algorithm_new_algorithms.for_each.description">Description</a>
</h6>
<p>
@@ -89,14 +89,14 @@
It is safe to call this function with unequal length ranges.
</p>
<a name="range.reference.algorithms.range_algorithm_new_algorithms.for_each.definition"></a><h6>
-<a name="id2948764"></a>
+<a name="id3104096"></a>
<a class="link" href="for_each.html#range.reference.algorithms.range_algorithm_new_algorithms.for_each.definition">Definition</a>
</h6>
<p>
Defined in the header file <code class="computeroutput"><span class="identifier">boost</span><span class="special">/</span><span class="identifier">range</span><span class="special">/</span><span class="identifier">algorithm_ext</span><span class="special">/</span><span class="identifier">for_each</span><span class="special">.</span><span class="identifier">hpp</span></code>
</p>
<a name="range.reference.algorithms.range_algorithm_new_algorithms.for_each.requirements"></a><h6>
-<a name="id2948839"></a>
+<a name="id3104171"></a>
<a class="link" href="for_each.html#range.reference.algorithms.range_algorithm_new_algorithms.for_each.requirements">Requirements</a>
</h6>
<div class="orderedlist"><ol class="orderedlist" type="1">
@@ -126,7 +126,7 @@
</li>
</ol></div>
<a name="range.reference.algorithms.range_algorithm_new_algorithms.for_each.complexity"></a><h6>
-<a name="id2948995"></a>
+<a name="id3104326"></a>
<a class="link" href="for_each.html#range.reference.algorithms.range_algorithm_new_algorithms.for_each.complexity">Complexity</a>
</h6>
<p>
Modified: trunk/libs/range/doc/html/range/reference/algorithms/range_algorithm_new_algorithms/insert.html
==============================================================================
--- trunk/libs/range/doc/html/range/reference/algorithms/range_algorithm_new_algorithms/insert.html (original)
+++ trunk/libs/range/doc/html/range/reference/algorithms/range_algorithm_new_algorithms/insert.html 2010-04-11 18:05:02 EDT (Sun, 11 Apr 2010)
@@ -28,7 +28,7 @@
insert</a>
</h5></div></div></div>
<a name="range.reference.algorithms.range_algorithm_new_algorithms.insert.prototype"></a><h6>
-<a name="id2949105"></a>
+<a name="id3104437"></a>
<a class="link" href="insert.html#range.reference.algorithms.range_algorithm_new_algorithms.insert.prototype">Prototype</a>
</h6>
<p>
@@ -38,14 +38,14 @@
<span class="keyword">class</span> <span class="identifier">Container</span><span class="special">,</span>
<span class="keyword">class</span> <span class="identifier">SinglePassRange</span>
<span class="special">></span>
-<span class="keyword">void</span> <span class="identifier">insert</span><span class="special">(</span><span class="identifier">Container</span><span class="special">&</span> <span class="identifier">target</span><span class="special">,</span>
- <span class="keyword">typename</span> <span class="identifier">Container</span><span class="special">::</span><span class="identifier">iterator</span> <span class="identifier">before</span><span class="special">,</span>
- <span class="keyword">const</span> <span class="identifier">SinglePassRange</span><span class="special">&</span> <span class="identifier">from</span><span class="special">);</span>
+<span class="identifier">Container</span><span class="special">&</span> <span class="identifier">insert</span><span class="special">(</span><span class="identifier">Container</span><span class="special">&</span> <span class="identifier">target</span><span class="special">,</span>
+ <span class="keyword">typename</span> <span class="identifier">Container</span><span class="special">::</span><span class="identifier">iterator</span> <span class="identifier">before</span><span class="special">,</span>
+ <span class="keyword">const</span> <span class="identifier">SinglePassRange</span><span class="special">&</span> <span class="identifier">from</span><span class="special">);</span>
</pre>
<p>
</p>
<a name="range.reference.algorithms.range_algorithm_new_algorithms.insert.description"></a><h6>
-<a name="id2949274"></a>
+<a name="id3104610"></a>
<a class="link" href="insert.html#range.reference.algorithms.range_algorithm_new_algorithms.insert.description">Description</a>
</h6>
<p>
@@ -55,14 +55,14 @@
<code class="computeroutput"><span class="identifier">target</span></code>.
</p>
<a name="range.reference.algorithms.range_algorithm_new_algorithms.insert.definition"></a><h6>
-<a name="id2949345"></a>
+<a name="id3104682"></a>
<a class="link" href="insert.html#range.reference.algorithms.range_algorithm_new_algorithms.insert.definition">Definition</a>
</h6>
<p>
Defined in the header file <code class="computeroutput"><span class="identifier">boost</span><span class="special">/</span><span class="identifier">range</span><span class="special">/</span><span class="identifier">algorithm_ext</span><span class="special">/</span><span class="identifier">insert</span><span class="special">.</span><span class="identifier">hpp</span></code>
</p>
<a name="range.reference.algorithms.range_algorithm_new_algorithms.insert.requirements"></a><h6>
-<a name="id2949418"></a>
+<a name="id3104756"></a>
<a class="link" href="insert.html#range.reference.algorithms.range_algorithm_new_algorithms.insert.requirements">Requirements</a>
</h6>
<div class="orderedlist"><ol class="orderedlist" type="1">
@@ -82,7 +82,7 @@
</li>
</ol></div>
<a name="range.reference.algorithms.range_algorithm_new_algorithms.insert.complexity"></a><h6>
-<a name="id2949513"></a>
+<a name="id3104850"></a>
<a class="link" href="insert.html#range.reference.algorithms.range_algorithm_new_algorithms.insert.complexity">Complexity</a>
</h6>
<p>
Modified: trunk/libs/range/doc/html/range/reference/algorithms/range_algorithm_new_algorithms/iota.html
==============================================================================
--- trunk/libs/range/doc/html/range/reference/algorithms/range_algorithm_new_algorithms/iota.html (original)
+++ trunk/libs/range/doc/html/range/reference/algorithms/range_algorithm_new_algorithms/iota.html 2010-04-11 18:05:02 EDT (Sun, 11 Apr 2010)
@@ -3,7 +3,7 @@
<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
<title>iota</title>
<link rel="stylesheet" href="../../../../../../../../doc/html/boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.75.2">
+<meta name="generator" content="DocBook XSL Stylesheets V1.75.1">
<link rel="home" href="../../../../index.html" title="Chapter 1. Range 2.0">
<link rel="up" href="../range_algorithm_new_algorithms.html" title="New algorithms">
<link rel="prev" href="insert.html" title="insert">
@@ -28,19 +28,19 @@
iota</a>
</h5></div></div></div>
<a name="range.reference.algorithms.range_algorithm_new_algorithms.iota.prototype"></a><h6>
-<a name="id716034"></a>
+<a name="id3104923"></a>
<a class="link" href="iota.html#range.reference.algorithms.range_algorithm_new_algorithms.iota.prototype">Prototype</a>
</h6>
<p>
</p>
-<pre class="programlisting"><span class="keyword">template</span><span class="special"><</span><span class="keyword">class</span> <span class="identifier">SinglePassRange</span><span class="special">,</span> <span class="keyword">class</span> <span class="identifier">Value</span><span class="special">></span>
-<span class="identifier">iota</span><span class="special">(</span><span class="identifier">SinglePassRange</span><span class="special">&</span> <span class="identifier">rng</span><span class="special">,</span> <span class="identifier">Value</span> <span class="identifier">x</span><span class="special">);</span>
+<pre class="programlisting"><span class="keyword">template</span><span class="special"><</span><span class="keyword">class</span> <span class="identifier">ForwardRange</span><span class="special">,</span> <span class="keyword">class</span> <span class="identifier">Value</span><span class="special">></span>
+<span class="identifier">ForwardRange</span><span class="special">&</span> <span class="identifier">iota</span><span class="special">(</span><span class="identifier">ForwardRange</span><span class="special">&</span> <span class="identifier">rng</span><span class="special">,</span> <span class="identifier">Value</span> <span class="identifier">x</span><span class="special">);</span>
</pre>
<p>
</p>
<a name="range.reference.algorithms.range_algorithm_new_algorithms.iota.description"></a><h6>
-<a name="id716150"></a>
+<a name="id3105053"></a>
<a class="link" href="iota.html#range.reference.algorithms.range_algorithm_new_algorithms.iota.description">Description</a>
</h6>
<p>
@@ -51,21 +51,21 @@
<span class="special">+</span> <span class="identifier">boost</span><span class="special">::</span><span class="identifier">distance</span><span class="special">(</span><span class="identifier">boost</span><span class="special">::</span><span class="identifier">begin</span><span class="special">(</span><span class="identifier">rng</span><span class="special">),</span> <span class="identifier">it</span><span class="special">)</span></code>
</p>
<a name="range.reference.algorithms.range_algorithm_new_algorithms.iota.definition"></a><h6>
-<a name="id716288"></a>
+<a name="id3105195"></a>
<a class="link" href="iota.html#range.reference.algorithms.range_algorithm_new_algorithms.iota.definition">Definition</a>
</h6>
<p>
Defined in the header file <code class="computeroutput"><span class="identifier">boost</span><span class="special">/</span><span class="identifier">range</span><span class="special">/</span><span class="identifier">algorithm_ext</span><span class="special">/</span><span class="identifier">iota</span><span class="special">.</span><span class="identifier">hpp</span></code>
</p>
<a name="range.reference.algorithms.range_algorithm_new_algorithms.iota.requirements"></a><h6>
-<a name="id716360"></a>
+<a name="id3105266"></a>
<a class="link" href="iota.html#range.reference.algorithms.range_algorithm_new_algorithms.iota.requirements">Requirements</a>
</h6>
<div class="orderedlist"><ol class="orderedlist" type="1">
<li class="listitem">
-<code class="computeroutput"><span class="identifier">SinglePassRange</span></code> is
- a model of the <a class="link" href="../../../concepts/single_pass_range.html" title="Single Pass Range">Single
- Pass Range</a> Concept.
+<code class="computeroutput"><span class="identifier">ForwardRange</span></code> is a model
+ of the <a class="link" href="../../../concepts/forward_range.html" title="Forward Range">Forward Range</a>
+ Concept.
</li>
<li class="listitem">
<code class="computeroutput"><span class="identifier">Value</span></code> is a model of
@@ -73,7 +73,7 @@
</li>
</ol></div>
<a name="range.reference.algorithms.range_algorithm_new_algorithms.iota.complexity"></a><h6>
-<a name="id716434"></a>
+<a name="id3105345"></a>
<a class="link" href="iota.html#range.reference.algorithms.range_algorithm_new_algorithms.iota.complexity">Complexity</a>
</h6>
<p>
Modified: trunk/libs/range/doc/html/range/reference/algorithms/range_algorithm_new_algorithms/overwrite.html
==============================================================================
--- trunk/libs/range/doc/html/range/reference/algorithms/range_algorithm_new_algorithms/overwrite.html (original)
+++ trunk/libs/range/doc/html/range/reference/algorithms/range_algorithm_new_algorithms/overwrite.html 2010-04-11 18:05:02 EDT (Sun, 11 Apr 2010)
@@ -28,7 +28,7 @@
overwrite</a>
</h5></div></div></div>
<a name="range.reference.algorithms.range_algorithm_new_algorithms.overwrite.prototype"></a><h6>
-<a name="id2950081"></a>
+<a name="id3105428"></a>
<a class="link" href="overwrite.html#range.reference.algorithms.range_algorithm_new_algorithms.overwrite.prototype">Prototype</a>
</h6>
<p>
@@ -44,7 +44,7 @@
<p>
</p>
<a name="range.reference.algorithms.range_algorithm_new_algorithms.overwrite.description"></a><h6>
-<a name="id2950220"></a>
+<a name="id3105567"></a>
<a class="link" href="overwrite.html#range.reference.algorithms.range_algorithm_new_algorithms.overwrite.description">Description</a>
</h6>
<p>
@@ -53,14 +53,14 @@
into the range <code class="computeroutput"><span class="identifier">to</span></code>.
</p>
<a name="range.reference.algorithms.range_algorithm_new_algorithms.overwrite.definition"></a><h6>
-<a name="id2950281"></a>
+<a name="id3105628"></a>
<a class="link" href="overwrite.html#range.reference.algorithms.range_algorithm_new_algorithms.overwrite.definition">Definition</a>
</h6>
<p>
Defined in the header file <code class="computeroutput"><span class="identifier">boost</span><span class="special">/</span><span class="identifier">range</span><span class="special">/</span><span class="identifier">algorithm_ext</span><span class="special">/</span><span class="identifier">overwrite</span><span class="special">.</span><span class="identifier">hpp</span></code>
</p>
<a name="range.reference.algorithms.range_algorithm_new_algorithms.overwrite.requirements"></a><h6>
-<a name="id2950356"></a>
+<a name="id3105702"></a>
<a class="link" href="overwrite.html#range.reference.algorithms.range_algorithm_new_algorithms.overwrite.requirements">Requirements</a>
</h6>
<div class="orderedlist"><ol class="orderedlist" type="1">
@@ -87,7 +87,7 @@
</li>
</ol></div>
<a name="range.reference.algorithms.range_algorithm_new_algorithms.overwrite.complexity"></a><h6>
-<a name="id2950526"></a>
+<a name="id3105873"></a>
<a class="link" href="overwrite.html#range.reference.algorithms.range_algorithm_new_algorithms.overwrite.complexity">Complexity</a>
</h6>
<p>
Modified: trunk/libs/range/doc/html/range/reference/algorithms/range_algorithm_new_algorithms/push_back.html
==============================================================================
--- trunk/libs/range/doc/html/range/reference/algorithms/range_algorithm_new_algorithms/push_back.html (original)
+++ trunk/libs/range/doc/html/range/reference/algorithms/range_algorithm_new_algorithms/push_back.html 2010-04-11 18:05:02 EDT (Sun, 11 Apr 2010)
@@ -28,7 +28,7 @@
push_back</a>
</h5></div></div></div>
<a name="range.reference.algorithms.range_algorithm_new_algorithms.push_back.prototype"></a><h6>
-<a name="id2950600"></a>
+<a name="id3105946"></a>
<a class="link" href="push_back.html#range.reference.algorithms.range_algorithm_new_algorithms.push_back.prototype">Prototype</a>
</h6>
<p>
@@ -38,13 +38,13 @@
<span class="keyword">class</span> <span class="identifier">Container</span><span class="special">,</span>
<span class="keyword">class</span> <span class="identifier">SinglePassRange</span>
<span class="special">></span>
-<span class="keyword">void</span> <span class="identifier">push_back</span><span class="special">(</span><span class="identifier">Container</span><span class="special">&</span> <span class="identifier">target</span><span class="special">,</span>
- <span class="keyword">const</span> <span class="identifier">SinglePassRange</span><span class="special">&</span> <span class="identifier">from</span><span class="special">);</span>
+<span class="identifier">Container</span><span class="special">&</span> <span class="identifier">push_back</span><span class="special">(</span><span class="identifier">Container</span><span class="special">&</span> <span class="identifier">target</span><span class="special">,</span>
+ <span class="keyword">const</span> <span class="identifier">SinglePassRange</span><span class="special">&</span> <span class="identifier">from</span><span class="special">);</span>
</pre>
<p>
</p>
<a name="range.reference.algorithms.range_algorithm_new_algorithms.push_back.description"></a><h6>
-<a name="id2950738"></a>
+<a name="id3106090"></a>
<a class="link" href="push_back.html#range.reference.algorithms.range_algorithm_new_algorithms.push_back.description">Description</a>
</h6>
<p>
@@ -53,14 +53,14 @@
to the back of the container <code class="computeroutput"><span class="identifier">target</span></code>.
</p>
<a name="range.reference.algorithms.range_algorithm_new_algorithms.push_back.definition"></a><h6>
-<a name="id2950800"></a>
+<a name="id3106151"></a>
<a class="link" href="push_back.html#range.reference.algorithms.range_algorithm_new_algorithms.push_back.definition">Definition</a>
</h6>
<p>
Defined in the header file <code class="computeroutput"><span class="identifier">boost</span><span class="special">/</span><span class="identifier">range</span><span class="special">/</span><span class="identifier">algorithm_ext</span><span class="special">/</span><span class="identifier">push_back</span><span class="special">.</span><span class="identifier">hpp</span></code>
</p>
<a name="range.reference.algorithms.range_algorithm_new_algorithms.push_back.requirements"></a><h6>
-<a name="id2950875"></a>
+<a name="id3106226"></a>
<a class="link" href="push_back.html#range.reference.algorithms.range_algorithm_new_algorithms.push_back.requirements">Requirements</a>
</h6>
<div class="orderedlist"><ol class="orderedlist" type="1">
@@ -80,7 +80,7 @@
</li>
</ol></div>
<a name="range.reference.algorithms.range_algorithm_new_algorithms.push_back.complexity"></a><h6>
-<a name="id2950984"></a>
+<a name="id3106336"></a>
<a class="link" href="push_back.html#range.reference.algorithms.range_algorithm_new_algorithms.push_back.complexity">Complexity</a>
</h6>
<p>
Modified: trunk/libs/range/doc/html/range/reference/algorithms/range_algorithm_new_algorithms/push_front.html
==============================================================================
--- trunk/libs/range/doc/html/range/reference/algorithms/range_algorithm_new_algorithms/push_front.html (original)
+++ trunk/libs/range/doc/html/range/reference/algorithms/range_algorithm_new_algorithms/push_front.html 2010-04-11 18:05:02 EDT (Sun, 11 Apr 2010)
@@ -28,7 +28,7 @@
push_front</a>
</h5></div></div></div>
<a name="range.reference.algorithms.range_algorithm_new_algorithms.push_front.prototype"></a><h6>
-<a name="id2951058"></a>
+<a name="id3106409"></a>
<a class="link" href="push_front.html#range.reference.algorithms.range_algorithm_new_algorithms.push_front.prototype">Prototype</a>
</h6>
<p>
@@ -38,13 +38,13 @@
<span class="keyword">class</span> <span class="identifier">Container</span><span class="special">,</span>
<span class="keyword">class</span> <span class="identifier">SinglePassRange</span>
<span class="special">></span>
-<span class="keyword">void</span> <span class="identifier">push_front</span><span class="special">(</span><span class="identifier">Container</span><span class="special">&</span> <span class="identifier">target</span><span class="special">,</span>
- <span class="keyword">const</span> <span class="identifier">SinglePassRange</span><span class="special">&</span> <span class="identifier">from</span><span class="special">);</span>
+<span class="identifier">Container</span><span class="special">&</span> <span class="identifier">push_front</span><span class="special">(</span><span class="identifier">Container</span><span class="special">&</span> <span class="identifier">target</span><span class="special">,</span>
+ <span class="keyword">const</span> <span class="identifier">SinglePassRange</span><span class="special">&</span> <span class="identifier">from</span><span class="special">);</span>
</pre>
<p>
</p>
<a name="range.reference.algorithms.range_algorithm_new_algorithms.push_front.description"></a><h6>
-<a name="id2951196"></a>
+<a name="id3106552"></a>
<a class="link" href="push_front.html#range.reference.algorithms.range_algorithm_new_algorithms.push_front.description">Description</a>
</h6>
<p>
@@ -53,14 +53,14 @@
to the front of the container <code class="computeroutput"><span class="identifier">target</span></code>.
</p>
<a name="range.reference.algorithms.range_algorithm_new_algorithms.push_front.definition"></a><h6>
-<a name="id2951257"></a>
+<a name="id3106613"></a>
<a class="link" href="push_front.html#range.reference.algorithms.range_algorithm_new_algorithms.push_front.definition">Definition</a>
</h6>
<p>
Defined in the header file <code class="computeroutput"><span class="identifier">boost</span><span class="special">/</span><span class="identifier">range</span><span class="special">/</span><span class="identifier">algorithm_ext</span><span class="special">/</span><span class="identifier">push_front</span><span class="special">.</span><span class="identifier">hpp</span></code>
</p>
<a name="range.reference.algorithms.range_algorithm_new_algorithms.push_front.requirements"></a><h6>
-<a name="id2951332"></a>
+<a name="id3106688"></a>
<a class="link" href="push_front.html#range.reference.algorithms.range_algorithm_new_algorithms.push_front.requirements">Requirements</a>
</h6>
<div class="orderedlist"><ol class="orderedlist" type="1">
@@ -80,7 +80,7 @@
</li>
</ol></div>
<a name="range.reference.algorithms.range_algorithm_new_algorithms.push_front.complexity"></a><h6>
-<a name="id2951441"></a>
+<a name="id3106797"></a>
<a class="link" href="push_front.html#range.reference.algorithms.range_algorithm_new_algorithms.push_front.complexity">Complexity</a>
</h6>
<p>
Modified: trunk/libs/range/doc/html/range/reference/algorithms/range_algorithm_new_algorithms/remove_erase.html
==============================================================================
--- trunk/libs/range/doc/html/range/reference/algorithms/range_algorithm_new_algorithms/remove_erase.html (original)
+++ trunk/libs/range/doc/html/range/reference/algorithms/range_algorithm_new_algorithms/remove_erase.html 2010-04-11 18:05:02 EDT (Sun, 11 Apr 2010)
@@ -28,40 +28,37 @@
remove_erase</a>
</h5></div></div></div>
<a name="range.reference.algorithms.range_algorithm_new_algorithms.remove_erase.prototype"></a><h6>
-<a name="id2951515"></a>
+<a name="id3106872"></a>
<a class="link" href="remove_erase.html#range.reference.algorithms.range_algorithm_new_algorithms.remove_erase.prototype">Prototype</a>
</h6>
<p>
</p>
-<pre class="programlisting"><span class="keyword">template</span><span class="special"><</span>
- <span class="keyword">class</span> <span class="identifier">Container</span><span class="special">,</span>
- <span class="keyword">class</span> <span class="identifier">T</span>
- <span class="special">></span>
-<span class="keyword">void</span> <span class="identifier">remove_erase</span><span class="special">(</span><span class="identifier">Container</span><span class="special">&</span> <span class="identifier">target</span><span class="special">,</span>
- <span class="keyword">const</span> <span class="identifier">T</span><span class="special">&</span> <span class="identifier">val</span><span class="special">);</span>
+<pre class="programlisting"><span class="keyword">template</span><span class="special"><</span><span class="keyword">class</span> <span class="identifier">Container</span><span class="special">,</span> <span class="keyword">class</span> <span class="identifier">Value</span><span class="special">></span>
+<span class="identifier">Container</span><span class="special">&</span> <span class="identifier">remove_erase</span><span class="special">(</span><span class="identifier">Container</span><span class="special">&</span> <span class="identifier">target</span><span class="special">,</span>
+ <span class="keyword">const</span> <span class="identifier">Value</span><span class="special">&</span> <span class="identifier">value</span><span class="special">);</span>
</pre>
<p>
</p>
<a name="range.reference.algorithms.range_algorithm_new_algorithms.remove_erase.description"></a><h6>
-<a name="id2951651"></a>
+<a name="id3107012"></a>
<a class="link" href="remove_erase.html#range.reference.algorithms.range_algorithm_new_algorithms.remove_erase.description">Description</a>
</h6>
<p>
<code class="computeroutput"><span class="identifier">remove_erase</span></code> actually
- eliminates the elements equal to <code class="computeroutput"><span class="identifier">val</span></code>
+ eliminates the elements equal to <code class="computeroutput"><span class="identifier">value</span></code>
from the container. This is in contrast to the <code class="computeroutput"><span class="identifier">remove</span></code>
algorithm which merely rearranges elements.
</p>
<a name="range.reference.algorithms.range_algorithm_new_algorithms.remove_erase.definition"></a><h6>
-<a name="id2951714"></a>
+<a name="id3107074"></a>
<a class="link" href="remove_erase.html#range.reference.algorithms.range_algorithm_new_algorithms.remove_erase.definition">Definition</a>
</h6>
<p>
Defined in the header file <code class="computeroutput"><span class="identifier">boost</span><span class="special">/</span><span class="identifier">range</span><span class="special">/</span><span class="identifier">algorithm_ext</span><span class="special">/</span><span class="identifier">erase</span><span class="special">.</span><span class="identifier">hpp</span></code>
</p>
<a name="range.reference.algorithms.range_algorithm_new_algorithms.remove_erase.requirements"></a><h6>
-<a name="id2951789"></a>
+<a name="id3107149"></a>
<a class="link" href="remove_erase.html#range.reference.algorithms.range_algorithm_new_algorithms.remove_erase.requirements">Requirements</a>
</h6>
<div class="orderedlist"><ol class="orderedlist" type="1"><li class="listitem">
@@ -69,7 +66,7 @@
erase of an iterator range.
</li></ol></div>
<a name="range.reference.algorithms.range_algorithm_new_algorithms.remove_erase.complexity"></a><h6>
-<a name="id2951836"></a>
+<a name="id3107196"></a>
<a class="link" href="remove_erase.html#range.reference.algorithms.range_algorithm_new_algorithms.remove_erase.complexity">Complexity</a>
</h6>
<p>
Modified: trunk/libs/range/doc/html/range/reference/algorithms/range_algorithm_new_algorithms/remove_erase_if.html
==============================================================================
--- trunk/libs/range/doc/html/range/reference/algorithms/range_algorithm_new_algorithms/remove_erase_if.html (original)
+++ trunk/libs/range/doc/html/range/reference/algorithms/range_algorithm_new_algorithms/remove_erase_if.html 2010-04-11 18:05:02 EDT (Sun, 11 Apr 2010)
@@ -28,23 +28,20 @@
remove_erase_if</a>
</h5></div></div></div>
<a name="range.reference.algorithms.range_algorithm_new_algorithms.remove_erase_if.prototype"></a><h6>
-<a name="id2951909"></a>
+<a name="id3107269"></a>
<a class="link" href="remove_erase_if.html#range.reference.algorithms.range_algorithm_new_algorithms.remove_erase_if.prototype">Prototype</a>
</h6>
<p>
</p>
-<pre class="programlisting"><span class="keyword">template</span><span class="special"><</span>
- <span class="keyword">class</span> <span class="identifier">Container</span><span class="special">,</span>
- <span class="keyword">class</span> <span class="identifier">Pred</span>
- <span class="special">></span>
-<span class="keyword">void</span> <span class="identifier">remove_erase</span><span class="special">(</span><span class="identifier">Container</span><span class="special">&</span> <span class="identifier">target</span><span class="special">,</span>
- <span class="identifier">Pred</span> <span class="identifier">pred</span><span class="special">);</span>
+<pre class="programlisting"><span class="keyword">template</span><span class="special"><</span><span class="keyword">class</span> <span class="identifier">Container</span><span class="special">,</span> <span class="keyword">class</span> <span class="identifier">Pred</span><span class="special">></span>
+<span class="identifier">Container</span><span class="special">&</span> <span class="identifier">remove_erase_if</span><span class="special">(</span><span class="identifier">Container</span><span class="special">&</span> <span class="identifier">target</span><span class="special">,</span>
+ <span class="identifier">Pred</span> <span class="identifier">pred</span><span class="special">);</span>
</pre>
<p>
</p>
<a name="range.reference.algorithms.range_algorithm_new_algorithms.remove_erase_if.description"></a><h6>
-<a name="id2952038"></a>
+<a name="id3107400"></a>
<a class="link" href="remove_erase_if.html#range.reference.algorithms.range_algorithm_new_algorithms.remove_erase_if.description">Description</a>
</h6>
<p>
@@ -55,14 +52,14 @@
algorithm which merely rearranges elements.
</p>
<a name="range.reference.algorithms.range_algorithm_new_algorithms.remove_erase_if.definition"></a><h6>
-<a name="id2952124"></a>
+<a name="id3107486"></a>
<a class="link" href="remove_erase_if.html#range.reference.algorithms.range_algorithm_new_algorithms.remove_erase_if.definition">Definition</a>
</h6>
<p>
Defined in the header file <code class="computeroutput"><span class="identifier">boost</span><span class="special">/</span><span class="identifier">range</span><span class="special">/</span><span class="identifier">algorithm_ext</span><span class="special">/</span><span class="identifier">erase</span><span class="special">.</span><span class="identifier">hpp</span></code>
</p>
<a name="range.reference.algorithms.range_algorithm_new_algorithms.remove_erase_if.requirements"></a><h6>
-<a name="id2952198"></a>
+<a name="id3107560"></a>
<a class="link" href="remove_erase_if.html#range.reference.algorithms.range_algorithm_new_algorithms.remove_erase_if.requirements">Requirements</a>
</h6>
<div class="orderedlist"><ol class="orderedlist" type="1">
@@ -76,7 +73,7 @@
</li>
</ol></div>
<a name="range.reference.algorithms.range_algorithm_new_algorithms.remove_erase_if.complexity"></a><h6>
-<a name="id2952270"></a>
+<a name="id3107632"></a>
<a class="link" href="remove_erase_if.html#range.reference.algorithms.range_algorithm_new_algorithms.remove_erase_if.complexity">Complexity</a>
</h6>
<p>
Modified: trunk/libs/range/doc/html/range/reference/algorithms/range_algorithm_non_mutating_algorithms/adjacent_find.html
==============================================================================
--- trunk/libs/range/doc/html/range/reference/algorithms/range_algorithm_non_mutating_algorithms/adjacent_find.html (original)
+++ trunk/libs/range/doc/html/range/reference/algorithms/range_algorithm_non_mutating_algorithms/adjacent_find.html 2010-04-11 18:05:02 EDT (Sun, 11 Apr 2010)
@@ -28,7 +28,7 @@
Range Algorithm - adjacent_find</a>
</h5></div></div></div>
<a name="range.reference.algorithms.range_algorithm_non_mutating_algorithms.adjacent_find.prototype"></a><h6>
-<a name="id2916228"></a>
+<a name="id3070320"></a>
<a class="link" href="adjacent_find.html#range.reference.algorithms.range_algorithm_non_mutating_algorithms.adjacent_find.prototype">Prototype</a>
</h6>
<p>
@@ -77,7 +77,7 @@
<p>
</p>
<a name="range.reference.algorithms.range_algorithm_non_mutating_algorithms.adjacent_find.description"></a><h6>
-<a name="id2917218"></a>
+<a name="id3071309"></a>
<a class="link" href="adjacent_find.html#range.reference.algorithms.range_algorithm_non_mutating_algorithms.adjacent_find.description">Description</a>
</h6>
<p>
@@ -98,14 +98,14 @@
is <code class="computeroutput"><span class="keyword">true</span></code>.
</p>
<a name="range.reference.algorithms.range_algorithm_non_mutating_algorithms.adjacent_find.definition"></a><h6>
-<a name="id2917433"></a>
+<a name="id3071523"></a>
<a class="link" href="adjacent_find.html#range.reference.algorithms.range_algorithm_non_mutating_algorithms.adjacent_find.definition">Definition</a>
</h6>
<p>
Defined in the header file <code class="computeroutput"><span class="identifier">boost</span><span class="special">/</span><span class="identifier">range</span><span class="special">/</span><span class="identifier">algorithm</span><span class="special">/</span><span class="identifier">adjacent_find</span><span class="special">.</span><span class="identifier">hpp</span></code>
</p>
<a name="range.reference.algorithms.range_algorithm_non_mutating_algorithms.adjacent_find.requirements"></a><h6>
-<a name="id2917507"></a>
+<a name="id3071597"></a>
<a class="link" href="adjacent_find.html#range.reference.algorithms.range_algorithm_non_mutating_algorithms.adjacent_find.requirements">Requirements</a>
</h6>
<p>
@@ -143,7 +143,7 @@
</li>
</ul></div>
<a name="range.reference.algorithms.range_algorithm_non_mutating_algorithms.adjacent_find.complexity"></a><h6>
-<a name="id2917692"></a>
+<a name="id3071783"></a>
<a class="link" href="adjacent_find.html#range.reference.algorithms.range_algorithm_non_mutating_algorithms.adjacent_find.complexity">Complexity</a>
</h6>
<p>
Modified: trunk/libs/range/doc/html/range/reference/algorithms/range_algorithm_non_mutating_algorithms/binary_search.html
==============================================================================
--- trunk/libs/range/doc/html/range/reference/algorithms/range_algorithm_non_mutating_algorithms/binary_search.html (original)
+++ trunk/libs/range/doc/html/range/reference/algorithms/range_algorithm_non_mutating_algorithms/binary_search.html 2010-04-11 18:05:02 EDT (Sun, 11 Apr 2010)
@@ -28,7 +28,7 @@
binary_search</a>
</h5></div></div></div>
<a name="range.reference.algorithms.range_algorithm_non_mutating_algorithms.binary_search.prototype"></a><h6>
-<a name="id2917800"></a>
+<a name="id3071892"></a>
<a class="link" href="binary_search.html#range.reference.algorithms.range_algorithm_non_mutating_algorithms.binary_search.prototype">Prototype</a>
</h6>
<p>
@@ -43,7 +43,7 @@
<p>
</p>
<a name="range.reference.algorithms.range_algorithm_non_mutating_algorithms.binary_search.description"></a><h6>
-<a name="id2918083"></a>
+<a name="id3072176"></a>
<a class="link" href="binary_search.html#range.reference.algorithms.range_algorithm_non_mutating_algorithms.binary_search.description">Description</a>
</h6>
<p>
@@ -53,14 +53,14 @@
range <code class="computeroutput"><span class="identifier">rng</span></code>.
</p>
<a name="range.reference.algorithms.range_algorithm_non_mutating_algorithms.binary_search.definition"></a><h6>
-<a name="id2918156"></a>
+<a name="id3072248"></a>
<a class="link" href="binary_search.html#range.reference.algorithms.range_algorithm_non_mutating_algorithms.binary_search.definition">Definition</a>
</h6>
<p>
Defined in the header file <code class="computeroutput"><span class="identifier">boost</span><span class="special">/</span><span class="identifier">range</span><span class="special">/</span><span class="identifier">algorithm</span><span class="special">/</span><span class="identifier">binary_search</span><span class="special">.</span><span class="identifier">hpp</span></code>
</p>
<a name="range.reference.algorithms.range_algorithm_non_mutating_algorithms.binary_search.requirements"></a><h6>
-<a name="id2918232"></a>
+<a name="id3072323"></a>
<a class="link" href="binary_search.html#range.reference.algorithms.range_algorithm_non_mutating_algorithms.binary_search.requirements">Requirements</a>
</h6>
<p>
@@ -111,7 +111,7 @@
</li>
</ul></div>
<a name="range.reference.algorithms.range_algorithm_non_mutating_algorithms.binary_search.precondition_"></a><h6>
-<a name="id2918491"></a>
+<a name="id3072583"></a>
<a class="link" href="binary_search.html#range.reference.algorithms.range_algorithm_non_mutating_algorithms.binary_search.precondition_">Precondition:</a>
</h6>
<p>
@@ -129,7 +129,7 @@
order according to the function object <code class="computeroutput"><span class="identifier">pred</span></code>.
</p>
<a name="range.reference.algorithms.range_algorithm_non_mutating_algorithms.binary_search.complexity"></a><h6>
-<a name="id2918590"></a>
+<a name="id3072682"></a>
<a class="link" href="binary_search.html#range.reference.algorithms.range_algorithm_non_mutating_algorithms.binary_search.complexity">Complexity</a>
</h6>
<p>
Modified: trunk/libs/range/doc/html/range/reference/algorithms/range_algorithm_non_mutating_algorithms/count.html
==============================================================================
--- trunk/libs/range/doc/html/range/reference/algorithms/range_algorithm_non_mutating_algorithms/count.html (original)
+++ trunk/libs/range/doc/html/range/reference/algorithms/range_algorithm_non_mutating_algorithms/count.html 2010-04-11 18:05:02 EDT (Sun, 11 Apr 2010)
@@ -28,7 +28,7 @@
count</a>
</h5></div></div></div>
<a name="range.reference.algorithms.range_algorithm_non_mutating_algorithms.count.prototype"></a><h6>
-<a name="id2918766"></a>
+<a name="id3072858"></a>
<a class="link" href="count.html#range.reference.algorithms.range_algorithm_non_mutating_algorithms.count.prototype">Prototype</a>
</h6>
<p>
@@ -45,7 +45,7 @@
<p>
</p>
<a name="range.reference.algorithms.range_algorithm_non_mutating_algorithms.count.description"></a><h6>
-<a name="id2919065"></a>
+<a name="id3073157"></a>
<a class="link" href="count.html#range.reference.algorithms.range_algorithm_non_mutating_algorithms.count.description">Description</a>
</h6>
<p>
@@ -55,14 +55,14 @@
is <code class="computeroutput"><span class="keyword">true</span></code>.
</p>
<a name="range.reference.algorithms.range_algorithm_non_mutating_algorithms.count.definition"></a><h6>
-<a name="id2919157"></a>
+<a name="id3073249"></a>
<a class="link" href="count.html#range.reference.algorithms.range_algorithm_non_mutating_algorithms.count.definition">Definition</a>
</h6>
<p>
Defined in the header file <code class="computeroutput"><span class="identifier">boost</span><span class="special">/</span><span class="identifier">range</span><span class="special">/</span><span class="identifier">algorithm</span><span class="special">/</span><span class="identifier">count</span><span class="special">.</span><span class="identifier">hpp</span></code>
</p>
<a name="range.reference.algorithms.range_algorithm_non_mutating_algorithms.count.requirements"></a><h6>
-<a name="id2919232"></a>
+<a name="id3073324"></a>
<a class="link" href="count.html#range.reference.algorithms.range_algorithm_non_mutating_algorithms.count.requirements">Requirements</a>
</h6>
<div class="itemizedlist"><ul class="itemizedlist" type="disc">
@@ -85,7 +85,7 @@
</li>
</ul></div>
<a name="range.reference.algorithms.range_algorithm_non_mutating_algorithms.count.complexity"></a><h6>
-<a name="id2919361"></a>
+<a name="id3073452"></a>
<a class="link" href="count.html#range.reference.algorithms.range_algorithm_non_mutating_algorithms.count.complexity">Complexity</a>
</h6>
<p>
Modified: trunk/libs/range/doc/html/range/reference/algorithms/range_algorithm_non_mutating_algorithms/equal.html
==============================================================================
--- trunk/libs/range/doc/html/range/reference/algorithms/range_algorithm_non_mutating_algorithms/equal.html (original)
+++ trunk/libs/range/doc/html/range/reference/algorithms/range_algorithm_non_mutating_algorithms/equal.html 2010-04-11 18:05:02 EDT (Sun, 11 Apr 2010)
@@ -28,7 +28,7 @@
equal</a>
</h5></div></div></div>
<a name="range.reference.algorithms.range_algorithm_non_mutating_algorithms.equal.prototype"></a><h6>
-<a name="id2919432"></a>
+<a name="id3073524"></a>
<a class="link" href="equal.html#range.reference.algorithms.range_algorithm_non_mutating_algorithms.equal.prototype">Prototype</a>
</h6>
<p>
@@ -53,7 +53,7 @@
<p>
</p>
<a name="range.reference.algorithms.range_algorithm_non_mutating_algorithms.equal.description"></a><h6>
-<a name="id2919721"></a>
+<a name="id3073812"></a>
<a class="link" href="equal.html#range.reference.algorithms.range_algorithm_non_mutating_algorithms.equal.description">Description</a>
</h6>
<p>
@@ -71,14 +71,14 @@
considered equal in the predicate version if <code class="computeroutput"><span class="identifier">pred</span><span class="special">(</span><span class="identifier">x</span><span class="special">,</span><span class="identifier">y</span><span class="special">)</span></code> is <code class="computeroutput"><span class="keyword">true</span></code>.
</p>
<a name="range.reference.algorithms.range_algorithm_non_mutating_algorithms.equal.definition"></a><h6>
-<a name="id2919965"></a>
+<a name="id3074057"></a>
<a class="link" href="equal.html#range.reference.algorithms.range_algorithm_non_mutating_algorithms.equal.definition">Definition</a>
</h6>
<p>
Defined in the header file <code class="computeroutput"><span class="identifier">boost</span><span class="special">/</span><span class="identifier">range</span><span class="special">/</span><span class="identifier">algorithm</span><span class="special">/</span><span class="identifier">equal</span><span class="special">.</span><span class="identifier">hpp</span></code>
</p>
<a name="range.reference.algorithms.range_algorithm_non_mutating_algorithms.equal.requirements"></a><h6>
-<a name="id2920041"></a>
+<a name="id3074132"></a>
<a class="link" href="equal.html#range.reference.algorithms.range_algorithm_non_mutating_algorithms.equal.requirements">Requirements</a>
</h6>
<p>
@@ -139,7 +139,7 @@
</li>
</ul></div>
<a name="range.reference.algorithms.range_algorithm_non_mutating_algorithms.equal.complexity"></a><h6>
-<a name="id2920338"></a>
+<a name="id3074430"></a>
<a class="link" href="equal.html#range.reference.algorithms.range_algorithm_non_mutating_algorithms.equal.complexity">Complexity</a>
</h6>
<p>
Modified: trunk/libs/range/doc/html/range/reference/algorithms/range_algorithm_non_mutating_algorithms/equal_range.html
==============================================================================
--- trunk/libs/range/doc/html/range/reference/algorithms/range_algorithm_non_mutating_algorithms/equal_range.html (original)
+++ trunk/libs/range/doc/html/range/reference/algorithms/range_algorithm_non_mutating_algorithms/equal_range.html 2010-04-11 18:05:02 EDT (Sun, 11 Apr 2010)
@@ -28,7 +28,7 @@
equal_range</a>
</h5></div></div></div>
<a name="range.reference.algorithms.range_algorithm_non_mutating_algorithms.equal_range.prototype"></a><h6>
-<a name="id2920439"></a>
+<a name="id3074530"></a>
<a class="link" href="equal_range.html#range.reference.algorithms.range_algorithm_non_mutating_algorithms.equal_range.prototype">Prototype</a>
</h6>
<p>
@@ -71,7 +71,7 @@
<p>
</p>
<a name="range.reference.algorithms.range_algorithm_non_mutating_algorithms.equal_range.description"></a><h6>
-<a name="id2921320"></a>
+<a name="id3075412"></a>
<a class="link" href="equal_range.html#range.reference.algorithms.range_algorithm_non_mutating_algorithms.equal_range.description">Description</a>
</h6>
<p>
@@ -85,14 +85,14 @@
is determined by <code class="computeroutput"><span class="identifier">pred</span></code>.
</p>
<a name="range.reference.algorithms.range_algorithm_non_mutating_algorithms.equal_range.definition"></a><h6>
-<a name="id2921474"></a>
+<a name="id3075566"></a>
<a class="link" href="equal_range.html#range.reference.algorithms.range_algorithm_non_mutating_algorithms.equal_range.definition">Definition</a>
</h6>
<p>
Defined in the header file <code class="computeroutput"><span class="identifier">boost</span><span class="special">/</span><span class="identifier">range</span><span class="special">/</span><span class="identifier">algorithm</span><span class="special">/</span><span class="identifier">equal_range</span><span class="special">.</span><span class="identifier">hpp</span></code>
</p>
<a name="range.reference.algorithms.range_algorithm_non_mutating_algorithms.equal_range.requirements"></a><h6>
-<a name="id2921549"></a>
+<a name="id3075640"></a>
<a class="link" href="equal_range.html#range.reference.algorithms.range_algorithm_non_mutating_algorithms.equal_range.requirements">Requirements</a>
</h6>
<p>
@@ -143,7 +143,7 @@
</li>
</ul></div>
<a name="range.reference.algorithms.range_algorithm_non_mutating_algorithms.equal_range.precondition_"></a><h6>
-<a name="id2921808"></a>
+<a name="id3075899"></a>
<a class="link" href="equal_range.html#range.reference.algorithms.range_algorithm_non_mutating_algorithms.equal_range.precondition_">Precondition:</a>
</h6>
<p>
@@ -155,7 +155,7 @@
is ordered in ascending order according to <code class="computeroutput"><span class="identifier">pred</span></code>.
</p>
<a name="range.reference.algorithms.range_algorithm_non_mutating_algorithms.equal_range.complexity"></a><h6>
-<a name="id2921890"></a>
+<a name="id3075982"></a>
<a class="link" href="equal_range.html#range.reference.algorithms.range_algorithm_non_mutating_algorithms.equal_range.complexity">Complexity</a>
</h6>
<p>
Modified: trunk/libs/range/doc/html/range/reference/algorithms/range_algorithm_non_mutating_algorithms/find.html
==============================================================================
--- trunk/libs/range/doc/html/range/reference/algorithms/range_algorithm_non_mutating_algorithms/find.html (original)
+++ trunk/libs/range/doc/html/range/reference/algorithms/range_algorithm_non_mutating_algorithms/find.html 2010-04-11 18:05:02 EDT (Sun, 11 Apr 2010)
@@ -28,7 +28,7 @@
find</a>
</h5></div></div></div>
<a name="range.reference.algorithms.range_algorithm_non_mutating_algorithms.find.prototype"></a><h6>
-<a name="id2922582"></a>
+<a name="id3076673"></a>
<a class="link" href="find.html#range.reference.algorithms.range_algorithm_non_mutating_algorithms.find.prototype">Prototype</a>
</h6>
<p>
@@ -49,7 +49,7 @@
<p>
</p>
<a name="range.reference.algorithms.range_algorithm_non_mutating_algorithms.find.description"></a><h6>
-<a name="id2922876"></a>
+<a name="id3076968"></a>
<a class="link" href="find.html#range.reference.algorithms.range_algorithm_non_mutating_algorithms.find.description">Description</a>
</h6>
<p>
@@ -60,14 +60,14 @@
same manner as the returned iterator described above.
</p>
<a name="range.reference.algorithms.range_algorithm_non_mutating_algorithms.find.definition"></a><h6>
-<a name="id2923002"></a>
+<a name="id3077093"></a>
<a class="link" href="find.html#range.reference.algorithms.range_algorithm_non_mutating_algorithms.find.definition">Definition</a>
</h6>
<p>
Defined in the header file <code class="computeroutput"><span class="identifier">boost</span><span class="special">/</span><span class="identifier">range</span><span class="special">/</span><span class="identifier">algorithm</span><span class="special">/</span><span class="identifier">find</span><span class="special">.</span><span class="identifier">hpp</span></code>
</p>
<a name="range.reference.algorithms.range_algorithm_non_mutating_algorithms.find.requirements"></a><h6>
-<a name="id2923077"></a>
+<a name="id3077169"></a>
<a class="link" href="find.html#range.reference.algorithms.range_algorithm_non_mutating_algorithms.find.requirements">Requirements</a>
</h6>
<div class="itemizedlist"><ul class="itemizedlist" type="disc">
@@ -88,7 +88,7 @@
</li>
</ul></div>
<a name="range.reference.algorithms.range_algorithm_non_mutating_algorithms.find.complexity"></a><h6>
-<a name="id2923195"></a>
+<a name="id3077286"></a>
<a class="link" href="find.html#range.reference.algorithms.range_algorithm_non_mutating_algorithms.find.complexity">Complexity</a>
</h6>
<p>
Modified: trunk/libs/range/doc/html/range/reference/algorithms/range_algorithm_non_mutating_algorithms/find_end.html
==============================================================================
--- trunk/libs/range/doc/html/range/reference/algorithms/range_algorithm_non_mutating_algorithms/find_end.html (original)
+++ trunk/libs/range/doc/html/range/reference/algorithms/range_algorithm_non_mutating_algorithms/find_end.html 2010-04-11 18:05:02 EDT (Sun, 11 Apr 2010)
@@ -28,7 +28,7 @@
find_end</a>
</h5></div></div></div>
<a name="range.reference.algorithms.range_algorithm_non_mutating_algorithms.find_end.prototype"></a><h6>
-<a name="id2923267"></a>
+<a name="id3077359"></a>
<a class="link" href="find_end.html#range.reference.algorithms.range_algorithm_non_mutating_algorithms.find_end.prototype">Prototype</a>
</h6>
<p>
@@ -66,7 +66,7 @@
<p>
</p>
<a name="range.reference.algorithms.range_algorithm_non_mutating_algorithms.find_end.description"></a><h6>
-<a name="id2923936"></a>
+<a name="id3078027"></a>
<a class="link" href="find_end.html#range.reference.algorithms.range_algorithm_non_mutating_algorithms.find_end.description">Description</a>
</h6>
<p>
@@ -81,14 +81,14 @@
same manner as the returned iterator described above.
</p>
<a name="range.reference.algorithms.range_algorithm_non_mutating_algorithms.find_end.definition"></a><h6>
-<a name="id2924071"></a>
+<a name="id3078162"></a>
<a class="link" href="find_end.html#range.reference.algorithms.range_algorithm_non_mutating_algorithms.find_end.definition">Definition</a>
</h6>
<p>
Defined in the header file <code class="computeroutput"><span class="identifier">boost</span><span class="special">/</span><span class="identifier">range</span><span class="special">/</span><span class="identifier">algorithm</span><span class="special">/</span><span class="identifier">find_end</span><span class="special">.</span><span class="identifier">hpp</span></code>
</p>
<a name="range.reference.algorithms.range_algorithm_non_mutating_algorithms.find_end.requirements"></a><h6>
-<a name="id2924145"></a>
+<a name="id3078236"></a>
<a class="link" href="find_end.html#range.reference.algorithms.range_algorithm_non_mutating_algorithms.find_end.requirements">Requirements</a>
</h6>
<p>
@@ -148,7 +148,7 @@
</li>
</ul></div>
<a name="range.reference.algorithms.range_algorithm_non_mutating_algorithms.find_end.complexity"></a><h6>
-<a name="id2924444"></a>
+<a name="id3078536"></a>
<a class="link" href="find_end.html#range.reference.algorithms.range_algorithm_non_mutating_algorithms.find_end.complexity">Complexity</a>
</h6>
<p>
Modified: trunk/libs/range/doc/html/range/reference/algorithms/range_algorithm_non_mutating_algorithms/find_first_of.html
==============================================================================
--- trunk/libs/range/doc/html/range/reference/algorithms/range_algorithm_non_mutating_algorithms/find_first_of.html (original)
+++ trunk/libs/range/doc/html/range/reference/algorithms/range_algorithm_non_mutating_algorithms/find_first_of.html 2010-04-11 18:05:02 EDT (Sun, 11 Apr 2010)
@@ -28,7 +28,7 @@
find_first_of</a>
</h5></div></div></div>
<a name="range.reference.algorithms.range_algorithm_non_mutating_algorithms.find_first_of.prototype"></a><h6>
-<a name="id2924626"></a>
+<a name="id3078718"></a>
<a class="link" href="find_first_of.html#range.reference.algorithms.range_algorithm_non_mutating_algorithms.find_first_of.prototype">Prototype</a>
</h6>
<p>
@@ -66,7 +66,7 @@
<p>
</p>
<a name="range.reference.algorithms.range_algorithm_non_mutating_algorithms.find_first_of.description"></a><h6>
-<a name="id2925295"></a>
+<a name="id3079387"></a>
<a class="link" href="find_first_of.html#range.reference.algorithms.range_algorithm_non_mutating_algorithms.find_first_of.description">Description</a>
</h6>
<p>
@@ -86,14 +86,14 @@
same manner as the returned iterator described above.
</p>
<a name="range.reference.algorithms.range_algorithm_non_mutating_algorithms.find_first_of.definition"></a><h6>
-<a name="id2925436"></a>
+<a name="id3079527"></a>
<a class="link" href="find_first_of.html#range.reference.algorithms.range_algorithm_non_mutating_algorithms.find_first_of.definition">Definition</a>
</h6>
<p>
Defined in the header file <code class="computeroutput"><span class="identifier">boost</span><span class="special">/</span><span class="identifier">range</span><span class="special">/</span><span class="identifier">algorithm</span><span class="special">/</span><span class="identifier">find_first_of</span><span class="special">.</span><span class="identifier">hpp</span></code>
</p>
<a name="range.reference.algorithms.range_algorithm_non_mutating_algorithms.find_first_of.requirements"></a><h6>
-<a name="id2925511"></a>
+<a name="id3079602"></a>
<a class="link" href="find_first_of.html#range.reference.algorithms.range_algorithm_non_mutating_algorithms.find_first_of.requirements">Requirements</a>
</h6>
<p>
@@ -147,7 +147,7 @@
</li>
</ul></div>
<a name="range.reference.algorithms.range_algorithm_non_mutating_algorithms.find_first_of.complexity"></a><h6>
-<a name="id2925768"></a>
+<a name="id3079860"></a>
<a class="link" href="find_first_of.html#range.reference.algorithms.range_algorithm_non_mutating_algorithms.find_first_of.complexity">Complexity</a>
</h6>
<p>
Modified: trunk/libs/range/doc/html/range/reference/algorithms/range_algorithm_non_mutating_algorithms/find_if.html
==============================================================================
--- trunk/libs/range/doc/html/range/reference/algorithms/range_algorithm_non_mutating_algorithms/find_if.html (original)
+++ trunk/libs/range/doc/html/range/reference/algorithms/range_algorithm_non_mutating_algorithms/find_if.html 2010-04-11 18:05:02 EDT (Sun, 11 Apr 2010)
@@ -28,7 +28,7 @@
find_if</a>
</h5></div></div></div>
<a name="range.reference.algorithms.range_algorithm_non_mutating_algorithms.find_if.prototype"></a><h6>
-<a name="id2925866"></a>
+<a name="id3079958"></a>
<a class="link" href="find_if.html#range.reference.algorithms.range_algorithm_non_mutating_algorithms.find_if.prototype">Prototype</a>
</h6>
<p>
@@ -49,7 +49,7 @@
<p>
</p>
<a name="range.reference.algorithms.range_algorithm_non_mutating_algorithms.find_if.description"></a><h6>
-<a name="id2926162"></a>
+<a name="id3080253"></a>
<a class="link" href="find_if.html#range.reference.algorithms.range_algorithm_non_mutating_algorithms.find_if.description">Description</a>
</h6>
<p>
@@ -64,14 +64,14 @@
defines found in the same manner as the returned iterator described above.
</p>
<a name="range.reference.algorithms.range_algorithm_non_mutating_algorithms.find_if.definition"></a><h6>
-<a name="id2926298"></a>
+<a name="id3080390"></a>
<a class="link" href="find_if.html#range.reference.algorithms.range_algorithm_non_mutating_algorithms.find_if.definition">Definition</a>
</h6>
<p>
Defined in the header file <code class="computeroutput"><span class="identifier">boost</span><span class="special">/</span><span class="identifier">range</span><span class="special">/</span><span class="identifier">algorithm</span><span class="special">/</span><span class="identifier">find_if</span><span class="special">.</span><span class="identifier">hpp</span></code>
</p>
<a name="range.reference.algorithms.range_algorithm_non_mutating_algorithms.find_if.requirements"></a><h6>
-<a name="id2926373"></a>
+<a name="id3080464"></a>
<a class="link" href="find_if.html#range.reference.algorithms.range_algorithm_non_mutating_algorithms.find_if.requirements">Requirements</a>
</h6>
<div class="itemizedlist"><ul class="itemizedlist" type="disc">
@@ -90,7 +90,7 @@
</li>
</ul></div>
<a name="range.reference.algorithms.range_algorithm_non_mutating_algorithms.find_if.precondition_"></a><h6>
-<a name="id2926476"></a>
+<a name="id3080567"></a>
<a class="link" href="find_if.html#range.reference.algorithms.range_algorithm_non_mutating_algorithms.find_if.precondition_">Precondition:</a>
</h6>
<p>
@@ -98,7 +98,7 @@
<code class="computeroutput"><span class="identifier">rng</span></code>, <code class="computeroutput"><span class="special">*</span><span class="identifier">i</span></code> is in the domain of <code class="computeroutput"><span class="identifier">UnaryPredicate</span></code>.
</p>
<a name="range.reference.algorithms.range_algorithm_non_mutating_algorithms.find_if.complexity"></a><h6>
-<a name="id2926551"></a>
+<a name="id3080643"></a>
<a class="link" href="find_if.html#range.reference.algorithms.range_algorithm_non_mutating_algorithms.find_if.complexity">Complexity</a>
</h6>
<p>
Modified: trunk/libs/range/doc/html/range/reference/algorithms/range_algorithm_non_mutating_algorithms/for_each.html
==============================================================================
--- trunk/libs/range/doc/html/range/reference/algorithms/range_algorithm_non_mutating_algorithms/for_each.html (original)
+++ trunk/libs/range/doc/html/range/reference/algorithms/range_algorithm_non_mutating_algorithms/for_each.html 2010-04-11 18:05:02 EDT (Sun, 11 Apr 2010)
@@ -28,7 +28,7 @@
for_each</a>
</h5></div></div></div>
<a name="range.reference.algorithms.range_algorithm_non_mutating_algorithms.for_each.prototype"></a><h6>
-<a name="id2921993"></a>
+<a name="id3076084"></a>
<a class="link" href="for_each.html#range.reference.algorithms.range_algorithm_non_mutating_algorithms.for_each.prototype">Prototype</a>
</h6>
<p>
@@ -49,7 +49,7 @@
<p>
</p>
<a name="range.reference.algorithms.range_algorithm_non_mutating_algorithms.for_each.description"></a><h6>
-<a name="id2922221"></a>
+<a name="id3076313"></a>
<a class="link" href="for_each.html#range.reference.algorithms.range_algorithm_non_mutating_algorithms.for_each.description">Description</a>
</h6>
<p>
@@ -59,14 +59,14 @@
<code class="computeroutput"><span class="identifier">fun</span><span class="special">(</span><span class="identifier">x</span><span class="special">)</span></code>.
</p>
<a name="range.reference.algorithms.range_algorithm_non_mutating_algorithms.for_each.definition"></a><h6>
-<a name="id2922306"></a>
+<a name="id3076397"></a>
<a class="link" href="for_each.html#range.reference.algorithms.range_algorithm_non_mutating_algorithms.for_each.definition">Definition</a>
</h6>
<p>
Defined in the header file <code class="computeroutput"><span class="identifier">boost</span><span class="special">/</span><span class="identifier">range</span><span class="special">/</span><span class="identifier">algorithm</span><span class="special">/</span><span class="identifier">for_each</span><span class="special">.</span><span class="identifier">hpp</span></code>
</p>
<a name="range.reference.algorithms.range_algorithm_non_mutating_algorithms.for_each.requirements"></a><h6>
-<a name="id2922380"></a>
+<a name="id3076472"></a>
<a class="link" href="for_each.html#range.reference.algorithms.range_algorithm_non_mutating_algorithms.for_each.requirements">Requirements</a>
</h6>
<div class="itemizedlist"><ul class="itemizedlist" type="disc">
@@ -90,7 +90,7 @@
</li>
</ul></div>
<a name="range.reference.algorithms.range_algorithm_non_mutating_algorithms.for_each.complexity"></a><h6>
-<a name="id2922499"></a>
+<a name="id3076590"></a>
<a class="link" href="for_each.html#range.reference.algorithms.range_algorithm_non_mutating_algorithms.for_each.complexity">Complexity</a>
</h6>
<p>
Modified: trunk/libs/range/doc/html/range/reference/algorithms/range_algorithm_non_mutating_algorithms/lexicographical_compare.html
==============================================================================
--- trunk/libs/range/doc/html/range/reference/algorithms/range_algorithm_non_mutating_algorithms/lexicographical_compare.html (original)
+++ trunk/libs/range/doc/html/range/reference/algorithms/range_algorithm_non_mutating_algorithms/lexicographical_compare.html 2010-04-11 18:05:02 EDT (Sun, 11 Apr 2010)
@@ -28,7 +28,7 @@
lexicographical_compare</a>
</h5></div></div></div>
<a name="range.reference.algorithms.range_algorithm_non_mutating_algorithms.lexicographical_compare.prototype"></a><h6>
-<a name="id2926636"></a>
+<a name="id3080727"></a>
<a class="link" href="lexicographical_compare.html#range.reference.algorithms.range_algorithm_non_mutating_algorithms.lexicographical_compare.prototype">Prototype</a>
</h6>
<p>
@@ -53,7 +53,7 @@
<p>
</p>
<a name="range.reference.algorithms.range_algorithm_non_mutating_algorithms.lexicographical_compare.description"></a><h6>
-<a name="id2926926"></a>
+<a name="id3081018"></a>
<a class="link" href="lexicographical_compare.html#range.reference.algorithms.range_algorithm_non_mutating_algorithms.lexicographical_compare.description">Description</a>
</h6>
<p>
@@ -73,14 +73,14 @@
predicate versions.
</p>
<a name="range.reference.algorithms.range_algorithm_non_mutating_algorithms.lexicographical_compare.definition"></a><h6>
-<a name="id2927108"></a>
+<a name="id3081200"></a>
<a class="link" href="lexicographical_compare.html#range.reference.algorithms.range_algorithm_non_mutating_algorithms.lexicographical_compare.definition">Definition</a>
</h6>
<p>
Defined in the header file <code class="computeroutput"><span class="identifier">boost</span><span class="special">/</span><span class="identifier">range</span><span class="special">/</span><span class="identifier">algorithm</span><span class="special">/</span><span class="identifier">lexicographical_compare</span><span class="special">.</span><span class="identifier">hpp</span></code>
</p>
<a name="range.reference.algorithms.range_algorithm_non_mutating_algorithms.lexicographical_compare.requirements"></a><h6>
-<a name="id2927185"></a>
+<a name="id3081276"></a>
<a class="link" href="lexicographical_compare.html#range.reference.algorithms.range_algorithm_non_mutating_algorithms.lexicographical_compare.requirements">Requirements</a>
</h6>
<p>
@@ -145,7 +145,7 @@
</li>
</ul></div>
<a name="range.reference.algorithms.range_algorithm_non_mutating_algorithms.lexicographical_compare.complexity"></a><h6>
-<a name="id2927550"></a>
+<a name="id3081642"></a>
<a class="link" href="lexicographical_compare.html#range.reference.algorithms.range_algorithm_non_mutating_algorithms.lexicographical_compare.complexity">Complexity</a>
</h6>
<p>
Modified: trunk/libs/range/doc/html/range/reference/algorithms/range_algorithm_non_mutating_algorithms/lower_bound.html
==============================================================================
--- trunk/libs/range/doc/html/range/reference/algorithms/range_algorithm_non_mutating_algorithms/lower_bound.html (original)
+++ trunk/libs/range/doc/html/range/reference/algorithms/range_algorithm_non_mutating_algorithms/lower_bound.html 2010-04-11 18:05:02 EDT (Sun, 11 Apr 2010)
@@ -28,7 +28,7 @@
lower_bound</a>
</h5></div></div></div>
<a name="range.reference.algorithms.range_algorithm_non_mutating_algorithms.lower_bound.prototype"></a><h6>
-<a name="id2927663"></a>
+<a name="id3081755"></a>
<a class="link" href="lower_bound.html#range.reference.algorithms.range_algorithm_non_mutating_algorithms.lower_bound.prototype">Prototype</a>
</h6>
<p>
@@ -49,7 +49,7 @@
<p>
</p>
<a name="range.reference.algorithms.range_algorithm_non_mutating_algorithms.lower_bound.description"></a><h6>
-<a name="id2927959"></a>
+<a name="id3082050"></a>
<a class="link" href="lower_bound.html#range.reference.algorithms.range_algorithm_non_mutating_algorithms.lower_bound.description">Description</a>
</h6>
<p>
@@ -72,14 +72,14 @@
same manner as the returned iterator described above.
</p>
<a name="range.reference.algorithms.range_algorithm_non_mutating_algorithms.lower_bound.definition"></a><h6>
-<a name="id2928159"></a>
+<a name="id3082251"></a>
<a class="link" href="lower_bound.html#range.reference.algorithms.range_algorithm_non_mutating_algorithms.lower_bound.definition">Definition</a>
</h6>
<p>
Defined in the header file <code class="computeroutput"><span class="identifier">boost</span><span class="special">/</span><span class="identifier">range</span><span class="special">/</span><span class="identifier">algorithm</span><span class="special">/</span><span class="identifier">lower_bound</span><span class="special">.</span><span class="identifier">hpp</span></code>
</p>
<a name="range.reference.algorithms.range_algorithm_non_mutating_algorithms.lower_bound.requirements"></a><h6>
-<a name="id2928234"></a>
+<a name="id3082325"></a>
<a class="link" href="lower_bound.html#range.reference.algorithms.range_algorithm_non_mutating_algorithms.lower_bound.requirements">Requirements</a>
</h6>
<p>
@@ -130,7 +130,7 @@
</li>
</ul></div>
<a name="range.reference.algorithms.range_algorithm_non_mutating_algorithms.lower_bound.precondition_"></a><h6>
-<a name="id2928493"></a>
+<a name="id3082585"></a>
<a class="link" href="lower_bound.html#range.reference.algorithms.range_algorithm_non_mutating_algorithms.lower_bound.precondition_">Precondition:</a>
</h6>
<p>
@@ -148,7 +148,7 @@
order according to <code class="computeroutput"><span class="identifier">pred</span></code>.
</p>
<a name="range.reference.algorithms.range_algorithm_non_mutating_algorithms.lower_bound.complexity"></a><h6>
-<a name="id2928592"></a>
+<a name="id3082684"></a>
<a class="link" href="lower_bound.html#range.reference.algorithms.range_algorithm_non_mutating_algorithms.lower_bound.complexity">Complexity</a>
</h6>
<p>
Modified: trunk/libs/range/doc/html/range/reference/algorithms/range_algorithm_non_mutating_algorithms/max_element.html
==============================================================================
--- trunk/libs/range/doc/html/range/reference/algorithms/range_algorithm_non_mutating_algorithms/max_element.html (original)
+++ trunk/libs/range/doc/html/range/reference/algorithms/range_algorithm_non_mutating_algorithms/max_element.html 2010-04-11 18:05:02 EDT (Sun, 11 Apr 2010)
@@ -28,7 +28,7 @@
max_element</a>
</h5></div></div></div>
<a name="range.reference.algorithms.range_algorithm_non_mutating_algorithms.max_element.prototype"></a><h6>
-<a name="id2928743"></a>
+<a name="id3082835"></a>
<a class="link" href="max_element.html#range.reference.algorithms.range_algorithm_non_mutating_algorithms.max_element.prototype">Prototype</a>
</h6>
<p>
@@ -84,7 +84,7 @@
<p>
</p>
<a name="range.reference.algorithms.range_algorithm_non_mutating_algorithms.max_element.description"></a><h6>
-<a name="id2929739"></a>
+<a name="id3083831"></a>
<a class="link" href="max_element.html#range.reference.algorithms.range_algorithm_non_mutating_algorithms.max_element.description">Description</a>
</h6>
<p>
@@ -98,14 +98,14 @@
same manner as the returned iterator described above.
</p>
<a name="range.reference.algorithms.range_algorithm_non_mutating_algorithms.max_element.definition"></a><h6>
-<a name="id2929843"></a>
+<a name="id3083934"></a>
<a class="link" href="max_element.html#range.reference.algorithms.range_algorithm_non_mutating_algorithms.max_element.definition">Definition</a>
</h6>
<p>
Defined in the header file <code class="computeroutput"><span class="identifier">boost</span><span class="special">/</span><span class="identifier">range</span><span class="special">/</span><span class="identifier">algorithm</span><span class="special">/</span><span class="identifier">max_element</span><span class="special">.</span><span class="identifier">hpp</span></code>
</p>
<a name="range.reference.algorithms.range_algorithm_non_mutating_algorithms.max_element.requirements"></a><h6>
-<a name="id2929917"></a>
+<a name="id3084009"></a>
<a class="link" href="max_element.html#range.reference.algorithms.range_algorithm_non_mutating_algorithms.max_element.requirements">Requirements</a>
</h6>
<p>
@@ -142,7 +142,7 @@
</li>
</ul></div>
<a name="range.reference.algorithms.range_algorithm_non_mutating_algorithms.max_element.complexity"></a><h6>
-<a name="id2930090"></a>
+<a name="id3084182"></a>
<a class="link" href="max_element.html#range.reference.algorithms.range_algorithm_non_mutating_algorithms.max_element.complexity">Complexity</a>
</h6>
<p>
Modified: trunk/libs/range/doc/html/range/reference/algorithms/range_algorithm_non_mutating_algorithms/min_element.html
==============================================================================
--- trunk/libs/range/doc/html/range/reference/algorithms/range_algorithm_non_mutating_algorithms/min_element.html (original)
+++ trunk/libs/range/doc/html/range/reference/algorithms/range_algorithm_non_mutating_algorithms/min_element.html 2010-04-11 18:05:02 EDT (Sun, 11 Apr 2010)
@@ -28,7 +28,7 @@
min_element</a>
</h5></div></div></div>
<a name="range.reference.algorithms.range_algorithm_non_mutating_algorithms.min_element.prototype"></a><h6>
-<a name="id2930198"></a>
+<a name="id3084290"></a>
<a class="link" href="min_element.html#range.reference.algorithms.range_algorithm_non_mutating_algorithms.min_element.prototype">Prototype</a>
</h6>
<p>
@@ -84,7 +84,7 @@
<p>
</p>
<a name="range.reference.algorithms.range_algorithm_non_mutating_algorithms.min_element.description"></a><h6>
-<a name="id2931195"></a>
+<a name="id3085286"></a>
<a class="link" href="min_element.html#range.reference.algorithms.range_algorithm_non_mutating_algorithms.min_element.description">Description</a>
</h6>
<p>
@@ -98,14 +98,14 @@
same manner as the returned iterator described above.
</p>
<a name="range.reference.algorithms.range_algorithm_non_mutating_algorithms.min_element.definition"></a><h6>
-<a name="id2931298"></a>
+<a name="id3085390"></a>
<a class="link" href="min_element.html#range.reference.algorithms.range_algorithm_non_mutating_algorithms.min_element.definition">Definition</a>
</h6>
<p>
Defined in the header file <code class="computeroutput"><span class="identifier">boost</span><span class="special">/</span><span class="identifier">range</span><span class="special">/</span><span class="identifier">algorithm</span><span class="special">/</span><span class="identifier">min_element</span><span class="special">.</span><span class="identifier">hpp</span></code>
</p>
<a name="range.reference.algorithms.range_algorithm_non_mutating_algorithms.min_element.requirements"></a><h6>
-<a name="id2931373"></a>
+<a name="id3085465"></a>
<a class="link" href="min_element.html#range.reference.algorithms.range_algorithm_non_mutating_algorithms.min_element.requirements">Requirements</a>
</h6>
<p>
@@ -142,7 +142,7 @@
</li>
</ul></div>
<a name="range.reference.algorithms.range_algorithm_non_mutating_algorithms.min_element.complexity"></a><h6>
-<a name="id2931547"></a>
+<a name="id3085639"></a>
<a class="link" href="min_element.html#range.reference.algorithms.range_algorithm_non_mutating_algorithms.min_element.complexity">Complexity</a>
</h6>
<p>
Modified: trunk/libs/range/doc/html/range/reference/algorithms/range_algorithm_non_mutating_algorithms/mismatch.html
==============================================================================
--- trunk/libs/range/doc/html/range/reference/algorithms/range_algorithm_non_mutating_algorithms/mismatch.html (original)
+++ trunk/libs/range/doc/html/range/reference/algorithms/range_algorithm_non_mutating_algorithms/mismatch.html 2010-04-11 18:05:02 EDT (Sun, 11 Apr 2010)
@@ -28,7 +28,7 @@
mismatch</a>
</h5></div></div></div>
<a name="range.reference.algorithms.range_algorithm_non_mutating_algorithms.mismatch.prototype"></a><h6>
-<a name="id2931655"></a>
+<a name="id3085747"></a>
<a class="link" href="mismatch.html#range.reference.algorithms.range_algorithm_non_mutating_algorithms.mismatch.prototype">Prototype</a>
</h6>
<p>
@@ -106,7 +106,7 @@
<p>
</p>
<a name="range.reference.algorithms.range_algorithm_non_mutating_algorithms.mismatch.description"></a><h6>
-<a name="id2933375"></a>
+<a name="id3087466"></a>
<a class="link" href="mismatch.html#range.reference.algorithms.range_algorithm_non_mutating_algorithms.mismatch.description">Description</a>
</h6>
<p>
@@ -124,14 +124,14 @@
same manner as the returned iterator described above.
</p>
<a name="range.reference.algorithms.range_algorithm_non_mutating_algorithms.mismatch.definition"></a><h6>
-<a name="id2933517"></a>
+<a name="id3087609"></a>
<a class="link" href="mismatch.html#range.reference.algorithms.range_algorithm_non_mutating_algorithms.mismatch.definition">Definition</a>
</h6>
<p>
Defined in the header file <code class="computeroutput"><span class="identifier">boost</span><span class="special">/</span><span class="identifier">range</span><span class="special">/</span><span class="identifier">algorithm</span><span class="special">/</span><span class="identifier">mismatch</span><span class="special">.</span><span class="identifier">hpp</span></code>
</p>
<a name="range.reference.algorithms.range_algorithm_non_mutating_algorithms.mismatch.requirements"></a><h6>
-<a name="id2933591"></a>
+<a name="id3087682"></a>
<a class="link" href="mismatch.html#range.reference.algorithms.range_algorithm_non_mutating_algorithms.mismatch.requirements">Requirements</a>
</h6>
<p>
@@ -192,14 +192,14 @@
</li>
</ul></div>
<a name="range.reference.algorithms.range_algorithm_non_mutating_algorithms.mismatch.precondition_"></a><h6>
-<a name="id2933888"></a>
+<a name="id3087980"></a>
<a class="link" href="mismatch.html#range.reference.algorithms.range_algorithm_non_mutating_algorithms.mismatch.precondition_">Precondition:</a>
</h6>
<p>
<code class="computeroutput"><span class="identifier">distance</span><span class="special">(</span><span class="identifier">rng2</span><span class="special">)</span> <span class="special">>=</span> <span class="identifier">distance</span><span class="special">(</span><span class="identifier">rng1</span><span class="special">)</span></code>
</p>
<a name="range.reference.algorithms.range_algorithm_non_mutating_algorithms.mismatch.complexity"></a><h6>
-<a name="id2933965"></a>
+<a name="id3088056"></a>
<a class="link" href="mismatch.html#range.reference.algorithms.range_algorithm_non_mutating_algorithms.mismatch.complexity">Complexity</a>
</h6>
<p>
Modified: trunk/libs/range/doc/html/range/reference/algorithms/range_algorithm_non_mutating_algorithms/search.html
==============================================================================
--- trunk/libs/range/doc/html/range/reference/algorithms/range_algorithm_non_mutating_algorithms/search.html (original)
+++ trunk/libs/range/doc/html/range/reference/algorithms/range_algorithm_non_mutating_algorithms/search.html 2010-04-11 18:05:02 EDT (Sun, 11 Apr 2010)
@@ -28,7 +28,7 @@
search</a>
</h5></div></div></div>
<a name="range.reference.algorithms.range_algorithm_non_mutating_algorithms.search.prototype"></a><h6>
-<a name="id2934038"></a>
+<a name="id3088129"></a>
<a class="link" href="search.html#range.reference.algorithms.range_algorithm_non_mutating_algorithms.search.prototype">Prototype</a>
</h6>
<p>
@@ -96,7 +96,7 @@
<p>
</p>
<a name="range.reference.algorithms.range_algorithm_non_mutating_algorithms.search.description"></a><h6>
-<a name="id2935388"></a>
+<a name="id3089479"></a>
<a class="link" href="search.html#range.reference.algorithms.range_algorithm_non_mutating_algorithms.search.description">Description</a>
</h6>
<p>
@@ -115,14 +115,14 @@
same manner as the returned iterator described above.
</p>
<a name="range.reference.algorithms.range_algorithm_non_mutating_algorithms.search.definition"></a><h6>
-<a name="id2935564"></a>
+<a name="id3089656"></a>
<a class="link" href="search.html#range.reference.algorithms.range_algorithm_non_mutating_algorithms.search.definition">Definition</a>
</h6>
<p>
Defined in the header file <code class="computeroutput"><span class="identifier">boost</span><span class="special">/</span><span class="identifier">range</span><span class="special">/</span><span class="identifier">algorithm</span><span class="special">/</span><span class="identifier">search</span><span class="special">.</span><span class="identifier">hpp</span></code>
</p>
<a name="range.reference.algorithms.range_algorithm_non_mutating_algorithms.search.requirements"></a><h6>
-<a name="id2935639"></a>
+<a name="id3089731"></a>
<a class="link" href="search.html#range.reference.algorithms.range_algorithm_non_mutating_algorithms.search.requirements">Requirements</a>
</h6>
<p>
@@ -183,7 +183,7 @@
</li>
</ul></div>
<a name="range.reference.algorithms.range_algorithm_non_mutating_algorithms.search.complexity"></a><h6>
-<a name="id2935937"></a>
+<a name="id3090029"></a>
<a class="link" href="search.html#range.reference.algorithms.range_algorithm_non_mutating_algorithms.search.complexity">Complexity</a>
</h6>
<p>
Modified: trunk/libs/range/doc/html/range/reference/algorithms/range_algorithm_non_mutating_algorithms/upper_bound.html
==============================================================================
--- trunk/libs/range/doc/html/range/reference/algorithms/range_algorithm_non_mutating_algorithms/upper_bound.html (original)
+++ trunk/libs/range/doc/html/range/reference/algorithms/range_algorithm_non_mutating_algorithms/upper_bound.html 2010-04-11 18:05:02 EDT (Sun, 11 Apr 2010)
@@ -28,7 +28,7 @@
upper_bound</a>
</h5></div></div></div>
<a name="range.reference.algorithms.range_algorithm_non_mutating_algorithms.upper_bound.prototype"></a><h6>
-<a name="id2935987"></a>
+<a name="id3090079"></a>
<a class="link" href="upper_bound.html#range.reference.algorithms.range_algorithm_non_mutating_algorithms.upper_bound.prototype">Prototype</a>
</h6>
<p>
@@ -49,7 +49,7 @@
<p>
</p>
<a name="range.reference.algorithms.range_algorithm_non_mutating_algorithms.upper_bound.description"></a><h6>
-<a name="id2936282"></a>
+<a name="id3090374"></a>
<a class="link" href="upper_bound.html#range.reference.algorithms.range_algorithm_non_mutating_algorithms.upper_bound.description">Description</a>
</h6>
<p>
@@ -71,14 +71,14 @@
same manner as the returned iterator described above.
</p>
<a name="range.reference.algorithms.range_algorithm_non_mutating_algorithms.upper_bound.definition"></a><h6>
-<a name="id2936487"></a>
+<a name="id3090578"></a>
<a class="link" href="upper_bound.html#range.reference.algorithms.range_algorithm_non_mutating_algorithms.upper_bound.definition">Definition</a>
</h6>
<p>
Defined in the header file <code class="computeroutput"><span class="identifier">boost</span><span class="special">/</span><span class="identifier">range</span><span class="special">/</span><span class="identifier">algorithm</span><span class="special">/</span><span class="identifier">upper_bound</span><span class="special">.</span><span class="identifier">hpp</span></code>
</p>
<a name="range.reference.algorithms.range_algorithm_non_mutating_algorithms.upper_bound.requirements"></a><h6>
-<a name="id2936562"></a>
+<a name="id3090654"></a>
<a class="link" href="upper_bound.html#range.reference.algorithms.range_algorithm_non_mutating_algorithms.upper_bound.requirements">Requirements</a>
</h6>
<p>
@@ -129,7 +129,7 @@
</li>
</ul></div>
<a name="range.reference.algorithms.range_algorithm_non_mutating_algorithms.upper_bound.precondition_"></a><h6>
-<a name="id2936821"></a>
+<a name="id3090913"></a>
<a class="link" href="upper_bound.html#range.reference.algorithms.range_algorithm_non_mutating_algorithms.upper_bound.precondition_">Precondition:</a>
</h6>
<p>
@@ -147,7 +147,7 @@
order according to <code class="computeroutput"><span class="identifier">pred</span></code>.
</p>
<a name="range.reference.algorithms.range_algorithm_non_mutating_algorithms.upper_bound.complexity"></a><h6>
-<a name="id2936919"></a>
+<a name="id3091011"></a>
<a class="link" href="upper_bound.html#range.reference.algorithms.range_algorithm_non_mutating_algorithms.upper_bound.complexity">Complexity</a>
</h6>
<p>
Modified: trunk/libs/range/doc/html/range/reference/algorithms/range_numeric/accumulate.html
==============================================================================
--- trunk/libs/range/doc/html/range/reference/algorithms/range_numeric/accumulate.html (original)
+++ trunk/libs/range/doc/html/range/reference/algorithms/range_numeric/accumulate.html 2010-04-11 18:05:02 EDT (Sun, 11 Apr 2010)
@@ -28,7 +28,7 @@
accumulate</a>
</h5></div></div></div>
<a name="range.reference.algorithms.range_numeric.accumulate.prototype"></a><h6>
-<a name="id2952359"></a>
+<a name="id3107722"></a>
<a class="link" href="accumulate.html#range.reference.algorithms.range_numeric.accumulate.prototype">Prototype</a>
</h6>
<p>
@@ -53,7 +53,7 @@
<p>
</p>
<a name="range.reference.algorithms.range_numeric.accumulate.description"></a><h6>
-<a name="id2952625"></a>
+<a name="id3107987"></a>
<a class="link" href="accumulate.html#range.reference.algorithms.range_numeric.accumulate.description">Description</a>
</h6>
<p>
@@ -64,18 +64,18 @@
The return value is the resultant value of the above algorithm.
</p>
<a name="range.reference.algorithms.range_numeric.accumulate.definition"></a><h6>
-<a name="id2952705"></a>
+<a name="id3108068"></a>
<a class="link" href="accumulate.html#range.reference.algorithms.range_numeric.accumulate.definition">Definition</a>
</h6>
<p>
Defined in the header file <code class="computeroutput"><span class="identifier">boost</span><span class="special">/</span><span class="identifier">range</span><span class="special">/</span><span class="identifier">numeric</span><span class="special">.</span><span class="identifier">hpp</span></code>
</p>
<a name="range.reference.algorithms.range_numeric.accumulate.requirements"></a><h6>
-<a name="id2952770"></a>
+<a name="id3108132"></a>
<a class="link" href="accumulate.html#range.reference.algorithms.range_numeric.accumulate.requirements">Requirements</a>
</h6>
<a name="range.reference.algorithms.range_numeric.accumulate.for_the_first_version"></a><h6>
-<a name="id2952793"></a>
+<a name="id3108156"></a>
<a class="link" href="accumulate.html#range.reference.algorithms.range_numeric.accumulate.for_the_first_version">For
the first version</a>
</h6>
@@ -100,7 +100,7 @@
</li>
</ol></div>
<a name="range.reference.algorithms.range_numeric.accumulate.for_the_second_version"></a><h6>
-<a name="id2952931"></a>
+<a name="id3108294"></a>
<a class="link" href="accumulate.html#range.reference.algorithms.range_numeric.accumulate.for_the_second_version">For
the second version</a>
</h6>
@@ -134,7 +134,7 @@
</li>
</ol></div>
<a name="range.reference.algorithms.range_numeric.accumulate.complexity"></a><h6>
-<a name="id2953115"></a>
+<a name="id3108477"></a>
<a class="link" href="accumulate.html#range.reference.algorithms.range_numeric.accumulate.complexity">Complexity</a>
</h6>
<p>
Modified: trunk/libs/range/doc/html/range/reference/algorithms/range_numeric/adjacent_difference.html
==============================================================================
--- trunk/libs/range/doc/html/range/reference/algorithms/range_numeric/adjacent_difference.html (original)
+++ trunk/libs/range/doc/html/range/reference/algorithms/range_numeric/adjacent_difference.html 2010-04-11 18:05:02 EDT (Sun, 11 Apr 2010)
@@ -28,7 +28,7 @@
adjacent_difference</a>
</h5></div></div></div>
<a name="range.reference.algorithms.range_numeric.adjacent_difference.prototype"></a><h6>
-<a name="id2953186"></a>
+<a name="id3108549"></a>
<a class="link" href="adjacent_difference.html#range.reference.algorithms.range_numeric.adjacent_difference.prototype">Prototype</a>
</h6>
<p>
@@ -55,7 +55,7 @@
<p>
</p>
<a name="range.reference.algorithms.range_numeric.adjacent_difference.description"></a><h6>
-<a name="id2953455"></a>
+<a name="id3108817"></a>
<a class="link" href="adjacent_difference.html#range.reference.algorithms.range_numeric.adjacent_difference.description">Description</a>
</h6>
<p>
@@ -69,18 +69,18 @@
instead of <code class="computeroutput"><span class="keyword">operator</span><span class="special">-()</span></code>.
</p>
<a name="range.reference.algorithms.range_numeric.adjacent_difference.definition"></a><h6>
-<a name="id2953560"></a>
+<a name="id3108923"></a>
<a class="link" href="adjacent_difference.html#range.reference.algorithms.range_numeric.adjacent_difference.definition">Definition</a>
</h6>
<p>
Defined in the header file <code class="computeroutput"><span class="identifier">boost</span><span class="special">/</span><span class="identifier">range</span><span class="special">/</span><span class="identifier">numeric</span><span class="special">.</span><span class="identifier">hpp</span></code>
</p>
<a name="range.reference.algorithms.range_numeric.adjacent_difference.requirements"></a><h6>
-<a name="id2953625"></a>
+<a name="id3108988"></a>
<a class="link" href="adjacent_difference.html#range.reference.algorithms.range_numeric.adjacent_difference.requirements">Requirements</a>
</h6>
<a name="range.reference.algorithms.range_numeric.adjacent_difference.for_the_first_version"></a><h6>
-<a name="id2953649"></a>
+<a name="id3109012"></a>
<a class="link" href="adjacent_difference.html#range.reference.algorithms.range_numeric.adjacent_difference.for_the_first_version">For
the first version</a>
</h6>
@@ -111,7 +111,7 @@
</li>
</ol></div>
<a name="range.reference.algorithms.range_numeric.adjacent_difference.for_the_second_version"></a><h6>
-<a name="id2953852"></a>
+<a name="id3109215"></a>
<a class="link" href="adjacent_difference.html#range.reference.algorithms.range_numeric.adjacent_difference.for_the_second_version">For
the second version</a>
</h6>
@@ -146,7 +146,7 @@
</li>
</ol></div>
<a name="range.reference.algorithms.range_numeric.adjacent_difference.precondition_"></a><h6>
-<a name="id2954040"></a>
+<a name="id3109402"></a>
<a class="link" href="adjacent_difference.html#range.reference.algorithms.range_numeric.adjacent_difference.precondition_">Precondition:</a>
</h6>
<p>
@@ -154,7 +154,7 @@
<span class="special">+</span> <span class="identifier">distance</span><span class="special">(</span><span class="identifier">rng</span><span class="special">))</span></code> is a valid range.
</p>
<a name="range.reference.algorithms.range_numeric.adjacent_difference.complexity"></a><h6>
-<a name="id2954117"></a>
+<a name="id3109479"></a>
<a class="link" href="adjacent_difference.html#range.reference.algorithms.range_numeric.adjacent_difference.complexity">Complexity</a>
</h6>
<p>
Modified: trunk/libs/range/doc/html/range/reference/algorithms/range_numeric/inner_product.html
==============================================================================
--- trunk/libs/range/doc/html/range/reference/algorithms/range_numeric/inner_product.html (original)
+++ trunk/libs/range/doc/html/range/reference/algorithms/range_numeric/inner_product.html 2010-04-11 18:05:02 EDT (Sun, 11 Apr 2010)
@@ -28,7 +28,7 @@
inner_product</a>
</h5></div></div></div>
<a name="range.reference.algorithms.range_numeric.inner_product.prototype"></a><h6>
-<a name="id2954224"></a>
+<a name="id3109586"></a>
<a class="link" href="inner_product.html#range.reference.algorithms.range_numeric.inner_product.prototype">Prototype</a>
</h6>
<p>
@@ -54,7 +54,7 @@
<p>
</p>
<a name="range.reference.algorithms.range_numeric.inner_product.description"></a><h6>
-<a name="id2954590"></a>
+<a name="id3109952"></a>
<a class="link" href="inner_product.html#range.reference.algorithms.range_numeric.inner_product.description">Description</a>
</h6>
<p>
@@ -67,18 +67,18 @@
algorithm please see inner_product.
</p>
<a name="range.reference.algorithms.range_numeric.inner_product.definition"></a><h6>
-<a name="id2954672"></a>
+<a name="id3110035"></a>
<a class="link" href="inner_product.html#range.reference.algorithms.range_numeric.inner_product.definition">Definition</a>
</h6>
<p>
Defined in the header file <code class="computeroutput"><span class="identifier">boost</span><span class="special">/</span><span class="identifier">range</span><span class="special">/</span><span class="identifier">numeric</span><span class="special">.</span><span class="identifier">hpp</span></code>
</p>
<a name="range.reference.algorithms.range_numeric.inner_product.requirements"></a><h6>
-<a name="id2954737"></a>
+<a name="id3110099"></a>
<a class="link" href="inner_product.html#range.reference.algorithms.range_numeric.inner_product.requirements">Requirements</a>
</h6>
<a name="range.reference.algorithms.range_numeric.inner_product.for_the_first_version"></a><h6>
-<a name="id2954761"></a>
+<a name="id3110124"></a>
<a class="link" href="inner_product.html#range.reference.algorithms.range_numeric.inner_product.for_the_first_version">For
the first version</a>
</h6>
@@ -113,7 +113,7 @@
</li>
</ol></div>
<a name="range.reference.algorithms.range_numeric.inner_product.for_the_second_version"></a><h6>
-<a name="id2955015"></a>
+<a name="id3110378"></a>
<a class="link" href="inner_product.html#range.reference.algorithms.range_numeric.inner_product.for_the_second_version">For
the second version</a>
</h6>
@@ -162,14 +162,14 @@
</li>
</ol></div>
<a name="range.reference.algorithms.range_numeric.inner_product.precondition_"></a><h6>
-<a name="id2955301"></a>
+<a name="id3110664"></a>
<a class="link" href="inner_product.html#range.reference.algorithms.range_numeric.inner_product.precondition_">Precondition:</a>
</h6>
<p>
<code class="computeroutput"><span class="identifier">distance</span><span class="special">(</span><span class="identifier">rng2</span><span class="special">)</span> <span class="special">>=</span> <span class="identifier">distance</span><span class="special">(</span><span class="identifier">rng1</span><span class="special">)</span></code> is a valid range.
</p>
<a name="range.reference.algorithms.range_numeric.inner_product.complexity"></a><h6>
-<a name="id2955378"></a>
+<a name="id3110741"></a>
<a class="link" href="inner_product.html#range.reference.algorithms.range_numeric.inner_product.complexity">Complexity</a>
</h6>
<p>
Modified: trunk/libs/range/doc/html/range/reference/algorithms/range_numeric/partial_sum.html
==============================================================================
--- trunk/libs/range/doc/html/range/reference/algorithms/range_numeric/partial_sum.html (original)
+++ trunk/libs/range/doc/html/range/reference/algorithms/range_numeric/partial_sum.html 2010-04-11 18:05:02 EDT (Sun, 11 Apr 2010)
@@ -28,7 +28,7 @@
partial_sum</a>
</h5></div></div></div>
<a name="range.reference.algorithms.range_numeric.partial_sum.prototype"></a><h6>
-<a name="id2955449"></a>
+<a name="id3110811"></a>
<a class="link" href="partial_sum.html#range.reference.algorithms.range_numeric.partial_sum.prototype">Prototype</a>
</h6>
<p>
@@ -49,7 +49,7 @@
<p>
</p>
<a name="range.reference.algorithms.range_numeric.partial_sum.description"></a><h6>
-<a name="id2955710"></a>
+<a name="id3111072"></a>
<a class="link" href="partial_sum.html#range.reference.algorithms.range_numeric.partial_sum.description">Description</a>
</h6>
<p>
@@ -58,18 +58,18 @@
in the same manner as <code class="computeroutput"><span class="identifier">std</span><span class="special">::</span><span class="identifier">partial_sum</span><span class="special">(</span><span class="identifier">boost</span><span class="special">::</span><span class="identifier">begin</span><span class="special">(</span><span class="identifier">rng</span><span class="special">),</span> <span class="identifier">boost</span><span class="special">::</span><span class="identifier">end</span><span class="special">(</span><span class="identifier">rng</span><span class="special">),</span> <span class="identifier">out_it</span><span class="special">)</span></code>. See partial_sum.
</p>
<a name="range.reference.algorithms.range_numeric.partial_sum.definition"></a><h6>
-<a name="id2955853"></a>
+<a name="id3111216"></a>
<a class="link" href="partial_sum.html#range.reference.algorithms.range_numeric.partial_sum.definition">Definition</a>
</h6>
<p>
Defined in the header file <code class="computeroutput"><span class="identifier">boost</span><span class="special">/</span><span class="identifier">range</span><span class="special">/</span><span class="identifier">numeric</span><span class="special">.</span><span class="identifier">hpp</span></code>
</p>
<a name="range.reference.algorithms.range_numeric.partial_sum.requirements"></a><h6>
-<a name="id2955917"></a>
+<a name="id3111280"></a>
<a class="link" href="partial_sum.html#range.reference.algorithms.range_numeric.partial_sum.requirements">Requirements</a>
</h6>
<a name="range.reference.algorithms.range_numeric.partial_sum.for_the_first_version"></a><h6>
-<a name="id2955941"></a>
+<a name="id3111303"></a>
<a class="link" href="partial_sum.html#range.reference.algorithms.range_numeric.partial_sum.for_the_first_version">For
the first version</a>
</h6>
@@ -99,7 +99,7 @@
</li>
</ol></div>
<a name="range.reference.algorithms.range_numeric.partial_sum.for_the_second_version"></a><h6>
-<a name="id2956143"></a>
+<a name="id3111505"></a>
<a class="link" href="partial_sum.html#range.reference.algorithms.range_numeric.partial_sum.for_the_second_version">For
the second version</a>
</h6>
@@ -128,7 +128,7 @@
</li>
</ol></div>
<a name="range.reference.algorithms.range_numeric.partial_sum.precondition_"></a><h6>
-<a name="id2956302"></a>
+<a name="id3111664"></a>
<a class="link" href="partial_sum.html#range.reference.algorithms.range_numeric.partial_sum.precondition_">Precondition:</a>
</h6>
<p>
@@ -136,7 +136,7 @@
<span class="special">+</span> <span class="identifier">distance</span><span class="special">(</span><span class="identifier">rng</span><span class="special">))</span></code> is a valid range.
</p>
<a name="range.reference.algorithms.range_numeric.partial_sum.complexity"></a><h6>
-<a name="id2956379"></a>
+<a name="id3111741"></a>
<a class="link" href="partial_sum.html#range.reference.algorithms.range_numeric.partial_sum.complexity">Complexity</a>
</h6>
<p>
Modified: trunk/libs/range/doc/html/range/reference/algorithms/set_algorithms/includes.html
==============================================================================
--- trunk/libs/range/doc/html/range/reference/algorithms/set_algorithms/includes.html (original)
+++ trunk/libs/range/doc/html/range/reference/algorithms/set_algorithms/includes.html 2010-04-11 18:05:02 EDT (Sun, 11 Apr 2010)
@@ -28,7 +28,7 @@
includes</a>
</h5></div></div></div>
<a name="range.reference.algorithms.set_algorithms.includes.prototype"></a><h6>
-<a name="id2937081"></a>
+<a name="id3091173"></a>
<a class="link" href="includes.html#range.reference.algorithms.set_algorithms.includes.prototype">Prototype</a>
</h6>
<p>
@@ -48,7 +48,7 @@
<p>
</p>
<a name="range.reference.algorithms.set_algorithms.includes.description"></a><h6>
-<a name="id2937365"></a>
+<a name="id3091457"></a>
<a class="link" href="includes.html#range.reference.algorithms.set_algorithms.includes.description">Description</a>
</h6>
<p>
@@ -60,14 +60,14 @@
the predicate versions.
</p>
<a name="range.reference.algorithms.set_algorithms.includes.definition"></a><h6>
-<a name="id2937464"></a>
+<a name="id3091556"></a>
<a class="link" href="includes.html#range.reference.algorithms.set_algorithms.includes.definition">Definition</a>
</h6>
<p>
Defined in the header file <code class="computeroutput"><span class="identifier">boost</span><span class="special">/</span><span class="identifier">range</span><span class="special">/</span><span class="identifier">algorithm</span><span class="special">/</span><span class="identifier">set_algorithm</span><span class="special">.</span><span class="identifier">hpp</span></code>
</p>
<a name="range.reference.algorithms.set_algorithms.includes.requirements"></a><h6>
-<a name="id2937537"></a>
+<a name="id3091629"></a>
<a class="link" href="includes.html#range.reference.algorithms.set_algorithms.includes.requirements">Requirements</a>
</h6>
<p>
@@ -145,7 +145,7 @@
</li>
</ul></div>
<a name="range.reference.algorithms.set_algorithms.includes.precondition_"></a><h6>
-<a name="id2937929"></a>
+<a name="id3092021"></a>
<a class="link" href="includes.html#range.reference.algorithms.set_algorithms.includes.precondition_">Precondition:</a>
</h6>
<p>
@@ -163,7 +163,7 @@
according to <code class="computeroutput"><span class="identifier">pred</span></code>.
</p>
<a name="range.reference.algorithms.set_algorithms.includes.complexity"></a><h6>
-<a name="id2938048"></a>
+<a name="id3092140"></a>
<a class="link" href="includes.html#range.reference.algorithms.set_algorithms.includes.complexity">Complexity</a>
</h6>
<p>
Modified: trunk/libs/range/doc/html/range/reference/algorithms/set_algorithms/set_difference.html
==============================================================================
--- trunk/libs/range/doc/html/range/reference/algorithms/set_algorithms/set_difference.html (original)
+++ trunk/libs/range/doc/html/range/reference/algorithms/set_algorithms/set_difference.html 2010-04-11 18:05:02 EDT (Sun, 11 Apr 2010)
@@ -28,7 +28,7 @@
set_difference</a>
</h5></div></div></div>
<a name="range.reference.algorithms.set_algorithms.set_difference.prototype"></a><h6>
-<a name="id2940595"></a>
+<a name="id3094687"></a>
<a class="link" href="set_difference.html#range.reference.algorithms.set_algorithms.set_difference.prototype">Prototype</a>
</h6>
<p>
@@ -57,7 +57,7 @@
<p>
</p>
<a name="range.reference.algorithms.set_algorithms.set_difference.description"></a><h6>
-<a name="id2940943"></a>
+<a name="id3095038"></a>
<a class="link" href="set_difference.html#range.reference.algorithms.set_algorithms.set_difference.description">Description</a>
</h6>
<p>
@@ -71,14 +71,14 @@
the predicate versions.
</p>
<a name="range.reference.algorithms.set_algorithms.set_difference.definition"></a><h6>
-<a name="id2941039"></a>
+<a name="id3095131"></a>
<a class="link" href="set_difference.html#range.reference.algorithms.set_algorithms.set_difference.definition">Definition</a>
</h6>
<p>
Defined in the header file <code class="computeroutput"><span class="identifier">boost</span><span class="special">/</span><span class="identifier">range</span><span class="special">/</span><span class="identifier">algorithm</span><span class="special">/</span><span class="identifier">set_algorithm</span><span class="special">.</span><span class="identifier">hpp</span></code>
</p>
<a name="range.reference.algorithms.set_algorithms.set_difference.requirements"></a><h6>
-<a name="id2941114"></a>
+<a name="id3095205"></a>
<a class="link" href="set_difference.html#range.reference.algorithms.set_algorithms.set_difference.requirements">Requirements</a>
</h6>
<p>
@@ -164,7 +164,7 @@
</li>
</ul></div>
<a name="range.reference.algorithms.set_algorithms.set_difference.precondition_"></a><h6>
-<a name="id2941558"></a>
+<a name="id3095649"></a>
<a class="link" href="set_difference.html#range.reference.algorithms.set_algorithms.set_difference.precondition_">Precondition:</a>
</h6>
<p>
@@ -182,7 +182,7 @@
according to <code class="computeroutput"><span class="identifier">pred</span></code>.
</p>
<a name="range.reference.algorithms.set_algorithms.set_difference.complexity"></a><h6>
-<a name="id2941677"></a>
+<a name="id3095768"></a>
<a class="link" href="set_difference.html#range.reference.algorithms.set_algorithms.set_difference.complexity">Complexity</a>
</h6>
<p>
Modified: trunk/libs/range/doc/html/range/reference/algorithms/set_algorithms/set_intersection.html
==============================================================================
--- trunk/libs/range/doc/html/range/reference/algorithms/set_algorithms/set_intersection.html (original)
+++ trunk/libs/range/doc/html/range/reference/algorithms/set_algorithms/set_intersection.html 2010-04-11 18:05:02 EDT (Sun, 11 Apr 2010)
@@ -28,7 +28,7 @@
set_intersection</a>
</h5></div></div></div>
<a name="range.reference.algorithms.set_algorithms.set_intersection.prototype"></a><h6>
-<a name="id2939384"></a>
+<a name="id3093475"></a>
<a class="link" href="set_intersection.html#range.reference.algorithms.set_algorithms.set_intersection.prototype">Prototype</a>
</h6>
<p>
@@ -57,7 +57,7 @@
<p>
</p>
<a name="range.reference.algorithms.set_algorithms.set_intersection.description"></a><h6>
-<a name="id2939736"></a>
+<a name="id3093827"></a>
<a class="link" href="set_intersection.html#range.reference.algorithms.set_algorithms.set_intersection.description">Description</a>
</h6>
<p>
@@ -71,14 +71,14 @@
the predicate versions.
</p>
<a name="range.reference.algorithms.set_algorithms.set_intersection.definition"></a><h6>
-<a name="id2939828"></a>
+<a name="id3093920"></a>
<a class="link" href="set_intersection.html#range.reference.algorithms.set_algorithms.set_intersection.definition">Definition</a>
</h6>
<p>
Defined in the header file <code class="computeroutput"><span class="identifier">boost</span><span class="special">/</span><span class="identifier">range</span><span class="special">/</span><span class="identifier">algorithm</span><span class="special">/</span><span class="identifier">set_algorithm</span><span class="special">.</span><span class="identifier">hpp</span></code>
</p>
<a name="range.reference.algorithms.set_algorithms.set_intersection.requirements"></a><h6>
-<a name="id2939901"></a>
+<a name="id3093992"></a>
<a class="link" href="set_intersection.html#range.reference.algorithms.set_algorithms.set_intersection.requirements">Requirements</a>
</h6>
<p>
@@ -164,7 +164,7 @@
</li>
</ul></div>
<a name="range.reference.algorithms.set_algorithms.set_intersection.precondition_"></a><h6>
-<a name="id2940345"></a>
+<a name="id3094437"></a>
<a class="link" href="set_intersection.html#range.reference.algorithms.set_algorithms.set_intersection.precondition_">Precondition:</a>
</h6>
<p>
@@ -182,7 +182,7 @@
according to <code class="computeroutput"><span class="identifier">pred</span></code>.
</p>
<a name="range.reference.algorithms.set_algorithms.set_intersection.complexity"></a><h6>
-<a name="id2940465"></a>
+<a name="id3094556"></a>
<a class="link" href="set_intersection.html#range.reference.algorithms.set_algorithms.set_intersection.complexity">Complexity</a>
</h6>
<p>
Modified: trunk/libs/range/doc/html/range/reference/algorithms/set_algorithms/set_symmetric_difference.html
==============================================================================
--- trunk/libs/range/doc/html/range/reference/algorithms/set_algorithms/set_symmetric_difference.html (original)
+++ trunk/libs/range/doc/html/range/reference/algorithms/set_algorithms/set_symmetric_difference.html 2010-04-11 18:05:02 EDT (Sun, 11 Apr 2010)
@@ -28,7 +28,7 @@
set_symmetric_difference</a>
</h5></div></div></div>
<a name="range.reference.algorithms.set_algorithms.set_symmetric_difference.prototype"></a><h6>
-<a name="id2941807"></a>
+<a name="id3095898"></a>
<a class="link" href="set_symmetric_difference.html#range.reference.algorithms.set_algorithms.set_symmetric_difference.prototype">Prototype</a>
</h6>
<p>
@@ -59,7 +59,7 @@
<p>
</p>
<a name="range.reference.algorithms.set_algorithms.set_symmetric_difference.description"></a><h6>
-<a name="id2942159"></a>
+<a name="id3096249"></a>
<a class="link" href="set_symmetric_difference.html#range.reference.algorithms.set_algorithms.set_symmetric_difference.description">Description</a>
</h6>
<p>
@@ -75,14 +75,14 @@
the predicate versions.
</p>
<a name="range.reference.algorithms.set_algorithms.set_symmetric_difference.definition"></a><h6>
-<a name="id2942252"></a>
+<a name="id3096344"></a>
<a class="link" href="set_symmetric_difference.html#range.reference.algorithms.set_algorithms.set_symmetric_difference.definition">Definition</a>
</h6>
<p>
Defined in the header file <code class="computeroutput"><span class="identifier">boost</span><span class="special">/</span><span class="identifier">range</span><span class="special">/</span><span class="identifier">algorithm</span><span class="special">/</span><span class="identifier">set_algorithm</span><span class="special">.</span><span class="identifier">hpp</span></code>
</p>
<a name="range.reference.algorithms.set_algorithms.set_symmetric_difference.requirements"></a><h6>
-<a name="id2942327"></a>
+<a name="id3096418"></a>
<a class="link" href="set_symmetric_difference.html#range.reference.algorithms.set_algorithms.set_symmetric_difference.requirements">Requirements</a>
</h6>
<p>
@@ -168,7 +168,7 @@
</li>
</ul></div>
<a name="range.reference.algorithms.set_algorithms.set_symmetric_difference.precondition_"></a><h6>
-<a name="id2942772"></a>
+<a name="id3096863"></a>
<a class="link" href="set_symmetric_difference.html#range.reference.algorithms.set_algorithms.set_symmetric_difference.precondition_">Precondition:</a>
</h6>
<p>
@@ -186,7 +186,7 @@
according to <code class="computeroutput"><span class="identifier">pred</span></code>.
</p>
<a name="range.reference.algorithms.set_algorithms.set_symmetric_difference.complexity"></a><h6>
-<a name="id2942892"></a>
+<a name="id3096983"></a>
<a class="link" href="set_symmetric_difference.html#range.reference.algorithms.set_algorithms.set_symmetric_difference.complexity">Complexity</a>
</h6>
<p>
Modified: trunk/libs/range/doc/html/range/reference/algorithms/set_algorithms/set_union.html
==============================================================================
--- trunk/libs/range/doc/html/range/reference/algorithms/set_algorithms/set_union.html (original)
+++ trunk/libs/range/doc/html/range/reference/algorithms/set_algorithms/set_union.html 2010-04-11 18:05:02 EDT (Sun, 11 Apr 2010)
@@ -28,7 +28,7 @@
set_union</a>
</h5></div></div></div>
<a name="range.reference.algorithms.set_algorithms.set_union.prototype"></a><h6>
-<a name="id2938177"></a>
+<a name="id3092269"></a>
<a class="link" href="set_union.html#range.reference.algorithms.set_algorithms.set_union.prototype">Prototype</a>
</h6>
<p>
@@ -57,7 +57,7 @@
<p>
</p>
<a name="range.reference.algorithms.set_algorithms.set_union.description"></a><h6>
-<a name="id2938529"></a>
+<a name="id3092620"></a>
<a class="link" href="set_union.html#range.reference.algorithms.set_algorithms.set_union.description">Description</a>
</h6>
<p>
@@ -70,14 +70,14 @@
in the predicate versions.
</p>
<a name="range.reference.algorithms.set_algorithms.set_union.definition"></a><h6>
-<a name="id2938618"></a>
+<a name="id3092710"></a>
<a class="link" href="set_union.html#range.reference.algorithms.set_algorithms.set_union.definition">Definition</a>
</h6>
<p>
Defined in the header file <code class="computeroutput"><span class="identifier">boost</span><span class="special">/</span><span class="identifier">range</span><span class="special">/</span><span class="identifier">algorithm</span><span class="special">/</span><span class="identifier">set_algorithm</span><span class="special">.</span><span class="identifier">hpp</span></code>
</p>
<a name="range.reference.algorithms.set_algorithms.set_union.requirements"></a><h6>
-<a name="id2938691"></a>
+<a name="id3092782"></a>
<a class="link" href="set_union.html#range.reference.algorithms.set_algorithms.set_union.requirements">Requirements</a>
</h6>
<p>
@@ -163,7 +163,7 @@
</li>
</ul></div>
<a name="range.reference.algorithms.set_algorithms.set_union.precondition_"></a><h6>
-<a name="id2939134"></a>
+<a name="id3093226"></a>
<a class="link" href="set_union.html#range.reference.algorithms.set_algorithms.set_union.precondition_">Precondition:</a>
</h6>
<p>
@@ -181,7 +181,7 @@
according to <code class="computeroutput"><span class="identifier">pred</span></code>.
</p>
<a name="range.reference.algorithms.set_algorithms.set_union.complexity"></a><h6>
-<a name="id2939253"></a>
+<a name="id3093345"></a>
<a class="link" href="set_union.html#range.reference.algorithms.set_algorithms.set_union.complexity">Complexity</a>
</h6>
<p>
Modified: trunk/libs/range/doc/html/range/reference/ranges/counting_range.html
==============================================================================
--- trunk/libs/range/doc/html/range/reference/ranges/counting_range.html (original)
+++ trunk/libs/range/doc/html/range/reference/ranges/counting_range.html 2010-04-11 18:05:02 EDT (Sun, 11 Apr 2010)
@@ -27,7 +27,7 @@
<a name="range.reference.ranges.counting_range"></a><a class="link" href="counting_range.html" title="counting_range"> counting_range</a>
</h4></div></div></div>
<a name="range.reference.ranges.counting_range.prototype"></a><h6>
-<a name="id2956501"></a>
+<a name="id3111863"></a>
<a class="link" href="counting_range.html#range.reference.ranges.counting_range.prototype">Prototype</a>
</h6>
<p>
@@ -48,7 +48,7 @@
<p>
</p>
<a name="range.reference.ranges.counting_range.description"></a><h6>
-<a name="id2956887"></a>
+<a name="id3112247"></a>
<a class="link" href="counting_range.html#range.reference.ranges.counting_range.description">Description</a>
</h6>
<p>
@@ -58,14 +58,14 @@
(from Boost.Iterator).
</p>
<a name="range.reference.ranges.counting_range.definition"></a><h6>
-<a name="id2956945"></a>
+<a name="id3112306"></a>
<a class="link" href="counting_range.html#range.reference.ranges.counting_range.definition">Definition</a>
</h6>
<p>
Defined in header file <code class="computeroutput"><span class="identifier">boost</span><span class="special">/</span><span class="identifier">range</span><span class="special">/</span><span class="identifier">counting_range</span><span class="special">.</span><span class="identifier">hpp</span></code>
</p>
<a name="range.reference.ranges.counting_range.requirements"></a><h6>
-<a name="id2957009"></a>
+<a name="id3112370"></a>
<a class="link" href="counting_range.html#range.reference.ranges.counting_range.requirements">Requirements</a>
</h6>
<div class="orderedlist"><ol class="orderedlist" type="1"><li class="listitem">
Modified: trunk/libs/range/doc/html/range/reference/ranges/irange.html
==============================================================================
--- trunk/libs/range/doc/html/range/reference/ranges/irange.html (original)
+++ trunk/libs/range/doc/html/range/reference/ranges/irange.html 2010-04-11 18:05:02 EDT (Sun, 11 Apr 2010)
@@ -27,7 +27,7 @@
<a name="range.reference.ranges.irange"></a><a class="link" href="irange.html" title="irange"> irange</a>
</h4></div></div></div>
<a name="range.reference.ranges.irange.prototype"></a><h6>
-<a name="id2957450"></a>
+<a name="id3112811"></a>
<a class="link" href="irange.html#range.reference.ranges.irange.prototype">Prototype</a>
</h6>
<p>
@@ -44,7 +44,7 @@
<p>
</p>
<a name="range.reference.ranges.irange.description"></a><h6>
-<a name="id2957745"></a>
+<a name="id3113106"></a>
<a class="link" href="irange.html#range.reference.ranges.irange.description">Description</a>
</h6>
<p>
@@ -58,14 +58,14 @@
parameters denoted a half-open range.
</p>
<a name="range.reference.ranges.irange.definition"></a><h6>
-<a name="id2957826"></a>
+<a name="id3113188"></a>
<a class="link" href="irange.html#range.reference.ranges.irange.definition">Definition</a>
</h6>
<p>
Defined in the header file <code class="computeroutput"><span class="identifier">boost</span><span class="special">/</span><span class="identifier">range</span><span class="special">/</span><span class="identifier">irange</span><span class="special">.</span><span class="identifier">hpp</span></code>
</p>
<a name="range.reference.ranges.irange.requirements"></a><h6>
-<a name="id2957888"></a>
+<a name="id3113250"></a>
<a class="link" href="irange.html#range.reference.ranges.irange.requirements">Requirements</a>
</h6>
<div class="orderedlist"><ol class="orderedlist" type="1">
@@ -79,7 +79,7 @@
</li>
</ol></div>
<a name="range.reference.ranges.irange.complexity"></a><h6>
-<a name="id2957968"></a>
+<a name="id3113330"></a>
<a class="link" href="irange.html#range.reference.ranges.irange.complexity">Complexity</a>
</h6>
<p>
Modified: trunk/libs/range/doc/html/range/reference/ranges/istream_range.html
==============================================================================
--- trunk/libs/range/doc/html/range/reference/ranges/istream_range.html (original)
+++ trunk/libs/range/doc/html/range/reference/ranges/istream_range.html 2010-04-11 18:05:02 EDT (Sun, 11 Apr 2010)
@@ -27,7 +27,7 @@
<a name="range.reference.ranges.istream_range"></a><a class="link" href="istream_range.html" title="istream_range"> istream_range</a>
</h4></div></div></div>
<a name="range.reference.ranges.istream_range.prototype"></a><h6>
-<a name="id2957083"></a>
+<a name="id3112444"></a>
<a class="link" href="istream_range.html#range.reference.ranges.istream_range.prototype">Prototype</a>
</h6>
<p>
@@ -40,7 +40,7 @@
<p>
</p>
<a name="range.reference.ranges.istream_range.description"></a><h6>
-<a name="id2957302"></a>
+<a name="id3112664"></a>
<a class="link" href="istream_range.html#range.reference.ranges.istream_range.description">Description</a>
</h6>
<p>
@@ -49,7 +49,7 @@
wrapping a <code class="computeroutput"><span class="identifier">std</span><span class="special">::</span><span class="identifier">istream_iterator</span></code>.
</p>
<a name="range.reference.ranges.istream_range.definition"></a><h6>
-<a name="id2957370"></a>
+<a name="id3112731"></a>
<a class="link" href="istream_range.html#range.reference.ranges.istream_range.definition">Definition</a>
</h6>
<p>
Modified: trunk/libs/range/doc/html/range/reference/semantics.html
==============================================================================
--- trunk/libs/range/doc/html/range/reference/semantics.html (original)
+++ trunk/libs/range/doc/html/range/reference/semantics.html 2010-04-11 18:05:02 EDT (Sun, 11 Apr 2010)
@@ -31,7 +31,7 @@
<dt><span class="section">Functions</span></dt>
</dl></div>
<a name="range.reference.semantics.notation"></a><h5>
-<a name="id2868391"></a>
+<a name="id3021991"></a>
<a class="link" href="semantics.html#range.reference.semantics.notation">notation</a>
</h5>
<div class="informaltable"><table class="table">
Modified: trunk/libs/range/doc/html/range/utilities/iterator_range.html
==============================================================================
--- trunk/libs/range/doc/html/range/utilities/iterator_range.html (original)
+++ trunk/libs/range/doc/html/range/utilities/iterator_range.html 2010-04-11 18:05:02 EDT (Sun, 11 Apr 2010)
@@ -47,7 +47,7 @@
limitation is simply propogated from the underlying iterator type.
</p>
<a name="range.utilities.iterator_range.synopsis"></a><h5>
-<a name="id2964234"></a>
+<a name="id3119597"></a>
<a class="link" href="iterator_range.html#range.utilities.iterator_range.synopsis">Synopsis</a>
</h5>
<p>
@@ -187,7 +187,7 @@
iterators from the same container.
</p>
<a name="range.utilities.iterator_range.details_member_functions"></a><h5>
-<a name="id2967466"></a>
+<a name="id3122828"></a>
<a class="link" href="iterator_range.html#range.utilities.iterator_range.details_member_functions">Details
member functions</a>
</h5>
@@ -218,7 +218,7 @@
</p>
</blockquote></div>
<a name="range.utilities.iterator_range.details_functions"></a><h5>
-<a name="id2967711"></a>
+<a name="id3123073"></a>
<a class="link" href="iterator_range.html#range.utilities.iterator_range.details_functions">Details
functions</a>
</h5>
Modified: trunk/libs/range/doc/html/range/utilities/join.html
==============================================================================
--- trunk/libs/range/doc/html/range/utilities/join.html (original)
+++ trunk/libs/range/doc/html/range/utilities/join.html 2010-04-11 18:05:02 EDT (Sun, 11 Apr 2010)
@@ -39,7 +39,7 @@
if the end of a range has been reached internally during traversal.
</p>
<a name="range.utilities.join.synposis"></a><h5>
-<a name="id2970148"></a>
+<a name="id3125510"></a>
<a class="link" href="join.html#range.utilities.join.synposis">Synposis</a>
</h5>
<p>
@@ -65,7 +65,7 @@
<p>
</p>
<a name="range.utilities.join.example"></a><h5>
-<a name="id2970695"></a>
+<a name="id3126057"></a>
<a class="link" href="join.html#range.utilities.join.example">Example</a>
</h5>
<p>
Modified: trunk/libs/range/doc/html/range/utilities/sub_range.html
==============================================================================
--- trunk/libs/range/doc/html/range/utilities/sub_range.html (original)
+++ trunk/libs/range/doc/html/range/utilities/sub_range.html 2010-04-11 18:05:02 EDT (Sun, 11 Apr 2010)
@@ -35,7 +35,7 @@
is.
</p>
<a name="range.utilities.sub_range.synopsis"></a><h5>
-<a name="id2968870"></a>
+<a name="id3124232"></a>
<a class="link" href="sub_range.html#range.utilities.sub_range.synopsis">Synopsis</a>
</h5>
<p>
Modified: trunk/libs/range/doc/reference/algorithm/fill.qbk
==============================================================================
--- trunk/libs/range/doc/reference/algorithm/fill.qbk (original)
+++ trunk/libs/range/doc/reference/algorithm/fill.qbk 2010-04-11 18:05:02 EDT (Sun, 11 Apr 2010)
@@ -4,10 +4,7 @@
``
template<class ForwardRange, class Value>
-void fill( ForwardRange& rng, const Value& val );
-
-template<class ForwardRange, class Value>
-void fill( const ForwardRange& rng, const Value& val );
+ForwardRange& fill( ForwardRange& rng, const Value& val );
``
[heading Description]
Added: trunk/libs/range/doc/reference/algorithm/fill_n.qbk
==============================================================================
--- (empty file)
+++ trunk/libs/range/doc/reference/algorithm/fill_n.qbk 2010-04-11 18:05:02 EDT (Sun, 11 Apr 2010)
@@ -0,0 +1,31 @@
+[section:fill_n Range Algorithm - fill_n]
+
+[heading Prototype]
+
+``
+template<class ForwardRange, class Size, class Value>
+ForwardRange& fill( ForwardRange& rng, Size n, const Value& val );
+``
+
+[heading Description]
+
+`fill_n` assigns the value `val` to `n` elements in the range `rng` begining with `boost::begin(rng)`.
+
+[heading Definition]
+
+Defined in the header file `boost/range/algorithm/fill_n.hpp`
+
+[heading Requirements]
+
+* `ForwardRange` is a model of the __forward_range__ Concept.
+* `ForwardRange` is mutable.
+* `Value` is a model of the `AssignableConcept`.
+* `Value` is convertible to `ForwardRange`'s value type.
+
+[heading Complexity]
+
+Linear. Exactly `n` assignments are performed.
+
+[endsect]
+
+
Modified: trunk/libs/range/doc/reference/algorithm/make_heap.qbk
==============================================================================
--- trunk/libs/range/doc/reference/algorithm/make_heap.qbk (original)
+++ trunk/libs/range/doc/reference/algorithm/make_heap.qbk 2010-04-11 18:05:02 EDT (Sun, 11 Apr 2010)
@@ -4,16 +4,16 @@
``
template<class RandomAccessRange>
-void make_heap(RandomAccessRange& rng);
+RandomAccessRange& make_heap(RandomAccessRange& rng);
template<class RandomAccessRange>
-void make_heap(const RandomAccessRange& rng);
+const RandomAccessRange& make_heap(const RandomAccessRange& rng);
template<class RandomAccessRange, class Compare>
-void make_heap(RandomAccessRange& rng, Compare pred);
+RandomAccessRange& make_heap(RandomAccessRange& rng, Compare pred);
template<class RandomAccessRange, class Compare>
-void make_heap(const RandomAccessRange& rng, Compare pred);
+const RandomAccessRange& make_heap(const RandomAccessRange& rng, Compare pred);
``
[heading Description]
@@ -21,7 +21,7 @@
`make_heap` turns `rng` into a heap.
The ordering relationship is determined by using `operator<` in the non-predicate versions, and by evaluating `pred` in the predicate versions.
-
+
[heading Definition]
Defined in the header file `boost/range/algorithm/heap_algorithm.hpp`
Modified: trunk/libs/range/doc/reference/algorithm/next_permutation.qbk
==============================================================================
--- trunk/libs/range/doc/reference/algorithm/next_permutation.qbk (original)
+++ trunk/libs/range/doc/reference/algorithm/next_permutation.qbk 2010-04-11 18:05:02 EDT (Sun, 11 Apr 2010)
@@ -4,16 +4,16 @@
``
template<class BidirectionalRange>
-void next_permutation(BidirectionalRange& rng);
+bool next_permutation(BidirectionalRange& rng);
template<class BidirectionalRange>
-void next_permutation(const BidirectionalRange& rng);
+bool next_permutation(const BidirectionalRange& rng);
template<class BidirectionalRange, class Compare>
-void next_permutation(BidirectionalRange& rng, Compare pred);
+bool next_permutation(BidirectionalRange& rng, Compare pred);
template<class BidirectionalRange, class Compare>
-void next_permutation(const BidirectionalRange& rng, Compare pred);
+bool next_permutation(const BidirectionalRange& rng, Compare pred);
``
[heading Description]
@@ -21,7 +21,7 @@
`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.
The ordering relationship is determined by using `operator<` in the non-predicate versions, and by evaluating `pred` in the predicate versions.
-
+
[heading Definition]
Defined in the header file `boost/range/algorithm/permutation.hpp`
Modified: trunk/libs/range/doc/reference/algorithm/nth_element.qbk
==============================================================================
--- trunk/libs/range/doc/reference/algorithm/nth_element.qbk (original)
+++ trunk/libs/range/doc/reference/algorithm/nth_element.qbk 2010-04-11 18:05:02 EDT (Sun, 11 Apr 2010)
@@ -4,22 +4,26 @@
``
template<class RandomAccessRange>
-void nth_element(RandomAccessRange& rng,
- typename range_iterator<RandomAccessRange>::type nth);
-
+RandomAccessRange& nth_element(
+ RandomAccessRange& rng,
+ typename range_iterator<RandomAccessRange>::type nth);
+
template<class RandomAccessRange>
-void nth_element(const RandomAccessRange& rng,
- typename range_iterator<const RandomAccessRange>::type nth);
-
+const RandomAccessRange& nth_element(
+ const RandomAccessRange& rng,
+ typename range_iterator<const RandomAccessRange>::type nth);
+
template<class RandomAccessRange>
-void nth_element(RandomAccessRange& rng,
- typename range_iterator<RandomAccessRange>::type nth,
- BinaryPredicate sort_pred);
-
+RandomAccessRange& nth_element(
+ RandomAccessRange& rng,
+ typename range_iterator<RandomAccessRange>::type nth,
+ BinaryPredicate sort_pred);
+
template<class RandomAccessRange>
-void nth_element(const RandomAccessRange& rng,
- typename range_iterator<const RandomAccessRange>::type nth,
- BinaryPredicate sort_pred);
+const RandomAccessRange& nth_element(
+ const RandomAccessRange& rng,
+ typename range_iterator<const RandomAccessRange>::type nth,
+ BinaryPredicate sort_pred);
``
[heading Description]
Modified: trunk/libs/range/doc/reference/algorithm/partial_sort.qbk
==============================================================================
--- trunk/libs/range/doc/reference/algorithm/partial_sort.qbk (original)
+++ trunk/libs/range/doc/reference/algorithm/partial_sort.qbk 2010-04-11 18:05:02 EDT (Sun, 11 Apr 2010)
@@ -4,22 +4,26 @@
``
template<class RandomAccessRange>
-void partial_sort(RandomAccessRange& rng,
- typename range_iterator<RandomAccessRange>::type middle);
-
+RandomAccessRange& partial_sort(
+ RandomAccessRange& rng,
+ typename range_iterator<RandomAccessRange>::type middle);
+
template<class RandomAccessRange>
-void partial_sort(const RandomAccessRange& rng,
- typename range_iterator<const RandomAccessRange>::type middle);
-
+const RandomAccessRange& partial_sort(
+ const RandomAccessRange& rng,
+ typename range_iterator<const RandomAccessRange>::type middle);
+
template<class RandomAccessRange>
-void partial_sort(RandomAccessRange& rng,
- typename range_iterator<RandomAccessRange>::type middle,
- BinaryPredicate sort_pred);
-
+RandomAccessRange& partial_sort(
+ RandomAccessRange& rng,
+ typename range_iterator<RandomAccessRange>::type middle,
+ BinaryPredicate sort_pred);
+
template<class RandomAccessRange>
-void partial_sort(const RandomAccessRange& rng,
- typename range_iterator<const RandomAccessRange>::type middle,
- BinaryPredicate sort_pred);
+const RandomAccessRange& partial_sort(
+ const RandomAccessRange& rng,
+ typename range_iterator<const RandomAccessRange>::type middle,
+ BinaryPredicate sort_pred);
``
[heading Description]
Modified: trunk/libs/range/doc/reference/algorithm/pop_heap.qbk
==============================================================================
--- trunk/libs/range/doc/reference/algorithm/pop_heap.qbk (original)
+++ trunk/libs/range/doc/reference/algorithm/pop_heap.qbk 2010-04-11 18:05:02 EDT (Sun, 11 Apr 2010)
@@ -4,16 +4,16 @@
``
template<class RandomAccessRange>
-void pop_heap(RandomAccessRange& rng);
+RandomAccessRange& pop_heap(RandomAccessRange& rng);
template<class RandomAccessRange>
-void pop_heap(const RandomAccessRange& rng);
+const RandomAccessRange& pop_heap(const RandomAccessRange& rng);
template<class RandomAccessRange, class Compare>
-void pop_heap(RandomAccessRange& rng, Compare pred);
+RandomAccessRange& pop_heap(RandomAccessRange& rng, Compare pred);
template<class RandomAccessRange, class Compare>
-void pop_heap(const RandomAccessRange& rng, Compare pred);
+const RandomAccessRange& pop_heap(const RandomAccessRange& rng, Compare pred);
``
[heading Description]
@@ -21,7 +21,7 @@
`pop_heap` removes the largest element from the heap. It is assumed that `begin(rng), prior(end(rng))` is already a heap and that the element to be added is `*prior(end(rng))`.
The ordering relationship is determined by using `operator<` in the non-predicate versions, and by evaluating `pred` in the predicate versions.
-
+
[heading Definition]
Defined in the header file `boost/range/algorithm/heap_algorithm.hpp`
Modified: trunk/libs/range/doc/reference/algorithm/prev_permutation.qbk
==============================================================================
--- trunk/libs/range/doc/reference/algorithm/prev_permutation.qbk (original)
+++ trunk/libs/range/doc/reference/algorithm/prev_permutation.qbk 2010-04-11 18:05:02 EDT (Sun, 11 Apr 2010)
@@ -4,16 +4,16 @@
``
template<class BidirectionalRange>
-void prev_permutation(BidirectionalRange& rng);
+bool prev_permutation(BidirectionalRange& rng);
template<class BidirectionalRange>
-void prev_permutation(const BidirectionalRange& rng);
+bool prev_permutation(const BidirectionalRange& rng);
template<class BidirectionalRange, class Compare>
-void prev_permutation(BidirectionalRange& rng, Compare pred);
+bool prev_permutation(BidirectionalRange& rng, Compare pred);
template<class BidirectionalRange, class Compare>
-void prev_permutation(const BidirectionalRange& rng, Compare pred);
+bool prev_permutation(const BidirectionalRange& rng, Compare pred);
``
[heading Description]
@@ -21,7 +21,7 @@
`prev_permutation` transforms the range of elements `rng` into the lexicographically next smaller permutation of the elements if such a permutation exists. If one does not exist then the range is transformed into the lexicographically largest permutation and `false` is returned. `true` is returned when the next smaller permutation is successfully generated.
The ordering relationship is determined by using `operator<` in the non-predicate versions, and by evaluating `pred` in the predicate versions.
-
+
[heading Definition]
Defined in the header file `boost/range/algorithm/permutation.hpp`
Modified: trunk/libs/range/doc/reference/algorithm/push_heap.qbk
==============================================================================
--- trunk/libs/range/doc/reference/algorithm/push_heap.qbk (original)
+++ trunk/libs/range/doc/reference/algorithm/push_heap.qbk 2010-04-11 18:05:02 EDT (Sun, 11 Apr 2010)
@@ -4,16 +4,16 @@
``
template<class RandomAccessRange>
-void push_heap(RandomAccessRange& rng);
+RandomAccessRange& push_heap(RandomAccessRange& rng);
template<class RandomAccessRange>
-void push_heap(const RandomAccessRange& rng);
+const RandomAccessRange& push_heap(const RandomAccessRange& rng);
template<class RandomAccessRange, class Compare>
-void push_heap(RandomAccessRange& rng, Compare pred);
+RandomAccessRange& push_heap(RandomAccessRange& rng, Compare pred);
template<class RandomAccessRange, class Compare>
-void push_heap(const RandomAccessRange& rng, Compare pred);
+const RandomAccessRange& push_heap(const RandomAccessRange& rng, Compare pred);
``
[heading Description]
@@ -21,7 +21,7 @@
`push_heap` adds an element to a heap. It is assumed that `begin(rng)`, `prior(end(rng))` is already a heap and that the element to be added is `*prior(end(rng))`.
The ordering relationship is determined by using `operator<` in the non-predicate versions, and by evaluating `pred` in the predicate versions.
-
+
[heading Definition]
Defined in the header file `boost/range/algorithm/heap_algorithm.hpp`
Modified: trunk/libs/range/doc/reference/algorithm/sort_heap.qbk
==============================================================================
--- trunk/libs/range/doc/reference/algorithm/sort_heap.qbk (original)
+++ trunk/libs/range/doc/reference/algorithm/sort_heap.qbk 2010-04-11 18:05:02 EDT (Sun, 11 Apr 2010)
@@ -4,16 +4,16 @@
``
template<class RandomAccessRange>
-void sort_heap(RandomAccessRange& rng);
+RandomAccessRange& sort_heap(RandomAccessRange& rng);
template<class RandomAccessRange>
-void sort_heap(const RandomAccessRange& rng);
+const RandomAccessRange& sort_heap(const RandomAccessRange& rng);
template<class RandomAccessRange, class Compare>
-void sort_heap(RandomAccessRange& rng, Compare pred);
+RandomAccessRange& sort_heap(RandomAccessRange& rng, Compare pred);
template<class RandomAccessRange, class Compare>
-void sort_heap(const RandomAccessRange& rng, Compare pred);
+const RandomAccessRange& sort_heap(const RandomAccessRange& rng, Compare pred);
``
[heading Description]
@@ -21,7 +21,7 @@
`sort_heap` turns a heap into a sorted range.
The ordering relationship is determined by using `operator<` in the non-predicate versions, and by evaluating `pred` in the predicate versions.
-
+
[heading Definition]
Defined in the header file `boost/range/algorithm/heap_algorithm.hpp`
Modified: trunk/libs/range/doc/reference/algorithm_ext/erase.qbk
==============================================================================
--- trunk/libs/range/doc/reference/algorithm_ext/erase.qbk (original)
+++ trunk/libs/range/doc/reference/algorithm_ext/erase.qbk 2010-04-11 18:05:02 EDT (Sun, 11 Apr 2010)
@@ -3,18 +3,20 @@
[heading Prototype]
``
-template<
- class Container,
- class SinglePassRange
- >
-void erase(Container& target,
- iterator_range<typename Container::iterator> to_erase);
+template<class Container>
+Container& erase(
+ Container& target,
+ iterator_range<typename Container::iterator> to_erase);
``
[heading Description]
`erase` the iterator range `to_erase` from the container `target`.
+`remove_erase` performs the frequently used combination equivalent to `target.erase(std::remove(target.begin(), target.end(), value), target.end());`
+
+`remove_erase_if` performs the frequently used combination equivalent to `target.erase(std::remove_if(target.begin(), target.end(), pred), target.end());`
+
[heading Definition]
Defined in the header file `boost/range/algorithm_ext/erase.hpp`
Modified: trunk/libs/range/doc/reference/algorithm_ext/insert.qbk
==============================================================================
--- trunk/libs/range/doc/reference/algorithm_ext/insert.qbk (original)
+++ trunk/libs/range/doc/reference/algorithm_ext/insert.qbk 2010-04-11 18:05:02 EDT (Sun, 11 Apr 2010)
@@ -7,9 +7,9 @@
class Container,
class SinglePassRange
>
-void insert(Container& target,
- typename Container::iterator before,
- const SinglePassRange& from);
+Container& insert(Container& target,
+ typename Container::iterator before,
+ const SinglePassRange& from);
``
[heading Description]
Modified: trunk/libs/range/doc/reference/algorithm_ext/iota.qbk
==============================================================================
--- trunk/libs/range/doc/reference/algorithm_ext/iota.qbk (original)
+++ trunk/libs/range/doc/reference/algorithm_ext/iota.qbk 2010-04-11 18:05:02 EDT (Sun, 11 Apr 2010)
@@ -3,8 +3,8 @@
[heading Prototype]
``
-template<class SinglePassRange, class Value>
-iota(SinglePassRange& rng, Value x);
+template<class ForwardRange, class Value>
+ForwardRange& iota(ForwardRange& rng, Value x);
``
[heading Description]
@@ -18,7 +18,7 @@
[heading Requirements]
-# `SinglePassRange` is a model of the __single_pass_range__ Concept.
+# `ForwardRange` is a model of the __forward_range__ Concept.
# `Value` is a model of the `Incrementable` Concept.
[heading Complexity]
Modified: trunk/libs/range/doc/reference/algorithm_ext/push_back.qbk
==============================================================================
--- trunk/libs/range/doc/reference/algorithm_ext/push_back.qbk (original)
+++ trunk/libs/range/doc/reference/algorithm_ext/push_back.qbk 2010-04-11 18:05:02 EDT (Sun, 11 Apr 2010)
@@ -7,8 +7,8 @@
class Container,
class SinglePassRange
>
-void push_back(Container& target,
- const SinglePassRange& from);
+Container& push_back(Container& target,
+ const SinglePassRange& from);
``
[heading Description]
Modified: trunk/libs/range/doc/reference/algorithm_ext/push_front.qbk
==============================================================================
--- trunk/libs/range/doc/reference/algorithm_ext/push_front.qbk (original)
+++ trunk/libs/range/doc/reference/algorithm_ext/push_front.qbk 2010-04-11 18:05:02 EDT (Sun, 11 Apr 2010)
@@ -7,8 +7,8 @@
class Container,
class SinglePassRange
>
-void push_front(Container& target,
- const SinglePassRange& from);
+Container& push_front(Container& target,
+ const SinglePassRange& from);
``
[heading Description]
Modified: trunk/libs/range/doc/reference/algorithm_ext/remove_erase.qbk
==============================================================================
--- trunk/libs/range/doc/reference/algorithm_ext/remove_erase.qbk (original)
+++ trunk/libs/range/doc/reference/algorithm_ext/remove_erase.qbk 2010-04-11 18:05:02 EDT (Sun, 11 Apr 2010)
@@ -3,17 +3,14 @@
[heading Prototype]
``
-template<
- class Container,
- class T
- >
-void remove_erase(Container& target,
- const T& val);
+template<class Container, class Value>
+Container& remove_erase(Container& target,
+ const Value& value);
``
[heading Description]
-`remove_erase` actually eliminates the elements equal to `val` from the container. This
+`remove_erase` actually eliminates the elements equal to `value` from the container. This
is in contrast to the `remove` algorithm which merely rearranges elements.
[heading Definition]
Modified: trunk/libs/range/doc/reference/algorithm_ext/remove_erase_if.qbk
==============================================================================
--- trunk/libs/range/doc/reference/algorithm_ext/remove_erase_if.qbk (original)
+++ trunk/libs/range/doc/reference/algorithm_ext/remove_erase_if.qbk 2010-04-11 18:05:02 EDT (Sun, 11 Apr 2010)
@@ -3,12 +3,9 @@
[heading Prototype]
``
-template<
- class Container,
- class Pred
- >
-void remove_erase(Container& target,
- Pred pred);
+template<class Container, class Pred>
+Container& remove_erase_if(Container& target,
+ Pred pred);
``
[heading Description]
Modified: trunk/libs/range/doc/reference/algorithms.qbk
==============================================================================
--- trunk/libs/range/doc/reference/algorithms.qbk (original)
+++ trunk/libs/range/doc/reference/algorithms.qbk 2010-04-11 18:05:02 EDT (Sun, 11 Apr 2010)
@@ -82,6 +82,7 @@
[include algorithm/copy.qbk]
[include algorithm/copy_backward.qbk]
[include algorithm/fill.qbk]
+[include algorithm/fill_n.qbk]
[include algorithm/generate.qbk]
[include algorithm/inplace_merge.qbk]
[include algorithm/merge.qbk]
@@ -133,6 +134,7 @@
[include algorithm/push_heap.qbk]
[include algorithm/pop_heap.qbk]
[include algorithm/make_heap.qbk]
+[include algorithm/sort_heap.qbk]
[endsect]
[section:permutation_algorithms Permutation algorithms]
Boost-Commit list run by bdawes at acm.org, david.abrahams at rcn.com, gregod at cs.rpi.edu, cpdaniel at pacbell.net, john at johnmaddock.co.uk