|
|
Boost-Commit : |
Subject: [Boost-commit] svn:boost r61517 - in branches/release: boost/range boost/range/adaptor boost/range/algorithm boost/range/algorithm_ext boost/range/detail libs/range libs/range/doc libs/range/doc/html libs/range/doc/html/range libs/range/doc/html/range/concepts libs/range/doc/html/range/mfc_atl libs/range/doc/html/range/reference libs/range/doc/html/range/reference/adaptors libs/range/doc/html/range/reference/adaptors/adaptors_reference 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/extending libs/range/doc/html/range/reference/extending/method_3 libs/range/doc/html/range/reference/ranges libs/range/doc/html/range/reference/semantics libs/range/doc/html/range/upgrade libs/range/doc/html/range/utilities libs/range/doc/reference libs/range/doc/reference/algorithm libs/range/doc/reference/algorithm_ext libs/range/test libs/range/test/adaptor_test libs/range/test/algorithm_ext_test libs/range/test/algorithm_test libs/range/test/test_driver
From: neil_at_[hidden]
Date: 2010-04-23 18:51:20
Author: neilgroves
Date: 2010-04-23 18:50:56 EDT (Fri, 23 Apr 2010)
New Revision: 61517
URL: http://svn.boost.org/trac/boost/changeset/61517
Log:
Boost.Range merge from trunk to release.
This is motivated by the need to correct the istream_range, to correct the adaptors.hpp header file, and correct the return types of various range algorithms.
Added:
branches/release/libs/range/doc/html/range/reference/algorithms/heap_algorithms/sort_heap.html
- copied unchanged from r61211, /trunk/libs/range/doc/html/range/reference/algorithms/heap_algorithms/sort_heap.html
branches/release/libs/range/doc/html/range/reference/algorithms/range_algorithm_mutating_algorithms/fill_n.html
- copied unchanged from r61211, /trunk/libs/range/doc/html/range/reference/algorithms/range_algorithm_mutating_algorithms/fill_n.html
branches/release/libs/range/doc/reference/algorithm/fill_n.qbk
- copied unchanged from r61211, /trunk/libs/range/doc/reference/algorithm/fill_n.qbk
branches/release/libs/range/test/adaptor_test/strided2.cpp
- copied unchanged from r61404, /trunk/libs/range/test/adaptor_test/strided2.cpp
branches/release/libs/range/test/istream_range.cpp
- copied unchanged from r61350, /trunk/libs/range/test/istream_range.cpp
branches/release/libs/range/test/pointer_as_iterator.cpp
- copied unchanged from r61275, /trunk/libs/range/test/pointer_as_iterator.cpp
Removed:
branches/release/boost/range/unbounded_range.hpp
branches/release/libs/range/doc/counting_range.html
Properties modified:
branches/release/boost/range/ (props changed)
branches/release/libs/range/ (props changed)
Text files modified:
branches/release/boost/range/adaptor/adjacent_filtered.hpp | 312 +++++++++++++++++++-------------------
branches/release/boost/range/adaptor/argument_fwd.hpp | 98 ++++++------
branches/release/boost/range/adaptor/copied.hpp | 54 +++---
branches/release/boost/range/adaptor/filtered.hpp | 138 ++++++++--------
branches/release/boost/range/adaptor/indexed.hpp | 136 ++++++++--------
branches/release/boost/range/adaptor/indirected.hpp | 108 ++++++------
branches/release/boost/range/adaptor/map.hpp | 314 ++++++++++++++++++++--------------------
branches/release/boost/range/adaptor/replaced.hpp | 182 +++++++++++-----------
branches/release/boost/range/adaptor/replaced_if.hpp | 210 +++++++++++++-------------
branches/release/boost/range/adaptor/reversed.hpp | 130 ++++++++--------
branches/release/boost/range/adaptor/strided.hpp | 242 +++++++++++++++---------------
branches/release/boost/range/adaptor/tokenized.hpp | 224 ++++++++++++++--------------
branches/release/boost/range/adaptor/transformed.hpp | 158 ++++++++++----------
branches/release/boost/range/adaptor/uniqued.hpp | 134 ++++++++--------
branches/release/boost/range/adaptors.hpp | 3
branches/release/boost/range/algorithm/equal.hpp | 2
branches/release/boost/range/algorithm/generate.hpp | 9 -
branches/release/boost/range/algorithm/heap_algorithm.hpp | 88 ++---------
branches/release/boost/range/algorithm/nth_element.hpp | 16 +
branches/release/boost/range/algorithm/partial_sort.hpp | 25 --
branches/release/boost/range/algorithm/partial_sort_copy.hpp | 16 -
branches/release/boost/range/algorithm/partition.hpp | 20 --
branches/release/boost/range/algorithm/random_shuffle.hpp | 18 --
branches/release/boost/range/algorithm/remove.hpp | 20 --
branches/release/boost/range/algorithm/remove_copy_if.hpp | 2
branches/release/boost/range/algorithm/remove_if.hpp | 20 --
branches/release/boost/range/algorithm/replace.hpp | 11 -
branches/release/boost/range/algorithm/replace_if.hpp | 11 -
branches/release/boost/range/algorithm/reverse.hpp | 9 -
branches/release/boost/range/algorithm/reverse_copy.hpp | 10 -
branches/release/boost/range/algorithm/rotate.hpp | 15 -
branches/release/boost/range/algorithm/rotate_copy.hpp | 6
branches/release/boost/range/algorithm/search.hpp | 14 -
branches/release/boost/range/algorithm/search_n.hpp | 50 +++---
branches/release/boost/range/algorithm/sort.hpp | 18 --
branches/release/boost/range/algorithm/stable_sort.hpp | 18 --
branches/release/boost/range/algorithm/swap_ranges.hpp | 12
branches/release/boost/range/algorithm_ext/for_each.hpp | 80 +++++-----
branches/release/boost/range/counting_range.hpp | 58 +++---
branches/release/boost/range/detail/demote_iterator_traversal_tag.hpp | 8
branches/release/boost/range/istream_range.hpp | 23 +-
branches/release/boost/range/join.hpp | 48 +++---
branches/release/boost/range/numeric.hpp | 116 +++++++-------
branches/release/boost/range/size_type.hpp | 2
branches/release/libs/range/doc/headers.qbk | 2
branches/release/libs/range/doc/html/index.html | 6
branches/release/libs/range/doc/html/quickbook_HTML.manifest | 2
branches/release/libs/range/doc/html/range/concepts.html | 2
branches/release/libs/range/doc/html/range/concepts/bidirectional_range.html | 18 +-
branches/release/libs/range/doc/html/range/concepts/concept_checking.html | 4
branches/release/libs/range/doc/html/range/concepts/forward_range.html | 12
branches/release/libs/range/doc/html/range/concepts/overview.html | 2
branches/release/libs/range/doc/html/range/concepts/random_access_range.html | 14
branches/release/libs/range/doc/html/range/concepts/single_pass_range.html | 18 +-
branches/release/libs/range/doc/html/range/examples.html | 2
branches/release/libs/range/doc/html/range/faq.html | 2
branches/release/libs/range/doc/html/range/history_ack.html | 2
branches/release/libs/range/doc/html/range/introduction.html | 2
branches/release/libs/range/doc/html/range/library_headers.html | 6
branches/release/libs/range/doc/html/range/mfc_atl.html | 6
branches/release/libs/range/doc/html/range/mfc_atl/atl_ranges.html | 2
branches/release/libs/range/doc/html/range/mfc_atl/const_ranges.html | 2
branches/release/libs/range/doc/html/range/mfc_atl/mfc_ranges.html | 2
branches/release/libs/range/doc/html/range/mfc_atl/references.html | 2
branches/release/libs/range/doc/html/range/mfc_atl/requirements.html | 2
branches/release/libs/range/doc/html/range/portability.html | 2
branches/release/libs/range/doc/html/range/reference.html | 2
branches/release/libs/range/doc/html/range/reference/adaptors.html | 2
branches/release/libs/range/doc/html/range/reference/adaptors/adaptors_general_requirements.html | 2
branches/release/libs/range/doc/html/range/reference/adaptors/adaptors_introduction.html | 8
branches/release/libs/range/doc/html/range/reference/adaptors/adaptors_reference.html | 2
branches/release/libs/range/doc/html/range/reference/adaptors/adaptors_reference/adjacent_filtered.html | 2
branches/release/libs/range/doc/html/range/reference/adaptors/adaptors_reference/copied.html | 2
branches/release/libs/range/doc/html/range/reference/adaptors/adaptors_reference/filtered.html | 2
branches/release/libs/range/doc/html/range/reference/adaptors/adaptors_reference/indexed.html | 2
branches/release/libs/range/doc/html/range/reference/adaptors/adaptors_reference/indirected.html | 2
branches/release/libs/range/doc/html/range/reference/adaptors/adaptors_reference/map_keys.html | 2
branches/release/libs/range/doc/html/range/reference/adaptors/adaptors_reference/map_values.html | 2
branches/release/libs/range/doc/html/range/reference/adaptors/adaptors_reference/replaced.html | 2
branches/release/libs/range/doc/html/range/reference/adaptors/adaptors_reference/replaced_if.html | 2
branches/release/libs/range/doc/html/range/reference/adaptors/adaptors_reference/reversed.html | 2
branches/release/libs/range/doc/html/range/reference/adaptors/adaptors_reference/sliced.html | 2
branches/release/libs/range/doc/html/range/reference/adaptors/adaptors_reference/strided.html | 2
branches/release/libs/range/doc/html/range/reference/adaptors/adaptors_reference/tokenized.html | 2
branches/release/libs/range/doc/html/range/reference/adaptors/adaptors_reference/transformed.html | 2
branches/release/libs/range/doc/html/range/reference/adaptors/adaptors_reference/uniqued.html | 2
branches/release/libs/range/doc/html/range/reference/adaptors/adaptors_synopsis.html | 2
branches/release/libs/range/doc/html/range/reference/algorithms.html | 2
branches/release/libs/range/doc/html/range/reference/algorithms/heap_algorithms.html | 4
branches/release/libs/range/doc/html/range/reference/algorithms/heap_algorithms/make_heap.html | 26 +-
branches/release/libs/range/doc/html/range/reference/algorithms/heap_algorithms/pop_heap.html | 22 +-
branches/release/libs/range/doc/html/range/reference/algorithms/heap_algorithms/push_heap.html | 22 +-
branches/release/libs/range/doc/html/range/reference/algorithms/permutation_algorithms.html | 8
branches/release/libs/range/doc/html/range/reference/algorithms/permutation_algorithms/next_permutation.html | 20 +-
branches/release/libs/range/doc/html/range/reference/algorithms/permutation_algorithms/prev_permutation.html | 20 +-
branches/release/libs/range/doc/html/range/reference/algorithms/range_algorithm_introduction.html | 2
branches/release/libs/range/doc/html/range/reference/algorithms/range_algorithm_mutating_algorithms.html | 4
branches/release/libs/range/doc/html/range/reference/algorithms/range_algorithm_mutating_algorithms/copy.html | 14
branches/release/libs/range/doc/html/range/reference/algorithms/range_algorithm_mutating_algorithms/copy_backward.html | 14
branches/release/libs/range/doc/html/range/reference/algorithms/range_algorithm_mutating_algorithms/fill.html | 23 +-
branches/release/libs/range/doc/html/range/reference/algorithms/range_algorithm_mutating_algorithms/generate.html | 20 +-
branches/release/libs/range/doc/html/range/reference/algorithms/range_algorithm_mutating_algorithms/inplace_merge.html | 18 +-
branches/release/libs/range/doc/html/range/reference/algorithms/range_algorithm_mutating_algorithms/merge.html | 18 +-
branches/release/libs/range/doc/html/range/reference/algorithms/range_algorithm_mutating_algorithms/nth_element.html | 42 ++--
branches/release/libs/range/doc/html/range/reference/algorithms/range_algorithm_mutating_algorithms/partial_sort.html | 42 ++--
branches/release/libs/range/doc/html/range/reference/algorithms/range_algorithm_mutating_algorithms/partition.html | 12
branches/release/libs/range/doc/html/range/reference/algorithms/range_algorithm_mutating_algorithms/random_shuffle.html | 14
branches/release/libs/range/doc/html/range/reference/algorithms/range_algorithm_mutating_algorithms/remove.html | 12
branches/release/libs/range/doc/html/range/reference/algorithms/range_algorithm_mutating_algorithms/remove_if.html | 12
branches/release/libs/range/doc/html/range/reference/algorithms/range_algorithm_mutating_algorithms/replace.html | 12
branches/release/libs/range/doc/html/range/reference/algorithms/range_algorithm_mutating_algorithms/replace_if.html | 12
branches/release/libs/range/doc/html/range/reference/algorithms/range_algorithm_mutating_algorithms/rotate.html | 14
branches/release/libs/range/doc/html/range/reference/algorithms/range_algorithm_mutating_algorithms/sort.html | 12
branches/release/libs/range/doc/html/range/reference/algorithms/range_algorithm_mutating_algorithms/stable_partition.html | 12
branches/release/libs/range/doc/html/range/reference/algorithms/range_algorithm_mutating_algorithms/stable_sort.html | 12
branches/release/libs/range/doc/html/range/reference/algorithms/range_algorithm_mutating_algorithms/transform.html | 14
branches/release/libs/range/doc/html/range/reference/algorithms/range_algorithm_mutating_algorithms/unique.html | 12
branches/release/libs/range/doc/html/range/reference/algorithms/range_algorithm_new_algorithms.html | 2
branches/release/libs/range/doc/html/range/reference/algorithms/range_algorithm_new_algorithms/erase.html | 30 ++-
branches/release/libs/range/doc/html/range/reference/algorithms/range_algorithm_new_algorithms/for_each.html | 12
branches/release/libs/range/doc/html/range/reference/algorithms/range_algorithm_new_algorithms/insert.html | 18 +-
branches/release/libs/range/doc/html/range/reference/algorithms/range_algorithm_new_algorithms/iota.html | 22 +-
branches/release/libs/range/doc/html/range/reference/algorithms/range_algorithm_new_algorithms/overwrite.html | 12
branches/release/libs/range/doc/html/range/reference/algorithms/range_algorithm_new_algorithms/push_back.html | 16 +-
branches/release/libs/range/doc/html/range/reference/algorithms/range_algorithm_new_algorithms/push_front.html | 16 +-
branches/release/libs/range/doc/html/range/reference/algorithms/range_algorithm_new_algorithms/remove_erase.html | 23 +-
branches/release/libs/range/doc/html/range/reference/algorithms/range_algorithm_new_algorithms/remove_erase_if.html | 21 +-
branches/release/libs/range/doc/html/range/reference/algorithms/range_algorithm_non_mutating_algorithms.html | 2
branches/release/libs/range/doc/html/range/reference/algorithms/range_algorithm_non_mutating_algorithms/adjacent_find.html | 12
branches/release/libs/range/doc/html/range/reference/algorithms/range_algorithm_non_mutating_algorithms/binary_search.html | 14
branches/release/libs/range/doc/html/range/reference/algorithms/range_algorithm_non_mutating_algorithms/count.html | 12
branches/release/libs/range/doc/html/range/reference/algorithms/range_algorithm_non_mutating_algorithms/equal.html | 12
branches/release/libs/range/doc/html/range/reference/algorithms/range_algorithm_non_mutating_algorithms/equal_range.html | 14
branches/release/libs/range/doc/html/range/reference/algorithms/range_algorithm_non_mutating_algorithms/find.html | 12
branches/release/libs/range/doc/html/range/reference/algorithms/range_algorithm_non_mutating_algorithms/find_end.html | 12
branches/release/libs/range/doc/html/range/reference/algorithms/range_algorithm_non_mutating_algorithms/find_first_of.html | 12
branches/release/libs/range/doc/html/range/reference/algorithms/range_algorithm_non_mutating_algorithms/find_if.html | 14
branches/release/libs/range/doc/html/range/reference/algorithms/range_algorithm_non_mutating_algorithms/for_each.html | 12
branches/release/libs/range/doc/html/range/reference/algorithms/range_algorithm_non_mutating_algorithms/lexicographical_compare.html | 12
branches/release/libs/range/doc/html/range/reference/algorithms/range_algorithm_non_mutating_algorithms/lower_bound.html | 14
branches/release/libs/range/doc/html/range/reference/algorithms/range_algorithm_non_mutating_algorithms/max_element.html | 12
branches/release/libs/range/doc/html/range/reference/algorithms/range_algorithm_non_mutating_algorithms/min_element.html | 12
branches/release/libs/range/doc/html/range/reference/algorithms/range_algorithm_non_mutating_algorithms/mismatch.html | 14
branches/release/libs/range/doc/html/range/reference/algorithms/range_algorithm_non_mutating_algorithms/search.html | 12
branches/release/libs/range/doc/html/range/reference/algorithms/range_algorithm_non_mutating_algorithms/upper_bound.html | 14
branches/release/libs/range/doc/html/range/reference/algorithms/range_numeric.html | 2
branches/release/libs/range/doc/html/range/reference/algorithms/range_numeric/accumulate.html | 16 +-
branches/release/libs/range/doc/html/range/reference/algorithms/range_numeric/adjacent_difference.html | 18 +-
branches/release/libs/range/doc/html/range/reference/algorithms/range_numeric/inner_product.html | 18 +-
branches/release/libs/range/doc/html/range/reference/algorithms/range_numeric/partial_sum.html | 18 +-
branches/release/libs/range/doc/html/range/reference/algorithms/set_algorithms.html | 2
branches/release/libs/range/doc/html/range/reference/algorithms/set_algorithms/includes.html | 14
branches/release/libs/range/doc/html/range/reference/algorithms/set_algorithms/set_difference.html | 14
branches/release/libs/range/doc/html/range/reference/algorithms/set_algorithms/set_intersection.html | 14
branches/release/libs/range/doc/html/range/reference/algorithms/set_algorithms/set_symmetric_difference.html | 14
branches/release/libs/range/doc/html/range/reference/algorithms/set_algorithms/set_union.html | 14
branches/release/libs/range/doc/html/range/reference/extending.html | 2
branches/release/libs/range/doc/html/range/reference/extending/method_1.html | 2
branches/release/libs/range/doc/html/range/reference/extending/method_2.html | 2
branches/release/libs/range/doc/html/range/reference/extending/method_3.html | 2
branches/release/libs/range/doc/html/range/reference/extending/method_3/method_3_1.html | 2
branches/release/libs/range/doc/html/range/reference/extending/method_3/method_3_2.html | 2
branches/release/libs/range/doc/html/range/reference/overview.html | 2
branches/release/libs/range/doc/html/range/reference/ranges.html | 2
branches/release/libs/range/doc/html/range/reference/ranges/counting_range.html | 10
branches/release/libs/range/doc/html/range/reference/ranges/irange.html | 12
branches/release/libs/range/doc/html/range/reference/ranges/istream_range.html | 8
branches/release/libs/range/doc/html/range/reference/semantics.html | 4
branches/release/libs/range/doc/html/range/reference/semantics/functions.html | 2
branches/release/libs/range/doc/html/range/reference/semantics/metafunctions.html | 2
branches/release/libs/range/doc/html/range/reference/synopsis.html | 2
branches/release/libs/range/doc/html/range/style_guide.html | 2
branches/release/libs/range/doc/html/range/upgrade.html | 2
branches/release/libs/range/doc/html/range/upgrade/upgrade_from_1_34.html | 2
branches/release/libs/range/doc/html/range/upgrade/upgrade_from_1_42.html | 2
branches/release/libs/range/doc/html/range/utilities.html | 2
branches/release/libs/range/doc/html/range/utilities/iterator_range.html | 8
branches/release/libs/range/doc/html/range/utilities/join.html | 6
branches/release/libs/range/doc/html/range/utilities/sub_range.html | 4
branches/release/libs/range/doc/reference/algorithm/fill.qbk | 5
branches/release/libs/range/doc/reference/algorithm/make_heap.qbk | 10
branches/release/libs/range/doc/reference/algorithm/next_permutation.qbk | 10
branches/release/libs/range/doc/reference/algorithm/nth_element.qbk | 30 ++-
branches/release/libs/range/doc/reference/algorithm/partial_sort.qbk | 30 ++-
branches/release/libs/range/doc/reference/algorithm/pop_heap.qbk | 10
branches/release/libs/range/doc/reference/algorithm/prev_permutation.qbk | 10
branches/release/libs/range/doc/reference/algorithm/push_heap.qbk | 10
branches/release/libs/range/doc/reference/algorithm/sort_heap.qbk | 10
branches/release/libs/range/doc/reference/algorithm_ext/erase.qbk | 14 +
branches/release/libs/range/doc/reference/algorithm_ext/insert.qbk | 6
branches/release/libs/range/doc/reference/algorithm_ext/iota.qbk | 6
branches/release/libs/range/doc/reference/algorithm_ext/push_back.qbk | 4
branches/release/libs/range/doc/reference/algorithm_ext/push_front.qbk | 4
branches/release/libs/range/doc/reference/algorithm_ext/remove_erase.qbk | 11
branches/release/libs/range/doc/reference/algorithm_ext/remove_erase_if.qbk | 9
branches/release/libs/range/doc/reference/algorithms.qbk | 2
branches/release/libs/range/test/Jamfile.v2 | 3
branches/release/libs/range/test/adaptor_test/adjacent_filtered_example.cpp | 2
branches/release/libs/range/test/adaptor_test/copied_example.cpp | 2
branches/release/libs/range/test/algorithm_ext_test/push_front.cpp | 17 +
branches/release/libs/range/test/algorithm_test/find.cpp | 20 +-
branches/release/libs/range/test/algorithm_test/find_end.cpp | 38 ++--
branches/release/libs/range/test/algorithm_test/find_first_of.cpp | 38 ++--
branches/release/libs/range/test/algorithm_test/find_if.cpp | 20 +-
branches/release/libs/range/test/algorithm_test/for_each.cpp | 2
branches/release/libs/range/test/algorithm_test/lower_bound.cpp | 44 ++--
branches/release/libs/range/test/algorithm_test/max_element.cpp | 34 ++--
branches/release/libs/range/test/algorithm_test/min_element.cpp | 34 ++--
branches/release/libs/range/test/algorithm_test/partition.cpp | 18 +-
branches/release/libs/range/test/algorithm_test/stable_partition.cpp | 18 +-
branches/release/libs/range/test/algorithm_test/unique.cpp | 34 ++--
branches/release/libs/range/test/algorithm_test/upper_bound.cpp | 48 +++---
branches/release/libs/range/test/counting_range.cpp | 2
branches/release/libs/range/test/iterator_range.cpp | 2
branches/release/libs/range/test/test_driver/range_return_test_driver.hpp | 30 +-
215 files changed, 2406 insertions(+), 2618 deletions(-)
Modified: branches/release/boost/range/adaptor/adjacent_filtered.hpp
==============================================================================
--- branches/release/boost/range/adaptor/adjacent_filtered.hpp (original)
+++ branches/release/boost/range/adaptor/adjacent_filtered.hpp 2010-04-23 18:50:56 EDT (Fri, 23 Apr 2010)
@@ -28,11 +28,11 @@
namespace boost
{
- namespace range_detail
- {
- template< class Iter, class Pred, bool default_pass >
- class skip_iterator
- : public boost::iterator_adaptor<
+ namespace range_detail
+ {
+ template< class Iter, class Pred, bool default_pass >
+ class skip_iterator
+ : public boost::iterator_adaptor<
skip_iterator<Iter,Pred,default_pass>,
Iter,
BOOST_DEDUCED_TYPENAME std::iterator_traits<Iter>::value_type,
@@ -40,10 +40,10 @@
BOOST_DEDUCED_TYPENAME std::iterator_traits<Iter>::reference,
BOOST_DEDUCED_TYPENAME std::iterator_traits<Iter>::difference_type
>
- , private Pred
- {
- private:
- typedef boost::iterator_adaptor<
+ , private Pred
+ {
+ private:
+ typedef boost::iterator_adaptor<
skip_iterator<Iter,Pred,default_pass>,
Iter,
BOOST_DEDUCED_TYPENAME std::iterator_traits<Iter>::value_type,
@@ -52,9 +52,9 @@
BOOST_DEDUCED_TYPENAME std::iterator_traits<Iter>::difference_type
> base_t;
- public:
+ public:
typedef Pred pred_t;
- typedef Iter iter_t;
+ typedef Iter iter_t;
skip_iterator() : m_last() {}
@@ -66,169 +66,169 @@
move_to_next_valid();
}
- template<class OtherIter>
- skip_iterator( const skip_iterator<OtherIter, pred_t, default_pass>& other )
- : base_t(other.base())
- , pred_t(other)
- , m_last(other.m_last) {}
+ template<class OtherIter>
+ skip_iterator( const skip_iterator<OtherIter, pred_t, default_pass>& other )
+ : base_t(other.base())
+ , pred_t(other)
+ , m_last(other.m_last) {}
void move_to_next_valid()
- {
- iter_t& it = this->base_reference();
- pred_t& bi_pred = *this;
- if (it != m_last)
- {
- if (default_pass)
- {
- iter_t nxt = ::boost::next(it);
- while (nxt != m_last && !bi_pred(*it, *nxt))
- {
- ++it;
- ++nxt;
- }
- }
- else
- {
- iter_t nxt = ::boost::next(it);
- for(; nxt != m_last; ++it, ++nxt)
- {
- if (bi_pred(*it, *nxt))
- {
- break;
- }
- }
- if (nxt == m_last)
- {
- it = m_last;
- }
- }
- }
- }
-
- void increment()
- {
- iter_t& it = this->base_reference();
- BOOST_ASSERT( it != m_last );
- ++it;
- move_to_next_valid();
- }
+ {
+ iter_t& it = this->base_reference();
+ pred_t& bi_pred = *this;
+ if (it != m_last)
+ {
+ if (default_pass)
+ {
+ iter_t nxt = ::boost::next(it);
+ while (nxt != m_last && !bi_pred(*it, *nxt))
+ {
+ ++it;
+ ++nxt;
+ }
+ }
+ else
+ {
+ iter_t nxt = ::boost::next(it);
+ for(; nxt != m_last; ++it, ++nxt)
+ {
+ if (bi_pred(*it, *nxt))
+ {
+ break;
+ }
+ }
+ if (nxt == m_last)
+ {
+ it = m_last;
+ }
+ }
+ }
+ }
+
+ void increment()
+ {
+ iter_t& it = this->base_reference();
+ BOOST_ASSERT( it != m_last );
+ ++it;
+ move_to_next_valid();
+ }
iter_t m_last;
- };
+ };
- template< class P, class R, bool default_pass >
- struct adjacent_filter_range
- : iterator_range< skip_iterator<
- BOOST_DEDUCED_TYPENAME range_iterator<R>::type,
- P,
- default_pass
+ template< class P, class R, bool default_pass >
+ struct adjacent_filter_range
+ : iterator_range< skip_iterator<
+ BOOST_DEDUCED_TYPENAME range_iterator<R>::type,
+ P,
+ default_pass
>
>
- {
- private:
- typedef skip_iterator<
+ {
+ private:
+ typedef skip_iterator<
BOOST_DEDUCED_TYPENAME range_iterator<R>::type,
P,
default_pass
>
- skip_iter;
+ skip_iter;
+
+ typedef iterator_range<skip_iter>
+ base_range;
- typedef iterator_range<skip_iter>
- base_range;
+ typedef BOOST_DEDUCED_TYPENAME range_iterator<R>::type raw_iterator;
- typedef BOOST_DEDUCED_TYPENAME range_iterator<R>::type raw_iterator;
+ public:
+ adjacent_filter_range( const P& p, R& r )
+ : base_range( skip_iter( boost::begin(r), boost::end(r), p),
+ skip_iter( boost::end(r), boost::end(r), p) )
+ {
+ }
+ };
- public:
- adjacent_filter_range( const P& p, R& r )
- : base_range( skip_iter( boost::begin(r), boost::end(r), p),
- skip_iter( boost::end(r), boost::end(r), p) )
- {
- }
- };
-
- template< class T >
- struct adjacent_holder : holder<T>
- {
- adjacent_holder( T r ) : holder<T>(r)
- { }
- };
-
- template< class T >
- struct adjacent_excl_holder : holder<T>
- {
- adjacent_excl_holder( T r ) : holder<T>(r)
- { }
- };
-
- template< class ForwardRng, class BinPredicate >
- inline adjacent_filter_range<BinPredicate, ForwardRng, true>
- operator|( ForwardRng& r,
- const adjacent_holder<BinPredicate>& f )
- {
- return adjacent_filter_range<BinPredicate, ForwardRng, true>( f.val, r );
- }
-
- template< class ForwardRng, class BinPredicate >
- inline adjacent_filter_range<BinPredicate, const ForwardRng, true>
- operator|( const ForwardRng& r,
- const adjacent_holder<BinPredicate>& f )
- {
- return adjacent_filter_range<BinPredicate,
- const ForwardRng, true>( f.val, r );
- }
-
- template< class ForwardRng, class BinPredicate >
- inline adjacent_filter_range<BinPredicate, ForwardRng, false>
- operator|( ForwardRng& r,
- const adjacent_excl_holder<BinPredicate>& f )
- {
- return adjacent_filter_range<BinPredicate, ForwardRng, false>( f.val, r );
- }
-
- template< class ForwardRng, class BinPredicate >
- inline adjacent_filter_range<BinPredicate, ForwardRng, false>
- operator|( const ForwardRng& r,
- const adjacent_excl_holder<BinPredicate>& f )
- {
- return adjacent_filter_range<BinPredicate,
- const ForwardRng, false>( f.val, r );
- }
-
- } // 'range_detail'
-
- // Bring adjacent_filter_range into the boost namespace so that users of
- // this library may specify the return type of the '|' operator and
- // adjacent_filter()
- using range_detail::adjacent_filter_range;
-
- namespace adaptors
- {
- namespace
- {
- const range_detail::forwarder<range_detail::adjacent_holder>
+ template< class T >
+ struct adjacent_holder : holder<T>
+ {
+ adjacent_holder( T r ) : holder<T>(r)
+ { }
+ };
+
+ template< class T >
+ struct adjacent_excl_holder : holder<T>
+ {
+ adjacent_excl_holder( T r ) : holder<T>(r)
+ { }
+ };
+
+ template< class ForwardRng, class BinPredicate >
+ inline adjacent_filter_range<BinPredicate, ForwardRng, true>
+ operator|( ForwardRng& r,
+ const adjacent_holder<BinPredicate>& f )
+ {
+ return adjacent_filter_range<BinPredicate, ForwardRng, true>( f.val, r );
+ }
+
+ template< class ForwardRng, class BinPredicate >
+ inline adjacent_filter_range<BinPredicate, const ForwardRng, true>
+ operator|( const ForwardRng& r,
+ const adjacent_holder<BinPredicate>& f )
+ {
+ return adjacent_filter_range<BinPredicate,
+ const ForwardRng, true>( f.val, r );
+ }
+
+ template< class ForwardRng, class BinPredicate >
+ inline adjacent_filter_range<BinPredicate, ForwardRng, false>
+ operator|( ForwardRng& r,
+ const adjacent_excl_holder<BinPredicate>& f )
+ {
+ return adjacent_filter_range<BinPredicate, ForwardRng, false>( f.val, r );
+ }
+
+ template< class ForwardRng, class BinPredicate >
+ inline adjacent_filter_range<BinPredicate, ForwardRng, false>
+ operator|( const ForwardRng& r,
+ const adjacent_excl_holder<BinPredicate>& f )
+ {
+ return adjacent_filter_range<BinPredicate,
+ const ForwardRng, false>( f.val, r );
+ }
+
+ } // 'range_detail'
+
+ // Bring adjacent_filter_range into the boost namespace so that users of
+ // this library may specify the return type of the '|' operator and
+ // adjacent_filter()
+ using range_detail::adjacent_filter_range;
+
+ namespace adaptors
+ {
+ namespace
+ {
+ const range_detail::forwarder<range_detail::adjacent_holder>
adjacent_filtered =
range_detail::forwarder<range_detail::adjacent_holder>();
- const range_detail::forwarder<range_detail::adjacent_excl_holder>
- adjacent_filtered_excl =
- range_detail::forwarder<range_detail::adjacent_excl_holder>();
- }
-
- template<class ForwardRng, class BinPredicate>
- inline adjacent_filter_range<BinPredicate, ForwardRng, true>
- adjacent_filter(ForwardRng& rng, BinPredicate filter_pred)
- {
- return adjacent_filter_range<BinPredicate, ForwardRng, true>(filter_pred, rng);
- }
-
- template<class ForwardRng, class BinPredicate>
- inline adjacent_filter_range<BinPredicate, const ForwardRng, true>
- adjacent_filter(const ForwardRng& rng, BinPredicate filter_pred)
- {
- return adjacent_filter_range<BinPredicate, const ForwardRng, true>(filter_pred, rng);
- }
+ const range_detail::forwarder<range_detail::adjacent_excl_holder>
+ adjacent_filtered_excl =
+ range_detail::forwarder<range_detail::adjacent_excl_holder>();
+ }
+
+ template<class ForwardRng, class BinPredicate>
+ inline adjacent_filter_range<BinPredicate, ForwardRng, true>
+ adjacent_filter(ForwardRng& rng, BinPredicate filter_pred)
+ {
+ return adjacent_filter_range<BinPredicate, ForwardRng, true>(filter_pred, rng);
+ }
+
+ template<class ForwardRng, class BinPredicate>
+ inline adjacent_filter_range<BinPredicate, const ForwardRng, true>
+ adjacent_filter(const ForwardRng& rng, BinPredicate filter_pred)
+ {
+ return adjacent_filter_range<BinPredicate, const ForwardRng, true>(filter_pred, rng);
+ }
- } // 'adaptors'
+ } // 'adaptors'
}
Modified: branches/release/boost/range/adaptor/argument_fwd.hpp
==============================================================================
--- branches/release/boost/range/adaptor/argument_fwd.hpp (original)
+++ branches/release/boost/range/adaptor/argument_fwd.hpp 2010-04-23 18:50:56 EDT (Fri, 23 Apr 2010)
@@ -20,57 +20,57 @@
namespace boost
{
- namespace range_detail
- {
- template< class T >
- struct holder
- {
- T val;
- holder( T t ) : val(t)
- { }
- };
-
- template< class T >
- struct holder2
- {
- T val1, val2;
- holder2( T t, T u ) : val1(t), val2(u)
- { }
- };
-
- template< template<class> class Holder >
- struct forwarder
- {
- template< class T >
- Holder<T> operator()( T t ) const
- {
- return Holder<T>(t);
- }
- };
-
- template< template<class> class Holder >
- struct forwarder2
- {
- template< class T >
- Holder<T> operator()( T t, T u ) const
- {
- return Holder<T>(t,u);
- }
- };
-
- template< template<class,class> class Holder >
- struct forwarder2TU
- {
- template< class T, class U >
- Holder<T, U> operator()( T t, U u ) const
- {
- return Holder<T, U>(t, u);
- }
- };
+ namespace range_detail
+ {
+ template< class T >
+ struct holder
+ {
+ T val;
+ holder( T t ) : val(t)
+ { }
+ };
+
+ template< class T >
+ struct holder2
+ {
+ T val1, val2;
+ holder2( T t, T u ) : val1(t), val2(u)
+ { }
+ };
+
+ template< template<class> class Holder >
+ struct forwarder
+ {
+ template< class T >
+ Holder<T> operator()( T t ) const
+ {
+ return Holder<T>(t);
+ }
+ };
+
+ template< template<class> class Holder >
+ struct forwarder2
+ {
+ template< class T >
+ Holder<T> operator()( T t, T u ) const
+ {
+ return Holder<T>(t,u);
+ }
+ };
+
+ template< template<class,class> class Holder >
+ struct forwarder2TU
+ {
+ template< class T, class U >
+ Holder<T, U> operator()( T t, U u ) const
+ {
+ return Holder<T, U>(t, u);
+ }
+ };
- }
-
+ }
+
}
#ifdef BOOST_MSVC
Modified: branches/release/boost/range/adaptor/copied.hpp
==============================================================================
--- branches/release/boost/range/adaptor/copied.hpp (original)
+++ branches/release/boost/range/adaptor/copied.hpp 2010-04-23 18:50:56 EDT (Fri, 23 Apr 2010)
@@ -18,40 +18,40 @@
namespace boost
{
- namespace adaptors
- {
- struct copied
- {
- copied(std::size_t t_, std::size_t u_)
+ namespace adaptors
+ {
+ struct copied
+ {
+ copied(std::size_t t_, std::size_t u_)
: t(t_), u(u_) {}
std::size_t t;
std::size_t u;
- };
+ };
- template< class CopyableRandomAccessRng >
- inline CopyableRandomAccessRng
- operator|( const CopyableRandomAccessRng& r, const copied& f )
- {
- iterator_range<
- BOOST_DEDUCED_TYPENAME range_iterator<const
- CopyableRandomAccessRng>::type >
- temp( adaptors::slice( r, f.t, f.u ) );
- return CopyableRandomAccessRng( temp.begin(), temp.end() );
- }
-
- template<class CopyableRandomAccessRange>
- inline CopyableRandomAccessRange
- copy(const CopyableRandomAccessRange& rng, std::size_t t, std::size_t u)
- {
- iterator_range<
- BOOST_DEDUCED_TYPENAME range_iterator<const
- CopyableRandomAccessRange>::type> temp(
- adaptors::slice(rng, t, u));
+ template< class CopyableRandomAccessRng >
+ inline CopyableRandomAccessRng
+ operator|( const CopyableRandomAccessRng& r, const copied& f )
+ {
+ iterator_range<
+ BOOST_DEDUCED_TYPENAME range_iterator<const
+ CopyableRandomAccessRng>::type >
+ temp( adaptors::slice( r, f.t, f.u ) );
+ return CopyableRandomAccessRng( temp.begin(), temp.end() );
+ }
+
+ template<class CopyableRandomAccessRange>
+ inline CopyableRandomAccessRange
+ copy(const CopyableRandomAccessRange& rng, std::size_t t, std::size_t u)
+ {
+ iterator_range<
+ BOOST_DEDUCED_TYPENAME range_iterator<const
+ CopyableRandomAccessRange>::type> temp(
+ adaptors::slice(rng, t, u));
return CopyableRandomAccessRange( temp.begin(), temp.end() );
- }
- } // 'adaptors'
+ }
+ } // 'adaptors'
}
Modified: branches/release/boost/range/adaptor/filtered.hpp
==============================================================================
--- branches/release/boost/range/adaptor/filtered.hpp (original)
+++ branches/release/boost/range/adaptor/filtered.hpp 2010-04-23 18:50:56 EDT (Fri, 23 Apr 2010)
@@ -17,84 +17,84 @@
namespace boost
{
- namespace range_detail
- {
- template< class P, class R >
- struct filter_range :
+ namespace range_detail
+ {
+ template< class P, class R >
+ struct filter_range :
boost::iterator_range<
boost::filter_iterator< P,
- BOOST_DEDUCED_TYPENAME range_iterator<R>::type
+ BOOST_DEDUCED_TYPENAME range_iterator<R>::type
>
>
- {
- private:
- typedef boost::iterator_range<
+ {
+ private:
+ typedef boost::iterator_range<
boost::filter_iterator< P,
BOOST_DEDUCED_TYPENAME range_iterator<R>::type
>
> base;
- public:
- filter_range( P p, R& r )
- : base( make_filter_iterator( p, boost::begin(r), boost::end(r) ),
- make_filter_iterator( p, boost::end(r), boost::end(r) ) )
- { }
- };
-
- template< class T >
- struct filter_holder : holder<T>
- {
- filter_holder( T r ) : holder<T>(r)
- { }
- };
-
- template< class InputRng, class Predicate >
- inline filter_range<Predicate, InputRng>
- operator|( InputRng& r,
- const filter_holder<Predicate>& f )
- {
- return filter_range<Predicate, InputRng>( f.val, r );
- }
-
- template< class InputRng, class Predicate >
- inline filter_range<Predicate, const InputRng>
- operator|( const InputRng& r,
- const filter_holder<Predicate>& f )
- {
- return filter_range<Predicate, const InputRng>( f.val, r );
- }
-
- } // 'range_detail'
-
- // Unusual use of 'using' is intended to bring filter_range into the boost namespace
- // while leaving the mechanics of the '|' operator in range_detail and maintain
- // argument dependent lookup.
- // filter_range logically needs to be in the boost namespace to allow user of
- // the library to define the return type for filter()
- using range_detail::filter_range;
-
- namespace adaptors
- {
- namespace
- {
- const range_detail::forwarder<range_detail::filter_holder>
- filtered =
- range_detail::forwarder<range_detail::filter_holder>();
- }
-
- template<class InputRange, class Predicate>
- inline filter_range<Predicate, InputRange>
- filter(InputRange& rng, Predicate filter_pred)
- {
- return range_detail::filter_range<Predicate, InputRange>( filter_pred, rng );
- }
-
- template<class InputRange, class Predicate>
- inline filter_range<Predicate, const InputRange>
- filter(const InputRange& rng, Predicate filter_pred)
- {
- return range_detail::filter_range<Predicate, const InputRange>( filter_pred, rng );
+ public:
+ filter_range( P p, R& r )
+ : base( make_filter_iterator( p, boost::begin(r), boost::end(r) ),
+ make_filter_iterator( p, boost::end(r), boost::end(r) ) )
+ { }
+ };
+
+ template< class T >
+ struct filter_holder : holder<T>
+ {
+ filter_holder( T r ) : holder<T>(r)
+ { }
+ };
+
+ template< class InputRng, class Predicate >
+ inline filter_range<Predicate, InputRng>
+ operator|( InputRng& r,
+ const filter_holder<Predicate>& f )
+ {
+ return filter_range<Predicate, InputRng>( f.val, r );
}
- } // 'adaptors'
+
+ template< class InputRng, class Predicate >
+ inline filter_range<Predicate, const InputRng>
+ operator|( const InputRng& r,
+ const filter_holder<Predicate>& f )
+ {
+ return filter_range<Predicate, const InputRng>( f.val, r );
+ }
+
+ } // 'range_detail'
+
+ // Unusual use of 'using' is intended to bring filter_range into the boost namespace
+ // while leaving the mechanics of the '|' operator in range_detail and maintain
+ // argument dependent lookup.
+ // filter_range logically needs to be in the boost namespace to allow user of
+ // the library to define the return type for filter()
+ using range_detail::filter_range;
+
+ namespace adaptors
+ {
+ namespace
+ {
+ const range_detail::forwarder<range_detail::filter_holder>
+ filtered =
+ range_detail::forwarder<range_detail::filter_holder>();
+ }
+
+ template<class InputRange, class Predicate>
+ inline filter_range<Predicate, InputRange>
+ filter(InputRange& rng, Predicate filter_pred)
+ {
+ return range_detail::filter_range<Predicate, InputRange>( filter_pred, rng );
+ }
+
+ template<class InputRange, class Predicate>
+ inline filter_range<Predicate, const InputRange>
+ filter(const InputRange& rng, Predicate filter_pred)
+ {
+ return range_detail::filter_range<Predicate, const InputRange>( filter_pred, rng );
+ }
+ } // 'adaptors'
}
Modified: branches/release/boost/range/adaptor/indexed.hpp
==============================================================================
--- branches/release/boost/range/adaptor/indexed.hpp (original)
+++ branches/release/boost/range/adaptor/indexed.hpp 2010-04-23 18:50:56 EDT (Fri, 23 Apr 2010)
@@ -40,56 +40,56 @@
};
}
- namespace range_detail
- {
- template< class Iter >
- class indexed_iterator
- : public boost::iterator_adaptor< indexed_iterator<Iter>, Iter >
- {
- private:
- typedef boost::iterator_adaptor< indexed_iterator<Iter>, Iter >
- base;
-
- typedef BOOST_DEDUCED_TYPENAME base::difference_type index_type;
-
- index_type m_index;
-
- public:
- explicit indexed_iterator( Iter i, index_type index )
- : base(i), m_index(index)
- {
- BOOST_ASSERT( m_index >= 0 && "Indexed Iterator out of bounds" );
- }
-
- index_type index() const
- {
- return m_index;
- }
+ namespace range_detail
+ {
+ template< class Iter >
+ class indexed_iterator
+ : public boost::iterator_adaptor< indexed_iterator<Iter>, Iter >
+ {
+ private:
+ typedef boost::iterator_adaptor< indexed_iterator<Iter>, Iter >
+ base;
- private:
- friend class boost::iterator_core_access;
+ typedef BOOST_DEDUCED_TYPENAME base::difference_type index_type;
- void increment()
- {
+ index_type m_index;
+
+ public:
+ explicit indexed_iterator( Iter i, index_type index )
+ : base(i), m_index(index)
+ {
+ BOOST_ASSERT( m_index >= 0 && "Indexed Iterator out of bounds" );
+ }
+
+ index_type index() const
+ {
+ return m_index;
+ }
+
+ private:
+ friend class boost::iterator_core_access;
+
+ void increment()
+ {
++m_index;
++(this->base_reference());
- }
+ }
- void decrement()
+ void decrement()
{
BOOST_ASSERT( m_index > 0 && "Indexed Iterator out of bounds" );
--m_index;
--(this->base_reference());
}
- void advance( index_type n )
+ void advance( index_type n )
{
m_index += n;
BOOST_ASSERT( m_index >= 0 && "Indexed Iterator out of bounds" );
this->base_reference() += n;
}
- };
+ };
template< class Rng >
struct indexed_range :
@@ -107,45 +107,45 @@
{ }
};
- } // 'range_detail'
+ } // 'range_detail'
- // Make this available to users of this library. It will sometimes be
- // required since it is the return type of operator '|' and
- // index().
- using range_detail::indexed_range;
+ // Make this available to users of this library. It will sometimes be
+ // required since it is the return type of operator '|' and
+ // index().
+ using range_detail::indexed_range;
- namespace adaptors
- {
+ namespace adaptors
+ {
template< class SinglePassRange >
- inline indexed_range<SinglePassRange>
- operator|( SinglePassRange& r,
- const indexed& f )
- {
- return indexed_range<SinglePassRange>( f.val, r );
- }
-
- template< class SinglePassRange >
- inline indexed_range<const SinglePassRange>
- operator|( const SinglePassRange& r,
- const indexed& f )
- {
- return indexed_range<const SinglePassRange>( f.val, r );
- }
-
- template<class SinglePassRange, class Index>
- inline indexed_range<SinglePassRange>
- index(SinglePassRange& rng, Index index_value)
- {
- return indexed_range<SinglePassRange>(index_value, rng);
- }
-
- template<class SinglePassRange, class Index>
- inline indexed_range<const SinglePassRange>
- index(const SinglePassRange& rng, Index index_value)
- {
- return indexed_range<const SinglePassRange>(index_value, rng);
+ inline indexed_range<SinglePassRange>
+ operator|( SinglePassRange& r,
+ const indexed& f )
+ {
+ return indexed_range<SinglePassRange>( f.val, r );
+ }
+
+ template< class SinglePassRange >
+ inline indexed_range<const SinglePassRange>
+ operator|( const SinglePassRange& r,
+ const indexed& f )
+ {
+ return indexed_range<const SinglePassRange>( f.val, r );
+ }
+
+ template<class SinglePassRange, class Index>
+ inline indexed_range<SinglePassRange>
+ index(SinglePassRange& rng, Index index_value)
+ {
+ return indexed_range<SinglePassRange>(index_value, rng);
+ }
+
+ template<class SinglePassRange, class Index>
+ inline indexed_range<const SinglePassRange>
+ index(const SinglePassRange& rng, Index index_value)
+ {
+ return indexed_range<const SinglePassRange>(index_value, rng);
}
- } // 'adaptors'
+ } // 'adaptors'
}
Modified: branches/release/boost/range/adaptor/indirected.hpp
==============================================================================
--- branches/release/boost/range/adaptor/indirected.hpp (original)
+++ branches/release/boost/range/adaptor/indirected.hpp 2010-04-23 18:50:56 EDT (Fri, 23 Apr 2010)
@@ -16,72 +16,72 @@
namespace boost
{
- namespace range_detail
- {
- template< class R >
- struct indirect_range :
- public boost::iterator_range<
+ namespace range_detail
+ {
+ template< class R >
+ struct indirect_range :
+ public boost::iterator_range<
boost::indirect_iterator<
BOOST_DEDUCED_TYPENAME range_iterator<R>::type
>
>
- {
- private:
- typedef boost::iterator_range<
+ {
+ private:
+ typedef boost::iterator_range<
boost::indirect_iterator<
BOOST_DEDUCED_TYPENAME range_iterator<R>::type
>
>
- base;
+ base;
- public:
- explicit indirect_range( R& r )
+ public:
+ explicit indirect_range( R& r )
: base( r )
- { }
- };
+ { }
+ };
- struct indirect_forwarder {};
+ struct indirect_forwarder {};
- template< class InputRng >
- inline indirect_range<InputRng>
- operator|( InputRng& r, indirect_forwarder )
- {
- return indirect_range<InputRng>( r );
- }
-
- template< class InputRng >
- inline indirect_range<const InputRng>
- operator|( const InputRng& r, indirect_forwarder )
- {
- return indirect_range<const InputRng>( r );
- }
-
- } // 'range_detail'
-
- using range_detail::indirect_range;
-
- namespace adaptors
- {
- namespace
- {
- const range_detail::indirect_forwarder indirected =
- range_detail::indirect_forwarder();
- }
-
- template<class InputRange>
- inline indirect_range<InputRange>
- indirect(InputRange& rng)
- {
- return indirect_range<InputRange>(rng);
- }
-
- template<class InputRange>
- inline indirect_range<const InputRange>
- indirect(const InputRange& rng)
- {
- return indirect_range<const InputRange>(rng);
- }
- } // 'adaptors'
+ template< class InputRng >
+ inline indirect_range<InputRng>
+ operator|( InputRng& r, indirect_forwarder )
+ {
+ return indirect_range<InputRng>( r );
+ }
+
+ template< class InputRng >
+ inline indirect_range<const InputRng>
+ operator|( const InputRng& r, indirect_forwarder )
+ {
+ return indirect_range<const InputRng>( r );
+ }
+
+ } // 'range_detail'
+
+ using range_detail::indirect_range;
+
+ namespace adaptors
+ {
+ namespace
+ {
+ const range_detail::indirect_forwarder indirected =
+ range_detail::indirect_forwarder();
+ }
+
+ template<class InputRange>
+ inline indirect_range<InputRange>
+ indirect(InputRange& rng)
+ {
+ return indirect_range<InputRange>(rng);
+ }
+
+ template<class InputRange>
+ inline indirect_range<const InputRange>
+ indirect(const InputRange& rng)
+ {
+ return indirect_range<const InputRange>(rng);
+ }
+ } // 'adaptors'
}
Modified: branches/release/boost/range/adaptor/map.hpp
==============================================================================
--- branches/release/boost/range/adaptor/map.hpp (original)
+++ branches/release/boost/range/adaptor/map.hpp 2010-04-23 18:50:56 EDT (Fri, 23 Apr 2010)
@@ -17,161 +17,161 @@
namespace boost
{
- namespace range_detail
- {
- struct map_keys_forwarder {};
- struct map_values_forwarder {};
-
- template< class Map >
- struct select_first
- {
- typedef BOOST_DEDUCED_TYPENAME Map::value_type pair_t;
- typedef const BOOST_DEDUCED_TYPENAME pair_t::first_type&
- result_type;
-
- result_type operator()( const pair_t& r ) const
- {
- return r.first;
- }
- };
-
- template< class Map >
- struct select_second_mutable
- {
- typedef BOOST_DEDUCED_TYPENAME Map::value_type pair_t;
- typedef BOOST_DEDUCED_TYPENAME pair_t::second_type& result_type;
-
- result_type operator()( pair_t& r ) const
- {
- return r.second;
- }
- };
-
- template< class Map >
- struct select_second_const
- {
- typedef BOOST_DEDUCED_TYPENAME Map::value_type pair_t;
- typedef const BOOST_DEDUCED_TYPENAME pair_t::second_type&
- result_type;
-
- result_type operator()( const pair_t& r ) const
- {
- return r.second;
- }
- };
-
- template<class StdPairRng>
- class select_first_range
- : public transform_range<
- select_first<StdPairRng>,
- const StdPairRng>
- {
- typedef transform_range<select_first<StdPairRng>, const StdPairRng> base;
- public:
- typedef select_first<StdPairRng> transform_fn_type;
- typedef const StdPairRng source_range_type;
-
- select_first_range(transform_fn_type fn, source_range_type& rng)
- : base(fn, rng)
- {
- }
-
- select_first_range(const base& other) : base(other) {}
- };
-
- template<class StdPairRng>
- class select_second_mutable_range
- : public transform_range<
- select_second_mutable<StdPairRng>,
- StdPairRng>
- {
- typedef transform_range<select_second_mutable<StdPairRng>, StdPairRng> base;
- public:
- typedef select_second_mutable<StdPairRng> transform_fn_type;
- typedef StdPairRng source_range_type;
-
- select_second_mutable_range(transform_fn_type fn, source_range_type& rng)
- : base(fn, rng)
- {
- }
-
- select_second_mutable_range(const base& other) : base(other) {}
- };
-
- template<class StdPairRng>
- class select_second_const_range
- : public transform_range<
- select_second_const<StdPairRng>,
- const StdPairRng>
- {
- typedef transform_range<select_second_const<StdPairRng>, const StdPairRng> base;
- public:
- typedef select_second_const<StdPairRng> transform_fn_type;
- typedef const StdPairRng source_range_type;
-
- select_second_const_range(transform_fn_type fn, source_range_type& rng)
- : base(fn, rng)
- {
- }
-
- select_second_const_range(const base& other) : base(other) {}
- };
-
- template< class StdPairRng >
- inline select_first_range<StdPairRng>
- operator|( const StdPairRng& r, map_keys_forwarder )
- {
- return operator|( r,
- boost::adaptors::transformed( select_first<StdPairRng>() ) );
- }
-
- template< class StdPairRng >
- inline select_second_mutable_range<StdPairRng>
- operator|( StdPairRng& r, map_values_forwarder )
- {
- return operator|( r,
- boost::adaptors::transformed( select_second_mutable<StdPairRng>() ) );
- }
-
- template< class StdPairRng >
- inline select_second_const_range<StdPairRng>
- operator|( const StdPairRng& r, map_values_forwarder )
- {
- return operator|( r,
- boost::adaptors::transformed( select_second_const<StdPairRng>() ) );
- }
-
- } // 'range_detail'
-
- using range_detail::select_first_range;
- using range_detail::select_second_mutable_range;
- using range_detail::select_second_const_range;
-
- namespace adaptors
- {
- namespace
- {
- const range_detail::map_keys_forwarder map_keys =
- range_detail::map_keys_forwarder();
-
- const range_detail::map_values_forwarder map_values =
- range_detail::map_values_forwarder();
- }
-
- template<class StdPairRange>
- inline select_first_range<StdPairRange>
- keys(const StdPairRange& rng)
- {
- return select_first_range<StdPairRange>(
- range_detail::select_first<StdPairRange>(), rng );
- }
-
- template<class StdPairRange>
- inline select_second_const_range<StdPairRange>
- values(const StdPairRange& rng)
- {
- return select_second_const_range<StdPairRange>(
- range_detail::select_second_const<StdPairRange>(), rng );
+ namespace range_detail
+ {
+ struct map_keys_forwarder {};
+ struct map_values_forwarder {};
+
+ template< class Map >
+ struct select_first
+ {
+ typedef BOOST_DEDUCED_TYPENAME Map::value_type pair_t;
+ typedef const BOOST_DEDUCED_TYPENAME pair_t::first_type&
+ result_type;
+
+ result_type operator()( const pair_t& r ) const
+ {
+ return r.first;
+ }
+ };
+
+ template< class Map >
+ struct select_second_mutable
+ {
+ typedef BOOST_DEDUCED_TYPENAME Map::value_type pair_t;
+ typedef BOOST_DEDUCED_TYPENAME pair_t::second_type& result_type;
+
+ result_type operator()( pair_t& r ) const
+ {
+ return r.second;
+ }
+ };
+
+ template< class Map >
+ struct select_second_const
+ {
+ typedef BOOST_DEDUCED_TYPENAME Map::value_type pair_t;
+ typedef const BOOST_DEDUCED_TYPENAME pair_t::second_type&
+ result_type;
+
+ result_type operator()( const pair_t& r ) const
+ {
+ return r.second;
+ }
+ };
+
+ template<class StdPairRng>
+ class select_first_range
+ : public transform_range<
+ select_first<StdPairRng>,
+ const StdPairRng>
+ {
+ typedef transform_range<select_first<StdPairRng>, const StdPairRng> base;
+ public:
+ typedef select_first<StdPairRng> transform_fn_type;
+ typedef const StdPairRng source_range_type;
+
+ select_first_range(transform_fn_type fn, source_range_type& rng)
+ : base(fn, rng)
+ {
+ }
+
+ select_first_range(const base& other) : base(other) {}
+ };
+
+ template<class StdPairRng>
+ class select_second_mutable_range
+ : public transform_range<
+ select_second_mutable<StdPairRng>,
+ StdPairRng>
+ {
+ typedef transform_range<select_second_mutable<StdPairRng>, StdPairRng> base;
+ public:
+ typedef select_second_mutable<StdPairRng> transform_fn_type;
+ typedef StdPairRng source_range_type;
+
+ select_second_mutable_range(transform_fn_type fn, source_range_type& rng)
+ : base(fn, rng)
+ {
+ }
+
+ select_second_mutable_range(const base& other) : base(other) {}
+ };
+
+ template<class StdPairRng>
+ class select_second_const_range
+ : public transform_range<
+ select_second_const<StdPairRng>,
+ const StdPairRng>
+ {
+ typedef transform_range<select_second_const<StdPairRng>, const StdPairRng> base;
+ public:
+ typedef select_second_const<StdPairRng> transform_fn_type;
+ typedef const StdPairRng source_range_type;
+
+ select_second_const_range(transform_fn_type fn, source_range_type& rng)
+ : base(fn, rng)
+ {
+ }
+
+ select_second_const_range(const base& other) : base(other) {}
+ };
+
+ template< class StdPairRng >
+ inline select_first_range<StdPairRng>
+ operator|( const StdPairRng& r, map_keys_forwarder )
+ {
+ return operator|( r,
+ boost::adaptors::transformed( select_first<StdPairRng>() ) );
+ }
+
+ template< class StdPairRng >
+ inline select_second_mutable_range<StdPairRng>
+ operator|( StdPairRng& r, map_values_forwarder )
+ {
+ return operator|( r,
+ boost::adaptors::transformed( select_second_mutable<StdPairRng>() ) );
+ }
+
+ template< class StdPairRng >
+ inline select_second_const_range<StdPairRng>
+ operator|( const StdPairRng& r, map_values_forwarder )
+ {
+ return operator|( r,
+ boost::adaptors::transformed( select_second_const<StdPairRng>() ) );
+ }
+
+ } // 'range_detail'
+
+ using range_detail::select_first_range;
+ using range_detail::select_second_mutable_range;
+ using range_detail::select_second_const_range;
+
+ namespace adaptors
+ {
+ namespace
+ {
+ const range_detail::map_keys_forwarder map_keys =
+ range_detail::map_keys_forwarder();
+
+ const range_detail::map_values_forwarder map_values =
+ range_detail::map_values_forwarder();
+ }
+
+ template<class StdPairRange>
+ inline select_first_range<StdPairRange>
+ keys(const StdPairRange& rng)
+ {
+ return select_first_range<StdPairRange>(
+ range_detail::select_first<StdPairRange>(), rng );
+ }
+
+ template<class StdPairRange>
+ inline select_second_const_range<StdPairRange>
+ values(const StdPairRange& rng)
+ {
+ return select_second_const_range<StdPairRange>(
+ range_detail::select_second_const<StdPairRange>(), rng );
}
template<class StdPairRange>
@@ -181,8 +181,8 @@
return select_second_mutable_range<StdPairRange>(
range_detail::select_second_mutable<StdPairRange>(), rng );
}
- } // 'adaptors'
-
+ } // 'adaptors'
+
}
#endif
Modified: branches/release/boost/range/adaptor/replaced.hpp
==============================================================================
--- branches/release/boost/range/adaptor/replaced.hpp (original)
+++ branches/release/boost/range/adaptor/replaced.hpp 2010-04-23 18:50:56 EDT (Fri, 23 Apr 2010)
@@ -22,99 +22,99 @@
namespace boost
{
- namespace range_detail
- {
- template< class Value >
- class replace_value
- {
- public:
- typedef const Value& result_type;
- typedef const Value& first_argument_type;
-
- replace_value(const Value& from, const Value& to)
- : m_from(from), m_to(to)
- {
- }
-
- const Value& operator()(const Value& x) const
- {
- return (x == m_from) ? m_to : x;
- }
-
- private:
- Value m_from;
- Value m_to;
- };
-
- template< class R >
- class replace_range :
- public boost::iterator_range<
- boost::transform_iterator<
- replace_value< BOOST_DEDUCED_TYPENAME range_value<R>::type >,
- BOOST_DEDUCED_TYPENAME range_iterator<R>::type > >
- {
- private:
- typedef replace_value< BOOST_DEDUCED_TYPENAME range_value<R>::type > Fn;
-
- typedef boost::iterator_range<
- boost::transform_iterator<
- replace_value< BOOST_DEDUCED_TYPENAME range_value<R>::type >,
- BOOST_DEDUCED_TYPENAME range_iterator<R>::type > > base_t;
-
- public:
- typedef BOOST_DEDUCED_TYPENAME range_value<R>::type value_type;
-
- replace_range( R& r, value_type from, value_type to )
- : base_t( make_transform_iterator( boost::begin(r), Fn(from, to) ),
- make_transform_iterator( boost::end(r), Fn(from, to) ) )
- { }
- };
-
- template< class T >
- class replace_holder : public holder2<T>
- {
- public:
- replace_holder( const T& from, const T& to )
- : holder2<T>(from, to)
- { }
- private:
- // not assignable
- void operator=(const replace_holder&);
- };
-
- template< class InputRng >
- inline replace_range<InputRng>
- operator|( InputRng& r,
- const replace_holder<BOOST_DEDUCED_TYPENAME range_value<InputRng>::type>& f )
- {
- return replace_range<InputRng>(r, f.val1, f.val2);
- }
-
- template< class InputRng >
- inline replace_range<const InputRng>
- operator|( const InputRng& r,
- const replace_holder<BOOST_DEDUCED_TYPENAME range_value<InputRng>::type>& f )
- {
- return replace_range<const InputRng>(r, f.val1, f.val2);
- }
- } // 'range_detail'
+ namespace range_detail
+ {
+ template< class Value >
+ class replace_value
+ {
+ public:
+ typedef const Value& result_type;
+ typedef const Value& first_argument_type;
+
+ replace_value(const Value& from, const Value& to)
+ : m_from(from), m_to(to)
+ {
+ }
+
+ const Value& operator()(const Value& x) const
+ {
+ return (x == m_from) ? m_to : x;
+ }
+
+ private:
+ Value m_from;
+ Value m_to;
+ };
+
+ template< class R >
+ class replace_range :
+ public boost::iterator_range<
+ boost::transform_iterator<
+ replace_value< BOOST_DEDUCED_TYPENAME range_value<R>::type >,
+ BOOST_DEDUCED_TYPENAME range_iterator<R>::type > >
+ {
+ private:
+ typedef replace_value< BOOST_DEDUCED_TYPENAME range_value<R>::type > Fn;
+
+ typedef boost::iterator_range<
+ boost::transform_iterator<
+ replace_value< BOOST_DEDUCED_TYPENAME range_value<R>::type >,
+ BOOST_DEDUCED_TYPENAME range_iterator<R>::type > > base_t;
+
+ public:
+ typedef BOOST_DEDUCED_TYPENAME range_value<R>::type value_type;
+
+ replace_range( R& r, value_type from, value_type to )
+ : base_t( make_transform_iterator( boost::begin(r), Fn(from, to) ),
+ make_transform_iterator( boost::end(r), Fn(from, to) ) )
+ { }
+ };
+
+ template< class T >
+ class replace_holder : public holder2<T>
+ {
+ public:
+ replace_holder( const T& from, const T& to )
+ : holder2<T>(from, to)
+ { }
+ private:
+ // not assignable
+ void operator=(const replace_holder&);
+ };
+
+ template< class InputRng >
+ inline replace_range<InputRng>
+ operator|( InputRng& r,
+ const replace_holder<BOOST_DEDUCED_TYPENAME range_value<InputRng>::type>& f )
+ {
+ return replace_range<InputRng>(r, f.val1, f.val2);
+ }
+
+ template< class InputRng >
+ inline replace_range<const InputRng>
+ operator|( const InputRng& r,
+ const replace_holder<BOOST_DEDUCED_TYPENAME range_value<InputRng>::type>& f )
+ {
+ return replace_range<const InputRng>(r, f.val1, f.val2);
+ }
+ } // 'range_detail'
using range_detail::replace_range;
- namespace adaptors
- {
- namespace
- {
- const range_detail::forwarder2<range_detail::replace_holder>
- replaced =
- range_detail::forwarder2<range_detail::replace_holder>();
- }
-
- template<class InputRange>
- inline replace_range<InputRange>
- replace(InputRange& rng,
- BOOST_DEDUCED_TYPENAME range_value<InputRange>::type from,
- BOOST_DEDUCED_TYPENAME range_value<InputRange>::type to)
+ namespace adaptors
+ {
+ namespace
+ {
+ const range_detail::forwarder2<range_detail::replace_holder>
+ replaced =
+ range_detail::forwarder2<range_detail::replace_holder>();
+ }
+
+ template<class InputRange>
+ inline replace_range<InputRange>
+ replace(InputRange& rng,
+ BOOST_DEDUCED_TYPENAME range_value<InputRange>::type from,
+ BOOST_DEDUCED_TYPENAME range_value<InputRange>::type to)
{
return replace_range<InputRange>(rng, from, to);
}
@@ -128,7 +128,7 @@
return replace_range<const InputRange>(rng, from ,to);
}
- } // 'adaptors'
+ } // 'adaptors'
} // 'boost'
#endif // include guard
Modified: branches/release/boost/range/adaptor/replaced_if.hpp
==============================================================================
--- branches/release/boost/range/adaptor/replaced_if.hpp (original)
+++ branches/release/boost/range/adaptor/replaced_if.hpp 2010-04-23 18:50:56 EDT (Fri, 23 Apr 2010)
@@ -22,115 +22,115 @@
namespace boost
{
- namespace range_detail
- {
- template< class Pred, class Value >
- class replace_value_if
- {
- public:
- typedef const Value& result_type;
- typedef const Value& first_argument_type;
-
- replace_value_if(const Pred& pred, const Value& to)
- : m_pred(pred), m_to(to)
- {
- }
-
- const Value& operator()(const Value& x) const
- {
- return m_pred(x) ? m_to : x;
- }
-
- private:
- Pred m_pred;
- Value m_to;
- };
-
- template< class Pred, class R >
- class replace_if_range :
- public boost::iterator_range<
- boost::transform_iterator<
- replace_value_if< Pred, BOOST_DEDUCED_TYPENAME range_value<R>::type >,
- BOOST_DEDUCED_TYPENAME range_iterator<R>::type > >
- {
- private:
- typedef replace_value_if< Pred, BOOST_DEDUCED_TYPENAME range_value<R>::type > Fn;
-
- typedef boost::iterator_range<
- boost::transform_iterator<
- replace_value_if< Pred, BOOST_DEDUCED_TYPENAME range_value<R>::type >,
- BOOST_DEDUCED_TYPENAME range_iterator<R>::type > > base_t;
-
- public:
- typedef BOOST_DEDUCED_TYPENAME range_value<R>::type value_type;
-
- replace_if_range( R& r, const Pred& pred, value_type to )
- : base_t( make_transform_iterator( boost::begin(r), Fn(pred, to) ),
- make_transform_iterator( boost::end(r), Fn(pred, to) ) )
- { }
- };
-
- template< class Pred, class T >
- class replace_if_holder
- {
- public:
- replace_if_holder( const Pred& pred, const T& to )
- : m_pred(pred), m_to(to)
- { }
-
- const Pred& pred() const { return m_pred; }
- const T& to() const { return m_to; }
-
- private:
- Pred m_pred;
- T m_to;
- };
-
- template< class Pred, class InputRng >
- inline replace_if_range<Pred, InputRng>
- operator|( InputRng& r,
- const replace_if_holder<Pred, BOOST_DEDUCED_TYPENAME range_value<InputRng>::type>& f )
- {
- return replace_if_range<Pred, InputRng>(r, f.pred(), f.to());
- }
-
- template< class Pred, class InputRng >
- inline replace_if_range<Pred, const InputRng>
- operator|( const InputRng& r,
- const replace_if_holder<Pred, BOOST_DEDUCED_TYPENAME range_value<InputRng>::type>& f )
- {
- return replace_if_range<Pred, const InputRng>(r, f.pred(), f.to());
- }
- } // 'range_detail'
+ namespace range_detail
+ {
+ template< class Pred, class Value >
+ class replace_value_if
+ {
+ public:
+ typedef const Value& result_type;
+ typedef const Value& first_argument_type;
+
+ replace_value_if(const Pred& pred, const Value& to)
+ : m_pred(pred), m_to(to)
+ {
+ }
+
+ const Value& operator()(const Value& x) const
+ {
+ return m_pred(x) ? m_to : x;
+ }
+
+ private:
+ Pred m_pred;
+ Value m_to;
+ };
+
+ template< class Pred, class R >
+ class replace_if_range :
+ public boost::iterator_range<
+ boost::transform_iterator<
+ replace_value_if< Pred, BOOST_DEDUCED_TYPENAME range_value<R>::type >,
+ BOOST_DEDUCED_TYPENAME range_iterator<R>::type > >
+ {
+ private:
+ typedef replace_value_if< Pred, BOOST_DEDUCED_TYPENAME range_value<R>::type > Fn;
+
+ typedef boost::iterator_range<
+ boost::transform_iterator<
+ replace_value_if< Pred, BOOST_DEDUCED_TYPENAME range_value<R>::type >,
+ BOOST_DEDUCED_TYPENAME range_iterator<R>::type > > base_t;
+
+ public:
+ typedef BOOST_DEDUCED_TYPENAME range_value<R>::type value_type;
+
+ replace_if_range( R& r, const Pred& pred, value_type to )
+ : base_t( make_transform_iterator( boost::begin(r), Fn(pred, to) ),
+ make_transform_iterator( boost::end(r), Fn(pred, to) ) )
+ { }
+ };
+
+ template< class Pred, class T >
+ class replace_if_holder
+ {
+ public:
+ replace_if_holder( const Pred& pred, const T& to )
+ : m_pred(pred), m_to(to)
+ { }
+
+ const Pred& pred() const { return m_pred; }
+ const T& to() const { return m_to; }
+
+ private:
+ Pred m_pred;
+ T m_to;
+ };
+
+ template< class Pred, class InputRng >
+ inline replace_if_range<Pred, InputRng>
+ operator|( InputRng& r,
+ const replace_if_holder<Pred, BOOST_DEDUCED_TYPENAME range_value<InputRng>::type>& f )
+ {
+ return replace_if_range<Pred, InputRng>(r, f.pred(), f.to());
+ }
+
+ template< class Pred, class InputRng >
+ inline replace_if_range<Pred, const InputRng>
+ operator|( const InputRng& r,
+ const replace_if_holder<Pred, BOOST_DEDUCED_TYPENAME range_value<InputRng>::type>& f )
+ {
+ return replace_if_range<Pred, const InputRng>(r, f.pred(), f.to());
+ }
+ } // 'range_detail'
using range_detail::replace_if_range;
- namespace adaptors
- {
- namespace
- {
- const range_detail::forwarder2TU<range_detail::replace_if_holder>
- replaced_if =
- range_detail::forwarder2TU<range_detail::replace_if_holder>();
- }
-
- template<class Pred, class InputRange>
- inline replace_if_range<Pred, InputRange>
- replace_if(InputRange& rng, Pred pred,
+ namespace adaptors
+ {
+ namespace
+ {
+ const range_detail::forwarder2TU<range_detail::replace_if_holder>
+ replaced_if =
+ range_detail::forwarder2TU<range_detail::replace_if_holder>();
+ }
+
+ template<class Pred, class InputRange>
+ inline replace_if_range<Pred, InputRange>
+ replace_if(InputRange& rng, Pred pred,
BOOST_DEDUCED_TYPENAME range_value<InputRange>::type to)
- {
- return range_detail::replace_if_range<Pred, InputRange>(rng, pred, to);
- }
-
- template<class Pred, class InputRange>
- inline replace_if_range<Pred, const InputRange>
- replace_if(const InputRange& rng, Pred pred,
- BOOST_DEDUCED_TYPENAME range_value<const InputRange>::type to)
- {
- return range_detail::replace_if_range<Pred, const InputRange>(rng, pred, to);
- }
- } // 'adaptors'
-
+ {
+ return range_detail::replace_if_range<Pred, InputRange>(rng, pred, to);
+ }
+
+ template<class Pred, class InputRange>
+ inline replace_if_range<Pred, const InputRange>
+ replace_if(const InputRange& rng, Pred pred,
+ BOOST_DEDUCED_TYPENAME range_value<const InputRange>::type to)
+ {
+ return range_detail::replace_if_range<Pred, const InputRange>(rng, pred, to);
+ }
+ } // 'adaptors'
+
} // 'boost'
#endif // include guard
Modified: branches/release/boost/range/adaptor/reversed.hpp
==============================================================================
--- branches/release/boost/range/adaptor/reversed.hpp (original)
+++ branches/release/boost/range/adaptor/reversed.hpp 2010-04-23 18:50:56 EDT (Fri, 23 Apr 2010)
@@ -16,75 +16,75 @@
namespace boost
{
- namespace range_detail
- {
- template< class R >
- struct reverse_range :
- public boost::iterator_range<
- boost::reverse_iterator<
- BOOST_DEDUCED_TYPENAME range_iterator<R>::type
- >
- >
- {
- private:
- typedef boost::iterator_range<
- boost::reverse_iterator<
- BOOST_DEDUCED_TYPENAME range_iterator<R>::type
- >
- >
- base;
-
- public:
- typedef boost::reverse_iterator<BOOST_DEDUCED_TYPENAME range_iterator<R>::type> iterator;
+ namespace range_detail
+ {
+ template< class R >
+ struct reverse_range :
+ public boost::iterator_range<
+ boost::reverse_iterator<
+ BOOST_DEDUCED_TYPENAME range_iterator<R>::type
+ >
+ >
+ {
+ private:
+ typedef boost::iterator_range<
+ boost::reverse_iterator<
+ BOOST_DEDUCED_TYPENAME range_iterator<R>::type
+ >
+ >
+ base;
+
+ public:
+ typedef boost::reverse_iterator<BOOST_DEDUCED_TYPENAME range_iterator<R>::type> iterator;
- reverse_range( R& r )
- : base( iterator(boost::end(r)), iterator(boost::begin(r)) )
- { }
- };
+ reverse_range( R& r )
+ : base( iterator(boost::end(r)), iterator(boost::begin(r)) )
+ { }
+ };
- struct reverse_forwarder {};
-
- template< class BidirectionalRng >
- inline reverse_range<BidirectionalRng>
- operator|( BidirectionalRng& r, reverse_forwarder )
- {
- return reverse_range<BidirectionalRng>( r );
- }
-
- template< class BidirectionalRng >
- inline reverse_range<const BidirectionalRng>
- operator|( const BidirectionalRng& r, reverse_forwarder )
- {
- return reverse_range<const BidirectionalRng>( r );
- }
-
- } // 'range_detail'
-
- using range_detail::reverse_range;
+ struct reverse_forwarder {};
+
+ template< class BidirectionalRng >
+ inline reverse_range<BidirectionalRng>
+ operator|( BidirectionalRng& r, reverse_forwarder )
+ {
+ return reverse_range<BidirectionalRng>( r );
+ }
+
+ template< class BidirectionalRng >
+ inline reverse_range<const BidirectionalRng>
+ operator|( const BidirectionalRng& r, reverse_forwarder )
+ {
+ return reverse_range<const BidirectionalRng>( r );
+ }
+
+ } // 'range_detail'
+
+ using range_detail::reverse_range;
- namespace adaptors
- {
- namespace
- {
- const range_detail::reverse_forwarder reversed =
- range_detail::reverse_forwarder();
- }
-
- template<class BidirectionalRange>
- inline reverse_range<BidirectionalRange>
- reverse(BidirectionalRange& rng)
- {
- return reverse_range<BidirectionalRange>(rng);
- }
-
- template<class BidirectionalRange>
- inline reverse_range<const BidirectionalRange>
- reverse(const BidirectionalRange& rng)
- {
- return reverse_range<const BidirectionalRange>(rng);
+ namespace adaptors
+ {
+ namespace
+ {
+ const range_detail::reverse_forwarder reversed =
+ range_detail::reverse_forwarder();
+ }
+
+ template<class BidirectionalRange>
+ inline reverse_range<BidirectionalRange>
+ reverse(BidirectionalRange& rng)
+ {
+ return reverse_range<BidirectionalRange>(rng);
+ }
+
+ template<class BidirectionalRange>
+ inline reverse_range<const BidirectionalRange>
+ reverse(const BidirectionalRange& rng)
+ {
+ return reverse_range<const BidirectionalRange>(rng);
}
- } // 'adaptors'
-
+ } // 'adaptors'
+
} // 'boost'
#endif
Modified: branches/release/boost/range/adaptor/strided.hpp
==============================================================================
--- branches/release/boost/range/adaptor/strided.hpp (original)
+++ branches/release/boost/range/adaptor/strided.hpp 2010-04-23 18:50:56 EDT (Fri, 23 Apr 2010)
@@ -18,132 +18,132 @@
namespace boost
{
- namespace range_detail
- {
+ namespace range_detail
+ {
- template<typename BaseIterator>
- class strided_iterator
- : public iterator_adaptor<
- strided_iterator<BaseIterator>,
- BaseIterator>
- {
- friend class iterator_core_access;
-
- typedef iterator_adaptor<strided_iterator<BaseIterator>, BaseIterator> super_t;
-
- public:
- typedef BOOST_DEDUCED_TYPENAME std::iterator_traits<BaseIterator>::difference_type difference_type;
-
- strided_iterator() : m_stride() { }
-
- strided_iterator(const strided_iterator& other)
- : super_t(other), m_stride(other.m_stride) { }
-
- explicit strided_iterator(BaseIterator base_it, difference_type stride)
- : super_t(base_it), m_stride(stride) { }
-
- strided_iterator&
- operator=(const strided_iterator& other)
- {
- super_t::operator=(other);
-
- // Is the interoperation of the stride safe?
- m_stride = other.m_stride;
- return *this;
- }
-
- void increment() { std::advance(this->base_reference(), m_stride); }
-
- void decrement() { std::advance(this->base_reference(), -m_stride); }
-
- void advance(difference_type n) { std::advance(this->base_reference(), n * m_stride); }
-
- difference_type
- distance_to(const strided_iterator& other) const
- {
- return std::distance(this->base_reference(), other.base_reference()) / m_stride;
- }
-
- // Using the compiler generated copy constructor and
- // and assignment operator
-
- private:
- difference_type m_stride;
- };
-
- template<class BaseIterator> inline
- strided_iterator<BaseIterator>
- make_strided_iterator(
- const BaseIterator& first,
- BOOST_DEDUCED_TYPENAME std::iterator_traits<BaseIterator>::difference_type stride)
- {
- return strided_iterator<BaseIterator>(first, stride);
- }
-
- template< class Rng >
- class strided_range
- : public iterator_range<range_detail::strided_iterator<BOOST_DEDUCED_TYPENAME range_iterator<Rng>::type> >
- {
- typedef range_detail::strided_iterator<BOOST_DEDUCED_TYPENAME range_iterator<Rng>::type> iter_type;
- typedef iterator_range<iter_type> super_t;
- public:
- template< typename Difference >
- strided_range(Difference stride, Rng& rng)
+ template<typename BaseIterator>
+ class strided_iterator
+ : public iterator_adaptor<
+ strided_iterator<BaseIterator>,
+ BaseIterator>
+ {
+ friend class iterator_core_access;
+
+ typedef iterator_adaptor<strided_iterator<BaseIterator>, BaseIterator> super_t;
+
+ public:
+ typedef BOOST_DEDUCED_TYPENAME std::iterator_traits<BaseIterator>::difference_type difference_type;
+
+ strided_iterator() : m_stride() { }
+
+ strided_iterator(const strided_iterator& other)
+ : super_t(other), m_stride(other.m_stride) { }
+
+ explicit strided_iterator(BaseIterator base_it, difference_type stride)
+ : super_t(base_it), m_stride(stride) { }
+
+ strided_iterator&
+ operator=(const strided_iterator& other)
+ {
+ super_t::operator=(other);
+
+ // Is the interoperation of the stride safe?
+ m_stride = other.m_stride;
+ return *this;
+ }
+
+ void increment() { std::advance(this->base_reference(), m_stride); }
+
+ void decrement() { std::advance(this->base_reference(), -m_stride); }
+
+ void advance(difference_type n) { std::advance(this->base_reference(), n * m_stride); }
+
+ difference_type
+ distance_to(const strided_iterator& other) const
+ {
+ return std::distance(this->base_reference(), other.base_reference()) / m_stride;
+ }
+
+ // Using the compiler generated copy constructor and
+ // and assignment operator
+
+ private:
+ difference_type m_stride;
+ };
+
+ template<class BaseIterator> inline
+ strided_iterator<BaseIterator>
+ make_strided_iterator(
+ const BaseIterator& first,
+ BOOST_DEDUCED_TYPENAME std::iterator_traits<BaseIterator>::difference_type stride)
+ {
+ return strided_iterator<BaseIterator>(first, stride);
+ }
+
+ template< class Rng >
+ class strided_range
+ : public iterator_range<range_detail::strided_iterator<BOOST_DEDUCED_TYPENAME range_iterator<Rng>::type> >
+ {
+ typedef range_detail::strided_iterator<BOOST_DEDUCED_TYPENAME range_iterator<Rng>::type> iter_type;
+ typedef iterator_range<iter_type> super_t;
+ public:
+ template< typename Difference >
+ strided_range(Difference stride, Rng& rng)
: super_t(make_strided_iterator(boost::begin(rng), stride),
make_strided_iterator(boost::end(rng), stride))
- {
- }
- };
-
- template<class Difference>
- class strided_holder : public holder<Difference>
- {
- public:
- strided_holder(Difference value) : holder<Difference>(value) {}
- };
-
- template<class Rng, class Difference>
- inline strided_range<Rng>
- operator|(Rng& rng, const strided_holder<Difference>& stride)
- {
- return strided_range<Rng>(stride.val, rng);
- }
-
- template<class Rng, class Difference>
- inline strided_range<const Rng>
- operator|(const Rng& rng, const strided_holder<Difference>& stride)
- {
- return strided_range<const Rng>(stride.val, rng);
- }
-
- } // namespace range_detail
-
- using range_detail::strided_range;
-
- namespace adaptors
- {
-
- namespace
- {
- const range_detail::forwarder<range_detail::strided_holder>
- strided = range_detail::forwarder<range_detail::strided_holder>();
- }
-
- template<class Range, class Difference>
- inline strided_range<Range>
- stride(Range& rng, Difference step)
- {
- return strided_range<Range>(step, rng);
- }
-
- template<class Range, class Difference>
- inline strided_range<const Range>
- stride(const Range& rng, Difference step)
- {
- return strided_range<const Range>(step, rng);
+ {
+ }
+ };
+
+ template<class Difference>
+ class strided_holder : public holder<Difference>
+ {
+ public:
+ strided_holder(Difference value) : holder<Difference>(value) {}
+ };
+
+ template<class Rng, class Difference>
+ inline strided_range<Rng>
+ operator|(Rng& rng, const strided_holder<Difference>& stride)
+ {
+ return strided_range<Rng>(stride.val, rng);
+ }
+
+ template<class Rng, class Difference>
+ inline strided_range<const Rng>
+ operator|(const Rng& rng, const strided_holder<Difference>& stride)
+ {
+ return strided_range<const Rng>(stride.val, rng);
+ }
+
+ } // namespace range_detail
+
+ using range_detail::strided_range;
+
+ namespace adaptors
+ {
+
+ namespace
+ {
+ const range_detail::forwarder<range_detail::strided_holder>
+ strided = range_detail::forwarder<range_detail::strided_holder>();
+ }
+
+ template<class Range, class Difference>
+ inline strided_range<Range>
+ stride(Range& rng, Difference step)
+ {
+ return strided_range<Range>(step, rng);
+ }
+
+ template<class Range, class Difference>
+ inline strided_range<const Range>
+ stride(const Range& rng, Difference step)
+ {
+ return strided_range<const Range>(step, rng);
}
- } // namespace 'adaptors'
+ } // namespace 'adaptors'
} // namespace 'boost'
#endif
Modified: branches/release/boost/range/adaptor/tokenized.hpp
==============================================================================
--- branches/release/boost/range/adaptor/tokenized.hpp (original)
+++ branches/release/boost/range/adaptor/tokenized.hpp 2010-04-23 18:50:56 EDT (Fri, 23 Apr 2010)
@@ -16,122 +16,122 @@
namespace boost
{
- namespace range_detail
- {
+ namespace range_detail
+ {
- template< class R >
- struct token_range :
- public boost::iterator_range<
- boost::regex_token_iterator<
- BOOST_DEDUCED_TYPENAME range_iterator<R>::type
- >
- >
- {
- private:
- typedef
- boost::regex_token_iterator<
- BOOST_DEDUCED_TYPENAME range_iterator<R>::type
- >
- regex_iter;
-
- typedef BOOST_DEDUCED_TYPENAME regex_iter::regex_type
- regex_type;
-
- typedef boost::iterator_range<regex_iter>
- base;
-
- public:
- template< class Regex, class Submatch, class Flag >
- token_range( R& r, const Regex& re, const Submatch& sub, Flag f )
- : base( regex_iter( boost::begin(r), boost::end(r),
- regex_type(re), sub, f ),
- regex_iter() )
- { }
- };
-
- template< class T, class U, class V >
- struct regex_holder
- {
- const T& re;
- const U& sub;
- V f;
-
- regex_holder( const T& rex, const U& subm, V flag ) :
- re(rex), sub(subm), f(flag)
- { }
- private:
- // Not assignable
- void operator=(const regex_holder&);
- };
-
- struct regex_forwarder
- {
- template< class Regex >
- regex_holder<Regex,int,regex_constants::match_flag_type>
- operator()( const Regex& re,
- int submatch = 0,
- regex_constants::match_flag_type f =
- regex_constants::match_default ) const
- {
- return regex_holder<Regex,int,
- regex_constants::match_flag_type>( re, submatch, f );
- }
-
- template< class Regex, class Submatch >
- regex_holder<Regex,Submatch,regex_constants::match_flag_type>
- operator()( const Regex& re,
- const Submatch& sub,
- regex_constants::match_flag_type f =
- regex_constants::match_default ) const
- {
- return regex_holder<Regex,Submatch,
- regex_constants::match_flag_type>( re, sub, f );
- }
- };
-
- template< class BidirectionalRng, class R, class S, class F >
- inline token_range<BidirectionalRng>
- operator|( BidirectionalRng& r,
- const regex_holder<R,S,F>& f )
- {
- return token_range<BidirectionalRng>( r, f.re, f.sub, f.f );
- }
-
- template< class BidirectionalRng, class R, class S, class F >
- inline token_range<const BidirectionalRng>
- operator|( const BidirectionalRng& r,
- const regex_holder<R,S,F>& f )
- {
- return token_range<const BidirectionalRng>( r, f.re, f.sub, f.f );
- }
-
- } // 'range_detail'
+ template< class R >
+ struct token_range :
+ public boost::iterator_range<
+ boost::regex_token_iterator<
+ BOOST_DEDUCED_TYPENAME range_iterator<R>::type
+ >
+ >
+ {
+ private:
+ typedef
+ boost::regex_token_iterator<
+ BOOST_DEDUCED_TYPENAME range_iterator<R>::type
+ >
+ regex_iter;
+
+ typedef BOOST_DEDUCED_TYPENAME regex_iter::regex_type
+ regex_type;
+
+ typedef boost::iterator_range<regex_iter>
+ base;
+
+ public:
+ template< class Regex, class Submatch, class Flag >
+ token_range( R& r, const Regex& re, const Submatch& sub, Flag f )
+ : base( regex_iter( boost::begin(r), boost::end(r),
+ regex_type(re), sub, f ),
+ regex_iter() )
+ { }
+ };
+
+ template< class T, class U, class V >
+ struct regex_holder
+ {
+ const T& re;
+ const U& sub;
+ V f;
+
+ regex_holder( const T& rex, const U& subm, V flag ) :
+ re(rex), sub(subm), f(flag)
+ { }
+ private:
+ // Not assignable
+ void operator=(const regex_holder&);
+ };
+
+ struct regex_forwarder
+ {
+ template< class Regex >
+ regex_holder<Regex,int,regex_constants::match_flag_type>
+ operator()( const Regex& re,
+ int submatch = 0,
+ regex_constants::match_flag_type f =
+ regex_constants::match_default ) const
+ {
+ return regex_holder<Regex,int,
+ regex_constants::match_flag_type>( re, submatch, f );
+ }
+
+ template< class Regex, class Submatch >
+ regex_holder<Regex,Submatch,regex_constants::match_flag_type>
+ operator()( const Regex& re,
+ const Submatch& sub,
+ regex_constants::match_flag_type f =
+ regex_constants::match_default ) const
+ {
+ return regex_holder<Regex,Submatch,
+ regex_constants::match_flag_type>( re, sub, f );
+ }
+ };
+
+ template< class BidirectionalRng, class R, class S, class F >
+ inline token_range<BidirectionalRng>
+ operator|( BidirectionalRng& r,
+ const regex_holder<R,S,F>& f )
+ {
+ return token_range<BidirectionalRng>( r, f.re, f.sub, f.f );
+ }
+
+ template< class BidirectionalRng, class R, class S, class F >
+ inline token_range<const BidirectionalRng>
+ operator|( const BidirectionalRng& r,
+ const regex_holder<R,S,F>& f )
+ {
+ return token_range<const BidirectionalRng>( r, f.re, f.sub, f.f );
+ }
+
+ } // 'range_detail'
using range_detail::token_range;
- namespace adaptors
- {
- namespace
- {
- const range_detail::regex_forwarder tokenized =
- range_detail::regex_forwarder();
- }
-
- template<class BidirectionalRange, class Regex, class Submatch, class Flag>
- inline token_range<BidirectionalRange>
- tokenize(BidirectionalRange& rng, const Regex& reg, const Submatch& sub, Flag f)
- {
- return token_range<BidirectionalRange>(rng, reg, sub, f);
- }
-
- template<class BidirectionalRange, class Regex, class Submatch, class Flag>
- inline token_range<const BidirectionalRange>
- tokenize(const BidirectionalRange& rng, const Regex& reg, const Submatch& sub, Flag f)
- {
- return token_range<const BidirectionalRange>(rng, reg, sub, f);
- }
- } // 'adaptors'
-
+ namespace adaptors
+ {
+ namespace
+ {
+ const range_detail::regex_forwarder tokenized =
+ range_detail::regex_forwarder();
+ }
+
+ template<class BidirectionalRange, class Regex, class Submatch, class Flag>
+ inline token_range<BidirectionalRange>
+ tokenize(BidirectionalRange& rng, const Regex& reg, const Submatch& sub, Flag f)
+ {
+ return token_range<BidirectionalRange>(rng, reg, sub, f);
+ }
+
+ template<class BidirectionalRange, class Regex, class Submatch, class Flag>
+ inline token_range<const BidirectionalRange>
+ tokenize(const BidirectionalRange& rng, const Regex& reg, const Submatch& sub, Flag f)
+ {
+ return token_range<const BidirectionalRange>(rng, reg, sub, f);
+ }
+ } // 'adaptors'
+
}
#endif
Modified: branches/release/boost/range/adaptor/transformed.hpp
==============================================================================
--- branches/release/boost/range/adaptor/transformed.hpp (original)
+++ branches/release/boost/range/adaptor/transformed.hpp 2010-04-23 18:50:56 EDT (Fri, 23 Apr 2010)
@@ -17,87 +17,87 @@
namespace boost
{
- namespace range_detail
- {
+ namespace range_detail
+ {
- template< class F, class R >
- struct transform_range :
- public boost::iterator_range<
- boost::transform_iterator< F,
- BOOST_DEDUCED_TYPENAME range_iterator<R>::type
- >
- >
- {
- private:
- typedef boost::iterator_range<
- boost::transform_iterator< F,
- BOOST_DEDUCED_TYPENAME range_iterator<R>::type
- >
- >
- base;
-
- public:
- typedef F transform_fn_type;
- typedef R source_range_type;
-
- transform_range( F f, R& r )
- : base( make_transform_iterator( boost::begin(r), f ),
- make_transform_iterator( boost::end(r), f ) )
-
- { }
- };
-
- template< class T >
- struct transform_holder : holder<T>
- {
- transform_holder( T r ) : holder<T>(r)
- { }
- };
-
- template< class InputRng, class UnaryFunction >
- inline transform_range<UnaryFunction,InputRng>
- operator|( InputRng& r,
- const transform_holder<UnaryFunction>& f )
- {
- return transform_range<UnaryFunction,InputRng>( f.val, r );
- }
-
- template< class InputRng, class UnaryFunction >
- inline transform_range<UnaryFunction, const InputRng>
- operator|( const InputRng& r,
- const transform_holder<UnaryFunction>& f )
- {
- return transform_range<UnaryFunction, const InputRng>( f.val, r );
- }
-
- } // 'range_detail'
-
- using range_detail::transform_range;
-
- namespace adaptors
- {
- namespace
- {
- const range_detail::forwarder<range_detail::transform_holder>
- transformed =
+ template< class F, class R >
+ struct transform_range :
+ public boost::iterator_range<
+ boost::transform_iterator< F,
+ BOOST_DEDUCED_TYPENAME range_iterator<R>::type
+ >
+ >
+ {
+ private:
+ typedef boost::iterator_range<
+ boost::transform_iterator< F,
+ BOOST_DEDUCED_TYPENAME range_iterator<R>::type
+ >
+ >
+ base;
+
+ public:
+ typedef F transform_fn_type;
+ typedef R source_range_type;
+
+ transform_range( F f, R& r )
+ : base( make_transform_iterator( boost::begin(r), f ),
+ make_transform_iterator( boost::end(r), f ) )
+
+ { }
+ };
+
+ template< class T >
+ struct transform_holder : holder<T>
+ {
+ transform_holder( T r ) : holder<T>(r)
+ { }
+ };
+
+ template< class InputRng, class UnaryFunction >
+ inline transform_range<UnaryFunction,InputRng>
+ operator|( InputRng& r,
+ const transform_holder<UnaryFunction>& f )
+ {
+ return transform_range<UnaryFunction,InputRng>( f.val, r );
+ }
+
+ template< class InputRng, class UnaryFunction >
+ inline transform_range<UnaryFunction, const InputRng>
+ operator|( const InputRng& r,
+ const transform_holder<UnaryFunction>& f )
+ {
+ return transform_range<UnaryFunction, const InputRng>( f.val, r );
+ }
+
+ } // 'range_detail'
+
+ using range_detail::transform_range;
+
+ namespace adaptors
+ {
+ namespace
+ {
+ const range_detail::forwarder<range_detail::transform_holder>
+ transformed =
range_detail::forwarder<range_detail::transform_holder>();
- }
-
- template<class UnaryFunction, class InputRange>
- inline transform_range<UnaryFunction, InputRange>
- transform(InputRange& rng, UnaryFunction fn)
- {
- return transform_range<UnaryFunction, InputRange>(fn, rng);
- }
-
- template<class UnaryFunction, class InputRange>
- inline transform_range<UnaryFunction, const InputRange>
- transform(const InputRange& rng, UnaryFunction fn)
- {
- return transform_range<UnaryFunction, const InputRange>(fn, rng);
- }
- } // 'adaptors'
-
+ }
+
+ template<class UnaryFunction, class InputRange>
+ inline transform_range<UnaryFunction, InputRange>
+ transform(InputRange& rng, UnaryFunction fn)
+ {
+ return transform_range<UnaryFunction, InputRange>(fn, rng);
+ }
+
+ template<class UnaryFunction, class InputRange>
+ inline transform_range<UnaryFunction, const InputRange>
+ transform(const InputRange& rng, UnaryFunction fn)
+ {
+ return transform_range<UnaryFunction, const InputRange>(fn, rng);
+ }
+ } // 'adaptors'
+
}
#endif
Modified: branches/release/boost/range/adaptor/uniqued.hpp
==============================================================================
--- branches/release/boost/range/adaptor/uniqued.hpp (original)
+++ branches/release/boost/range/adaptor/uniqued.hpp 2010-04-23 18:50:56 EDT (Fri, 23 Apr 2010)
@@ -16,74 +16,74 @@
namespace boost
{
- namespace range_detail
- {
- struct unique_forwarder { };
-
- struct unique_not_equal_to
- {
- typedef bool result_type;
-
- template< class T >
- bool operator()( const T& l, const T& r ) const
- {
- return !(l == r);
- }
- };
-
- template<class ForwardRng>
- class unique_range : public adjacent_filter_range<unique_not_equal_to, ForwardRng, true>
- {
- typedef adjacent_filter_range<unique_not_equal_to, ForwardRng, true> base;
- public:
- explicit unique_range(ForwardRng& rng)
- : base(unique_not_equal_to(), rng)
- {
- }
- };
-
- template< class ForwardRng >
- inline unique_range<ForwardRng>
- operator|( ForwardRng& r,
- unique_forwarder )
- {
- return unique_range<ForwardRng>(r);
- }
-
- template< class ForwardRng >
- inline unique_range<const ForwardRng>
- operator|( const ForwardRng& r,
- unique_forwarder )
- {
- return unique_range<const ForwardRng>(r);
- }
-
- } // 'range_detail'
-
- using range_detail::unique_range;
-
- namespace adaptors
- {
- namespace
- {
- const range_detail::unique_forwarder uniqued =
- range_detail::unique_forwarder();
- }
-
- template<class ForwardRange>
- inline unique_range<ForwardRange>
- unique(ForwardRange& rng)
- {
- return unique_range<ForwardRange>(rng);
- }
-
- template<class ForwardRange>
- inline unique_range<const ForwardRange>
- unique(const ForwardRange& rng)
- {
- return unique_range<const ForwardRange>(rng);
+ namespace range_detail
+ {
+ struct unique_forwarder { };
+
+ struct unique_not_equal_to
+ {
+ typedef bool result_type;
+
+ template< class T >
+ bool operator()( const T& l, const T& r ) const
+ {
+ return !(l == r);
+ }
+ };
+
+ template<class ForwardRng>
+ class unique_range : public adjacent_filter_range<unique_not_equal_to, ForwardRng, true>
+ {
+ typedef adjacent_filter_range<unique_not_equal_to, ForwardRng, true> base;
+ public:
+ explicit unique_range(ForwardRng& rng)
+ : base(unique_not_equal_to(), rng)
+ {
+ }
+ };
+
+ template< class ForwardRng >
+ inline unique_range<ForwardRng>
+ operator|( ForwardRng& r,
+ unique_forwarder )
+ {
+ return unique_range<ForwardRng>(r);
}
- } // 'adaptors'
+
+ template< class ForwardRng >
+ inline unique_range<const ForwardRng>
+ operator|( const ForwardRng& r,
+ unique_forwarder )
+ {
+ return unique_range<const ForwardRng>(r);
+ }
+
+ } // 'range_detail'
+
+ using range_detail::unique_range;
+
+ namespace adaptors
+ {
+ namespace
+ {
+ const range_detail::unique_forwarder uniqued =
+ range_detail::unique_forwarder();
+ }
+
+ template<class ForwardRange>
+ inline unique_range<ForwardRange>
+ unique(ForwardRange& rng)
+ {
+ return unique_range<ForwardRange>(rng);
+ }
+
+ template<class ForwardRange>
+ inline unique_range<const ForwardRange>
+ unique(const ForwardRange& rng)
+ {
+ return unique_range<const ForwardRange>(rng);
+ }
+ } // 'adaptors'
}
Modified: branches/release/boost/range/adaptors.hpp
==============================================================================
--- branches/release/boost/range/adaptors.hpp (original)
+++ branches/release/boost/range/adaptors.hpp 2010-04-23 18:50:56 EDT (Fri, 23 Apr 2010)
@@ -22,8 +22,9 @@
#include <boost/range/adaptor/replaced_if.hpp>
#include <boost/range/adaptor/reversed.hpp>
#include <boost/range/adaptor/sliced.hpp>
+#include <boost/range/adaptor/strided.hpp>
#include <boost/range/adaptor/tokenized.hpp>
#include <boost/range/adaptor/transformed.hpp>
#include <boost/range/adaptor/uniqued.hpp>
-#endif
+#endif
Modified: branches/release/boost/range/algorithm/equal.hpp
==============================================================================
--- branches/release/boost/range/algorithm/equal.hpp (original)
+++ branches/release/boost/range/algorithm/equal.hpp 2010-04-23 18:50:56 EDT (Fri, 23 Apr 2010)
@@ -20,7 +20,7 @@
{
// An implementation of equality comparison that is optimized for iterator
// traversal categories less than RandomAccessTraversal.
- template< class SinglePassTraversalReadableIterator1,
+ template< class SinglePassTraversalReadableIterator1,
class SinglePassTraversalReadableIterator2,
class IteratorCategoryTag1,
class IteratorCategoryTag2 >
Modified: branches/release/boost/range/algorithm/generate.hpp
==============================================================================
--- branches/release/boost/range/algorithm/generate.hpp (original)
+++ branches/release/boost/range/algorithm/generate.hpp 2010-04-23 18:50:56 EDT (Fri, 23 Apr 2010)
@@ -33,15 +33,6 @@
return rng;
}
-/// \overload
-template< class ForwardRange, class Generator >
-inline const ForwardRange& generate(const ForwardRange& rng, Generator gen)
-{
- BOOST_RANGE_CONCEPT_ASSERT(( ForwardRangeConcept<const ForwardRange> ));
- std::generate(boost::begin(rng), boost::end(rng), gen);
- return rng;
-}
-
} // namespace range
using range::generate;
} // namespace boost
Modified: branches/release/boost/range/algorithm/heap_algorithm.hpp
==============================================================================
--- branches/release/boost/range/algorithm/heap_algorithm.hpp (original)
+++ branches/release/boost/range/algorithm/heap_algorithm.hpp 2010-04-23 18:50:56 EDT (Fri, 23 Apr 2010)
@@ -27,34 +27,20 @@
/// \pre RandomAccessRange is a model of the RandomAccessRangeConcept
/// \pre Compare is a model of the BinaryPredicateConcept
template<class RandomAccessRange>
-inline void push_heap(RandomAccessRange& rng)
+inline RandomAccessRange& push_heap(RandomAccessRange& rng)
{
BOOST_RANGE_CONCEPT_ASSERT(( RandomAccessRangeConcept<RandomAccessRange> ));
std::push_heap(boost::begin(rng), boost::end(rng));
-}
-
-/// \overload
-template<class RandomAccessRange>
-inline void 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);
-}
-
-/// \overload
-template<class RandomAccessRange, class Compare>
-inline void 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 +50,20 @@
/// \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));
-}
-
-/// \overload
-template<class RandomAccessRange>
-inline void 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);
-}
-
-/// \overload
-template<class RandomAccessRange, class Compare>
-inline void 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 +73,20 @@
/// \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));
-}
-
-/// \overload
-template<class RandomAccessRange>
-inline void 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);
-}
-
-/// \overload
-template<class RandomAccessRange, class Compare>
-inline void 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 +96,20 @@
/// \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));
-}
-
-/// \overload
-template<class RandomAccessRange>
-inline void 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);
-}
-
-/// \overload
-template<class RandomAccessRange, class Compare>
-inline void 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: branches/release/boost/range/algorithm/nth_element.hpp
==============================================================================
--- branches/release/boost/range/algorithm/nth_element.hpp (original)
+++ branches/release/boost/range/algorithm/nth_element.hpp 2010-04-23 18:50:56 EDT (Fri, 23 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));
+ 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);
+ std::nth_element(boost::begin(rng), nth, boost::end(rng), sort_pred);
+ return rng;
}
} // namespace range
Modified: branches/release/boost/range/algorithm/partial_sort.hpp
==============================================================================
--- branches/release/boost/range/algorithm/partial_sort.hpp (original)
+++ branches/release/boost/range/algorithm/partial_sort.hpp 2010-04-23 18:50:56 EDT (Fri, 23 Apr 2010)
@@ -27,41 +27,24 @@
/// \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));
-}
-
-/// \overload
-template<class RandomAccessRange>
-inline void 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);
-}
-
-/// \overload
-template<class RandomAccessRange, class BinaryPredicate>
-inline void 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: branches/release/boost/range/algorithm/partial_sort_copy.hpp
==============================================================================
--- branches/release/boost/range/algorithm/partial_sort_copy.hpp (original)
+++ branches/release/boost/range/algorithm/partial_sort_copy.hpp 2010-04-23 18:50:56 EDT (Fri, 23 Apr 2010)
@@ -28,30 +28,24 @@
/// \pre SinglePassRange is a model of the SinglePassRangeConcept
/// \pre RandomAccessRange is a model of the Mutable_RandomAccessRangeConcept
/// \pre BinaryPredicate is a model of the BinaryPredicateConcept
-template<typename SinglePassRange, typename RandomAccessRange>
-inline typename range_iterator<RandomAccessRange>::type
+template<class SinglePassRange, class RandomAccessRange>
+inline BOOST_DEDUCED_TYPENAME range_iterator<RandomAccessRange>::type
partial_sort_copy(const SinglePassRange& rng1, RandomAccessRange& rng2)
{
BOOST_RANGE_CONCEPT_ASSERT((SinglePassRangeConcept<SinglePassRange>));
- BOOST_RANGE_CONCEPT_ASSERT((WriteableRandomAccessRangeConcept<RandomAccessRange>));
- BOOST_RANGE_CONCEPT_ASSERT((range_detail::SameTypeConcept<typename range_value<SinglePassRange>::type, typename range_value<RandomAccessRange>::type>));
- BOOST_RANGE_CONCEPT_ASSERT((LessThanComparableConcept<typename range_value<SinglePassRange>::type>));
return std::partial_sort_copy(boost::begin(rng1), boost::end(rng1),
boost::begin(rng2), boost::end(rng2));
}
/// \overload
-template<typename SinglePassRange, typename RandomAccessRange,
- typename BinaryPredicate>
-inline typename range_iterator<RandomAccessRange>::type
+template<class SinglePassRange, class RandomAccessRange,
+ class BinaryPredicate>
+inline BOOST_DEDUCED_TYPENAME range_iterator<RandomAccessRange>::type
partial_sort_copy(const SinglePassRange& rng1, RandomAccessRange& rng2,
BinaryPredicate pred)
{
BOOST_RANGE_CONCEPT_ASSERT((SinglePassRangeConcept<SinglePassRange>));
- BOOST_RANGE_CONCEPT_ASSERT((WriteableRandomAccessRangeConcept<RandomAccessRange>));
- BOOST_RANGE_CONCEPT_ASSERT((range_detail::SameTypeConcept<typename range_value<SinglePassRange>::type, typename range_value<RandomAccessRange>::type>));
- BOOST_RANGE_CONCEPT_ASSERT((BinaryPredicateConcept<BinaryPredicate, typename range_value<RandomAccessRange>::type, typename range_value<RandomAccessRange>::type>));
return std::partial_sort_copy(boost::begin(rng1), boost::end(rng1),
boost::begin(rng2), boost::end(rng2), pred);
Modified: branches/release/boost/range/algorithm/partition.hpp
==============================================================================
--- branches/release/boost/range/algorithm/partition.hpp (original)
+++ branches/release/boost/range/algorithm/partition.hpp 2010-04-23 18:50:56 EDT (Fri, 23 Apr 2010)
@@ -34,15 +34,6 @@
return std::partition(boost::begin(rng),boost::end(rng),pred);
}
-/// \overload
-template<class ForwardRange, class UnaryPredicate>
-inline BOOST_DEDUCED_TYPENAME range_iterator<const ForwardRange>::type
-partition(const ForwardRange& rng, UnaryPredicate pred)
-{
- BOOST_RANGE_CONCEPT_ASSERT(( ForwardRangeConcept<const ForwardRange> ));
- return std::partition(boost::begin(rng),boost::end(rng),pred);
-}
-
// range_return overloads
/// \overload
@@ -56,17 +47,6 @@
pack(std::partition(boost::begin(rng), boost::end(rng), pred), rng);
}
-/// \overload
-template< range_return_value re, class ForwardRange,
- class UnaryPredicate >
-inline BOOST_DEDUCED_TYPENAME range_return<const ForwardRange,re>::type
-partition(const ForwardRange& rng, UnaryPredicate pred)
-{
- BOOST_RANGE_CONCEPT_ASSERT(( ForwardRangeConcept<const ForwardRange> ));
- return boost::range_return<const ForwardRange,re>::
- pack(std::partition(boost::begin(rng), boost::end(rng), pred), rng);
-}
-
} // namespace range
using range::partition;
} // namespace boost
Modified: branches/release/boost/range/algorithm/random_shuffle.hpp
==============================================================================
--- branches/release/boost/range/algorithm/random_shuffle.hpp (original)
+++ branches/release/boost/range/algorithm/random_shuffle.hpp 2010-04-23 18:50:56 EDT (Fri, 23 Apr 2010)
@@ -35,15 +35,6 @@
}
/// \overload
-template<class RandomAccessRange>
-inline const RandomAccessRange& random_shuffle(const RandomAccessRange& rng)
-{
- BOOST_RANGE_CONCEPT_ASSERT(( RandomAccessRangeConcept<const RandomAccessRange> ));
- std::random_shuffle(boost::begin(rng),boost::end(rng));
- return rng;
-}
-
-/// \overload
template<class RandomAccessRange, class Generator>
inline RandomAccessRange& random_shuffle(RandomAccessRange& rng, Generator& gen)
{
@@ -52,15 +43,6 @@
return rng;
}
-/// \overload
-template<class RandomAccessRange, class Generator>
-inline const RandomAccessRange& random_shuffle(const RandomAccessRange& rng, Generator& gen)
-{
- BOOST_RANGE_CONCEPT_ASSERT(( RandomAccessRangeConcept<const RandomAccessRange> ));
- std::random_shuffle(boost::begin(rng), boost::end(rng), gen);
- return rng;
-}
-
} // namespace range
using range::random_shuffle;
} // namespace boost
Modified: branches/release/boost/range/algorithm/remove.hpp
==============================================================================
--- branches/release/boost/range/algorithm/remove.hpp (original)
+++ branches/release/boost/range/algorithm/remove.hpp 2010-04-23 18:50:56 EDT (Fri, 23 Apr 2010)
@@ -34,15 +34,6 @@
return std::remove(boost::begin(rng),boost::end(rng),val);
}
-/// \overload
-template< class ForwardRange, class Value >
-inline BOOST_DEDUCED_TYPENAME range_iterator<const ForwardRange>::type
-remove(const ForwardRange& rng, const Value& val)
-{
- BOOST_RANGE_CONCEPT_ASSERT(( ForwardRangeConcept<const ForwardRange> ));
- return std::remove(boost::begin(rng),boost::end(rng),val);
-}
-
// range_return overloads
/// \overload
@@ -56,17 +47,6 @@
rng);
}
-/// \overload
-template< range_return_value re, class ForwardRange, class Value >
-inline BOOST_DEDUCED_TYPENAME range_return<const ForwardRange,re>::type
-remove(const ForwardRange& rng, const Value& val)
-{
- BOOST_RANGE_CONCEPT_ASSERT(( ForwardRangeConcept<const ForwardRange> ));
- return range_return<const ForwardRange,re>::pack(
- std::remove(boost::begin(rng), boost::end(rng), val),
- rng);
-}
-
} // namespace range
using range::remove;
} // namespace boost
Modified: branches/release/boost/range/algorithm/remove_copy_if.hpp
==============================================================================
--- branches/release/boost/range/algorithm/remove_copy_if.hpp (original)
+++ branches/release/boost/range/algorithm/remove_copy_if.hpp 2010-04-23 18:50:56 EDT (Fri, 23 Apr 2010)
@@ -31,7 +31,7 @@
remove_copy_if(SinglePassRange& rng, OutputIterator out_it, Predicate pred)
{
boost::function_requires< SinglePassRangeConcept<SinglePassRange> >();
- return std::remove_copy_if(boost::begin(rng), boost::end(rng), out_it, pred);
+ return std::remove_copy_if(boost::begin(rng), boost::end(rng), out_it, pred);
}
}
Modified: branches/release/boost/range/algorithm/remove_if.hpp
==============================================================================
--- branches/release/boost/range/algorithm/remove_if.hpp (original)
+++ branches/release/boost/range/algorithm/remove_if.hpp 2010-04-23 18:50:56 EDT (Fri, 23 Apr 2010)
@@ -35,15 +35,6 @@
return std::remove_if(boost::begin(rng), boost::end(rng), pred);
}
-/// \overload
-template< class ForwardRange, class UnaryPredicate >
-inline BOOST_DEDUCED_TYPENAME boost::range_iterator<const ForwardRange>::type
-remove_if(const ForwardRange& rng, UnaryPredicate pred)
-{
- BOOST_RANGE_CONCEPT_ASSERT(( ForwardRangeConcept<const ForwardRange> ));
- return std::remove_if(boost::begin(rng),boost::end(rng),pred);
-}
-
// range_return overloads
/// \overload
@@ -57,17 +48,6 @@
rng);
}
-/// \overload
-template< range_return_value re, class ForwardRange, class UnaryPredicate >
-inline BOOST_DEDUCED_TYPENAME range_return<const ForwardRange,re>::type
-remove_if(const ForwardRange& rng, UnaryPredicate pred)
-{
- BOOST_RANGE_CONCEPT_ASSERT(( ForwardRangeConcept<const ForwardRange> ));
- return range_return<const ForwardRange,re>::pack(
- std::remove_if(boost::begin(rng), boost::end(rng), pred),
- rng);
-}
-
} // namespace range
using range::remove_if;
} // namespace boost
Modified: branches/release/boost/range/algorithm/replace.hpp
==============================================================================
--- branches/release/boost/range/algorithm/replace.hpp (original)
+++ branches/release/boost/range/algorithm/replace.hpp 2010-04-23 18:50:56 EDT (Fri, 23 Apr 2010)
@@ -35,17 +35,6 @@
return rng;
}
-/// \overload
-template< class ForwardRange, class Value >
-inline const ForwardRange&
-replace(const ForwardRange& rng, const Value& what,
- const Value& with_what)
-{
- BOOST_RANGE_CONCEPT_ASSERT(( ForwardRangeConcept<const ForwardRange> ));
- std::replace(boost::begin(rng), boost::end(rng), what, with_what);
- return rng;
-}
-
} // namespace range
using range::replace;
} // namespace boost;
Modified: branches/release/boost/range/algorithm/replace_if.hpp
==============================================================================
--- branches/release/boost/range/algorithm/replace_if.hpp (original)
+++ branches/release/boost/range/algorithm/replace_if.hpp 2010-04-23 18:50:56 EDT (Fri, 23 Apr 2010)
@@ -36,17 +36,6 @@
return rng;
}
-/// \overload
-template< class ForwardRange, class UnaryPredicate, class Value >
-inline const ForwardRange&
- replace_if(const ForwardRange& rng, UnaryPredicate pred,
- const Value& val)
-{
- BOOST_RANGE_CONCEPT_ASSERT(( ForwardRangeConcept<const ForwardRange> ));
- std::replace_if(boost::begin(rng), boost::end(rng), pred, val);
- return rng;
-}
-
} // namespace range
using range::replace_if;
} // namespace boost
Modified: branches/release/boost/range/algorithm/reverse.hpp
==============================================================================
--- branches/release/boost/range/algorithm/reverse.hpp (original)
+++ branches/release/boost/range/algorithm/reverse.hpp 2010-04-23 18:50:56 EDT (Fri, 23 Apr 2010)
@@ -34,15 +34,6 @@
return rng;
}
-/// \overload
-template<class BidirectionalRange>
-inline const BidirectionalRange& reverse(const BidirectionalRange& rng)
-{
- BOOST_RANGE_CONCEPT_ASSERT(( BidirectionalRangeConcept<const BidirectionalRange> ));
- std::reverse(boost::begin(rng), boost::end(rng));
- return rng;
-}
-
} // namespace range
using range::reverse;
} // namespace boost
Modified: branches/release/boost/range/algorithm/reverse_copy.hpp
==============================================================================
--- branches/release/boost/range/algorithm/reverse_copy.hpp (original)
+++ branches/release/boost/range/algorithm/reverse_copy.hpp 2010-04-23 18:50:56 EDT (Fri, 23 Apr 2010)
@@ -26,15 +26,7 @@
/// range-based version of the reverse_copy std algorithm
///
/// \pre BidirectionalRange is a model of the BidirectionalRangeConcept
-template<typename BidirectionalRange, typename OutputIterator>
-inline OutputIterator reverse_copy(BidirectionalRange& rng, OutputIterator out)
-{
- BOOST_RANGE_CONCEPT_ASSERT(( BidirectionalRangeConcept<BidirectionalRange> ));
- return std::reverse_copy(boost::begin(rng), boost::end(rng), out);
-}
-
-/// \overload
-template<typename BidirectionalRange, typename OutputIterator>
+template<class BidirectionalRange, class OutputIterator>
inline OutputIterator reverse_copy(const BidirectionalRange& rng, OutputIterator out)
{
BOOST_RANGE_CONCEPT_ASSERT(( BidirectionalRangeConcept<BidirectionalRange> ));
Modified: branches/release/boost/range/algorithm/rotate.hpp
==============================================================================
--- branches/release/boost/range/algorithm/rotate.hpp (original)
+++ branches/release/boost/range/algorithm/rotate.hpp 2010-04-23 18:50:56 EDT (Fri, 23 Apr 2010)
@@ -25,26 +25,15 @@
/// range-based version of the rotate std algorithm
///
/// \pre Rng meets the requirements for a Forward range
-template<typename ForwardRange>
+template<class ForwardRange>
inline ForwardRange& rotate(ForwardRange& rng,
- typename range_iterator<ForwardRange>::type middle)
+ BOOST_DEDUCED_TYPENAME range_iterator<ForwardRange>::type middle)
{
BOOST_RANGE_CONCEPT_ASSERT(( ForwardRangeConcept<ForwardRange> ));
std::rotate(boost::begin(rng), middle, boost::end(rng));
return rng;
}
-/// \overload
-template<typename ForwardRange>
-inline const ForwardRange&
- rotate(const ForwardRange& rng,
- typename range_iterator<const ForwardRange>::type middle)
-{
- BOOST_RANGE_CONCEPT_ASSERT(( ForwardRangeConcept<const ForwardRange> ));
- std::rotate(boost::begin(rng), middle, boost::end(rng));
- return rng;
-}
-
} // namespace range
using range::rotate;
} // namespace boost
Modified: branches/release/boost/range/algorithm/rotate_copy.hpp
==============================================================================
--- branches/release/boost/range/algorithm/rotate_copy.hpp (original)
+++ branches/release/boost/range/algorithm/rotate_copy.hpp 2010-04-23 18:50:56 EDT (Fri, 23 Apr 2010)
@@ -28,9 +28,9 @@
/// \pre Rng meets the requirements for a Forward range
template<typename ForwardRange, typename OutputIterator>
inline OutputIterator rotate_copy(
- const ForwardRange& rng,
- typename range_iterator<const ForwardRange>::type middle,
- OutputIterator target
+ const ForwardRange& rng,
+ BOOST_DEDUCED_TYPENAME range_iterator<const ForwardRange>::type middle,
+ OutputIterator target
)
{
BOOST_RANGE_CONCEPT_ASSERT(( ForwardRangeConcept<const ForwardRange> ));
Modified: branches/release/boost/range/algorithm/search.hpp
==============================================================================
--- branches/release/boost/range/algorithm/search.hpp (original)
+++ branches/release/boost/range/algorithm/search.hpp 2010-04-23 18:50:56 EDT (Fri, 23 Apr 2010)
@@ -45,8 +45,8 @@
{
BOOST_RANGE_CONCEPT_ASSERT(( ForwardRangeConcept<const ForwardRange1> ));
BOOST_RANGE_CONCEPT_ASSERT(( ForwardRangeConcept<const ForwardRange2> ));
- return std::search(boost::begin(rng1),boost::end(rng1),
- boost::begin(rng2),boost::end(rng2));
+ return std::search(boost::begin(rng1), boost::end(rng1),
+ boost::begin(rng2), boost::end(rng2));
}
/// \overload
@@ -63,13 +63,12 @@
/// \overload
template< class ForwardRange1, class ForwardRange2, class BinaryPredicate >
inline BOOST_DEDUCED_TYPENAME range_iterator<const ForwardRange1>::type
-search(const ForwardRange1& rng1, const ForwardRange2& rng2,
- BinaryPredicate pred)
+search(const ForwardRange1& rng1, const ForwardRange2& rng2, BinaryPredicate pred)
{
BOOST_RANGE_CONCEPT_ASSERT(( ForwardRangeConcept<const ForwardRange1> ));
BOOST_RANGE_CONCEPT_ASSERT(( ForwardRangeConcept<const ForwardRange2> ));
- return std::search(boost::begin(rng1),boost::end(rng1),
- boost::begin(rng2),boost::end(rng2),pred);
+ return std::search(boost::begin(rng1), boost::end(rng1),
+ boost::begin(rng2), boost::end(rng2), pred);
}
// range_return overloads
@@ -118,8 +117,7 @@
template< range_return_value re, class ForwardRange1, class ForwardRange2,
class BinaryPredicate >
inline BOOST_DEDUCED_TYPENAME range_return<const ForwardRange1,re>::type
-search(const ForwardRange1& rng1, const ForwardRange2& rng2,
- BinaryPredicate pred)
+search(const ForwardRange1& rng1, const ForwardRange2& rng2, BinaryPredicate pred)
{
BOOST_RANGE_CONCEPT_ASSERT(( ForwardRangeConcept<const ForwardRange1> ));
BOOST_RANGE_CONCEPT_ASSERT(( ForwardRangeConcept<const ForwardRange2> ));
Modified: branches/release/boost/range/algorithm/search_n.hpp
==============================================================================
--- branches/release/boost/range/algorithm/search_n.hpp (original)
+++ branches/release/boost/range/algorithm/search_n.hpp 2010-04-23 18:50:56 EDT (Fri, 23 Apr 2010)
@@ -31,8 +31,8 @@
/// \pre Value is a model of the EqualityComparableConcept
/// \pre ForwardRange's value type is a model of the EqualityComparableConcept
/// \pre Object's of ForwardRange's value type can be compared for equality with Objects of type Value
-template< typename ForwardRange, typename Integer, typename Value >
-inline typename range_iterator<ForwardRange>::type
+template< class ForwardRange, class Integer, class Value >
+inline BOOST_DEDUCED_TYPENAME range_iterator<ForwardRange>::type
search_n(ForwardRange& rng, Integer count, const Value& value)
{
BOOST_RANGE_CONCEPT_ASSERT((ForwardRangeConcept<ForwardRange>));
@@ -40,8 +40,8 @@
}
/// \overload
-template< typename ForwardRange, typename Integer, typename Value >
-inline typename range_iterator<const ForwardRange>::type
+template< class ForwardRange, class Integer, class Value >
+inline BOOST_DEDUCED_TYPENAME range_iterator<const ForwardRange>::type
search_n(const ForwardRange& rng, Integer count, const Value& value)
{
BOOST_RANGE_CONCEPT_ASSERT((ForwardRangeConcept<ForwardRange>));
@@ -49,29 +49,29 @@
}
/// \overload
-template< typename ForwardRange, typename Integer, class Value,
- typename BinaryPredicate >
-inline typename range_iterator<ForwardRange>::type
+template< class ForwardRange, class Integer, class Value,
+ class BinaryPredicate >
+inline BOOST_DEDUCED_TYPENAME range_iterator<ForwardRange>::type
search_n(ForwardRange& rng, Integer count, const Value& value,
BinaryPredicate binary_pred)
{
BOOST_RANGE_CONCEPT_ASSERT((ForwardRangeConcept<ForwardRange>));
BOOST_RANGE_CONCEPT_ASSERT((BinaryPredicateConcept<BinaryPredicate,
- typename range_value<ForwardRange>::type, const Value&>));
+ BOOST_DEDUCED_TYPENAME range_value<ForwardRange>::type, const Value&>));
return std::search_n(boost::begin(rng), boost::end(rng),
count, value, binary_pred);
}
/// \overload
-template< typename ForwardRange, typename Integer, typename Value,
- typename BinaryPredicate >
-inline typename range_iterator<const ForwardRange>::type
+template< class ForwardRange, class Integer, class Value,
+ class BinaryPredicate >
+inline BOOST_DEDUCED_TYPENAME range_iterator<const ForwardRange>::type
search_n(const ForwardRange& rng, Integer count, const Value& value,
BinaryPredicate binary_pred)
{
BOOST_RANGE_CONCEPT_ASSERT((ForwardRangeConcept<ForwardRange>));
BOOST_RANGE_CONCEPT_ASSERT((BinaryPredicateConcept<BinaryPredicate,
- typename range_value<const ForwardRange>::type, const Value&>));
+ BOOST_DEDUCED_TYPENAME range_value<const ForwardRange>::type, const Value&>));
return std::search_n(boost::begin(rng), boost::end(rng),
count, value, binary_pred);
}
@@ -79,9 +79,9 @@
// range_return overloads
/// \overload
-template< range_return_value re, typename ForwardRange, typename Integer,
- typename Value >
-inline typename range_return<ForwardRange,re>::type
+template< range_return_value re, class ForwardRange, class Integer,
+ class Value >
+inline BOOST_DEDUCED_TYPENAME range_return<ForwardRange,re>::type
search_n(ForwardRange& rng, Integer count, const Value& value)
{
BOOST_RANGE_CONCEPT_ASSERT((ForwardRangeConcept<ForwardRange>));
@@ -92,9 +92,9 @@
}
/// \overload
-template< range_return_value re, typename ForwardRange, typename Integer,
+template< range_return_value re, class ForwardRange, class Integer,
class Value >
-inline typename range_return<const ForwardRange,re>::type
+inline BOOST_DEDUCED_TYPENAME range_return<const ForwardRange,re>::type
search_n(const ForwardRange& rng, Integer count, const Value& value)
{
BOOST_RANGE_CONCEPT_ASSERT((ForwardRangeConcept<ForwardRange>));
@@ -105,15 +105,15 @@
}
/// \overload
-template< range_return_value re, typename ForwardRange, typename Integer,
- typename Value, typename BinaryPredicate >
-inline typename range_return<ForwardRange,re>::type
+template< range_return_value re, class ForwardRange, class Integer,
+ class Value, class BinaryPredicate >
+inline BOOST_DEDUCED_TYPENAME range_return<ForwardRange,re>::type
search_n(ForwardRange& rng, Integer count, const Value& value,
BinaryPredicate pred)
{
BOOST_RANGE_CONCEPT_ASSERT((ForwardRangeConcept<ForwardRange>));
BOOST_RANGE_CONCEPT_ASSERT((BinaryPredicateConcept<BinaryPredicate,
- typename range_value<ForwardRange>::type,
+ BOOST_DEDUCED_TYPENAME range_value<ForwardRange>::type,
const Value&>));
return range_return<ForwardRange,re>::
pack(std::search_n(boost::begin(rng), boost::end(rng),
@@ -122,15 +122,15 @@
}
/// \overload
-template< range_return_value re, typename ForwardRange, typename Integer,
- typename Value, typename BinaryPredicate >
-inline typename range_return<const ForwardRange,re>::type
+template< range_return_value re, class ForwardRange, class Integer,
+ class Value, class BinaryPredicate >
+inline BOOST_DEDUCED_TYPENAME range_return<const ForwardRange,re>::type
search_n(const ForwardRange& rng, Integer count, const Value& value,
BinaryPredicate pred)
{
BOOST_RANGE_CONCEPT_ASSERT((ForwardRangeConcept<ForwardRange>));
BOOST_RANGE_CONCEPT_ASSERT((BinaryPredicateConcept<BinaryPredicate,
- typename range_value<const ForwardRange>::type,
+ BOOST_DEDUCED_TYPENAME range_value<const ForwardRange>::type,
const Value&>));
return range_return<const ForwardRange,re>::
pack(std::search_n(boost::begin(rng), boost::end(rng),
Modified: branches/release/boost/range/algorithm/sort.hpp
==============================================================================
--- branches/release/boost/range/algorithm/sort.hpp (original)
+++ branches/release/boost/range/algorithm/sort.hpp 2010-04-23 18:50:56 EDT (Fri, 23 Apr 2010)
@@ -35,15 +35,6 @@
}
/// \overload
-template<class RandomAccessRange>
-inline const RandomAccessRange& sort(const RandomAccessRange& rng)
-{
- BOOST_RANGE_CONCEPT_ASSERT(( RandomAccessRangeConcept<const RandomAccessRange> ));
- std::sort(boost::begin(rng),boost::end(rng));
- return rng;
-}
-
-/// \overload
template<class RandomAccessRange, class BinaryPredicate>
inline RandomAccessRange& sort(RandomAccessRange& rng, BinaryPredicate pred)
{
@@ -52,15 +43,6 @@
return rng;
}
-/// \overload
-template<class RandomAccessRange, class BinaryPredicate>
-inline const RandomAccessRange& sort(const RandomAccessRange& rng, BinaryPredicate pred)
-{
- BOOST_RANGE_CONCEPT_ASSERT(( RandomAccessRangeConcept<const RandomAccessRange> ));
- std::sort(boost::begin(rng), boost::end(rng), pred);
- return rng;
-}
-
} // namespace range
using range::sort;
} // namespace boost
Modified: branches/release/boost/range/algorithm/stable_sort.hpp
==============================================================================
--- branches/release/boost/range/algorithm/stable_sort.hpp (original)
+++ branches/release/boost/range/algorithm/stable_sort.hpp 2010-04-23 18:50:56 EDT (Fri, 23 Apr 2010)
@@ -35,15 +35,6 @@
}
/// \overload
-template<class RandomAccessRange>
-inline const RandomAccessRange& stable_sort(const RandomAccessRange& rng)
-{
- BOOST_RANGE_CONCEPT_ASSERT(( RandomAccessRangeConcept<const RandomAccessRange> ));
- std::stable_sort(boost::begin(rng), boost::end(rng));
- return rng;
-}
-
-/// \overload
template<class RandomAccessRange, class BinaryPredicate>
inline RandomAccessRange& stable_sort(RandomAccessRange& rng, BinaryPredicate sort_pred)
{
@@ -52,15 +43,6 @@
return rng;
}
-/// \overload
-template<class RandomAccessRange, class BinaryPredicate>
-inline const RandomAccessRange& stable_sort(const RandomAccessRange& rng, BinaryPredicate sort_pred)
-{
- BOOST_RANGE_CONCEPT_ASSERT(( RandomAccessRangeConcept<const RandomAccessRange> ));
- std::stable_sort(boost::begin(rng), boost::end(rng), sort_pred);
- return rng;
-}
-
} // namespace range
using range::stable_sort;
} // namespace boost
Modified: branches/release/boost/range/algorithm/swap_ranges.hpp
==============================================================================
--- branches/release/boost/range/algorithm/swap_ranges.hpp (original)
+++ branches/release/boost/range/algorithm/swap_ranges.hpp 2010-04-23 18:50:56 EDT (Fri, 23 Apr 2010)
@@ -22,7 +22,7 @@
{
namespace range_detail
{
- template<typename Iterator1, typename Iterator2>
+ template<class Iterator1, class Iterator2>
void swap_ranges_impl(Iterator1 it1, Iterator1 last1,
Iterator2 it2, Iterator2 last2,
single_pass_traversal_tag,
@@ -36,7 +36,7 @@
}
}
- template<typename Iterator1, typename Iterator2>
+ template<class Iterator1, class Iterator2>
void swap_ranges_impl(Iterator1 it1, Iterator1 last1,
Iterator2 it2, Iterator2 last2,
random_access_traversal_tag,
@@ -47,13 +47,13 @@
std::swap_ranges(it1, last1, it2);
}
- template<typename Iterator1, typename Iterator2>
+ template<class Iterator1, class Iterator2>
void swap_ranges_impl(Iterator1 first1, Iterator1 last1,
Iterator2 first2, Iterator2 last2)
{
swap_ranges_impl(first1, last1, first2, last2,
- typename iterator_traversal<Iterator1>::type(),
- typename iterator_traversal<Iterator2>::type());
+ BOOST_DEDUCED_TYPENAME iterator_traversal<Iterator1>::type(),
+ BOOST_DEDUCED_TYPENAME iterator_traversal<Iterator2>::type());
}
} // namespace range_detail
@@ -66,7 +66,7 @@
///
/// \pre SinglePassRange1 is a model of the SinglePassRangeConcept
/// \pre SinglePassRange2 is a model of the SinglePassRangeConcept
-template< typename SinglePassRange1, typename SinglePassRange2 >
+template< class SinglePassRange1, class SinglePassRange2 >
inline SinglePassRange2&
swap_ranges(SinglePassRange1& range1, SinglePassRange2& range2)
{
Modified: branches/release/boost/range/algorithm_ext/for_each.hpp
==============================================================================
--- branches/release/boost/range/algorithm_ext/for_each.hpp (original)
+++ branches/release/boost/range/algorithm_ext/for_each.hpp 2010-04-23 18:50:56 EDT (Fri, 23 Apr 2010)
@@ -19,55 +19,55 @@
namespace boost
{
- namespace range_detail
- {
- template<class InputIterator1, class InputIterator2, class Fn2>
- inline Fn2 for_each_impl(InputIterator1 first1, InputIterator1 last1,
- InputIterator2 first2, InputIterator2 last2,
- Fn2 fn)
- {
- for (; first1 != last1 && first2 != last2; ++first1, ++first2)
- {
- fn(*first1, *first2);
- }
- return fn;
- }
- }
-
- namespace range
- {
- template<class SinglePassRange1, class SinglePassRange2, class Fn2>
- inline Fn2 for_each(const SinglePassRange1& rng1, const SinglePassRange2& rng2, Fn2 fn)
- {
- BOOST_RANGE_CONCEPT_ASSERT(( SinglePassRangeConcept<const SinglePassRange1> ));
- BOOST_RANGE_CONCEPT_ASSERT(( SinglePassRangeConcept<const SinglePassRange2> ));
+ namespace range_detail
+ {
+ template<class InputIterator1, class InputIterator2, class Fn2>
+ inline Fn2 for_each_impl(InputIterator1 first1, InputIterator1 last1,
+ InputIterator2 first2, InputIterator2 last2,
+ Fn2 fn)
+ {
+ for (; first1 != last1 && first2 != last2; ++first1, ++first2)
+ {
+ fn(*first1, *first2);
+ }
+ return fn;
+ }
+ }
+
+ namespace range
+ {
+ template<class SinglePassRange1, class SinglePassRange2, class Fn2>
+ inline Fn2 for_each(const SinglePassRange1& rng1, const SinglePassRange2& rng2, Fn2 fn)
+ {
+ BOOST_RANGE_CONCEPT_ASSERT(( SinglePassRangeConcept<const SinglePassRange1> ));
+ BOOST_RANGE_CONCEPT_ASSERT(( SinglePassRangeConcept<const SinglePassRange2> ));
- return ::boost::range_detail::for_each_impl(
+ return ::boost::range_detail::for_each_impl(
::boost::begin(rng1), ::boost::end(rng1),
::boost::begin(rng2), ::boost::end(rng2), fn);
- }
+ }
- template<class SinglePassRange1, class SinglePassRange2, class Fn2>
- inline Fn2 for_each(const SinglePassRange1& rng1, SinglePassRange2& rng2, Fn2 fn)
- {
- BOOST_RANGE_CONCEPT_ASSERT(( SinglePassRangeConcept<const SinglePassRange1> ));
- BOOST_RANGE_CONCEPT_ASSERT(( SinglePassRangeConcept<SinglePassRange2> ));
+ template<class SinglePassRange1, class SinglePassRange2, class Fn2>
+ inline Fn2 for_each(const SinglePassRange1& rng1, SinglePassRange2& rng2, Fn2 fn)
+ {
+ BOOST_RANGE_CONCEPT_ASSERT(( SinglePassRangeConcept<const SinglePassRange1> ));
+ BOOST_RANGE_CONCEPT_ASSERT(( SinglePassRangeConcept<SinglePassRange2> ));
- return ::boost::range_detail::for_each_impl(
+ return ::boost::range_detail::for_each_impl(
::boost::begin(rng1), ::boost::end(rng1),
::boost::begin(rng2), ::boost::end(rng2), fn);
- }
+ }
- template<class SinglePassRange1, class SinglePassRange2, class Fn2>
- inline Fn2 for_each(SinglePassRange1& rng1, const SinglePassRange2& rng2, Fn2 fn)
- {
- BOOST_RANGE_CONCEPT_ASSERT(( SinglePassRangeConcept<SinglePassRange1> ));
- BOOST_RANGE_CONCEPT_ASSERT(( SinglePassRangeConcept<const SinglePassRange2> ));
+ template<class SinglePassRange1, class SinglePassRange2, class Fn2>
+ inline Fn2 for_each(SinglePassRange1& rng1, const SinglePassRange2& rng2, Fn2 fn)
+ {
+ BOOST_RANGE_CONCEPT_ASSERT(( SinglePassRangeConcept<SinglePassRange1> ));
+ BOOST_RANGE_CONCEPT_ASSERT(( SinglePassRangeConcept<const SinglePassRange2> ));
- return ::boost::range_detail::for_each_impl(
+ return ::boost::range_detail::for_each_impl(
::boost::begin(rng1), ::boost::end(rng1),
::boost::begin(rng2), ::boost::end(rng2), fn);
- }
+ }
template<class SinglePassRange1, class SinglePassRange2, class Fn2>
inline Fn2 for_each(SinglePassRange1& rng1, SinglePassRange2& rng2, Fn2 fn)
@@ -79,8 +79,8 @@
::boost::begin(rng1), ::boost::end(rng1),
::boost::begin(rng2), ::boost::end(rng2), fn);
}
- } // namespace range
- using range::for_each;
+ } // namespace range
+ using range::for_each;
} // namespace boost
#endif // include guard
Modified: branches/release/boost/range/counting_range.hpp
==============================================================================
--- branches/release/boost/range/counting_range.hpp (original)
+++ branches/release/boost/range/counting_range.hpp 2010-04-23 18:50:56 EDT (Fri, 23 Apr 2010)
@@ -25,41 +25,41 @@
namespace boost
{
- template<class Value>
- inline iterator_range<counting_iterator<Value> >
- counting_range(Value first, Value last)
- {
- typedef counting_iterator<Value> counting_iterator_t;
- typedef iterator_range<counting_iterator_t> result_t;
- return result_t(counting_iterator_t(first),
- counting_iterator_t(last));
- }
+ template<class Value>
+ inline iterator_range<counting_iterator<Value> >
+ counting_range(Value first, Value last)
+ {
+ typedef counting_iterator<Value> counting_iterator_t;
+ typedef iterator_range<counting_iterator_t> result_t;
+ return result_t(counting_iterator_t(first),
+ counting_iterator_t(last));
+ }
- template<class Range>
- inline iterator_range<counting_iterator<BOOST_DEDUCED_TYPENAME range_value<const Range>::type> >
- counting_range(const Range& rng)
- {
- typedef counting_iterator<BOOST_DEDUCED_TYPENAME range_value<const Range>::type> counting_iterator_t;
- typedef iterator_range<counting_iterator_t> result_t;
- return boost::empty(rng)
- ? result_t()
- : result_t(
+ template<class Range>
+ inline iterator_range<counting_iterator<BOOST_DEDUCED_TYPENAME range_value<const Range>::type> >
+ counting_range(const Range& rng)
+ {
+ typedef counting_iterator<BOOST_DEDUCED_TYPENAME range_value<const Range>::type> counting_iterator_t;
+ typedef iterator_range<counting_iterator_t> result_t;
+ return boost::empty(rng)
+ ? result_t()
+ : result_t(
counting_iterator_t(*boost::begin(rng)),
counting_iterator_t(*boost::prior(boost::end(rng))));
- }
+ }
- template<class Range>
- inline iterator_range<counting_iterator<BOOST_DEDUCED_TYPENAME range_value<Range>::type> >
- counting_range(Range& rng)
- {
- typedef counting_iterator<BOOST_DEDUCED_TYPENAME range_value<Range>::type> counting_iterator_t;
- typedef iterator_range<counting_iterator_t> result_t;
- return boost::empty(rng)
- ? result_t()
- : result_t(
+ template<class Range>
+ inline iterator_range<counting_iterator<BOOST_DEDUCED_TYPENAME range_value<Range>::type> >
+ counting_range(Range& rng)
+ {
+ typedef counting_iterator<BOOST_DEDUCED_TYPENAME range_value<Range>::type> counting_iterator_t;
+ typedef iterator_range<counting_iterator_t> result_t;
+ return boost::empty(rng)
+ ? result_t()
+ : result_t(
counting_iterator_t(*boost::begin(rng)),
counting_iterator_t(*boost::prior(boost::end(rng))));
- }
+ }
} // namespace boost
#if BOOST_MSVC >= 1400
Modified: branches/release/boost/range/detail/demote_iterator_traversal_tag.hpp
==============================================================================
--- branches/release/boost/range/detail/demote_iterator_traversal_tag.hpp (original)
+++ branches/release/boost/range/detail/demote_iterator_traversal_tag.hpp 2010-04-23 18:50:56 EDT (Fri, 23 Apr 2010)
@@ -15,8 +15,8 @@
namespace boost
{
- namespace range_detail
- {
+ namespace range_detail
+ {
template<class IteratorTraversalTag1, class IteratorTraversalTag2>
struct demote_iterator_traversal_tag
@@ -26,7 +26,7 @@
#define BOOST_DEMOTE_TRAVERSAL_TAG( Tag1, Tag2, ResultTag ) \
template<> struct demote_iterator_traversal_tag< Tag1 , Tag2 > \
{ \
- typedef ResultTag type; \
+ typedef ResultTag type; \
};
BOOST_DEMOTE_TRAVERSAL_TAG( no_traversal_tag, no_traversal_tag, no_traversal_tag )
@@ -73,7 +73,7 @@
#undef BOOST_DEMOTE_TRAVERSAL_TAG
- } // namespace range_detail
+ } // namespace range_detail
} // namespace boost
#endif // include guard
Modified: branches/release/boost/range/istream_range.hpp
==============================================================================
--- branches/release/boost/range/istream_range.hpp (original)
+++ branches/release/boost/range/istream_range.hpp 2010-04-23 18:50:56 EDT (Fri, 23 Apr 2010)
@@ -16,19 +16,24 @@
*/
#include <iterator>
+#include <istream>
#include <boost/config.hpp>
-#include <boost/range/range.hpp>
+#include <boost/range/iterator_range.hpp>
namespace boost
{
- template<class Type, class Elem, class Traits> inline
- range<std::istream_iterator<Type, Elem, Traits> >
- istream_range(std::basic_istream<Elem, Traits>& in)
- {
- return range<std::istream_iterator<Type, Elem, Traits> >(
- std::istream_iterator<Type>(in),
- std::istream_iterator<Type>());
- }
+ namespace range
+ {
+ template<class Type, class Elem, class Traits> inline
+ iterator_range<std::istream_iterator<Type, Elem, Traits> >
+ istream_range(std::basic_istream<Elem, Traits>& in)
+ {
+ return iterator_range<std::istream_iterator<Type, Elem, Traits> >(
+ std::istream_iterator<Type>(in),
+ std::istream_iterator<Type>());
+ }
+ } // namespace range
+ using range::istream_range;
} // namespace boost
#endif // include guard
Modified: branches/release/boost/range/join.hpp
==============================================================================
--- branches/release/boost/range/join.hpp (original)
+++ branches/release/boost/range/join.hpp 2010-04-23 18:50:56 EDT (Fri, 23 Apr 2010)
@@ -21,46 +21,46 @@
template<class SinglePassRange1, class SinglePassRange2>
iterator_range<range_detail::join_iterator<
- BOOST_DEDUCED_TYPENAME range_iterator<const SinglePassRange1>::type,
- BOOST_DEDUCED_TYPENAME range_iterator<const SinglePassRange2>::type,
- BOOST_DEDUCED_TYPENAME add_const<
- BOOST_DEDUCED_TYPENAME range_value<const SinglePassRange1>::type>::type>
+ BOOST_DEDUCED_TYPENAME range_iterator<const SinglePassRange1>::type,
+ BOOST_DEDUCED_TYPENAME range_iterator<const SinglePassRange2>::type,
+ BOOST_DEDUCED_TYPENAME add_const<
+ BOOST_DEDUCED_TYPENAME range_value<const SinglePassRange1>::type>::type>
>
join(const SinglePassRange1& r1, const SinglePassRange2& r2)
{
BOOST_RANGE_CONCEPT_ASSERT(( SinglePassRangeConcept<SinglePassRange1> ));
BOOST_RANGE_CONCEPT_ASSERT(( SinglePassRangeConcept<SinglePassRange2> ));
- typedef range_detail::join_iterator<
- BOOST_DEDUCED_TYPENAME range_iterator<const SinglePassRange1>::type,
- BOOST_DEDUCED_TYPENAME range_iterator<const SinglePassRange2>::type,
- BOOST_DEDUCED_TYPENAME add_const<
- BOOST_DEDUCED_TYPENAME range_value<const SinglePassRange1>::type>::type> iterator_t;
-
- return iterator_range<iterator_t>(
- iterator_t(r1, r2, range_detail::join_iterator_begin_tag()),
- iterator_t(r1, r2, range_detail::join_iterator_end_tag()));
+ typedef range_detail::join_iterator<
+ BOOST_DEDUCED_TYPENAME range_iterator<const SinglePassRange1>::type,
+ BOOST_DEDUCED_TYPENAME range_iterator<const SinglePassRange2>::type,
+ BOOST_DEDUCED_TYPENAME add_const<
+ BOOST_DEDUCED_TYPENAME range_value<const SinglePassRange1>::type>::type> iterator_t;
+
+ return iterator_range<iterator_t>(
+ iterator_t(r1, r2, range_detail::join_iterator_begin_tag()),
+ iterator_t(r1, r2, range_detail::join_iterator_end_tag()));
}
template<class SinglePassRange1, class SinglePassRange2>
iterator_range<range_detail::join_iterator<
- BOOST_DEDUCED_TYPENAME range_iterator<SinglePassRange1>::type,
- BOOST_DEDUCED_TYPENAME range_iterator<SinglePassRange2>::type,
- BOOST_DEDUCED_TYPENAME range_value<SinglePassRange1>::type>
+ BOOST_DEDUCED_TYPENAME range_iterator<SinglePassRange1>::type,
+ BOOST_DEDUCED_TYPENAME range_iterator<SinglePassRange2>::type,
+ BOOST_DEDUCED_TYPENAME range_value<SinglePassRange1>::type>
>
join(SinglePassRange1& r1, SinglePassRange2& r2)
{
BOOST_RANGE_CONCEPT_ASSERT(( SinglePassRangeConcept<SinglePassRange1> ));
BOOST_RANGE_CONCEPT_ASSERT(( SinglePassRangeConcept<SinglePassRange2> ));
- typedef range_detail::join_iterator<
- BOOST_DEDUCED_TYPENAME range_iterator<SinglePassRange1>::type,
- BOOST_DEDUCED_TYPENAME range_iterator<SinglePassRange2>::type,
- BOOST_DEDUCED_TYPENAME range_value<SinglePassRange1>::type> iterator_t;
-
- return iterator_range<iterator_t>(
- iterator_t(r1, r2, range_detail::join_iterator_begin_tag()),
- iterator_t(r1, r2, range_detail::join_iterator_end_tag()));
+ typedef range_detail::join_iterator<
+ BOOST_DEDUCED_TYPENAME range_iterator<SinglePassRange1>::type,
+ BOOST_DEDUCED_TYPENAME range_iterator<SinglePassRange2>::type,
+ BOOST_DEDUCED_TYPENAME range_value<SinglePassRange1>::type> iterator_t;
+
+ return iterator_range<iterator_t>(
+ iterator_t(r1, r2, range_detail::join_iterator_begin_tag()),
+ iterator_t(r1, r2, range_detail::join_iterator_end_tag()));
}
} // namespace boost
Modified: branches/release/boost/range/numeric.hpp
==============================================================================
--- branches/release/boost/range/numeric.hpp (original)
+++ branches/release/boost/range/numeric.hpp 2010-04-23 18:50:56 EDT (Fri, 23 Apr 2010)
@@ -20,7 +20,7 @@
// http://www.boost.org/LICENSE_1_0.txt)
#if defined(_MSC_VER) && _MSC_VER >= 1000
- #pragma once
+ #pragma once
#endif
#ifndef BOOST_RANGE_NUMERIC_HPP
@@ -36,82 +36,82 @@
namespace boost
{
- template< class SinglePassRange, class Value >
- inline Value accumulate( const SinglePassRange& rng, Value init )
- {
+ template< class SinglePassRange, class Value >
+ inline Value accumulate( const SinglePassRange& rng, Value init )
+ {
boost::function_requires< SinglePassRangeConcept<SinglePassRange> >();
- return std::accumulate( boost::begin(rng), boost::end(rng), init );
- }
+ return std::accumulate( boost::begin(rng), boost::end(rng), init );
+ }
- template< class SinglePassRange, class Value, class BinaryOperation >
- inline Value accumulate( const SinglePassRange& rng, Value init, BinaryOperation op )
- {
+ template< class SinglePassRange, class Value, class BinaryOperation >
+ inline Value accumulate( const SinglePassRange& rng, Value init, BinaryOperation op )
+ {
boost::function_requires< SinglePassRangeConcept<SinglePassRange> >();
- return std::accumulate( boost::begin(rng), boost::end(rng), init, op );
- }
+ return std::accumulate( boost::begin(rng), boost::end(rng), init, op );
+ }
- template< class SinglePassRange1, class SinglePassRange2, class Value >
- inline Value inner_product( const SinglePassRange1& rng1, const SinglePassRange2& rng2, Value init )
- {
+ template< class SinglePassRange1, class SinglePassRange2, class Value >
+ inline Value inner_product( const SinglePassRange1& rng1, const SinglePassRange2& rng2, Value init )
+ {
boost::function_requires< SinglePassRangeConcept<SinglePassRange1> >();
boost::function_requires< SinglePassRangeConcept<SinglePassRange2> >();
BOOST_ASSERT( boost::distance(rng2) >= boost::distance(rng1) );
- return std::inner_product( boost::begin(rng1), boost::end(rng1),
+ return std::inner_product( boost::begin(rng1), boost::end(rng1),
boost::begin(rng2), init );
- }
+ }
- template< class SinglePassRange1,
+ template< class SinglePassRange1,
class SinglePassRange2,
class Value,
- class BinaryOperation1, class BinaryOperation2 >
- inline Value inner_product( const SinglePassRange1& rng1, const SinglePassRange2& rng2,
+ class BinaryOperation1, class BinaryOperation2 >
+ inline Value inner_product( const SinglePassRange1& rng1, const SinglePassRange2& rng2,
Value init,
- BinaryOperation1 op1, BinaryOperation2 op2 )
- {
+ BinaryOperation1 op1, BinaryOperation2 op2 )
+ {
boost::function_requires< SinglePassRangeConcept<SinglePassRange1> >();
boost::function_requires< SinglePassRangeConcept<SinglePassRange2> >();
BOOST_ASSERT( boost::distance(rng2) >= boost::distance(rng1) );
- return std::inner_product( boost::begin(rng1), boost::end(rng1),
+ return std::inner_product( boost::begin(rng1), boost::end(rng1),
boost::begin(rng2), init, op1, op2 );
- }
+ }
- template< class SinglePassRange, class OutputIterator >
- inline OutputIterator partial_sum ( const SinglePassRange& rng,
- OutputIterator result )
- {
- boost::function_requires< SinglePassRangeConcept<SinglePassRange> >();
- return std::partial_sum( boost::begin(rng), boost::end(rng), result );
- }
-
- template< class SinglePassRange, class OutputIterator, class BinaryOperation >
- inline OutputIterator partial_sum ( const SinglePassRange& rng, OutputIterator result,
- BinaryOperation op )
- {
- boost::function_requires< SinglePassRangeConcept<SinglePassRange> >();
- return std::partial_sum( boost::begin(rng), boost::end(rng), result, op );
- }
-
- template< class SinglePassRange, class OutputIterator >
- inline OutputIterator adjacent_difference ( const SinglePassRange& rng,
- OutputIterator result )
- {
- boost::function_requires< SinglePassRangeConcept<SinglePassRange> >();
- return std::adjacent_difference( boost::begin(rng), boost::end(rng),
- result );
- }
-
- template< class SinglePassRange, class OutputIterator, class BinaryOperation >
- inline OutputIterator adjacent_difference ( const SinglePassRange& rng,
- OutputIterator result,
- BinaryOperation op )
- {
- boost::function_requires< SinglePassRangeConcept<SinglePassRange> >();
- return std::adjacent_difference( boost::begin(rng), boost::end(rng),
- result, op );
- }
-
+ template< class SinglePassRange, class OutputIterator >
+ inline OutputIterator partial_sum ( const SinglePassRange& rng,
+ OutputIterator result )
+ {
+ boost::function_requires< SinglePassRangeConcept<SinglePassRange> >();
+ return std::partial_sum( boost::begin(rng), boost::end(rng), result );
+ }
+
+ template< class SinglePassRange, class OutputIterator, class BinaryOperation >
+ inline OutputIterator partial_sum ( const SinglePassRange& rng, OutputIterator result,
+ BinaryOperation op )
+ {
+ boost::function_requires< SinglePassRangeConcept<SinglePassRange> >();
+ return std::partial_sum( boost::begin(rng), boost::end(rng), result, op );
+ }
+
+ template< class SinglePassRange, class OutputIterator >
+ inline OutputIterator adjacent_difference ( const SinglePassRange& rng,
+ OutputIterator result )
+ {
+ boost::function_requires< SinglePassRangeConcept<SinglePassRange> >();
+ return std::adjacent_difference( boost::begin(rng), boost::end(rng),
+ result );
+ }
+
+ template< class SinglePassRange, class OutputIterator, class BinaryOperation >
+ inline OutputIterator adjacent_difference ( const SinglePassRange& rng,
+ OutputIterator result,
+ BinaryOperation op )
+ {
+ boost::function_requires< SinglePassRangeConcept<SinglePassRange> >();
+ return std::adjacent_difference( boost::begin(rng), boost::end(rng),
+ result, op );
+ }
+
}
#endif
Modified: branches/release/boost/range/size_type.hpp
==============================================================================
--- branches/release/boost/range/size_type.hpp (original)
+++ branches/release/boost/range/size_type.hpp 2010-04-23 18:50:56 EDT (Fri, 23 Apr 2010)
@@ -68,7 +68,7 @@
template< class T >
struct range_size<const T >
- : detail::range_size<T>
+ : detail::range_size<T>
{ };
} // namespace boost
Deleted: branches/release/boost/range/unbounded_range.hpp
==============================================================================
--- branches/release/boost/range/unbounded_range.hpp 2010-04-23 18:50:56 EDT (Fri, 23 Apr 2010)
+++ (empty file)
@@ -1,73 +0,0 @@
-#ifndef BOOST_RANGE_UNBOUNDED_RANGE_HPP
-#define BOOST_RANGE_UNBOUNDED_RANGE_HPP
-
-#include <boost/range/iterator_range.hpp>
-#include <boost/config.hpp>
-
-namespace boost
-{
- template< class Iter >
- struct unbounded_iterator_range : iterator_range<Iter>
- {
- explicit unbounded_iterator_range( Iter r )
- : iterator_range<Iter>( r, r )
- {
- //
- // Remark: by storing the same iterator
- // twice, we can still allow
- // comparison to execute without leading to
- // operations on singular iterators
- //
- }
-
- private:
-
- bool empty() const
- {
- return false;
- }
- //
- // Hide members that are illegal to use.
- //
- /*
- void end() const;
- void size() const;
- void empty() const;
- void equal() const;
- operator bool() const;
- bool operator==( unbounded_iterator_range );
- bool operator!=( unbounded_iterator_range );
- template< class S >
- void operator[]( S s ) const;
- template< class D >
- void advance_end( D d ) const;
- void back() const;
- */
- };
-
- template< class Iter >
- inline unbounded_iterator_range<Iter> unbounded_range( Iter r )
- {
- return unbounded_iterator_range<Iter>(r);
- }
-
- namespace detail
- {
- char is_unbounded_range( ... );
- template< class Iter >
- long is_unbounded_range( const unbounded_iterator_range<Iter>* );
- }
-
- template< class T >
- struct is_unbounded_range
- {
- private:
- static T* ptr_;
-
- public:
- BOOST_STATIC_CONSTANT( bool,
- value = sizeof(long) == sizeof(detail::is_unbounded_range(ptr_) ) );
- };
-}
-
-#endif
Deleted: branches/release/libs/range/doc/counting_range.html
==============================================================================
--- branches/release/libs/range/doc/counting_range.html 2010-04-23 18:50:56 EDT (Fri, 23 Apr 2010)
+++ (empty file)
@@ -1,70 +0,0 @@
-<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 3.2//EN">
-
-<html>
-<head>
- <meta http-equiv="Content-Type" content="text/html; charset=ISO-8859-1" />
- <title>Boost.Range Utilities</title>
- <link rel="stylesheet" href="style.css" type="text/css" />
-</head>
-
- <body>
- <table border="0" >
- <tr>
- <td ><img src="../../../boost.png" border="0" /></td>
- <td ><h1 align="center">Boost.Range</h1></td>
- </tr>
- </table>
- <a name="counting_range"></a> <h1>Function <code>counting_range</code></h1>
- <p>
- The intention of the <code>counting_range</code> function is to construct
- a new range with iterators that are wrapped in a
- <code>counting_iterator</code> (from Boost.Iterator)
- </p>
-
- <h3>Synopsis</h3>
-
- <pre><span class="keyword">namespace </span><span class="identifier">boost</span>
-<span class="special">{</span>
- <span class="keyword">template</span><span class="special">< </span><span class="keyword">class </span><span class="identifier">Incrementable</span><span class="identifier"> </span><span class="special">> <span style="color: #0000ff">inline</span>
- </span><span class="keyword"></span><span class="identifier">range< counting_iterator<Incrementable> >
- counting_range(Incrementable first, Incrementable last);
-
- <span class="keyword">template</span><span class="special">< </span><span class="keyword">class </span><span class="identifier">SinglePassRange</span><span class="identifier"> </span><span class="special">> </span><span class="keyword">inline
- </span><span class="identifier">range< counting_iterator<<span class="keyword">typename</span> range_iterator<SinglePassRange>::type >
- counting_range(<span class="keyword">const</span> Range& rng);
-
- </span><span class="keyword">template</span><span class="special">< </span><span class="keyword">class </span><span class="identifier">SinglePassRange</span><span class="identifier"> </span><span class="special">> <span style="color: #0000ff">inline</span></span>
- <span class="identifier">range< counting_iterator<<span style="color: #0000ff">typename</span> range_iterator<SinglePassRange>::type >
- counting_range(Range& rng);
- </span></span><span class="special"></span><span class="special"></span><span class="special"> </span>
-<span class="special">} </span><span class="comment">// namespace 'boost'</span>
- </pre>
-
- <p>
- © <a name="Copyright" id="Copyright">Copyright</a> Neil Groves 2009.
-</p>
-
- <p>
- Distributed under the Boost Software License, Version 1.0. (See
- accompanying file LICENSE_1_0.txt or copy
- at <a href=
- "http://www.boost.org/LICENSE_1_0.txt">www.boost.org/LICENSE_1_0.txt</a>)
- </p>
-
- <br />
- <br />
- <br />
- <br />
- <br />
- <br />
- <br />
- <br />
- <br />
- <br />
- <br />
- <br />
-
-
- </body>
-</html>
-
Modified: branches/release/libs/range/doc/headers.qbk
==============================================================================
--- branches/release/libs/range/doc/headers.qbk (original)
+++ branches/release/libs/range/doc/headers.qbk 2010-04-23 18:50:56 EDT (Fri, 23 Apr 2010)
@@ -2,7 +2,7 @@
[table
[[Header ] [Includes ] [Related Concept ]]
- [[`<boost/range.hpp>` ] [everything ] [- ]]
+ [[`<boost/range.hpp>` ] [everything from Boost.Range version 1 (Boost versions 1.42 and below). Includes the core range functions and metafunctinos, but excludes Range Adaptors and Range Algorithms. ] [- ]]
[[`<boost/range/metafunctions.hpp>` ] [every metafunction ] [- ]]
[[`<boost/range/functions.hpp>` ] [every function ] [- ]]
[[`<boost/range/value_type.hpp>` ] [__range_value__ ] [__single_pass_range__ ]]
Modified: branches/release/libs/range/doc/html/index.html
==============================================================================
--- branches/release/libs/range/doc/html/index.html (original)
+++ branches/release/libs/range/doc/html/index.html 2010-04-23 18:50:56 EDT (Fri, 23 Apr 2010)
@@ -3,7 +3,7 @@
<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
<title>Chapter 1. Range 2.0</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="next" href="range/introduction.html" title="Introduction">
</head>
@@ -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="id621301"></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 05, 2010 at 17:25:33 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: branches/release/libs/range/doc/html/quickbook_HTML.manifest
==============================================================================
--- branches/release/libs/range/doc/html/quickbook_HTML.manifest (original)
+++ branches/release/libs/range/doc/html/quickbook_HTML.manifest 2010-04-23 18:50:56 EDT (Fri, 23 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: branches/release/libs/range/doc/html/range/concepts.html
==============================================================================
--- branches/release/libs/range/doc/html/range/concepts.html (original)
+++ branches/release/libs/range/doc/html/range/concepts.html 2010-04-23 18:50:56 EDT (Fri, 23 Apr 2010)
@@ -3,7 +3,7 @@
<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
<title>Range Concepts</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="../index.html" title="Chapter 1. Range 2.0">
<link rel="prev" href="introduction.html" title="Introduction">
Modified: branches/release/libs/range/doc/html/range/concepts/bidirectional_range.html
==============================================================================
--- branches/release/libs/range/doc/html/range/concepts/bidirectional_range.html (original)
+++ branches/release/libs/range/doc/html/range/concepts/bidirectional_range.html 2010-04-23 18:50:56 EDT (Fri, 23 Apr 2010)
@@ -3,7 +3,7 @@
<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
<title>Bidirectional Range</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="../concepts.html" title="Range Concepts">
<link rel="prev" href="forward_range.html" title="Forward Range">
@@ -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="id632764"></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="id632852"></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="id632911"></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="id632934"></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="id633090"></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="id633550"></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="id633691"></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="id633940"></a>
+<a name="id3018659"></a>
<a class="link" href="bidirectional_range.html#range.concepts.bidirectional_range.see_also">See also</a>
</h5>
<p>
Modified: branches/release/libs/range/doc/html/range/concepts/concept_checking.html
==============================================================================
--- branches/release/libs/range/doc/html/range/concepts/concept_checking.html (original)
+++ branches/release/libs/range/doc/html/range/concepts/concept_checking.html 2010-04-23 18:50:56 EDT (Fri, 23 Apr 2010)
@@ -3,7 +3,7 @@
<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
<title>Concept Checking</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="../concepts.html" title="Range Concepts">
<link rel="prev" href="random_access_range.html" title="Random Access Range">
@@ -79,7 +79,7 @@
</li>
</ul></div>
<a name="range.concepts.concept_checking.see_also"></a><h5>
-<a name="id634869"></a>
+<a name="id3019669"></a>
<a class="link" href="concept_checking.html#range.concepts.concept_checking.see_also">See also</a>
</h5>
<p>
Modified: branches/release/libs/range/doc/html/range/concepts/forward_range.html
==============================================================================
--- branches/release/libs/range/doc/html/range/concepts/forward_range.html (original)
+++ branches/release/libs/range/doc/html/range/concepts/forward_range.html 2010-04-23 18:50:56 EDT (Fri, 23 Apr 2010)
@@ -3,7 +3,7 @@
<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
<title>Forward Range</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="../concepts.html" title="Range Concepts">
<link rel="prev" href="single_pass_range.html" title="Single Pass Range">
@@ -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="id632396"></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="id632484"></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="id632550"></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="id632572"></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="id632721"></a>
+<a name="id3017357"></a>
<a class="link" href="forward_range.html#range.concepts.forward_range.see_also">See also</a>
</h5>
<p>
Modified: branches/release/libs/range/doc/html/range/concepts/overview.html
==============================================================================
--- branches/release/libs/range/doc/html/range/concepts/overview.html (original)
+++ branches/release/libs/range/doc/html/range/concepts/overview.html 2010-04-23 18:50:56 EDT (Fri, 23 Apr 2010)
@@ -3,7 +3,7 @@
<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
<title>Overview</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="../concepts.html" title="Range Concepts">
<link rel="prev" href="../concepts.html" title="Range Concepts">
Modified: branches/release/libs/range/doc/html/range/concepts/random_access_range.html
==============================================================================
--- branches/release/libs/range/doc/html/range/concepts/random_access_range.html (original)
+++ branches/release/libs/range/doc/html/range/concepts/random_access_range.html 2010-04-23 18:50:56 EDT (Fri, 23 Apr 2010)
@@ -3,7 +3,7 @@
<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
<title>Random Access Range</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="../concepts.html" title="Range Concepts">
<link rel="prev" href="bidirectional_range.html" title="Bidirectional Range">
@@ -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="id633982"></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="id634048"></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="id634071"></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="id634209"></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="id634425"></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="id634473"></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: branches/release/libs/range/doc/html/range/concepts/single_pass_range.html
==============================================================================
--- branches/release/libs/range/doc/html/range/concepts/single_pass_range.html (original)
+++ branches/release/libs/range/doc/html/range/concepts/single_pass_range.html 2010-04-23 18:50:56 EDT (Fri, 23 Apr 2010)
@@ -3,7 +3,7 @@
<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
<title>Single Pass Range</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="../concepts.html" title="Range Concepts">
<link rel="prev" href="overview.html" title="Overview">
@@ -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="id631108"></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="id631200"></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="id631265"></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="id631427"></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="id631746"></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="id632003"></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="id632080"></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="id632336"></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: branches/release/libs/range/doc/html/range/examples.html
==============================================================================
--- branches/release/libs/range/doc/html/range/examples.html (original)
+++ branches/release/libs/range/doc/html/range/examples.html 2010-04-23 18:50:56 EDT (Fri, 23 Apr 2010)
@@ -3,7 +3,7 @@
<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
<title>Examples</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="../index.html" title="Chapter 1. Range 2.0">
<link rel="prev" href="library_headers.html" title="Library Headers">
Modified: branches/release/libs/range/doc/html/range/faq.html
==============================================================================
--- branches/release/libs/range/doc/html/range/faq.html (original)
+++ branches/release/libs/range/doc/html/range/faq.html 2010-04-23 18:50:56 EDT (Fri, 23 Apr 2010)
@@ -3,7 +3,7 @@
<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
<title>FAQ</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="../index.html" title="Chapter 1. Range 2.0">
<link rel="prev" href="portability.html" title="Portability">
Modified: branches/release/libs/range/doc/html/range/history_ack.html
==============================================================================
--- branches/release/libs/range/doc/html/range/history_ack.html (original)
+++ branches/release/libs/range/doc/html/range/history_ack.html 2010-04-23 18:50:56 EDT (Fri, 23 Apr 2010)
@@ -3,7 +3,7 @@
<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
<title>History and Acknowledgement</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="../index.html" title="Chapter 1. Range 2.0">
<link rel="prev" href="faq.html" title="FAQ">
Modified: branches/release/libs/range/doc/html/range/introduction.html
==============================================================================
--- branches/release/libs/range/doc/html/range/introduction.html (original)
+++ branches/release/libs/range/doc/html/range/introduction.html 2010-04-23 18:50:56 EDT (Fri, 23 Apr 2010)
@@ -3,7 +3,7 @@
<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
<title>Introduction</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="../index.html" title="Chapter 1. Range 2.0">
<link rel="prev" href="../index.html" title="Chapter 1. Range 2.0">
Modified: branches/release/libs/range/doc/html/range/library_headers.html
==============================================================================
--- branches/release/libs/range/doc/html/range/library_headers.html (original)
+++ branches/release/libs/range/doc/html/range/library_headers.html 2010-04-23 18:50:56 EDT (Fri, 23 Apr 2010)
@@ -3,7 +3,7 @@
<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
<title>Library Headers</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="../index.html" title="Chapter 1. Range 2.0">
<link rel="prev" href="style_guide.html" title="Terminology and style guidelines">
@@ -58,7 +58,9 @@
</td>
<td>
<p>
- everything
+ everything from Boost.Range version 1 (Boost versions 1.42 and below).
+ Includes the core range functions and metafunctinos, but excludes
+ Range Adaptors and Range Algorithms.
</p>
</td>
<td>
Modified: branches/release/libs/range/doc/html/range/mfc_atl.html
==============================================================================
--- branches/release/libs/range/doc/html/range/mfc_atl.html (original)
+++ branches/release/libs/range/doc/html/range/mfc_atl.html 2010-04-23 18:50:56 EDT (Fri, 23 Apr 2010)
@@ -3,7 +3,7 @@
<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
<title>MFC/ATL (courtesy of Shunsuke Sogame)</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="../index.html" title="Chapter 1. Range 2.0">
<link rel="prev" href="examples.html" title="Examples">
@@ -34,7 +34,7 @@
<dt><span class="section"> References</span></dt>
</dl></div>
<a name="range.mfc_atl.introduction"></a><h5>
-<a name="id739258"></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="id739392"></a>
+<a name="id3128918"></a>
<a class="link" href="mfc_atl.html#range.mfc_atl.overview">Overview</a>
</h5>
<p>
Modified: branches/release/libs/range/doc/html/range/mfc_atl/atl_ranges.html
==============================================================================
--- branches/release/libs/range/doc/html/range/mfc_atl/atl_ranges.html (original)
+++ branches/release/libs/range/doc/html/range/mfc_atl/atl_ranges.html 2010-04-23 18:50:56 EDT (Fri, 23 Apr 2010)
@@ -3,7 +3,7 @@
<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
<title>ATL Ranges</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="../mfc_atl.html" title="MFC/ATL (courtesy of Shunsuke Sogame)">
<link rel="prev" href="mfc_ranges.html" title="MFC Ranges">
Modified: branches/release/libs/range/doc/html/range/mfc_atl/const_ranges.html
==============================================================================
--- branches/release/libs/range/doc/html/range/mfc_atl/const_ranges.html (original)
+++ branches/release/libs/range/doc/html/range/mfc_atl/const_ranges.html 2010-04-23 18:50:56 EDT (Fri, 23 Apr 2010)
@@ -3,7 +3,7 @@
<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
<title>const Ranges</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="../mfc_atl.html" title="MFC/ATL (courtesy of Shunsuke Sogame)">
<link rel="prev" href="atl_ranges.html" title="ATL Ranges">
Modified: branches/release/libs/range/doc/html/range/mfc_atl/mfc_ranges.html
==============================================================================
--- branches/release/libs/range/doc/html/range/mfc_atl/mfc_ranges.html (original)
+++ branches/release/libs/range/doc/html/range/mfc_atl/mfc_ranges.html 2010-04-23 18:50:56 EDT (Fri, 23 Apr 2010)
@@ -3,7 +3,7 @@
<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
<title>MFC Ranges</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="../mfc_atl.html" title="MFC/ATL (courtesy of Shunsuke Sogame)">
<link rel="prev" href="requirements.html" title="Requirements">
Modified: branches/release/libs/range/doc/html/range/mfc_atl/references.html
==============================================================================
--- branches/release/libs/range/doc/html/range/mfc_atl/references.html (original)
+++ branches/release/libs/range/doc/html/range/mfc_atl/references.html 2010-04-23 18:50:56 EDT (Fri, 23 Apr 2010)
@@ -3,7 +3,7 @@
<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
<title>References</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="../mfc_atl.html" title="MFC/ATL (courtesy of Shunsuke Sogame)">
<link rel="prev" href="const_ranges.html" title="const Ranges">
Modified: branches/release/libs/range/doc/html/range/mfc_atl/requirements.html
==============================================================================
--- branches/release/libs/range/doc/html/range/mfc_atl/requirements.html (original)
+++ branches/release/libs/range/doc/html/range/mfc_atl/requirements.html 2010-04-23 18:50:56 EDT (Fri, 23 Apr 2010)
@@ -3,7 +3,7 @@
<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
<title>Requirements</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="../mfc_atl.html" title="MFC/ATL (courtesy of Shunsuke Sogame)">
<link rel="prev" href="../mfc_atl.html" title="MFC/ATL (courtesy of Shunsuke Sogame)">
Modified: branches/release/libs/range/doc/html/range/portability.html
==============================================================================
--- branches/release/libs/range/doc/html/range/portability.html (original)
+++ branches/release/libs/range/doc/html/range/portability.html 2010-04-23 18:50:56 EDT (Fri, 23 Apr 2010)
@@ -3,7 +3,7 @@
<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
<title>Portability</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="../index.html" title="Chapter 1. Range 2.0">
<link rel="prev" href="upgrade/upgrade_from_1_34.html" title="Upgrade from version 1.34">
Modified: branches/release/libs/range/doc/html/range/reference.html
==============================================================================
--- branches/release/libs/range/doc/html/range/reference.html (original)
+++ branches/release/libs/range/doc/html/range/reference.html 2010-04-23 18:50:56 EDT (Fri, 23 Apr 2010)
@@ -3,7 +3,7 @@
<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
<title>Reference</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="../index.html" title="Chapter 1. Range 2.0">
<link rel="prev" href="concepts/concept_checking.html" title="Concept Checking">
Modified: branches/release/libs/range/doc/html/range/reference/adaptors.html
==============================================================================
--- branches/release/libs/range/doc/html/range/reference/adaptors.html (original)
+++ branches/release/libs/range/doc/html/range/reference/adaptors.html 2010-04-23 18:50:56 EDT (Fri, 23 Apr 2010)
@@ -3,7 +3,7 @@
<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
<title>Range Adaptors</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="../reference.html" title="Reference">
<link rel="prev" href="semantics/functions.html" title="Functions">
Modified: branches/release/libs/range/doc/html/range/reference/adaptors/adaptors_general_requirements.html
==============================================================================
--- branches/release/libs/range/doc/html/range/reference/adaptors/adaptors_general_requirements.html (original)
+++ branches/release/libs/range/doc/html/range/reference/adaptors/adaptors_general_requirements.html 2010-04-23 18:50:56 EDT (Fri, 23 Apr 2010)
@@ -3,7 +3,7 @@
<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
<title>General Requirements</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="../adaptors.html" title="Range Adaptors">
<link rel="prev" href="adaptors_synopsis.html" title="Synopsis">
Modified: branches/release/libs/range/doc/html/range/reference/adaptors/adaptors_introduction.html
==============================================================================
--- branches/release/libs/range/doc/html/range/reference/adaptors/adaptors_introduction.html (original)
+++ branches/release/libs/range/doc/html/range/reference/adaptors/adaptors_introduction.html 2010-04-23 18:50:56 EDT (Fri, 23 Apr 2010)
@@ -3,7 +3,7 @@
<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
<title>Introduction and motivation</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="../adaptors.html" title="Range Adaptors">
<link rel="prev" href="../adaptors.html" title="Range Adaptors">
@@ -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="id641845"></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="id642142"></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="id642307"></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: branches/release/libs/range/doc/html/range/reference/adaptors/adaptors_reference.html
==============================================================================
--- branches/release/libs/range/doc/html/range/reference/adaptors/adaptors_reference.html (original)
+++ branches/release/libs/range/doc/html/range/reference/adaptors/adaptors_reference.html 2010-04-23 18:50:56 EDT (Fri, 23 Apr 2010)
@@ -3,7 +3,7 @@
<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
<title>Reference</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="../adaptors.html" title="Range Adaptors">
<link rel="prev" href="adaptors_general_requirements.html" title="General Requirements">
Modified: branches/release/libs/range/doc/html/range/reference/adaptors/adaptors_reference/adjacent_filtered.html
==============================================================================
--- branches/release/libs/range/doc/html/range/reference/adaptors/adaptors_reference/adjacent_filtered.html (original)
+++ branches/release/libs/range/doc/html/range/reference/adaptors/adaptors_reference/adjacent_filtered.html 2010-04-23 18:50:56 EDT (Fri, 23 Apr 2010)
@@ -3,7 +3,7 @@
<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
<title>adjacent_filtered</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="../adaptors_reference.html" title="Reference">
<link rel="prev" href="../adaptors_reference.html" title="Reference">
Modified: branches/release/libs/range/doc/html/range/reference/adaptors/adaptors_reference/copied.html
==============================================================================
--- branches/release/libs/range/doc/html/range/reference/adaptors/adaptors_reference/copied.html (original)
+++ branches/release/libs/range/doc/html/range/reference/adaptors/adaptors_reference/copied.html 2010-04-23 18:50:56 EDT (Fri, 23 Apr 2010)
@@ -3,7 +3,7 @@
<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
<title>copied</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="../adaptors_reference.html" title="Reference">
<link rel="prev" href="adjacent_filtered.html" title="adjacent_filtered">
Modified: branches/release/libs/range/doc/html/range/reference/adaptors/adaptors_reference/filtered.html
==============================================================================
--- branches/release/libs/range/doc/html/range/reference/adaptors/adaptors_reference/filtered.html (original)
+++ branches/release/libs/range/doc/html/range/reference/adaptors/adaptors_reference/filtered.html 2010-04-23 18:50:56 EDT (Fri, 23 Apr 2010)
@@ -3,7 +3,7 @@
<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
<title>filtered</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="../adaptors_reference.html" title="Reference">
<link rel="prev" href="copied.html" title="copied">
Modified: branches/release/libs/range/doc/html/range/reference/adaptors/adaptors_reference/indexed.html
==============================================================================
--- branches/release/libs/range/doc/html/range/reference/adaptors/adaptors_reference/indexed.html (original)
+++ branches/release/libs/range/doc/html/range/reference/adaptors/adaptors_reference/indexed.html 2010-04-23 18:50:56 EDT (Fri, 23 Apr 2010)
@@ -3,7 +3,7 @@
<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
<title>indexed</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="../adaptors_reference.html" title="Reference">
<link rel="prev" href="filtered.html" title="filtered">
Modified: branches/release/libs/range/doc/html/range/reference/adaptors/adaptors_reference/indirected.html
==============================================================================
--- branches/release/libs/range/doc/html/range/reference/adaptors/adaptors_reference/indirected.html (original)
+++ branches/release/libs/range/doc/html/range/reference/adaptors/adaptors_reference/indirected.html 2010-04-23 18:50:56 EDT (Fri, 23 Apr 2010)
@@ -3,7 +3,7 @@
<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
<title>indirected</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="../adaptors_reference.html" title="Reference">
<link rel="prev" href="indexed.html" title="indexed">
Modified: branches/release/libs/range/doc/html/range/reference/adaptors/adaptors_reference/map_keys.html
==============================================================================
--- branches/release/libs/range/doc/html/range/reference/adaptors/adaptors_reference/map_keys.html (original)
+++ branches/release/libs/range/doc/html/range/reference/adaptors/adaptors_reference/map_keys.html 2010-04-23 18:50:56 EDT (Fri, 23 Apr 2010)
@@ -3,7 +3,7 @@
<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
<title>map_keys</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="../adaptors_reference.html" title="Reference">
<link rel="prev" href="indirected.html" title="indirected">
Modified: branches/release/libs/range/doc/html/range/reference/adaptors/adaptors_reference/map_values.html
==============================================================================
--- branches/release/libs/range/doc/html/range/reference/adaptors/adaptors_reference/map_values.html (original)
+++ branches/release/libs/range/doc/html/range/reference/adaptors/adaptors_reference/map_values.html 2010-04-23 18:50:56 EDT (Fri, 23 Apr 2010)
@@ -3,7 +3,7 @@
<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
<title>map_values</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="../adaptors_reference.html" title="Reference">
<link rel="prev" href="map_keys.html" title="map_keys">
Modified: branches/release/libs/range/doc/html/range/reference/adaptors/adaptors_reference/replaced.html
==============================================================================
--- branches/release/libs/range/doc/html/range/reference/adaptors/adaptors_reference/replaced.html (original)
+++ branches/release/libs/range/doc/html/range/reference/adaptors/adaptors_reference/replaced.html 2010-04-23 18:50:56 EDT (Fri, 23 Apr 2010)
@@ -3,7 +3,7 @@
<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
<title>replaced</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="../adaptors_reference.html" title="Reference">
<link rel="prev" href="map_values.html" title="map_values">
Modified: branches/release/libs/range/doc/html/range/reference/adaptors/adaptors_reference/replaced_if.html
==============================================================================
--- branches/release/libs/range/doc/html/range/reference/adaptors/adaptors_reference/replaced_if.html (original)
+++ branches/release/libs/range/doc/html/range/reference/adaptors/adaptors_reference/replaced_if.html 2010-04-23 18:50:56 EDT (Fri, 23 Apr 2010)
@@ -3,7 +3,7 @@
<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
<title>replaced_if</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="../adaptors_reference.html" title="Reference">
<link rel="prev" href="replaced.html" title="replaced">
Modified: branches/release/libs/range/doc/html/range/reference/adaptors/adaptors_reference/reversed.html
==============================================================================
--- branches/release/libs/range/doc/html/range/reference/adaptors/adaptors_reference/reversed.html (original)
+++ branches/release/libs/range/doc/html/range/reference/adaptors/adaptors_reference/reversed.html 2010-04-23 18:50:56 EDT (Fri, 23 Apr 2010)
@@ -3,7 +3,7 @@
<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
<title>reversed</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="../adaptors_reference.html" title="Reference">
<link rel="prev" href="replaced_if.html" title="replaced_if">
Modified: branches/release/libs/range/doc/html/range/reference/adaptors/adaptors_reference/sliced.html
==============================================================================
--- branches/release/libs/range/doc/html/range/reference/adaptors/adaptors_reference/sliced.html (original)
+++ branches/release/libs/range/doc/html/range/reference/adaptors/adaptors_reference/sliced.html 2010-04-23 18:50:56 EDT (Fri, 23 Apr 2010)
@@ -3,7 +3,7 @@
<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
<title>sliced</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="../adaptors_reference.html" title="Reference">
<link rel="prev" href="reversed.html" title="reversed">
Modified: branches/release/libs/range/doc/html/range/reference/adaptors/adaptors_reference/strided.html
==============================================================================
--- branches/release/libs/range/doc/html/range/reference/adaptors/adaptors_reference/strided.html (original)
+++ branches/release/libs/range/doc/html/range/reference/adaptors/adaptors_reference/strided.html 2010-04-23 18:50:56 EDT (Fri, 23 Apr 2010)
@@ -3,7 +3,7 @@
<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
<title>strided</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="../adaptors_reference.html" title="Reference">
<link rel="prev" href="sliced.html" title="sliced">
Modified: branches/release/libs/range/doc/html/range/reference/adaptors/adaptors_reference/tokenized.html
==============================================================================
--- branches/release/libs/range/doc/html/range/reference/adaptors/adaptors_reference/tokenized.html (original)
+++ branches/release/libs/range/doc/html/range/reference/adaptors/adaptors_reference/tokenized.html 2010-04-23 18:50:56 EDT (Fri, 23 Apr 2010)
@@ -3,7 +3,7 @@
<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
<title>tokenized</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="../adaptors_reference.html" title="Reference">
<link rel="prev" href="strided.html" title="strided">
Modified: branches/release/libs/range/doc/html/range/reference/adaptors/adaptors_reference/transformed.html
==============================================================================
--- branches/release/libs/range/doc/html/range/reference/adaptors/adaptors_reference/transformed.html (original)
+++ branches/release/libs/range/doc/html/range/reference/adaptors/adaptors_reference/transformed.html 2010-04-23 18:50:56 EDT (Fri, 23 Apr 2010)
@@ -3,7 +3,7 @@
<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
<title>transformed</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="../adaptors_reference.html" title="Reference">
<link rel="prev" href="tokenized.html" title="tokenized">
Modified: branches/release/libs/range/doc/html/range/reference/adaptors/adaptors_reference/uniqued.html
==============================================================================
--- branches/release/libs/range/doc/html/range/reference/adaptors/adaptors_reference/uniqued.html (original)
+++ branches/release/libs/range/doc/html/range/reference/adaptors/adaptors_reference/uniqued.html 2010-04-23 18:50:56 EDT (Fri, 23 Apr 2010)
@@ -3,7 +3,7 @@
<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
<title>uniqued</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="../adaptors_reference.html" title="Reference">
<link rel="prev" href="transformed.html" title="transformed">
Modified: branches/release/libs/range/doc/html/range/reference/adaptors/adaptors_synopsis.html
==============================================================================
--- branches/release/libs/range/doc/html/range/reference/adaptors/adaptors_synopsis.html (original)
+++ branches/release/libs/range/doc/html/range/reference/adaptors/adaptors_synopsis.html 2010-04-23 18:50:56 EDT (Fri, 23 Apr 2010)
@@ -3,7 +3,7 @@
<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
<title>Synopsis</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="../adaptors.html" title="Range Adaptors">
<link rel="prev" href="adaptors_introduction.html" title="Introduction and motivation">
Modified: branches/release/libs/range/doc/html/range/reference/algorithms.html
==============================================================================
--- branches/release/libs/range/doc/html/range/reference/algorithms.html (original)
+++ branches/release/libs/range/doc/html/range/reference/algorithms.html 2010-04-23 18:50:56 EDT (Fri, 23 Apr 2010)
@@ -3,7 +3,7 @@
<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
<title>Range Algorithm</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="../reference.html" title="Reference">
<link rel="prev" href="adaptors/adaptors_reference/uniqued.html" title="uniqued">
Modified: branches/release/libs/range/doc/html/range/reference/algorithms/heap_algorithms.html
==============================================================================
--- branches/release/libs/range/doc/html/range/reference/algorithms/heap_algorithms.html (original)
+++ branches/release/libs/range/doc/html/range/reference/algorithms/heap_algorithms.html 2010-04-23 18:50:56 EDT (Fri, 23 Apr 2010)
@@ -3,7 +3,7 @@
<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
<title>Heap algorithms</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="../algorithms.html" title="Range Algorithm">
<link rel="prev" href="set_algorithms/set_symmetric_difference.html" title="set_symmetric_difference">
@@ -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: branches/release/libs/range/doc/html/range/reference/algorithms/heap_algorithms/make_heap.html
==============================================================================
--- branches/release/libs/range/doc/html/range/reference/algorithms/heap_algorithms/make_heap.html (original)
+++ branches/release/libs/range/doc/html/range/reference/algorithms/heap_algorithms/make_heap.html 2010-04-23 18:50:56 EDT (Fri, 23 Apr 2010)
@@ -3,11 +3,11 @@
<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
<title>make_heap</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="../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="id711672"></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="id712018"></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="id712093"></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="id712163"></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="id712385"></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: branches/release/libs/range/doc/html/range/reference/algorithms/heap_algorithms/pop_heap.html
==============================================================================
--- branches/release/libs/range/doc/html/range/reference/algorithms/heap_algorithms/pop_heap.html (original)
+++ branches/release/libs/range/doc/html/range/reference/algorithms/heap_algorithms/pop_heap.html 2010-04-23 18:50:56 EDT (Fri, 23 Apr 2010)
@@ -3,7 +3,7 @@
<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
<title>pop_heap</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="../heap_algorithms.html" title="Heap algorithms">
<link rel="prev" href="push_heap.html" title="push_heap">
@@ -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="id710726"></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="id711072"></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="id711226"></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="id711296"></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="id711519"></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="id711588"></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: branches/release/libs/range/doc/html/range/reference/algorithms/heap_algorithms/push_heap.html
==============================================================================
--- branches/release/libs/range/doc/html/range/reference/algorithms/heap_algorithms/push_heap.html (original)
+++ branches/release/libs/range/doc/html/range/reference/algorithms/heap_algorithms/push_heap.html 2010-04-23 18:50:56 EDT (Fri, 23 Apr 2010)
@@ -3,7 +3,7 @@
<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
<title>push_heap</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="../heap_algorithms.html" title="Heap algorithms">
<link rel="prev" href="../heap_algorithms.html" title="Heap algorithms">
@@ -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="id709740"></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="id710087"></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="id710246"></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="id710316"></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="id710538"></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="id710652"></a>
+<a name="id3098104"></a>
<a class="link" href="push_heap.html#range.reference.algorithms.heap_algorithms.push_heap.complexity">Complexity</a>
</h6>
<p>
Modified: branches/release/libs/range/doc/html/range/reference/algorithms/permutation_algorithms.html
==============================================================================
--- branches/release/libs/range/doc/html/range/reference/algorithms/permutation_algorithms.html (original)
+++ branches/release/libs/range/doc/html/range/reference/algorithms/permutation_algorithms.html 2010-04-23 18:50:56 EDT (Fri, 23 Apr 2010)
@@ -3,10 +3,10 @@
<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
<title>Permutation algorithms</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="../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: branches/release/libs/range/doc/html/range/reference/algorithms/permutation_algorithms/next_permutation.html
==============================================================================
--- branches/release/libs/range/doc/html/range/reference/algorithms/permutation_algorithms/next_permutation.html (original)
+++ branches/release/libs/range/doc/html/range/reference/algorithms/permutation_algorithms/next_permutation.html 2010-04-23 18:50:56 EDT (Fri, 23 Apr 2010)
@@ -3,7 +3,7 @@
<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
<title>next_permutation</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="../permutation_algorithms.html" title="Permutation algorithms">
<link rel="prev" href="../permutation_algorithms.html" title="Permutation algorithms">
@@ -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="id712479"></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="id712826"></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="id712925"></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="id712995"></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="id713217"></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: branches/release/libs/range/doc/html/range/reference/algorithms/permutation_algorithms/prev_permutation.html
==============================================================================
--- branches/release/libs/range/doc/html/range/reference/algorithms/permutation_algorithms/prev_permutation.html (original)
+++ branches/release/libs/range/doc/html/range/reference/algorithms/permutation_algorithms/prev_permutation.html 2010-04-23 18:50:56 EDT (Fri, 23 Apr 2010)
@@ -3,7 +3,7 @@
<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
<title>prev_permutation</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="../permutation_algorithms.html" title="Permutation algorithms">
<link rel="prev" href="next_permutation.html" title="next_permutation">
@@ -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="id713296"></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="id713642"></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="id713741"></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="id713812"></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="id714034"></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: branches/release/libs/range/doc/html/range/reference/algorithms/range_algorithm_introduction.html
==============================================================================
--- branches/release/libs/range/doc/html/range/reference/algorithms/range_algorithm_introduction.html (original)
+++ branches/release/libs/range/doc/html/range/reference/algorithms/range_algorithm_introduction.html 2010-04-23 18:50:56 EDT (Fri, 23 Apr 2010)
@@ -3,7 +3,7 @@
<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
<title>Introduction and motivation</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="../algorithms.html" title="Range Algorithm">
<link rel="prev" href="../algorithms.html" title="Range Algorithm">
Modified: branches/release/libs/range/doc/html/range/reference/algorithms/range_algorithm_mutating_algorithms.html
==============================================================================
--- branches/release/libs/range/doc/html/range/reference/algorithms/range_algorithm_mutating_algorithms.html (original)
+++ branches/release/libs/range/doc/html/range/reference/algorithms/range_algorithm_mutating_algorithms.html 2010-04-23 18:50:56 EDT (Fri, 23 Apr 2010)
@@ -3,7 +3,7 @@
<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
<title>Mutating algorithms</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="../algorithms.html" title="Range Algorithm">
<link rel="prev" href="range_algorithm_introduction.html" title="Introduction and motivation">
@@ -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: branches/release/libs/range/doc/html/range/reference/algorithms/range_algorithm_mutating_algorithms/copy.html
==============================================================================
--- branches/release/libs/range/doc/html/range/reference/algorithms/range_algorithm_mutating_algorithms/copy.html (original)
+++ branches/release/libs/range/doc/html/range/reference/algorithms/range_algorithm_mutating_algorithms/copy.html 2010-04-23 18:50:56 EDT (Fri, 23 Apr 2010)
@@ -3,7 +3,7 @@
<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
<title>Range Algorithm - copy</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_mutating_algorithms.html" title="Mutating algorithms">
<link rel="prev" href="../range_algorithm_mutating_algorithms.html" title="Mutating algorithms">
@@ -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="id663029"></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="id663156"></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="id663286"></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="id663356"></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="id663457"></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="id663558"></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: branches/release/libs/range/doc/html/range/reference/algorithms/range_algorithm_mutating_algorithms/copy_backward.html
==============================================================================
--- branches/release/libs/range/doc/html/range/reference/algorithms/range_algorithm_mutating_algorithms/copy_backward.html (original)
+++ branches/release/libs/range/doc/html/range/reference/algorithms/range_algorithm_mutating_algorithms/copy_backward.html 2010-04-23 18:50:56 EDT (Fri, 23 Apr 2010)
@@ -3,7 +3,7 @@
<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
<title>Range Algorithm - copy_backward</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_mutating_algorithms.html" title="Mutating algorithms">
<link rel="prev" href="copy.html" title="Range Algorithm - copy">
@@ -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="id663623"></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="id663752"></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="id663905"></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="id663975"></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="id664078"></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="id664178"></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: branches/release/libs/range/doc/html/range/reference/algorithms/range_algorithm_mutating_algorithms/fill.html
==============================================================================
--- branches/release/libs/range/doc/html/range/reference/algorithms/range_algorithm_mutating_algorithms/fill.html (original)
+++ branches/release/libs/range/doc/html/range/reference/algorithms/range_algorithm_mutating_algorithms/fill.html 2010-04-23 18:50:56 EDT (Fri, 23 Apr 2010)
@@ -3,11 +3,11 @@
<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
<title>Range Algorithm - fill</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_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="id664244"></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="id664488"></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="id664544"></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="id664614"></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="id664723"></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>
Modified: branches/release/libs/range/doc/html/range/reference/algorithms/range_algorithm_mutating_algorithms/generate.html
==============================================================================
--- branches/release/libs/range/doc/html/range/reference/algorithms/range_algorithm_mutating_algorithms/generate.html (original)
+++ branches/release/libs/range/doc/html/range/reference/algorithms/range_algorithm_mutating_algorithms/generate.html 2010-04-23 18:50:56 EDT (Fri, 23 Apr 2010)
@@ -3,10 +3,10 @@
<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
<title>Range Algorithm - generate</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_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="id664786"></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="id665026"></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="id665086"></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="id665155"></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="id665273"></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="id665374"></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: branches/release/libs/range/doc/html/range/reference/algorithms/range_algorithm_mutating_algorithms/inplace_merge.html
==============================================================================
--- branches/release/libs/range/doc/html/range/reference/algorithms/range_algorithm_mutating_algorithms/inplace_merge.html (original)
+++ branches/release/libs/range/doc/html/range/reference/algorithms/range_algorithm_mutating_algorithms/inplace_merge.html 2010-04-23 18:50:56 EDT (Fri, 23 Apr 2010)
@@ -3,7 +3,7 @@
<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
<title>Range Algorithm - inplace_merge</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_mutating_algorithms.html" title="Mutating algorithms">
<link rel="prev" href="generate.html" title="Range Algorithm - generate">
@@ -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="id665440"></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="id665999"></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="id666216"></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="id666288"></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="id666531"></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="id666551"></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="id666805"></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="id667078"></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: branches/release/libs/range/doc/html/range/reference/algorithms/range_algorithm_mutating_algorithms/merge.html
==============================================================================
--- branches/release/libs/range/doc/html/range/reference/algorithms/range_algorithm_mutating_algorithms/merge.html (original)
+++ branches/release/libs/range/doc/html/range/reference/algorithms/range_algorithm_mutating_algorithms/merge.html 2010-04-23 18:50:56 EDT (Fri, 23 Apr 2010)
@@ -3,7 +3,7 @@
<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
<title>Range Algorithm - merge</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_mutating_algorithms.html" title="Mutating algorithms">
<link rel="prev" href="inplace_merge.html" title="Range Algorithm - inplace_merge">
@@ -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="id667157"></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="id667503"></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="id667679"></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="id667750"></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="id668233"></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="id668255"></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="id668705"></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="id669178"></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: branches/release/libs/range/doc/html/range/reference/algorithms/range_algorithm_mutating_algorithms/nth_element.html
==============================================================================
--- branches/release/libs/range/doc/html/range/reference/algorithms/range_algorithm_mutating_algorithms/nth_element.html (original)
+++ branches/release/libs/range/doc/html/range/reference/algorithms/range_algorithm_mutating_algorithms/nth_element.html 2010-04-23 18:50:56 EDT (Fri, 23 Apr 2010)
@@ -3,7 +3,7 @@
<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
<title>Range Algorithm - nth_element</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_mutating_algorithms.html" title="Mutating algorithms">
<link rel="prev" href="merge.html" title="Range Algorithm - merge">
@@ -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="id669302"></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="id669789"></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="id669866"></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="id669937"></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="id670160"></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: branches/release/libs/range/doc/html/range/reference/algorithms/range_algorithm_mutating_algorithms/partial_sort.html
==============================================================================
--- branches/release/libs/range/doc/html/range/reference/algorithms/range_algorithm_mutating_algorithms/partial_sort.html (original)
+++ branches/release/libs/range/doc/html/range/reference/algorithms/range_algorithm_mutating_algorithms/partial_sort.html 2010-04-23 18:50:56 EDT (Fri, 23 Apr 2010)
@@ -3,7 +3,7 @@
<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
<title>Range Algorithm - partial_sort</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_mutating_algorithms.html" title="Mutating algorithms">
<link rel="prev" href="nth_element.html" title="Range Algorithm - nth_element">
@@ -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="id670225"></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="id670711"></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="id670887"></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="id670959"></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="id671180"></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: branches/release/libs/range/doc/html/range/reference/algorithms/range_algorithm_mutating_algorithms/partition.html
==============================================================================
--- branches/release/libs/range/doc/html/range/reference/algorithms/range_algorithm_mutating_algorithms/partition.html (original)
+++ branches/release/libs/range/doc/html/range/reference/algorithms/range_algorithm_mutating_algorithms/partition.html 2010-04-23 18:50:56 EDT (Fri, 23 Apr 2010)
@@ -3,7 +3,7 @@
<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
<title>Range Algorithm - partition</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_mutating_algorithms.html" title="Mutating algorithms">
<link rel="prev" href="partial_sort.html" title="Range Algorithm - partial_sort">
@@ -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="id671298"></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="id671878"></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="id671957"></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="id672027"></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="id672122"></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: branches/release/libs/range/doc/html/range/reference/algorithms/range_algorithm_mutating_algorithms/random_shuffle.html
==============================================================================
--- branches/release/libs/range/doc/html/range/reference/algorithms/range_algorithm_mutating_algorithms/random_shuffle.html (original)
+++ branches/release/libs/range/doc/html/range/reference/algorithms/range_algorithm_mutating_algorithms/random_shuffle.html 2010-04-23 18:50:56 EDT (Fri, 23 Apr 2010)
@@ -3,7 +3,7 @@
<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
<title>Range Algorithm - random_shuffle</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_mutating_algorithms.html" title="Mutating algorithms">
<link rel="prev" href="partition.html" title="Range Algorithm - partition">
@@ -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="id672234"></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="id672620"></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="id672708"></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="id672780"></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="id672918"></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="id672979"></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: branches/release/libs/range/doc/html/range/reference/algorithms/range_algorithm_mutating_algorithms/remove.html
==============================================================================
--- branches/release/libs/range/doc/html/range/reference/algorithms/range_algorithm_mutating_algorithms/remove.html (original)
+++ branches/release/libs/range/doc/html/range/reference/algorithms/range_algorithm_mutating_algorithms/remove.html 2010-04-23 18:50:56 EDT (Fri, 23 Apr 2010)
@@ -3,7 +3,7 @@
<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
<title>Range Algorithm - remove</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_mutating_algorithms.html" title="Mutating algorithms">
<link rel="prev" href="random_shuffle.html" title="Range Algorithm - random_shuffle">
@@ -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="id673083"></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="id673700"></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="id673928"></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="id673998"></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="id674106"></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: branches/release/libs/range/doc/html/range/reference/algorithms/range_algorithm_mutating_algorithms/remove_if.html
==============================================================================
--- branches/release/libs/range/doc/html/range/reference/algorithms/range_algorithm_mutating_algorithms/remove_if.html (original)
+++ branches/release/libs/range/doc/html/range/reference/algorithms/range_algorithm_mutating_algorithms/remove_if.html 2010-04-23 18:50:56 EDT (Fri, 23 Apr 2010)
@@ -3,7 +3,7 @@
<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
<title>Range Algorithm - remove_if</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_mutating_algorithms.html" title="Mutating algorithms">
<link rel="prev" href="remove.html" title="Range Algorithm - remove">
@@ -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="id674184"></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="id674760"></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="id674983"></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="id675053"></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="id675161"></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: branches/release/libs/range/doc/html/range/reference/algorithms/range_algorithm_mutating_algorithms/replace.html
==============================================================================
--- branches/release/libs/range/doc/html/range/reference/algorithms/range_algorithm_mutating_algorithms/replace.html (original)
+++ branches/release/libs/range/doc/html/range/reference/algorithms/range_algorithm_mutating_algorithms/replace.html 2010-04-23 18:50:56 EDT (Fri, 23 Apr 2010)
@@ -3,7 +3,7 @@
<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
<title>Range Algorithm - replace</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_mutating_algorithms.html" title="Mutating algorithms">
<link rel="prev" href="remove_if.html" title="Range Algorithm - remove_if">
@@ -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="id675247"></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="id675560"></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="id675637"></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="id675707"></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="id675850"></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: branches/release/libs/range/doc/html/range/reference/algorithms/range_algorithm_mutating_algorithms/replace_if.html
==============================================================================
--- branches/release/libs/range/doc/html/range/reference/algorithms/range_algorithm_mutating_algorithms/replace_if.html (original)
+++ branches/release/libs/range/doc/html/range/reference/algorithms/range_algorithm_mutating_algorithms/replace_if.html 2010-04-23 18:50:56 EDT (Fri, 23 Apr 2010)
@@ -3,7 +3,7 @@
<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
<title>Range Algorithm - replace_if</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_mutating_algorithms.html" title="Mutating algorithms">
<link rel="prev" href="replace.html" title="Range Algorithm - replace">
@@ -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="id675952"></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="id676272"></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="id676383"></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="id676454"></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="id676612"></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: branches/release/libs/range/doc/html/range/reference/algorithms/range_algorithm_mutating_algorithms/rotate.html
==============================================================================
--- branches/release/libs/range/doc/html/range/reference/algorithms/range_algorithm_mutating_algorithms/rotate.html (original)
+++ branches/release/libs/range/doc/html/range/reference/algorithms/range_algorithm_mutating_algorithms/rotate.html 2010-04-23 18:50:56 EDT (Fri, 23 Apr 2010)
@@ -3,7 +3,7 @@
<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
<title>Range Algorithm - rotate</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_mutating_algorithms.html" title="Mutating algorithms">
<link rel="prev" href="replace_if.html" title="Range Algorithm - replace_if">
@@ -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="id676724"></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="id676981"></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="id677102"></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="id677174"></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="id677233"></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="id677339"></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: branches/release/libs/range/doc/html/range/reference/algorithms/range_algorithm_mutating_algorithms/sort.html
==============================================================================
--- branches/release/libs/range/doc/html/range/reference/algorithms/range_algorithm_mutating_algorithms/sort.html (original)
+++ branches/release/libs/range/doc/html/range/reference/algorithms/range_algorithm_mutating_algorithms/sort.html 2010-04-23 18:50:56 EDT (Fri, 23 Apr 2010)
@@ -3,7 +3,7 @@
<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
<title>Range Algorithm - sort</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_mutating_algorithms.html" title="Mutating algorithms">
<link rel="prev" href="rotate.html" title="Range Algorithm - rotate">
@@ -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="id677405"></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="id677781"></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="id678027"></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="id678098"></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="id678319"></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: branches/release/libs/range/doc/html/range/reference/algorithms/range_algorithm_mutating_algorithms/stable_partition.html
==============================================================================
--- branches/release/libs/range/doc/html/range/reference/algorithms/range_algorithm_mutating_algorithms/stable_partition.html (original)
+++ branches/release/libs/range/doc/html/range/reference/algorithms/range_algorithm_mutating_algorithms/stable_partition.html 2010-04-23 18:50:56 EDT (Fri, 23 Apr 2010)
@@ -3,7 +3,7 @@
<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
<title>Range Algorithm - stable_partition</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_mutating_algorithms.html" title="Mutating algorithms">
<link rel="prev" href="sort.html" title="Range Algorithm - sort">
@@ -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="id678435"></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="id679008"></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="id679150"></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="id679221"></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="id679305"></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: branches/release/libs/range/doc/html/range/reference/algorithms/range_algorithm_mutating_algorithms/stable_sort.html
==============================================================================
--- branches/release/libs/range/doc/html/range/reference/algorithms/range_algorithm_mutating_algorithms/stable_sort.html (original)
+++ branches/release/libs/range/doc/html/range/reference/algorithms/range_algorithm_mutating_algorithms/stable_sort.html 2010-04-23 18:50:56 EDT (Fri, 23 Apr 2010)
@@ -3,7 +3,7 @@
<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
<title>Range Algorithm - stable_sort</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_mutating_algorithms.html" title="Mutating algorithms">
<link rel="prev" href="stable_partition.html" title="Range Algorithm - stable_partition">
@@ -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="id679474"></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="id679851"></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="id680095"></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="id680166"></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="id680387"></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: branches/release/libs/range/doc/html/range/reference/algorithms/range_algorithm_mutating_algorithms/transform.html
==============================================================================
--- branches/release/libs/range/doc/html/range/reference/algorithms/range_algorithm_mutating_algorithms/transform.html (original)
+++ branches/release/libs/range/doc/html/range/reference/algorithms/range_algorithm_mutating_algorithms/transform.html 2010-04-23 18:50:56 EDT (Fri, 23 Apr 2010)
@@ -3,7 +3,7 @@
<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
<title>Range Algorithm - transform</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_mutating_algorithms.html" title="Mutating algorithms">
<link rel="prev" href="stable_sort.html" title="Range Algorithm - stable_sort">
@@ -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="id680568"></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="id680904"></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="id681443"></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="id681514"></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="id681844"></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="id682252"></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: branches/release/libs/range/doc/html/range/reference/algorithms/range_algorithm_mutating_algorithms/unique.html
==============================================================================
--- branches/release/libs/range/doc/html/range/reference/algorithms/range_algorithm_mutating_algorithms/unique.html (original)
+++ branches/release/libs/range/doc/html/range/reference/algorithms/range_algorithm_mutating_algorithms/unique.html 2010-04-23 18:50:56 EDT (Fri, 23 Apr 2010)
@@ -3,7 +3,7 @@
<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
<title>Range Algorithm - unique</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_mutating_algorithms.html" title="Mutating algorithms">
<link rel="prev" href="transform.html" title="Range Algorithm - transform">
@@ -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="id682371"></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="id683395"></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="id683513"></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="id683584"></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="id683784"></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: branches/release/libs/range/doc/html/range/reference/algorithms/range_algorithm_new_algorithms.html
==============================================================================
--- branches/release/libs/range/doc/html/range/reference/algorithms/range_algorithm_new_algorithms.html (original)
+++ branches/release/libs/range/doc/html/range/reference/algorithms/range_algorithm_new_algorithms.html 2010-04-23 18:50:56 EDT (Fri, 23 Apr 2010)
@@ -3,7 +3,7 @@
<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
<title>New algorithms</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="../algorithms.html" title="Range Algorithm">
<link rel="prev" href="permutation_algorithms/prev_permutation.html" title="prev_permutation">
Modified: branches/release/libs/range/doc/html/range/reference/algorithms/range_algorithm_new_algorithms/erase.html
==============================================================================
--- branches/release/libs/range/doc/html/range/reference/algorithms/range_algorithm_new_algorithms/erase.html (original)
+++ branches/release/libs/range/doc/html/range/reference/algorithms/range_algorithm_new_algorithms/erase.html 2010-04-23 18:50:56 EDT (Fri, 23 Apr 2010)
@@ -3,7 +3,7 @@
<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
<title>erase</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="../range_algorithm_new_algorithms.html" title="New algorithms">
@@ -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="id714130"></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="id714284"></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="id714340"></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="id714411"></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="id714454"></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: branches/release/libs/range/doc/html/range/reference/algorithms/range_algorithm_new_algorithms/for_each.html
==============================================================================
--- branches/release/libs/range/doc/html/range/reference/algorithms/range_algorithm_new_algorithms/for_each.html (original)
+++ branches/release/libs/range/doc/html/range/reference/algorithms/range_algorithm_new_algorithms/for_each.html 2010-04-23 18:50:56 EDT (Fri, 23 Apr 2010)
@@ -3,7 +3,7 @@
<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
<title>for_each</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="erase.html" title="erase">
@@ -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="id714521"></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="id715097"></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="id715253"></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="id715324"></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="id715469"></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: branches/release/libs/range/doc/html/range/reference/algorithms/range_algorithm_new_algorithms/insert.html
==============================================================================
--- branches/release/libs/range/doc/html/range/reference/algorithms/range_algorithm_new_algorithms/insert.html (original)
+++ branches/release/libs/range/doc/html/range/reference/algorithms/range_algorithm_new_algorithms/insert.html 2010-04-23 18:50:56 EDT (Fri, 23 Apr 2010)
@@ -3,7 +3,7 @@
<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
<title>insert</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="for_each.html" title="for_each">
@@ -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="id715575"></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="id715740"></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="id715807"></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="id715878"></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="id715967"></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: branches/release/libs/range/doc/html/range/reference/algorithms/range_algorithm_new_algorithms/iota.html
==============================================================================
--- branches/release/libs/range/doc/html/range/reference/algorithms/range_algorithm_new_algorithms/iota.html (original)
+++ branches/release/libs/range/doc/html/range/reference/algorithms/range_algorithm_new_algorithms/iota.html 2010-04-23 18:50:56 EDT (Fri, 23 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: branches/release/libs/range/doc/html/range/reference/algorithms/range_algorithm_new_algorithms/overwrite.html
==============================================================================
--- branches/release/libs/range/doc/html/range/reference/algorithms/range_algorithm_new_algorithms/overwrite.html (original)
+++ branches/release/libs/range/doc/html/range/reference/algorithms/range_algorithm_new_algorithms/overwrite.html 2010-04-23 18:50:56 EDT (Fri, 23 Apr 2010)
@@ -3,7 +3,7 @@
<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
<title>overwrite</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="iota.html" title="iota">
@@ -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="id716511"></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="id716646"></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="id716703"></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="id716773"></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="id716934"></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: branches/release/libs/range/doc/html/range/reference/algorithms/range_algorithm_new_algorithms/push_back.html
==============================================================================
--- branches/release/libs/range/doc/html/range/reference/algorithms/range_algorithm_new_algorithms/push_back.html (original)
+++ branches/release/libs/range/doc/html/range/reference/algorithms/range_algorithm_new_algorithms/push_back.html 2010-04-23 18:50:56 EDT (Fri, 23 Apr 2010)
@@ -3,7 +3,7 @@
<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
<title>push_back</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="overwrite.html" title="overwrite">
@@ -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="id717001"></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="id717137"></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="id717193"></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="id717265"></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="id717368"></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: branches/release/libs/range/doc/html/range/reference/algorithms/range_algorithm_new_algorithms/push_front.html
==============================================================================
--- branches/release/libs/range/doc/html/range/reference/algorithms/range_algorithm_new_algorithms/push_front.html (original)
+++ branches/release/libs/range/doc/html/range/reference/algorithms/range_algorithm_new_algorithms/push_front.html 2010-04-23 18:50:56 EDT (Fri, 23 Apr 2010)
@@ -3,7 +3,7 @@
<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
<title>push_front</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="push_back.html" title="push_back">
@@ -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="id717434"></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="id717568"></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="id717625"></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="id717696"></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="id717799"></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: branches/release/libs/range/doc/html/range/reference/algorithms/range_algorithm_new_algorithms/remove_erase.html
==============================================================================
--- branches/release/libs/range/doc/html/range/reference/algorithms/range_algorithm_new_algorithms/remove_erase.html (original)
+++ branches/release/libs/range/doc/html/range/reference/algorithms/range_algorithm_new_algorithms/remove_erase.html 2010-04-23 18:50:56 EDT (Fri, 23 Apr 2010)
@@ -3,7 +3,7 @@
<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
<title>remove_erase</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="push_front.html" title="push_front">
@@ -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="id717866"></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="id718000"></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="id718057"></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="id718128"></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="id718171"></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: branches/release/libs/range/doc/html/range/reference/algorithms/range_algorithm_new_algorithms/remove_erase_if.html
==============================================================================
--- branches/release/libs/range/doc/html/range/reference/algorithms/range_algorithm_new_algorithms/remove_erase_if.html (original)
+++ branches/release/libs/range/doc/html/range/reference/algorithms/range_algorithm_new_algorithms/remove_erase_if.html 2010-04-23 18:50:56 EDT (Fri, 23 Apr 2010)
@@ -3,7 +3,7 @@
<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
<title>remove_erase_if</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="remove_erase.html" title="remove_erase">
@@ -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="id718238"></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="id718362"></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="id718443"></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="id718513"></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="id718581"></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: branches/release/libs/range/doc/html/range/reference/algorithms/range_algorithm_non_mutating_algorithms.html
==============================================================================
--- branches/release/libs/range/doc/html/range/reference/algorithms/range_algorithm_non_mutating_algorithms.html (original)
+++ branches/release/libs/range/doc/html/range/reference/algorithms/range_algorithm_non_mutating_algorithms.html 2010-04-23 18:50:56 EDT (Fri, 23 Apr 2010)
@@ -3,7 +3,7 @@
<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
<title>Non-mutating algorithms</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="../algorithms.html" title="Range Algorithm">
<link rel="prev" href="range_algorithm_mutating_algorithms/unique.html" title="Range Algorithm - unique">
Modified: branches/release/libs/range/doc/html/range/reference/algorithms/range_algorithm_non_mutating_algorithms/adjacent_find.html
==============================================================================
--- branches/release/libs/range/doc/html/range/reference/algorithms/range_algorithm_non_mutating_algorithms/adjacent_find.html (original)
+++ branches/release/libs/range/doc/html/range/reference/algorithms/range_algorithm_non_mutating_algorithms/adjacent_find.html 2010-04-23 18:50:56 EDT (Fri, 23 Apr 2010)
@@ -3,7 +3,7 @@
<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
<title>Range Algorithm - adjacent_find</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_non_mutating_algorithms.html" title="Non-mutating algorithms">
<link rel="prev" href="../range_algorithm_non_mutating_algorithms.html" title="Non-mutating algorithms">
@@ -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="id683926"></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="id684902"></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="id685110"></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="id685180"></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="id685353"></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: branches/release/libs/range/doc/html/range/reference/algorithms/range_algorithm_non_mutating_algorithms/binary_search.html
==============================================================================
--- branches/release/libs/range/doc/html/range/reference/algorithms/range_algorithm_non_mutating_algorithms/binary_search.html (original)
+++ branches/release/libs/range/doc/html/range/reference/algorithms/range_algorithm_non_mutating_algorithms/binary_search.html 2010-04-23 18:50:56 EDT (Fri, 23 Apr 2010)
@@ -3,7 +3,7 @@
<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
<title>binary_search</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_non_mutating_algorithms.html" title="Non-mutating algorithms">
<link rel="prev" href="adjacent_find.html" title="Range Algorithm - adjacent_find">
@@ -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="id685455"></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="id685734"></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="id685801"></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="id685873"></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="id686117"></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="id686210"></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: branches/release/libs/range/doc/html/range/reference/algorithms/range_algorithm_non_mutating_algorithms/count.html
==============================================================================
--- branches/release/libs/range/doc/html/range/reference/algorithms/range_algorithm_non_mutating_algorithms/count.html (original)
+++ branches/release/libs/range/doc/html/range/reference/algorithms/range_algorithm_non_mutating_algorithms/count.html 2010-04-23 18:50:56 EDT (Fri, 23 Apr 2010)
@@ -3,7 +3,7 @@
<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
<title>count</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_non_mutating_algorithms.html" title="Non-mutating algorithms">
<link rel="prev" href="binary_search.html" title="binary_search">
@@ -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="id686377"></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="id686672"></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="id686759"></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="id686830"></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="id686950"></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: branches/release/libs/range/doc/html/range/reference/algorithms/range_algorithm_non_mutating_algorithms/equal.html
==============================================================================
--- branches/release/libs/range/doc/html/range/reference/algorithms/range_algorithm_non_mutating_algorithms/equal.html (original)
+++ branches/release/libs/range/doc/html/range/reference/algorithms/range_algorithm_non_mutating_algorithms/equal.html 2010-04-23 18:50:56 EDT (Fri, 23 Apr 2010)
@@ -3,7 +3,7 @@
<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
<title>equal</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_non_mutating_algorithms.html" title="Non-mutating algorithms">
<link rel="prev" href="count.html" title="count">
@@ -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="id687016"></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="id687299"></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="id687532"></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="id687603"></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="id687881"></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: branches/release/libs/range/doc/html/range/reference/algorithms/range_algorithm_non_mutating_algorithms/equal_range.html
==============================================================================
--- branches/release/libs/range/doc/html/range/reference/algorithms/range_algorithm_non_mutating_algorithms/equal_range.html (original)
+++ branches/release/libs/range/doc/html/range/reference/algorithms/range_algorithm_non_mutating_algorithms/equal_range.html 2010-04-23 18:50:56 EDT (Fri, 23 Apr 2010)
@@ -3,7 +3,7 @@
<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
<title>equal_range</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_non_mutating_algorithms.html" title="Non-mutating algorithms">
<link rel="prev" href="equal.html" title="equal">
@@ -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="id687976"></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="id688850"></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="id688996"></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="id689068"></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="id689312"></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="id689388"></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: branches/release/libs/range/doc/html/range/reference/algorithms/range_algorithm_non_mutating_algorithms/find.html
==============================================================================
--- branches/release/libs/range/doc/html/range/reference/algorithms/range_algorithm_non_mutating_algorithms/find.html (original)
+++ branches/release/libs/range/doc/html/range/reference/algorithms/range_algorithm_non_mutating_algorithms/find.html 2010-04-23 18:50:56 EDT (Fri, 23 Apr 2010)
@@ -3,7 +3,7 @@
<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
<title>find</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_non_mutating_algorithms.html" title="Non-mutating algorithms">
<link rel="prev" href="for_each.html" title="for_each">
@@ -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="id690044"></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="id690333"></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="id690450"></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="id690521"></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="id690630"></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: branches/release/libs/range/doc/html/range/reference/algorithms/range_algorithm_non_mutating_algorithms/find_end.html
==============================================================================
--- branches/release/libs/range/doc/html/range/reference/algorithms/range_algorithm_non_mutating_algorithms/find_end.html (original)
+++ branches/release/libs/range/doc/html/range/reference/algorithms/range_algorithm_non_mutating_algorithms/find_end.html 2010-04-23 18:50:56 EDT (Fri, 23 Apr 2010)
@@ -3,7 +3,7 @@
<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
<title>find_end</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_non_mutating_algorithms.html" title="Non-mutating algorithms">
<link rel="prev" href="find.html" title="find">
@@ -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="id690698"></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="id691357"></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="id691482"></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="id691555"></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="id691833"></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: branches/release/libs/range/doc/html/range/reference/algorithms/range_algorithm_non_mutating_algorithms/find_first_of.html
==============================================================================
--- branches/release/libs/range/doc/html/range/reference/algorithms/range_algorithm_non_mutating_algorithms/find_first_of.html (original)
+++ branches/release/libs/range/doc/html/range/reference/algorithms/range_algorithm_non_mutating_algorithms/find_first_of.html 2010-04-23 18:50:56 EDT (Fri, 23 Apr 2010)
@@ -3,7 +3,7 @@
<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
<title>find_first_of</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_non_mutating_algorithms.html" title="Non-mutating algorithms">
<link rel="prev" href="find_end.html" title="find_end">
@@ -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="id692006"></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="id692666"></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="id692797"></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="id692870"></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="id693110"></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: branches/release/libs/range/doc/html/range/reference/algorithms/range_algorithm_non_mutating_algorithms/find_if.html
==============================================================================
--- branches/release/libs/range/doc/html/range/reference/algorithms/range_algorithm_non_mutating_algorithms/find_if.html (original)
+++ branches/release/libs/range/doc/html/range/reference/algorithms/range_algorithm_non_mutating_algorithms/find_if.html 2010-04-23 18:50:56 EDT (Fri, 23 Apr 2010)
@@ -3,7 +3,7 @@
<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
<title>find_if</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_non_mutating_algorithms.html" title="Non-mutating algorithms">
<link rel="prev" href="find_first_of.html" title="find_first_of">
@@ -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="id693199"></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="id693489"></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="id693619"></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="id693689"></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="id693785"></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="id693855"></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: branches/release/libs/range/doc/html/range/reference/algorithms/range_algorithm_non_mutating_algorithms/for_each.html
==============================================================================
--- branches/release/libs/range/doc/html/range/reference/algorithms/range_algorithm_non_mutating_algorithms/for_each.html (original)
+++ branches/release/libs/range/doc/html/range/reference/algorithms/range_algorithm_non_mutating_algorithms/for_each.html 2010-04-23 18:50:56 EDT (Fri, 23 Apr 2010)
@@ -3,7 +3,7 @@
<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
<title>for_each</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_non_mutating_algorithms.html" title="Non-mutating algorithms">
<link rel="prev" href="equal_range.html" title="equal_range">
@@ -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="id689482"></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="id689706"></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="id689786"></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="id689858"></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="id689966"></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: branches/release/libs/range/doc/html/range/reference/algorithms/range_algorithm_non_mutating_algorithms/lexicographical_compare.html
==============================================================================
--- branches/release/libs/range/doc/html/range/reference/algorithms/range_algorithm_non_mutating_algorithms/lexicographical_compare.html (original)
+++ branches/release/libs/range/doc/html/range/reference/algorithms/range_algorithm_non_mutating_algorithms/lexicographical_compare.html 2010-04-23 18:50:56 EDT (Fri, 23 Apr 2010)
@@ -3,7 +3,7 @@
<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
<title>lexicographical_compare</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_non_mutating_algorithms.html" title="Non-mutating algorithms">
<link rel="prev" href="find_if.html" title="find_if">
@@ -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="id693934"></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="id694218"></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="id694385"></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="id694457"></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="id694801"></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: branches/release/libs/range/doc/html/range/reference/algorithms/range_algorithm_non_mutating_algorithms/lower_bound.html
==============================================================================
--- branches/release/libs/range/doc/html/range/reference/algorithms/range_algorithm_non_mutating_algorithms/lower_bound.html (original)
+++ branches/release/libs/range/doc/html/range/reference/algorithms/range_algorithm_non_mutating_algorithms/lower_bound.html 2010-04-23 18:50:56 EDT (Fri, 23 Apr 2010)
@@ -3,7 +3,7 @@
<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
<title>lower_bound</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_non_mutating_algorithms.html" title="Non-mutating algorithms">
<link rel="prev" href="lexicographical_compare.html" title="lexicographical_compare">
@@ -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="id694907"></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="id695197"></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="id695387"></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="id695459"></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="id695704"></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="id695796"></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: branches/release/libs/range/doc/html/range/reference/algorithms/range_algorithm_non_mutating_algorithms/max_element.html
==============================================================================
--- branches/release/libs/range/doc/html/range/reference/algorithms/range_algorithm_non_mutating_algorithms/max_element.html (original)
+++ branches/release/libs/range/doc/html/range/reference/algorithms/range_algorithm_non_mutating_algorithms/max_element.html 2010-04-23 18:50:56 EDT (Fri, 23 Apr 2010)
@@ -3,7 +3,7 @@
<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
<title>max_element</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_non_mutating_algorithms.html" title="Non-mutating algorithms">
<link rel="prev" href="lower_bound.html" title="lower_bound">
@@ -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="id695936"></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="id696924"></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="id697019"></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="id697092"></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="id697255"></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: branches/release/libs/range/doc/html/range/reference/algorithms/range_algorithm_non_mutating_algorithms/min_element.html
==============================================================================
--- branches/release/libs/range/doc/html/range/reference/algorithms/range_algorithm_non_mutating_algorithms/min_element.html (original)
+++ branches/release/libs/range/doc/html/range/reference/algorithms/range_algorithm_non_mutating_algorithms/min_element.html 2010-04-23 18:50:56 EDT (Fri, 23 Apr 2010)
@@ -3,7 +3,7 @@
<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
<title>min_element</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_non_mutating_algorithms.html" title="Non-mutating algorithms">
<link rel="prev" href="max_element.html" title="max_element">
@@ -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="id697357"></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="id698344"></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="id698440"></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="id698513"></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="id698675"></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: branches/release/libs/range/doc/html/range/reference/algorithms/range_algorithm_non_mutating_algorithms/mismatch.html
==============================================================================
--- branches/release/libs/range/doc/html/range/reference/algorithms/range_algorithm_non_mutating_algorithms/mismatch.html (original)
+++ branches/release/libs/range/doc/html/range/reference/algorithms/range_algorithm_non_mutating_algorithms/mismatch.html 2010-04-23 18:50:56 EDT (Fri, 23 Apr 2010)
@@ -3,7 +3,7 @@
<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
<title>mismatch</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_non_mutating_algorithms.html" title="Non-mutating algorithms">
<link rel="prev" href="min_element.html" title="min_element">
@@ -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="id698775"></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="id700480"></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="id700612"></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="id700685"></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="id700965"></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="id701037"></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: branches/release/libs/range/doc/html/range/reference/algorithms/range_algorithm_non_mutating_algorithms/search.html
==============================================================================
--- branches/release/libs/range/doc/html/range/reference/algorithms/range_algorithm_non_mutating_algorithms/search.html (original)
+++ branches/release/libs/range/doc/html/range/reference/algorithms/range_algorithm_non_mutating_algorithms/search.html 2010-04-23 18:50:56 EDT (Fri, 23 Apr 2010)
@@ -3,7 +3,7 @@
<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
<title>search</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_non_mutating_algorithms.html" title="Non-mutating algorithms">
<link rel="prev" href="mismatch.html" title="mismatch">
@@ -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="id701103"></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="id702442"></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="id702607"></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="id702678"></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="id702956"></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: branches/release/libs/range/doc/html/range/reference/algorithms/range_algorithm_non_mutating_algorithms/upper_bound.html
==============================================================================
--- branches/release/libs/range/doc/html/range/reference/algorithms/range_algorithm_non_mutating_algorithms/upper_bound.html (original)
+++ branches/release/libs/range/doc/html/range/reference/algorithms/range_algorithm_non_mutating_algorithms/upper_bound.html 2010-04-23 18:50:56 EDT (Fri, 23 Apr 2010)
@@ -3,7 +3,7 @@
<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
<title>upper_bound</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_non_mutating_algorithms.html" title="Non-mutating algorithms">
<link rel="prev" href="search.html" title="search">
@@ -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="id703000"></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="id703290"></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="id703484"></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="id703555"></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="id703799"></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="id703891"></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: branches/release/libs/range/doc/html/range/reference/algorithms/range_numeric.html
==============================================================================
--- branches/release/libs/range/doc/html/range/reference/algorithms/range_numeric.html (original)
+++ branches/release/libs/range/doc/html/range/reference/algorithms/range_numeric.html 2010-04-23 18:50:56 EDT (Fri, 23 Apr 2010)
@@ -3,7 +3,7 @@
<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
<title>Numeric algorithms</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="../algorithms.html" title="Range Algorithm">
<link rel="prev" href="range_algorithm_new_algorithms/remove_erase_if.html" title="remove_erase_if">
Modified: branches/release/libs/range/doc/html/range/reference/algorithms/range_numeric/accumulate.html
==============================================================================
--- branches/release/libs/range/doc/html/range/reference/algorithms/range_numeric/accumulate.html (original)
+++ branches/release/libs/range/doc/html/range/reference/algorithms/range_numeric/accumulate.html 2010-04-23 18:50:56 EDT (Fri, 23 Apr 2010)
@@ -3,7 +3,7 @@
<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
<title>accumulate</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_numeric.html" title="Numeric algorithms">
<link rel="prev" href="../range_numeric.html" title="Numeric algorithms">
@@ -28,7 +28,7 @@
accumulate</a>
</h5></div></div></div>
<a name="range.reference.algorithms.range_numeric.accumulate.prototype"></a><h6>
-<a name="id718665"></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="id718927"></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="id719001"></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="id719064"></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="id719085"></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="id719214"></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="id719387"></a>
+<a name="id3108477"></a>
<a class="link" href="accumulate.html#range.reference.algorithms.range_numeric.accumulate.complexity">Complexity</a>
</h6>
<p>
Modified: branches/release/libs/range/doc/html/range/reference/algorithms/range_numeric/adjacent_difference.html
==============================================================================
--- branches/release/libs/range/doc/html/range/reference/algorithms/range_numeric/adjacent_difference.html (original)
+++ branches/release/libs/range/doc/html/range/reference/algorithms/range_numeric/adjacent_difference.html 2010-04-23 18:50:56 EDT (Fri, 23 Apr 2010)
@@ -3,7 +3,7 @@
<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
<title>adjacent_difference</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_numeric.html" title="Numeric algorithms">
<link rel="prev" href="accumulate.html" title="accumulate">
@@ -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="id719451"></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="id719714"></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="id719816"></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="id719877"></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="id719899"></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="id720090"></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="id720265"></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="id720338"></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: branches/release/libs/range/doc/html/range/reference/algorithms/range_numeric/inner_product.html
==============================================================================
--- branches/release/libs/range/doc/html/range/reference/algorithms/range_numeric/inner_product.html (original)
+++ branches/release/libs/range/doc/html/range/reference/algorithms/range_numeric/inner_product.html 2010-04-23 18:50:56 EDT (Fri, 23 Apr 2010)
@@ -3,7 +3,7 @@
<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
<title>inner_product</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_numeric.html" title="Numeric algorithms">
<link rel="prev" href="adjacent_difference.html" title="adjacent_difference">
@@ -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="id720437"></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="id720800"></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="id720877"></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="id720939"></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="id720959"></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="id721200"></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="id721469"></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="id721542"></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: branches/release/libs/range/doc/html/range/reference/algorithms/range_numeric/partial_sum.html
==============================================================================
--- branches/release/libs/range/doc/html/range/reference/algorithms/range_numeric/partial_sum.html (original)
+++ branches/release/libs/range/doc/html/range/reference/algorithms/range_numeric/partial_sum.html 2010-04-23 18:50:56 EDT (Fri, 23 Apr 2010)
@@ -3,7 +3,7 @@
<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
<title>partial_sum</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_numeric.html" title="Numeric algorithms">
<link rel="prev" href="inner_product.html" title="inner_product">
@@ -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="id721607"></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="id721863"></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="id722002"></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="id722064"></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="id722085"></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="id722276"></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="id722425"></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="id722499"></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: branches/release/libs/range/doc/html/range/reference/algorithms/set_algorithms.html
==============================================================================
--- branches/release/libs/range/doc/html/range/reference/algorithms/set_algorithms.html (original)
+++ branches/release/libs/range/doc/html/range/reference/algorithms/set_algorithms.html 2010-04-23 18:50:56 EDT (Fri, 23 Apr 2010)
@@ -3,7 +3,7 @@
<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
<title>Set algorithms</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="../algorithms.html" title="Range Algorithm">
<link rel="prev" href="range_algorithm_non_mutating_algorithms/upper_bound.html" title="upper_bound">
Modified: branches/release/libs/range/doc/html/range/reference/algorithms/set_algorithms/includes.html
==============================================================================
--- branches/release/libs/range/doc/html/range/reference/algorithms/set_algorithms/includes.html (original)
+++ branches/release/libs/range/doc/html/range/reference/algorithms/set_algorithms/includes.html 2010-04-23 18:50:56 EDT (Fri, 23 Apr 2010)
@@ -3,7 +3,7 @@
<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
<title>includes</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="../set_algorithms.html" title="Set algorithms">
<link rel="prev" href="../set_algorithms.html" title="Set algorithms">
@@ -28,7 +28,7 @@
includes</a>
</h5></div></div></div>
<a name="range.reference.algorithms.set_algorithms.includes.prototype"></a><h6>
-<a name="id704045"></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="id704326"></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="id704419"></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="id704490"></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="id704857"></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="id704971"></a>
+<a name="id3092140"></a>
<a class="link" href="includes.html#range.reference.algorithms.set_algorithms.includes.complexity">Complexity</a>
</h6>
<p>
Modified: branches/release/libs/range/doc/html/range/reference/algorithms/set_algorithms/set_difference.html
==============================================================================
--- branches/release/libs/range/doc/html/range/reference/algorithms/set_algorithms/set_difference.html (original)
+++ branches/release/libs/range/doc/html/range/reference/algorithms/set_algorithms/set_difference.html 2010-04-23 18:50:56 EDT (Fri, 23 Apr 2010)
@@ -3,7 +3,7 @@
<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
<title>set_difference</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="../set_algorithms.html" title="Set algorithms">
<link rel="prev" href="set_intersection.html" title="set_intersection">
@@ -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="id707406"></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="id707752"></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="id707838"></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="id707909"></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="id708326"></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="id708440"></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: branches/release/libs/range/doc/html/range/reference/algorithms/set_algorithms/set_intersection.html
==============================================================================
--- branches/release/libs/range/doc/html/range/reference/algorithms/set_algorithms/set_intersection.html (original)
+++ branches/release/libs/range/doc/html/range/reference/algorithms/set_algorithms/set_intersection.html 2010-04-23 18:50:56 EDT (Fri, 23 Apr 2010)
@@ -3,7 +3,7 @@
<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
<title>set_intersection</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="../set_algorithms.html" title="Set algorithms">
<link rel="prev" href="set_union.html" title="set_union">
@@ -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="id706248"></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="id706594"></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="id706681"></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="id706751"></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="id707167"></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="id707282"></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: branches/release/libs/range/doc/html/range/reference/algorithms/set_algorithms/set_symmetric_difference.html
==============================================================================
--- branches/release/libs/range/doc/html/range/reference/algorithms/set_algorithms/set_symmetric_difference.html (original)
+++ branches/release/libs/range/doc/html/range/reference/algorithms/set_algorithms/set_symmetric_difference.html 2010-04-23 18:50:56 EDT (Fri, 23 Apr 2010)
@@ -3,7 +3,7 @@
<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
<title>set_symmetric_difference</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="../set_algorithms.html" title="Set algorithms">
<link rel="prev" href="set_difference.html" title="set_difference">
@@ -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="id708563"></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="id708909"></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="id708997"></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="id709068"></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="id709485"></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="id709600"></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: branches/release/libs/range/doc/html/range/reference/algorithms/set_algorithms/set_union.html
==============================================================================
--- branches/release/libs/range/doc/html/range/reference/algorithms/set_algorithms/set_union.html (original)
+++ branches/release/libs/range/doc/html/range/reference/algorithms/set_algorithms/set_union.html 2010-04-23 18:50:56 EDT (Fri, 23 Apr 2010)
@@ -3,7 +3,7 @@
<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
<title>set_union</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="../set_algorithms.html" title="Set algorithms">
<link rel="prev" href="includes.html" title="includes">
@@ -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="id705095"></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="id705441"></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="id705524"></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="id705594"></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="id706010"></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="id706124"></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: branches/release/libs/range/doc/html/range/reference/extending.html
==============================================================================
--- branches/release/libs/range/doc/html/range/reference/extending.html (original)
+++ branches/release/libs/range/doc/html/range/reference/extending.html 2010-04-23 18:50:56 EDT (Fri, 23 Apr 2010)
@@ -3,7 +3,7 @@
<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
<title>Extending the library</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="../reference.html" title="Reference">
<link rel="prev" href="ranges/irange.html" title="irange">
Modified: branches/release/libs/range/doc/html/range/reference/extending/method_1.html
==============================================================================
--- branches/release/libs/range/doc/html/range/reference/extending/method_1.html (original)
+++ branches/release/libs/range/doc/html/range/reference/extending/method_1.html 2010-04-23 18:50:56 EDT (Fri, 23 Apr 2010)
@@ -3,7 +3,7 @@
<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
<title>Method 1: provide member functions and nested types</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="../extending.html" title="Extending the library">
<link rel="prev" href="../extending.html" title="Extending the library">
Modified: branches/release/libs/range/doc/html/range/reference/extending/method_2.html
==============================================================================
--- branches/release/libs/range/doc/html/range/reference/extending/method_2.html (original)
+++ branches/release/libs/range/doc/html/range/reference/extending/method_2.html 2010-04-23 18:50:56 EDT (Fri, 23 Apr 2010)
@@ -3,7 +3,7 @@
<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
<title>Method 2: provide free-standing functions and specialize metafunctions</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="../extending.html" title="Extending the library">
<link rel="prev" href="method_1.html" title="Method 1: provide member functions and nested types">
Modified: branches/release/libs/range/doc/html/range/reference/extending/method_3.html
==============================================================================
--- branches/release/libs/range/doc/html/range/reference/extending/method_3.html (original)
+++ branches/release/libs/range/doc/html/range/reference/extending/method_3.html 2010-04-23 18:50:56 EDT (Fri, 23 Apr 2010)
@@ -3,7 +3,7 @@
<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
<title>Method 3: provide range adaptor implementations</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="../extending.html" title="Extending the library">
<link rel="prev" href="method_2.html" title="Method 2: provide free-standing functions and specialize metafunctions">
Modified: branches/release/libs/range/doc/html/range/reference/extending/method_3/method_3_1.html
==============================================================================
--- branches/release/libs/range/doc/html/range/reference/extending/method_3/method_3_1.html (original)
+++ branches/release/libs/range/doc/html/range/reference/extending/method_3/method_3_1.html 2010-04-23 18:50:56 EDT (Fri, 23 Apr 2010)
@@ -3,7 +3,7 @@
<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
<title>Method 3.1: Implement a Range Adaptor without arguments</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="../method_3.html" title="Method 3: provide range adaptor implementations">
<link rel="prev" href="../method_3.html" title="Method 3: provide range adaptor implementations">
Modified: branches/release/libs/range/doc/html/range/reference/extending/method_3/method_3_2.html
==============================================================================
--- branches/release/libs/range/doc/html/range/reference/extending/method_3/method_3_2.html (original)
+++ branches/release/libs/range/doc/html/range/reference/extending/method_3/method_3_2.html 2010-04-23 18:50:56 EDT (Fri, 23 Apr 2010)
@@ -3,7 +3,7 @@
<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
<title>Method 3.2: Implement a Range Adaptor with arguments</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="../method_3.html" title="Method 3: provide range adaptor implementations">
<link rel="prev" href="method_3_1.html" title="Method 3.1: Implement a Range Adaptor without arguments">
Modified: branches/release/libs/range/doc/html/range/reference/overview.html
==============================================================================
--- branches/release/libs/range/doc/html/range/reference/overview.html (original)
+++ branches/release/libs/range/doc/html/range/reference/overview.html 2010-04-23 18:50:56 EDT (Fri, 23 Apr 2010)
@@ -3,7 +3,7 @@
<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
<title>Overview</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="../reference.html" title="Reference">
<link rel="prev" href="../reference.html" title="Reference">
Modified: branches/release/libs/range/doc/html/range/reference/ranges.html
==============================================================================
--- branches/release/libs/range/doc/html/range/reference/ranges.html (original)
+++ branches/release/libs/range/doc/html/range/reference/ranges.html 2010-04-23 18:50:56 EDT (Fri, 23 Apr 2010)
@@ -3,7 +3,7 @@
<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
<title>Provided Ranges</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="../reference.html" title="Reference">
<link rel="prev" href="algorithms/range_numeric/partial_sum.html" title="partial_sum">
Modified: branches/release/libs/range/doc/html/range/reference/ranges/counting_range.html
==============================================================================
--- branches/release/libs/range/doc/html/range/reference/ranges/counting_range.html (original)
+++ branches/release/libs/range/doc/html/range/reference/ranges/counting_range.html 2010-04-23 18:50:56 EDT (Fri, 23 Apr 2010)
@@ -3,7 +3,7 @@
<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
<title>counting_range</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="../ranges.html" title="Provided Ranges">
<link rel="prev" href="../ranges.html" title="Provided Ranges">
@@ -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="id722615"></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="id722997"></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="id723052"></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="id723113"></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: branches/release/libs/range/doc/html/range/reference/ranges/irange.html
==============================================================================
--- branches/release/libs/range/doc/html/range/reference/ranges/irange.html (original)
+++ branches/release/libs/range/doc/html/range/reference/ranges/irange.html 2010-04-23 18:50:56 EDT (Fri, 23 Apr 2010)
@@ -3,7 +3,7 @@
<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
<title>irange</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="../ranges.html" title="Provided Ranges">
<link rel="prev" href="istream_range.html" title="istream_range">
@@ -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="id723540"></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="id723832"></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="id723910"></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="id723972"></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="id724049"></a>
+<a name="id3113330"></a>
<a class="link" href="irange.html#range.reference.ranges.irange.complexity">Complexity</a>
</h6>
<p>
Modified: branches/release/libs/range/doc/html/range/reference/ranges/istream_range.html
==============================================================================
--- branches/release/libs/range/doc/html/range/reference/ranges/istream_range.html (original)
+++ branches/release/libs/range/doc/html/range/reference/ranges/istream_range.html 2010-04-23 18:50:56 EDT (Fri, 23 Apr 2010)
@@ -3,7 +3,7 @@
<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
<title>istream_range</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="../ranges.html" title="Provided Ranges">
<link rel="prev" href="counting_range.html" title="counting_range">
@@ -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="id723182"></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="id723399"></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="id723464"></a>
+<a name="id3112731"></a>
<a class="link" href="istream_range.html#range.reference.ranges.istream_range.definition">Definition</a>
</h6>
<p>
Modified: branches/release/libs/range/doc/html/range/reference/semantics.html
==============================================================================
--- branches/release/libs/range/doc/html/range/reference/semantics.html (original)
+++ branches/release/libs/range/doc/html/range/reference/semantics.html 2010-04-23 18:50:56 EDT (Fri, 23 Apr 2010)
@@ -3,7 +3,7 @@
<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
<title>Semantics</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="../reference.html" title="Reference">
<link rel="prev" href="synopsis.html" title="Synopsis">
@@ -31,7 +31,7 @@
<dt><span class="section">Functions</span></dt>
</dl></div>
<a name="range.reference.semantics.notation"></a><h5>
-<a name="id637171"></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: branches/release/libs/range/doc/html/range/reference/semantics/functions.html
==============================================================================
--- branches/release/libs/range/doc/html/range/reference/semantics/functions.html (original)
+++ branches/release/libs/range/doc/html/range/reference/semantics/functions.html 2010-04-23 18:50:56 EDT (Fri, 23 Apr 2010)
@@ -3,7 +3,7 @@
<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
<title>Functions</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="../semantics.html" title="Semantics">
<link rel="prev" href="metafunctions.html" title="Metafunctions">
Modified: branches/release/libs/range/doc/html/range/reference/semantics/metafunctions.html
==============================================================================
--- branches/release/libs/range/doc/html/range/reference/semantics/metafunctions.html (original)
+++ branches/release/libs/range/doc/html/range/reference/semantics/metafunctions.html 2010-04-23 18:50:56 EDT (Fri, 23 Apr 2010)
@@ -3,7 +3,7 @@
<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
<title>Metafunctions</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="../semantics.html" title="Semantics">
<link rel="prev" href="../semantics.html" title="Semantics">
Modified: branches/release/libs/range/doc/html/range/reference/synopsis.html
==============================================================================
--- branches/release/libs/range/doc/html/range/reference/synopsis.html (original)
+++ branches/release/libs/range/doc/html/range/reference/synopsis.html 2010-04-23 18:50:56 EDT (Fri, 23 Apr 2010)
@@ -3,7 +3,7 @@
<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
<title>Synopsis</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="../reference.html" title="Reference">
<link rel="prev" href="overview.html" title="Overview">
Modified: branches/release/libs/range/doc/html/range/style_guide.html
==============================================================================
--- branches/release/libs/range/doc/html/range/style_guide.html (original)
+++ branches/release/libs/range/doc/html/range/style_guide.html 2010-04-23 18:50:56 EDT (Fri, 23 Apr 2010)
@@ -3,7 +3,7 @@
<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
<title>Terminology and style guidelines</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="../index.html" title="Chapter 1. Range 2.0">
<link rel="prev" href="utilities/join.html" title="Function join">
Modified: branches/release/libs/range/doc/html/range/upgrade.html
==============================================================================
--- branches/release/libs/range/doc/html/range/upgrade.html (original)
+++ branches/release/libs/range/doc/html/range/upgrade.html 2010-04-23 18:50:56 EDT (Fri, 23 Apr 2010)
@@ -3,7 +3,7 @@
<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
<title>Upgrade version of Boost.Range</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="../index.html" title="Chapter 1. Range 2.0">
<link rel="prev" href="mfc_atl/references.html" title="References">
Modified: branches/release/libs/range/doc/html/range/upgrade/upgrade_from_1_34.html
==============================================================================
--- branches/release/libs/range/doc/html/range/upgrade/upgrade_from_1_34.html (original)
+++ branches/release/libs/range/doc/html/range/upgrade/upgrade_from_1_34.html 2010-04-23 18:50:56 EDT (Fri, 23 Apr 2010)
@@ -3,7 +3,7 @@
<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
<title>Upgrade from version 1.34</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="../upgrade.html" title="Upgrade version of Boost.Range">
<link rel="prev" href="upgrade_from_1_42.html" title="Upgrade from version 1.42">
Modified: branches/release/libs/range/doc/html/range/upgrade/upgrade_from_1_42.html
==============================================================================
--- branches/release/libs/range/doc/html/range/upgrade/upgrade_from_1_42.html (original)
+++ branches/release/libs/range/doc/html/range/upgrade/upgrade_from_1_42.html 2010-04-23 18:50:56 EDT (Fri, 23 Apr 2010)
@@ -3,7 +3,7 @@
<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
<title>Upgrade from version 1.42</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="../upgrade.html" title="Upgrade version of Boost.Range">
<link rel="prev" href="../upgrade.html" title="Upgrade version of Boost.Range">
Modified: branches/release/libs/range/doc/html/range/utilities.html
==============================================================================
--- branches/release/libs/range/doc/html/range/utilities.html (original)
+++ branches/release/libs/range/doc/html/range/utilities.html 2010-04-23 18:50:56 EDT (Fri, 23 Apr 2010)
@@ -3,7 +3,7 @@
<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
<title>Utilities</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="../index.html" title="Chapter 1. Range 2.0">
<link rel="prev" href="reference/extending/method_3/method_3_2.html" title="Method 3.2: Implement a Range Adaptor with arguments">
Modified: branches/release/libs/range/doc/html/range/utilities/iterator_range.html
==============================================================================
--- branches/release/libs/range/doc/html/range/utilities/iterator_range.html (original)
+++ branches/release/libs/range/doc/html/range/utilities/iterator_range.html 2010-04-23 18:50:56 EDT (Fri, 23 Apr 2010)
@@ -3,7 +3,7 @@
<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
<title>Class iterator_range</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="../utilities.html" title="Utilities">
<link rel="prev" href="../utilities.html" title="Utilities">
@@ -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="id730216"></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="id733421"></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="id733661"></a>
+<a name="id3123073"></a>
<a class="link" href="iterator_range.html#range.utilities.iterator_range.details_functions">Details
functions</a>
</h5>
Modified: branches/release/libs/range/doc/html/range/utilities/join.html
==============================================================================
--- branches/release/libs/range/doc/html/range/utilities/join.html (original)
+++ branches/release/libs/range/doc/html/range/utilities/join.html 2010-04-23 18:50:56 EDT (Fri, 23 Apr 2010)
@@ -3,7 +3,7 @@
<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
<title>Function join</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="../utilities.html" title="Utilities">
<link rel="prev" href="sub_range.html" title="Class sub_range">
@@ -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="id736071"></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="id736614"></a>
+<a name="id3126057"></a>
<a class="link" href="join.html#range.utilities.join.example">Example</a>
</h5>
<p>
Modified: branches/release/libs/range/doc/html/range/utilities/sub_range.html
==============================================================================
--- branches/release/libs/range/doc/html/range/utilities/sub_range.html (original)
+++ branches/release/libs/range/doc/html/range/utilities/sub_range.html 2010-04-23 18:50:56 EDT (Fri, 23 Apr 2010)
@@ -3,7 +3,7 @@
<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
<title>Class sub_range</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="../utilities.html" title="Utilities">
<link rel="prev" href="iterator_range.html" title="Class iterator_range">
@@ -35,7 +35,7 @@
is.
</p>
<a name="range.utilities.sub_range.synopsis"></a><h5>
-<a name="id734808"></a>
+<a name="id3124232"></a>
<a class="link" href="sub_range.html#range.utilities.sub_range.synopsis">Synopsis</a>
</h5>
<p>
Modified: branches/release/libs/range/doc/reference/algorithm/fill.qbk
==============================================================================
--- branches/release/libs/range/doc/reference/algorithm/fill.qbk (original)
+++ branches/release/libs/range/doc/reference/algorithm/fill.qbk 2010-04-23 18:50:56 EDT (Fri, 23 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]
Modified: branches/release/libs/range/doc/reference/algorithm/make_heap.qbk
==============================================================================
--- branches/release/libs/range/doc/reference/algorithm/make_heap.qbk (original)
+++ branches/release/libs/range/doc/reference/algorithm/make_heap.qbk 2010-04-23 18:50:56 EDT (Fri, 23 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: branches/release/libs/range/doc/reference/algorithm/next_permutation.qbk
==============================================================================
--- branches/release/libs/range/doc/reference/algorithm/next_permutation.qbk (original)
+++ branches/release/libs/range/doc/reference/algorithm/next_permutation.qbk 2010-04-23 18:50:56 EDT (Fri, 23 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: branches/release/libs/range/doc/reference/algorithm/nth_element.qbk
==============================================================================
--- branches/release/libs/range/doc/reference/algorithm/nth_element.qbk (original)
+++ branches/release/libs/range/doc/reference/algorithm/nth_element.qbk 2010-04-23 18:50:56 EDT (Fri, 23 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: branches/release/libs/range/doc/reference/algorithm/partial_sort.qbk
==============================================================================
--- branches/release/libs/range/doc/reference/algorithm/partial_sort.qbk (original)
+++ branches/release/libs/range/doc/reference/algorithm/partial_sort.qbk 2010-04-23 18:50:56 EDT (Fri, 23 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: branches/release/libs/range/doc/reference/algorithm/pop_heap.qbk
==============================================================================
--- branches/release/libs/range/doc/reference/algorithm/pop_heap.qbk (original)
+++ branches/release/libs/range/doc/reference/algorithm/pop_heap.qbk 2010-04-23 18:50:56 EDT (Fri, 23 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: branches/release/libs/range/doc/reference/algorithm/prev_permutation.qbk
==============================================================================
--- branches/release/libs/range/doc/reference/algorithm/prev_permutation.qbk (original)
+++ branches/release/libs/range/doc/reference/algorithm/prev_permutation.qbk 2010-04-23 18:50:56 EDT (Fri, 23 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: branches/release/libs/range/doc/reference/algorithm/push_heap.qbk
==============================================================================
--- branches/release/libs/range/doc/reference/algorithm/push_heap.qbk (original)
+++ branches/release/libs/range/doc/reference/algorithm/push_heap.qbk 2010-04-23 18:50:56 EDT (Fri, 23 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: branches/release/libs/range/doc/reference/algorithm/sort_heap.qbk
==============================================================================
--- branches/release/libs/range/doc/reference/algorithm/sort_heap.qbk (original)
+++ branches/release/libs/range/doc/reference/algorithm/sort_heap.qbk 2010-04-23 18:50:56 EDT (Fri, 23 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: branches/release/libs/range/doc/reference/algorithm_ext/erase.qbk
==============================================================================
--- branches/release/libs/range/doc/reference/algorithm_ext/erase.qbk (original)
+++ branches/release/libs/range/doc/reference/algorithm_ext/erase.qbk 2010-04-23 18:50:56 EDT (Fri, 23 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: branches/release/libs/range/doc/reference/algorithm_ext/insert.qbk
==============================================================================
--- branches/release/libs/range/doc/reference/algorithm_ext/insert.qbk (original)
+++ branches/release/libs/range/doc/reference/algorithm_ext/insert.qbk 2010-04-23 18:50:56 EDT (Fri, 23 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: branches/release/libs/range/doc/reference/algorithm_ext/iota.qbk
==============================================================================
--- branches/release/libs/range/doc/reference/algorithm_ext/iota.qbk (original)
+++ branches/release/libs/range/doc/reference/algorithm_ext/iota.qbk 2010-04-23 18:50:56 EDT (Fri, 23 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: branches/release/libs/range/doc/reference/algorithm_ext/push_back.qbk
==============================================================================
--- branches/release/libs/range/doc/reference/algorithm_ext/push_back.qbk (original)
+++ branches/release/libs/range/doc/reference/algorithm_ext/push_back.qbk 2010-04-23 18:50:56 EDT (Fri, 23 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: branches/release/libs/range/doc/reference/algorithm_ext/push_front.qbk
==============================================================================
--- branches/release/libs/range/doc/reference/algorithm_ext/push_front.qbk (original)
+++ branches/release/libs/range/doc/reference/algorithm_ext/push_front.qbk 2010-04-23 18:50:56 EDT (Fri, 23 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: branches/release/libs/range/doc/reference/algorithm_ext/remove_erase.qbk
==============================================================================
--- branches/release/libs/range/doc/reference/algorithm_ext/remove_erase.qbk (original)
+++ branches/release/libs/range/doc/reference/algorithm_ext/remove_erase.qbk 2010-04-23 18:50:56 EDT (Fri, 23 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: branches/release/libs/range/doc/reference/algorithm_ext/remove_erase_if.qbk
==============================================================================
--- branches/release/libs/range/doc/reference/algorithm_ext/remove_erase_if.qbk (original)
+++ branches/release/libs/range/doc/reference/algorithm_ext/remove_erase_if.qbk 2010-04-23 18:50:56 EDT (Fri, 23 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: branches/release/libs/range/doc/reference/algorithms.qbk
==============================================================================
--- branches/release/libs/range/doc/reference/algorithms.qbk (original)
+++ branches/release/libs/range/doc/reference/algorithms.qbk 2010-04-23 18:50:56 EDT (Fri, 23 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]
Modified: branches/release/libs/range/test/Jamfile.v2
==============================================================================
--- branches/release/libs/range/test/Jamfile.v2 (original)
+++ branches/release/libs/range/test/Jamfile.v2 2010-04-23 18:50:56 EDT (Fri, 23 Apr 2010)
@@ -42,6 +42,7 @@
[ range-test adaptor_test/reversed ]
[ range-test adaptor_test/sliced ]
[ range-test adaptor_test/strided ]
+ [ range-test adaptor_test/strided2 ]
[ range-test adaptor_test/tokenized ]
[ range-test adaptor_test/transformed ]
[ range-test adaptor_test/uniqued ]
@@ -128,11 +129,13 @@
[ range-test counting_range ]
[ range-test extension_mechanism ]
[ range-test irange ]
+ [ range-test istream_range ]
[ range-test iterator_pair ]
[ range-test iterator_range ]
# [ range-test mfc : <include>$(VC71_ROOT)/atlmfc/include ]
[ range-test join ]
[ range-test partial_workaround ]
+ [ range-test pointer_as_iterator ]
[ range-test reversible_range ]
[ range-test std_container ]
[ range-test string ]
Modified: branches/release/libs/range/test/adaptor_test/adjacent_filtered_example.cpp
==============================================================================
--- branches/release/libs/range/test/adaptor_test/adjacent_filtered_example.cpp (original)
+++ branches/release/libs/range/test/adaptor_test/adjacent_filtered_example.cpp 2010-04-23 18:50:56 EDT (Fri, 23 Apr 2010)
@@ -55,4 +55,4 @@
test->add( BOOST_TEST_CASE( &adjacent_filtered_example_test ) );
return test;
-}
\ No newline at end of file
+}
Modified: branches/release/libs/range/test/adaptor_test/copied_example.cpp
==============================================================================
--- branches/release/libs/range/test/adaptor_test/copied_example.cpp (original)
+++ branches/release/libs/range/test/adaptor_test/copied_example.cpp 2010-04-23 18:50:56 EDT (Fri, 23 Apr 2010)
@@ -55,4 +55,4 @@
test->add( BOOST_TEST_CASE( &copied_example_test ) );
return test;
-}
\ No newline at end of file
+}
Modified: branches/release/libs/range/test/algorithm_ext_test/push_front.cpp
==============================================================================
--- branches/release/libs/range/test/algorithm_ext_test/push_front.cpp (original)
+++ branches/release/libs/range/test/algorithm_ext_test/push_front.cpp 2010-04-23 18:50:56 EDT (Fri, 23 Apr 2010)
@@ -21,6 +21,15 @@
namespace
{
+ struct DoubleValue
+ {
+ template< class Value >
+ Value operator()(Value x)
+ {
+ return x * 2;
+ }
+ };
+
template< class Container >
void test_push_front_impl(std::size_t n)
{
@@ -34,10 +43,14 @@
BOOST_CHECK_EQUAL_COLLECTIONS( reference.begin(), reference.end(),
test.begin(), test.end() );
+ // copy the orignal reference sequence
+ Container reference_copy(reference);
+ std::transform(reference.begin(), reference.end(), reference.begin(), DoubleValue());
+
// Do it again to push onto non-empty container
- reference.insert(reference.begin(), reference.begin(), reference.end());
+ reference.insert(reference.end(), reference_copy.begin(), reference_copy.end());
- boost::push_front(test, boost::irange<std::size_t>(0, n));
+ boost::push_front(test, boost::irange<std::size_t>(0, n * 2, 2));
BOOST_CHECK_EQUAL_COLLECTIONS( reference.begin(), reference.end(),
test.begin(), test.end() );
Modified: branches/release/libs/range/test/algorithm_test/find.cpp
==============================================================================
--- branches/release/libs/range/test/algorithm_test/find.cpp (original)
+++ branches/release/libs/range/test/algorithm_test/find.cpp 2010-04-23 18:50:56 EDT (Fri, 23 Apr 2010)
@@ -36,16 +36,16 @@
return boost::find(cont, 3);
}
- template<range_return_value return_type>
- struct test_range
- {
- template<class Container, class Policy>
- BOOST_DEDUCED_TYPENAME range_return<Container,return_type>::type
- operator()(Policy&, Container& cont)
- {
- return boost::find<return_type>(cont, 3);
- }
- };
+ template<range_return_value return_type>
+ struct test_range
+ {
+ template<class Container, class Policy>
+ BOOST_DEDUCED_TYPENAME range_return<Container,return_type>::type
+ operator()(Policy&, Container& cont)
+ {
+ return boost::find<return_type>(cont, 3);
+ }
+ };
template<class Container>
BOOST_DEDUCED_TYPENAME range_iterator<Container>::type
Modified: branches/release/libs/range/test/algorithm_test/find_end.cpp
==============================================================================
--- branches/release/libs/range/test/algorithm_test/find_end.cpp (original)
+++ branches/release/libs/range/test/algorithm_test/find_end.cpp 2010-04-23 18:50:56 EDT (Fri, 23 Apr 2010)
@@ -35,7 +35,7 @@
{
}
- container2_t cont() { return m_cont; }
+ container2_t cont() { return m_cont; }
template<class Container>
BOOST_DEDUCED_TYPENAME range_iterator<Container>::type
@@ -45,14 +45,14 @@
}
template<range_return_value return_type>
- struct test_range
- {
- template<class Container, class Policy>
- BOOST_DEDUCED_TYPENAME range_return<Container,return_type>::type
- operator()(Policy& policy, Container& cont)
- {
- return boost::find_end<return_type>(cont, policy.cont());
- }
+ struct test_range
+ {
+ template<class Container, class Policy>
+ BOOST_DEDUCED_TYPENAME range_return<Container,return_type>::type
+ operator()(Policy& policy, Container& cont)
+ {
+ return boost::find_end<return_type>(cont, policy.cont());
+ }
};
template<class Container>
@@ -77,8 +77,8 @@
{
}
- container2_t& cont() { return m_cont; }
- BinaryPredicate& pred() { return m_pred; }
+ container2_t& cont() { return m_cont; }
+ BinaryPredicate& pred() { return m_pred; }
template<class Container>
BOOST_DEDUCED_TYPENAME range_iterator<Container>::type
@@ -88,14 +88,14 @@
}
template<range_return_value return_type>
- struct test_range
- {
- template<class Container, class Policy>
- BOOST_DEDUCED_TYPENAME range_return<Container,return_type>::type
- operator()(Policy& policy, Container& cont)
- {
- return boost::find_end<return_type>(cont, policy.cont(), policy.pred());
- }
+ struct test_range
+ {
+ template<class Container, class Policy>
+ BOOST_DEDUCED_TYPENAME range_return<Container,return_type>::type
+ operator()(Policy& policy, Container& cont)
+ {
+ return boost::find_end<return_type>(cont, policy.cont(), policy.pred());
+ }
};
template<class Container>
Modified: branches/release/libs/range/test/algorithm_test/find_first_of.cpp
==============================================================================
--- branches/release/libs/range/test/algorithm_test/find_first_of.cpp (original)
+++ branches/release/libs/range/test/algorithm_test/find_first_of.cpp 2010-04-23 18:50:56 EDT (Fri, 23 Apr 2010)
@@ -35,7 +35,7 @@
{
}
- container2_t& cont() { return m_cont; }
+ container2_t& cont() { return m_cont; }
template<class Container>
BOOST_DEDUCED_TYPENAME range_iterator<Container>::type
@@ -45,14 +45,14 @@
}
template<range_return_value return_type>
- struct test_range
- {
- template<class Container, class Policy>
- BOOST_DEDUCED_TYPENAME range_return<Container,return_type>::type
- operator()(Policy& policy, Container& cont)
- {
- return boost::find_first_of<return_type>(cont, policy.cont());
- }
+ struct test_range
+ {
+ template<class Container, class Policy>
+ BOOST_DEDUCED_TYPENAME range_return<Container,return_type>::type
+ operator()(Policy& policy, Container& cont)
+ {
+ return boost::find_first_of<return_type>(cont, policy.cont());
+ }
};
template<class Container>
@@ -77,8 +77,8 @@
{
}
- container2_t& cont() { return m_cont; }
- BinaryPredicate& pred() { return m_pred; }
+ container2_t& cont() { return m_cont; }
+ BinaryPredicate& pred() { return m_pred; }
template<class Container>
BOOST_DEDUCED_TYPENAME range_iterator<Container>::type
@@ -88,14 +88,14 @@
}
template<range_return_value return_type>
- struct test_range
- {
- template<class Container, class Policy>
- BOOST_DEDUCED_TYPENAME range_return<Container,return_type>::type
- operator()(Policy& policy, Container& cont)
- {
- return boost::find_first_of<return_type>(cont, policy.cont(), policy.pred());
- }
+ struct test_range
+ {
+ template<class Container, class Policy>
+ BOOST_DEDUCED_TYPENAME range_return<Container,return_type>::type
+ operator()(Policy& policy, Container& cont)
+ {
+ return boost::find_first_of<return_type>(cont, policy.cont(), policy.pred());
+ }
};
template<class Container>
Modified: branches/release/libs/range/test/algorithm_test/find_if.cpp
==============================================================================
--- branches/release/libs/range/test/algorithm_test/find_if.cpp (original)
+++ branches/release/libs/range/test/algorithm_test/find_if.cpp 2010-04-23 18:50:56 EDT (Fri, 23 Apr 2010)
@@ -41,15 +41,15 @@
return boost::find_if(cont, m_pred);
}
- template<range_return_value return_type>
- struct test_range
- {
- template<class Container>
- BOOST_DEDUCED_TYPENAME range_return<Container,return_type>::type
- operator()(find_if_test_policy& policy, Container& cont)
- {
- return boost::find_if<return_type>(cont, policy.pred());
- }
+ template<range_return_value return_type>
+ struct test_range
+ {
+ template<class Container>
+ BOOST_DEDUCED_TYPENAME range_return<Container,return_type>::type
+ operator()(find_if_test_policy& policy, Container& cont)
+ {
+ return boost::find_if<return_type>(cont, policy.pred());
+ }
};
template<class Container>
@@ -59,7 +59,7 @@
return std::find_if(cont.begin(), cont.end(), m_pred);
}
- UnaryPredicate& pred() { return m_pred; }
+ UnaryPredicate& pred() { return m_pred; }
private:
UnaryPredicate m_pred;
Modified: branches/release/libs/range/test/algorithm_test/for_each.cpp
==============================================================================
--- branches/release/libs/range/test/algorithm_test/for_each.cpp (original)
+++ branches/release/libs/range/test/algorithm_test/for_each.cpp 2010-04-23 18:50:56 EDT (Fri, 23 Apr 2010)
@@ -83,4 +83,4 @@
test->add( BOOST_TEST_CASE( &boost::test_for_each ) );
return test;
-}
\ No newline at end of file
+}
Modified: branches/release/libs/range/test/algorithm_test/lower_bound.cpp
==============================================================================
--- branches/release/libs/range/test/algorithm_test/lower_bound.cpp (original)
+++ branches/release/libs/range/test/algorithm_test/lower_bound.cpp 2010-04-23 18:50:56 EDT (Fri, 23 Apr 2010)
@@ -36,16 +36,16 @@
return boost::lower_bound(cont, 5);
}
- template<range_return_value return_type>
- struct test_range
- {
- template<class Container, class Policy>
- BOOST_DEDUCED_TYPENAME range_return<Container,return_type>::type
- operator()(Policy&, Container& cont)
- {
- return boost::lower_bound<return_type>(cont, 5);
- }
- };
+ template<range_return_value return_type>
+ struct test_range
+ {
+ template<class Container, class Policy>
+ BOOST_DEDUCED_TYPENAME range_return<Container,return_type>::type
+ operator()(Policy&, Container& cont)
+ {
+ return boost::lower_bound<return_type>(cont, 5);
+ }
+ };
template< class Container >
BOOST_DEDUCED_TYPENAME range_iterator<Container>::type
@@ -66,15 +66,15 @@
}
template< range_return_value return_type >
- struct test_range
- {
- template<class Container, class Policy>
- BOOST_DEDUCED_TYPENAME range_return<Container,return_type>::type
- operator()(Policy& policy, Container& cont)
- {
- return boost::lower_bound<return_type>(
- cont, 5, policy.pred());
- }
+ struct test_range
+ {
+ template<class Container, class Policy>
+ BOOST_DEDUCED_TYPENAME range_return<Container,return_type>::type
+ operator()(Policy& policy, Container& cont)
+ {
+ return boost::lower_bound<return_type>(
+ cont, 5, policy.pred());
+ }
};
template<class Container>
@@ -85,10 +85,10 @@
cont.begin(), cont.end(), 5, m_pred);
}
- BinaryPredicate& pred() { return m_pred; }
+ BinaryPredicate& pred() { return m_pred; }
- private:
- BinaryPredicate m_pred;
+ private:
+ BinaryPredicate m_pred;
};
template<class Container,
Modified: branches/release/libs/range/test/algorithm_test/max_element.cpp
==============================================================================
--- branches/release/libs/range/test/algorithm_test/max_element.cpp (original)
+++ branches/release/libs/range/test/algorithm_test/max_element.cpp 2010-04-23 18:50:56 EDT (Fri, 23 Apr 2010)
@@ -37,14 +37,14 @@
}
template<range_return_value return_type>
- struct test_range
- {
- template<class Container, class Policy>
- BOOST_DEDUCED_TYPENAME range_return<Container,return_type>::type
- operator()(Policy&, Container& cont)
- {
- return boost::max_element<return_type>(cont);
- }
+ struct test_range
+ {
+ template<class Container, class Policy>
+ BOOST_DEDUCED_TYPENAME range_return<Container,return_type>::type
+ operator()(Policy&, Container& cont)
+ {
+ return boost::max_element<return_type>(cont);
+ }
};
template< class Container >
@@ -66,17 +66,17 @@
return boost::max_element(cont, Pred());
}
- Pred pred() const { return Pred(); }
+ Pred pred() const { return Pred(); }
template< range_return_value return_type >
- struct test_range
- {
- template< class Container, class Policy >
- BOOST_DEDUCED_TYPENAME range_return<Container,return_type>::type
- operator()(Policy& policy, Container& cont)
- {
- return boost::max_element<return_type>(cont, policy.pred());
- }
+ struct test_range
+ {
+ template< class Container, class Policy >
+ BOOST_DEDUCED_TYPENAME range_return<Container,return_type>::type
+ operator()(Policy& policy, Container& cont)
+ {
+ return boost::max_element<return_type>(cont, policy.pred());
+ }
};
template< class Container >
Modified: branches/release/libs/range/test/algorithm_test/min_element.cpp
==============================================================================
--- branches/release/libs/range/test/algorithm_test/min_element.cpp (original)
+++ branches/release/libs/range/test/algorithm_test/min_element.cpp 2010-04-23 18:50:56 EDT (Fri, 23 Apr 2010)
@@ -37,14 +37,14 @@
}
template< range_return_value return_type >
- struct test_range
- {
- template< class Container, class Policy >
- BOOST_DEDUCED_TYPENAME range_return<Container,return_type>::type
- operator()(Policy&, Container& cont)
- {
- return boost::min_element<return_type>(cont);
- }
+ struct test_range
+ {
+ template< class Container, class Policy >
+ BOOST_DEDUCED_TYPENAME range_return<Container,return_type>::type
+ operator()(Policy&, Container& cont)
+ {
+ return boost::min_element<return_type>(cont);
+ }
};
template< class Container >
@@ -66,17 +66,17 @@
return boost::min_element(cont, Pred());
}
- Pred pred() const { return Pred(); }
+ Pred pred() const { return Pred(); }
template< range_return_value return_type >
- struct test_range
- {
- template< class Container, class Policy >
- BOOST_DEDUCED_TYPENAME range_return<Container,return_type>::type
- operator()(Policy& policy, Container& cont)
- {
- return boost::min_element<return_type>(cont, policy.pred());
- }
+ struct test_range
+ {
+ template< class Container, class Policy >
+ BOOST_DEDUCED_TYPENAME range_return<Container,return_type>::type
+ operator()(Policy& policy, Container& cont)
+ {
+ return boost::min_element<return_type>(cont, policy.pred());
+ }
};
template< class Container >
Modified: branches/release/libs/range/test/algorithm_test/partition.cpp
==============================================================================
--- branches/release/libs/range/test/algorithm_test/partition.cpp (original)
+++ branches/release/libs/range/test/algorithm_test/partition.cpp 2010-04-23 18:50:56 EDT (Fri, 23 Apr 2010)
@@ -44,17 +44,17 @@
return boost::partition(cont, UnaryPredicate());
}
- UnaryPredicate pred() const { return UnaryPredicate(); }
+ UnaryPredicate pred() const { return UnaryPredicate(); }
template< range_return_value return_type >
- struct test_range
- {
- template< class Container, class Policy >
- BOOST_DEDUCED_TYPENAME range_return<Container,return_type>::type
- operator()(Policy& policy, Container& cont)
- {
- return boost::partition<return_type>(cont, policy.pred());
- }
+ struct test_range
+ {
+ template< class Container, class Policy >
+ BOOST_DEDUCED_TYPENAME range_return<Container,return_type>::type
+ operator()(Policy& policy, Container& cont)
+ {
+ return boost::partition<return_type>(cont, policy.pred());
+ }
};
template< class Container >
Modified: branches/release/libs/range/test/algorithm_test/stable_partition.cpp
==============================================================================
--- branches/release/libs/range/test/algorithm_test/stable_partition.cpp (original)
+++ branches/release/libs/range/test/algorithm_test/stable_partition.cpp 2010-04-23 18:50:56 EDT (Fri, 23 Apr 2010)
@@ -44,17 +44,17 @@
return boost::stable_partition(cont, UnaryPredicate());
}
- UnaryPredicate pred() const { return UnaryPredicate(); }
+ UnaryPredicate pred() const { return UnaryPredicate(); }
template< range_return_value return_type >
- struct test_range
- {
- template< class Container, class Policy >
- BOOST_DEDUCED_TYPENAME range_return<Container,return_type>::type
- operator()(Policy& policy, Container& cont)
- {
- return boost::stable_partition<return_type>(cont, policy.pred());
- }
+ struct test_range
+ {
+ template< class Container, class Policy >
+ BOOST_DEDUCED_TYPENAME range_return<Container,return_type>::type
+ operator()(Policy& policy, Container& cont)
+ {
+ return boost::stable_partition<return_type>(cont, policy.pred());
+ }
};
template< class Container >
Modified: branches/release/libs/range/test/algorithm_test/unique.cpp
==============================================================================
--- branches/release/libs/range/test/algorithm_test/unique.cpp (original)
+++ branches/release/libs/range/test/algorithm_test/unique.cpp 2010-04-23 18:50:56 EDT (Fri, 23 Apr 2010)
@@ -41,14 +41,14 @@
}
template< range_return_value return_type >
- struct test_range
- {
- template< class Container, class Policy >
- BOOST_DEDUCED_TYPENAME range_return<Container,return_type>::type
- operator()(Policy&, Container& cont)
- {
- return boost::unique<return_type>(cont);
- }
+ struct test_range
+ {
+ template< class Container, class Policy >
+ BOOST_DEDUCED_TYPENAME range_return<Container,return_type>::type
+ operator()(Policy&, Container& cont)
+ {
+ return boost::unique<return_type>(cont);
+ }
};
template< class Container >
@@ -73,17 +73,17 @@
return std::unique(cont.begin(), cont.end(), Pred());
}
- Pred pred() const { return Pred(); }
+ Pred pred() const { return Pred(); }
template< range_return_value return_type >
- struct test_range
- {
- template< class Container, class Policy >
- BOOST_DEDUCED_TYPENAME range_return<Container,return_type>::type
- operator()(Policy& policy, Container& cont)
- {
- return boost::unique<return_type>(cont, policy.pred());
- }
+ struct test_range
+ {
+ template< class Container, class Policy >
+ BOOST_DEDUCED_TYPENAME range_return<Container,return_type>::type
+ operator()(Policy& policy, Container& cont)
+ {
+ return boost::unique<return_type>(cont, policy.pred());
+ }
};
template< class Container >
Modified: branches/release/libs/range/test/algorithm_test/upper_bound.cpp
==============================================================================
--- branches/release/libs/range/test/algorithm_test/upper_bound.cpp (original)
+++ branches/release/libs/range/test/algorithm_test/upper_bound.cpp 2010-04-23 18:50:56 EDT (Fri, 23 Apr 2010)
@@ -35,16 +35,16 @@
return boost::upper_bound(cont, 5);
}
- template<range_return_value result_type>
- struct test_range
- {
- template<class Container, class Policy>
- BOOST_DEDUCED_TYPENAME range_return<Container,result_type>::type
- operator()(Policy&, Container& cont)
- {
- return boost::upper_bound<result_type>(cont, 5);
- }
- };
+ template<range_return_value result_type>
+ struct test_range
+ {
+ template<class Container, class Policy>
+ BOOST_DEDUCED_TYPENAME range_return<Container,result_type>::type
+ operator()(Policy&, Container& cont)
+ {
+ return boost::upper_bound<result_type>(cont, 5);
+ }
+ };
template< class Container >
BOOST_DEDUCED_TYPENAME range_iterator<Container>::type
@@ -65,15 +65,15 @@
}
template< range_return_value result_type>
- struct test_range
- {
- template< class Container, class Policy >
- BOOST_DEDUCED_TYPENAME range_return<Container,result_type>::type
- operator()(Policy& policy, Container& cont)
- {
- return boost::upper_bound<result_type>(
- cont, 5, policy.pred());
- }
+ struct test_range
+ {
+ template< class Container, class Policy >
+ BOOST_DEDUCED_TYPENAME range_return<Container,result_type>::type
+ operator()(Policy& policy, Container& cont)
+ {
+ return boost::upper_bound<result_type>(
+ cont, 5, policy.pred());
+ }
};
template<class Container>
@@ -83,11 +83,11 @@
return std::upper_bound(
cont.begin(), cont.end(), 5, BinaryPredicate());
}
-
- BinaryPredicate& pred() { return m_pred; }
-
- private:
- BinaryPredicate m_pred;
+
+ BinaryPredicate& pred() { return m_pred; }
+
+ private:
+ BinaryPredicate m_pred;
};
template<class Container,
Modified: branches/release/libs/range/test/counting_range.cpp
==============================================================================
--- branches/release/libs/range/test/counting_range.cpp (original)
+++ branches/release/libs/range/test/counting_range.cpp 2010-04-23 18:50:56 EDT (Fri, 23 Apr 2010)
@@ -70,4 +70,4 @@
test->add( BOOST_TEST_CASE( &boost::counting_range_test ) );
return test;
-}
\ No newline at end of file
+}
Modified: branches/release/libs/range/test/iterator_range.cpp
==============================================================================
--- branches/release/libs/range/test/iterator_range.cpp (original)
+++ branches/release/libs/range/test/iterator_range.cpp 2010-04-23 18:50:56 EDT (Fri, 23 Apr 2010)
@@ -61,7 +61,7 @@
BOOST_CHECK_EQUAL( r2.size(), size( r2 ) );
BOOST_CHECK_EQUAL( std::distance( r.begin(), r.end() ),
- std::distance( boost::begin( r2 ), boost::end( r2 ) ) );
+ std::distance( boost::begin( r2 ), boost::end( r2 ) ) );
std::cout << r << r2;
Modified: branches/release/libs/range/test/test_driver/range_return_test_driver.hpp
==============================================================================
--- branches/release/libs/range/test/test_driver/range_return_test_driver.hpp (original)
+++ branches/release/libs/range/test/test_driver/range_return_test_driver.hpp 2010-04-23 18:50:56 EDT (Fri, 23 Apr 2010)
@@ -379,25 +379,25 @@
range_result, reference_it);
}
- template< range_return_value result_type, class Container, class TestPolicy >
- struct test_range
- {
- void operator()(Container& cont, TestPolicy policy)
- {
- typedef BOOST_DEDUCED_TYPENAME range_iterator<Container>::type iterator_t;
- typedef BOOST_DEDUCED_TYPENAME range_return<Container, result_type>::type range_return_t;
- typedef BOOST_DEDUCED_TYPENAME TestPolicy::template test_range<result_type> test_range_t;
+ template< range_return_value result_type, class Container, class TestPolicy >
+ struct test_range
+ {
+ void operator()(Container& cont, TestPolicy policy)
+ {
+ typedef BOOST_DEDUCED_TYPENAME range_iterator<Container>::type iterator_t;
+ typedef BOOST_DEDUCED_TYPENAME range_return<Container, result_type>::type range_return_t;
+ typedef BOOST_DEDUCED_TYPENAME TestPolicy::template test_range<result_type> test_range_t;
- Container reference(cont);
- Container test_cont(cont);
+ Container reference(cont);
+ Container test_cont(cont);
- range_return_t range_result = test_range_t()(policy, test_cont);
- iterator_t reference_it = policy.reference(reference);
+ range_return_t range_result = test_range_t()(policy, test_cont);
+ iterator_t reference_it = policy.reference(reference);
- check_results<result_type>::check(test_cont, reference,
+ check_results<result_type>::check(test_cont, reference,
range_result, reference_it);
- }
- };
+ }
+ };
};
}
}
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