|
|
Boost-Commit : |
Subject: [Boost-commit] svn:boost r67454 - in branches/release: boost/range boost/range/adaptor boost/range/algorithm 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/headers 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/reference libs/range/doc/html/range/reference/algorithms libs/range/doc/html/range/reference/algorithms/heap libs/range/doc/html/range/reference/algorithms/mutating libs/range/doc/html/range/reference/algorithms/new libs/range/doc/html/range/reference/algorithms/non_mutating libs/range/doc/html/range/reference/algorithms/numeric libs/range/doc/html/range/reference/algorithms/permutation libs/range/doc/html/range/reference/algorithms/set libs/range/doc/html/range/reference/concept_implementation libs/range/doc/html/range/reference/concept_implementation/semantics 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/utilities libs/range/doc/html/range/upgrade libs/range/doc/reference libs/range/doc/reference/adaptors libs/range/doc/reference/adaptors/examples libs/range/doc/reference/algorithm libs/range/doc/reference/algorithm_ext libs/range/doc/reference/numeric libs/range/doc/reference/ranges libs/range/test libs/range/test/adaptor_test libs/range/test/algorithm_test libs/range/test/test_driver
From: neil_at_[hidden]
Date: 2010-12-26 10:14:11
Author: neilgroves
Date: 2010-12-26 10:13:43 EST (Sun, 26 Dec 2010)
New Revision: 67454
URL: http://svn.boost.org/trac/boost/changeset/67454
Log:
[boost][range] - merge from trunk which fixes a defect in the strided range adaptor, and contains improvements to the documentation
Added:
branches/release/boost/range/adaptor/type_erased.hpp
- copied unchanged from r67452, /trunk/boost/range/adaptor/type_erased.hpp
branches/release/boost/range/has_range_iterator.hpp
- copied unchanged from r67452, /trunk/boost/range/has_range_iterator.hpp
branches/release/libs/range/doc/html/range/headers/
- copied from r67452, /trunk/libs/range/doc/html/range/headers/
branches/release/libs/range/doc/html/range/headers.html
- copied unchanged from r67452, /trunk/libs/range/doc/html/range/headers.html
branches/release/libs/range/doc/html/range/headers/adaptors.html
- copied unchanged from r67452, /trunk/libs/range/doc/html/range/headers/adaptors.html
branches/release/libs/range/doc/html/range/headers/algorithm.html
- copied unchanged from r67452, /trunk/libs/range/doc/html/range/headers/algorithm.html
branches/release/libs/range/doc/html/range/headers/algorithm_ext.html
- copied unchanged from r67452, /trunk/libs/range/doc/html/range/headers/algorithm_ext.html
branches/release/libs/range/doc/html/range/headers/general.html
- copied unchanged from r67452, /trunk/libs/range/doc/html/range/headers/general.html
branches/release/libs/range/doc/html/range/reference/algorithms/introduction.html
- copied unchanged from r67452, /trunk/libs/range/doc/html/range/reference/algorithms/introduction.html
branches/release/libs/range/doc/html/range/upgrade/upgrade_from_1_45.html
- copied unchanged from r67452, /trunk/libs/range/doc/html/range/upgrade/upgrade_from_1_45.html
branches/release/libs/range/test/extension_size.cpp
- copied unchanged from r67452, /trunk/libs/range/test/extension_size.cpp
branches/release/libs/range/test/has_range_iterator.cpp
- copied unchanged from r67452, /trunk/libs/range/test/has_range_iterator.cpp
Removed:
branches/release/libs/range/doc/style.css
branches/release/libs/range/test/replace_copy.cpp
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 | 34 ++--
branches/release/boost/range/adaptor/define_adaptor.hpp | 10 +
branches/release/boost/range/adaptor/filtered.hpp | 22 +-
branches/release/boost/range/adaptor/indirected.hpp | 22 +-
branches/release/boost/range/adaptor/map.hpp | 39 +++---
branches/release/boost/range/adaptor/replaced_if.hpp | 22 +-
branches/release/boost/range/adaptor/reversed.hpp | 22 +-
branches/release/boost/range/adaptor/sliced.hpp | 82 +++++++-------
branches/release/boost/range/adaptor/strided.hpp | 155 +++++++++++++++++++-------
branches/release/boost/range/adaptor/tokenized.hpp | 22 +-
branches/release/boost/range/adaptor/transformed.hpp | 61 +++++-----
branches/release/boost/range/adaptor/uniqued.hpp | 24 ++--
branches/release/boost/range/algorithm/search_n.hpp | 231 ++++++++++++++++++++++++++++++++++++++-
branches/release/boost/range/algorithm/transform.hpp | 2
branches/release/boost/range/combine.hpp | 8 +
branches/release/boost/range/concepts.hpp | 22 +++
branches/release/boost/range/counting_range.hpp | 12 -
branches/release/boost/range/istream_range.hpp | 12 -
branches/release/boost/range/iterator_range_core.hpp | 16 ++
branches/release/boost/range/metafunctions.hpp | 1
branches/release/boost/range/size.hpp | 45 ++++++
branches/release/libs/range/doc/concepts.qbk | 6
branches/release/libs/range/doc/examples.qbk | 7 +
branches/release/libs/range/doc/faq.qbk | 7 +
branches/release/libs/range/doc/headers.qbk | 15 +
branches/release/libs/range/doc/history_ack.qbk | 6
branches/release/libs/range/doc/html/index.html | 101 ++++++++--------
branches/release/libs/range/doc/html/quickbook_HTML.manifest | 13 +-
branches/release/libs/range/doc/html/range/concepts.html | 2
branches/release/libs/range/doc/html/range/concepts/bidirectional_range.html | 16 +-
branches/release/libs/range/doc/html/range/concepts/concept_checking.html | 2
branches/release/libs/range/doc/html/range/concepts/forward_range.html | 10
branches/release/libs/range/doc/html/range/concepts/random_access_range.html | 12 +-
branches/release/libs/range/doc/html/range/concepts/single_pass_range.html | 16 +-
branches/release/libs/range/doc/html/range/examples.html | 6
branches/release/libs/range/doc/html/range/history_ack.html | 6
branches/release/libs/range/doc/html/range/introduction.html | 6
branches/release/libs/range/doc/html/range/mfc_atl.html | 16 +-
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 | 16 +-
branches/release/libs/range/doc/html/range/reference.html | 56 ++++----
branches/release/libs/range/doc/html/range/reference/adaptors.html | 8
branches/release/libs/range/doc/html/range/reference/adaptors/general_requirements.html | 2
branches/release/libs/range/doc/html/range/reference/adaptors/introduction.html | 8
branches/release/libs/range/doc/html/range/reference/adaptors/reference.html | 35 ++---
branches/release/libs/range/doc/html/range/reference/adaptors/reference/adjacent_filtered.html | 14 +-
branches/release/libs/range/doc/html/range/reference/adaptors/reference/copied.html | 10
branches/release/libs/range/doc/html/range/reference/adaptors/reference/filtered.html | 13 +
branches/release/libs/range/doc/html/range/reference/adaptors/reference/indexed.html | 13 +
branches/release/libs/range/doc/html/range/reference/adaptors/reference/indirected.html | 13 +
branches/release/libs/range/doc/html/range/reference/adaptors/reference/map_keys.html | 13 +
branches/release/libs/range/doc/html/range/reference/adaptors/reference/map_values.html | 15 +
branches/release/libs/range/doc/html/range/reference/adaptors/reference/replaced.html | 37 +++--
branches/release/libs/range/doc/html/range/reference/adaptors/reference/replaced_if.html | 36 +++--
branches/release/libs/range/doc/html/range/reference/adaptors/reference/reversed.html | 13 +
branches/release/libs/range/doc/html/range/reference/adaptors/reference/sliced.html | 13 +
branches/release/libs/range/doc/html/range/reference/adaptors/reference/strided.html | 24 ++--
branches/release/libs/range/doc/html/range/reference/adaptors/reference/tokenized.html | 49 ++++---
branches/release/libs/range/doc/html/range/reference/adaptors/reference/transformed.html | 14 +-
branches/release/libs/range/doc/html/range/reference/adaptors/reference/uniqued.html | 15 +-
branches/release/libs/range/doc/html/range/reference/algorithms.html | 28 ++--
branches/release/libs/range/doc/html/range/reference/algorithms/heap.html | 12 +-
branches/release/libs/range/doc/html/range/reference/algorithms/heap/make_heap.html | 12 +-
branches/release/libs/range/doc/html/range/reference/algorithms/heap/pop_heap.html | 14 +-
branches/release/libs/range/doc/html/range/reference/algorithms/heap/push_heap.html | 14 +-
branches/release/libs/range/doc/html/range/reference/algorithms/heap/sort_heap.html | 14 +-
branches/release/libs/range/doc/html/range/reference/algorithms/mutating.html | 86 ++++++--------
branches/release/libs/range/doc/html/range/reference/algorithms/mutating/copy.html | 14 +-
branches/release/libs/range/doc/html/range/reference/algorithms/mutating/copy_backward.html | 15 +-
branches/release/libs/range/doc/html/range/reference/algorithms/mutating/fill.html | 12 +-
branches/release/libs/range/doc/html/range/reference/algorithms/mutating/fill_n.html | 12 +-
branches/release/libs/range/doc/html/range/reference/algorithms/mutating/generate.html | 14 +-
branches/release/libs/range/doc/html/range/reference/algorithms/mutating/inplace_merge.html | 19 +-
branches/release/libs/range/doc/html/range/reference/algorithms/mutating/merge.html | 18 +-
branches/release/libs/range/doc/html/range/reference/algorithms/mutating/nth_element.html | 13 +-
branches/release/libs/range/doc/html/range/reference/algorithms/mutating/partial_sort.html | 13 +-
branches/release/libs/range/doc/html/range/reference/algorithms/mutating/partition.html | 12 +-
branches/release/libs/range/doc/html/range/reference/algorithms/mutating/random_shuffle.html | 15 +-
branches/release/libs/range/doc/html/range/reference/algorithms/mutating/remove.html | 12 +-
branches/release/libs/range/doc/html/range/reference/algorithms/mutating/remove_copy.html | 13 +-
branches/release/libs/range/doc/html/range/reference/algorithms/mutating/remove_copy_if.html | 13 +-
branches/release/libs/range/doc/html/range/reference/algorithms/mutating/remove_if.html | 12 +-
branches/release/libs/range/doc/html/range/reference/algorithms/mutating/replace.html | 12 +-
branches/release/libs/range/doc/html/range/reference/algorithms/mutating/replace_copy.html | 13 +-
branches/release/libs/range/doc/html/range/reference/algorithms/mutating/replace_copy_if.html | 13 +-
branches/release/libs/range/doc/html/range/reference/algorithms/mutating/replace_if.html | 13 +-
branches/release/libs/range/doc/html/range/reference/algorithms/mutating/reverse.html | 12 +-
branches/release/libs/range/doc/html/range/reference/algorithms/mutating/reverse_copy.html | 13 +-
branches/release/libs/range/doc/html/range/reference/algorithms/mutating/rotate.html | 14 +-
branches/release/libs/range/doc/html/range/reference/algorithms/mutating/rotate_copy.html | 15 +-
branches/release/libs/range/doc/html/range/reference/algorithms/mutating/sort.html | 12 +-
branches/release/libs/range/doc/html/range/reference/algorithms/mutating/stable_partition.html | 13 +-
branches/release/libs/range/doc/html/range/reference/algorithms/mutating/stable_sort.html | 13 +-
branches/release/libs/range/doc/html/range/reference/algorithms/mutating/swap_ranges.html | 13 +-
branches/release/libs/range/doc/html/range/reference/algorithms/mutating/transform.html | 14 +-
branches/release/libs/range/doc/html/range/reference/algorithms/mutating/unique.html | 12 +-
branches/release/libs/range/doc/html/range/reference/algorithms/mutating/unique_copy.html | 13 +-
branches/release/libs/range/doc/html/range/reference/algorithms/new.html | 27 ++--
branches/release/libs/range/doc/html/range/reference/algorithms/new/copy_n.html | 12 +-
branches/release/libs/range/doc/html/range/reference/algorithms/new/erase.html | 12 +-
branches/release/libs/range/doc/html/range/reference/algorithms/new/for_each.html | 12 +-
branches/release/libs/range/doc/html/range/reference/algorithms/new/insert.html | 12 +-
branches/release/libs/range/doc/html/range/reference/algorithms/new/iota.html | 12 +-
branches/release/libs/range/doc/html/range/reference/algorithms/new/is_sorted.html | 12 +-
branches/release/libs/range/doc/html/range/reference/algorithms/new/overwrite.html | 12 +-
branches/release/libs/range/doc/html/range/reference/algorithms/new/push_back.html | 12 +-
branches/release/libs/range/doc/html/range/reference/algorithms/new/push_front.html | 12 +-
branches/release/libs/range/doc/html/range/reference/algorithms/new/remove_erase.html | 12 +-
branches/release/libs/range/doc/html/range/reference/algorithms/new/remove_erase_if.html | 13 +-
branches/release/libs/range/doc/html/range/reference/algorithms/non_mutating.html | 58 +++------
branches/release/libs/range/doc/html/range/reference/algorithms/non_mutating/adjacent_find.html | 13 +-
branches/release/libs/range/doc/html/range/reference/algorithms/non_mutating/binary_search.html | 15 +-
branches/release/libs/range/doc/html/range/reference/algorithms/non_mutating/count.html | 12 +-
branches/release/libs/range/doc/html/range/reference/algorithms/non_mutating/count_if.html | 13 +-
branches/release/libs/range/doc/html/range/reference/algorithms/non_mutating/equal.html | 12 +-
branches/release/libs/range/doc/html/range/reference/algorithms/non_mutating/equal_range.html | 15 +-
branches/release/libs/range/doc/html/range/reference/algorithms/non_mutating/find.html | 12 +-
branches/release/libs/range/doc/html/range/reference/algorithms/non_mutating/find_end.html | 13 +-
branches/release/libs/range/doc/html/range/reference/algorithms/non_mutating/find_first_of.html | 13 +-
branches/release/libs/range/doc/html/range/reference/algorithms/non_mutating/find_if.html | 15 +-
branches/release/libs/range/doc/html/range/reference/algorithms/non_mutating/for_each.html | 13 +-
branches/release/libs/range/doc/html/range/reference/algorithms/non_mutating/lexicographical_compare.html | 13 +-
branches/release/libs/range/doc/html/range/reference/algorithms/non_mutating/lower_bound.html | 15 +-
branches/release/libs/range/doc/html/range/reference/algorithms/non_mutating/max_element.html | 13 +-
branches/release/libs/range/doc/html/range/reference/algorithms/non_mutating/min_element.html | 13 +-
branches/release/libs/range/doc/html/range/reference/algorithms/non_mutating/mismatch.html | 15 +-
branches/release/libs/range/doc/html/range/reference/algorithms/non_mutating/search.html | 13 +-
branches/release/libs/range/doc/html/range/reference/algorithms/non_mutating/search_n.html | 13 +-
branches/release/libs/range/doc/html/range/reference/algorithms/non_mutating/upper_bound.html | 15 +-
branches/release/libs/range/doc/html/range/reference/algorithms/numeric.html | 15 +-
branches/release/libs/range/doc/html/range/reference/algorithms/numeric/accumulate.html | 16 +-
branches/release/libs/range/doc/html/range/reference/algorithms/numeric/adjacent_difference.html | 19 +-
branches/release/libs/range/doc/html/range/reference/algorithms/numeric/inner_product.html | 19 +-
branches/release/libs/range/doc/html/range/reference/algorithms/numeric/partial_sum.html | 19 +-
branches/release/libs/range/doc/html/range/reference/algorithms/permutation.html | 10 -
branches/release/libs/range/doc/html/range/reference/algorithms/permutation/next_permutation.html | 13 +-
branches/release/libs/range/doc/html/range/reference/algorithms/permutation/prev_permutation.html | 13 +-
branches/release/libs/range/doc/html/range/reference/algorithms/set.html | 16 +-
branches/release/libs/range/doc/html/range/reference/algorithms/set/includes.html | 14 +-
branches/release/libs/range/doc/html/range/reference/algorithms/set/set_difference.html | 14 +-
branches/release/libs/range/doc/html/range/reference/algorithms/set/set_intersection.html | 15 +-
branches/release/libs/range/doc/html/range/reference/algorithms/set/set_symmetric_difference.html | 15 +-
branches/release/libs/range/doc/html/range/reference/algorithms/set/set_union.html | 14 +-
branches/release/libs/range/doc/html/range/reference/concept_implementation.html | 2
branches/release/libs/range/doc/html/range/reference/concept_implementation/semantics.html | 2
branches/release/libs/range/doc/html/range/reference/concept_implementation/semantics/functions.html | 23 +++
branches/release/libs/range/doc/html/range/reference/concept_implementation/semantics/metafunctions.html | 38 ++++++
branches/release/libs/range/doc/html/range/reference/extending.html | 8
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 | 22 +++
branches/release/libs/range/doc/html/range/reference/extending/method_3.html | 6
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/ranges.html | 8
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/utilities.html | 8
branches/release/libs/range/doc/html/range/reference/utilities/iterator_range.html | 8
branches/release/libs/range/doc/html/range/reference/utilities/join.html | 71 +++++++++--
branches/release/libs/range/doc/html/range/reference/utilities/sub_range.html | 4
branches/release/libs/range/doc/html/range/style_guide.html | 54 ++++----
branches/release/libs/range/doc/html/range/upgrade.html | 14 +-
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 | 10
branches/release/libs/range/doc/introduction.qbk | 7 +
branches/release/libs/range/doc/mfc_atl.qbk | 5
branches/release/libs/range/doc/portability.qbk | 7 +
branches/release/libs/range/doc/reference.qbk | 5
branches/release/libs/range/doc/reference/adaptors.qbk | 5
branches/release/libs/range/doc/reference/adaptors/adjacent_filtered.qbk | 6 +
branches/release/libs/range/doc/reference/adaptors/copied.qbk | 5
branches/release/libs/range/doc/reference/adaptors/examples/adjacent_filtered.cpp | 9 +
branches/release/libs/range/doc/reference/adaptors/examples/copied.cpp | 9 +
branches/release/libs/range/doc/reference/adaptors/examples/filtered.cpp | 9 +
branches/release/libs/range/doc/reference/adaptors/examples/indexed.cpp | 9 +
branches/release/libs/range/doc/reference/adaptors/examples/indirected.cpp | 9 +
branches/release/libs/range/doc/reference/adaptors/examples/map_keys.cpp | 9 +
branches/release/libs/range/doc/reference/adaptors/examples/map_values.cpp | 9 +
branches/release/libs/range/doc/reference/adaptors/examples/replaced.cpp | 9 +
branches/release/libs/range/doc/reference/adaptors/examples/replaced_if.cpp | 9 +
branches/release/libs/range/doc/reference/adaptors/examples/reversed.cpp | 9 +
branches/release/libs/range/doc/reference/adaptors/examples/sliced.cpp | 9 +
branches/release/libs/range/doc/reference/adaptors/examples/strided.cpp | 9 +
branches/release/libs/range/doc/reference/adaptors/examples/tokenized.cpp | 9 +
branches/release/libs/range/doc/reference/adaptors/examples/transformed.cpp | 9 +
branches/release/libs/range/doc/reference/adaptors/examples/uniqued.cpp | 9 +
branches/release/libs/range/doc/reference/adaptors/filtered.qbk | 6 +
branches/release/libs/range/doc/reference/adaptors/indexed.qbk | 6 +
branches/release/libs/range/doc/reference/adaptors/indirected.qbk | 6 +
branches/release/libs/range/doc/reference/adaptors/map_keys.qbk | 6 +
branches/release/libs/range/doc/reference/adaptors/map_values.qbk | 6 +
branches/release/libs/range/doc/reference/adaptors/replaced.qbk | 6 +
branches/release/libs/range/doc/reference/adaptors/replaced_if.qbk | 6 +
branches/release/libs/range/doc/reference/adaptors/reversed.qbk | 6 +
branches/release/libs/range/doc/reference/adaptors/sliced.qbk | 6 +
branches/release/libs/range/doc/reference/adaptors/strided.qbk | 11 +
branches/release/libs/range/doc/reference/adaptors/tokenized.qbk | 6 +
branches/release/libs/range/doc/reference/adaptors/transformed.qbk | 6 +
branches/release/libs/range/doc/reference/adaptors/uniqued.qbk | 6 +
branches/release/libs/range/doc/reference/algorithm/adjacent_find.qbk | 5
branches/release/libs/range/doc/reference/algorithm/binary_search.qbk | 5
branches/release/libs/range/doc/reference/algorithm/copy.qbk | 5
branches/release/libs/range/doc/reference/algorithm/copy_backward.qbk | 5
branches/release/libs/range/doc/reference/algorithm/count.qbk | 5
branches/release/libs/range/doc/reference/algorithm/count_if.qbk | 5
branches/release/libs/range/doc/reference/algorithm/equal.qbk | 5
branches/release/libs/range/doc/reference/algorithm/equal_range.qbk | 5
branches/release/libs/range/doc/reference/algorithm/fill.qbk | 5
branches/release/libs/range/doc/reference/algorithm/fill_n.qbk | 5
branches/release/libs/range/doc/reference/algorithm/find.qbk | 5
branches/release/libs/range/doc/reference/algorithm/find_end.qbk | 5
branches/release/libs/range/doc/reference/algorithm/find_first_of.qbk | 5
branches/release/libs/range/doc/reference/algorithm/find_if.qbk | 5
branches/release/libs/range/doc/reference/algorithm/for_each.qbk | 5
branches/release/libs/range/doc/reference/algorithm/generate.qbk | 5
branches/release/libs/range/doc/reference/algorithm/includes.qbk | 5
branches/release/libs/range/doc/reference/algorithm/inplace_merge.qbk | 5
branches/release/libs/range/doc/reference/algorithm/lexicographical_compare.qbk | 5
branches/release/libs/range/doc/reference/algorithm/lower_bound.qbk | 5
branches/release/libs/range/doc/reference/algorithm/make_heap.qbk | 5
branches/release/libs/range/doc/reference/algorithm/max_element.qbk | 5
branches/release/libs/range/doc/reference/algorithm/merge.qbk | 5
branches/release/libs/range/doc/reference/algorithm/min_element.qbk | 5
branches/release/libs/range/doc/reference/algorithm/mismatch.qbk | 5
branches/release/libs/range/doc/reference/algorithm/next_permutation.qbk | 5
branches/release/libs/range/doc/reference/algorithm/nth_element.qbk | 5
branches/release/libs/range/doc/reference/algorithm/partial_sort.qbk | 5
branches/release/libs/range/doc/reference/algorithm/partition.qbk | 5
branches/release/libs/range/doc/reference/algorithm/pop_heap.qbk | 5
branches/release/libs/range/doc/reference/algorithm/prev_permutation.qbk | 5
branches/release/libs/range/doc/reference/algorithm/push_heap.qbk | 5
branches/release/libs/range/doc/reference/algorithm/random_shuffle.qbk | 5
branches/release/libs/range/doc/reference/algorithm/remove.qbk | 10 +
branches/release/libs/range/doc/reference/algorithm/remove_copy.qbk | 5
branches/release/libs/range/doc/reference/algorithm/remove_copy_if.qbk | 5
branches/release/libs/range/doc/reference/algorithm/remove_if.qbk | 5
branches/release/libs/range/doc/reference/algorithm/replace.qbk | 5
branches/release/libs/range/doc/reference/algorithm/replace_copy.qbk | 5
branches/release/libs/range/doc/reference/algorithm/replace_copy_if.qbk | 5
branches/release/libs/range/doc/reference/algorithm/replace_if.qbk | 5
branches/release/libs/range/doc/reference/algorithm/reverse.qbk | 5
branches/release/libs/range/doc/reference/algorithm/reverse_copy.qbk | 5
branches/release/libs/range/doc/reference/algorithm/rotate.qbk | 5
branches/release/libs/range/doc/reference/algorithm/rotate_copy.qbk | 5
branches/release/libs/range/doc/reference/algorithm/search.qbk | 5
branches/release/libs/range/doc/reference/algorithm/search_n.qbk | 5
branches/release/libs/range/doc/reference/algorithm/set_difference.qbk | 5
branches/release/libs/range/doc/reference/algorithm/set_intersection.qbk | 5
branches/release/libs/range/doc/reference/algorithm/set_symmetric_difference.qbk | 5
branches/release/libs/range/doc/reference/algorithm/set_union.qbk | 5
branches/release/libs/range/doc/reference/algorithm/sort.qbk | 5
branches/release/libs/range/doc/reference/algorithm/sort_heap.qbk | 5
branches/release/libs/range/doc/reference/algorithm/stable_partition.qbk | 5
branches/release/libs/range/doc/reference/algorithm/stable_sort.qbk | 5
branches/release/libs/range/doc/reference/algorithm/swap_ranges.qbk | 5
branches/release/libs/range/doc/reference/algorithm/transform.qbk | 5
branches/release/libs/range/doc/reference/algorithm/unique.qbk | 5
branches/release/libs/range/doc/reference/algorithm/unique_copy.qbk | 5
branches/release/libs/range/doc/reference/algorithm/upper_bound.qbk | 5
branches/release/libs/range/doc/reference/algorithm_ext/copy_n.qbk | 5
branches/release/libs/range/doc/reference/algorithm_ext/erase.qbk | 5
branches/release/libs/range/doc/reference/algorithm_ext/for_each.qbk | 5
branches/release/libs/range/doc/reference/algorithm_ext/insert.qbk | 5
branches/release/libs/range/doc/reference/algorithm_ext/iota.qbk | 5
branches/release/libs/range/doc/reference/algorithm_ext/is_sorted.qbk | 5
branches/release/libs/range/doc/reference/algorithm_ext/overwrite.qbk | 5
branches/release/libs/range/doc/reference/algorithm_ext/push_back.qbk | 5
branches/release/libs/range/doc/reference/algorithm_ext/push_front.qbk | 5
branches/release/libs/range/doc/reference/algorithm_ext/remove_erase.qbk | 5
branches/release/libs/range/doc/reference/algorithm_ext/remove_erase_if.qbk | 5
branches/release/libs/range/doc/reference/algorithms.qbk | 14 +-
branches/release/libs/range/doc/reference/extending.qbk | 6 +
branches/release/libs/range/doc/reference/numeric/accumulate.qbk | 5
branches/release/libs/range/doc/reference/numeric/adjacent_difference.qbk | 5
branches/release/libs/range/doc/reference/numeric/inner_product.qbk | 5
branches/release/libs/range/doc/reference/numeric/partial_sum.qbk | 5
branches/release/libs/range/doc/reference/overview.qbk | 7 +
branches/release/libs/range/doc/reference/ranges.qbk | 5
branches/release/libs/range/doc/reference/ranges/counting_range.qbk | 5
branches/release/libs/range/doc/reference/ranges/irange.qbk | 5
branches/release/libs/range/doc/reference/ranges/istream_range.qbk | 5
branches/release/libs/range/doc/reference/semantics.qbk | 19 ++
branches/release/libs/range/doc/reference/synopsis.qbk | 7 +
branches/release/libs/range/doc/reference/utilities.qbk | 33 +++-
branches/release/libs/range/doc/style.qbk | 5
branches/release/libs/range/doc/upgrade.qbk | 13 ++
branches/release/libs/range/index.html | 3
branches/release/libs/range/test/Jamfile.v2 | 2
branches/release/libs/range/test/adaptor_test/strided.cpp | 198 +++++++++++++++++++++++++++++++--
branches/release/libs/range/test/adaptors.cpp | 8
branches/release/libs/range/test/algorithm_test/count_if.cpp | 6
branches/release/libs/range/test/algorithm_test/search_n.cpp | 107 ++++++++++++++++++
branches/release/libs/range/test/string.cpp | 76 ++++++------
branches/release/libs/range/test/test_driver/range_return_test_driver.hpp | 30 ++--
299 files changed, 2886 insertions(+), 1428 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-12-26 10:13:43 EST (Sun, 26 Dec 2010)
@@ -116,7 +116,7 @@
};
template< class P, class R, bool default_pass >
- struct adjacent_filter_range
+ struct adjacent_filtered_range
: iterator_range< skip_iterator<
BOOST_DEDUCED_TYPENAME range_iterator<R>::type,
P,
@@ -138,7 +138,7 @@
typedef BOOST_DEDUCED_TYPENAME range_iterator<R>::type raw_iterator;
public:
- adjacent_filter_range( const P& p, R& r )
+ adjacent_filtered_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))
{
@@ -164,37 +164,37 @@
};
template< class ForwardRng, class BinPredicate >
- inline adjacent_filter_range<BinPredicate, ForwardRng, true>
+ inline adjacent_filtered_range<BinPredicate, ForwardRng, true>
operator|( ForwardRng& r,
const adjacent_holder<BinPredicate>& f )
{
- return adjacent_filter_range<BinPredicate, ForwardRng, true>( f.val, r );
+ return adjacent_filtered_range<BinPredicate, ForwardRng, true>( f.val, r );
}
template< class ForwardRng, class BinPredicate >
- inline adjacent_filter_range<BinPredicate, const ForwardRng, true>
+ inline adjacent_filtered_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 );
+ return adjacent_filtered_range<BinPredicate,
+ const ForwardRng, true>( f.val, r );
}
template< class ForwardRng, class BinPredicate >
- inline adjacent_filter_range<BinPredicate, ForwardRng, false>
+ inline adjacent_filtered_range<BinPredicate, ForwardRng, false>
operator|( ForwardRng& r,
const adjacent_excl_holder<BinPredicate>& f )
{
- return adjacent_filter_range<BinPredicate, ForwardRng, false>( f.val, r );
+ return adjacent_filtered_range<BinPredicate, ForwardRng, false>( f.val, r );
}
template< class ForwardRng, class BinPredicate >
- inline adjacent_filter_range<BinPredicate, ForwardRng, false>
+ inline adjacent_filtered_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 );
+ return adjacent_filtered_range<BinPredicate,
+ const ForwardRng, false>( f.val, r );
}
} // 'range_detail'
@@ -202,7 +202,7 @@
// 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;
+ using range_detail::adjacent_filtered_range;
namespace adaptors
{
@@ -218,17 +218,17 @@
}
template<class ForwardRng, class BinPredicate>
- inline adjacent_filter_range<BinPredicate, ForwardRng, true>
+ inline adjacent_filtered_range<BinPredicate, ForwardRng, true>
adjacent_filter(ForwardRng& rng, BinPredicate filter_pred)
{
- return adjacent_filter_range<BinPredicate, ForwardRng, true>(filter_pred, rng);
+ return adjacent_filtered_range<BinPredicate, ForwardRng, true>(filter_pred, rng);
}
template<class ForwardRng, class BinPredicate>
- inline adjacent_filter_range<BinPredicate, const ForwardRng, true>
+ inline adjacent_filtered_range<BinPredicate, const ForwardRng, true>
adjacent_filter(const ForwardRng& rng, BinPredicate filter_pred)
{
- return adjacent_filter_range<BinPredicate, const ForwardRng, true>(filter_pred, rng);
+ return adjacent_filtered_range<BinPredicate, const ForwardRng, true>(filter_pred, rng);
}
} // 'adaptors'
Modified: branches/release/boost/range/adaptor/define_adaptor.hpp
==============================================================================
--- branches/release/boost/range/adaptor/define_adaptor.hpp (original)
+++ branches/release/boost/range/adaptor/define_adaptor.hpp 2010-12-26 10:13:43 EST (Sun, 26 Dec 2010)
@@ -1,3 +1,13 @@
+// Boost.Range library
+//
+// Copyright Neil Groves 2010. Use, modification and
+// distribution is subject to 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)
+//
+// For more information, see http://www.boost.org/libs/range/
+//
+
#ifndef BOOST_RANGE_DEFINE_ADAPTOR_HPP_INCLUDED
#define BOOST_RANGE_DEFINE_ADAPTOR_HPP_INCLUDED
Modified: branches/release/boost/range/adaptor/filtered.hpp
==============================================================================
--- branches/release/boost/range/adaptor/filtered.hpp (original)
+++ branches/release/boost/range/adaptor/filtered.hpp 2010-12-26 10:13:43 EST (Sun, 26 Dec 2010)
@@ -20,7 +20,7 @@
namespace range_detail
{
template< class P, class R >
- struct filter_range :
+ struct filtered_range :
boost::iterator_range<
boost::filter_iterator< P,
BOOST_DEDUCED_TYPENAME range_iterator<R>::type
@@ -34,7 +34,7 @@
>
> base;
public:
- filter_range( P p, R& r )
+ filtered_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) ) )
{ }
@@ -48,19 +48,19 @@
};
template< class InputRng, class Predicate >
- inline filter_range<Predicate, InputRng>
+ inline filtered_range<Predicate, InputRng>
operator|( InputRng& r,
const filter_holder<Predicate>& f )
{
- return filter_range<Predicate, InputRng>( f.val, r );
+ return filtered_range<Predicate, InputRng>( f.val, r );
}
template< class InputRng, class Predicate >
- inline filter_range<Predicate, const InputRng>
+ inline filtered_range<Predicate, const InputRng>
operator|( const InputRng& r,
const filter_holder<Predicate>& f )
{
- return filter_range<Predicate, const InputRng>( f.val, r );
+ return filtered_range<Predicate, const InputRng>( f.val, r );
}
} // 'range_detail'
@@ -70,7 +70,7 @@
// 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;
+ using range_detail::filtered_range;
namespace adaptors
{
@@ -82,17 +82,17 @@
}
template<class InputRange, class Predicate>
- inline filter_range<Predicate, InputRange>
+ inline filtered_range<Predicate, InputRange>
filter(InputRange& rng, Predicate filter_pred)
{
- return range_detail::filter_range<Predicate, InputRange>( filter_pred, rng );
+ return range_detail::filtered_range<Predicate, InputRange>( filter_pred, rng );
}
template<class InputRange, class Predicate>
- inline filter_range<Predicate, const InputRange>
+ inline filtered_range<Predicate, const InputRange>
filter(const InputRange& rng, Predicate filter_pred)
{
- return range_detail::filter_range<Predicate, const InputRange>( filter_pred, rng );
+ return range_detail::filtered_range<Predicate, const InputRange>( filter_pred, rng );
}
} // '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-12-26 10:13:43 EST (Sun, 26 Dec 2010)
@@ -19,7 +19,7 @@
namespace range_detail
{
template< class R >
- struct indirect_range :
+ struct indirected_range :
public boost::iterator_range<
boost::indirect_iterator<
BOOST_DEDUCED_TYPENAME range_iterator<R>::type
@@ -35,7 +35,7 @@
base;
public:
- explicit indirect_range( R& r )
+ explicit indirected_range( R& r )
: base( r )
{ }
};
@@ -43,22 +43,22 @@
struct indirect_forwarder {};
template< class InputRng >
- inline indirect_range<InputRng>
+ inline indirected_range<InputRng>
operator|( InputRng& r, indirect_forwarder )
{
- return indirect_range<InputRng>( r );
+ return indirected_range<InputRng>( r );
}
template< class InputRng >
- inline indirect_range<const InputRng>
+ inline indirected_range<const InputRng>
operator|( const InputRng& r, indirect_forwarder )
{
- return indirect_range<const InputRng>( r );
+ return indirected_range<const InputRng>( r );
}
} // 'range_detail'
- using range_detail::indirect_range;
+ using range_detail::indirected_range;
namespace adaptors
{
@@ -69,17 +69,17 @@
}
template<class InputRange>
- inline indirect_range<InputRange>
+ inline indirected_range<InputRange>
indirect(InputRange& rng)
{
- return indirect_range<InputRange>(rng);
+ return indirected_range<InputRange>(rng);
}
template<class InputRange>
- inline indirect_range<const InputRange>
+ inline indirected_range<const InputRange>
indirect(const InputRange& rng)
{
- return indirect_range<const InputRange>(rng);
+ return indirected_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-12-26 10:13:43 EST (Sun, 26 Dec 2010)
@@ -14,6 +14,7 @@
#include <boost/range/adaptor/transformed.hpp>
#include <boost/range/iterator_range.hpp>
#include <boost/range/value_type.hpp>
+#include <boost/range/reference.hpp>
namespace boost
{
@@ -25,11 +26,10 @@
template< class Map >
struct select_first
{
- typedef BOOST_DEDUCED_TYPENAME range_value<Map>::type pair_t;
- typedef const BOOST_DEDUCED_TYPENAME pair_t::first_type&
- result_type;
+ typedef BOOST_DEDUCED_TYPENAME range_reference<const Map>::type argument_type;
+ typedef const BOOST_DEDUCED_TYPENAME range_value<const Map>::type::first_type& result_type;
- result_type operator()( const pair_t& r ) const
+ result_type operator()( argument_type r ) const
{
return r.first;
}
@@ -38,10 +38,10 @@
template< class Map >
struct select_second_mutable
{
- typedef BOOST_DEDUCED_TYPENAME range_value<Map>::type pair_t;
- typedef BOOST_DEDUCED_TYPENAME pair_t::second_type& result_type;
+ typedef BOOST_DEDUCED_TYPENAME range_reference<Map>::type argument_type;
+ typedef BOOST_DEDUCED_TYPENAME range_value<Map>::type::second_type& result_type;
- result_type operator()( pair_t& r ) const
+ result_type operator()( argument_type r ) const
{
return r.second;
}
@@ -50,11 +50,10 @@
template< class Map >
struct select_second_const
{
- typedef BOOST_DEDUCED_TYPENAME range_value<Map>::type pair_t;
- typedef const BOOST_DEDUCED_TYPENAME pair_t::second_type&
- result_type;
+ typedef BOOST_DEDUCED_TYPENAME range_reference<const Map>::type argument_type;
+ typedef const BOOST_DEDUCED_TYPENAME range_value<const Map>::type::second_type& result_type;
- result_type operator()( const pair_t& r ) const
+ result_type operator()( argument_type r ) const
{
return r.second;
}
@@ -62,11 +61,11 @@
template<class StdPairRng>
class select_first_range
- : public transform_range<
+ : public transformed_range<
select_first<StdPairRng>,
const StdPairRng>
{
- typedef transform_range<select_first<StdPairRng>, const StdPairRng> base;
+ typedef transformed_range<select_first<StdPairRng>, const StdPairRng> base;
public:
typedef select_first<StdPairRng> transform_fn_type;
typedef const StdPairRng source_range_type;
@@ -81,11 +80,11 @@
template<class StdPairRng>
class select_second_mutable_range
- : public transform_range<
+ : public transformed_range<
select_second_mutable<StdPairRng>,
StdPairRng>
{
- typedef transform_range<select_second_mutable<StdPairRng>, StdPairRng> base;
+ typedef transformed_range<select_second_mutable<StdPairRng>, StdPairRng> base;
public:
typedef select_second_mutable<StdPairRng> transform_fn_type;
typedef StdPairRng source_range_type;
@@ -100,11 +99,11 @@
template<class StdPairRng>
class select_second_const_range
- : public transform_range<
+ : public transformed_range<
select_second_const<StdPairRng>,
const StdPairRng>
{
- typedef transform_range<select_second_const<StdPairRng>, const StdPairRng> base;
+ typedef transformed_range<select_second_const<StdPairRng>, const StdPairRng> base;
public:
typedef select_second_const<StdPairRng> transform_fn_type;
typedef const StdPairRng source_range_type;
@@ -122,7 +121,7 @@
operator|( const StdPairRng& r, map_keys_forwarder )
{
return operator|( r,
- boost::adaptors::transformed( select_first<StdPairRng>() ) );
+ boost::adaptors::transformed( select_first<StdPairRng>() ) );
}
template< class StdPairRng >
@@ -130,7 +129,7 @@
operator|( StdPairRng& r, map_values_forwarder )
{
return operator|( r,
- boost::adaptors::transformed( select_second_mutable<StdPairRng>() ) );
+ boost::adaptors::transformed( select_second_mutable<StdPairRng>() ) );
}
template< class StdPairRng >
@@ -138,7 +137,7 @@
operator|( const StdPairRng& r, map_values_forwarder )
{
return operator|( r,
- boost::adaptors::transformed( select_second_const<StdPairRng>() ) );
+ boost::adaptors::transformed( select_second_const<StdPairRng>() ) );
}
} // 'range_detail'
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-12-26 10:13:43 EST (Sun, 26 Dec 2010)
@@ -47,7 +47,7 @@
};
template< class Pred, class R >
- class replace_if_range :
+ class replaced_if_range :
public boost::iterator_range<
boost::transform_iterator<
replace_value_if< Pred, BOOST_DEDUCED_TYPENAME range_value<R>::type >,
@@ -64,7 +64,7 @@
public:
typedef BOOST_DEDUCED_TYPENAME range_value<R>::type value_type;
- replace_if_range( R& r, const Pred& pred, value_type to )
+ replaced_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) ) )
{ }
@@ -87,23 +87,23 @@
};
template< class Pred, class InputRng >
- inline replace_if_range<Pred, InputRng>
+ inline replaced_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());
+ return replaced_if_range<Pred, InputRng>(r, f.pred(), f.to());
}
template< class Pred, class InputRng >
- inline replace_if_range<Pred, const InputRng>
+ inline replaced_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());
+ return replaced_if_range<Pred, const InputRng>(r, f.pred(), f.to());
}
} // 'range_detail'
- using range_detail::replace_if_range;
+ using range_detail::replaced_if_range;
namespace adaptors
{
@@ -115,19 +115,19 @@
}
template<class Pred, class InputRange>
- inline replace_if_range<Pred, InputRange>
+ inline replaced_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);
+ return range_detail::replaced_if_range<Pred, InputRange>(rng, pred, to);
}
template<class Pred, class InputRange>
- inline replace_if_range<Pred, const InputRange>
+ inline replaced_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);
+ return range_detail::replaced_if_range<Pred, const InputRange>(rng, pred, to);
}
} // 'adaptors'
Modified: branches/release/boost/range/adaptor/reversed.hpp
==============================================================================
--- branches/release/boost/range/adaptor/reversed.hpp (original)
+++ branches/release/boost/range/adaptor/reversed.hpp 2010-12-26 10:13:43 EST (Sun, 26 Dec 2010)
@@ -19,7 +19,7 @@
namespace range_detail
{
template< class R >
- struct reverse_range :
+ struct reversed_range :
public boost::iterator_range<
boost::reverse_iterator<
BOOST_DEDUCED_TYPENAME range_iterator<R>::type
@@ -37,7 +37,7 @@
public:
typedef boost::reverse_iterator<BOOST_DEDUCED_TYPENAME range_iterator<R>::type> iterator;
- reverse_range( R& r )
+ explicit reversed_range( R& r )
: base( iterator(boost::end(r)), iterator(boost::begin(r)) )
{ }
};
@@ -45,22 +45,22 @@
struct reverse_forwarder {};
template< class BidirectionalRng >
- inline reverse_range<BidirectionalRng>
+ inline reversed_range<BidirectionalRng>
operator|( BidirectionalRng& r, reverse_forwarder )
{
- return reverse_range<BidirectionalRng>( r );
+ return reversed_range<BidirectionalRng>( r );
}
template< class BidirectionalRng >
- inline reverse_range<const BidirectionalRng>
+ inline reversed_range<const BidirectionalRng>
operator|( const BidirectionalRng& r, reverse_forwarder )
{
- return reverse_range<const BidirectionalRng>( r );
+ return reversed_range<const BidirectionalRng>( r );
}
} // 'range_detail'
- using range_detail::reverse_range;
+ using range_detail::reversed_range;
namespace adaptors
{
@@ -71,17 +71,17 @@
}
template<class BidirectionalRange>
- inline reverse_range<BidirectionalRange>
+ inline reversed_range<BidirectionalRange>
reverse(BidirectionalRange& rng)
{
- return reverse_range<BidirectionalRange>(rng);
+ return reversed_range<BidirectionalRange>(rng);
}
template<class BidirectionalRange>
- inline reverse_range<const BidirectionalRange>
+ inline reversed_range<const BidirectionalRange>
reverse(const BidirectionalRange& rng)
{
- return reverse_range<const BidirectionalRange>(rng);
+ return reversed_range<const BidirectionalRange>(rng);
}
} // 'adaptors'
Modified: branches/release/boost/range/adaptor/sliced.hpp
==============================================================================
--- branches/release/boost/range/adaptor/sliced.hpp (original)
+++ branches/release/boost/range/adaptor/sliced.hpp 2010-12-26 10:13:43 EST (Sun, 26 Dec 2010)
@@ -27,53 +27,53 @@
std::size_t u;
};
- template< class RandomAccessRange >
- class sliced_range : public boost::iterator_range< BOOST_DEDUCED_TYPENAME range_iterator<RandomAccessRange>::type >
- {
- typedef boost::iterator_range< BOOST_DEDUCED_TYPENAME range_iterator<RandomAccessRange>::type > base_t;
- public:
- template<typename Rng, typename T, typename U>
- sliced_range(Rng& rng, T t, U u)
- : base_t(boost::make_iterator_range(rng, t, u - boost::size(rng)))
- {
- }
- };
-
- template< class RandomAccessRange >
- inline sliced_range<RandomAccessRange>
- slice( RandomAccessRange& rng, std::size_t t, std::size_t u )
- {
- BOOST_ASSERT( t <= u && "error in slice indices" );
+ template< class RandomAccessRange >
+ class sliced_range : public boost::iterator_range< BOOST_DEDUCED_TYPENAME range_iterator<RandomAccessRange>::type >
+ {
+ typedef boost::iterator_range< BOOST_DEDUCED_TYPENAME range_iterator<RandomAccessRange>::type > base_t;
+ public:
+ template<typename Rng, typename T, typename U>
+ sliced_range(Rng& rng, T t, U u)
+ : base_t(boost::make_iterator_range(rng, t, u - boost::size(rng)))
+ {
+ }
+ };
+
+ template< class RandomAccessRange >
+ inline sliced_range<RandomAccessRange>
+ slice( RandomAccessRange& rng, std::size_t t, std::size_t u )
+ {
+ BOOST_ASSERT( t <= u && "error in slice indices" );
BOOST_ASSERT( static_cast<std::size_t>(boost::size(rng)) >= u &&
- "second slice index out of bounds" );
+ "second slice index out of bounds" );
- return sliced_range<RandomAccessRange>(rng, t, u);
- }
+ return sliced_range<RandomAccessRange>(rng, t, u);
+ }
- template< class RandomAccessRange >
- inline iterator_range< BOOST_DEDUCED_TYPENAME range_iterator<const RandomAccessRange>::type >
- slice( const RandomAccessRange& rng, std::size_t t, std::size_t u )
- {
- BOOST_ASSERT( t <= u && "error in slice indices" );
- BOOST_ASSERT( static_cast<std::size_t>(boost::size(rng)) >= u &&
- "second slice index out of bounds" );
+ template< class RandomAccessRange >
+ inline iterator_range< BOOST_DEDUCED_TYPENAME range_iterator<const RandomAccessRange>::type >
+ slice( const RandomAccessRange& rng, std::size_t t, std::size_t u )
+ {
+ BOOST_ASSERT( t <= u && "error in slice indices" );
+ BOOST_ASSERT( static_cast<std::size_t>(boost::size(rng)) >= u &&
+ "second slice index out of bounds" );
return sliced_range<const RandomAccessRange>(rng, t, u);
- }
+ }
- template< class RandomAccessRange >
- inline sliced_range<RandomAccessRange>
- operator|( RandomAccessRange& r, const sliced& f )
- {
- return sliced_range<RandomAccessRange>( r, f.t, f.u );
- }
-
- template< class RandomAccessRange >
- inline sliced_range<const RandomAccessRange>
- operator|( const RandomAccessRange& r, const sliced& f )
- {
- return sliced_range<const RandomAccessRange>( r, f.t, f.u );
- }
+ template< class RandomAccessRange >
+ inline sliced_range<RandomAccessRange>
+ operator|( RandomAccessRange& r, const sliced& f )
+ {
+ return sliced_range<RandomAccessRange>( r, f.t, f.u );
+ }
+
+ template< class RandomAccessRange >
+ inline sliced_range<const RandomAccessRange>
+ operator|( const RandomAccessRange& r, const sliced& f )
+ {
+ return sliced_range<const RandomAccessRange>( r, f.t, f.u );
+ }
} // namespace adaptors
} // namespace boost
Modified: branches/release/boost/range/adaptor/strided.hpp
==============================================================================
--- branches/release/boost/range/adaptor/strided.hpp (original)
+++ branches/release/boost/range/adaptor/strided.hpp 2010-12-26 10:13:43 EST (Sun, 26 Dec 2010)
@@ -16,68 +16,119 @@
#include <boost/iterator/iterator_adaptor.hpp>
#include <iterator>
+#include <iostream>
+
namespace boost
{
namespace range_detail
{
- template<typename BaseIterator>
+ template<class BaseIterator>
class strided_iterator
: public iterator_adaptor<
- strided_iterator<BaseIterator>,
- BaseIterator>
+ 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) { }
-
+ typedef BOOST_DEDUCED_TYPENAME std::iterator_traits<BaseIterator>::difference_type difference_type;
+
+ strided_iterator()
+ : m_stride(), m_offset(), m_max_offset()
+ {
+ }
+
+ explicit strided_iterator(BaseIterator base_it,
+ difference_type stride,
+ difference_type offset,
+ difference_type max_offset)
+ : super_t(base_it)
+ , m_stride(stride)
+ , m_offset(offset)
+ , m_max_offset(max_offset)
+ {
+ }
+
+ template<class OtherIterator>
+ strided_iterator(const strided_iterator<OtherIterator>& other,
+ BOOST_DEDUCED_TYPENAME enable_if_convertible<OtherIterator, BaseIterator>::type* = 0)
+ : super_t(other)
+ , m_stride(other.m_stride)
+ , m_offset(other.m_offset)
+ , m_max_offset(other.m_max_offset)
+ {
+ }
+
strided_iterator&
operator=(const strided_iterator& other)
{
super_t::operator=(other);
-
- // Is the interoperation of the stride safe?
m_stride = other.m_stride;
+ m_offset = other.m_offset;
+ m_max_offset = other.m_max_offset;
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); }
-
+
+ void increment()
+ {
+ m_offset += m_stride;
+ if (m_offset <= m_max_offset)
+ std::advance(this->base_reference(), m_stride);
+ }
+
+ void decrement()
+ {
+ m_offset -= m_stride;
+ if (m_offset >= 0)
+ std::advance(this->base_reference(), -m_stride);
+ }
+
+ void advance(difference_type n)
+ {
+ n *= m_stride;
+ m_offset += n;
+
+ if (m_offset >= 0 && m_offset <= m_max_offset)
+ std::advance(this->base_reference(), n);
+ }
+
+ template<class OtherIterator>
+ bool equal(const strided_iterator<OtherIterator>& other,
+ BOOST_DEDUCED_TYPENAME enable_if_convertible<OtherIterator, BaseIterator>::type* = 0) const
+ {
+ return m_offset == other.m_offset;
+ }
+
difference_type
distance_to(const strided_iterator& other) const
{
- return std::distance(this->base_reference(), other.base_reference()) / m_stride;
+ return (other.m_offset - m_offset) / m_stride;
}
- // Using the compiler generated copy constructor and
- // and assignment operator
-
private:
difference_type m_stride;
+ difference_type m_offset;
+ difference_type m_max_offset;
};
-
- template<class BaseIterator> inline
+
+ template<class BaseIterator, class Difference> 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);
+ Difference stride,
+ typename std::iterator_traits<BaseIterator>::difference_type offset,
+ typename std::iterator_traits<BaseIterator>::difference_type max_offset
+ )
+ {
+ BOOST_ASSERT( stride >= 0 );
+ BOOST_ASSERT( (stride == 0) || (offset % stride == 0) );
+ BOOST_ASSERT( (stride == 0) || (max_offset % stride == 0) );
+ BOOST_ASSERT( offset <= max_offset );
+ return strided_iterator<BaseIterator>(first, stride, offset, max_offset);
}
template< class Rng >
@@ -87,11 +138,33 @@
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 >
+ template<class Difference>
strided_range(Difference stride, Rng& rng)
- : super_t(make_strided_iterator(boost::begin(rng), stride),
- make_strided_iterator(boost::end(rng), stride))
+ : super_t(make_super(stride, rng))
+ {
+ BOOST_ASSERT( stride >= 0 );
+ }
+
+ private:
+ template<class Difference>
+ static super_t make_super(const Difference stride, Rng& rng)
+ {
+ const Difference count = boost::size(rng);
+ const Difference max_count = max_offset(count, stride);
+ return super_t(make_strided_iterator(boost::begin(rng), stride, 0, max_count),
+ make_strided_iterator(boost::end(rng), stride, max_count, max_count));
+ }
+
+ template<class Difference, class Stride>
+ static Difference max_offset(Difference sz, const Stride stride)
{
+ if (stride > 0)
+ {
+ sz += stride - 1;
+ sz /= stride;
+ sz *= stride;
+ }
+ return sz;
}
};
@@ -99,7 +172,7 @@
class strided_holder : public holder<Difference>
{
public:
- strided_holder(Difference value) : holder<Difference>(value) {}
+ explicit strided_holder(Difference value) : holder<Difference>(value) {}
};
template<class Rng, class Difference>
@@ -117,32 +190,32 @@
}
} // 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 'boost'
Modified: branches/release/boost/range/adaptor/tokenized.hpp
==============================================================================
--- branches/release/boost/range/adaptor/tokenized.hpp (original)
+++ branches/release/boost/range/adaptor/tokenized.hpp 2010-12-26 10:13:43 EST (Sun, 26 Dec 2010)
@@ -20,7 +20,7 @@
{
template< class R >
- struct token_range :
+ struct tokenized_range :
public boost::iterator_range<
boost::regex_token_iterator<
BOOST_DEDUCED_TYPENAME range_iterator<R>::type
@@ -42,7 +42,7 @@
public:
template< class Regex, class Submatch, class Flag >
- token_range( R& r, const Regex& re, const Submatch& sub, Flag f )
+ tokenized_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() )
@@ -90,24 +90,24 @@
};
template< class BidirectionalRng, class R, class S, class F >
- inline token_range<BidirectionalRng>
+ inline tokenized_range<BidirectionalRng>
operator|( BidirectionalRng& r,
const regex_holder<R,S,F>& f )
{
- return token_range<BidirectionalRng>( r, f.re, f.sub, f.f );
+ return tokenized_range<BidirectionalRng>( r, f.re, f.sub, f.f );
}
template< class BidirectionalRng, class R, class S, class F >
- inline token_range<const BidirectionalRng>
+ inline tokenized_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 );
+ return tokenized_range<const BidirectionalRng>( r, f.re, f.sub, f.f );
}
} // 'range_detail'
- using range_detail::token_range;
+ using range_detail::tokenized_range;
namespace adaptors
{
@@ -118,17 +118,17 @@
}
template<class BidirectionalRange, class Regex, class Submatch, class Flag>
- inline token_range<BidirectionalRange>
+ inline tokenized_range<BidirectionalRange>
tokenize(BidirectionalRange& rng, const Regex& reg, const Submatch& sub, Flag f)
{
- return token_range<BidirectionalRange>(rng, reg, sub, f);
+ return tokenized_range<BidirectionalRange>(rng, reg, sub, f);
}
template<class BidirectionalRange, class Regex, class Submatch, class Flag>
- inline token_range<const BidirectionalRange>
+ inline tokenized_range<const BidirectionalRange>
tokenize(const BidirectionalRange& rng, const Regex& reg, const Submatch& sub, Flag f)
{
- return token_range<const BidirectionalRange>(rng, reg, sub, f);
+ return tokenized_range<const BidirectionalRange>(rng, reg, sub, f);
}
} // 'adaptors'
Modified: branches/release/boost/range/adaptor/transformed.hpp
==============================================================================
--- branches/release/boost/range/adaptor/transformed.hpp (original)
+++ branches/release/boost/range/adaptor/transformed.hpp 2010-12-26 10:13:43 EST (Sun, 26 Dec 2010)
@@ -14,6 +14,7 @@
#include <boost/range/adaptor/argument_fwd.hpp>
#include <boost/range/iterator_range.hpp>
#include <boost/iterator/transform_iterator.hpp>
+#include <boost/utility/result_of.hpp>
namespace boost
{
@@ -21,17 +22,17 @@
{
template< class F, class R >
- struct transform_range :
- public boost::iterator_range<
+ struct transformed_range :
+ public boost::iterator_range<
boost::transform_iterator< F,
- BOOST_DEDUCED_TYPENAME range_iterator<R>::type
+ BOOST_DEDUCED_TYPENAME range_iterator<R>::type
>
>
{
private:
- typedef boost::iterator_range<
+ typedef boost::iterator_range<
boost::transform_iterator< F,
- BOOST_DEDUCED_TYPENAME range_iterator<R>::type
+ BOOST_DEDUCED_TYPENAME range_iterator<R>::type
>
>
base;
@@ -39,11 +40,11 @@
public:
typedef F transform_fn_type;
typedef R source_range_type;
-
- transform_range( F f, R& r )
+
+ transformed_range( F f, R& r )
: base( make_transform_iterator( boost::begin(r), f ),
- make_transform_iterator( boost::end(r), f ) )
-
+ make_transform_iterator( boost::end(r), f ) )
+
{ }
};
@@ -53,51 +54,51 @@
transform_holder( T r ) : holder<T>(r)
{ }
};
-
+
template< class InputRng, class UnaryFunction >
- inline transform_range<UnaryFunction,InputRng>
- operator|( InputRng& r,
+ inline transformed_range<UnaryFunction,InputRng>
+ operator|( InputRng& r,
const transform_holder<UnaryFunction>& f )
{
- return transform_range<UnaryFunction,InputRng>( f.val, r );
+ return transformed_range<UnaryFunction,InputRng>( f.val, r );
}
-
+
template< class InputRng, class UnaryFunction >
- inline transform_range<UnaryFunction, const InputRng>
- operator|( const InputRng& r,
+ inline transformed_range<UnaryFunction, const InputRng>
+ operator|( const InputRng& r,
const transform_holder<UnaryFunction>& f )
{
- return transform_range<UnaryFunction, const InputRng>( f.val, r );
+ return transformed_range<UnaryFunction, const InputRng>( f.val, r );
}
-
+
} // 'range_detail'
- using range_detail::transform_range;
-
+ using range_detail::transformed_range;
+
namespace adaptors
- {
+ {
namespace
{
- const range_detail::forwarder<range_detail::transform_holder>
- transformed =
+ 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>
+ inline transformed_range<UnaryFunction, InputRange>
transform(InputRange& rng, UnaryFunction fn)
{
- return transform_range<UnaryFunction, InputRange>(fn, rng);
+ return transformed_range<UnaryFunction, InputRange>(fn, rng);
}
-
+
template<class UnaryFunction, class InputRange>
- inline transform_range<UnaryFunction, const InputRange>
+ inline transformed_range<UnaryFunction, const InputRange>
transform(const InputRange& rng, UnaryFunction fn)
{
- return transform_range<UnaryFunction, const InputRange>(fn, rng);
+ return transformed_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-12-26 10:13:43 EST (Sun, 26 Dec 2010)
@@ -32,35 +32,35 @@
};
template<class ForwardRng>
- class unique_range : public adjacent_filter_range<unique_not_equal_to, ForwardRng, true>
+ class uniqued_range : public adjacent_filtered_range<unique_not_equal_to, ForwardRng, true>
{
- typedef adjacent_filter_range<unique_not_equal_to, ForwardRng, true> base;
+ typedef adjacent_filtered_range<unique_not_equal_to, ForwardRng, true> base;
public:
- explicit unique_range(ForwardRng& rng)
+ explicit uniqued_range(ForwardRng& rng)
: base(unique_not_equal_to(), rng)
{
}
};
template< class ForwardRng >
- inline unique_range<ForwardRng>
+ inline uniqued_range<ForwardRng>
operator|( ForwardRng& r,
unique_forwarder )
{
- return unique_range<ForwardRng>(r);
+ return uniqued_range<ForwardRng>(r);
}
template< class ForwardRng >
- inline unique_range<const ForwardRng>
+ inline uniqued_range<const ForwardRng>
operator|( const ForwardRng& r,
unique_forwarder )
{
- return unique_range<const ForwardRng>(r);
+ return uniqued_range<const ForwardRng>(r);
}
} // 'range_detail'
- using range_detail::unique_range;
+ using range_detail::uniqued_range;
namespace adaptors
{
@@ -71,17 +71,17 @@
}
template<class ForwardRange>
- inline unique_range<ForwardRange>
+ inline uniqued_range<ForwardRange>
unique(ForwardRange& rng)
{
- return unique_range<ForwardRange>(rng);
+ return uniqued_range<ForwardRange>(rng);
}
template<class ForwardRange>
- inline unique_range<const ForwardRange>
+ inline uniqued_range<const ForwardRange>
unique(const ForwardRange& rng)
{
- return unique_range<const ForwardRange>(rng);
+ return uniqued_range<const ForwardRange>(rng);
}
} // 'adaptors'
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-12-26 10:13:43 EST (Sun, 26 Dec 2010)
@@ -15,6 +15,7 @@
#include <boost/range/concepts.hpp>
#include <boost/range/detail/range_return.hpp>
#include <boost/range/value_type.hpp>
+#include <iterator>
#include <algorithm>
namespace boost
@@ -22,6 +23,218 @@
namespace range
{
+namespace range_detail
+{
+ // Rationale: search_n is implemented rather than delegate to
+ // the standard library implementation because some standard
+ // library implementations are broken eg. MSVC.
+
+ // search_n forward iterator version
+ template<typename ForwardIterator, typename Integer, typename Value>
+ inline ForwardIterator
+ search_n_impl(ForwardIterator first, ForwardIterator last, Integer count,
+ const Value& value, std::forward_iterator_tag)
+ {
+ first = std::find(first, last, value);
+ while (first != last)
+ {
+ typename std::iterator_traits<ForwardIterator>::difference_type n = count;
+ ForwardIterator i = first;
+ ++i;
+ while (i != last && n != 1 && *i==value)
+ {
+ ++i;
+ --n;
+ }
+ if (n == 1)
+ return first;
+ if (i == last)
+ return last;
+ first = std::find(++i, last, value);
+ }
+ return last;
+ }
+
+ // search_n random-access iterator version
+ template<typename RandomAccessIterator, typename Integer, typename Value>
+ inline RandomAccessIterator
+ search_n_impl(RandomAccessIterator first, RandomAccessIterator last,
+ Integer count, const Value& value,
+ std::random_access_iterator_tag)
+ {
+ typedef typename std::iterator_traits<RandomAccessIterator>::difference_type difference_t;
+
+ difference_t tail_size = last - first;
+ const difference_t pattern_size = count;
+
+ if (tail_size < pattern_size)
+ return last;
+
+ const difference_t skip_offset = pattern_size - 1;
+ RandomAccessIterator look_ahead = first + skip_offset;
+ tail_size -= pattern_size;
+
+ while (1)
+ {
+ // look_ahead here is pointing to the last element of the
+ // next possible match
+ while (!(*look_ahead == value)) // skip loop...
+ {
+ if (tail_size < pattern_size)
+ return last; // no match
+ look_ahead += pattern_size;
+ tail_size -= pattern_size;
+ }
+ difference_t remainder = skip_offset;
+ for (RandomAccessIterator back_track = look_ahead - 1;
+ *back_track == value; --back_track)
+ {
+ if (--remainder == 0)
+ {
+ return look_ahead - skip_offset; // matched
+ }
+ }
+ if (remainder > tail_size)
+ return last; // no match
+ look_ahead += remainder;
+ tail_size -= remainder;
+ }
+
+ return last;
+ }
+
+ // search_n for forward iterators using a binary predicate
+ // to determine a match
+ template<typename ForwardIterator, typename Integer, typename Value,
+ typename BinaryPredicate>
+ inline ForwardIterator
+ search_n_pred_impl(ForwardIterator first, ForwardIterator last,
+ Integer count, const Value& value,
+ BinaryPredicate pred, std::forward_iterator_tag)
+ {
+ typedef typename std::iterator_traits<ForwardIterator>::difference_type difference_t;
+
+ while (first != last && !static_cast<bool>(pred(*first, value)))
+ ++first;
+
+ while (first != last)
+ {
+ difference_t n = count;
+ ForwardIterator i = first;
+ ++i;
+ while (i != last && n != 1 && static_cast<bool>(pred(*i, value)))
+ {
+ ++i;
+ --n;
+ }
+ if (n == 1)
+ return first;
+ if (i == last)
+ return last;
+ first = ++i;
+ while (first != last && !static_cast<bool>(pred(*first, value)))
+ ++first;
+ }
+ return last;
+ }
+
+ // search_n for random-access iterators using a binary predicate
+ // to determine a match
+ template<typename RandomAccessIterator, typename Integer,
+ typename Value, typename BinaryPredicate>
+ inline RandomAccessIterator
+ search_n_pred_impl(RandomAccessIterator first, RandomAccessIterator last,
+ Integer count, const Value& value,
+ BinaryPredicate pred, std::random_access_iterator_tag)
+ {
+ typedef typename std::iterator_traits<RandomAccessIterator>::difference_type difference_t;
+
+ difference_t tail_size = last - first;
+ const difference_t pattern_size = count;
+
+ if (tail_size < pattern_size)
+ return last;
+
+ const difference_t skip_offset = pattern_size - 1;
+ RandomAccessIterator look_ahead = first + skip_offset;
+ tail_size -= pattern_size;
+
+ while (1)
+ {
+ // look_ahead points to the last element of the next
+ // possible match
+ while (!static_cast<bool>(pred(*look_ahead, value))) // skip loop
+ {
+ if (tail_size < pattern_size)
+ return last; // no match
+ look_ahead += pattern_size;
+ tail_size -= pattern_size;
+ }
+ difference_t remainder = skip_offset;
+ for (RandomAccessIterator back_track = look_ahead - 1;
+ pred(*back_track, value); --back_track)
+ {
+ if (--remainder == 0)
+ return look_ahead -= skip_offset; // success
+ }
+ if (remainder > tail_size)
+ {
+ return last; // no match
+ }
+ look_ahead += remainder;
+ tail_size -= remainder;
+ }
+ }
+
+ template<typename ForwardIterator, typename Integer, typename Value>
+ inline ForwardIterator
+ search_n_impl(ForwardIterator first, ForwardIterator last,
+ Integer count, const Value& value)
+ {
+ BOOST_RANGE_CONCEPT_ASSERT((ForwardIteratorConcept<ForwardIterator>));
+ BOOST_RANGE_CONCEPT_ASSERT((EqualityComparableConcept<Value>));
+ BOOST_RANGE_CONCEPT_ASSERT((EqualityComparableConcept<typename std::iterator_traits<ForwardIterator>::value_type>));
+ //BOOST_RANGE_CONCEPT_ASSERT((EqualityComparableConcept2<typename std::iterator_traits<ForwardIterator>::value_type, Value>));
+
+ typedef typename std::iterator_traits<ForwardIterator>::iterator_category cat_t;
+
+ if (count <= 0)
+ return first;
+ if (count == 1)
+ return std::find(first, last, value);
+ return range_detail::search_n_impl(first, last, count, value, cat_t());
+ }
+
+ template<typename ForwardIterator, typename Integer, typename Value,
+ typename BinaryPredicate>
+ inline ForwardIterator
+ search_n_pred_impl(ForwardIterator first, ForwardIterator last,
+ Integer count, const Value& value,
+ BinaryPredicate pred)
+ {
+ BOOST_RANGE_CONCEPT_ASSERT((ForwardIteratorConcept<ForwardIterator>));
+ BOOST_RANGE_CONCEPT_ASSERT((
+ BinaryPredicateConcept<
+ BinaryPredicate,
+ typename std::iterator_traits<ForwardIterator>::value_type,
+ Value>
+ ));
+
+ typedef typename std::iterator_traits<ForwardIterator>::iterator_category cat_t;
+
+ if (count <= 0)
+ return first;
+ if (count == 1)
+ {
+ while (first != last && !static_cast<bool>(pred(*first, value)))
+ ++first;
+ return first;
+ }
+ return range_detail::search_n_pred_impl(first, last, count,
+ value, pred, cat_t());
+ }
+} // namespace range_detail
+
/// \brief template function search
///
/// range-based version of the search std algorithm
@@ -36,7 +249,7 @@
search_n(ForwardRange& rng, Integer count, const Value& value)
{
BOOST_RANGE_CONCEPT_ASSERT((ForwardRangeConcept<ForwardRange>));
- return std::search_n(boost::begin(rng),boost::end(rng), count, value);
+ return range_detail::search_n_impl(boost::begin(rng),boost::end(rng), count, value);
}
/// \overload
@@ -45,7 +258,7 @@
search_n(const ForwardRange& rng, Integer count, const Value& value)
{
BOOST_RANGE_CONCEPT_ASSERT((ForwardRangeConcept<const ForwardRange>));
- return std::search_n(boost::begin(rng), boost::end(rng), count, value);
+ return range_detail::search_n_impl(boost::begin(rng), boost::end(rng), count, value);
}
/// \overload
@@ -58,7 +271,7 @@
BOOST_RANGE_CONCEPT_ASSERT((ForwardRangeConcept<ForwardRange>));
BOOST_RANGE_CONCEPT_ASSERT((BinaryPredicateConcept<BinaryPredicate,
BOOST_DEDUCED_TYPENAME range_value<ForwardRange>::type, const Value&>));
- return std::search_n(boost::begin(rng), boost::end(rng),
+ return range_detail::search_n_pred_impl(boost::begin(rng), boost::end(rng),
count, value, binary_pred);
}
@@ -72,7 +285,7 @@
BOOST_RANGE_CONCEPT_ASSERT((ForwardRangeConcept<const ForwardRange>));
BOOST_RANGE_CONCEPT_ASSERT((BinaryPredicateConcept<BinaryPredicate,
BOOST_DEDUCED_TYPENAME range_value<const ForwardRange>::type, const Value&>));
- return std::search_n(boost::begin(rng), boost::end(rng),
+ return range_detail::search_n_pred_impl(boost::begin(rng), boost::end(rng),
count, value, binary_pred);
}
@@ -86,7 +299,7 @@
{
BOOST_RANGE_CONCEPT_ASSERT((ForwardRangeConcept<ForwardRange>));
return range_return<ForwardRange,re>::
- pack(std::search_n(boost::begin(rng),boost::end(rng),
+ pack(range_detail::search_n_impl(boost::begin(rng),boost::end(rng),
count, value),
rng);
}
@@ -99,7 +312,7 @@
{
BOOST_RANGE_CONCEPT_ASSERT((ForwardRangeConcept<const ForwardRange>));
return range_return<const ForwardRange,re>::
- pack(std::search_n(boost::begin(rng), boost::end(rng),
+ pack(range_detail::search_n_impl(boost::begin(rng), boost::end(rng),
count, value),
rng);
}
@@ -116,7 +329,8 @@
BOOST_DEDUCED_TYPENAME range_value<ForwardRange>::type,
const Value&>));
return range_return<ForwardRange,re>::
- pack(std::search_n(boost::begin(rng), boost::end(rng),
+ pack(range_detail::search_n_pred_impl(boost::begin(rng),
+ boost::end(rng),
count, value, pred),
rng);
}
@@ -133,7 +347,8 @@
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),
+ pack(range_detail::search_n_pred_impl(boost::begin(rng),
+ boost::end(rng),
count, value, pred),
rng);
}
Modified: branches/release/boost/range/algorithm/transform.hpp
==============================================================================
--- branches/release/boost/range/algorithm/transform.hpp (original)
+++ branches/release/boost/range/algorithm/transform.hpp 2010-12-26 10:13:43 EST (Sun, 26 Dec 2010)
@@ -84,7 +84,7 @@
{
BOOST_RANGE_CONCEPT_ASSERT(( SinglePassRangeConcept<const SinglePassRange1> ));
BOOST_RANGE_CONCEPT_ASSERT(( SinglePassRangeConcept<const SinglePassRange2> ));
- return range_detail::transform_impl(
+ return boost::range_detail::transform_impl(
boost::begin(rng1), boost::end(rng1),
boost::begin(rng2), boost::end(rng2),
out, fun);
Modified: branches/release/boost/range/combine.hpp
==============================================================================
--- branches/release/boost/range/combine.hpp (original)
+++ branches/release/boost/range/combine.hpp 2010-12-26 10:13:43 EST (Sun, 26 Dec 2010)
@@ -1,3 +1,11 @@
+// Copyright Neil Groves 2010. Use, modification and
+// distribution is subject to 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)
+//
+//
+// For more information, see http://www.boost.org/libs/range/
+//
#ifndef BOOST_RANGE_COMBINE_HPP
#define BOOST_RANGE_COMBINE_HPP
Modified: branches/release/boost/range/concepts.hpp
==============================================================================
--- branches/release/boost/range/concepts.hpp (original)
+++ branches/release/boost/range/concepts.hpp 2010-12-26 10:13:43 EST (Sun, 26 Dec 2010)
@@ -98,8 +98,9 @@
// classes:
//
// The Range algorithms often do not require that the iterators are
- // Assignable, but the correct standard conformant iterators
- // do require the iterators to be a model of the Assignable concept.
+ // Assignable or default constructable, but the correct standard
+ // conformant iterators do require the iterators to be a model of the
+ // Assignable concept.
// Iterators that contains a functor that is not assignable therefore
// are not correct models of the standard iterator concepts,
// despite being adequate for most algorithms. An example of this
@@ -141,6 +142,23 @@
BOOST_DEDUCED_TYPENAME SinglePassIteratorConcept::traversal_category,
single_pass_traversal_tag
>));
+
+ BOOST_CONCEPT_USAGE(SinglePassIteratorConcept)
+ {
+ Iterator i2(++i);
+ boost::ignore_unused_variable_warning(i2);
+
+ Iterator i3(i++);
+ boost::ignore_unused_variable_warning(i3);
+
+ BOOST_DEDUCED_TYPENAME boost::detail::iterator_traits<Iterator>::reference r1(*i);
+ boost::ignore_unused_variable_warning(r1);
+
+ BOOST_DEDUCED_TYPENAME boost::detail::iterator_traits<Iterator>::reference r2(*i++);
+ boost::ignore_unused_variable_warning(r2);
+ }
+ private:
+ Iterator i;
#endif
};
Modified: branches/release/boost/range/counting_range.hpp
==============================================================================
--- branches/release/boost/range/counting_range.hpp (original)
+++ branches/release/boost/range/counting_range.hpp 2010-12-26 10:13:43 EST (Sun, 26 Dec 2010)
@@ -1,13 +1,11 @@
-// Boost.Range library
+// Copyright Neil Groves 2010. Use, modification and
+// distribution is subject to 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)
//
-// Copyright Neil Groves 2008. Use, modification and
-// distribution is subject to the Boost Software Licence, Version
-// 1.0. (See accompanying file LICENSE_1_0.txt or copy at
-// http://www.boost.org/LICENSE_1_0.txt
//
-// For more information, see http://www.boost.org/libs/range
+// For more information, see http://www.boost.org/libs/range/
//
-
#ifndef BOOST_RANGE_COUNTING_RANGE_HPP_INCLUDED
#define BOOST_RANGE_COUNTING_RANGE_HPP_INCLUDED
Modified: branches/release/boost/range/istream_range.hpp
==============================================================================
--- branches/release/boost/range/istream_range.hpp (original)
+++ branches/release/boost/range/istream_range.hpp 2010-12-26 10:13:43 EST (Sun, 26 Dec 2010)
@@ -1,13 +1,11 @@
-// Boost.Range library
+// Copyright Neil Groves 2010. Use, modification and
+// distribution is subject to 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)
//
-// Copyright Neil Groves 2008. Use, modification and
-// distribution is subject to the Boost Software Licence, Version
-// 1.0. (See accompanying file LICENSE_1_0.txt or copy at
-// http://www.boost.org/LICENSE_1_0.txt
//
-// For more information, see http://www.boost.org/libs/range
+// For more information, see http://www.boost.org/libs/range/
//
-
#ifndef BOOST_RANGE_ISTREAM_RANGE_HPP_INCLUDED
#define BOOST_RANGE_ISTREAM_RANGE_HPP_INCLUDED
Modified: branches/release/boost/range/iterator_range_core.hpp
==============================================================================
--- branches/release/boost/range/iterator_range_core.hpp (original)
+++ branches/release/boost/range/iterator_range_core.hpp 2010-12-26 10:13:43 EST (Sun, 26 Dec 2010)
@@ -230,7 +230,7 @@
difference_type size() const
{
- return m_End - m_Begin;
+ return std::distance(m_Begin, m_End);
}
bool empty() const
@@ -290,6 +290,20 @@
return *--last;
}
+ // pop_front() - added to model the SinglePassRangePrimitiveConcept
+ void pop_front()
+ {
+ BOOST_ASSERT( !empty() );
+ ++m_Begin;
+ }
+
+ // pop_back() - added to model the BidirectionalRangePrimitiveConcept
+ void pop_back()
+ {
+ BOOST_ASSERT( !empty() );
+ --m_End;
+ }
+
reference operator[]( difference_type at ) const
{
BOOST_ASSERT( at >= 0 && at < size() );
Modified: branches/release/boost/range/metafunctions.hpp
==============================================================================
--- branches/release/boost/range/metafunctions.hpp (original)
+++ branches/release/boost/range/metafunctions.hpp 2010-12-26 10:13:43 EST (Sun, 26 Dec 2010)
@@ -16,6 +16,7 @@
#endif
#include <boost/range/iterator.hpp>
+#include <boost/range/has_range_iterator.hpp>
#include <boost/range/result_iterator.hpp>
#include <boost/range/reverse_iterator.hpp>
#include <boost/range/const_reverse_iterator.hpp>
Modified: branches/release/boost/range/size.hpp
==============================================================================
--- branches/release/boost/range/size.hpp (original)
+++ branches/release/boost/range/size.hpp 2010-12-26 10:13:43 EST (Sun, 26 Dec 2010)
@@ -15,6 +15,7 @@
# pragma once
#endif
+#include <boost/iterator/iterator_categories.hpp>
#include <boost/range/begin.hpp>
#include <boost/range/end.hpp>
#include <boost/range/difference_type.hpp>
@@ -22,13 +23,47 @@
namespace boost
{
+ namespace range_detail
+ {
+ template< class SinglePassRange >
+ inline BOOST_DEDUCED_TYPENAME range_difference<SinglePassRange>::type
+ size_impl(const SinglePassRange& rng, boost::single_pass_traversal_tag)
+ {
+ typedef BOOST_DEDUCED_TYPENAME range_difference<SinglePassRange>::type diff_t;
+
+ // A compilation error here will often indicate that an algorithm
+ // is attempting to use boost::size(rng) for a range that is not a
+ // model of the RandomAccessRange Concept and does not have a
+ // member size() function.
+ // The solution to this issue is to add a range_calculate_size()
+ // function for the range type that will be found via ADL.
+ return static_cast<diff_t>(rng.size());
+ }
+
+ template< class SinglePassRange >
+ inline BOOST_DEDUCED_TYPENAME range_difference<SinglePassRange>::type
+ size_impl(const SinglePassRange& rng, boost::random_access_traversal_tag)
+ {
+ BOOST_ASSERT( (boost::end(rng) - boost::begin(rng)) >= 0 &&
+ "reachability invariant broken!" );
+ return boost::end(rng) - boost::begin(rng);
+ }
+ } // namespace range_detail
+
+ template<class SinglePassRange>
+ inline BOOST_DEDUCED_TYPENAME range_difference<SinglePassRange>::type
+ range_calculate_size(const SinglePassRange& rng)
+ {
+ typedef BOOST_DEDUCED_TYPENAME range_iterator<const SinglePassRange>::type iter_t;
+ typedef BOOST_DEDUCED_TYPENAME iterator_traversal<iter_t>::type traversal_tag;
+ return range_detail::size_impl(rng, traversal_tag());
+ }
- template< class T >
- inline BOOST_DEDUCED_TYPENAME range_difference<T>::type size( const T& r )
+ template<class SinglePassRange>
+ inline BOOST_DEDUCED_TYPENAME range_difference<SinglePassRange>::type
+ size(const SinglePassRange& rng)
{
- BOOST_ASSERT( (boost::end( r ) - boost::begin( r )) >= 0 &&
- "reachability invariant broken!" );
- return boost::end( r ) - boost::begin( r );
+ return range_calculate_size(rng);
}
} // namespace 'boost'
Modified: branches/release/libs/range/doc/concepts.qbk
==============================================================================
--- branches/release/libs/range/doc/concepts.qbk (original)
+++ branches/release/libs/range/doc/concepts.qbk 2010-12-26 10:13:43 EST (Sun, 26 Dec 2010)
@@ -1,3 +1,8 @@
+[/
+ Copyright 2010 Neil Groves
+ 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)
+/]
[section:concepts Range Concepts]
[section Overview]
@@ -246,6 +251,5 @@
__concept_check__
[endsect]
-
[endsect]
Modified: branches/release/libs/range/doc/examples.qbk
==============================================================================
--- branches/release/libs/range/doc/examples.qbk (original)
+++ branches/release/libs/range/doc/examples.qbk 2010-12-26 10:13:43 EST (Sun, 26 Dec 2010)
@@ -1,4 +1,9 @@
-[section Examples]
+[/
+ Copyright 2010 Neil Groves
+ 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)
+/]
+[section:examples Examples]
Some examples are given in the accompanying test files:
Modified: branches/release/libs/range/doc/faq.qbk
==============================================================================
--- branches/release/libs/range/doc/faq.qbk (original)
+++ branches/release/libs/range/doc/faq.qbk 2010-12-26 10:13:43 EST (Sun, 26 Dec 2010)
@@ -1,4 +1,9 @@
-[section FAQ]
+[/
+ Copyright 2010 Neil Groves
+ 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)
+/]
+[section:faq FAQ]
1. ['[*Why is there no difference between `range_iterator<C>::type` and `range_const_iterator<C>::type` for `std::pair<iterator, iterator>`?]]
Modified: branches/release/libs/range/doc/headers.qbk
==============================================================================
--- branches/release/libs/range/doc/headers.qbk (original)
+++ branches/release/libs/range/doc/headers.qbk 2010-12-26 10:13:43 EST (Sun, 26 Dec 2010)
@@ -1,6 +1,11 @@
-[section Library Headers]
+[/
+ Copyright 2010 Neil Groves
+ 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)
+/]
+[section:headers Library Headers]
-[section General]
+[section:general General]
[table
[[Header ] [Includes ] [Related Concept ]]
[[`<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. ] [- ]]
@@ -34,7 +39,7 @@
]
[endsect]
-[section Adaptors]
+[section:adaptors Adaptors]
[table
[[Header ][Includes ]]
[[`<boost/range/adaptor/adjacent_filtered.hpp>`] [__range_adaptors_adjacent_filtered__ ]]
@@ -54,7 +59,7 @@
]
[endsect]
-[section Algorithm]
+[section:algorithm Algorithm]
[table
[[Header ][Includes ]]
[[`<boost/range/algorithm/adjacent_find.hpp>`] [__range_algorithms_adjacent_find__]]
@@ -119,7 +124,7 @@
]
[endsect]
-[section Algorithm Extensions]
+[section:algorithm_ext Algorithm Extensions]
[table
[[Header ][Includes ]]
[[`<boost/range/algorithm_ext/copy_n.hpp>`] [__range_algorithm_ext_copy_n__]]
Modified: branches/release/libs/range/doc/history_ack.qbk
==============================================================================
--- branches/release/libs/range/doc/history_ack.qbk (original)
+++ branches/release/libs/range/doc/history_ack.qbk 2010-12-26 10:13:43 EST (Sun, 26 Dec 2010)
@@ -1,3 +1,8 @@
+[/
+ Copyright 2010 Neil Groves
+ 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)
+/]
[section:history_ack History and Acknowledgement]
[heading Version 1 - before Boost 1.43]
@@ -51,4 +56,3 @@
gratitude that I feel to all who have contributed. Thank you everyone.
[endsect]
-
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-12-26 10:13:43 EST (Sun, 26 Dec 2010)
@@ -30,7 +30,7 @@
</h3></div></div>
<div><p class="copyright">Copyright © 2003 -2010 Thorsten Ottosen, Neil Groves</p></div>
<div><div class="legalnotice">
-<a name="id759698"></a><p>
+<a name="id618509"></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>
@@ -40,7 +40,7 @@
<p><b>Table of Contents</b></p>
<dl>
<dt><span class="section">Introduction</span></dt>
-<dt><span class="section"> Range Concepts</span></dt>
+<dt><span class="section">Range Concepts</span></dt>
<dd><dl>
<dt><span class="section">Overview</span></dt>
<dt><span class="section">Single Pass Range</span></dt>
@@ -49,87 +49,88 @@
<dt><span class="section">Random Access Range</span></dt>
<dt><span class="section">Concept Checking</span></dt>
</dl></dd>
-<dt><span class="section"> Reference</span></dt>
+<dt><span class="section">Reference</span></dt>
<dd><dl>
<dt><span class="section">Overview</span></dt>
-<dt><span class="section"><a href="range/reference/concept_implementation.html"> Range concept
+<dt><span class="section"><a href="range/reference/concept_implementation.html">Range concept
implementation</a></span></dt>
<dd><dl>
<dt><span class="section">Synopsis</span></dt>
<dt><span class="section">Semantics</span></dt>
</dl></dd>
-<dt><span class="section"> Range Adaptors</span></dt>
+<dt><span class="section">Range Adaptors</span></dt>
<dd><dl>
-<dt><span class="section"><a href="range/reference/adaptors/introduction.html"> Introduction
+<dt><span class="section"><a href="range/reference/adaptors/introduction.html">Introduction
and motivation</a></span></dt>
-<dt><span class="section"><a href="range/reference/adaptors/general_requirements.html"> General
+<dt><span class="section"><a href="range/reference/adaptors/general_requirements.html">General
Requirements</a></span></dt>
-<dt><span class="section"> Reference</span></dt>
+<dt><span class="section">Reference</span></dt>
</dl></dd>
-<dt><span class="section"> Range Algorithm</span></dt>
+<dt><span class="section">Range Algorithms</span></dt>
<dd><dl>
-<dt><span class="section"><a href="range/reference/algorithms/range_algorithm_introduction.html">
- Introduction and motivation</a></span></dt>
-<dt><span class="section"> Mutating algorithms</span></dt>
-<dt><span class="section"><a href="range/reference/algorithms/non_mutating.html"> Non-mutating
+<dt><span class="section"><a href="range/reference/algorithms/introduction.html">Introduction
+ and motivation</a></span></dt>
+<dt><span class="section">Mutating algorithms</span></dt>
+<dt><span class="section"><a href="range/reference/algorithms/non_mutating.html">Non-mutating
algorithms</a></span></dt>
-<dt><span class="section"> Set algorithms</span></dt>
-<dt><span class="section"> Heap algorithms</span></dt>
-<dt><span class="section"><a href="range/reference/algorithms/permutation.html"> Permutation
+<dt><span class="section">Set algorithms</span></dt>
+<dt><span class="section">Heap algorithms</span></dt>
+<dt><span class="section"><a href="range/reference/algorithms/permutation.html">Permutation
algorithms</a></span></dt>
-<dt><span class="section"> New algorithms</span></dt>
-<dt><span class="section"> Numeric algorithms</span></dt>
+<dt><span class="section">New algorithms</span></dt>
+<dt><span class="section">Numeric algorithms</span></dt>
</dl></dd>
-<dt><span class="section"> Provided Ranges</span></dt>
+<dt><span class="section">Provided Ranges</span></dt>
<dd><dl>
-<dt><span class="section"> counting_range</span></dt>
-<dt><span class="section"> istream_range</span></dt>
-<dt><span class="section"> irange</span></dt>
+<dt><span class="section">counting_range</span></dt>
+<dt><span class="section">istream_range</span></dt>
+<dt><span class="section">irange</span></dt>
</dl></dd>
-<dt><span class="section"> Utilities</span></dt>
+<dt><span class="section">Utilities</span></dt>
<dd><dl>
-<dt><span class="section"> Class iterator_range</span></dt>
-<dt><span class="section"> Class sub_range</span></dt>
-<dt><span class="section"> Function join</span></dt>
+<dt><span class="section">Class iterator_range</span></dt>
+<dt><span class="section">Class sub_range</span></dt>
+<dt><span class="section">Function join</span></dt>
</dl></dd>
-<dt><span class="section"> Extending the library</span></dt>
+<dt><span class="section">Extending the library</span></dt>
<dd><dl>
-<dt><span class="section"><a href="range/reference/extending/method_1.html"> Method 1: provide
+<dt><span class="section"><a href="range/reference/extending/method_1.html">Method 1: provide
member functions and nested types</a></span></dt>
-<dt><span class="section"><a href="range/reference/extending/method_2.html"> Method 2: provide
+<dt><span class="section"><a href="range/reference/extending/method_2.html">Method 2: provide
free-standing functions and specialize metafunctions</a></span></dt>
-<dt><span class="section"><a href="range/reference/extending/method_3.html"> Method 3: provide
+<dt><span class="section"><a href="range/reference/extending/method_3.html">Method 3: provide
range adaptor implementations</a></span></dt>
</dl></dd>
</dl></dd>
-<dt><span class="section"> Terminology and style guidelines</span></dt>
-<dt><span class="section">Library Headers</span></dt>
+<dt><span class="section">Terminology and style guidelines</span></dt>
+<dt><span class="section">Library Headers</span></dt>
<dd><dl>
-<dt><span class="section">General</span></dt>
-<dt><span class="section">Adaptors</span></dt>
-<dt><span class="section">Algorithm</span></dt>
-<dt><span class="section"><a href="range/library_headers/algorithm_extensions.html">Algorithm
- Extensions</a></span></dt>
+<dt><span class="section">General</span></dt>
+<dt><span class="section">Adaptors</span></dt>
+<dt><span class="section">Algorithm</span></dt>
+<dt><span class="section">Algorithm Extensions</span></dt>
</dl></dd>
<dt><span class="section">Examples</span></dt>
-<dt><span class="section"> MFC/ATL (courtesy of Shunsuke Sogame)</span></dt>
-<dd><dl>
-<dt><span class="section"> Requirements</span></dt>
-<dt><span class="section"> MFC Ranges</span></dt>
-<dt><span class="section"> ATL Ranges</span></dt>
-<dt><span class="section"> const Ranges</span></dt>
-<dt><span class="section"> References</span></dt>
-</dl></dd>
-<dt><span class="section"> Upgrade version of Boost.Range</span></dt>
+<dt><span class="section">MFC/ATL (courtesy of Shunsuke Sogame)</span></dt>
<dd><dl>
-<dt><span class="section"><a href="range/upgrade/upgrade_from_1_42.html"> Upgrade from version
+<dt><span class="section">Requirements</span></dt>
+<dt><span class="section">MFC Ranges</span></dt>
+<dt><span class="section">ATL Ranges</span></dt>
+<dt><span class="section">const Ranges</span></dt>
+<dt><span class="section">References</span></dt>
+</dl></dd>
+<dt><span class="section">Upgrade version of Boost.Range</span></dt>
+<dd><dl>
+<dt><span class="section"><a href="range/upgrade/upgrade_from_1_45.html">Upgrade from version
+ 1.45</a></span></dt>
+<dt><span class="section"><a href="range/upgrade/upgrade_from_1_42.html">Upgrade from version
1.42</a></span></dt>
-<dt><span class="section"><a href="range/upgrade/upgrade_from_1_34.html"> Upgrade from version
+<dt><span class="section"><a href="range/upgrade/upgrade_from_1_34.html">Upgrade from version
1.34</a></span></dt>
</dl></dd>
<dt><span class="section">Portability</span></dt>
<dt><span class="section">FAQ</span></dt>
-<dt><span class="section"> History and Acknowledgement</span></dt>
+<dt><span class="section">History and Acknowledgement</span></dt>
</dl>
</div>
<p>
@@ -142,7 +143,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: July 22, 2010 at 23:20:42 GMT</small></p></td>
+<td align="left"><p><small>Last revised: December 23, 2010 at 17:58:25 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-12-26 10:13:43 EST (Sun, 26 Dec 2010)
@@ -34,7 +34,7 @@
range/reference/adaptors/reference/transformed.html
range/reference/adaptors/reference/uniqued.html
range/reference/algorithms.html
-range/reference/algorithms/range_algorithm_introduction.html
+range/reference/algorithms/introduction.html
range/reference/algorithms/mutating.html
range/reference/algorithms/mutating/copy.html
range/reference/algorithms/mutating/copy_backward.html
@@ -132,11 +132,11 @@
range/reference/extending/method_3/method_3_1.html
range/reference/extending/method_3/method_3_2.html
range/style_guide.html
-range/library_headers.html
-range/library_headers/general.html
-range/library_headers/adaptors.html
-range/library_headers/algorithm.html
-range/library_headers/algorithm_extensions.html
+range/headers.html
+range/headers/general.html
+range/headers/adaptors.html
+range/headers/algorithm.html
+range/headers/algorithm_ext.html
range/examples.html
range/mfc_atl.html
range/mfc_atl/requirements.html
@@ -145,6 +145,7 @@
range/mfc_atl/const_ranges.html
range/mfc_atl/references.html
range/upgrade.html
+range/upgrade/upgrade_from_1_45.html
range/upgrade/upgrade_from_1_42.html
range/upgrade/upgrade_from_1_34.html
range/portability.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-12-26 10:13:43 EST (Sun, 26 Dec 2010)
@@ -24,7 +24,7 @@
</div>
<div class="section">
<div class="titlepage"><div><div><h2 class="title" style="clear: both">
-<a name="range.concepts"></a><a class="link" href="concepts.html" title="Range Concepts"> Range Concepts</a>
+<a name="range.concepts"></a><a class="link" href="concepts.html" title="Range Concepts">Range Concepts</a>
</h2></div></div></div>
<div class="toc"><dl>
<dt><span class="section">Overview</span></dt>
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-12-26 10:13:43 EST (Sun, 26 Dec 2010)
@@ -27,7 +27,7 @@
<a name="range.concepts.bidirectional_range"></a><a class="link" href="bidirectional_range.html" title="Bidirectional Range">Bidirectional Range</a>
</h3></div></div></div>
<a name="range.concepts.bidirectional_range.notation"></a><h5>
-<a name="id762089"></a>
+<a name="id660804"></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="id762184"></a>
+<a name="id660892"></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="id762247"></a>
+<a name="id660950"></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="id762274"></a>
+<a name="id660973"></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="id762436"></a>
+<a name="id661129"></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="id762894"></a>
+<a name="id661589"></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="id763034"></a>
+<a name="id661729"></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="id763287"></a>
+<a name="id661978"></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-12-26 10:13:43 EST (Sun, 26 Dec 2010)
@@ -79,7 +79,7 @@
</li>
</ul></div>
<a name="range.concepts.concept_checking.see_also"></a><h5>
-<a name="id764273"></a>
+<a name="id662924"></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-12-26 10:13:43 EST (Sun, 26 Dec 2010)
@@ -27,7 +27,7 @@
<a name="range.concepts.forward_range"></a><a class="link" href="forward_range.html" title="Forward Range">Forward Range</a>
</h3></div></div></div>
<a name="range.concepts.forward_range.notation"></a><h5>
-<a name="id761693"></a>
+<a name="id660433"></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="id761785"></a>
+<a name="id660521"></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="id761854"></a>
+<a name="id660586"></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="id761881"></a>
+<a name="id660609"></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="id762035"></a>
+<a name="id660758"></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/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-12-26 10:13:43 EST (Sun, 26 Dec 2010)
@@ -27,7 +27,7 @@
<a name="range.concepts.random_access_range"></a><a class="link" href="random_access_range.html" title="Random Access Range">Random Access Range</a>
</h3></div></div></div>
<a name="range.concepts.random_access_range.description"></a><h5>
-<a name="id763341"></a>
+<a name="id662025"></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="id763409"></a>
+<a name="id662090"></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="id763438"></a>
+<a name="id662113"></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="id763581"></a>
+<a name="id662251"></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="id763798"></a>
+<a name="id662466"></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="id763849"></a>
+<a name="id662514"></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-12-26 10:13:43 EST (Sun, 26 Dec 2010)
@@ -27,7 +27,7 @@
<a name="range.concepts.single_pass_range"></a><a class="link" href="single_pass_range.html" title="Single Pass Range">Single Pass Range</a>
</h3></div></div></div>
<a name="range.concepts.single_pass_range.notation"></a><h5>
-<a name="id760368"></a>
+<a name="id659140"></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="id760464"></a>
+<a name="id659233"></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="id760531"></a>
+<a name="id659298"></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="id760701"></a>
+<a name="id659461"></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="id761022"></a>
+<a name="id659780"></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="id761284"></a>
+<a name="id660037"></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="id761365"></a>
+<a name="id660114"></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="id761625"></a>
+<a name="id660370"></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-12-26 10:13:43 EST (Sun, 26 Dec 2010)
@@ -6,7 +6,7 @@
<meta name="generator" content="DocBook XSL Stylesheets V1.75.2">
<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/algorithm_extensions.html" title="Algorithm Extensions">
+<link rel="prev" href="headers/algorithm_ext.html" title="Algorithm Extensions">
<link rel="next" href="mfc_atl.html" title="MFC/ATL (courtesy of Shunsuke Sogame)">
</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="library_headers/algorithm_extensions.html"><img src="../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../index.html"><img src="../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../index.html"><img src="../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="mfc_atl.html"><img src="../../../../../doc/src/images/next.png" alt="Next"></a>
+<a accesskey="p" href="headers/algorithm_ext.html"><img src="../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../index.html"><img src="../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../index.html"><img src="../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="mfc_atl.html"><img src="../../../../../doc/src/images/next.png" alt="Next"></a>
</div>
<div class="section">
<div class="titlepage"><div><div><h2 class="title" style="clear: both">
@@ -68,7 +68,7 @@
</tr></table>
<hr>
<div class="spirit-nav">
-<a accesskey="p" href="library_headers/algorithm_extensions.html"><img src="../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../index.html"><img src="../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../index.html"><img src="../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="mfc_atl.html"><img src="../../../../../doc/src/images/next.png" alt="Next"></a>
+<a accesskey="p" href="headers/algorithm_ext.html"><img src="../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../index.html"><img src="../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../index.html"><img src="../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="mfc_atl.html"><img src="../../../../../doc/src/images/next.png" alt="Next"></a>
</div>
</body>
</html>
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-12-26 10:13:43 EST (Sun, 26 Dec 2010)
@@ -23,10 +23,10 @@
</div>
<div class="section">
<div class="titlepage"><div><div><h2 class="title" style="clear: both">
-<a name="range.history_ack"></a><a class="link" href="history_ack.html" title="History and Acknowledgement"> History and Acknowledgement</a>
+<a name="range.history_ack"></a><a class="link" href="history_ack.html" title="History and Acknowledgement">History and Acknowledgement</a>
</h2></div></div></div>
<a name="range.history_ack.version_1___before_boost_1_43"></a><h4>
-<a name="id894720"></a>
+<a name="id793098"></a>
<a class="link" href="history_ack.html#range.history_ack.version_1___before_boost_1_43">Version 1 -
before Boost 1.43</a>
</h4>
@@ -79,7 +79,7 @@
The concept checks and their documentation was provided by Daniel Walker.
</p>
<a name="range.history_ack.version_2___boost_1_43_and_beyond"></a><h4>
-<a name="id894829"></a>
+<a name="id793199"></a>
<a class="link" href="history_ack.html#range.history_ack.version_2___boost_1_43_and_beyond">Version
2 - Boost 1.43 and beyond</a>
</h4>
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-12-26 10:13:43 EST (Sun, 26 Dec 2010)
@@ -70,7 +70,7 @@
</li>
</ul></div>
<a name="range.introduction.example___iterate_over_the_values_in_a_map"></a><h4>
-<a name="id759844"></a>
+<a name="id617787"></a>
<a class="link" href="introduction.html#range.introduction.example___iterate_over_the_values_in_a_map">Example
- Iterate over the values in a map</a>
</h4>
@@ -84,7 +84,7 @@
<p>
</p>
<a name="range.introduction.example___iterate_over_the_keys_in_a_map"></a><h4>
-<a name="id759955"></a>
+<a name="id617908"></a>
<a class="link" href="introduction.html#range.introduction.example___iterate_over_the_keys_in_a_map">Example
- Iterate over the keys in a map</a>
</h4>
@@ -98,7 +98,7 @@
<p>
</p>
<a name="range.introduction.example___push_the_even_values_from_a_map_in_reverse_order_into_the_container__code__phrase_role__identifier__target__phrase___code_"></a><h4>
-<a name="id760072"></a>
+<a name="id658861"></a>
<a class="link" href="introduction.html#range.introduction.example___push_the_even_values_from_a_map_in_reverse_order_into_the_container__code__phrase_role__identifier__target__phrase___code_">Example
- Push the even values from a map in reverse order into the container <code class="computeroutput"><span class="identifier">target</span></code></a>
</h4>
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-12-26 10:13:43 EST (Sun, 26 Dec 2010)
@@ -24,17 +24,17 @@
</div>
<div class="section">
<div class="titlepage"><div><div><h2 class="title" style="clear: both">
-<a name="range.mfc_atl"></a><a class="link" href="mfc_atl.html" title="MFC/ATL (courtesy of Shunsuke Sogame)"> MFC/ATL (courtesy of Shunsuke Sogame)</a>
+<a name="range.mfc_atl"></a><a class="link" href="mfc_atl.html" title="MFC/ATL (courtesy of Shunsuke Sogame)">MFC/ATL (courtesy of Shunsuke Sogame)</a>
</h2></div></div></div>
<div class="toc"><dl>
-<dt><span class="section"> Requirements</span></dt>
-<dt><span class="section"> MFC Ranges</span></dt>
-<dt><span class="section"> ATL Ranges</span></dt>
-<dt><span class="section"> const Ranges</span></dt>
-<dt><span class="section"> References</span></dt>
+<dt><span class="section">Requirements</span></dt>
+<dt><span class="section">MFC Ranges</span></dt>
+<dt><span class="section">ATL Ranges</span></dt>
+<dt><span class="section">const Ranges</span></dt>
+<dt><span class="section">References</span></dt>
</dl></div>
<a name="range.mfc_atl.introduction"></a><h5>
-<a name="id888180"></a>
+<a name="id786627"></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="id888317"></a>
+<a name="id786761"></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-12-26 10:13:43 EST (Sun, 26 Dec 2010)
@@ -24,7 +24,7 @@
</div>
<div class="section">
<div class="titlepage"><div><div><h3 class="title">
-<a name="range.mfc_atl.atl_ranges"></a><a class="link" href="atl_ranges.html" title="ATL Ranges"> ATL Ranges</a>
+<a name="range.mfc_atl.atl_ranges"></a><a class="link" href="atl_ranges.html" title="ATL Ranges">ATL Ranges</a>
</h3></div></div></div>
<p>
If the <code class="computeroutput"><span class="special"><</span><span class="identifier">boost</span><span class="special">/</span><span class="identifier">range</span><span class="special">/</span><span class="identifier">atl</span><span class="special">.</span><span class="identifier">hpp</span><span class="special">></span></code>
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-12-26 10:13:43 EST (Sun, 26 Dec 2010)
@@ -24,7 +24,7 @@
</div>
<div class="section">
<div class="titlepage"><div><div><h3 class="title">
-<a name="range.mfc_atl.const_ranges"></a><a class="link" href="const_ranges.html" title="const Ranges"> const Ranges</a>
+<a name="range.mfc_atl.const_ranges"></a><a class="link" href="const_ranges.html" title="const Ranges">const Ranges</a>
</h3></div></div></div>
<p>
<code class="computeroutput"><span class="identifier">range_reference</span><span class="special"><</span><span class="keyword">const</span> <span class="identifier">Range</span><span class="special">>::</span><span class="identifier">type</span></code>
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-12-26 10:13:43 EST (Sun, 26 Dec 2010)
@@ -24,7 +24,7 @@
</div>
<div class="section">
<div class="titlepage"><div><div><h3 class="title">
-<a name="range.mfc_atl.mfc_ranges"></a><a class="link" href="mfc_ranges.html" title="MFC Ranges"> MFC Ranges</a>
+<a name="range.mfc_atl.mfc_ranges"></a><a class="link" href="mfc_ranges.html" title="MFC Ranges">MFC Ranges</a>
</h3></div></div></div>
<p>
If the <code class="computeroutput"><span class="special"><</span><span class="identifier">boost</span><span class="special">/</span><span class="identifier">range</span><span class="special">/</span><span class="identifier">mfc</span><span class="special">.</span><span class="identifier">hpp</span><span class="special">></span></code>
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-12-26 10:13:43 EST (Sun, 26 Dec 2010)
@@ -24,7 +24,7 @@
</div>
<div class="section">
<div class="titlepage"><div><div><h3 class="title">
-<a name="range.mfc_atl.references"></a><a class="link" href="references.html" title="References"> References</a>
+<a name="range.mfc_atl.references"></a><a class="link" href="references.html" title="References">References</a>
</h3></div></div></div>
<div class="orderedlist"><ol class="orderedlist" type="1">
<li class="listitem">
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-12-26 10:13:43 EST (Sun, 26 Dec 2010)
@@ -24,7 +24,7 @@
</div>
<div class="section">
<div class="titlepage"><div><div><h3 class="title">
-<a name="range.mfc_atl.requirements"></a><a class="link" href="requirements.html" title="Requirements"> Requirements</a>
+<a name="range.mfc_atl.requirements"></a><a class="link" href="requirements.html" title="Requirements">Requirements</a>
</h3></div></div></div>
<div class="itemizedlist"><ul class="itemizedlist" type="disc">
<li class="listitem">
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-12-26 10:13:43 EST (Sun, 26 Dec 2010)
@@ -62,17 +62,19 @@
rvalue problems,
</li>
<li class="listitem">
+<p class="simpara">
do not rely on ADL:
- <div class="itemizedlist"><ul class="itemizedlist" type="disc">
+ </p>
+<div class="itemizedlist"><ul class="itemizedlist" type="disc">
<li class="listitem">
- if you overload functions, include that header before the headers
- in this library,
- </li>
+ if you overload functions, include that header before the headers in
+ this library,
+ </li>
<li class="listitem">
- put all overloads in namespace boost.
- </li>
+ put all overloads in namespace boost.
+ </li>
</ul></div>
- </li>
+</li>
</ol></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.html
==============================================================================
--- branches/release/libs/range/doc/html/range/reference.html (original)
+++ branches/release/libs/range/doc/html/range/reference.html 2010-12-26 10:13:43 EST (Sun, 26 Dec 2010)
@@ -24,57 +24,57 @@
</div>
<div class="section">
<div class="titlepage"><div><div><h2 class="title" style="clear: both">
-<a name="range.reference"></a><a class="link" href="reference.html" title="Reference"> Reference</a>
+<a name="range.reference"></a><a class="link" href="reference.html" title="Reference">Reference</a>
</h2></div></div></div>
<div class="toc"><dl>
<dt><span class="section">Overview</span></dt>
-<dt><span class="section"><a href="reference/concept_implementation.html"> Range concept
+<dt><span class="section"><a href="reference/concept_implementation.html">Range concept
implementation</a></span></dt>
<dd><dl>
<dt><span class="section">Synopsis</span></dt>
<dt><span class="section">Semantics</span></dt>
</dl></dd>
-<dt><span class="section"> Range Adaptors</span></dt>
+<dt><span class="section">Range Adaptors</span></dt>
<dd><dl>
-<dt><span class="section"><a href="reference/adaptors/introduction.html"> Introduction
+<dt><span class="section"><a href="reference/adaptors/introduction.html">Introduction
and motivation</a></span></dt>
-<dt><span class="section"><a href="reference/adaptors/general_requirements.html"> General
+<dt><span class="section"><a href="reference/adaptors/general_requirements.html">General
Requirements</a></span></dt>
-<dt><span class="section"> Reference</span></dt>
+<dt><span class="section">Reference</span></dt>
</dl></dd>
-<dt><span class="section"> Range Algorithm</span></dt>
+<dt><span class="section">Range Algorithms</span></dt>
<dd><dl>
-<dt><span class="section"><a href="reference/algorithms/range_algorithm_introduction.html">
- Introduction and motivation</a></span></dt>
-<dt><span class="section"> Mutating algorithms</span></dt>
-<dt><span class="section"><a href="reference/algorithms/non_mutating.html"> Non-mutating
+<dt><span class="section"><a href="reference/algorithms/introduction.html">Introduction
+ and motivation</a></span></dt>
+<dt><span class="section">Mutating algorithms</span></dt>
+<dt><span class="section"><a href="reference/algorithms/non_mutating.html">Non-mutating
algorithms</a></span></dt>
-<dt><span class="section"> Set algorithms</span></dt>
-<dt><span class="section"> Heap algorithms</span></dt>
-<dt><span class="section"><a href="reference/algorithms/permutation.html"> Permutation
+<dt><span class="section">Set algorithms</span></dt>
+<dt><span class="section">Heap algorithms</span></dt>
+<dt><span class="section"><a href="reference/algorithms/permutation.html">Permutation
algorithms</a></span></dt>
-<dt><span class="section"> New algorithms</span></dt>
-<dt><span class="section"> Numeric algorithms</span></dt>
+<dt><span class="section">New algorithms</span></dt>
+<dt><span class="section">Numeric algorithms</span></dt>
</dl></dd>
-<dt><span class="section"> Provided Ranges</span></dt>
+<dt><span class="section">Provided Ranges</span></dt>
<dd><dl>
-<dt><span class="section"> counting_range</span></dt>
-<dt><span class="section"> istream_range</span></dt>
-<dt><span class="section"> irange</span></dt>
+<dt><span class="section">counting_range</span></dt>
+<dt><span class="section">istream_range</span></dt>
+<dt><span class="section">irange</span></dt>
</dl></dd>
-<dt><span class="section"> Utilities</span></dt>
+<dt><span class="section">Utilities</span></dt>
<dd><dl>
-<dt><span class="section"> Class iterator_range</span></dt>
-<dt><span class="section"> Class sub_range</span></dt>
-<dt><span class="section"> Function join</span></dt>
+<dt><span class="section">Class iterator_range</span></dt>
+<dt><span class="section">Class sub_range</span></dt>
+<dt><span class="section">Function join</span></dt>
</dl></dd>
-<dt><span class="section"> Extending the library</span></dt>
+<dt><span class="section">Extending the library</span></dt>
<dd><dl>
-<dt><span class="section"><a href="reference/extending/method_1.html"> Method 1: provide
+<dt><span class="section"><a href="reference/extending/method_1.html">Method 1: provide
member functions and nested types</a></span></dt>
-<dt><span class="section"><a href="reference/extending/method_2.html"> Method 2: provide
+<dt><span class="section"><a href="reference/extending/method_2.html">Method 2: provide
free-standing functions and specialize metafunctions</a></span></dt>
-<dt><span class="section"><a href="reference/extending/method_3.html"> Method 3: provide
+<dt><span class="section"><a href="reference/extending/method_3.html">Method 3: provide
range adaptor implementations</a></span></dt>
</dl></dd>
</dl></div>
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-12-26 10:13:43 EST (Sun, 26 Dec 2010)
@@ -24,14 +24,14 @@
</div>
<div class="section">
<div class="titlepage"><div><div><h3 class="title">
-<a name="range.reference.adaptors"></a><a class="link" href="adaptors.html" title="Range Adaptors"> Range Adaptors</a>
+<a name="range.reference.adaptors"></a><a class="link" href="adaptors.html" title="Range Adaptors">Range Adaptors</a>
</h3></div></div></div>
<div class="toc"><dl>
-<dt><span class="section"><a href="adaptors/introduction.html"> Introduction
+<dt><span class="section"><a href="adaptors/introduction.html">Introduction
and motivation</a></span></dt>
-<dt><span class="section"><a href="adaptors/general_requirements.html"> General
+<dt><span class="section"><a href="adaptors/general_requirements.html">General
Requirements</a></span></dt>
-<dt><span class="section"> Reference</span></dt>
+<dt><span class="section">Reference</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/adaptors/general_requirements.html
==============================================================================
--- branches/release/libs/range/doc/html/range/reference/adaptors/general_requirements.html (original)
+++ branches/release/libs/range/doc/html/range/reference/adaptors/general_requirements.html 2010-12-26 10:13:43 EST (Sun, 26 Dec 2010)
@@ -24,7 +24,7 @@
</div>
<div class="section">
<div class="titlepage"><div><div><h4 class="title">
-<a name="range.reference.adaptors.general_requirements"></a><a class="link" href="general_requirements.html" title="General Requirements"> General
+<a name="range.reference.adaptors.general_requirements"></a><a class="link" href="general_requirements.html" title="General Requirements">General
Requirements</a>
</h4></div></div></div>
<p>
Modified: branches/release/libs/range/doc/html/range/reference/adaptors/introduction.html
==============================================================================
--- branches/release/libs/range/doc/html/range/reference/adaptors/introduction.html (original)
+++ branches/release/libs/range/doc/html/range/reference/adaptors/introduction.html 2010-12-26 10:13:43 EST (Sun, 26 Dec 2010)
@@ -24,7 +24,7 @@
</div>
<div class="section">
<div class="titlepage"><div><div><h4 class="title">
-<a name="range.reference.adaptors.introduction"></a><a class="link" href="introduction.html" title="Introduction and motivation"> Introduction
+<a name="range.reference.adaptors.introduction"></a><a class="link" href="introduction.html" title="Introduction and motivation">Introduction
and motivation</a>
</h4></div></div></div>
<p>
@@ -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.introduction.composition_of_adaptors"></a><h6>
-<a name="id771349"></a>
+<a name="id670426"></a>
<a class="link" href="introduction.html#range.reference.adaptors.introduction.composition_of_adaptors">Composition
of Adaptors</a>
</h6>
@@ -169,7 +169,7 @@
is the design solution to this problem.
</p>
<a name="range.reference.adaptors.introduction.range_adaptor_alternative_to_copy_if_algorithm"></a><h6>
-<a name="id771666"></a>
+<a name="id670736"></a>
<a class="link" href="introduction.html#range.reference.adaptors.introduction.range_adaptor_alternative_to_copy_if_algorithm">Range
Adaptor alternative to copy_if algorithm</a>
</h6>
@@ -186,7 +186,7 @@
<p>
</p>
<a name="range.reference.adaptors.introduction.range_adaptor_alternative_to_count_if_algorithm"></a><h6>
-<a name="id771832"></a>
+<a name="id670900"></a>
<a class="link" href="introduction.html#range.reference.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/reference.html
==============================================================================
--- branches/release/libs/range/doc/html/range/reference/adaptors/reference.html (original)
+++ branches/release/libs/range/doc/html/range/reference/adaptors/reference.html 2010-12-26 10:13:43 EST (Sun, 26 Dec 2010)
@@ -24,27 +24,24 @@
</div>
<div class="section">
<div class="titlepage"><div><div><h4 class="title">
-<a name="range.reference.adaptors.reference"></a><a class="link" href="reference.html" title="Reference"> Reference</a>
+<a name="range.reference.adaptors.reference"></a><a class="link" href="reference.html" title="Reference">Reference</a>
</h4></div></div></div>
<div class="toc"><dl>
-<dt><span class="section"><a href="reference/adjacent_filtered.html">
- adjacent_filtered</a></span></dt>
-<dt><span class="section"> copied</span></dt>
-<dt><span class="section"> filtered</span></dt>
-<dt><span class="section"> indexed</span></dt>
-<dt><span class="section"> indirected</span></dt>
-<dt><span class="section"> map_keys</span></dt>
-<dt><span class="section"> map_values</span></dt>
-<dt><span class="section"> replaced</span></dt>
-<dt><span class="section"><a href="reference/replaced_if.html">
- replaced_if</a></span></dt>
-<dt><span class="section"> reversed</span></dt>
-<dt><span class="section"> sliced</span></dt>
-<dt><span class="section"> strided</span></dt>
-<dt><span class="section"> tokenized</span></dt>
-<dt><span class="section"><a href="reference/transformed.html">
- transformed</a></span></dt>
-<dt><span class="section"> uniqued</span></dt>
+<dt><span class="section">adjacent_filtered</span></dt>
+<dt><span class="section">copied</span></dt>
+<dt><span class="section">filtered</span></dt>
+<dt><span class="section">indexed</span></dt>
+<dt><span class="section">indirected</span></dt>
+<dt><span class="section">map_keys</span></dt>
+<dt><span class="section">map_values</span></dt>
+<dt><span class="section">replaced</span></dt>
+<dt><span class="section">replaced_if</span></dt>
+<dt><span class="section">reversed</span></dt>
+<dt><span class="section">sliced</span></dt>
+<dt><span class="section">strided</span></dt>
+<dt><span class="section">tokenized</span></dt>
+<dt><span class="section">transformed</span></dt>
+<dt><span class="section">uniqued</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/adaptors/reference/adjacent_filtered.html
==============================================================================
--- branches/release/libs/range/doc/html/range/reference/adaptors/reference/adjacent_filtered.html (original)
+++ branches/release/libs/range/doc/html/range/reference/adaptors/reference/adjacent_filtered.html 2010-12-26 10:13:43 EST (Sun, 26 Dec 2010)
@@ -24,11 +24,10 @@
</div>
<div class="section">
<div class="titlepage"><div><div><h5 class="title">
-<a name="range.reference.adaptors.reference.adjacent_filtered"></a><a class="link" href="adjacent_filtered.html" title="adjacent_filtered">
- adjacent_filtered</a>
+<a name="range.reference.adaptors.reference.adjacent_filtered"></a><a class="link" href="adjacent_filtered.html" title="adjacent_filtered">adjacent_filtered</a>
</h5></div></div></div>
-<div class="toc"><dl><dt><span class="section"><a href="adjacent_filtered.html#range.reference.adaptors.reference.adjacent_filtered.adjacent_filtered_example">
- adjacent_filtered example</a></span></dt></dl></div>
+<div class="toc"><dl><dt><span class="section"><a href="adjacent_filtered.html#range.reference.adaptors.reference.adjacent_filtered.adjacent_filtered_example">adjacent_filtered
+ example</a></span></dt></dl></div>
<div class="informaltable"><table class="table">
<colgroup>
<col>
@@ -95,6 +94,9 @@
Pass Range</a>
</li>
<li class="listitem">
+ <span class="bold"><strong>Return Type:</strong></span> <code class="computeroutput"><span class="identifier">boost</span><span class="special">::</span><span class="identifier">adjacent_filtered_range</span><span class="special"><</span><span class="identifier">typeof</span><span class="special">(</span><span class="identifier">rng</span><span class="special">)></span></code>
+ </li>
+<li class="listitem">
<span class="bold"><strong>Returned Range Category:</strong></span> The minimum
of the range category of <code class="computeroutput"><span class="identifier">rng</span></code>
and <a class="link" href="../../../concepts/forward_range.html" title="Forward Range">Forward Range</a>
@@ -102,8 +104,8 @@
</ul></div>
<div class="section">
<div class="titlepage"><div><div><h6 class="title">
-<a name="range.reference.adaptors.reference.adjacent_filtered.adjacent_filtered_example"></a><a class="link" href="adjacent_filtered.html#range.reference.adaptors.reference.adjacent_filtered.adjacent_filtered_example" title="adjacent_filtered example">
- adjacent_filtered example</a>
+<a name="range.reference.adaptors.reference.adjacent_filtered.adjacent_filtered_example"></a><a class="link" href="adjacent_filtered.html#range.reference.adaptors.reference.adjacent_filtered.adjacent_filtered_example" title="adjacent_filtered example">adjacent_filtered
+ example</a>
</h6></div></div></div>
<p>
Modified: branches/release/libs/range/doc/html/range/reference/adaptors/reference/copied.html
==============================================================================
--- branches/release/libs/range/doc/html/range/reference/adaptors/reference/copied.html (original)
+++ branches/release/libs/range/doc/html/range/reference/adaptors/reference/copied.html 2010-12-26 10:13:43 EST (Sun, 26 Dec 2010)
@@ -24,10 +24,10 @@
</div>
<div class="section">
<div class="titlepage"><div><div><h5 class="title">
-<a name="range.reference.adaptors.reference.copied"></a><a class="link" href="copied.html" title="copied"> copied</a>
+<a name="range.reference.adaptors.reference.copied"></a><a class="link" href="copied.html" title="copied">copied</a>
</h5></div></div></div>
-<div class="toc"><dl><dt><span class="section"><a href="copied.html#range.reference.adaptors.reference.copied.copied_example">
- copied example</a></span></dt></dl></div>
+<div class="toc"><dl><dt><span class="section"><a href="copied.html#range.reference.adaptors.reference.copied.copied_example">copied
+ example</a></span></dt></dl></div>
<div class="informaltable"><table class="table">
<colgroup>
<col>
@@ -101,8 +101,8 @@
</ul></div>
<div class="section">
<div class="titlepage"><div><div><h6 class="title">
-<a name="range.reference.adaptors.reference.copied.copied_example"></a><a class="link" href="copied.html#range.reference.adaptors.reference.copied.copied_example" title="copied example">
- copied example</a>
+<a name="range.reference.adaptors.reference.copied.copied_example"></a><a class="link" href="copied.html#range.reference.adaptors.reference.copied.copied_example" title="copied example">copied
+ example</a>
</h6></div></div></div>
<p>
Modified: branches/release/libs/range/doc/html/range/reference/adaptors/reference/filtered.html
==============================================================================
--- branches/release/libs/range/doc/html/range/reference/adaptors/reference/filtered.html (original)
+++ branches/release/libs/range/doc/html/range/reference/adaptors/reference/filtered.html 2010-12-26 10:13:43 EST (Sun, 26 Dec 2010)
@@ -24,10 +24,10 @@
</div>
<div class="section">
<div class="titlepage"><div><div><h5 class="title">
-<a name="range.reference.adaptors.reference.filtered"></a><a class="link" href="filtered.html" title="filtered"> filtered</a>
+<a name="range.reference.adaptors.reference.filtered"></a><a class="link" href="filtered.html" title="filtered">filtered</a>
</h5></div></div></div>
-<div class="toc"><dl><dt><span class="section"><a href="filtered.html#range.reference.adaptors.reference.filtered.filtered_example">
- filtered example</a></span></dt></dl></div>
+<div class="toc"><dl><dt><span class="section"><a href="filtered.html#range.reference.adaptors.reference.filtered.filtered_example">filtered
+ example</a></span></dt></dl></div>
<div class="informaltable"><table class="table">
<colgroup>
<col>
@@ -93,6 +93,9 @@
Range</a>
</li>
<li class="listitem">
+ <span class="bold"><strong>Range Return Type:</strong></span> <code class="computeroutput"><span class="identifier">boost</span><span class="special">::</span><span class="identifier">filtered_range</span><span class="special"><</span><span class="identifier">typeof</span><span class="special">(</span><span class="identifier">rng</span><span class="special">)></span></code>
+ </li>
+<li class="listitem">
<span class="bold"><strong>Returned Range Category:</strong></span> The minimum
of the range category of <code class="computeroutput"><span class="identifier">rng</span></code>
and <a class="link" href="../../../concepts/bidirectional_range.html" title="Bidirectional Range">Bidirectional
@@ -101,8 +104,8 @@
</ul></div>
<div class="section">
<div class="titlepage"><div><div><h6 class="title">
-<a name="range.reference.adaptors.reference.filtered.filtered_example"></a><a class="link" href="filtered.html#range.reference.adaptors.reference.filtered.filtered_example" title="filtered example">
- filtered example</a>
+<a name="range.reference.adaptors.reference.filtered.filtered_example"></a><a class="link" href="filtered.html#range.reference.adaptors.reference.filtered.filtered_example" title="filtered example">filtered
+ example</a>
</h6></div></div></div>
<p>
Modified: branches/release/libs/range/doc/html/range/reference/adaptors/reference/indexed.html
==============================================================================
--- branches/release/libs/range/doc/html/range/reference/adaptors/reference/indexed.html (original)
+++ branches/release/libs/range/doc/html/range/reference/adaptors/reference/indexed.html 2010-12-26 10:13:43 EST (Sun, 26 Dec 2010)
@@ -24,10 +24,10 @@
</div>
<div class="section">
<div class="titlepage"><div><div><h5 class="title">
-<a name="range.reference.adaptors.reference.indexed"></a><a class="link" href="indexed.html" title="indexed"> indexed</a>
+<a name="range.reference.adaptors.reference.indexed"></a><a class="link" href="indexed.html" title="indexed">indexed</a>
</h5></div></div></div>
-<div class="toc"><dl><dt><span class="section"><a href="indexed.html#range.reference.adaptors.reference.indexed.indexed_example">
- indexed example</a></span></dt></dl></div>
+<div class="toc"><dl><dt><span class="section"><a href="indexed.html#range.reference.adaptors.reference.indexed.indexed_example">indexed
+ example</a></span></dt></dl></div>
<div class="informaltable"><table class="table">
<colgroup>
<col>
@@ -87,14 +87,17 @@
Pass Range</a>
</li>
<li class="listitem">
+ <span class="bold"><strong>Range Return Type:</strong></span> <code class="computeroutput"><span class="identifier">boost</span><span class="special">::</span><span class="identifier">indexed_range</span><span class="special"><</span><span class="identifier">typeof</span><span class="special">(</span><span class="identifier">rng</span><span class="special">)></span></code>
+ </li>
+<li class="listitem">
<span class="bold"><strong>Returned Range Category:</strong></span> The range
category of <code class="computeroutput"><span class="identifier">rng</span></code>
</li>
</ul></div>
<div class="section">
<div class="titlepage"><div><div><h6 class="title">
-<a name="range.reference.adaptors.reference.indexed.indexed_example"></a><a class="link" href="indexed.html#range.reference.adaptors.reference.indexed.indexed_example" title="indexed example">
- indexed example</a>
+<a name="range.reference.adaptors.reference.indexed.indexed_example"></a><a class="link" href="indexed.html#range.reference.adaptors.reference.indexed.indexed_example" title="indexed example">indexed
+ example</a>
</h6></div></div></div>
<p>
Modified: branches/release/libs/range/doc/html/range/reference/adaptors/reference/indirected.html
==============================================================================
--- branches/release/libs/range/doc/html/range/reference/adaptors/reference/indirected.html (original)
+++ branches/release/libs/range/doc/html/range/reference/adaptors/reference/indirected.html 2010-12-26 10:13:43 EST (Sun, 26 Dec 2010)
@@ -24,10 +24,10 @@
</div>
<div class="section">
<div class="titlepage"><div><div><h5 class="title">
-<a name="range.reference.adaptors.reference.indirected"></a><a class="link" href="indirected.html" title="indirected"> indirected</a>
+<a name="range.reference.adaptors.reference.indirected"></a><a class="link" href="indirected.html" title="indirected">indirected</a>
</h5></div></div></div>
-<div class="toc"><dl><dt><span class="section"><a href="indirected.html#range.reference.adaptors.reference.indirected.indirected_example">
- indirected example</a></span></dt></dl></div>
+<div class="toc"><dl><dt><span class="section"><a href="indirected.html#range.reference.adaptors.reference.indirected.indirected_example">indirected
+ example</a></span></dt></dl></div>
<div class="informaltable"><table class="table">
<colgroup>
<col>
@@ -91,14 +91,17 @@
Pass Range</a>
</li>
<li class="listitem">
+ <span class="bold"><strong>Range Return Type:</strong></span> <code class="computeroutput"><span class="identifier">boost</span><span class="special">::</span><span class="identifier">indirected_range</span><span class="special"><</span><span class="identifier">typeof</span><span class="special">(</span><span class="identifier">rng</span><span class="special">)></span></code>
+ </li>
+<li class="listitem">
<span class="bold"><strong>Returned Range Category:</strong></span> The range
category of <code class="computeroutput"><span class="identifier">rng</span></code>
</li>
</ul></div>
<div class="section">
<div class="titlepage"><div><div><h6 class="title">
-<a name="range.reference.adaptors.reference.indirected.indirected_example"></a><a class="link" href="indirected.html#range.reference.adaptors.reference.indirected.indirected_example" title="indirected example">
- indirected example</a>
+<a name="range.reference.adaptors.reference.indirected.indirected_example"></a><a class="link" href="indirected.html#range.reference.adaptors.reference.indirected.indirected_example" title="indirected example">indirected
+ example</a>
</h6></div></div></div>
<p>
Modified: branches/release/libs/range/doc/html/range/reference/adaptors/reference/map_keys.html
==============================================================================
--- branches/release/libs/range/doc/html/range/reference/adaptors/reference/map_keys.html (original)
+++ branches/release/libs/range/doc/html/range/reference/adaptors/reference/map_keys.html 2010-12-26 10:13:43 EST (Sun, 26 Dec 2010)
@@ -24,10 +24,10 @@
</div>
<div class="section">
<div class="titlepage"><div><div><h5 class="title">
-<a name="range.reference.adaptors.reference.map_keys"></a><a class="link" href="map_keys.html" title="map_keys"> map_keys</a>
+<a name="range.reference.adaptors.reference.map_keys"></a><a class="link" href="map_keys.html" title="map_keys">map_keys</a>
</h5></div></div></div>
-<div class="toc"><dl><dt><span class="section"><a href="map_keys.html#range.reference.adaptors.reference.map_keys.map_keys_example">
- map_keys example</a></span></dt></dl></div>
+<div class="toc"><dl><dt><span class="section"><a href="map_keys.html#range.reference.adaptors.reference.map_keys.map_keys_example">map_keys
+ example</a></span></dt></dl></div>
<div class="informaltable"><table class="table">
<colgroup>
<col>
@@ -90,14 +90,17 @@
Pass Range</a>
</li>
<li class="listitem">
+ <span class="bold"><strong>Range Return Type:</strong></span> <code class="computeroutput"><span class="identifier">boost</span><span class="special">::</span><span class="identifier">select_first_range</span><span class="special"><</span><span class="identifier">typeof</span><span class="special">(</span><span class="identifier">rng</span><span class="special">)></span></code>
+ </li>
+<li class="listitem">
<span class="bold"><strong>Returned Range Category:</strong></span> The range
category of <code class="computeroutput"><span class="identifier">rng</span></code>.
</li>
</ul></div>
<div class="section">
<div class="titlepage"><div><div><h6 class="title">
-<a name="range.reference.adaptors.reference.map_keys.map_keys_example"></a><a class="link" href="map_keys.html#range.reference.adaptors.reference.map_keys.map_keys_example" title="map_keys example">
- map_keys example</a>
+<a name="range.reference.adaptors.reference.map_keys.map_keys_example"></a><a class="link" href="map_keys.html#range.reference.adaptors.reference.map_keys.map_keys_example" title="map_keys example">map_keys
+ example</a>
</h6></div></div></div>
<p>
Modified: branches/release/libs/range/doc/html/range/reference/adaptors/reference/map_values.html
==============================================================================
--- branches/release/libs/range/doc/html/range/reference/adaptors/reference/map_values.html (original)
+++ branches/release/libs/range/doc/html/range/reference/adaptors/reference/map_values.html 2010-12-26 10:13:43 EST (Sun, 26 Dec 2010)
@@ -24,10 +24,10 @@
</div>
<div class="section">
<div class="titlepage"><div><div><h5 class="title">
-<a name="range.reference.adaptors.reference.map_values"></a><a class="link" href="map_values.html" title="map_values"> map_values</a>
+<a name="range.reference.adaptors.reference.map_values"></a><a class="link" href="map_values.html" title="map_values">map_values</a>
</h5></div></div></div>
-<div class="toc"><dl><dt><span class="section"><a href="map_values.html#range.reference.adaptors.reference.map_values.map_values_example">
- map_values example</a></span></dt></dl></div>
+<div class="toc"><dl><dt><span class="section"><a href="map_values.html#range.reference.adaptors.reference.map_values.map_values_example">map_values
+ example</a></span></dt></dl></div>
<div class="informaltable"><table class="table">
<colgroup>
<col>
@@ -90,14 +90,19 @@
Pass Range</a>
</li>
<li class="listitem">
+ <span class="bold"><strong>Range Return Type:</strong></span> for constant
+ ranges, <code class="computeroutput"><span class="identifier">boost</span><span class="special">::</span><span class="identifier">select_second_const</span><span class="special"><</span><span class="identifier">typeof</span><span class="special">(</span><span class="identifier">rng</span><span class="special">)></span></code>
+ otherwise <code class="computeroutput"><span class="identifier">boost</span><span class="special">:</span><span class="identifier">select_second_mutable</span><span class="special"><</span><span class="identifier">typeof</span><span class="special">(</span><span class="identifier">rng</span><span class="special">)></span></code>
+ </li>
+<li class="listitem">
<span class="bold"><strong>Returned Range Category:</strong></span> The range
category of <code class="computeroutput"><span class="identifier">rng</span></code>.
</li>
</ul></div>
<div class="section">
<div class="titlepage"><div><div><h6 class="title">
-<a name="range.reference.adaptors.reference.map_values.map_values_example"></a><a class="link" href="map_values.html#range.reference.adaptors.reference.map_values.map_values_example" title="map_values example">
- map_values example</a>
+<a name="range.reference.adaptors.reference.map_values.map_values_example"></a><a class="link" href="map_values.html#range.reference.adaptors.reference.map_values.map_values_example" title="map_values example">map_values
+ example</a>
</h6></div></div></div>
<p>
Modified: branches/release/libs/range/doc/html/range/reference/adaptors/reference/replaced.html
==============================================================================
--- branches/release/libs/range/doc/html/range/reference/adaptors/reference/replaced.html (original)
+++ branches/release/libs/range/doc/html/range/reference/adaptors/reference/replaced.html 2010-12-26 10:13:43 EST (Sun, 26 Dec 2010)
@@ -24,10 +24,10 @@
</div>
<div class="section">
<div class="titlepage"><div><div><h5 class="title">
-<a name="range.reference.adaptors.reference.replaced"></a><a class="link" href="replaced.html" title="replaced"> replaced</a>
+<a name="range.reference.adaptors.reference.replaced"></a><a class="link" href="replaced.html" title="replaced">replaced</a>
</h5></div></div></div>
-<div class="toc"><dl><dt><span class="section"><a href="replaced.html#range.reference.adaptors.reference.replaced.replaced_example">
- replaced example</a></span></dt></dl></div>
+<div class="toc"><dl><dt><span class="section"><a href="replaced.html#range.reference.adaptors.reference.replaced.replaced_example">replaced
+ example</a></span></dt></dl></div>
<div class="informaltable"><table class="table">
<colgroup>
<col>
@@ -78,20 +78,22 @@
</table></div>
<div class="itemizedlist"><ul class="itemizedlist" type="disc">
<li class="listitem">
+<p class="simpara">
<span class="bold"><strong>Precondition:</strong></span>
- <div class="itemizedlist"><ul class="itemizedlist" type="circle">
+ </p>
+<div class="itemizedlist"><ul class="itemizedlist" type="circle">
<li class="listitem">
- <code class="computeroutput"><span class="identifier">new_value</span></code> is
- convertible to the <code class="computeroutput"><span class="identifier">value_type</span></code>
- of the range.
- </li>
-<li class="listitem">
- <code class="computeroutput"><span class="identifier">old_value</span></code> is
- convertible to the <code class="computeroutput"><span class="identifier">value_type</span></code>
- of the range.
- </li>
+ <code class="computeroutput"><span class="identifier">new_value</span></code> is
+ convertible to the <code class="computeroutput"><span class="identifier">value_type</span></code>
+ of the range.
+ </li>
+<li class="listitem">
+ <code class="computeroutput"><span class="identifier">old_value</span></code> is
+ convertible to the <code class="computeroutput"><span class="identifier">value_type</span></code>
+ of the range.
+ </li>
</ul></div>
- </li>
+</li>
<li class="listitem">
<span class="bold"><strong>Postcondition:</strong></span> For all elements
<code class="computeroutput"><span class="identifier">x</span></code> in the returned
@@ -108,14 +110,17 @@
Range</a>
</li>
<li class="listitem">
+ <span class="bold"><strong>Range Return Type:</strong></span> <code class="computeroutput"><span class="identifier">boost</span><span class="special">::</span><span class="identifier">replaced_range</span><span class="special"><</span><span class="identifier">typeof</span><span class="special">(</span><span class="identifier">rng</span><span class="special">)></span></code>
+ </li>
+<li class="listitem">
<span class="bold"><strong>Returned Range Category:</strong></span> The range
category of <code class="computeroutput"><span class="identifier">rng</span></code>.
</li>
</ul></div>
<div class="section">
<div class="titlepage"><div><div><h6 class="title">
-<a name="range.reference.adaptors.reference.replaced.replaced_example"></a><a class="link" href="replaced.html#range.reference.adaptors.reference.replaced.replaced_example" title="replaced example">
- replaced example</a>
+<a name="range.reference.adaptors.reference.replaced.replaced_example"></a><a class="link" href="replaced.html#range.reference.adaptors.reference.replaced.replaced_example" title="replaced example">replaced
+ example</a>
</h6></div></div></div>
<p>
Modified: branches/release/libs/range/doc/html/range/reference/adaptors/reference/replaced_if.html
==============================================================================
--- branches/release/libs/range/doc/html/range/reference/adaptors/reference/replaced_if.html (original)
+++ branches/release/libs/range/doc/html/range/reference/adaptors/reference/replaced_if.html 2010-12-26 10:13:43 EST (Sun, 26 Dec 2010)
@@ -24,11 +24,10 @@
</div>
<div class="section">
<div class="titlepage"><div><div><h5 class="title">
-<a name="range.reference.adaptors.reference.replaced_if"></a><a class="link" href="replaced_if.html" title="replaced_if">
- replaced_if</a>
+<a name="range.reference.adaptors.reference.replaced_if"></a><a class="link" href="replaced_if.html" title="replaced_if">replaced_if</a>
</h5></div></div></div>
-<div class="toc"><dl><dt><span class="section"><a href="replaced_if.html#range.reference.adaptors.reference.replaced_if.replaced_if_example">
- replaced_if example</a></span></dt></dl></div>
+<div class="toc"><dl><dt><span class="section"><a href="replaced_if.html#range.reference.adaptors.reference.replaced_if.replaced_if_example">replaced_if
+ example</a></span></dt></dl></div>
<div class="informaltable"><table class="table">
<colgroup>
<col>
@@ -79,19 +78,21 @@
</table></div>
<div class="itemizedlist"><ul class="itemizedlist" type="disc">
<li class="listitem">
+<p class="simpara">
<span class="bold"><strong>Precondition:</strong></span>
- <div class="itemizedlist"><ul class="itemizedlist" type="circle">
+ </p>
+<div class="itemizedlist"><ul class="itemizedlist" type="circle">
<li class="listitem">
- The range <code class="computeroutput"><span class="identifier">value_type</span></code>
- is convertible to the argument type of <code class="computeroutput"><span class="identifier">pred</span></code>.
- </li>
-<li class="listitem">
- <code class="computeroutput"><span class="identifier">new_value</span></code> is
- convertible to the <code class="computeroutput"><span class="identifier">value_type</span></code>
- of the range.
- </li>
+ The range <code class="computeroutput"><span class="identifier">value_type</span></code>
+ is convertible to the argument type of <code class="computeroutput"><span class="identifier">pred</span></code>.
+ </li>
+<li class="listitem">
+ <code class="computeroutput"><span class="identifier">new_value</span></code> is
+ convertible to the <code class="computeroutput"><span class="identifier">value_type</span></code>
+ of the range.
+ </li>
</ul></div>
- </li>
+</li>
<li class="listitem">
<span class="bold"><strong>Postconditions:</strong></span> For all elements
<code class="computeroutput"><span class="identifier">x</span></code> in the returned
@@ -105,14 +106,17 @@
Range</a>
</li>
<li class="listitem">
+ <span class="bold"><strong>Range Return Type:</strong></span> <code class="computeroutput"><span class="identifier">boost</span><span class="special">::</span><span class="identifier">replaced_if_range</span><span class="special"><</span><span class="identifier">typeof</span><span class="special">(</span><span class="identifier">rng</span><span class="special">)></span></code>
+ </li>
+<li class="listitem">
<span class="bold"><strong>Returned Range Category:</strong></span> The range
category of <code class="computeroutput"><span class="identifier">rng</span></code>.
</li>
</ul></div>
<div class="section">
<div class="titlepage"><div><div><h6 class="title">
-<a name="range.reference.adaptors.reference.replaced_if.replaced_if_example"></a><a class="link" href="replaced_if.html#range.reference.adaptors.reference.replaced_if.replaced_if_example" title="replaced_if example">
- replaced_if example</a>
+<a name="range.reference.adaptors.reference.replaced_if.replaced_if_example"></a><a class="link" href="replaced_if.html#range.reference.adaptors.reference.replaced_if.replaced_if_example" title="replaced_if example">replaced_if
+ example</a>
</h6></div></div></div>
<p>
Modified: branches/release/libs/range/doc/html/range/reference/adaptors/reference/reversed.html
==============================================================================
--- branches/release/libs/range/doc/html/range/reference/adaptors/reference/reversed.html (original)
+++ branches/release/libs/range/doc/html/range/reference/adaptors/reference/reversed.html 2010-12-26 10:13:43 EST (Sun, 26 Dec 2010)
@@ -24,10 +24,10 @@
</div>
<div class="section">
<div class="titlepage"><div><div><h5 class="title">
-<a name="range.reference.adaptors.reference.reversed"></a><a class="link" href="reversed.html" title="reversed"> reversed</a>
+<a name="range.reference.adaptors.reference.reversed"></a><a class="link" href="reversed.html" title="reversed">reversed</a>
</h5></div></div></div>
-<div class="toc"><dl><dt><span class="section"><a href="reversed.html#range.reference.adaptors.reference.reversed.reversed_example">
- reversed example</a></span></dt></dl></div>
+<div class="toc"><dl><dt><span class="section"><a href="reversed.html#range.reference.adaptors.reference.reversed.reversed_example">reversed
+ example</a></span></dt></dl></div>
<div class="informaltable"><table class="table">
<colgroup>
<col>
@@ -83,14 +83,17 @@
Range</a>
</li>
<li class="listitem">
+ <span class="bold"><strong>Range Return Type:</strong></span> <code class="computeroutput"><span class="identifier">boost</span><span class="special">::</span><span class="identifier">reversed_range</span><span class="special"><</span><span class="identifier">typeof</span><span class="special">(</span><span class="identifier">rng</span><span class="special">)></span></code>
+ </li>
+<li class="listitem">
<span class="bold"><strong>Returned Range Category:</strong></span> The range
category of <code class="computeroutput"><span class="identifier">rng</span></code>.
</li>
</ul></div>
<div class="section">
<div class="titlepage"><div><div><h6 class="title">
-<a name="range.reference.adaptors.reference.reversed.reversed_example"></a><a class="link" href="reversed.html#range.reference.adaptors.reference.reversed.reversed_example" title="reversed example">
- reversed example</a>
+<a name="range.reference.adaptors.reference.reversed.reversed_example"></a><a class="link" href="reversed.html#range.reference.adaptors.reference.reversed.reversed_example" title="reversed example">reversed
+ example</a>
</h6></div></div></div>
<p>
Modified: branches/release/libs/range/doc/html/range/reference/adaptors/reference/sliced.html
==============================================================================
--- branches/release/libs/range/doc/html/range/reference/adaptors/reference/sliced.html (original)
+++ branches/release/libs/range/doc/html/range/reference/adaptors/reference/sliced.html 2010-12-26 10:13:43 EST (Sun, 26 Dec 2010)
@@ -24,10 +24,10 @@
</div>
<div class="section">
<div class="titlepage"><div><div><h5 class="title">
-<a name="range.reference.adaptors.reference.sliced"></a><a class="link" href="sliced.html" title="sliced"> sliced</a>
+<a name="range.reference.adaptors.reference.sliced"></a><a class="link" href="sliced.html" title="sliced">sliced</a>
</h5></div></div></div>
-<div class="toc"><dl><dt><span class="section"><a href="sliced.html#range.reference.adaptors.reference.sliced.sliced_example">
- sliced example</a></span></dt></dl></div>
+<div class="toc"><dl><dt><span class="section"><a href="sliced.html#range.reference.adaptors.reference.sliced.sliced_example">sliced
+ example</a></span></dt></dl></div>
<div class="informaltable"><table class="table">
<colgroup>
<col>
@@ -93,14 +93,17 @@
Access Range</a>
</li>
<li class="listitem">
+ <span class="bold"><strong>Range Return Type:</strong></span> <code class="computeroutput"><span class="identifier">boost</span><span class="special">::</span><span class="identifier">sliced_range</span><span class="special"><</span><span class="identifier">typeof</span><span class="special">(</span><span class="identifier">rng</span><span class="special">)></span></code>
+ </li>
+<li class="listitem">
<span class="bold"><strong>Returned Range Category:</strong></span> <a class="link" href="../../../concepts/random_access_range.html" title="Random Access Range">Random
Access Range</a>
</li>
</ul></div>
<div class="section">
<div class="titlepage"><div><div><h6 class="title">
-<a name="range.reference.adaptors.reference.sliced.sliced_example"></a><a class="link" href="sliced.html#range.reference.adaptors.reference.sliced.sliced_example" title="sliced example">
- sliced example</a>
+<a name="range.reference.adaptors.reference.sliced.sliced_example"></a><a class="link" href="sliced.html#range.reference.adaptors.reference.sliced.sliced_example" title="sliced example">sliced
+ example</a>
</h6></div></div></div>
<p>
Modified: branches/release/libs/range/doc/html/range/reference/adaptors/reference/strided.html
==============================================================================
--- branches/release/libs/range/doc/html/range/reference/adaptors/reference/strided.html (original)
+++ branches/release/libs/range/doc/html/range/reference/adaptors/reference/strided.html 2010-12-26 10:13:43 EST (Sun, 26 Dec 2010)
@@ -24,10 +24,10 @@
</div>
<div class="section">
<div class="titlepage"><div><div><h5 class="title">
-<a name="range.reference.adaptors.reference.strided"></a><a class="link" href="strided.html" title="strided"> strided</a>
+<a name="range.reference.adaptors.reference.strided"></a><a class="link" href="strided.html" title="strided">strided</a>
</h5></div></div></div>
-<div class="toc"><dl><dt><span class="section"><a href="strided.html#range.reference.adaptors.reference.strided.strided_example">
- strided example</a></span></dt></dl></div>
+<div class="toc"><dl><dt><span class="section"><a href="strided.html#range.reference.adaptors.reference.strided.strided_example">strided
+ example</a></span></dt></dl></div>
<div class="informaltable"><table class="table">
<colgroup>
<col>
@@ -77,27 +77,27 @@
<div class="itemizedlist"><ul class="itemizedlist" type="disc">
<li class="listitem">
<span class="bold"><strong>Precondition:</strong></span> <code class="computeroutput"><span class="number">0</span>
- <span class="special"><=</span> <span class="identifier">n</span>
- <span class="special">&&</span> <span class="identifier">n</span>
- <span class="special"><</span> <span class="identifier">distance</span><span class="special">(</span><span class="identifier">rng</span><span class="special">)</span></code>
+ <span class="special"><=</span> <span class="identifier">n</span></code>
+ and <code class="computeroutput"><span class="identifier">boost</span><span class="special">::</span><span class="identifier">size</span><span class="special">(</span><span class="identifier">rng</span><span class="special">)</span></code>
+ is a valid expression.
</li>
<li class="listitem">
<span class="bold"><strong>Returns:</strong></span> A new range based on <code class="computeroutput"><span class="identifier">rng</span></code> where traversal is performed
in steps of <code class="computeroutput"><span class="identifier">n</span></code>.
</li>
<li class="listitem">
- <span class="bold"><strong>Range Category:</strong></span> <a class="link" href="../../../concepts/random_access_range.html" title="Random Access Range">Random
- Access Range</a>
+ <span class="bold"><strong>Range Category:</strong></span> <a class="link" href="../../../concepts/single_pass_range.html" title="Single Pass Range">Single
+ Pass Range</a>
</li>
<li class="listitem">
- <span class="bold"><strong>Returned Range Category:</strong></span> <a class="link" href="../../../concepts/random_access_range.html" title="Random Access Range">Random
- Access Range</a>
+ <span class="bold"><strong>Returned Range Category:</strong></span> The range
+ category of <code class="computeroutput"><span class="identifier">rng</span></code>.
</li>
</ul></div>
<div class="section">
<div class="titlepage"><div><div><h6 class="title">
-<a name="range.reference.adaptors.reference.strided.strided_example"></a><a class="link" href="strided.html#range.reference.adaptors.reference.strided.strided_example" title="strided example">
- strided example</a>
+<a name="range.reference.adaptors.reference.strided.strided_example"></a><a class="link" href="strided.html#range.reference.adaptors.reference.strided.strided_example" title="strided example">strided
+ example</a>
</h6></div></div></div>
<p>
Modified: branches/release/libs/range/doc/html/range/reference/adaptors/reference/tokenized.html
==============================================================================
--- branches/release/libs/range/doc/html/range/reference/adaptors/reference/tokenized.html (original)
+++ branches/release/libs/range/doc/html/range/reference/adaptors/reference/tokenized.html 2010-12-26 10:13:43 EST (Sun, 26 Dec 2010)
@@ -24,7 +24,7 @@
</div>
<div class="section">
<div class="titlepage"><div><div><h5 class="title">
-<a name="range.reference.adaptors.reference.tokenized"></a><a class="link" href="tokenized.html" title="tokenized"> tokenized</a>
+<a name="range.reference.adaptors.reference.tokenized"></a><a class="link" href="tokenized.html" title="tokenized">tokenized</a>
</h5></div></div></div>
<div class="informaltable"><table class="table">
<colgroup>
@@ -88,30 +88,32 @@
</table></div>
<div class="itemizedlist"><ul class="itemizedlist" type="disc">
<li class="listitem">
+<p class="simpara">
<span class="bold"><strong>Precondition:</strong></span>
- <div class="itemizedlist"><ul class="itemizedlist" type="circle">
+ </p>
+<div class="itemizedlist"><ul class="itemizedlist" type="circle">
<li class="listitem">
- Let <code class="computeroutput"><span class="identifier">T</span></code> denote
- <code class="computeroutput"><span class="keyword">typename</span> <span class="identifier">range_value</span><span class="special"><</span><span class="identifier">decltype</span><span class="special">(</span><span class="identifier">rng</span><span class="special">)>::</span><span class="identifier">type</span></code>,
- then <code class="computeroutput"><span class="identifier">regex</span></code>
- has the type <code class="computeroutput"><span class="identifier">basic_regex</span><span class="special"><</span><span class="identifier">T</span><span class="special">></span></code> or is implicitly convertible
- to one of these types.
- </li>
-<li class="listitem">
- <code class="computeroutput"><span class="identifier">i</span></code> has the type
- <code class="computeroutput"><span class="keyword">int</span></code>.
- </li>
-<li class="listitem">
- the <code class="computeroutput"><span class="identifier">value_type</span></code>
- of <code class="computeroutput"><span class="identifier">rndRng</span></code> is
- <code class="computeroutput"><span class="keyword">int</span></code>.
- </li>
-<li class="listitem">
- <code class="computeroutput"><span class="identifier">flags</span></code> has the
- type <code class="computeroutput"><span class="identifier">regex_constants</span><span class="special">::</span><span class="identifier">syntax_option_type</span></code>.
- </li>
+ Let <code class="computeroutput"><span class="identifier">T</span></code> denote
+ <code class="computeroutput"><span class="keyword">typename</span> <span class="identifier">range_value</span><span class="special"><</span><span class="identifier">decltype</span><span class="special">(</span><span class="identifier">rng</span><span class="special">)>::</span><span class="identifier">type</span></code>,
+ then <code class="computeroutput"><span class="identifier">regex</span></code> has
+ the type <code class="computeroutput"><span class="identifier">basic_regex</span><span class="special"><</span><span class="identifier">T</span><span class="special">></span></code> or is implicitly convertible
+ to one of these types.
+ </li>
+<li class="listitem">
+ <code class="computeroutput"><span class="identifier">i</span></code> has the type
+ <code class="computeroutput"><span class="keyword">int</span></code>.
+ </li>
+<li class="listitem">
+ the <code class="computeroutput"><span class="identifier">value_type</span></code>
+ of <code class="computeroutput"><span class="identifier">rndRng</span></code> is
+ <code class="computeroutput"><span class="keyword">int</span></code>.
+ </li>
+<li class="listitem">
+ <code class="computeroutput"><span class="identifier">flags</span></code> has the
+ type <code class="computeroutput"><span class="identifier">regex_constants</span><span class="special">::</span><span class="identifier">syntax_option_type</span></code>.
+ </li>
</ul></div>
- </li>
+</li>
<li class="listitem">
<span class="bold"><strong>Returns:</strong></span> A range whose iterators
behave as if they were the original iterators wrapped in <code class="computeroutput"><span class="identifier">regex_token_iterator</span></code>. The first
@@ -129,6 +131,9 @@
Access Range</a>
</li>
<li class="listitem">
+ <span class="bold"><strong>Range Return Type:</strong></span> <code class="computeroutput"><span class="identifier">boost</span><span class="special">::</span><span class="identifier">tokenized_range</span><span class="special"><</span><span class="identifier">typeof</span><span class="special">(</span><span class="identifier">rng</span><span class="special">)></span></code>
+ </li>
+<li class="listitem">
<span class="bold"><strong>Returned Range Category:</strong></span> <a class="link" href="../../../concepts/random_access_range.html" title="Random Access Range">Random
Access Range</a>
</li>
Modified: branches/release/libs/range/doc/html/range/reference/adaptors/reference/transformed.html
==============================================================================
--- branches/release/libs/range/doc/html/range/reference/adaptors/reference/transformed.html (original)
+++ branches/release/libs/range/doc/html/range/reference/adaptors/reference/transformed.html 2010-12-26 10:13:43 EST (Sun, 26 Dec 2010)
@@ -24,11 +24,10 @@
</div>
<div class="section">
<div class="titlepage"><div><div><h5 class="title">
-<a name="range.reference.adaptors.reference.transformed"></a><a class="link" href="transformed.html" title="transformed">
- transformed</a>
+<a name="range.reference.adaptors.reference.transformed"></a><a class="link" href="transformed.html" title="transformed">transformed</a>
</h5></div></div></div>
-<div class="toc"><dl><dt><span class="section"><a href="transformed.html#range.reference.adaptors.reference.transformed.transformed_example">
- transformed example</a></span></dt></dl></div>
+<div class="toc"><dl><dt><span class="section"><a href="transformed.html#range.reference.adaptors.reference.transformed.transformed_example">transformed
+ example</a></span></dt></dl></div>
<div class="informaltable"><table class="table">
<colgroup>
<col>
@@ -97,14 +96,17 @@
Pass Range</a>
</li>
<li class="listitem">
+ <span class="bold"><strong>Range Return Type:</strong></span> <code class="computeroutput"><span class="identifier">boost</span><span class="special">::</span><span class="identifier">transformed_range</span><span class="special"><</span><span class="identifier">typeof</span><span class="special">(</span><span class="identifier">rng</span><span class="special">)></span></code>
+ </li>
+<li class="listitem">
<span class="bold"><strong>Returned Range Category:</strong></span> The range
category of <code class="computeroutput"><span class="identifier">rng</span></code>.
</li>
</ul></div>
<div class="section">
<div class="titlepage"><div><div><h6 class="title">
-<a name="range.reference.adaptors.reference.transformed.transformed_example"></a><a class="link" href="transformed.html#range.reference.adaptors.reference.transformed.transformed_example" title="transformed example">
- transformed example</a>
+<a name="range.reference.adaptors.reference.transformed.transformed_example"></a><a class="link" href="transformed.html#range.reference.adaptors.reference.transformed.transformed_example" title="transformed example">transformed
+ example</a>
</h6></div></div></div>
<p>
Modified: branches/release/libs/range/doc/html/range/reference/adaptors/reference/uniqued.html
==============================================================================
--- branches/release/libs/range/doc/html/range/reference/adaptors/reference/uniqued.html (original)
+++ branches/release/libs/range/doc/html/range/reference/adaptors/reference/uniqued.html 2010-12-26 10:13:43 EST (Sun, 26 Dec 2010)
@@ -7,7 +7,7 @@
<link rel="home" href="../../../../index.html" title="Chapter 1. Range 2.0">
<link rel="up" href="../reference.html" title="Reference">
<link rel="prev" href="transformed.html" title="transformed">
-<link rel="next" href="../../algorithms.html" title="Range Algorithm">
+<link rel="next" href="../../algorithms.html" title="Range Algorithms">
</head>
<body bgcolor="white" text="black" link="#0000FF" vlink="#840084" alink="#0000FF">
<table cellpadding="2" width="100%"><tr>
@@ -24,10 +24,10 @@
</div>
<div class="section">
<div class="titlepage"><div><div><h5 class="title">
-<a name="range.reference.adaptors.reference.uniqued"></a><a class="link" href="uniqued.html" title="uniqued"> uniqued</a>
+<a name="range.reference.adaptors.reference.uniqued"></a><a class="link" href="uniqued.html" title="uniqued">uniqued</a>
</h5></div></div></div>
-<div class="toc"><dl><dt><span class="section"><a href="uniqued.html#range.reference.adaptors.reference.uniqued.uniqued_example">
- uniqued example</a></span></dt></dl></div>
+<div class="toc"><dl><dt><span class="section"><a href="uniqued.html#range.reference.adaptors.reference.uniqued.uniqued_example">uniqued
+ example</a></span></dt></dl></div>
<div class="informaltable"><table class="table">
<colgroup>
<col>
@@ -87,6 +87,9 @@
Range</a>
</li>
<li class="listitem">
+ <span class="bold"><strong>Range Return Type:</strong></span> <code class="computeroutput"><span class="identifier">boost</span><span class="special">::</span><span class="identifier">uniqued_range</span><span class="special"><</span><span class="identifier">typeof</span><span class="special">(</span><span class="identifier">rng</span><span class="special">)></span></code>
+ </li>
+<li class="listitem">
<span class="bold"><strong>Returned Range Category:</strong></span> The minimum
of the range concept of <code class="computeroutput"><span class="identifier">rng</span></code>
and <a class="link" href="../../../concepts/forward_range.html" title="Forward Range">Forward Range</a>.
@@ -94,8 +97,8 @@
</ul></div>
<div class="section">
<div class="titlepage"><div><div><h6 class="title">
-<a name="range.reference.adaptors.reference.uniqued.uniqued_example"></a><a class="link" href="uniqued.html#range.reference.adaptors.reference.uniqued.uniqued_example" title="uniqued example">
- uniqued example</a>
+<a name="range.reference.adaptors.reference.uniqued.uniqued_example"></a><a class="link" href="uniqued.html#range.reference.adaptors.reference.uniqued.uniqued_example" title="uniqued example">uniqued
+ example</a>
</h6></div></div></div>
<p>
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-12-26 10:13:43 EST (Sun, 26 Dec 2010)
@@ -1,13 +1,13 @@
<html>
<head>
<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
-<title>Range Algorithm</title>
+<title>Range Algorithms</title>
<link rel="stylesheet" href="../../../../../../doc/src/boostbook.css" type="text/css">
<meta name="generator" content="DocBook XSL Stylesheets V1.75.2">
<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/reference/uniqued.html" title="uniqued">
-<link rel="next" href="algorithms/range_algorithm_introduction.html" title="Introduction and motivation">
+<link rel="next" href="algorithms/introduction.html" title="Introduction and motivation">
</head>
<body bgcolor="white" text="black" link="#0000FF" vlink="#840084" alink="#0000FF">
<table cellpadding="2" width="100%"><tr>
@@ -20,24 +20,24 @@
</tr></table>
<hr>
<div class="spirit-nav">
-<a accesskey="p" href="adaptors/reference/uniqued.html"><img src="../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../reference.html"><img src="../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="algorithms/range_algorithm_introduction.html"><img src="../../../../../../doc/src/images/next.png" alt="Next"></a>
+<a accesskey="p" href="adaptors/reference/uniqued.html"><img src="../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../reference.html"><img src="../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="algorithms/introduction.html"><img src="../../../../../../doc/src/images/next.png" alt="Next"></a>
</div>
<div class="section">
<div class="titlepage"><div><div><h3 class="title">
-<a name="range.reference.algorithms"></a><a class="link" href="algorithms.html" title="Range Algorithm"> Range Algorithm</a>
+<a name="range.reference.algorithms"></a><a class="link" href="algorithms.html" title="Range Algorithms">Range Algorithms</a>
</h3></div></div></div>
<div class="toc"><dl>
-<dt><span class="section"><a href="algorithms/range_algorithm_introduction.html">
- Introduction and motivation</a></span></dt>
-<dt><span class="section"> Mutating algorithms</span></dt>
-<dt><span class="section"><a href="algorithms/non_mutating.html"> Non-mutating
+<dt><span class="section"><a href="algorithms/introduction.html">Introduction
+ and motivation</a></span></dt>
+<dt><span class="section">Mutating algorithms</span></dt>
+<dt><span class="section"><a href="algorithms/non_mutating.html">Non-mutating
algorithms</a></span></dt>
-<dt><span class="section"> Set algorithms</span></dt>
-<dt><span class="section"> Heap algorithms</span></dt>
-<dt><span class="section"><a href="algorithms/permutation.html"> Permutation
+<dt><span class="section">Set algorithms</span></dt>
+<dt><span class="section">Heap algorithms</span></dt>
+<dt><span class="section"><a href="algorithms/permutation.html">Permutation
algorithms</a></span></dt>
-<dt><span class="section"> New algorithms</span></dt>
-<dt><span class="section"> Numeric algorithms</span></dt>
+<dt><span class="section">New algorithms</span></dt>
+<dt><span class="section">Numeric algorithms</span></dt>
</dl></div>
</div>
<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
@@ -50,7 +50,7 @@
</tr></table>
<hr>
<div class="spirit-nav">
-<a accesskey="p" href="adaptors/reference/uniqued.html"><img src="../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../reference.html"><img src="../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="algorithms/range_algorithm_introduction.html"><img src="../../../../../../doc/src/images/next.png" alt="Next"></a>
+<a accesskey="p" href="adaptors/reference/uniqued.html"><img src="../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../reference.html"><img src="../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="algorithms/introduction.html"><img src="../../../../../../doc/src/images/next.png" alt="Next"></a>
</div>
</body>
</html>
Modified: branches/release/libs/range/doc/html/range/reference/algorithms/heap.html
==============================================================================
--- branches/release/libs/range/doc/html/range/reference/algorithms/heap.html (original)
+++ branches/release/libs/range/doc/html/range/reference/algorithms/heap.html 2010-12-26 10:13:43 EST (Sun, 26 Dec 2010)
@@ -5,7 +5,7 @@
<link rel="stylesheet" href="../../../../../../../doc/src/boostbook.css" type="text/css">
<meta name="generator" content="DocBook XSL Stylesheets V1.75.2">
<link rel="home" href="../../../index.html" title="Chapter 1. Range 2.0">
-<link rel="up" href="../algorithms.html" title="Range Algorithm">
+<link rel="up" href="../algorithms.html" title="Range Algorithms">
<link rel="prev" href="set/set_symmetric_difference.html" title="set_symmetric_difference">
<link rel="next" href="heap/push_heap.html" title="push_heap">
</head>
@@ -24,13 +24,13 @@
</div>
<div class="section">
<div class="titlepage"><div><div><h4 class="title">
-<a name="range.reference.algorithms.heap"></a><a class="link" href="heap.html" title="Heap algorithms"> Heap algorithms</a>
+<a name="range.reference.algorithms.heap"></a><a class="link" href="heap.html" title="Heap algorithms">Heap algorithms</a>
</h4></div></div></div>
<div class="toc"><dl>
-<dt><span class="section"> push_heap</span></dt>
-<dt><span class="section"> pop_heap</span></dt>
-<dt><span class="section"> make_heap</span></dt>
-<dt><span class="section"> sort_heap</span></dt>
+<dt><span class="section">push_heap</span></dt>
+<dt><span class="section">pop_heap</span></dt>
+<dt><span class="section">make_heap</span></dt>
+<dt><span class="section">sort_heap</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/make_heap.html
==============================================================================
--- branches/release/libs/range/doc/html/range/reference/algorithms/heap/make_heap.html (original)
+++ branches/release/libs/range/doc/html/range/reference/algorithms/heap/make_heap.html 2010-12-26 10:13:43 EST (Sun, 26 Dec 2010)
@@ -24,10 +24,10 @@
</div>
<div class="section">
<div class="titlepage"><div><div><h5 class="title">
-<a name="range.reference.algorithms.heap.make_heap"></a><a class="link" href="make_heap.html" title="make_heap"> make_heap</a>
+<a name="range.reference.algorithms.heap.make_heap"></a><a class="link" href="make_heap.html" title="make_heap">make_heap</a>
</h5></div></div></div>
<a name="range.reference.algorithms.heap.make_heap.prototype"></a><h6>
-<a name="id850653"></a>
+<a name="id749200"></a>
<a class="link" href="make_heap.html#range.reference.algorithms.heap.make_heap.prototype">Prototype</a>
</h6>
<p>
@@ -48,7 +48,7 @@
<p>
</p>
<a name="range.reference.algorithms.heap.make_heap.description"></a><h6>
-<a name="id851025"></a>
+<a name="id749575"></a>
<a class="link" href="make_heap.html#range.reference.algorithms.heap.make_heap.description">Description</a>
</h6>
<p>
@@ -60,14 +60,14 @@
the predicate versions.
</p>
<a name="range.reference.algorithms.heap.make_heap.definition"></a><h6>
-<a name="id851103"></a>
+<a name="id749649"></a>
<a class="link" href="make_heap.html#range.reference.algorithms.heap.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.make_heap.requirements"></a><h6>
-<a name="id851174"></a>
+<a name="id749718"></a>
<a class="link" href="make_heap.html#range.reference.algorithms.heap.make_heap.requirements">Requirements</a>
</h6>
<p>
@@ -118,7 +118,7 @@
</li>
</ul></div>
<a name="range.reference.algorithms.heap.make_heap.complexity"></a><h6>
-<a name="id851432"></a>
+<a name="id749966"></a>
<a class="link" href="make_heap.html#range.reference.algorithms.heap.make_heap.complexity">Complexity</a>
</h6>
<p>
Modified: branches/release/libs/range/doc/html/range/reference/algorithms/heap/pop_heap.html
==============================================================================
--- branches/release/libs/range/doc/html/range/reference/algorithms/heap/pop_heap.html (original)
+++ branches/release/libs/range/doc/html/range/reference/algorithms/heap/pop_heap.html 2010-12-26 10:13:43 EST (Sun, 26 Dec 2010)
@@ -24,10 +24,10 @@
</div>
<div class="section">
<div class="titlepage"><div><div><h5 class="title">
-<a name="range.reference.algorithms.heap.pop_heap"></a><a class="link" href="pop_heap.html" title="pop_heap"> pop_heap</a>
+<a name="range.reference.algorithms.heap.pop_heap"></a><a class="link" href="pop_heap.html" title="pop_heap">pop_heap</a>
</h5></div></div></div>
<a name="range.reference.algorithms.heap.pop_heap.prototype"></a><h6>
-<a name="id849634"></a>
+<a name="id748194"></a>
<a class="link" href="pop_heap.html#range.reference.algorithms.heap.pop_heap.prototype">Prototype</a>
</h6>
<p>
@@ -48,7 +48,7 @@
<p>
</p>
<a name="range.reference.algorithms.heap.pop_heap.description"></a><h6>
-<a name="id850006"></a>
+<a name="id748570"></a>
<a class="link" href="pop_heap.html#range.reference.algorithms.heap.pop_heap.description">Description</a>
</h6>
<p>
@@ -62,14 +62,14 @@
the predicate versions.
</p>
<a name="range.reference.algorithms.heap.pop_heap.definition"></a><h6>
-<a name="id850161"></a>
+<a name="id748724"></a>
<a class="link" href="pop_heap.html#range.reference.algorithms.heap.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.pop_heap.requirements"></a><h6>
-<a name="id850232"></a>
+<a name="id748794"></a>
<a class="link" href="pop_heap.html#range.reference.algorithms.heap.pop_heap.requirements">Requirements</a>
</h6>
<p>
@@ -120,7 +120,7 @@
</li>
</ul></div>
<a name="range.reference.algorithms.heap.pop_heap.precondition_"></a><h6>
-<a name="id850490"></a>
+<a name="id749041"></a>
<a class="link" href="pop_heap.html#range.reference.algorithms.heap.pop_heap.precondition_">Precondition:</a>
</h6>
<div class="itemizedlist"><ul class="itemizedlist" type="disc">
@@ -132,7 +132,7 @@
</li>
</ul></div>
<a name="range.reference.algorithms.heap.pop_heap.complexity"></a><h6>
-<a name="id850566"></a>
+<a name="id749116"></a>
<a class="link" href="pop_heap.html#range.reference.algorithms.heap.pop_heap.complexity">Complexity</a>
</h6>
<p>
Modified: branches/release/libs/range/doc/html/range/reference/algorithms/heap/push_heap.html
==============================================================================
--- branches/release/libs/range/doc/html/range/reference/algorithms/heap/push_heap.html (original)
+++ branches/release/libs/range/doc/html/range/reference/algorithms/heap/push_heap.html 2010-12-26 10:13:43 EST (Sun, 26 Dec 2010)
@@ -24,10 +24,10 @@
</div>
<div class="section">
<div class="titlepage"><div><div><h5 class="title">
-<a name="range.reference.algorithms.heap.push_heap"></a><a class="link" href="push_heap.html" title="push_heap"> push_heap</a>
+<a name="range.reference.algorithms.heap.push_heap"></a><a class="link" href="push_heap.html" title="push_heap">push_heap</a>
</h5></div></div></div>
<a name="range.reference.algorithms.heap.push_heap.prototype"></a><h6>
-<a name="id848577"></a>
+<a name="id747150"></a>
<a class="link" href="push_heap.html#range.reference.algorithms.heap.push_heap.prototype">Prototype</a>
</h6>
<p>
@@ -48,7 +48,7 @@
<p>
</p>
<a name="range.reference.algorithms.heap.push_heap.description"></a><h6>
-<a name="id848948"></a>
+<a name="id747526"></a>
<a class="link" href="push_heap.html#range.reference.algorithms.heap.push_heap.description">Description</a>
</h6>
<p>
@@ -62,14 +62,14 @@
the predicate versions.
</p>
<a name="range.reference.algorithms.heap.push_heap.definition"></a><h6>
-<a name="id849108"></a>
+<a name="id747683"></a>
<a class="link" href="push_heap.html#range.reference.algorithms.heap.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.push_heap.requirements"></a><h6>
-<a name="id849179"></a>
+<a name="id747753"></a>
<a class="link" href="push_heap.html#range.reference.algorithms.heap.push_heap.requirements">Requirements</a>
</h6>
<p>
@@ -120,7 +120,7 @@
</li>
</ul></div>
<a name="range.reference.algorithms.heap.push_heap.precondition_"></a><h6>
-<a name="id849437"></a>
+<a name="id748001"></a>
<a class="link" href="push_heap.html#range.reference.algorithms.heap.push_heap.precondition_">Precondition:</a>
</h6>
<div class="itemizedlist"><ul class="itemizedlist" type="disc">
@@ -132,7 +132,7 @@
</li>
</ul></div>
<a name="range.reference.algorithms.heap.push_heap.complexity"></a><h6>
-<a name="id849557"></a>
+<a name="id748121"></a>
<a class="link" href="push_heap.html#range.reference.algorithms.heap.push_heap.complexity">Complexity</a>
</h6>
<p>
Modified: branches/release/libs/range/doc/html/range/reference/algorithms/heap/sort_heap.html
==============================================================================
--- branches/release/libs/range/doc/html/range/reference/algorithms/heap/sort_heap.html (original)
+++ branches/release/libs/range/doc/html/range/reference/algorithms/heap/sort_heap.html 2010-12-26 10:13:43 EST (Sun, 26 Dec 2010)
@@ -24,10 +24,10 @@
</div>
<div class="section">
<div class="titlepage"><div><div><h5 class="title">
-<a name="range.reference.algorithms.heap.sort_heap"></a><a class="link" href="sort_heap.html" title="sort_heap"> sort_heap</a>
+<a name="range.reference.algorithms.heap.sort_heap"></a><a class="link" href="sort_heap.html" title="sort_heap">sort_heap</a>
</h5></div></div></div>
<a name="range.reference.algorithms.heap.sort_heap.prototype"></a><h6>
-<a name="id851509"></a>
+<a name="id750042"></a>
<a class="link" href="sort_heap.html#range.reference.algorithms.heap.sort_heap.prototype">Prototype</a>
</h6>
<p>
@@ -48,7 +48,7 @@
<p>
</p>
<a name="range.reference.algorithms.heap.sort_heap.description"></a><h6>
-<a name="id851881"></a>
+<a name="id750417"></a>
<a class="link" href="sort_heap.html#range.reference.algorithms.heap.sort_heap.description">Description</a>
</h6>
<p>
@@ -61,14 +61,14 @@
the predicate versions.
</p>
<a name="range.reference.algorithms.heap.sort_heap.definition"></a><h6>
-<a name="id851948"></a>
+<a name="id750482"></a>
<a class="link" href="sort_heap.html#range.reference.algorithms.heap.sort_heap.definition">Definition</a>
</h6>
<p>
Defined in the header file <code class="computeroutput"><span class="identifier">boost</span><span class="special">/</span><span class="identifier">range</span><span class="special">/</span><span class="identifier">algorithm</span><span class="special">/</span><span class="identifier">heap_algorithm</span><span class="special">.</span><span class="identifier">hpp</span></code>
</p>
<a name="range.reference.algorithms.heap.sort_heap.requirements"></a><h6>
-<a name="id852018"></a>
+<a name="id750553"></a>
<a class="link" href="sort_heap.html#range.reference.algorithms.heap.sort_heap.requirements">Requirements</a>
</h6>
<p>
@@ -119,14 +119,14 @@
</li>
</ul></div>
<a name="range.reference.algorithms.heap.sort_heap.precondition_"></a><h6>
-<a name="id852276"></a>
+<a name="id750800"></a>
<a class="link" href="sort_heap.html#range.reference.algorithms.heap.sort_heap.precondition_">Precondition:</a>
</h6>
<p>
<code class="computeroutput"><span class="identifier">rng</span></code> is a heap.
</p>
<a name="range.reference.algorithms.heap.sort_heap.complexity"></a><h6>
-<a name="id852312"></a>
+<a name="id750833"></a>
<a class="link" href="sort_heap.html#range.reference.algorithms.heap.sort_heap.complexity">Complexity</a>
</h6>
<p>
Modified: branches/release/libs/range/doc/html/range/reference/algorithms/mutating.html
==============================================================================
--- branches/release/libs/range/doc/html/range/reference/algorithms/mutating.html (original)
+++ branches/release/libs/range/doc/html/range/reference/algorithms/mutating.html 2010-12-26 10:13:43 EST (Sun, 26 Dec 2010)
@@ -5,8 +5,8 @@
<link rel="stylesheet" href="../../../../../../../doc/src/boostbook.css" type="text/css">
<meta name="generator" content="DocBook XSL Stylesheets V1.75.2">
<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">
+<link rel="up" href="../algorithms.html" title="Range Algorithms">
+<link rel="prev" href="introduction.html" title="Introduction and motivation">
<link rel="next" href="mutating/copy.html" title="copy">
</head>
<body bgcolor="white" text="black" link="#0000FF" vlink="#840084" alink="#0000FF">
@@ -20,59 +20,43 @@
</tr></table>
<hr>
<div class="spirit-nav">
-<a accesskey="p" href="range_algorithm_introduction.html"><img src="../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../algorithms.html"><img src="../../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../../index.html"><img src="../../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="mutating/copy.html"><img src="../../../../../../../doc/src/images/next.png" alt="Next"></a>
+<a accesskey="p" href="introduction.html"><img src="../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../algorithms.html"><img src="../../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../../index.html"><img src="../../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="mutating/copy.html"><img src="../../../../../../../doc/src/images/next.png" alt="Next"></a>
</div>
<div class="section">
<div class="titlepage"><div><div><h4 class="title">
-<a name="range.reference.algorithms.mutating"></a><a class="link" href="mutating.html" title="Mutating algorithms"> Mutating algorithms</a>
+<a name="range.reference.algorithms.mutating"></a><a class="link" href="mutating.html" title="Mutating algorithms">Mutating algorithms</a>
</h4></div></div></div>
<div class="toc"><dl>
-<dt><span class="section"> copy</span></dt>
-<dt><span class="section"><a href="mutating/copy_backward.html">
- copy_backward</a></span></dt>
-<dt><span class="section"> fill</span></dt>
-<dt><span class="section"> fill_n</span></dt>
-<dt><span class="section"> generate</span></dt>
-<dt><span class="section"><a href="mutating/inplace_merge.html">
- inplace_merge</a></span></dt>
-<dt><span class="section"> merge</span></dt>
-<dt><span class="section"><a href="mutating/nth_element.html">
- nth_element</a></span></dt>
-<dt><span class="section"><a href="mutating/partial_sort.html">
- partial_sort</a></span></dt>
-<dt><span class="section"> partition</span></dt>
-<dt><span class="section"><a href="mutating/random_shuffle.html">
- random_shuffle</a></span></dt>
-<dt><span class="section"> remove</span></dt>
-<dt><span class="section"><a href="mutating/remove_copy.html">
- remove_copy</a></span></dt>
-<dt><span class="section"><a href="mutating/remove_copy_if.html">
- remove_copy_if</a></span></dt>
-<dt><span class="section"> remove_if</span></dt>
-<dt><span class="section"> replace</span></dt>
-<dt><span class="section"><a href="mutating/replace_copy.html">
- replace_copy</a></span></dt>
-<dt><span class="section"><a href="mutating/replace_copy_if.html">
- replace_copy_if</a></span></dt>
-<dt><span class="section"><a href="mutating/replace_if.html">
- replace_if</a></span></dt>
-<dt><span class="section"> reverse</span></dt>
-<dt><span class="section"><a href="mutating/reverse_copy.html">
- reverse_copy</a></span></dt>
-<dt><span class="section"> rotate</span></dt>
-<dt><span class="section"><a href="mutating/rotate_copy.html">
- rotate_copy</a></span></dt>
-<dt><span class="section"> sort</span></dt>
-<dt><span class="section"><a href="mutating/stable_partition.html">
- stable_partition</a></span></dt>
-<dt><span class="section"><a href="mutating/stable_sort.html">
- stable_sort</a></span></dt>
-<dt><span class="section"><a href="mutating/swap_ranges.html">
- swap_ranges</a></span></dt>
-<dt><span class="section"> transform</span></dt>
-<dt><span class="section"> unique</span></dt>
-<dt><span class="section"><a href="mutating/unique_copy.html">
- unique_copy</a></span></dt>
+<dt><span class="section">copy</span></dt>
+<dt><span class="section">copy_backward</span></dt>
+<dt><span class="section">fill</span></dt>
+<dt><span class="section">fill_n</span></dt>
+<dt><span class="section">generate</span></dt>
+<dt><span class="section">inplace_merge</span></dt>
+<dt><span class="section">merge</span></dt>
+<dt><span class="section">nth_element</span></dt>
+<dt><span class="section">partial_sort</span></dt>
+<dt><span class="section">partition</span></dt>
+<dt><span class="section">random_shuffle</span></dt>
+<dt><span class="section">remove</span></dt>
+<dt><span class="section">remove_copy</span></dt>
+<dt><span class="section">remove_copy_if</span></dt>
+<dt><span class="section">remove_if</span></dt>
+<dt><span class="section">replace</span></dt>
+<dt><span class="section">replace_copy</span></dt>
+<dt><span class="section">replace_copy_if</span></dt>
+<dt><span class="section">replace_if</span></dt>
+<dt><span class="section">reverse</span></dt>
+<dt><span class="section">reverse_copy</span></dt>
+<dt><span class="section">rotate</span></dt>
+<dt><span class="section">rotate_copy</span></dt>
+<dt><span class="section">sort</span></dt>
+<dt><span class="section">stable_partition</span></dt>
+<dt><span class="section">stable_sort</span></dt>
+<dt><span class="section">swap_ranges</span></dt>
+<dt><span class="section">transform</span></dt>
+<dt><span class="section">unique</span></dt>
+<dt><span class="section">unique_copy</span></dt>
</dl></div>
</div>
<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
@@ -85,7 +69,7 @@
</tr></table>
<hr>
<div class="spirit-nav">
-<a accesskey="p" href="range_algorithm_introduction.html"><img src="../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../algorithms.html"><img src="../../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../../index.html"><img src="../../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="mutating/copy.html"><img src="../../../../../../../doc/src/images/next.png" alt="Next"></a>
+<a accesskey="p" href="introduction.html"><img src="../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../algorithms.html"><img src="../../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../../index.html"><img src="../../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="mutating/copy.html"><img src="../../../../../../../doc/src/images/next.png" alt="Next"></a>
</div>
</body>
</html>
Modified: branches/release/libs/range/doc/html/range/reference/algorithms/mutating/copy.html
==============================================================================
--- branches/release/libs/range/doc/html/range/reference/algorithms/mutating/copy.html (original)
+++ branches/release/libs/range/doc/html/range/reference/algorithms/mutating/copy.html 2010-12-26 10:13:43 EST (Sun, 26 Dec 2010)
@@ -24,10 +24,10 @@
</div>
<div class="section">
<div class="titlepage"><div><div><h5 class="title">
-<a name="range.reference.algorithms.mutating.copy"></a><a class="link" href="copy.html" title="copy"> copy</a>
+<a name="range.reference.algorithms.mutating.copy"></a><a class="link" href="copy.html" title="copy">copy</a>
</h5></div></div></div>
<a name="range.reference.algorithms.mutating.copy.prototype"></a><h6>
-<a name="id792360"></a>
+<a name="id692133"></a>
<a class="link" href="copy.html#range.reference.algorithms.mutating.copy.prototype">Prototype</a>
</h6>
<p>
@@ -39,7 +39,7 @@
<p>
</p>
<a name="range.reference.algorithms.mutating.copy.description"></a><h6>
-<a name="id792486"></a>
+<a name="id692261"></a>
<a class="link" href="copy.html#range.reference.algorithms.mutating.copy.description">Description</a>
</h6>
<p>
@@ -50,14 +50,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.mutating.copy.definition"></a><h6>
-<a name="id792616"></a>
+<a name="id692389"></a>
<a class="link" href="copy.html#range.reference.algorithms.mutating.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.mutating.copy.requirements"></a><h6>
-<a name="id792686"></a>
+<a name="id692458"></a>
<a class="link" href="copy.html#range.reference.algorithms.mutating.copy.requirements">Requirements</a>
</h6>
<div class="itemizedlist"><ul class="itemizedlist" type="disc">
@@ -78,7 +78,7 @@
</li>
</ul></div>
<a name="range.reference.algorithms.mutating.copy.precondition_"></a><h6>
-<a name="id792803"></a>
+<a name="id692568"></a>
<a class="link" href="copy.html#range.reference.algorithms.mutating.copy.precondition_">Precondition:</a>
</h6>
<div class="itemizedlist"><ul class="itemizedlist" type="disc">
@@ -92,7 +92,7 @@
</li>
</ul></div>
<a name="range.reference.algorithms.mutating.copy.complexity"></a><h6>
-<a name="id792911"></a>
+<a name="id692674"></a>
<a class="link" href="copy.html#range.reference.algorithms.mutating.copy.complexity">Complexity</a>
</h6>
<p>
Modified: branches/release/libs/range/doc/html/range/reference/algorithms/mutating/copy_backward.html
==============================================================================
--- branches/release/libs/range/doc/html/range/reference/algorithms/mutating/copy_backward.html (original)
+++ branches/release/libs/range/doc/html/range/reference/algorithms/mutating/copy_backward.html 2010-12-26 10:13:43 EST (Sun, 26 Dec 2010)
@@ -24,11 +24,10 @@
</div>
<div class="section">
<div class="titlepage"><div><div><h5 class="title">
-<a name="range.reference.algorithms.mutating.copy_backward"></a><a class="link" href="copy_backward.html" title="copy_backward">
- copy_backward</a>
+<a name="range.reference.algorithms.mutating.copy_backward"></a><a class="link" href="copy_backward.html" title="copy_backward">copy_backward</a>
</h5></div></div></div>
<a name="range.reference.algorithms.mutating.copy_backward.prototype"></a><h6>
-<a name="id792980"></a>
+<a name="id692738"></a>
<a class="link" href="copy_backward.html#range.reference.algorithms.mutating.copy_backward.prototype">Prototype</a>
</h6>
<p>
@@ -42,7 +41,7 @@
<p>
</p>
<a name="range.reference.algorithms.mutating.copy_backward.description"></a><h6>
-<a name="id793107"></a>
+<a name="id692866"></a>
<a class="link" href="copy_backward.html#range.reference.algorithms.mutating.copy_backward.description">Description</a>
</h6>
<p>
@@ -60,14 +59,14 @@
denotes the <span class="bold"><strong>end</strong></span> of the output sequence.
</p>
<a name="range.reference.algorithms.mutating.copy_backward.definition"></a><h6>
-<a name="id793262"></a>
+<a name="id693020"></a>
<a class="link" href="copy_backward.html#range.reference.algorithms.mutating.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.mutating.copy_backward.requirements"></a><h6>
-<a name="id793332"></a>
+<a name="id693090"></a>
<a class="link" href="copy_backward.html#range.reference.algorithms.mutating.copy_backward.requirements">Requirements</a>
</h6>
<div class="itemizedlist"><ul class="itemizedlist" type="disc">
@@ -88,7 +87,7 @@
</li>
</ul></div>
<a name="range.reference.algorithms.mutating.copy_backward.precondition_"></a><h6>
-<a name="id793449"></a>
+<a name="id693200"></a>
<a class="link" href="copy_backward.html#range.reference.algorithms.mutating.copy_backward.precondition_">Precondition:</a>
</h6>
<div class="itemizedlist"><ul class="itemizedlist" type="disc">
@@ -102,7 +101,7 @@
</li>
</ul></div>
<a name="range.reference.algorithms.mutating.copy_backward.complexity"></a><h6>
-<a name="id793557"></a>
+<a name="id693308"></a>
<a class="link" href="copy_backward.html#range.reference.algorithms.mutating.copy_backward.complexity">Complexity</a>
</h6>
<p>
Modified: branches/release/libs/range/doc/html/range/reference/algorithms/mutating/fill.html
==============================================================================
--- branches/release/libs/range/doc/html/range/reference/algorithms/mutating/fill.html (original)
+++ branches/release/libs/range/doc/html/range/reference/algorithms/mutating/fill.html 2010-12-26 10:13:43 EST (Sun, 26 Dec 2010)
@@ -24,10 +24,10 @@
</div>
<div class="section">
<div class="titlepage"><div><div><h5 class="title">
-<a name="range.reference.algorithms.mutating.fill"></a><a class="link" href="fill.html" title="fill"> fill</a>
+<a name="range.reference.algorithms.mutating.fill"></a><a class="link" href="fill.html" title="fill">fill</a>
</h5></div></div></div>
<a name="range.reference.algorithms.mutating.fill.prototype"></a><h6>
-<a name="id793624"></a>
+<a name="id693373"></a>
<a class="link" href="fill.html#range.reference.algorithms.mutating.fill.prototype">Prototype</a>
</h6>
<p>
@@ -39,7 +39,7 @@
<p>
</p>
<a name="range.reference.algorithms.mutating.fill.description"></a><h6>
-<a name="id793761"></a>
+<a name="id693511"></a>
<a class="link" href="fill.html#range.reference.algorithms.mutating.fill.description">Description</a>
</h6>
<p>
@@ -48,14 +48,14 @@
in the range <code class="computeroutput"><span class="identifier">rng</span></code>.
</p>
<a name="range.reference.algorithms.mutating.fill.definition"></a><h6>
-<a name="id793817"></a>
+<a name="id693564"></a>
<a class="link" href="fill.html#range.reference.algorithms.mutating.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.mutating.fill.requirements"></a><h6>
-<a name="id793887"></a>
+<a name="id693634"></a>
<a class="link" href="fill.html#range.reference.algorithms.mutating.fill.requirements">Requirements</a>
</h6>
<div class="itemizedlist"><ul class="itemizedlist" type="disc">
@@ -78,7 +78,7 @@
</li>
</ul></div>
<a name="range.reference.algorithms.mutating.fill.complexity"></a><h6>
-<a name="id794011"></a>
+<a name="id693754"></a>
<a class="link" href="fill.html#range.reference.algorithms.mutating.fill.complexity">Complexity</a>
</h6>
<p>
Modified: branches/release/libs/range/doc/html/range/reference/algorithms/mutating/fill_n.html
==============================================================================
--- branches/release/libs/range/doc/html/range/reference/algorithms/mutating/fill_n.html (original)
+++ branches/release/libs/range/doc/html/range/reference/algorithms/mutating/fill_n.html 2010-12-26 10:13:43 EST (Sun, 26 Dec 2010)
@@ -24,10 +24,10 @@
</div>
<div class="section">
<div class="titlepage"><div><div><h5 class="title">
-<a name="range.reference.algorithms.mutating.fill_n"></a><a class="link" href="fill_n.html" title="fill_n"> fill_n</a>
+<a name="range.reference.algorithms.mutating.fill_n"></a><a class="link" href="fill_n.html" title="fill_n">fill_n</a>
</h5></div></div></div>
<a name="range.reference.algorithms.mutating.fill_n.prototype"></a><h6>
-<a name="id794078"></a>
+<a name="id693816"></a>
<a class="link" href="fill_n.html#range.reference.algorithms.mutating.fill_n.prototype">Prototype</a>
</h6>
<p>
@@ -39,7 +39,7 @@
<p>
</p>
<a name="range.reference.algorithms.mutating.fill_n.description"></a><h6>
-<a name="id794246"></a>
+<a name="id693986"></a>
<a class="link" href="fill_n.html#range.reference.algorithms.mutating.fill_n.description">Description</a>
</h6>
<p>
@@ -47,14 +47,14 @@
<code class="computeroutput"><span class="identifier">val</span></code> to <code class="computeroutput"><span class="identifier">n</span></code> elements in the range <code class="computeroutput"><span class="identifier">rng</span></code> begining with <code class="computeroutput"><span class="identifier">boost</span><span class="special">::</span><span class="identifier">begin</span><span class="special">(</span><span class="identifier">rng</span><span class="special">)</span></code>.
</p>
<a name="range.reference.algorithms.mutating.fill_n.definition"></a><h6>
-<a name="id794344"></a>
+<a name="id694082"></a>
<a class="link" href="fill_n.html#range.reference.algorithms.mutating.fill_n.definition">Definition</a>
</h6>
<p>
Defined in the header file <code class="computeroutput"><span class="identifier">boost</span><span class="special">/</span><span class="identifier">range</span><span class="special">/</span><span class="identifier">algorithm</span><span class="special">/</span><span class="identifier">fill_n</span><span class="special">.</span><span class="identifier">hpp</span></code>
</p>
<a name="range.reference.algorithms.mutating.fill_n.requirements"></a><h6>
-<a name="id794414"></a>
+<a name="id694152"></a>
<a class="link" href="fill_n.html#range.reference.algorithms.mutating.fill_n.requirements">Requirements</a>
</h6>
<div class="itemizedlist"><ul class="itemizedlist" type="disc">
@@ -77,7 +77,7 @@
</li>
</ul></div>
<a name="range.reference.algorithms.mutating.fill_n.complexity"></a><h6>
-<a name="id794538"></a>
+<a name="id694271"></a>
<a class="link" href="fill_n.html#range.reference.algorithms.mutating.fill_n.complexity">Complexity</a>
</h6>
<p>
Modified: branches/release/libs/range/doc/html/range/reference/algorithms/mutating/generate.html
==============================================================================
--- branches/release/libs/range/doc/html/range/reference/algorithms/mutating/generate.html (original)
+++ branches/release/libs/range/doc/html/range/reference/algorithms/mutating/generate.html 2010-12-26 10:13:43 EST (Sun, 26 Dec 2010)
@@ -24,10 +24,10 @@
</div>
<div class="section">
<div class="titlepage"><div><div><h5 class="title">
-<a name="range.reference.algorithms.mutating.generate"></a><a class="link" href="generate.html" title="generate"> generate</a>
+<a name="range.reference.algorithms.mutating.generate"></a><a class="link" href="generate.html" title="generate">generate</a>
</h5></div></div></div>
<a name="range.reference.algorithms.mutating.generate.prototype"></a><h6>
-<a name="id794592"></a>
+<a name="id694321"></a>
<a class="link" href="generate.html#range.reference.algorithms.mutating.generate.prototype">Prototype</a>
</h6>
<p>
@@ -42,7 +42,7 @@
<p>
</p>
<a name="range.reference.algorithms.mutating.generate.description"></a><h6>
-<a name="id794827"></a>
+<a name="id694559"></a>
<a class="link" href="generate.html#range.reference.algorithms.mutating.generate.description">Description</a>
</h6>
<p>
@@ -52,14 +52,14 @@
Returns the resultant range.
</p>
<a name="range.reference.algorithms.mutating.generate.definition"></a><h6>
-<a name="id794889"></a>
+<a name="id694619"></a>
<a class="link" href="generate.html#range.reference.algorithms.mutating.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.mutating.generate.requirements"></a><h6>
-<a name="id794958"></a>
+<a name="id694688"></a>
<a class="link" href="generate.html#range.reference.algorithms.mutating.generate.requirements">Requirements</a>
</h6>
<div class="itemizedlist"><ul class="itemizedlist" type="disc">
@@ -83,7 +83,7 @@
</li>
</ul></div>
<a name="range.reference.algorithms.mutating.generate.precondition_"></a><h6>
-<a name="id795093"></a>
+<a name="id694819"></a>
<a class="link" href="generate.html#range.reference.algorithms.mutating.generate.precondition_">Precondition:</a>
</h6>
<div class="itemizedlist"><ul class="itemizedlist" type="disc">
@@ -97,7 +97,7 @@
</li>
</ul></div>
<a name="range.reference.algorithms.mutating.generate.complexity"></a><h6>
-<a name="id795201"></a>
+<a name="id694924"></a>
<a class="link" href="generate.html#range.reference.algorithms.mutating.generate.complexity">Complexity</a>
</h6>
<p>
Modified: branches/release/libs/range/doc/html/range/reference/algorithms/mutating/inplace_merge.html
==============================================================================
--- branches/release/libs/range/doc/html/range/reference/algorithms/mutating/inplace_merge.html (original)
+++ branches/release/libs/range/doc/html/range/reference/algorithms/mutating/inplace_merge.html 2010-12-26 10:13:43 EST (Sun, 26 Dec 2010)
@@ -24,11 +24,10 @@
</div>
<div class="section">
<div class="titlepage"><div><div><h5 class="title">
-<a name="range.reference.algorithms.mutating.inplace_merge"></a><a class="link" href="inplace_merge.html" title="inplace_merge">
- inplace_merge</a>
+<a name="range.reference.algorithms.mutating.inplace_merge"></a><a class="link" href="inplace_merge.html" title="inplace_merge">inplace_merge</a>
</h5></div></div></div>
<a name="range.reference.algorithms.mutating.inplace_merge.prototype"></a><h6>
-<a name="id795269"></a>
+<a name="id694988"></a>
<a class="link" href="inplace_merge.html#range.reference.algorithms.mutating.inplace_merge.prototype">Prototype</a>
</h6>
<p>
@@ -59,7 +58,7 @@
<p>
</p>
<a name="range.reference.algorithms.mutating.inplace_merge.description"></a><h6>
-<a name="id795819"></a>
+<a name="id695546"></a>
<a class="link" href="inplace_merge.html#range.reference.algorithms.mutating.inplace_merge.description">Description</a>
</h6>
<p>
@@ -72,14 +71,14 @@
input range is preserved.
</p>
<a name="range.reference.algorithms.mutating.inplace_merge.definition"></a><h6>
-<a name="id796037"></a>
+<a name="id695763"></a>
<a class="link" href="inplace_merge.html#range.reference.algorithms.mutating.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.mutating.inplace_merge.requirements"></a><h6>
-<a name="id796108"></a>
+<a name="id695833"></a>
<a class="link" href="inplace_merge.html#range.reference.algorithms.mutating.inplace_merge.requirements">Requirements</a>
</h6>
<p>
@@ -116,11 +115,11 @@
argument types.
</p>
<a name="range.reference.algorithms.mutating.inplace_merge.precondition_"></a><h6>
-<a name="id796370"></a>
+<a name="id696088"></a>
<a class="link" href="inplace_merge.html#range.reference.algorithms.mutating.inplace_merge.precondition_">Precondition:</a>
</h6>
<a name="range.reference.algorithms.mutating.inplace_merge.for_the_non_predicate_version_"></a><h6>
-<a name="id796394"></a>
+<a name="id696108"></a>
<a class="link" href="inplace_merge.html#range.reference.algorithms.mutating.inplace_merge.for_the_non_predicate_version_">For
the non-predicate version:</a>
</h6>
@@ -143,7 +142,7 @@
</li>
</ul></div>
<a name="range.reference.algorithms.mutating.inplace_merge.for_the_predicate_version_"></a><h6>
-<a name="id796657"></a>
+<a name="id696369"></a>
<a class="link" href="inplace_merge.html#range.reference.algorithms.mutating.inplace_merge.for_the_predicate_version_">For
the predicate version:</a>
</h6>
@@ -164,7 +163,7 @@
</li>
</ul></div>
<a name="range.reference.algorithms.mutating.inplace_merge.complexity"></a><h6>
-<a name="id796940"></a>
+<a name="id696654"></a>
<a class="link" href="inplace_merge.html#range.reference.algorithms.mutating.inplace_merge.complexity">Complexity</a>
</h6>
<p>
Modified: branches/release/libs/range/doc/html/range/reference/algorithms/mutating/merge.html
==============================================================================
--- branches/release/libs/range/doc/html/range/reference/algorithms/mutating/merge.html (original)
+++ branches/release/libs/range/doc/html/range/reference/algorithms/mutating/merge.html 2010-12-26 10:13:43 EST (Sun, 26 Dec 2010)
@@ -24,10 +24,10 @@
</div>
<div class="section">
<div class="titlepage"><div><div><h5 class="title">
-<a name="range.reference.algorithms.mutating.merge"></a><a class="link" href="merge.html" title="merge"> merge</a>
+<a name="range.reference.algorithms.mutating.merge"></a><a class="link" href="merge.html" title="merge">merge</a>
</h5></div></div></div>
<a name="range.reference.algorithms.mutating.merge.prototype"></a><h6>
-<a name="id797020"></a>
+<a name="id696733"></a>
<a class="link" href="merge.html#range.reference.algorithms.mutating.merge.prototype">Prototype</a>
</h6>
<p>
@@ -56,7 +56,7 @@
<p>
</p>
<a name="range.reference.algorithms.mutating.merge.description"></a><h6>
-<a name="id797362"></a>
+<a name="id697080"></a>
<a class="link" href="merge.html#range.reference.algorithms.mutating.merge.description">Description</a>
</h6>
<p>
@@ -75,14 +75,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.mutating.merge.definition"></a><h6>
-<a name="id797539"></a>
+<a name="id697254"></a>
<a class="link" href="merge.html#range.reference.algorithms.mutating.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.mutating.merge.requirements"></a><h6>
-<a name="id797610"></a>
+<a name="id697323"></a>
<a class="link" href="merge.html#range.reference.algorithms.mutating.merge.requirements">Requirements</a>
</h6>
<p>
@@ -150,11 +150,11 @@
</li>
</ul></div>
<a name="range.reference.algorithms.mutating.merge.precondition_"></a><h6>
-<a name="id798144"></a>
+<a name="id697845"></a>
<a class="link" href="merge.html#range.reference.algorithms.mutating.merge.precondition_">Precondition:</a>
</h6>
<a name="range.reference.algorithms.mutating.merge.for_the_non_predicate_version_"></a><h6>
-<a name="id798168"></a>
+<a name="id697864"></a>
<a class="link" href="merge.html#range.reference.algorithms.mutating.merge.for_the_non_predicate_version_">For
the non-predicate version:</a>
</h6>
@@ -194,7 +194,7 @@
</li>
</ul></div>
<a name="range.reference.algorithms.mutating.merge.for_the_predicate_version_"></a><h6>
-<a name="id798633"></a>
+<a name="id698329"></a>
<a class="link" href="merge.html#range.reference.algorithms.mutating.merge.for_the_predicate_version_">For
the predicate version:</a>
</h6>
@@ -230,7 +230,7 @@
</li>
</ul></div>
<a name="range.reference.algorithms.mutating.merge.complexity"></a><h6>
-<a name="id799119"></a>
+<a name="id698819"></a>
<a class="link" href="merge.html#range.reference.algorithms.mutating.merge.complexity">Complexity</a>
</h6>
<p>
Modified: branches/release/libs/range/doc/html/range/reference/algorithms/mutating/nth_element.html
==============================================================================
--- branches/release/libs/range/doc/html/range/reference/algorithms/mutating/nth_element.html (original)
+++ branches/release/libs/range/doc/html/range/reference/algorithms/mutating/nth_element.html 2010-12-26 10:13:43 EST (Sun, 26 Dec 2010)
@@ -24,11 +24,10 @@
</div>
<div class="section">
<div class="titlepage"><div><div><h5 class="title">
-<a name="range.reference.algorithms.mutating.nth_element"></a><a class="link" href="nth_element.html" title="nth_element">
- nth_element</a>
+<a name="range.reference.algorithms.mutating.nth_element"></a><a class="link" href="nth_element.html" title="nth_element">nth_element</a>
</h5></div></div></div>
<a name="range.reference.algorithms.mutating.nth_element.prototype"></a><h6>
-<a name="id799243"></a>
+<a name="id698940"></a>
<a class="link" href="nth_element.html#range.reference.algorithms.mutating.nth_element.prototype">Prototype</a>
</h6>
<p>
@@ -59,7 +58,7 @@
<p>
</p>
<a name="range.reference.algorithms.mutating.nth_element.description"></a><h6>
-<a name="id799756"></a>
+<a name="id699459"></a>
<a class="link" href="nth_element.html#range.reference.algorithms.mutating.nth_element.description">Description</a>
</h6>
<p>
@@ -70,14 +69,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.mutating.nth_element.definition"></a><h6>
-<a name="id799836"></a>
+<a name="id699536"></a>
<a class="link" href="nth_element.html#range.reference.algorithms.mutating.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.mutating.nth_element.requirements"></a><h6>
-<a name="id799906"></a>
+<a name="id699606"></a>
<a class="link" href="nth_element.html#range.reference.algorithms.mutating.nth_element.requirements">Requirements</a>
</h6>
<p>
@@ -128,7 +127,7 @@
</li>
</ul></div>
<a name="range.reference.algorithms.mutating.nth_element.complexity"></a><h6>
-<a name="id800163"></a>
+<a name="id699853"></a>
<a class="link" href="nth_element.html#range.reference.algorithms.mutating.nth_element.complexity">Complexity</a>
</h6>
<p>
Modified: branches/release/libs/range/doc/html/range/reference/algorithms/mutating/partial_sort.html
==============================================================================
--- branches/release/libs/range/doc/html/range/reference/algorithms/mutating/partial_sort.html (original)
+++ branches/release/libs/range/doc/html/range/reference/algorithms/mutating/partial_sort.html 2010-12-26 10:13:43 EST (Sun, 26 Dec 2010)
@@ -24,11 +24,10 @@
</div>
<div class="section">
<div class="titlepage"><div><div><h5 class="title">
-<a name="range.reference.algorithms.mutating.partial_sort"></a><a class="link" href="partial_sort.html" title="partial_sort">
- partial_sort</a>
+<a name="range.reference.algorithms.mutating.partial_sort"></a><a class="link" href="partial_sort.html" title="partial_sort">partial_sort</a>
</h5></div></div></div>
<a name="range.reference.algorithms.mutating.partial_sort.prototype"></a><h6>
-<a name="id800229"></a>
+<a name="id699918"></a>
<a class="link" href="partial_sort.html#range.reference.algorithms.mutating.partial_sort.prototype">Prototype</a>
</h6>
<p>
@@ -59,7 +58,7 @@
<p>
</p>
<a name="range.reference.algorithms.mutating.partial_sort.description"></a><h6>
-<a name="id800744"></a>
+<a name="id700439"></a>
<a class="link" href="partial_sort.html#range.reference.algorithms.mutating.partial_sort.description">Description</a>
</h6>
<p>
@@ -75,14 +74,14 @@
predicate instead.
</p>
<a name="range.reference.algorithms.mutating.partial_sort.definition"></a><h6>
-<a name="id800922"></a>
+<a name="id700615"></a>
<a class="link" href="partial_sort.html#range.reference.algorithms.mutating.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.mutating.partial_sort.requirements"></a><h6>
-<a name="id800992"></a>
+<a name="id700686"></a>
<a class="link" href="partial_sort.html#range.reference.algorithms.mutating.partial_sort.requirements">Requirements</a>
</h6>
<p>
@@ -133,7 +132,7 @@
</li>
</ul></div>
<a name="range.reference.algorithms.mutating.partial_sort.complexity"></a><h6>
-<a name="id801250"></a>
+<a name="id700933"></a>
<a class="link" href="partial_sort.html#range.reference.algorithms.mutating.partial_sort.complexity">Complexity</a>
</h6>
<p>
Modified: branches/release/libs/range/doc/html/range/reference/algorithms/mutating/partition.html
==============================================================================
--- branches/release/libs/range/doc/html/range/reference/algorithms/mutating/partition.html (original)
+++ branches/release/libs/range/doc/html/range/reference/algorithms/mutating/partition.html 2010-12-26 10:13:43 EST (Sun, 26 Dec 2010)
@@ -24,10 +24,10 @@
</div>
<div class="section">
<div class="titlepage"><div><div><h5 class="title">
-<a name="range.reference.algorithms.mutating.partition"></a><a class="link" href="partition.html" title="partition"> partition</a>
+<a name="range.reference.algorithms.mutating.partition"></a><a class="link" href="partition.html" title="partition">partition</a>
</h5></div></div></div>
<a name="range.reference.algorithms.mutating.partition.prototype"></a><h6>
-<a name="id801366"></a>
+<a name="id701049"></a>
<a class="link" href="partition.html#range.reference.algorithms.mutating.partition.prototype">Prototype</a>
</h6>
<p>
@@ -66,7 +66,7 @@
<p>
</p>
<a name="range.reference.algorithms.mutating.partition.description"></a><h6>
-<a name="id801932"></a>
+<a name="id701626"></a>
<a class="link" href="partition.html#range.reference.algorithms.mutating.partition.description">Description</a>
</h6>
<p>
@@ -80,14 +80,14 @@
corresponds to the middle iterator.
</p>
<a name="range.reference.algorithms.mutating.partition.definition"></a><h6>
-<a name="id802013"></a>
+<a name="id701704"></a>
<a class="link" href="partition.html#range.reference.algorithms.mutating.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.mutating.partition.requirements"></a><h6>
-<a name="id802084"></a>
+<a name="id701774"></a>
<a class="link" href="partition.html#range.reference.algorithms.mutating.partition.requirements">Requirements</a>
</h6>
<div class="itemizedlist"><ul class="itemizedlist" type="disc">
@@ -107,7 +107,7 @@
</li>
</ul></div>
<a name="range.reference.algorithms.mutating.partition.complexity"></a><h6>
-<a name="id802190"></a>
+<a name="id701877"></a>
<a class="link" href="partition.html#range.reference.algorithms.mutating.partition.complexity">Complexity</a>
</h6>
<p>
Modified: branches/release/libs/range/doc/html/range/reference/algorithms/mutating/random_shuffle.html
==============================================================================
--- branches/release/libs/range/doc/html/range/reference/algorithms/mutating/random_shuffle.html (original)
+++ branches/release/libs/range/doc/html/range/reference/algorithms/mutating/random_shuffle.html 2010-12-26 10:13:43 EST (Sun, 26 Dec 2010)
@@ -24,11 +24,10 @@
</div>
<div class="section">
<div class="titlepage"><div><div><h5 class="title">
-<a name="range.reference.algorithms.mutating.random_shuffle"></a><a class="link" href="random_shuffle.html" title="random_shuffle">
- random_shuffle</a>
+<a name="range.reference.algorithms.mutating.random_shuffle"></a><a class="link" href="random_shuffle.html" title="random_shuffle">random_shuffle</a>
</h5></div></div></div>
<a name="range.reference.algorithms.mutating.random_shuffle.prototype"></a><h6>
-<a name="id802302"></a>
+<a name="id701987"></a>
<a class="link" href="random_shuffle.html#range.reference.algorithms.mutating.random_shuffle.prototype">Prototype</a>
</h6>
<p>
@@ -49,7 +48,7 @@
<p>
</p>
<a name="range.reference.algorithms.mutating.random_shuffle.description"></a><h6>
-<a name="id802683"></a>
+<a name="id702372"></a>
<a class="link" href="random_shuffle.html#range.reference.algorithms.mutating.random_shuffle.description">Description</a>
</h6>
<p>
@@ -61,14 +60,14 @@
the shuffles range.
</p>
<a name="range.reference.algorithms.mutating.random_shuffle.definition"></a><h6>
-<a name="id802775"></a>
+<a name="id702460"></a>
<a class="link" href="random_shuffle.html#range.reference.algorithms.mutating.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.mutating.random_shuffle.requirements"></a><h6>
-<a name="id802845"></a>
+<a name="id702531"></a>
<a class="link" href="random_shuffle.html#range.reference.algorithms.mutating.random_shuffle.requirements">Requirements</a>
</h6>
<p>
@@ -99,7 +98,7 @@
</li>
</ul></div>
<a name="range.reference.algorithms.mutating.random_shuffle.precondition_"></a><h6>
-<a name="id803004"></a>
+<a name="id702680"></a>
<a class="link" href="random_shuffle.html#range.reference.algorithms.mutating.random_shuffle.precondition_">Precondition:</a>
</h6>
<div class="itemizedlist"><ul class="itemizedlist" type="disc"><li class="listitem">
@@ -108,7 +107,7 @@
maximum value.
</li></ul></div>
<a name="range.reference.algorithms.mutating.random_shuffle.complexity"></a><h6>
-<a name="id803069"></a>
+<a name="id702745"></a>
<a class="link" href="random_shuffle.html#range.reference.algorithms.mutating.random_shuffle.complexity">Complexity</a>
</h6>
<p>
Modified: branches/release/libs/range/doc/html/range/reference/algorithms/mutating/remove.html
==============================================================================
--- branches/release/libs/range/doc/html/range/reference/algorithms/mutating/remove.html (original)
+++ branches/release/libs/range/doc/html/range/reference/algorithms/mutating/remove.html 2010-12-26 10:13:43 EST (Sun, 26 Dec 2010)
@@ -24,10 +24,10 @@
</div>
<div class="section">
<div class="titlepage"><div><div><h5 class="title">
-<a name="range.reference.algorithms.mutating.remove"></a><a class="link" href="remove.html" title="remove"> remove</a>
+<a name="range.reference.algorithms.mutating.remove"></a><a class="link" href="remove.html" title="remove">remove</a>
</h5></div></div></div>
<a name="range.reference.algorithms.mutating.remove.prototype"></a><h6>
-<a name="id803174"></a>
+<a name="id702847"></a>
<a class="link" href="remove.html#range.reference.algorithms.mutating.remove.prototype">Prototype</a>
</h6>
<p>
@@ -66,7 +66,7 @@
<p>
</p>
<a name="range.reference.algorithms.mutating.remove.description"></a><h6>
-<a name="id804049"></a>
+<a name="id703465"></a>
<a class="link" href="remove.html#range.reference.algorithms.mutating.remove.description">Description</a>
</h6>
<p>
@@ -83,14 +83,14 @@
are dereferenceable, but the elements are unspecified.
</p>
<a name="range.reference.algorithms.mutating.remove.definition"></a><h6>
-<a name="id804277"></a>
+<a name="id703692"></a>
<a class="link" href="remove.html#range.reference.algorithms.mutating.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.mutating.remove.requirements"></a><h6>
-<a name="id804348"></a>
+<a name="id703763"></a>
<a class="link" href="remove.html#range.reference.algorithms.mutating.remove.requirements">Requirements</a>
</h6>
<div class="itemizedlist"><ul class="itemizedlist" type="disc">
@@ -113,7 +113,7 @@
</li>
</ul></div>
<a name="range.reference.algorithms.mutating.remove.complexity"></a><h6>
-<a name="id804473"></a>
+<a name="id703884"></a>
<a class="link" href="remove.html#range.reference.algorithms.mutating.remove.complexity">Complexity</a>
</h6>
<p>
Modified: branches/release/libs/range/doc/html/range/reference/algorithms/mutating/remove_copy.html
==============================================================================
--- branches/release/libs/range/doc/html/range/reference/algorithms/mutating/remove_copy.html (original)
+++ branches/release/libs/range/doc/html/range/reference/algorithms/mutating/remove_copy.html 2010-12-26 10:13:43 EST (Sun, 26 Dec 2010)
@@ -24,11 +24,10 @@
</div>
<div class="section">
<div class="titlepage"><div><div><h5 class="title">
-<a name="range.reference.algorithms.mutating.remove_copy"></a><a class="link" href="remove_copy.html" title="remove_copy">
- remove_copy</a>
+<a name="range.reference.algorithms.mutating.remove_copy"></a><a class="link" href="remove_copy.html" title="remove_copy">remove_copy</a>
</h5></div></div></div>
<a name="range.reference.algorithms.mutating.remove_copy.prototype"></a><h6>
-<a name="id804549"></a>
+<a name="id703958"></a>
<a class="link" href="remove_copy.html#range.reference.algorithms.mutating.remove_copy.prototype">Prototype</a>
</h6>
<p>
@@ -45,7 +44,7 @@
<p>
</p>
<a name="range.reference.algorithms.mutating.remove_copy.description"></a><h6>
-<a name="id804847"></a>
+<a name="id704262"></a>
<a class="link" href="remove_copy.html#range.reference.algorithms.mutating.remove_copy.description">Description</a>
</h6>
<p>
@@ -54,14 +53,14 @@
<code class="computeroutput"><span class="identifier">rng</span></code> for which <code class="computeroutput"><span class="identifier">x</span> <span class="special">==</span> <span class="identifier">val</span></code> is <code class="computeroutput"><span class="keyword">false</span></code>.
</p>
<a name="range.reference.algorithms.mutating.remove_copy.definition"></a><h6>
-<a name="id804934"></a>
+<a name="id704348"></a>
<a class="link" href="remove_copy.html#range.reference.algorithms.mutating.remove_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">remove_copy</span><span class="special">.</span><span class="identifier">hpp</span></code>
</p>
<a name="range.reference.algorithms.mutating.remove_copy.requirements"></a><h6>
-<a name="id805004"></a>
+<a name="id704417"></a>
<a class="link" href="remove_copy.html#range.reference.algorithms.mutating.remove_copy.requirements">Requirements</a>
</h6>
<div class="itemizedlist"><ul class="itemizedlist" type="disc">
@@ -84,7 +83,7 @@
</li>
</ul></div>
<a name="range.reference.algorithms.mutating.remove_copy.complexity"></a><h6>
-<a name="id805129"></a>
+<a name="id704539"></a>
<a class="link" href="remove_copy.html#range.reference.algorithms.mutating.remove_copy.complexity">Complexity</a>
</h6>
<p>
Modified: branches/release/libs/range/doc/html/range/reference/algorithms/mutating/remove_copy_if.html
==============================================================================
--- branches/release/libs/range/doc/html/range/reference/algorithms/mutating/remove_copy_if.html (original)
+++ branches/release/libs/range/doc/html/range/reference/algorithms/mutating/remove_copy_if.html 2010-12-26 10:13:43 EST (Sun, 26 Dec 2010)
@@ -24,11 +24,10 @@
</div>
<div class="section">
<div class="titlepage"><div><div><h5 class="title">
-<a name="range.reference.algorithms.mutating.remove_copy_if"></a><a class="link" href="remove_copy_if.html" title="remove_copy_if">
- remove_copy_if</a>
+<a name="range.reference.algorithms.mutating.remove_copy_if"></a><a class="link" href="remove_copy_if.html" title="remove_copy_if">remove_copy_if</a>
</h5></div></div></div>
<a name="range.reference.algorithms.mutating.remove_copy_if.prototype"></a><h6>
-<a name="id805207"></a>
+<a name="id704613"></a>
<a class="link" href="remove_copy_if.html#range.reference.algorithms.mutating.remove_copy_if.prototype">Prototype</a>
</h6>
<p>
@@ -45,7 +44,7 @@
<p>
</p>
<a name="range.reference.algorithms.mutating.remove_copy_if.description"></a><h6>
-<a name="id805484"></a>
+<a name="id704895"></a>
<a class="link" href="remove_copy_if.html#range.reference.algorithms.mutating.remove_copy_if.description">Description</a>
</h6>
<p>
@@ -55,14 +54,14 @@
is <code class="computeroutput"><span class="keyword">false</span></code>.
</p>
<a name="range.reference.algorithms.mutating.remove_copy_if.definition"></a><h6>
-<a name="id805573"></a>
+<a name="id704984"></a>
<a class="link" href="remove_copy_if.html#range.reference.algorithms.mutating.remove_copy_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_copy_if</span><span class="special">.</span><span class="identifier">hpp</span></code>
</p>
<a name="range.reference.algorithms.mutating.remove_copy_if.requirements"></a><h6>
-<a name="id805644"></a>
+<a name="id705054"></a>
<a class="link" href="remove_copy_if.html#range.reference.algorithms.mutating.remove_copy_if.requirements">Requirements</a>
</h6>
<div class="itemizedlist"><ul class="itemizedlist" type="disc">
@@ -80,7 +79,7 @@
</li>
</ul></div>
<a name="range.reference.algorithms.mutating.remove_copy_if.complexity"></a><h6>
-<a name="id805740"></a>
+<a name="id705147"></a>
<a class="link" href="remove_copy_if.html#range.reference.algorithms.mutating.remove_copy_if.complexity">Complexity</a>
</h6>
<p>
Modified: branches/release/libs/range/doc/html/range/reference/algorithms/mutating/remove_if.html
==============================================================================
--- branches/release/libs/range/doc/html/range/reference/algorithms/mutating/remove_if.html (original)
+++ branches/release/libs/range/doc/html/range/reference/algorithms/mutating/remove_if.html 2010-12-26 10:13:43 EST (Sun, 26 Dec 2010)
@@ -24,10 +24,10 @@
</div>
<div class="section">
<div class="titlepage"><div><div><h5 class="title">
-<a name="range.reference.algorithms.mutating.remove_if"></a><a class="link" href="remove_if.html" title="remove_if"> remove_if</a>
+<a name="range.reference.algorithms.mutating.remove_if"></a><a class="link" href="remove_if.html" title="remove_if">remove_if</a>
</h5></div></div></div>
<a name="range.reference.algorithms.mutating.remove_if.prototype"></a><h6>
-<a name="id805817"></a>
+<a name="id705221"></a>
<a class="link" href="remove_if.html#range.reference.algorithms.mutating.remove_if.prototype">Prototype</a>
</h6>
<p>
@@ -66,7 +66,7 @@
<p>
</p>
<a name="range.reference.algorithms.mutating.remove_if.description"></a><h6>
-<a name="id806381"></a>
+<a name="id705797"></a>
<a class="link" href="remove_if.html#range.reference.algorithms.mutating.remove_if.description">Description</a>
</h6>
<p>
@@ -82,14 +82,14 @@
are unspecified.
</p>
<a name="range.reference.algorithms.mutating.remove_if.definition"></a><h6>
-<a name="id806604"></a>
+<a name="id706018"></a>
<a class="link" href="remove_if.html#range.reference.algorithms.mutating.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.mutating.remove_if.requirements"></a><h6>
-<a name="id806676"></a>
+<a name="id706090"></a>
<a class="link" href="remove_if.html#range.reference.algorithms.mutating.remove_if.requirements">Requirements</a>
</h6>
<div class="itemizedlist"><ul class="itemizedlist" type="disc">
@@ -112,7 +112,7 @@
</li>
</ul></div>
<a name="range.reference.algorithms.mutating.remove_if.complexity"></a><h6>
-<a name="id806800"></a>
+<a name="id706212"></a>
<a class="link" href="remove_if.html#range.reference.algorithms.mutating.remove_if.complexity">Complexity</a>
</h6>
<p>
Modified: branches/release/libs/range/doc/html/range/reference/algorithms/mutating/replace.html
==============================================================================
--- branches/release/libs/range/doc/html/range/reference/algorithms/mutating/replace.html (original)
+++ branches/release/libs/range/doc/html/range/reference/algorithms/mutating/replace.html 2010-12-26 10:13:43 EST (Sun, 26 Dec 2010)
@@ -24,10 +24,10 @@
</div>
<div class="section">
<div class="titlepage"><div><div><h5 class="title">
-<a name="range.reference.algorithms.mutating.replace"></a><a class="link" href="replace.html" title="replace"> replace</a>
+<a name="range.reference.algorithms.mutating.replace"></a><a class="link" href="replace.html" title="replace">replace</a>
</h5></div></div></div>
<a name="range.reference.algorithms.mutating.replace.prototype"></a><h6>
-<a name="id806888"></a>
+<a name="id706298"></a>
<a class="link" href="replace.html#range.reference.algorithms.mutating.replace.prototype">Prototype</a>
</h6>
<p>
@@ -48,7 +48,7 @@
<p>
</p>
<a name="range.reference.algorithms.mutating.replace.description"></a><h6>
-<a name="id807195"></a>
+<a name="id706609"></a>
<a class="link" href="replace.html#range.reference.algorithms.mutating.replace.description">Description</a>
</h6>
<p>
@@ -57,14 +57,14 @@
Return a reference to <code class="computeroutput"><span class="identifier">rng</span></code>.
</p>
<a name="range.reference.algorithms.mutating.replace.definition"></a><h6>
-<a name="id807272"></a>
+<a name="id706685"></a>
<a class="link" href="replace.html#range.reference.algorithms.mutating.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.mutating.replace.requirements"></a><h6>
-<a name="id807342"></a>
+<a name="id706755"></a>
<a class="link" href="replace.html#range.reference.algorithms.mutating.replace.requirements">Requirements</a>
</h6>
<div class="itemizedlist"><ul class="itemizedlist" type="disc">
@@ -93,7 +93,7 @@
</li>
</ul></div>
<a name="range.reference.algorithms.mutating.replace.complexity"></a><h6>
-<a name="id807505"></a>
+<a name="id706914"></a>
<a class="link" href="replace.html#range.reference.algorithms.mutating.replace.complexity">Complexity</a>
</h6>
<p>
Modified: branches/release/libs/range/doc/html/range/reference/algorithms/mutating/replace_copy.html
==============================================================================
--- branches/release/libs/range/doc/html/range/reference/algorithms/mutating/replace_copy.html (original)
+++ branches/release/libs/range/doc/html/range/reference/algorithms/mutating/replace_copy.html 2010-12-26 10:13:43 EST (Sun, 26 Dec 2010)
@@ -24,11 +24,10 @@
</div>
<div class="section">
<div class="titlepage"><div><div><h5 class="title">
-<a name="range.reference.algorithms.mutating.replace_copy"></a><a class="link" href="replace_copy.html" title="replace_copy">
- replace_copy</a>
+<a name="range.reference.algorithms.mutating.replace_copy"></a><a class="link" href="replace_copy.html" title="replace_copy">replace_copy</a>
</h5></div></div></div>
<a name="range.reference.algorithms.mutating.replace_copy.prototype"></a><h6>
-<a name="id807608"></a>
+<a name="id707013"></a>
<a class="link" href="replace_copy.html#range.reference.algorithms.mutating.replace_copy.prototype">Prototype</a>
</h6>
<p>
@@ -41,7 +40,7 @@
<p>
</p>
<a name="range.reference.algorithms.mutating.replace_copy.description"></a><h6>
-<a name="id807800"></a>
+<a name="id707209"></a>
<a class="link" href="replace_copy.html#range.reference.algorithms.mutating.replace_copy.description">Description</a>
</h6>
<p>
@@ -54,14 +53,14 @@
<span class="identifier">x</span></code>.
</p>
<a name="range.reference.algorithms.mutating.replace_copy.definition"></a><h6>
-<a name="id807911"></a>
+<a name="id707318"></a>
<a class="link" href="replace_copy.html#range.reference.algorithms.mutating.replace_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">replace_copy</span><span class="special">.</span><span class="identifier">hpp</span></code>
</p>
<a name="range.reference.algorithms.mutating.replace_copy.requirements"></a><h6>
-<a name="id807981"></a>
+<a name="id707388"></a>
<a class="link" href="replace_copy.html#range.reference.algorithms.mutating.replace_copy.requirements">Requirements</a>
</h6>
<div class="itemizedlist"><ul class="itemizedlist" type="disc">
@@ -88,7 +87,7 @@
</li>
</ul></div>
<a name="range.reference.algorithms.mutating.replace_copy.complexity"></a><h6>
-<a name="id808134"></a>
+<a name="id707536"></a>
<a class="link" href="replace_copy.html#range.reference.algorithms.mutating.replace_copy.complexity">Complexity</a>
</h6>
<p>
Modified: branches/release/libs/range/doc/html/range/reference/algorithms/mutating/replace_copy_if.html
==============================================================================
--- branches/release/libs/range/doc/html/range/reference/algorithms/mutating/replace_copy_if.html (original)
+++ branches/release/libs/range/doc/html/range/reference/algorithms/mutating/replace_copy_if.html 2010-12-26 10:13:43 EST (Sun, 26 Dec 2010)
@@ -24,11 +24,10 @@
</div>
<div class="section">
<div class="titlepage"><div><div><h5 class="title">
-<a name="range.reference.algorithms.mutating.replace_copy_if"></a><a class="link" href="replace_copy_if.html" title="replace_copy_if">
- replace_copy_if</a>
+<a name="range.reference.algorithms.mutating.replace_copy_if"></a><a class="link" href="replace_copy_if.html" title="replace_copy_if">replace_copy_if</a>
</h5></div></div></div>
<a name="range.reference.algorithms.mutating.replace_copy_if.prototype"></a><h6>
-<a name="id808213"></a>
+<a name="id707610"></a>
<a class="link" href="replace_copy_if.html#range.reference.algorithms.mutating.replace_copy_if.prototype">Prototype</a>
</h6>
<p>
@@ -41,7 +40,7 @@
<p>
</p>
<a name="range.reference.algorithms.mutating.replace_copy_if.description"></a><h6>
-<a name="id808410"></a>
+<a name="id707811"></a>
<a class="link" href="replace_copy_if.html#range.reference.algorithms.mutating.replace_copy_if.description">Description</a>
</h6>
<p>
@@ -52,14 +51,14 @@
<span class="special">:</span> <span class="identifier">x</span></code>.
</p>
<a name="range.reference.algorithms.mutating.replace_copy_if.definition"></a><h6>
-<a name="id808523"></a>
+<a name="id707922"></a>
<a class="link" href="replace_copy_if.html#range.reference.algorithms.mutating.replace_copy_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_copy_if</span><span class="special">.</span><span class="identifier">hpp</span></code>
</p>
<a name="range.reference.algorithms.mutating.replace_copy_if.requirements"></a><h6>
-<a name="id808596"></a>
+<a name="id707992"></a>
<a class="link" href="replace_copy_if.html#range.reference.algorithms.mutating.replace_copy_if.requirements">Requirements</a>
</h6>
<div class="itemizedlist"><ul class="itemizedlist" type="disc">
@@ -90,7 +89,7 @@
</li>
</ul></div>
<a name="range.reference.algorithms.mutating.replace_copy_if.complexity"></a><h6>
-<a name="id808776"></a>
+<a name="id708169"></a>
<a class="link" href="replace_copy_if.html#range.reference.algorithms.mutating.replace_copy_if.complexity">Complexity</a>
</h6>
<p>
Modified: branches/release/libs/range/doc/html/range/reference/algorithms/mutating/replace_if.html
==============================================================================
--- branches/release/libs/range/doc/html/range/reference/algorithms/mutating/replace_if.html (original)
+++ branches/release/libs/range/doc/html/range/reference/algorithms/mutating/replace_if.html 2010-12-26 10:13:43 EST (Sun, 26 Dec 2010)
@@ -24,11 +24,10 @@
</div>
<div class="section">
<div class="titlepage"><div><div><h5 class="title">
-<a name="range.reference.algorithms.mutating.replace_if"></a><a class="link" href="replace_if.html" title="replace_if">
- replace_if</a>
+<a name="range.reference.algorithms.mutating.replace_if"></a><a class="link" href="replace_if.html" title="replace_if">replace_if</a>
</h5></div></div></div>
<a name="range.reference.algorithms.mutating.replace_if.prototype"></a><h6>
-<a name="id808864"></a>
+<a name="id708254"></a>
<a class="link" href="replace_if.html#range.reference.algorithms.mutating.replace_if.prototype">Prototype</a>
</h6>
<p>
@@ -43,7 +42,7 @@
<p>
</p>
<a name="range.reference.algorithms.mutating.replace_if.description"></a><h6>
-<a name="id809176"></a>
+<a name="id708572"></a>
<a class="link" href="replace_if.html#range.reference.algorithms.mutating.replace_if.description">Description</a>
</h6>
<p>
@@ -52,14 +51,14 @@
Returns a reference to <code class="computeroutput"><span class="identifier">rng</span></code>.
</p>
<a name="range.reference.algorithms.mutating.replace_if.definition"></a><h6>
-<a name="id809288"></a>
+<a name="id708684"></a>
<a class="link" href="replace_if.html#range.reference.algorithms.mutating.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.mutating.replace_if.requirements"></a><h6>
-<a name="id809358"></a>
+<a name="id708754"></a>
<a class="link" href="replace_if.html#range.reference.algorithms.mutating.replace_if.requirements">Requirements</a>
</h6>
<div class="itemizedlist"><ul class="itemizedlist" type="disc">
@@ -91,7 +90,7 @@
</li>
</ul></div>
<a name="range.reference.algorithms.mutating.replace_if.complexity"></a><h6>
-<a name="id809539"></a>
+<a name="id708930"></a>
<a class="link" href="replace_if.html#range.reference.algorithms.mutating.replace_if.complexity">Complexity</a>
</h6>
<p>
Modified: branches/release/libs/range/doc/html/range/reference/algorithms/mutating/reverse.html
==============================================================================
--- branches/release/libs/range/doc/html/range/reference/algorithms/mutating/reverse.html (original)
+++ branches/release/libs/range/doc/html/range/reference/algorithms/mutating/reverse.html 2010-12-26 10:13:43 EST (Sun, 26 Dec 2010)
@@ -24,10 +24,10 @@
</div>
<div class="section">
<div class="titlepage"><div><div><h5 class="title">
-<a name="range.reference.algorithms.mutating.reverse"></a><a class="link" href="reverse.html" title="reverse"> reverse</a>
+<a name="range.reference.algorithms.mutating.reverse"></a><a class="link" href="reverse.html" title="reverse">reverse</a>
</h5></div></div></div>
<a name="range.reference.algorithms.mutating.reverse.prototype"></a><h6>
-<a name="id809650"></a>
+<a name="id709040"></a>
<a class="link" href="reverse.html#range.reference.algorithms.mutating.reverse.prototype">Prototype</a>
</h6>
<p>
@@ -42,7 +42,7 @@
<p>
</p>
<a name="range.reference.algorithms.mutating.reverse.description"></a><h6>
-<a name="id809821"></a>
+<a name="id709211"></a>
<a class="link" href="reverse.html#range.reference.algorithms.mutating.reverse.description">Description</a>
</h6>
<p>
@@ -50,14 +50,14 @@
Returns a reference to the reversed range.
</p>
<a name="range.reference.algorithms.mutating.reverse.definition"></a><h6>
-<a name="id809858"></a>
+<a name="id709244"></a>
<a class="link" href="reverse.html#range.reference.algorithms.mutating.reverse.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">reverse</span><span class="special">.</span><span class="identifier">hpp</span></code>
</p>
<a name="range.reference.algorithms.mutating.reverse.requirements"></a><h6>
-<a name="id809929"></a>
+<a name="id709314"></a>
<a class="link" href="reverse.html#range.reference.algorithms.mutating.reverse.requirements">Requirements</a>
</h6>
<div class="itemizedlist"><ul class="itemizedlist" type="disc">
@@ -72,7 +72,7 @@
</li>
</ul></div>
<a name="range.reference.algorithms.mutating.reverse.complexity"></a><h6>
-<a name="id809998"></a>
+<a name="id709380"></a>
<a class="link" href="reverse.html#range.reference.algorithms.mutating.reverse.complexity">Complexity</a>
</h6>
<p>
Modified: branches/release/libs/range/doc/html/range/reference/algorithms/mutating/reverse_copy.html
==============================================================================
--- branches/release/libs/range/doc/html/range/reference/algorithms/mutating/reverse_copy.html (original)
+++ branches/release/libs/range/doc/html/range/reference/algorithms/mutating/reverse_copy.html 2010-12-26 10:13:43 EST (Sun, 26 Dec 2010)
@@ -24,11 +24,10 @@
</div>
<div class="section">
<div class="titlepage"><div><div><h5 class="title">
-<a name="range.reference.algorithms.mutating.reverse_copy"></a><a class="link" href="reverse_copy.html" title="reverse_copy">
- reverse_copy</a>
+<a name="range.reference.algorithms.mutating.reverse_copy"></a><a class="link" href="reverse_copy.html" title="reverse_copy">reverse_copy</a>
</h5></div></div></div>
<a name="range.reference.algorithms.mutating.reverse_copy.prototype"></a><h6>
-<a name="id810092"></a>
+<a name="id709469"></a>
<a class="link" href="reverse_copy.html#range.reference.algorithms.mutating.reverse_copy.prototype">Prototype</a>
</h6>
<p>
@@ -40,7 +39,7 @@
<p>
</p>
<a name="range.reference.algorithms.mutating.reverse_copy.description"></a><h6>
-<a name="id810218"></a>
+<a name="id709596"></a>
<a class="link" href="reverse_copy.html#range.reference.algorithms.mutating.reverse_copy.description">Description</a>
</h6>
<p>
@@ -50,14 +49,14 @@
Returns the output iterator one passed the last copied element.
</p>
<a name="range.reference.algorithms.mutating.reverse_copy.definition"></a><h6>
-<a name="id810276"></a>
+<a name="id709652"></a>
<a class="link" href="reverse_copy.html#range.reference.algorithms.mutating.reverse_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">reverse_copy</span><span class="special">.</span><span class="identifier">hpp</span></code>
</p>
<a name="range.reference.algorithms.mutating.reverse_copy.requirements"></a><h6>
-<a name="id810347"></a>
+<a name="id709722"></a>
<a class="link" href="reverse_copy.html#range.reference.algorithms.mutating.reverse_copy.requirements">Requirements</a>
</h6>
<div class="itemizedlist"><ul class="itemizedlist" type="disc">
@@ -76,7 +75,7 @@
</li>
</ul></div>
<a name="range.reference.algorithms.mutating.reverse_copy.complexity"></a><h6>
-<a name="id810444"></a>
+<a name="id709814"></a>
<a class="link" href="reverse_copy.html#range.reference.algorithms.mutating.reverse_copy.complexity">Complexity</a>
</h6>
<p>
Modified: branches/release/libs/range/doc/html/range/reference/algorithms/mutating/rotate.html
==============================================================================
--- branches/release/libs/range/doc/html/range/reference/algorithms/mutating/rotate.html (original)
+++ branches/release/libs/range/doc/html/range/reference/algorithms/mutating/rotate.html 2010-12-26 10:13:43 EST (Sun, 26 Dec 2010)
@@ -24,10 +24,10 @@
</div>
<div class="section">
<div class="titlepage"><div><div><h5 class="title">
-<a name="range.reference.algorithms.mutating.rotate"></a><a class="link" href="rotate.html" title="rotate"> rotate</a>
+<a name="range.reference.algorithms.mutating.rotate"></a><a class="link" href="rotate.html" title="rotate">rotate</a>
</h5></div></div></div>
<a name="range.reference.algorithms.mutating.rotate.prototype"></a><h6>
-<a name="id810521"></a>
+<a name="id709890"></a>
<a class="link" href="rotate.html#range.reference.algorithms.mutating.rotate.prototype">Prototype</a>
</h6>
<p>
@@ -44,7 +44,7 @@
<p>
</p>
<a name="range.reference.algorithms.mutating.rotate.description"></a><h6>
-<a name="id810773"></a>
+<a name="id710146"></a>
<a class="link" href="rotate.html#range.reference.algorithms.mutating.rotate.description">Description</a>
</h6>
<p>
@@ -53,14 +53,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.mutating.rotate.definition"></a><h6>
-<a name="id810896"></a>
+<a name="id710267"></a>
<a class="link" href="rotate.html#range.reference.algorithms.mutating.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.mutating.rotate.requirements"></a><h6>
-<a name="id810967"></a>
+<a name="id710337"></a>
<a class="link" href="rotate.html#range.reference.algorithms.mutating.rotate.requirements">Requirements</a>
</h6>
<div class="itemizedlist"><ul class="itemizedlist" type="disc">
@@ -74,7 +74,7 @@
</li>
</ul></div>
<a name="range.reference.algorithms.mutating.rotate.precondition_"></a><h6>
-<a name="id811034"></a>
+<a name="id710402"></a>
<a class="link" href="rotate.html#range.reference.algorithms.mutating.rotate.precondition_">Precondition:</a>
</h6>
<div class="itemizedlist"><ul class="itemizedlist" type="disc">
@@ -86,7 +86,7 @@
</li>
</ul></div>
<a name="range.reference.algorithms.mutating.rotate.complexity"></a><h6>
-<a name="id811148"></a>
+<a name="id710515"></a>
<a class="link" href="rotate.html#range.reference.algorithms.mutating.rotate.complexity">Complexity</a>
</h6>
<p>
Modified: branches/release/libs/range/doc/html/range/reference/algorithms/mutating/rotate_copy.html
==============================================================================
--- branches/release/libs/range/doc/html/range/reference/algorithms/mutating/rotate_copy.html (original)
+++ branches/release/libs/range/doc/html/range/reference/algorithms/mutating/rotate_copy.html 2010-12-26 10:13:43 EST (Sun, 26 Dec 2010)
@@ -24,11 +24,10 @@
</div>
<div class="section">
<div class="titlepage"><div><div><h5 class="title">
-<a name="range.reference.algorithms.mutating.rotate_copy"></a><a class="link" href="rotate_copy.html" title="rotate_copy">
- rotate_copy</a>
+<a name="range.reference.algorithms.mutating.rotate_copy"></a><a class="link" href="rotate_copy.html" title="rotate_copy">rotate_copy</a>
</h5></div></div></div>
<a name="range.reference.algorithms.mutating.rotate_copy.prototype"></a><h6>
-<a name="id811215"></a>
+<a name="id710578"></a>
<a class="link" href="rotate_copy.html#range.reference.algorithms.mutating.rotate_copy.prototype">Prototype</a>
</h6>
<p>
@@ -43,7 +42,7 @@
<p>
</p>
<a name="range.reference.algorithms.mutating.rotate_copy.description"></a><h6>
-<a name="id811381"></a>
+<a name="id710746"></a>
<a class="link" href="rotate_copy.html#range.reference.algorithms.mutating.rotate_copy.description">Description</a>
</h6>
<p>
@@ -52,14 +51,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> to <code class="computeroutput"><span class="identifier">out</span></code>.
</p>
<a name="range.reference.algorithms.mutating.rotate_copy.definition"></a><h6>
-<a name="id811502"></a>
+<a name="id710867"></a>
<a class="link" href="rotate_copy.html#range.reference.algorithms.mutating.rotate_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">rotate_copy</span><span class="special">.</span><span class="identifier">hpp</span></code>
</p>
<a name="range.reference.algorithms.mutating.rotate_copy.requirements"></a><h6>
-<a name="id811573"></a>
+<a name="id710937"></a>
<a class="link" href="rotate_copy.html#range.reference.algorithms.mutating.rotate_copy.requirements">Requirements</a>
</h6>
<div class="itemizedlist"><ul class="itemizedlist" type="disc">
@@ -77,7 +76,7 @@
</li>
</ul></div>
<a name="range.reference.algorithms.mutating.rotate_copy.precondition_"></a><h6>
-<a name="id811669"></a>
+<a name="id711029"></a>
<a class="link" href="rotate_copy.html#range.reference.algorithms.mutating.rotate_copy.precondition_">Precondition:</a>
</h6>
<div class="itemizedlist"><ul class="itemizedlist" type="disc">
@@ -89,7 +88,7 @@
</li>
</ul></div>
<a name="range.reference.algorithms.mutating.rotate_copy.complexity"></a><h6>
-<a name="id811781"></a>
+<a name="id711141"></a>
<a class="link" href="rotate_copy.html#range.reference.algorithms.mutating.rotate_copy.complexity">Complexity</a>
</h6>
<p>
Modified: branches/release/libs/range/doc/html/range/reference/algorithms/mutating/sort.html
==============================================================================
--- branches/release/libs/range/doc/html/range/reference/algorithms/mutating/sort.html (original)
+++ branches/release/libs/range/doc/html/range/reference/algorithms/mutating/sort.html 2010-12-26 10:13:43 EST (Sun, 26 Dec 2010)
@@ -24,10 +24,10 @@
</div>
<div class="section">
<div class="titlepage"><div><div><h5 class="title">
-<a name="range.reference.algorithms.mutating.sort"></a><a class="link" href="sort.html" title="sort"> sort</a>
+<a name="range.reference.algorithms.mutating.sort"></a><a class="link" href="sort.html" title="sort">sort</a>
</h5></div></div></div>
<a name="range.reference.algorithms.mutating.sort.prototype"></a><h6>
-<a name="id811848"></a>
+<a name="id711206"></a>
<a class="link" href="sort.html#range.reference.algorithms.mutating.sort.prototype">Prototype</a>
</h6>
<p>
@@ -48,7 +48,7 @@
<p>
</p>
<a name="range.reference.algorithms.mutating.sort.description"></a><h6>
-<a name="id812220"></a>
+<a name="id711582"></a>
<a class="link" href="sort.html#range.reference.algorithms.mutating.sort.description">Description</a>
</h6>
<p>
@@ -71,14 +71,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.mutating.sort.definition"></a><h6>
-<a name="id812466"></a>
+<a name="id711824"></a>
<a class="link" href="sort.html#range.reference.algorithms.mutating.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.mutating.sort.requirements"></a><h6>
-<a name="id812538"></a>
+<a name="id711894"></a>
<a class="link" href="sort.html#range.reference.algorithms.mutating.sort.requirements">Requirements</a>
</h6>
<p>
@@ -129,7 +129,7 @@
</li>
</ul></div>
<a name="range.reference.algorithms.mutating.sort.complexity"></a><h6>
-<a name="id812795"></a>
+<a name="id712141"></a>
<a class="link" href="sort.html#range.reference.algorithms.mutating.sort.complexity">Complexity</a>
</h6>
<p>
Modified: branches/release/libs/range/doc/html/range/reference/algorithms/mutating/stable_partition.html
==============================================================================
--- branches/release/libs/range/doc/html/range/reference/algorithms/mutating/stable_partition.html (original)
+++ branches/release/libs/range/doc/html/range/reference/algorithms/mutating/stable_partition.html 2010-12-26 10:13:43 EST (Sun, 26 Dec 2010)
@@ -24,11 +24,10 @@
</div>
<div class="section">
<div class="titlepage"><div><div><h5 class="title">
-<a name="range.reference.algorithms.mutating.stable_partition"></a><a class="link" href="stable_partition.html" title="stable_partition">
- stable_partition</a>
+<a name="range.reference.algorithms.mutating.stable_partition"></a><a class="link" href="stable_partition.html" title="stable_partition">stable_partition</a>
</h5></div></div></div>
<a name="range.reference.algorithms.mutating.stable_partition.prototype"></a><h6>
-<a name="id812910"></a>
+<a name="id712254"></a>
<a class="link" href="stable_partition.html#range.reference.algorithms.mutating.stable_partition.prototype">Prototype</a>
</h6>
<p>
@@ -61,7 +60,7 @@
<p>
</p>
<a name="range.reference.algorithms.mutating.stable_partition.description"></a><h6>
-<a name="id813474"></a>
+<a name="id712828"></a>
<a class="link" href="stable_partition.html#range.reference.algorithms.mutating.stable_partition.description">Description</a>
</h6>
<p>
@@ -83,14 +82,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.mutating.stable_partition.definition"></a><h6>
-<a name="id813620"></a>
+<a name="id712968"></a>
<a class="link" href="stable_partition.html#range.reference.algorithms.mutating.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.mutating.stable_partition.requirements"></a><h6>
-<a name="id813693"></a>
+<a name="id713039"></a>
<a class="link" href="stable_partition.html#range.reference.algorithms.mutating.stable_partition.requirements">Requirements</a>
</h6>
<div class="itemizedlist"><ul class="itemizedlist" type="disc">
@@ -108,7 +107,7 @@
</li>
</ul></div>
<a name="range.reference.algorithms.mutating.stable_partition.complexity"></a><h6>
-<a name="id813788"></a>
+<a name="id713132"></a>
<a class="link" href="stable_partition.html#range.reference.algorithms.mutating.stable_partition.complexity">Complexity</a>
</h6>
<p>
Modified: branches/release/libs/range/doc/html/range/reference/algorithms/mutating/stable_sort.html
==============================================================================
--- branches/release/libs/range/doc/html/range/reference/algorithms/mutating/stable_sort.html (original)
+++ branches/release/libs/range/doc/html/range/reference/algorithms/mutating/stable_sort.html 2010-12-26 10:13:43 EST (Sun, 26 Dec 2010)
@@ -24,11 +24,10 @@
</div>
<div class="section">
<div class="titlepage"><div><div><h5 class="title">
-<a name="range.reference.algorithms.mutating.stable_sort"></a><a class="link" href="stable_sort.html" title="stable_sort">
- stable_sort</a>
+<a name="range.reference.algorithms.mutating.stable_sort"></a><a class="link" href="stable_sort.html" title="stable_sort">stable_sort</a>
</h5></div></div></div>
<a name="range.reference.algorithms.mutating.stable_sort.prototype"></a><h6>
-<a name="id813956"></a>
+<a name="id713298"></a>
<a class="link" href="stable_sort.html#range.reference.algorithms.mutating.stable_sort.prototype">Prototype</a>
</h6>
<p>
@@ -49,7 +48,7 @@
<p>
</p>
<a name="range.reference.algorithms.mutating.stable_sort.description"></a><h6>
-<a name="id814328"></a>
+<a name="id713674"></a>
<a class="link" href="stable_sort.html#range.reference.algorithms.mutating.stable_sort.description">Description</a>
</h6>
<p>
@@ -72,14 +71,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.mutating.stable_sort.definition"></a><h6>
-<a name="id814573"></a>
+<a name="id713918"></a>
<a class="link" href="stable_sort.html#range.reference.algorithms.mutating.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.mutating.stable_sort.requirements"></a><h6>
-<a name="id814643"></a>
+<a name="id713988"></a>
<a class="link" href="stable_sort.html#range.reference.algorithms.mutating.stable_sort.requirements">Requirements</a>
</h6>
<p>
@@ -130,7 +129,7 @@
</li>
</ul></div>
<a name="range.reference.algorithms.mutating.stable_sort.complexity"></a><h6>
-<a name="id814900"></a>
+<a name="id714235"></a>
<a class="link" href="stable_sort.html#range.reference.algorithms.mutating.stable_sort.complexity">Complexity</a>
</h6>
<p>
Modified: branches/release/libs/range/doc/html/range/reference/algorithms/mutating/swap_ranges.html
==============================================================================
--- branches/release/libs/range/doc/html/range/reference/algorithms/mutating/swap_ranges.html (original)
+++ branches/release/libs/range/doc/html/range/reference/algorithms/mutating/swap_ranges.html 2010-12-26 10:13:43 EST (Sun, 26 Dec 2010)
@@ -24,11 +24,10 @@
</div>
<div class="section">
<div class="titlepage"><div><div><h5 class="title">
-<a name="range.reference.algorithms.mutating.swap_ranges"></a><a class="link" href="swap_ranges.html" title="swap_ranges">
- swap_ranges</a>
+<a name="range.reference.algorithms.mutating.swap_ranges"></a><a class="link" href="swap_ranges.html" title="swap_ranges">swap_ranges</a>
</h5></div></div></div>
<a name="range.reference.algorithms.mutating.swap_ranges.prototype"></a><h6>
-<a name="id815081"></a>
+<a name="id714414"></a>
<a class="link" href="swap_ranges.html#range.reference.algorithms.mutating.swap_ranges.prototype">Prototype</a>
</h6>
<p>
@@ -40,7 +39,7 @@
<p>
</p>
<a name="range.reference.algorithms.mutating.swap_ranges.description"></a><h6>
-<a name="id815212"></a>
+<a name="id714545"></a>
<a class="link" href="swap_ranges.html#range.reference.algorithms.mutating.swap_ranges.description">Description</a>
</h6>
<p>
@@ -50,14 +49,14 @@
Returns a reference to <code class="computeroutput"><span class="identifier">rng2</span></code>.
</p>
<a name="range.reference.algorithms.mutating.swap_ranges.definition"></a><h6>
-<a name="id815301"></a>
+<a name="id714632"></a>
<a class="link" href="swap_ranges.html#range.reference.algorithms.mutating.swap_ranges.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">swap_ranges</span><span class="special">.</span><span class="identifier">hpp</span></code>
</p>
<a name="range.reference.algorithms.mutating.swap_ranges.requirements"></a><h6>
-<a name="id815372"></a>
+<a name="id714702"></a>
<a class="link" href="swap_ranges.html#range.reference.algorithms.mutating.swap_ranges.requirements">Requirements</a>
</h6>
<div class="itemizedlist"><ul class="itemizedlist" type="disc">
@@ -81,7 +80,7 @@
</li>
</ul></div>
<a name="range.reference.algorithms.mutating.swap_ranges.complexity"></a><h6>
-<a name="id815485"></a>
+<a name="id714809"></a>
<a class="link" href="swap_ranges.html#range.reference.algorithms.mutating.swap_ranges.complexity">Complexity</a>
</h6>
<p>
Modified: branches/release/libs/range/doc/html/range/reference/algorithms/mutating/transform.html
==============================================================================
--- branches/release/libs/range/doc/html/range/reference/algorithms/mutating/transform.html (original)
+++ branches/release/libs/range/doc/html/range/reference/algorithms/mutating/transform.html 2010-12-26 10:13:43 EST (Sun, 26 Dec 2010)
@@ -24,10 +24,10 @@
</div>
<div class="section">
<div class="titlepage"><div><div><h5 class="title">
-<a name="range.reference.algorithms.mutating.transform"></a><a class="link" href="transform.html" title="transform"> transform</a>
+<a name="range.reference.algorithms.mutating.transform"></a><a class="link" href="transform.html" title="transform">transform</a>
</h5></div></div></div>
<a name="range.reference.algorithms.mutating.transform.prototype"></a><h6>
-<a name="id815553"></a>
+<a name="id714874"></a>
<a class="link" href="transform.html#range.reference.algorithms.mutating.transform.prototype">Prototype</a>
</h6>
<p>
@@ -56,7 +56,7 @@
<p>
</p>
<a name="range.reference.algorithms.mutating.transform.description"></a><h6>
-<a name="id815883"></a>
+<a name="id715207"></a>
<a class="link" href="transform.html#range.reference.algorithms.mutating.transform.description">Description</a>
</h6>
<p>
@@ -92,14 +92,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.mutating.transform.definition"></a><h6>
-<a name="id816417"></a>
+<a name="id715747"></a>
<a class="link" href="transform.html#range.reference.algorithms.mutating.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.mutating.transform.requirements"></a><h6>
-<a name="id816488"></a>
+<a name="id715818"></a>
<a class="link" href="transform.html#range.reference.algorithms.mutating.transform.requirements">Requirements</a>
</h6>
<p>
@@ -169,7 +169,7 @@
</li>
</ul></div>
<a name="range.reference.algorithms.mutating.transform.precondition_"></a><h6>
-<a name="id816872"></a>
+<a name="id716187"></a>
<a class="link" href="transform.html#range.reference.algorithms.mutating.transform.precondition_">Precondition:</a>
</h6>
<p>
@@ -203,7 +203,7 @@
</li>
</ul></div>
<a name="range.reference.algorithms.mutating.transform.complexity"></a><h6>
-<a name="id817293"></a>
+<a name="id716610"></a>
<a class="link" href="transform.html#range.reference.algorithms.mutating.transform.complexity">Complexity</a>
</h6>
<p>
Modified: branches/release/libs/range/doc/html/range/reference/algorithms/mutating/unique.html
==============================================================================
--- branches/release/libs/range/doc/html/range/reference/algorithms/mutating/unique.html (original)
+++ branches/release/libs/range/doc/html/range/reference/algorithms/mutating/unique.html 2010-12-26 10:13:43 EST (Sun, 26 Dec 2010)
@@ -24,10 +24,10 @@
</div>
<div class="section">
<div class="titlepage"><div><div><h5 class="title">
-<a name="range.reference.algorithms.mutating.unique"></a><a class="link" href="unique.html" title="unique"> unique</a>
+<a name="range.reference.algorithms.mutating.unique"></a><a class="link" href="unique.html" title="unique">unique</a>
</h5></div></div></div>
<a name="range.reference.algorithms.mutating.unique.prototype"></a><h6>
-<a name="id817411"></a>
+<a name="id716728"></a>
<a class="link" href="unique.html#range.reference.algorithms.mutating.unique.prototype">Prototype</a>
</h6>
<p>
@@ -68,7 +68,7 @@
<p>
</p>
<a name="range.reference.algorithms.mutating.unique.description"></a><h6>
-<a name="id818412"></a>
+<a name="id717751"></a>
<a class="link" href="unique.html#range.reference.algorithms.mutating.unique.description">Description</a>
</h6>
<p>
@@ -86,14 +86,14 @@
type.
</p>
<a name="range.reference.algorithms.mutating.unique.definition"></a><h6>
-<a name="id818532"></a>
+<a name="id717869"></a>
<a class="link" href="unique.html#range.reference.algorithms.mutating.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.mutating.unique.requirements"></a><h6>
-<a name="id818603"></a>
+<a name="id717938"></a>
<a class="link" href="unique.html#range.reference.algorithms.mutating.unique.requirements">Requirements</a>
</h6>
<p>
@@ -137,7 +137,7 @@
</li>
</ul></div>
<a name="range.reference.algorithms.mutating.unique.complexity"></a><h6>
-<a name="id818831"></a>
+<a name="id718160"></a>
<a class="link" href="unique.html#range.reference.algorithms.mutating.unique.complexity">Complexity</a>
</h6>
<p>
Modified: branches/release/libs/range/doc/html/range/reference/algorithms/mutating/unique_copy.html
==============================================================================
--- branches/release/libs/range/doc/html/range/reference/algorithms/mutating/unique_copy.html (original)
+++ branches/release/libs/range/doc/html/range/reference/algorithms/mutating/unique_copy.html 2010-12-26 10:13:43 EST (Sun, 26 Dec 2010)
@@ -24,11 +24,10 @@
</div>
<div class="section">
<div class="titlepage"><div><div><h5 class="title">
-<a name="range.reference.algorithms.mutating.unique_copy"></a><a class="link" href="unique_copy.html" title="unique_copy">
- unique_copy</a>
+<a name="range.reference.algorithms.mutating.unique_copy"></a><a class="link" href="unique_copy.html" title="unique_copy">unique_copy</a>
</h5></div></div></div>
<a name="range.reference.algorithms.mutating.unique_copy.prototype"></a><h6>
-<a name="id818955"></a>
+<a name="id718283"></a>
<a class="link" href="unique_copy.html#range.reference.algorithms.mutating.unique_copy.prototype">Prototype</a>
</h6>
<p>
@@ -43,7 +42,7 @@
<p>
</p>
<a name="range.reference.algorithms.mutating.unique_copy.description"></a><h6>
-<a name="id819207"></a>
+<a name="id718540"></a>
<a class="link" href="unique_copy.html#range.reference.algorithms.mutating.unique_copy.description">Description</a>
</h6>
<p>
@@ -56,14 +55,14 @@
value type.
</p>
<a name="range.reference.algorithms.mutating.unique_copy.definition"></a><h6>
-<a name="id819296"></a>
+<a name="id718625"></a>
<a class="link" href="unique_copy.html#range.reference.algorithms.mutating.unique_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">unique_copy</span><span class="special">.</span><span class="identifier">hpp</span></code>
</p>
<a name="range.reference.algorithms.mutating.unique_copy.requirements"></a><h6>
-<a name="id819366"></a>
+<a name="id718696"></a>
<a class="link" href="unique_copy.html#range.reference.algorithms.mutating.unique_copy.requirements">Requirements</a>
</h6>
<p>
@@ -117,7 +116,7 @@
</li>
</ul></div>
<a name="range.reference.algorithms.mutating.unique_copy.complexity"></a><h6>
-<a name="id819654"></a>
+<a name="id718974"></a>
<a class="link" href="unique_copy.html#range.reference.algorithms.mutating.unique_copy.complexity">Complexity</a>
</h6>
<p>
Modified: branches/release/libs/range/doc/html/range/reference/algorithms/new.html
==============================================================================
--- branches/release/libs/range/doc/html/range/reference/algorithms/new.html (original)
+++ branches/release/libs/range/doc/html/range/reference/algorithms/new.html 2010-12-26 10:13:43 EST (Sun, 26 Dec 2010)
@@ -5,7 +5,7 @@
<link rel="stylesheet" href="../../../../../../../doc/src/boostbook.css" type="text/css">
<meta name="generator" content="DocBook XSL Stylesheets V1.75.2">
<link rel="home" href="../../../index.html" title="Chapter 1. Range 2.0">
-<link rel="up" href="../algorithms.html" title="Range Algorithm">
+<link rel="up" href="../algorithms.html" title="Range Algorithms">
<link rel="prev" href="permutation/prev_permutation.html" title="prev_permutation">
<link rel="next" href="new/copy_n.html" title="copy_n">
</head>
@@ -24,21 +24,20 @@
</div>
<div class="section">
<div class="titlepage"><div><div><h4 class="title">
-<a name="range.reference.algorithms.new"></a><a class="link" href="new.html" title="New algorithms"> New algorithms</a>
+<a name="range.reference.algorithms.new"></a><a class="link" href="new.html" title="New algorithms">New algorithms</a>
</h4></div></div></div>
<div class="toc"><dl>
-<dt><span class="section"> copy_n</span></dt>
-<dt><span class="section"> erase</span></dt>
-<dt><span class="section"> for_each</span></dt>
-<dt><span class="section"> insert</span></dt>
-<dt><span class="section"> iota</span></dt>
-<dt><span class="section"> is_sorted</span></dt>
-<dt><span class="section"> overwrite</span></dt>
-<dt><span class="section"> push_back</span></dt>
-<dt><span class="section"> push_front</span></dt>
-<dt><span class="section"> remove_erase</span></dt>
-<dt><span class="section"><a href="new/remove_erase_if.html">
- remove_erase_if</a></span></dt>
+<dt><span class="section">copy_n</span></dt>
+<dt><span class="section">erase</span></dt>
+<dt><span class="section">for_each</span></dt>
+<dt><span class="section">insert</span></dt>
+<dt><span class="section">iota</span></dt>
+<dt><span class="section">is_sorted</span></dt>
+<dt><span class="section">overwrite</span></dt>
+<dt><span class="section">push_back</span></dt>
+<dt><span class="section">push_front</span></dt>
+<dt><span class="section">remove_erase</span></dt>
+<dt><span class="section">remove_erase_if</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/new/copy_n.html
==============================================================================
--- branches/release/libs/range/doc/html/range/reference/algorithms/new/copy_n.html (original)
+++ branches/release/libs/range/doc/html/range/reference/algorithms/new/copy_n.html 2010-12-26 10:13:43 EST (Sun, 26 Dec 2010)
@@ -24,10 +24,10 @@
</div>
<div class="section">
<div class="titlepage"><div><div><h5 class="title">
-<a name="range.reference.algorithms.new.copy_n"></a><a class="link" href="copy_n.html" title="copy_n"> copy_n</a>
+<a name="range.reference.algorithms.new.copy_n"></a><a class="link" href="copy_n.html" title="copy_n">copy_n</a>
</h5></div></div></div>
<a name="range.reference.algorithms.new.copy_n.prototype"></a><h6>
-<a name="id854182"></a>
+<a name="id752657"></a>
<a class="link" href="copy_n.html#range.reference.algorithms.new.copy_n.prototype">Prototype</a>
</h6>
<p>
@@ -39,7 +39,7 @@
<p>
</p>
<a name="range.reference.algorithms.new.copy_n.description"></a><h6>
-<a name="id854337"></a>
+<a name="id752815"></a>
<a class="link" href="copy_n.html#range.reference.algorithms.new.copy_n.description">Description</a>
</h6>
<p>
@@ -53,14 +53,14 @@
from <code class="computeroutput"><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">begin</span><span class="special">(</span><span class="identifier">rng</span><span class="special">)</span> <span class="special">+</span> <span class="identifier">n</span><span class="special">)</span></code> to the range <code class="computeroutput"><span class="special">[</span><span class="identifier">out</span><span class="special">,</span> <span class="identifier">out</span> <span class="special">+</span> <span class="identifier">n</span><span class="special">)</span></code>
</p>
<a name="range.reference.algorithms.new.copy_n.definition"></a><h6>
-<a name="id854508"></a>
+<a name="id752985"></a>
<a class="link" href="copy_n.html#range.reference.algorithms.new.copy_n.definition">Definition</a>
</h6>
<p>
Defined in the header file <code class="computeroutput"><span class="identifier">boost</span><span class="special">/</span><span class="identifier">range</span><span class="special">/</span><span class="identifier">algorithm_ext</span><span class="special">/</span><span class="identifier">copy_n</span><span class="special">.</span><span class="identifier">hpp</span></code>
</p>
<a name="range.reference.algorithms.new.copy_n.requirements"></a><h6>
-<a name="id854579"></a>
+<a name="id753056"></a>
<a class="link" href="copy_n.html#range.reference.algorithms.new.copy_n.requirements">Requirements</a>
</h6>
<div class="orderedlist"><ol class="orderedlist" type="1">
@@ -79,7 +79,7 @@
</li>
</ol></div>
<a name="range.reference.algorithms.new.copy_n.complexity"></a><h6>
-<a name="id854691"></a>
+<a name="id753164"></a>
<a class="link" href="copy_n.html#range.reference.algorithms.new.copy_n.complexity">Complexity</a>
</h6>
<p>
Modified: branches/release/libs/range/doc/html/range/reference/algorithms/new/erase.html
==============================================================================
--- branches/release/libs/range/doc/html/range/reference/algorithms/new/erase.html (original)
+++ branches/release/libs/range/doc/html/range/reference/algorithms/new/erase.html 2010-12-26 10:13:43 EST (Sun, 26 Dec 2010)
@@ -24,10 +24,10 @@
</div>
<div class="section">
<div class="titlepage"><div><div><h5 class="title">
-<a name="range.reference.algorithms.new.erase"></a><a class="link" href="erase.html" title="erase"> erase</a>
+<a name="range.reference.algorithms.new.erase"></a><a class="link" href="erase.html" title="erase">erase</a>
</h5></div></div></div>
<a name="range.reference.algorithms.new.erase.prototype"></a><h6>
-<a name="id854746"></a>
+<a name="id753215"></a>
<a class="link" href="erase.html#range.reference.algorithms.new.erase.prototype">Prototype</a>
</h6>
<p>
@@ -41,7 +41,7 @@
<p>
</p>
<a name="range.reference.algorithms.new.erase.description"></a><h6>
-<a name="id854884"></a>
+<a name="id753355"></a>
<a class="link" href="erase.html#range.reference.algorithms.new.erase.description">Description</a>
</h6>
<p>
@@ -58,14 +58,14 @@
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.new.erase.definition"></a><h6>
-<a name="id855182"></a>
+<a name="id753654"></a>
<a class="link" href="erase.html#range.reference.algorithms.new.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.new.erase.requirements"></a><h6>
-<a name="id855252"></a>
+<a name="id753723"></a>
<a class="link" href="erase.html#range.reference.algorithms.new.erase.requirements">Requirements</a>
</h6>
<div class="orderedlist"><ol class="orderedlist" type="1"><li class="listitem">
@@ -73,7 +73,7 @@
erase of an iterator range.
</li></ol></div>
<a name="range.reference.algorithms.new.erase.complexity"></a><h6>
-<a name="id855300"></a>
+<a name="id753767"></a>
<a class="link" href="erase.html#range.reference.algorithms.new.erase.complexity">Complexity</a>
</h6>
<p>
Modified: branches/release/libs/range/doc/html/range/reference/algorithms/new/for_each.html
==============================================================================
--- branches/release/libs/range/doc/html/range/reference/algorithms/new/for_each.html (original)
+++ branches/release/libs/range/doc/html/range/reference/algorithms/new/for_each.html 2010-12-26 10:13:43 EST (Sun, 26 Dec 2010)
@@ -24,10 +24,10 @@
</div>
<div class="section">
<div class="titlepage"><div><div><h5 class="title">
-<a name="range.reference.algorithms.new.for_each"></a><a class="link" href="for_each.html" title="for_each"> for_each</a>
+<a name="range.reference.algorithms.new.for_each"></a><a class="link" href="for_each.html" title="for_each">for_each</a>
</h5></div></div></div>
<a name="range.reference.algorithms.new.for_each.prototype"></a><h6>
-<a name="id855365"></a>
+<a name="id753831"></a>
<a class="link" href="for_each.html#range.reference.algorithms.new.for_each.prototype">Prototype</a>
</h6>
<p>
@@ -72,7 +72,7 @@
<p>
</p>
<a name="range.reference.algorithms.new.for_each.description"></a><h6>
-<a name="id855933"></a>
+<a name="id754406"></a>
<a class="link" href="for_each.html#range.reference.algorithms.new.for_each.description">Description</a>
</h6>
<p>
@@ -88,14 +88,14 @@
It is safe to call this function with unequal length ranges.
</p>
<a name="range.reference.algorithms.new.for_each.definition"></a><h6>
-<a name="id856362"></a>
+<a name="id754561"></a>
<a class="link" href="for_each.html#range.reference.algorithms.new.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.new.for_each.requirements"></a><h6>
-<a name="id856434"></a>
+<a name="id754632"></a>
<a class="link" href="for_each.html#range.reference.algorithms.new.for_each.requirements">Requirements</a>
</h6>
<div class="orderedlist"><ol class="orderedlist" type="1">
@@ -125,7 +125,7 @@
</li>
</ol></div>
<a name="range.reference.algorithms.new.for_each.complexity"></a><h6>
-<a name="id856602"></a>
+<a name="id754793"></a>
<a class="link" href="for_each.html#range.reference.algorithms.new.for_each.complexity">Complexity</a>
</h6>
<p>
Modified: branches/release/libs/range/doc/html/range/reference/algorithms/new/insert.html
==============================================================================
--- branches/release/libs/range/doc/html/range/reference/algorithms/new/insert.html (original)
+++ branches/release/libs/range/doc/html/range/reference/algorithms/new/insert.html 2010-12-26 10:13:43 EST (Sun, 26 Dec 2010)
@@ -24,10 +24,10 @@
</div>
<div class="section">
<div class="titlepage"><div><div><h5 class="title">
-<a name="range.reference.algorithms.new.insert"></a><a class="link" href="insert.html" title="insert"> insert</a>
+<a name="range.reference.algorithms.new.insert"></a><a class="link" href="insert.html" title="insert">insert</a>
</h5></div></div></div>
<a name="range.reference.algorithms.new.insert.prototype"></a><h6>
-<a name="id856708"></a>
+<a name="id754896"></a>
<a class="link" href="insert.html#range.reference.algorithms.new.insert.prototype">Prototype</a>
</h6>
<p>
@@ -44,7 +44,7 @@
<p>
</p>
<a name="range.reference.algorithms.new.insert.description"></a><h6>
-<a name="id856875"></a>
+<a name="id755066"></a>
<a class="link" href="insert.html#range.reference.algorithms.new.insert.description">Description</a>
</h6>
<p>
@@ -54,14 +54,14 @@
<code class="computeroutput"><span class="identifier">target</span></code>.
</p>
<a name="range.reference.algorithms.new.insert.definition"></a><h6>
-<a name="id856943"></a>
+<a name="id755132"></a>
<a class="link" href="insert.html#range.reference.algorithms.new.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.new.insert.requirements"></a><h6>
-<a name="id857014"></a>
+<a name="id755202"></a>
<a class="link" href="insert.html#range.reference.algorithms.new.insert.requirements">Requirements</a>
</h6>
<div class="orderedlist"><ol class="orderedlist" type="1">
@@ -81,7 +81,7 @@
</li>
</ol></div>
<a name="range.reference.algorithms.new.insert.complexity"></a><h6>
-<a name="id857116"></a>
+<a name="id755300"></a>
<a class="link" href="insert.html#range.reference.algorithms.new.insert.complexity">Complexity</a>
</h6>
<p>
Modified: branches/release/libs/range/doc/html/range/reference/algorithms/new/iota.html
==============================================================================
--- branches/release/libs/range/doc/html/range/reference/algorithms/new/iota.html (original)
+++ branches/release/libs/range/doc/html/range/reference/algorithms/new/iota.html 2010-12-26 10:13:43 EST (Sun, 26 Dec 2010)
@@ -24,10 +24,10 @@
</div>
<div class="section">
<div class="titlepage"><div><div><h5 class="title">
-<a name="range.reference.algorithms.new.iota"></a><a class="link" href="iota.html" title="iota"> iota</a>
+<a name="range.reference.algorithms.new.iota"></a><a class="link" href="iota.html" title="iota">iota</a>
</h5></div></div></div>
<a name="range.reference.algorithms.new.iota.prototype"></a><h6>
-<a name="id857184"></a>
+<a name="id755365"></a>
<a class="link" href="iota.html#range.reference.algorithms.new.iota.prototype">Prototype</a>
</h6>
<p>
@@ -39,7 +39,7 @@
<p>
</p>
<a name="range.reference.algorithms.new.iota.description"></a><h6>
-<a name="id857308"></a>
+<a name="id755491"></a>
<a class="link" href="iota.html#range.reference.algorithms.new.iota.description">Description</a>
</h6>
<p>
@@ -50,14 +50,14 @@
<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.new.iota.definition"></a><h6>
-<a name="id857444"></a>
+<a name="id755627"></a>
<a class="link" href="iota.html#range.reference.algorithms.new.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.new.iota.requirements"></a><h6>
-<a name="id857514"></a>
+<a name="id755697"></a>
<a class="link" href="iota.html#range.reference.algorithms.new.iota.requirements">Requirements</a>
</h6>
<div class="orderedlist"><ol class="orderedlist" type="1">
@@ -73,7 +73,7 @@
</li>
</ol></div>
<a name="range.reference.algorithms.new.iota.complexity"></a><h6>
-<a name="id857596"></a>
+<a name="id755777"></a>
<a class="link" href="iota.html#range.reference.algorithms.new.iota.complexity">Complexity</a>
</h6>
<p>
Modified: branches/release/libs/range/doc/html/range/reference/algorithms/new/is_sorted.html
==============================================================================
--- branches/release/libs/range/doc/html/range/reference/algorithms/new/is_sorted.html (original)
+++ branches/release/libs/range/doc/html/range/reference/algorithms/new/is_sorted.html 2010-12-26 10:13:43 EST (Sun, 26 Dec 2010)
@@ -24,10 +24,10 @@
</div>
<div class="section">
<div class="titlepage"><div><div><h5 class="title">
-<a name="range.reference.algorithms.new.is_sorted"></a><a class="link" href="is_sorted.html" title="is_sorted"> is_sorted</a>
+<a name="range.reference.algorithms.new.is_sorted"></a><a class="link" href="is_sorted.html" title="is_sorted">is_sorted</a>
</h5></div></div></div>
<a name="range.reference.algorithms.new.is_sorted.prototype"></a><h6>
-<a name="id857672"></a>
+<a name="id755851"></a>
<a class="link" href="is_sorted.html#range.reference.algorithms.new.is_sorted.prototype">Prototype</a>
</h6>
<p>
@@ -42,7 +42,7 @@
<p>
</p>
<a name="range.reference.algorithms.new.is_sorted.description"></a><h6>
-<a name="id857864"></a>
+<a name="id756045"></a>
<a class="link" href="is_sorted.html#range.reference.algorithms.new.is_sorted.description">Description</a>
</h6>
<p>
@@ -58,14 +58,14 @@
is <code class="computeroutput"><span class="keyword">true</span></code>.
</p>
<a name="range.reference.algorithms.new.is_sorted.definition"></a><h6>
-<a name="id858053"></a>
+<a name="id756233"></a>
<a class="link" href="is_sorted.html#range.reference.algorithms.new.is_sorted.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">is_sorted</span><span class="special">.</span><span class="identifier">hpp</span></code>
</p>
<a name="range.reference.algorithms.new.is_sorted.requirements"></a><h6>
-<a name="id858125"></a>
+<a name="id756303"></a>
<a class="link" href="is_sorted.html#range.reference.algorithms.new.is_sorted.requirements">Requirements</a>
</h6>
<div class="orderedlist"><ol class="orderedlist" type="1">
@@ -85,7 +85,7 @@
</li>
</ol></div>
<a name="range.reference.algorithms.new.is_sorted.complexity"></a><h6>
-<a name="id858238"></a>
+<a name="id756412"></a>
<a class="link" href="is_sorted.html#range.reference.algorithms.new.is_sorted.complexity">Complexity</a>
</h6>
<p>
Modified: branches/release/libs/range/doc/html/range/reference/algorithms/new/overwrite.html
==============================================================================
--- branches/release/libs/range/doc/html/range/reference/algorithms/new/overwrite.html (original)
+++ branches/release/libs/range/doc/html/range/reference/algorithms/new/overwrite.html 2010-12-26 10:13:43 EST (Sun, 26 Dec 2010)
@@ -24,10 +24,10 @@
</div>
<div class="section">
<div class="titlepage"><div><div><h5 class="title">
-<a name="range.reference.algorithms.new.overwrite"></a><a class="link" href="overwrite.html" title="overwrite"> overwrite</a>
+<a name="range.reference.algorithms.new.overwrite"></a><a class="link" href="overwrite.html" title="overwrite">overwrite</a>
</h5></div></div></div>
<a name="range.reference.algorithms.new.overwrite.prototype"></a><h6>
-<a name="id858305"></a>
+<a name="id756477"></a>
<a class="link" href="overwrite.html#range.reference.algorithms.new.overwrite.prototype">Prototype</a>
</h6>
<p>
@@ -43,7 +43,7 @@
<p>
</p>
<a name="range.reference.algorithms.new.overwrite.description"></a><h6>
-<a name="id858440"></a>
+<a name="id756611"></a>
<a class="link" href="overwrite.html#range.reference.algorithms.new.overwrite.description">Description</a>
</h6>
<p>
@@ -52,14 +52,14 @@
into the range <code class="computeroutput"><span class="identifier">to</span></code>.
</p>
<a name="range.reference.algorithms.new.overwrite.definition"></a><h6>
-<a name="id858497"></a>
+<a name="id756666"></a>
<a class="link" href="overwrite.html#range.reference.algorithms.new.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.new.overwrite.requirements"></a><h6>
-<a name="id858568"></a>
+<a name="id756737"></a>
<a class="link" href="overwrite.html#range.reference.algorithms.new.overwrite.requirements">Requirements</a>
</h6>
<div class="orderedlist"><ol class="orderedlist" type="1">
@@ -88,7 +88,7 @@
</li>
</ol></div>
<a name="range.reference.algorithms.new.overwrite.complexity"></a><h6>
-<a name="id858752"></a>
+<a name="id756914"></a>
<a class="link" href="overwrite.html#range.reference.algorithms.new.overwrite.complexity">Complexity</a>
</h6>
<p>
Modified: branches/release/libs/range/doc/html/range/reference/algorithms/new/push_back.html
==============================================================================
--- branches/release/libs/range/doc/html/range/reference/algorithms/new/push_back.html (original)
+++ branches/release/libs/range/doc/html/range/reference/algorithms/new/push_back.html 2010-12-26 10:13:43 EST (Sun, 26 Dec 2010)
@@ -24,10 +24,10 @@
</div>
<div class="section">
<div class="titlepage"><div><div><h5 class="title">
-<a name="range.reference.algorithms.new.push_back"></a><a class="link" href="push_back.html" title="push_back"> push_back</a>
+<a name="range.reference.algorithms.new.push_back"></a><a class="link" href="push_back.html" title="push_back">push_back</a>
</h5></div></div></div>
<a name="range.reference.algorithms.new.push_back.prototype"></a><h6>
-<a name="id858820"></a>
+<a name="id756978"></a>
<a class="link" href="push_back.html#range.reference.algorithms.new.push_back.prototype">Prototype</a>
</h6>
<p>
@@ -43,7 +43,7 @@
<p>
</p>
<a name="range.reference.algorithms.new.push_back.description"></a><h6>
-<a name="id858958"></a>
+<a name="id757117"></a>
<a class="link" href="push_back.html#range.reference.algorithms.new.push_back.description">Description</a>
</h6>
<p>
@@ -52,14 +52,14 @@
to the back of the container <code class="computeroutput"><span class="identifier">target</span></code>.
</p>
<a name="range.reference.algorithms.new.push_back.definition"></a><h6>
-<a name="id859016"></a>
+<a name="id757173"></a>
<a class="link" href="push_back.html#range.reference.algorithms.new.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.new.push_back.requirements"></a><h6>
-<a name="id859086"></a>
+<a name="id757243"></a>
<a class="link" href="push_back.html#range.reference.algorithms.new.push_back.requirements">Requirements</a>
</h6>
<div class="orderedlist"><ol class="orderedlist" type="1">
@@ -79,7 +79,7 @@
</li>
</ol></div>
<a name="range.reference.algorithms.new.push_back.complexity"></a><h6>
-<a name="id859203"></a>
+<a name="id757354"></a>
<a class="link" href="push_back.html#range.reference.algorithms.new.push_back.complexity">Complexity</a>
</h6>
<p>
Modified: branches/release/libs/range/doc/html/range/reference/algorithms/new/push_front.html
==============================================================================
--- branches/release/libs/range/doc/html/range/reference/algorithms/new/push_front.html (original)
+++ branches/release/libs/range/doc/html/range/reference/algorithms/new/push_front.html 2010-12-26 10:13:43 EST (Sun, 26 Dec 2010)
@@ -24,10 +24,10 @@
</div>
<div class="section">
<div class="titlepage"><div><div><h5 class="title">
-<a name="range.reference.algorithms.new.push_front"></a><a class="link" href="push_front.html" title="push_front"> push_front</a>
+<a name="range.reference.algorithms.new.push_front"></a><a class="link" href="push_front.html" title="push_front">push_front</a>
</h5></div></div></div>
<a name="range.reference.algorithms.new.push_front.prototype"></a><h6>
-<a name="id859272"></a>
+<a name="id757420"></a>
<a class="link" href="push_front.html#range.reference.algorithms.new.push_front.prototype">Prototype</a>
</h6>
<p>
@@ -43,7 +43,7 @@
<p>
</p>
<a name="range.reference.algorithms.new.push_front.description"></a><h6>
-<a name="id859409"></a>
+<a name="id757558"></a>
<a class="link" href="push_front.html#range.reference.algorithms.new.push_front.description">Description</a>
</h6>
<p>
@@ -52,14 +52,14 @@
to the front of the container <code class="computeroutput"><span class="identifier">target</span></code>.
</p>
<a name="range.reference.algorithms.new.push_front.definition"></a><h6>
-<a name="id859465"></a>
+<a name="id757613"></a>
<a class="link" href="push_front.html#range.reference.algorithms.new.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.new.push_front.requirements"></a><h6>
-<a name="id859537"></a>
+<a name="id757682"></a>
<a class="link" href="push_front.html#range.reference.algorithms.new.push_front.requirements">Requirements</a>
</h6>
<div class="orderedlist"><ol class="orderedlist" type="1">
@@ -79,7 +79,7 @@
</li>
</ol></div>
<a name="range.reference.algorithms.new.push_front.complexity"></a><h6>
-<a name="id859654"></a>
+<a name="id757794"></a>
<a class="link" href="push_front.html#range.reference.algorithms.new.push_front.complexity">Complexity</a>
</h6>
<p>
Modified: branches/release/libs/range/doc/html/range/reference/algorithms/new/remove_erase.html
==============================================================================
--- branches/release/libs/range/doc/html/range/reference/algorithms/new/remove_erase.html (original)
+++ branches/release/libs/range/doc/html/range/reference/algorithms/new/remove_erase.html 2010-12-26 10:13:43 EST (Sun, 26 Dec 2010)
@@ -24,10 +24,10 @@
</div>
<div class="section">
<div class="titlepage"><div><div><h5 class="title">
-<a name="range.reference.algorithms.new.remove_erase"></a><a class="link" href="remove_erase.html" title="remove_erase"> remove_erase</a>
+<a name="range.reference.algorithms.new.remove_erase"></a><a class="link" href="remove_erase.html" title="remove_erase">remove_erase</a>
</h5></div></div></div>
<a name="range.reference.algorithms.new.remove_erase.prototype"></a><h6>
-<a name="id859722"></a>
+<a name="id757860"></a>
<a class="link" href="remove_erase.html#range.reference.algorithms.new.remove_erase.prototype">Prototype</a>
</h6>
<p>
@@ -40,7 +40,7 @@
<p>
</p>
<a name="range.reference.algorithms.new.remove_erase.description"></a><h6>
-<a name="id859858"></a>
+<a name="id757996"></a>
<a class="link" href="remove_erase.html#range.reference.algorithms.new.remove_erase.description">Description</a>
</h6>
<p>
@@ -50,14 +50,14 @@
algorithm which merely rearranges elements.
</p>
<a name="range.reference.algorithms.new.remove_erase.definition"></a><h6>
-<a name="id859918"></a>
+<a name="id758053"></a>
<a class="link" href="remove_erase.html#range.reference.algorithms.new.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.new.remove_erase.requirements"></a><h6>
-<a name="id859989"></a>
+<a name="id758124"></a>
<a class="link" href="remove_erase.html#range.reference.algorithms.new.remove_erase.requirements">Requirements</a>
</h6>
<div class="orderedlist"><ol class="orderedlist" type="1"><li class="listitem">
@@ -65,7 +65,7 @@
erase of an iterator range.
</li></ol></div>
<a name="range.reference.algorithms.new.remove_erase.complexity"></a><h6>
-<a name="id860035"></a>
+<a name="id758169"></a>
<a class="link" href="remove_erase.html#range.reference.algorithms.new.remove_erase.complexity">Complexity</a>
</h6>
<p>
Modified: branches/release/libs/range/doc/html/range/reference/algorithms/new/remove_erase_if.html
==============================================================================
--- branches/release/libs/range/doc/html/range/reference/algorithms/new/remove_erase_if.html (original)
+++ branches/release/libs/range/doc/html/range/reference/algorithms/new/remove_erase_if.html 2010-12-26 10:13:43 EST (Sun, 26 Dec 2010)
@@ -24,11 +24,10 @@
</div>
<div class="section">
<div class="titlepage"><div><div><h5 class="title">
-<a name="range.reference.algorithms.new.remove_erase_if"></a><a class="link" href="remove_erase_if.html" title="remove_erase_if">
- remove_erase_if</a>
+<a name="range.reference.algorithms.new.remove_erase_if"></a><a class="link" href="remove_erase_if.html" title="remove_erase_if">remove_erase_if</a>
</h5></div></div></div>
<a name="range.reference.algorithms.new.remove_erase_if.prototype"></a><h6>
-<a name="id860104"></a>
+<a name="id758234"></a>
<a class="link" href="remove_erase_if.html#range.reference.algorithms.new.remove_erase_if.prototype">Prototype</a>
</h6>
<p>
@@ -41,7 +40,7 @@
<p>
</p>
<a name="range.reference.algorithms.new.remove_erase_if.description"></a><h6>
-<a name="id860229"></a>
+<a name="id758361"></a>
<a class="link" href="remove_erase_if.html#range.reference.algorithms.new.remove_erase_if.description">Description</a>
</h6>
<p>
@@ -52,14 +51,14 @@
algorithm which merely rearranges elements.
</p>
<a name="range.reference.algorithms.new.remove_erase_if.definition"></a><h6>
-<a name="id860311"></a>
+<a name="id758441"></a>
<a class="link" href="remove_erase_if.html#range.reference.algorithms.new.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.new.remove_erase_if.requirements"></a><h6>
-<a name="id860382"></a>
+<a name="id758512"></a>
<a class="link" href="remove_erase_if.html#range.reference.algorithms.new.remove_erase_if.requirements">Requirements</a>
</h6>
<div class="orderedlist"><ol class="orderedlist" type="1">
@@ -73,7 +72,7 @@
</li>
</ol></div>
<a name="range.reference.algorithms.new.remove_erase_if.complexity"></a><h6>
-<a name="id860458"></a>
+<a name="id758586"></a>
<a class="link" href="remove_erase_if.html#range.reference.algorithms.new.remove_erase_if.complexity">Complexity</a>
</h6>
<p>
Modified: branches/release/libs/range/doc/html/range/reference/algorithms/non_mutating.html
==============================================================================
--- branches/release/libs/range/doc/html/range/reference/algorithms/non_mutating.html (original)
+++ branches/release/libs/range/doc/html/range/reference/algorithms/non_mutating.html 2010-12-26 10:13:43 EST (Sun, 26 Dec 2010)
@@ -5,7 +5,7 @@
<link rel="stylesheet" href="../../../../../../../doc/src/boostbook.css" type="text/css">
<meta name="generator" content="DocBook XSL Stylesheets V1.75.2">
<link rel="home" href="../../../index.html" title="Chapter 1. Range 2.0">
-<link rel="up" href="../algorithms.html" title="Range Algorithm">
+<link rel="up" href="../algorithms.html" title="Range Algorithms">
<link rel="prev" href="mutating/unique_copy.html" title="unique_copy">
<link rel="next" href="non_mutating/adjacent_find.html" title="adjacent_find">
</head>
@@ -24,45 +24,29 @@
</div>
<div class="section">
<div class="titlepage"><div><div><h4 class="title">
-<a name="range.reference.algorithms.non_mutating"></a><a class="link" href="non_mutating.html" title="Non-mutating algorithms"> Non-mutating
+<a name="range.reference.algorithms.non_mutating"></a><a class="link" href="non_mutating.html" title="Non-mutating algorithms">Non-mutating
algorithms</a>
</h4></div></div></div>
<div class="toc"><dl>
-<dt><span class="section"><a href="non_mutating/adjacent_find.html">
- adjacent_find</a></span></dt>
-<dt><span class="section"><a href="non_mutating/binary_search.html">
- binary_search</a></span></dt>
-<dt><span class="section"> count</span></dt>
-<dt><span class="section"><a href="non_mutating/count_if.html">
- count_if</a></span></dt>
-<dt><span class="section"> equal</span></dt>
-<dt><span class="section"><a href="non_mutating/equal_range.html">
- equal_range</a></span></dt>
-<dt><span class="section"><a href="non_mutating/for_each.html">
- for_each</a></span></dt>
-<dt><span class="section"> find</span></dt>
-<dt><span class="section"><a href="non_mutating/find_end.html">
- find_end</a></span></dt>
-<dt><span class="section"><a href="non_mutating/find_first_of.html">
- find_first_of</a></span></dt>
-<dt><span class="section"><a href="non_mutating/find_if.html">
- find_if</a></span></dt>
-<dt><span class="section"><a href="non_mutating/lexicographical_compare.html">
- lexicographical_compare</a></span></dt>
-<dt><span class="section"><a href="non_mutating/lower_bound.html">
- lower_bound</a></span></dt>
-<dt><span class="section"><a href="non_mutating/max_element.html">
- max_element</a></span></dt>
-<dt><span class="section"><a href="non_mutating/min_element.html">
- min_element</a></span></dt>
-<dt><span class="section"><a href="non_mutating/mismatch.html">
- mismatch</a></span></dt>
-<dt><span class="section"><a href="non_mutating/search.html">
- search</a></span></dt>
-<dt><span class="section"><a href="non_mutating/search_n.html">
- search_n</a></span></dt>
-<dt><span class="section"><a href="non_mutating/upper_bound.html">
- upper_bound</a></span></dt>
+<dt><span class="section">adjacent_find</span></dt>
+<dt><span class="section">binary_search</span></dt>
+<dt><span class="section">count</span></dt>
+<dt><span class="section">count_if</span></dt>
+<dt><span class="section">equal</span></dt>
+<dt><span class="section">equal_range</span></dt>
+<dt><span class="section">for_each</span></dt>
+<dt><span class="section">find</span></dt>
+<dt><span class="section">find_end</span></dt>
+<dt><span class="section">find_first_of</span></dt>
+<dt><span class="section">find_if</span></dt>
+<dt><span class="section">lexicographical_compare</span></dt>
+<dt><span class="section">lower_bound</span></dt>
+<dt><span class="section">max_element</span></dt>
+<dt><span class="section">min_element</span></dt>
+<dt><span class="section">mismatch</span></dt>
+<dt><span class="section">search</span></dt>
+<dt><span class="section">search_n</span></dt>
+<dt><span class="section">upper_bound</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/non_mutating/adjacent_find.html
==============================================================================
--- branches/release/libs/range/doc/html/range/reference/algorithms/non_mutating/adjacent_find.html (original)
+++ branches/release/libs/range/doc/html/range/reference/algorithms/non_mutating/adjacent_find.html 2010-12-26 10:13:43 EST (Sun, 26 Dec 2010)
@@ -24,11 +24,10 @@
</div>
<div class="section">
<div class="titlepage"><div><div><h5 class="title">
-<a name="range.reference.algorithms.non_mutating.adjacent_find"></a><a class="link" href="adjacent_find.html" title="adjacent_find">
- adjacent_find</a>
+<a name="range.reference.algorithms.non_mutating.adjacent_find"></a><a class="link" href="adjacent_find.html" title="adjacent_find">adjacent_find</a>
</h5></div></div></div>
<a name="range.reference.algorithms.non_mutating.adjacent_find.prototype"></a><h6>
-<a name="id819797"></a>
+<a name="id719114"></a>
<a class="link" href="adjacent_find.html#range.reference.algorithms.non_mutating.adjacent_find.prototype">Prototype</a>
</h6>
<p>
@@ -77,7 +76,7 @@
<p>
</p>
<a name="range.reference.algorithms.non_mutating.adjacent_find.description"></a><h6>
-<a name="id820754"></a>
+<a name="id720090"></a>
<a class="link" href="adjacent_find.html#range.reference.algorithms.non_mutating.adjacent_find.description">Description</a>
</h6>
<p>
@@ -98,14 +97,14 @@
is <code class="computeroutput"><span class="keyword">true</span></code>.
</p>
<a name="range.reference.algorithms.non_mutating.adjacent_find.definition"></a><h6>
-<a name="id820961"></a>
+<a name="id720298"></a>
<a class="link" href="adjacent_find.html#range.reference.algorithms.non_mutating.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.non_mutating.adjacent_find.requirements"></a><h6>
-<a name="id821033"></a>
+<a name="id720368"></a>
<a class="link" href="adjacent_find.html#range.reference.algorithms.non_mutating.adjacent_find.requirements">Requirements</a>
</h6>
<p>
@@ -143,7 +142,7 @@
</li>
</ul></div>
<a name="range.reference.algorithms.non_mutating.adjacent_find.complexity"></a><h6>
-<a name="id821500"></a>
+<a name="id720558"></a>
<a class="link" href="adjacent_find.html#range.reference.algorithms.non_mutating.adjacent_find.complexity">Complexity</a>
</h6>
<p>
Modified: branches/release/libs/range/doc/html/range/reference/algorithms/non_mutating/binary_search.html
==============================================================================
--- branches/release/libs/range/doc/html/range/reference/algorithms/non_mutating/binary_search.html (original)
+++ branches/release/libs/range/doc/html/range/reference/algorithms/non_mutating/binary_search.html 2010-12-26 10:13:43 EST (Sun, 26 Dec 2010)
@@ -24,11 +24,10 @@
</div>
<div class="section">
<div class="titlepage"><div><div><h5 class="title">
-<a name="range.reference.algorithms.non_mutating.binary_search"></a><a class="link" href="binary_search.html" title="binary_search">
- binary_search</a>
+<a name="range.reference.algorithms.non_mutating.binary_search"></a><a class="link" href="binary_search.html" title="binary_search">binary_search</a>
</h5></div></div></div>
<a name="range.reference.algorithms.non_mutating.binary_search.prototype"></a><h6>
-<a name="id821602"></a>
+<a name="id720658"></a>
<a class="link" href="binary_search.html#range.reference.algorithms.non_mutating.binary_search.prototype">Prototype</a>
</h6>
<p>
@@ -43,7 +42,7 @@
<p>
</p>
<a name="range.reference.algorithms.non_mutating.binary_search.description"></a><h6>
-<a name="id821876"></a>
+<a name="id720934"></a>
<a class="link" href="binary_search.html#range.reference.algorithms.non_mutating.binary_search.description">Description</a>
</h6>
<p>
@@ -53,14 +52,14 @@
range <code class="computeroutput"><span class="identifier">rng</span></code>.
</p>
<a name="range.reference.algorithms.non_mutating.binary_search.definition"></a><h6>
-<a name="id821945"></a>
+<a name="id721000"></a>
<a class="link" href="binary_search.html#range.reference.algorithms.non_mutating.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.non_mutating.binary_search.requirements"></a><h6>
-<a name="id822017"></a>
+<a name="id721071"></a>
<a class="link" href="binary_search.html#range.reference.algorithms.non_mutating.binary_search.requirements">Requirements</a>
</h6>
<p>
@@ -111,7 +110,7 @@
</li>
</ul></div>
<a name="range.reference.algorithms.non_mutating.binary_search.precondition_"></a><h6>
-<a name="id822294"></a>
+<a name="id721340"></a>
<a class="link" href="binary_search.html#range.reference.algorithms.non_mutating.binary_search.precondition_">Precondition:</a>
</h6>
<p>
@@ -129,7 +128,7 @@
order according to the function object <code class="computeroutput"><span class="identifier">pred</span></code>.
</p>
<a name="range.reference.algorithms.non_mutating.binary_search.complexity"></a><h6>
-<a name="id822388"></a>
+<a name="id721432"></a>
<a class="link" href="binary_search.html#range.reference.algorithms.non_mutating.binary_search.complexity">Complexity</a>
</h6>
<p>
Modified: branches/release/libs/range/doc/html/range/reference/algorithms/non_mutating/count.html
==============================================================================
--- branches/release/libs/range/doc/html/range/reference/algorithms/non_mutating/count.html (original)
+++ branches/release/libs/range/doc/html/range/reference/algorithms/non_mutating/count.html 2010-12-26 10:13:43 EST (Sun, 26 Dec 2010)
@@ -24,10 +24,10 @@
</div>
<div class="section">
<div class="titlepage"><div><div><h5 class="title">
-<a name="range.reference.algorithms.non_mutating.count"></a><a class="link" href="count.html" title="count"> count</a>
+<a name="range.reference.algorithms.non_mutating.count"></a><a class="link" href="count.html" title="count">count</a>
</h5></div></div></div>
<a name="range.reference.algorithms.non_mutating.count.prototype"></a><h6>
-<a name="id822553"></a>
+<a name="id721595"></a>
<a class="link" href="count.html#range.reference.algorithms.non_mutating.count.prototype">Prototype</a>
</h6>
<p>
@@ -44,7 +44,7 @@
<p>
</p>
<a name="range.reference.algorithms.non_mutating.count.description"></a><h6>
-<a name="id822843"></a>
+<a name="id721889"></a>
<a class="link" href="count.html#range.reference.algorithms.non_mutating.count.description">Description</a>
</h6>
<p>
@@ -54,14 +54,14 @@
is <code class="computeroutput"><span class="keyword">true</span></code>.
</p>
<a name="range.reference.algorithms.non_mutating.count.definition"></a><h6>
-<a name="id822930"></a>
+<a name="id721977"></a>
<a class="link" href="count.html#range.reference.algorithms.non_mutating.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.non_mutating.count.requirements"></a><h6>
-<a name="id823001"></a>
+<a name="id722047"></a>
<a class="link" href="count.html#range.reference.algorithms.non_mutating.count.requirements">Requirements</a>
</h6>
<div class="itemizedlist"><ul class="itemizedlist" type="disc">
@@ -84,7 +84,7 @@
</li>
</ul></div>
<a name="range.reference.algorithms.non_mutating.count.complexity"></a><h6>
-<a name="id823139"></a>
+<a name="id722179"></a>
<a class="link" href="count.html#range.reference.algorithms.non_mutating.count.complexity">Complexity</a>
</h6>
<p>
Modified: branches/release/libs/range/doc/html/range/reference/algorithms/non_mutating/count_if.html
==============================================================================
--- branches/release/libs/range/doc/html/range/reference/algorithms/non_mutating/count_if.html (original)
+++ branches/release/libs/range/doc/html/range/reference/algorithms/non_mutating/count_if.html 2010-12-26 10:13:43 EST (Sun, 26 Dec 2010)
@@ -24,11 +24,10 @@
</div>
<div class="section">
<div class="titlepage"><div><div><h5 class="title">
-<a name="range.reference.algorithms.non_mutating.count_if"></a><a class="link" href="count_if.html" title="count_if">
- count_if</a>
+<a name="range.reference.algorithms.non_mutating.count_if"></a><a class="link" href="count_if.html" title="count_if">count_if</a>
</h5></div></div></div>
<a name="range.reference.algorithms.non_mutating.count_if.prototype"></a><h6>
-<a name="id823207"></a>
+<a name="id722244"></a>
<a class="link" href="count_if.html#range.reference.algorithms.non_mutating.count_if.prototype">Prototype</a>
</h6>
<p>
@@ -41,7 +40,7 @@
<p>
</p>
<a name="range.reference.algorithms.non_mutating.count_if.description"></a><h6>
-<a name="id823363"></a>
+<a name="id722401"></a>
<a class="link" href="count_if.html#range.reference.algorithms.non_mutating.count_if.description">Description</a>
</h6>
<p>
@@ -51,14 +50,14 @@
is <code class="computeroutput"><span class="keyword">true</span></code>.
</p>
<a name="range.reference.algorithms.non_mutating.count_if.definition"></a><h6>
-<a name="id823454"></a>
+<a name="id722491"></a>
<a class="link" href="count_if.html#range.reference.algorithms.non_mutating.count_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">count_if</span><span class="special">.</span><span class="identifier">hpp</span></code>
</p>
<a name="range.reference.algorithms.non_mutating.count_if.requirements"></a><h6>
-<a name="id823524"></a>
+<a name="id722560"></a>
<a class="link" href="count_if.html#range.reference.algorithms.non_mutating.count_if.requirements">Requirements</a>
</h6>
<div class="itemizedlist"><ul class="itemizedlist" type="disc">
@@ -81,7 +80,7 @@
</li>
</ul></div>
<a name="range.reference.algorithms.non_mutating.count_if.complexity"></a><h6>
-<a name="id823661"></a>
+<a name="id722692"></a>
<a class="link" href="count_if.html#range.reference.algorithms.non_mutating.count_if.complexity">Complexity</a>
</h6>
<p>
Modified: branches/release/libs/range/doc/html/range/reference/algorithms/non_mutating/equal.html
==============================================================================
--- branches/release/libs/range/doc/html/range/reference/algorithms/non_mutating/equal.html (original)
+++ branches/release/libs/range/doc/html/range/reference/algorithms/non_mutating/equal.html 2010-12-26 10:13:43 EST (Sun, 26 Dec 2010)
@@ -24,10 +24,10 @@
</div>
<div class="section">
<div class="titlepage"><div><div><h5 class="title">
-<a name="range.reference.algorithms.non_mutating.equal"></a><a class="link" href="equal.html" title="equal"> equal</a>
+<a name="range.reference.algorithms.non_mutating.equal"></a><a class="link" href="equal.html" title="equal">equal</a>
</h5></div></div></div>
<a name="range.reference.algorithms.non_mutating.equal.prototype"></a><h6>
-<a name="id823739"></a>
+<a name="id722767"></a>
<a class="link" href="equal.html#range.reference.algorithms.non_mutating.equal.prototype">Prototype</a>
</h6>
<p>
@@ -52,7 +52,7 @@
<p>
</p>
<a name="range.reference.algorithms.non_mutating.equal.description"></a><h6>
-<a name="id824018"></a>
+<a name="id723049"></a>
<a class="link" href="equal.html#range.reference.algorithms.non_mutating.equal.description">Description</a>
</h6>
<p>
@@ -70,14 +70,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.non_mutating.equal.definition"></a><h6>
-<a name="id824254"></a>
+<a name="id723283"></a>
<a class="link" href="equal.html#range.reference.algorithms.non_mutating.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.non_mutating.equal.requirements"></a><h6>
-<a name="id824325"></a>
+<a name="id723353"></a>
<a class="link" href="equal.html#range.reference.algorithms.non_mutating.equal.requirements">Requirements</a>
</h6>
<p>
@@ -138,7 +138,7 @@
</li>
</ul></div>
<a name="range.reference.algorithms.non_mutating.equal.complexity"></a><h6>
-<a name="id824650"></a>
+<a name="id723663"></a>
<a class="link" href="equal.html#range.reference.algorithms.non_mutating.equal.complexity">Complexity</a>
</h6>
<p>
Modified: branches/release/libs/range/doc/html/range/reference/algorithms/non_mutating/equal_range.html
==============================================================================
--- branches/release/libs/range/doc/html/range/reference/algorithms/non_mutating/equal_range.html (original)
+++ branches/release/libs/range/doc/html/range/reference/algorithms/non_mutating/equal_range.html 2010-12-26 10:13:43 EST (Sun, 26 Dec 2010)
@@ -24,11 +24,10 @@
</div>
<div class="section">
<div class="titlepage"><div><div><h5 class="title">
-<a name="range.reference.algorithms.non_mutating.equal_range"></a><a class="link" href="equal_range.html" title="equal_range">
- equal_range</a>
+<a name="range.reference.algorithms.non_mutating.equal_range"></a><a class="link" href="equal_range.html" title="equal_range">equal_range</a>
</h5></div></div></div>
<a name="range.reference.algorithms.non_mutating.equal_range.prototype"></a><h6>
-<a name="id824745"></a>
+<a name="id723754"></a>
<a class="link" href="equal_range.html#range.reference.algorithms.non_mutating.equal_range.prototype">Prototype</a>
</h6>
<p>
@@ -71,7 +70,7 @@
<p>
</p>
<a name="range.reference.algorithms.non_mutating.equal_range.description"></a><h6>
-<a name="id825597"></a>
+<a name="id724626"></a>
<a class="link" href="equal_range.html#range.reference.algorithms.non_mutating.equal_range.description">Description</a>
</h6>
<p>
@@ -85,14 +84,14 @@
is determined by <code class="computeroutput"><span class="identifier">pred</span></code>.
</p>
<a name="range.reference.algorithms.non_mutating.equal_range.definition"></a><h6>
-<a name="id825744"></a>
+<a name="id724769"></a>
<a class="link" href="equal_range.html#range.reference.algorithms.non_mutating.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.non_mutating.equal_range.requirements"></a><h6>
-<a name="id825817"></a>
+<a name="id724839"></a>
<a class="link" href="equal_range.html#range.reference.algorithms.non_mutating.equal_range.requirements">Requirements</a>
</h6>
<p>
@@ -143,7 +142,7 @@
</li>
</ul></div>
<a name="range.reference.algorithms.non_mutating.equal_range.precondition_"></a><h6>
-<a name="id826092"></a>
+<a name="id725107"></a>
<a class="link" href="equal_range.html#range.reference.algorithms.non_mutating.equal_range.precondition_">Precondition:</a>
</h6>
<p>
@@ -155,7 +154,7 @@
is ordered in ascending order according to <code class="computeroutput"><span class="identifier">pred</span></code>.
</p>
<a name="range.reference.algorithms.non_mutating.equal_range.complexity"></a><h6>
-<a name="id826169"></a>
+<a name="id725182"></a>
<a class="link" href="equal_range.html#range.reference.algorithms.non_mutating.equal_range.complexity">Complexity</a>
</h6>
<p>
Modified: branches/release/libs/range/doc/html/range/reference/algorithms/non_mutating/find.html
==============================================================================
--- branches/release/libs/range/doc/html/range/reference/algorithms/non_mutating/find.html (original)
+++ branches/release/libs/range/doc/html/range/reference/algorithms/non_mutating/find.html 2010-12-26 10:13:43 EST (Sun, 26 Dec 2010)
@@ -24,10 +24,10 @@
</div>
<div class="section">
<div class="titlepage"><div><div><h5 class="title">
-<a name="range.reference.algorithms.non_mutating.find"></a><a class="link" href="find.html" title="find"> find</a>
+<a name="range.reference.algorithms.non_mutating.find"></a><a class="link" href="find.html" title="find">find</a>
</h5></div></div></div>
<a name="range.reference.algorithms.non_mutating.find.prototype"></a><h6>
-<a name="id826841"></a>
+<a name="id725845"></a>
<a class="link" href="find.html#range.reference.algorithms.non_mutating.find.prototype">Prototype</a>
</h6>
<p>
@@ -48,7 +48,7 @@
<p>
</p>
<a name="range.reference.algorithms.non_mutating.find.description"></a><h6>
-<a name="id827126"></a>
+<a name="id726134"></a>
<a class="link" href="find.html#range.reference.algorithms.non_mutating.find.description">Description</a>
</h6>
<p>
@@ -59,14 +59,14 @@
same manner as the returned iterator described above.
</p>
<a name="range.reference.algorithms.non_mutating.find.definition"></a><h6>
-<a name="id827245"></a>
+<a name="id726250"></a>
<a class="link" href="find.html#range.reference.algorithms.non_mutating.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.non_mutating.find.requirements"></a><h6>
-<a name="id827316"></a>
+<a name="id726320"></a>
<a class="link" href="find.html#range.reference.algorithms.non_mutating.find.requirements">Requirements</a>
</h6>
<div class="itemizedlist"><ul class="itemizedlist" type="disc">
@@ -87,7 +87,7 @@
</li>
</ul></div>
<a name="range.reference.algorithms.non_mutating.find.complexity"></a><h6>
-<a name="id827439"></a>
+<a name="id726439"></a>
<a class="link" href="find.html#range.reference.algorithms.non_mutating.find.complexity">Complexity</a>
</h6>
<p>
Modified: branches/release/libs/range/doc/html/range/reference/algorithms/non_mutating/find_end.html
==============================================================================
--- branches/release/libs/range/doc/html/range/reference/algorithms/non_mutating/find_end.html (original)
+++ branches/release/libs/range/doc/html/range/reference/algorithms/non_mutating/find_end.html 2010-12-26 10:13:43 EST (Sun, 26 Dec 2010)
@@ -24,11 +24,10 @@
</div>
<div class="section">
<div class="titlepage"><div><div><h5 class="title">
-<a name="range.reference.algorithms.non_mutating.find_end"></a><a class="link" href="find_end.html" title="find_end">
- find_end</a>
+<a name="range.reference.algorithms.non_mutating.find_end"></a><a class="link" href="find_end.html" title="find_end">find_end</a>
</h5></div></div></div>
<a name="range.reference.algorithms.non_mutating.find_end.prototype"></a><h6>
-<a name="id827507"></a>
+<a name="id726503"></a>
<a class="link" href="find_end.html#range.reference.algorithms.non_mutating.find_end.prototype">Prototype</a>
</h6>
<p>
@@ -66,7 +65,7 @@
<p>
</p>
<a name="range.reference.algorithms.non_mutating.find_end.description"></a><h6>
-<a name="id828152"></a>
+<a name="id727163"></a>
<a class="link" href="find_end.html#range.reference.algorithms.non_mutating.find_end.description">Description</a>
</h6>
<p>
@@ -81,14 +80,14 @@
same manner as the returned iterator described above.
</p>
<a name="range.reference.algorithms.non_mutating.find_end.definition"></a><h6>
-<a name="id828282"></a>
+<a name="id727287"></a>
<a class="link" href="find_end.html#range.reference.algorithms.non_mutating.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.non_mutating.find_end.requirements"></a><h6>
-<a name="id828353"></a>
+<a name="id727358"></a>
<a class="link" href="find_end.html#range.reference.algorithms.non_mutating.find_end.requirements">Requirements</a>
</h6>
<p>
@@ -148,7 +147,7 @@
</li>
</ul></div>
<a name="range.reference.algorithms.non_mutating.find_end.complexity"></a><h6>
-<a name="id828673"></a>
+<a name="id727670"></a>
<a class="link" href="find_end.html#range.reference.algorithms.non_mutating.find_end.complexity">Complexity</a>
</h6>
<p>
Modified: branches/release/libs/range/doc/html/range/reference/algorithms/non_mutating/find_first_of.html
==============================================================================
--- branches/release/libs/range/doc/html/range/reference/algorithms/non_mutating/find_first_of.html (original)
+++ branches/release/libs/range/doc/html/range/reference/algorithms/non_mutating/find_first_of.html 2010-12-26 10:13:43 EST (Sun, 26 Dec 2010)
@@ -24,11 +24,10 @@
</div>
<div class="section">
<div class="titlepage"><div><div><h5 class="title">
-<a name="range.reference.algorithms.non_mutating.find_first_of"></a><a class="link" href="find_first_of.html" title="find_first_of">
- find_first_of</a>
+<a name="range.reference.algorithms.non_mutating.find_first_of"></a><a class="link" href="find_first_of.html" title="find_first_of">find_first_of</a>
</h5></div></div></div>
<a name="range.reference.algorithms.non_mutating.find_first_of.prototype"></a><h6>
-<a name="id828846"></a>
+<a name="id727840"></a>
<a class="link" href="find_first_of.html#range.reference.algorithms.non_mutating.find_first_of.prototype">Prototype</a>
</h6>
<p>
@@ -66,7 +65,7 @@
<p>
</p>
<a name="range.reference.algorithms.non_mutating.find_first_of.description"></a><h6>
-<a name="id829496"></a>
+<a name="id728499"></a>
<a class="link" href="find_first_of.html#range.reference.algorithms.non_mutating.find_first_of.description">Description</a>
</h6>
<p>
@@ -86,14 +85,14 @@
same manner as the returned iterator described above.
</p>
<a name="range.reference.algorithms.non_mutating.find_first_of.definition"></a><h6>
-<a name="id829631"></a>
+<a name="id728627"></a>
<a class="link" href="find_first_of.html#range.reference.algorithms.non_mutating.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.non_mutating.find_first_of.requirements"></a><h6>
-<a name="id829704"></a>
+<a name="id728699"></a>
<a class="link" href="find_first_of.html#range.reference.algorithms.non_mutating.find_first_of.requirements">Requirements</a>
</h6>
<p>
@@ -147,7 +146,7 @@
</li>
</ul></div>
<a name="range.reference.algorithms.non_mutating.find_first_of.complexity"></a><h6>
-<a name="id829982"></a>
+<a name="id728965"></a>
<a class="link" href="find_first_of.html#range.reference.algorithms.non_mutating.find_first_of.complexity">Complexity</a>
</h6>
<p>
Modified: branches/release/libs/range/doc/html/range/reference/algorithms/non_mutating/find_if.html
==============================================================================
--- branches/release/libs/range/doc/html/range/reference/algorithms/non_mutating/find_if.html (original)
+++ branches/release/libs/range/doc/html/range/reference/algorithms/non_mutating/find_if.html 2010-12-26 10:13:43 EST (Sun, 26 Dec 2010)
@@ -24,11 +24,10 @@
</div>
<div class="section">
<div class="titlepage"><div><div><h5 class="title">
-<a name="range.reference.algorithms.non_mutating.find_if"></a><a class="link" href="find_if.html" title="find_if">
- find_if</a>
+<a name="range.reference.algorithms.non_mutating.find_if"></a><a class="link" href="find_if.html" title="find_if">find_if</a>
</h5></div></div></div>
<a name="range.reference.algorithms.non_mutating.find_if.prototype"></a><h6>
-<a name="id830073"></a>
+<a name="id729054"></a>
<a class="link" href="find_if.html#range.reference.algorithms.non_mutating.find_if.prototype">Prototype</a>
</h6>
<p>
@@ -49,7 +48,7 @@
<p>
</p>
<a name="range.reference.algorithms.non_mutating.find_if.description"></a><h6>
-<a name="id830359"></a>
+<a name="id729344"></a>
<a class="link" href="find_if.html#range.reference.algorithms.non_mutating.find_if.description">Description</a>
</h6>
<p>
@@ -64,14 +63,14 @@
defines found in the same manner as the returned iterator described above.
</p>
<a name="range.reference.algorithms.non_mutating.find_if.definition"></a><h6>
-<a name="id830490"></a>
+<a name="id729473"></a>
<a class="link" href="find_if.html#range.reference.algorithms.non_mutating.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.non_mutating.find_if.requirements"></a><h6>
-<a name="id830562"></a>
+<a name="id729544"></a>
<a class="link" href="find_if.html#range.reference.algorithms.non_mutating.find_if.requirements">Requirements</a>
</h6>
<div class="itemizedlist"><ul class="itemizedlist" type="disc">
@@ -90,7 +89,7 @@
</li>
</ul></div>
<a name="range.reference.algorithms.non_mutating.find_if.precondition_"></a><h6>
-<a name="id830671"></a>
+<a name="id729648"></a>
<a class="link" href="find_if.html#range.reference.algorithms.non_mutating.find_if.precondition_">Precondition:</a>
</h6>
<p>
@@ -98,7 +97,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.non_mutating.find_if.complexity"></a><h6>
-<a name="id830742"></a>
+<a name="id729718"></a>
<a class="link" href="find_if.html#range.reference.algorithms.non_mutating.find_if.complexity">Complexity</a>
</h6>
<p>
Modified: branches/release/libs/range/doc/html/range/reference/algorithms/non_mutating/for_each.html
==============================================================================
--- branches/release/libs/range/doc/html/range/reference/algorithms/non_mutating/for_each.html (original)
+++ branches/release/libs/range/doc/html/range/reference/algorithms/non_mutating/for_each.html 2010-12-26 10:13:43 EST (Sun, 26 Dec 2010)
@@ -24,11 +24,10 @@
</div>
<div class="section">
<div class="titlepage"><div><div><h5 class="title">
-<a name="range.reference.algorithms.non_mutating.for_each"></a><a class="link" href="for_each.html" title="for_each">
- for_each</a>
+<a name="range.reference.algorithms.non_mutating.for_each"></a><a class="link" href="for_each.html" title="for_each">for_each</a>
</h5></div></div></div>
<a name="range.reference.algorithms.non_mutating.for_each.prototype"></a><h6>
-<a name="id826266"></a>
+<a name="id725276"></a>
<a class="link" href="for_each.html#range.reference.algorithms.non_mutating.for_each.prototype">Prototype</a>
</h6>
<p>
@@ -49,7 +48,7 @@
<p>
</p>
<a name="range.reference.algorithms.non_mutating.for_each.description"></a><h6>
-<a name="id826487"></a>
+<a name="id725500"></a>
<a class="link" href="for_each.html#range.reference.algorithms.non_mutating.for_each.description">Description</a>
</h6>
<p>
@@ -59,14 +58,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.non_mutating.for_each.definition"></a><h6>
-<a name="id826567"></a>
+<a name="id725579"></a>
<a class="link" href="for_each.html#range.reference.algorithms.non_mutating.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.non_mutating.for_each.requirements"></a><h6>
-<a name="id826638"></a>
+<a name="id725650"></a>
<a class="link" href="for_each.html#range.reference.algorithms.non_mutating.for_each.requirements">Requirements</a>
</h6>
<div class="itemizedlist"><ul class="itemizedlist" type="disc">
@@ -90,7 +89,7 @@
</li>
</ul></div>
<a name="range.reference.algorithms.non_mutating.for_each.complexity"></a><h6>
-<a name="id826764"></a>
+<a name="id725772"></a>
<a class="link" href="for_each.html#range.reference.algorithms.non_mutating.for_each.complexity">Complexity</a>
</h6>
<p>
Modified: branches/release/libs/range/doc/html/range/reference/algorithms/non_mutating/lexicographical_compare.html
==============================================================================
--- branches/release/libs/range/doc/html/range/reference/algorithms/non_mutating/lexicographical_compare.html (original)
+++ branches/release/libs/range/doc/html/range/reference/algorithms/non_mutating/lexicographical_compare.html 2010-12-26 10:13:43 EST (Sun, 26 Dec 2010)
@@ -24,11 +24,10 @@
</div>
<div class="section">
<div class="titlepage"><div><div><h5 class="title">
-<a name="range.reference.algorithms.non_mutating.lexicographical_compare"></a><a class="link" href="lexicographical_compare.html" title="lexicographical_compare">
- lexicographical_compare</a>
+<a name="range.reference.algorithms.non_mutating.lexicographical_compare"></a><a class="link" href="lexicographical_compare.html" title="lexicographical_compare">lexicographical_compare</a>
</h5></div></div></div>
<a name="range.reference.algorithms.non_mutating.lexicographical_compare.prototype"></a><h6>
-<a name="id830822"></a>
+<a name="id729795"></a>
<a class="link" href="lexicographical_compare.html#range.reference.algorithms.non_mutating.lexicographical_compare.prototype">Prototype</a>
</h6>
<p>
@@ -53,7 +52,7 @@
<p>
</p>
<a name="range.reference.algorithms.non_mutating.lexicographical_compare.description"></a><h6>
-<a name="id831104"></a>
+<a name="id730077"></a>
<a class="link" href="lexicographical_compare.html#range.reference.algorithms.non_mutating.lexicographical_compare.description">Description</a>
</h6>
<p>
@@ -73,14 +72,14 @@
predicate versions.
</p>
<a name="range.reference.algorithms.non_mutating.lexicographical_compare.definition"></a><h6>
-<a name="id831277"></a>
+<a name="id730245"></a>
<a class="link" href="lexicographical_compare.html#range.reference.algorithms.non_mutating.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.non_mutating.lexicographical_compare.requirements"></a><h6>
-<a name="id831348"></a>
+<a name="id730316"></a>
<a class="link" href="lexicographical_compare.html#range.reference.algorithms.non_mutating.lexicographical_compare.requirements">Requirements</a>
</h6>
<p>
@@ -145,7 +144,7 @@
</li>
</ul></div>
<a name="range.reference.algorithms.non_mutating.lexicographical_compare.complexity"></a><h6>
-<a name="id831740"></a>
+<a name="id730692"></a>
<a class="link" href="lexicographical_compare.html#range.reference.algorithms.non_mutating.lexicographical_compare.complexity">Complexity</a>
</h6>
<p>
Modified: branches/release/libs/range/doc/html/range/reference/algorithms/non_mutating/lower_bound.html
==============================================================================
--- branches/release/libs/range/doc/html/range/reference/algorithms/non_mutating/lower_bound.html (original)
+++ branches/release/libs/range/doc/html/range/reference/algorithms/non_mutating/lower_bound.html 2010-12-26 10:13:43 EST (Sun, 26 Dec 2010)
@@ -24,11 +24,10 @@
</div>
<div class="section">
<div class="titlepage"><div><div><h5 class="title">
-<a name="range.reference.algorithms.non_mutating.lower_bound"></a><a class="link" href="lower_bound.html" title="lower_bound">
- lower_bound</a>
+<a name="range.reference.algorithms.non_mutating.lower_bound"></a><a class="link" href="lower_bound.html" title="lower_bound">lower_bound</a>
</h5></div></div></div>
<a name="range.reference.algorithms.non_mutating.lower_bound.prototype"></a><h6>
-<a name="id831845"></a>
+<a name="id730796"></a>
<a class="link" href="lower_bound.html#range.reference.algorithms.non_mutating.lower_bound.prototype">Prototype</a>
</h6>
<p>
@@ -49,7 +48,7 @@
<p>
</p>
<a name="range.reference.algorithms.non_mutating.lower_bound.description"></a><h6>
-<a name="id832130"></a>
+<a name="id731085"></a>
<a class="link" href="lower_bound.html#range.reference.algorithms.non_mutating.lower_bound.description">Description</a>
</h6>
<p>
@@ -72,14 +71,14 @@
same manner as the returned iterator described above.
</p>
<a name="range.reference.algorithms.non_mutating.lower_bound.definition"></a><h6>
-<a name="id832321"></a>
+<a name="id731275"></a>
<a class="link" href="lower_bound.html#range.reference.algorithms.non_mutating.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.non_mutating.lower_bound.requirements"></a><h6>
-<a name="id832394"></a>
+<a name="id731346"></a>
<a class="link" href="lower_bound.html#range.reference.algorithms.non_mutating.lower_bound.requirements">Requirements</a>
</h6>
<p>
@@ -130,7 +129,7 @@
</li>
</ul></div>
<a name="range.reference.algorithms.non_mutating.lower_bound.precondition_"></a><h6>
-<a name="id832671"></a>
+<a name="id731615"></a>
<a class="link" href="lower_bound.html#range.reference.algorithms.non_mutating.lower_bound.precondition_">Precondition:</a>
</h6>
<p>
@@ -148,7 +147,7 @@
order according to <code class="computeroutput"><span class="identifier">pred</span></code>.
</p>
<a name="range.reference.algorithms.non_mutating.lower_bound.complexity"></a><h6>
-<a name="id832764"></a>
+<a name="id731707"></a>
<a class="link" href="lower_bound.html#range.reference.algorithms.non_mutating.lower_bound.complexity">Complexity</a>
</h6>
<p>
Modified: branches/release/libs/range/doc/html/range/reference/algorithms/non_mutating/max_element.html
==============================================================================
--- branches/release/libs/range/doc/html/range/reference/algorithms/non_mutating/max_element.html (original)
+++ branches/release/libs/range/doc/html/range/reference/algorithms/non_mutating/max_element.html 2010-12-26 10:13:43 EST (Sun, 26 Dec 2010)
@@ -24,11 +24,10 @@
</div>
<div class="section">
<div class="titlepage"><div><div><h5 class="title">
-<a name="range.reference.algorithms.non_mutating.max_element"></a><a class="link" href="max_element.html" title="max_element">
- max_element</a>
+<a name="range.reference.algorithms.non_mutating.max_element"></a><a class="link" href="max_element.html" title="max_element">max_element</a>
</h5></div></div></div>
<a name="range.reference.algorithms.non_mutating.max_element.prototype"></a><h6>
-<a name="id832907"></a>
+<a name="id731847"></a>
<a class="link" href="max_element.html#range.reference.algorithms.non_mutating.max_element.prototype">Prototype</a>
</h6>
<p>
@@ -84,7 +83,7 @@
<p>
</p>
<a name="range.reference.algorithms.non_mutating.max_element.description"></a><h6>
-<a name="id833871"></a>
+<a name="id732833"></a>
<a class="link" href="max_element.html#range.reference.algorithms.non_mutating.max_element.description">Description</a>
</h6>
<p>
@@ -98,14 +97,14 @@
same manner as the returned iterator described above.
</p>
<a name="range.reference.algorithms.non_mutating.max_element.definition"></a><h6>
-<a name="id833970"></a>
+<a name="id732927"></a>
<a class="link" href="max_element.html#range.reference.algorithms.non_mutating.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.non_mutating.max_element.requirements"></a><h6>
-<a name="id834043"></a>
+<a name="id732999"></a>
<a class="link" href="max_element.html#range.reference.algorithms.non_mutating.max_element.requirements">Requirements</a>
</h6>
<p>
@@ -142,7 +141,7 @@
</li>
</ul></div>
<a name="range.reference.algorithms.non_mutating.max_element.complexity"></a><h6>
-<a name="id834225"></a>
+<a name="id733176"></a>
<a class="link" href="max_element.html#range.reference.algorithms.non_mutating.max_element.complexity">Complexity</a>
</h6>
<p>
Modified: branches/release/libs/range/doc/html/range/reference/algorithms/non_mutating/min_element.html
==============================================================================
--- branches/release/libs/range/doc/html/range/reference/algorithms/non_mutating/min_element.html (original)
+++ branches/release/libs/range/doc/html/range/reference/algorithms/non_mutating/min_element.html 2010-12-26 10:13:43 EST (Sun, 26 Dec 2010)
@@ -24,11 +24,10 @@
</div>
<div class="section">
<div class="titlepage"><div><div><h5 class="title">
-<a name="range.reference.algorithms.non_mutating.min_element"></a><a class="link" href="min_element.html" title="min_element">
- min_element</a>
+<a name="range.reference.algorithms.non_mutating.min_element"></a><a class="link" href="min_element.html" title="min_element">min_element</a>
</h5></div></div></div>
<a name="range.reference.algorithms.non_mutating.min_element.prototype"></a><h6>
-<a name="id834326"></a>
+<a name="id733276"></a>
<a class="link" href="min_element.html#range.reference.algorithms.non_mutating.min_element.prototype">Prototype</a>
</h6>
<p>
@@ -84,7 +83,7 @@
<p>
</p>
<a name="range.reference.algorithms.non_mutating.min_element.description"></a><h6>
-<a name="id835290"></a>
+<a name="id734263"></a>
<a class="link" href="min_element.html#range.reference.algorithms.non_mutating.min_element.description">Description</a>
</h6>
<p>
@@ -98,14 +97,14 @@
same manner as the returned iterator described above.
</p>
<a name="range.reference.algorithms.non_mutating.min_element.definition"></a><h6>
-<a name="id835389"></a>
+<a name="id734357"></a>
<a class="link" href="min_element.html#range.reference.algorithms.non_mutating.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.non_mutating.min_element.requirements"></a><h6>
-<a name="id835462"></a>
+<a name="id734428"></a>
<a class="link" href="min_element.html#range.reference.algorithms.non_mutating.min_element.requirements">Requirements</a>
</h6>
<p>
@@ -142,7 +141,7 @@
</li>
</ul></div>
<a name="range.reference.algorithms.non_mutating.min_element.complexity"></a><h6>
-<a name="id835644"></a>
+<a name="id734606"></a>
<a class="link" href="min_element.html#range.reference.algorithms.non_mutating.min_element.complexity">Complexity</a>
</h6>
<p>
Modified: branches/release/libs/range/doc/html/range/reference/algorithms/non_mutating/mismatch.html
==============================================================================
--- branches/release/libs/range/doc/html/range/reference/algorithms/non_mutating/mismatch.html (original)
+++ branches/release/libs/range/doc/html/range/reference/algorithms/non_mutating/mismatch.html 2010-12-26 10:13:43 EST (Sun, 26 Dec 2010)
@@ -24,11 +24,10 @@
</div>
<div class="section">
<div class="titlepage"><div><div><h5 class="title">
-<a name="range.reference.algorithms.non_mutating.mismatch"></a><a class="link" href="mismatch.html" title="mismatch">
- mismatch</a>
+<a name="range.reference.algorithms.non_mutating.mismatch"></a><a class="link" href="mismatch.html" title="mismatch">mismatch</a>
</h5></div></div></div>
<a name="range.reference.algorithms.non_mutating.mismatch.prototype"></a><h6>
-<a name="id835747"></a>
+<a name="id734705"></a>
<a class="link" href="mismatch.html#range.reference.algorithms.non_mutating.mismatch.prototype">Prototype</a>
</h6>
<p>
@@ -106,7 +105,7 @@
<p>
</p>
<a name="range.reference.algorithms.non_mutating.mismatch.description"></a><h6>
-<a name="id837424"></a>
+<a name="id736409"></a>
<a class="link" href="mismatch.html#range.reference.algorithms.non_mutating.mismatch.description">Description</a>
</h6>
<p>
@@ -118,14 +117,14 @@
Equality is determined by <code class="computeroutput"><span class="keyword">operator</span><span class="special">==</span></code> for non-predicate versions of <code class="computeroutput"><span class="identifier">mismatch</span></code>, and by satisfying <code class="computeroutput"><span class="identifier">pred</span></code> in the predicate versions.
</p>
<a name="range.reference.algorithms.non_mutating.mismatch.definition"></a><h6>
-<a name="id837522"></a>
+<a name="id736505"></a>
<a class="link" href="mismatch.html#range.reference.algorithms.non_mutating.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.non_mutating.mismatch.requirements"></a><h6>
-<a name="id837593"></a>
+<a name="id736576"></a>
<a class="link" href="mismatch.html#range.reference.algorithms.non_mutating.mismatch.requirements">Requirements</a>
</h6>
<p>
@@ -186,14 +185,14 @@
</li>
</ul></div>
<a name="range.reference.algorithms.non_mutating.mismatch.precondition_"></a><h6>
-<a name="id837918"></a>
+<a name="id736887"></a>
<a class="link" href="mismatch.html#range.reference.algorithms.non_mutating.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.non_mutating.mismatch.complexity"></a><h6>
-<a name="id837991"></a>
+<a name="id736960"></a>
<a class="link" href="mismatch.html#range.reference.algorithms.non_mutating.mismatch.complexity">Complexity</a>
</h6>
<p>
Modified: branches/release/libs/range/doc/html/range/reference/algorithms/non_mutating/search.html
==============================================================================
--- branches/release/libs/range/doc/html/range/reference/algorithms/non_mutating/search.html (original)
+++ branches/release/libs/range/doc/html/range/reference/algorithms/non_mutating/search.html 2010-12-26 10:13:43 EST (Sun, 26 Dec 2010)
@@ -24,11 +24,10 @@
</div>
<div class="section">
<div class="titlepage"><div><div><h5 class="title">
-<a name="range.reference.algorithms.non_mutating.search"></a><a class="link" href="search.html" title="search">
- search</a>
+<a name="range.reference.algorithms.non_mutating.search"></a><a class="link" href="search.html" title="search">search</a>
</h5></div></div></div>
<a name="range.reference.algorithms.non_mutating.search.prototype"></a><h6>
-<a name="id838060"></a>
+<a name="id737024"></a>
<a class="link" href="search.html#range.reference.algorithms.non_mutating.search.prototype">Prototype</a>
</h6>
<p>
@@ -96,7 +95,7 @@
<p>
</p>
<a name="range.reference.algorithms.non_mutating.search.description"></a><h6>
-<a name="id839638"></a>
+<a name="id738362"></a>
<a class="link" href="search.html#range.reference.algorithms.non_mutating.search.description">Description</a>
</h6>
<p>
@@ -115,14 +114,14 @@
same manner as the returned iterator described above.
</p>
<a name="range.reference.algorithms.non_mutating.search.definition"></a><h6>
-<a name="id839805"></a>
+<a name="id738525"></a>
<a class="link" href="search.html#range.reference.algorithms.non_mutating.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.non_mutating.search.requirements"></a><h6>
-<a name="id839876"></a>
+<a name="id738596"></a>
<a class="link" href="search.html#range.reference.algorithms.non_mutating.search.requirements">Requirements</a>
</h6>
<p>
@@ -183,7 +182,7 @@
</li>
</ul></div>
<a name="range.reference.algorithms.non_mutating.search.complexity"></a><h6>
-<a name="id840195"></a>
+<a name="id738907"></a>
<a class="link" href="search.html#range.reference.algorithms.non_mutating.search.complexity">Complexity</a>
</h6>
<p>
Modified: branches/release/libs/range/doc/html/range/reference/algorithms/non_mutating/search_n.html
==============================================================================
--- branches/release/libs/range/doc/html/range/reference/algorithms/non_mutating/search_n.html (original)
+++ branches/release/libs/range/doc/html/range/reference/algorithms/non_mutating/search_n.html 2010-12-26 10:13:43 EST (Sun, 26 Dec 2010)
@@ -24,11 +24,10 @@
</div>
<div class="section">
<div class="titlepage"><div><div><h5 class="title">
-<a name="range.reference.algorithms.non_mutating.search_n"></a><a class="link" href="search_n.html" title="search_n">
- search_n</a>
+<a name="range.reference.algorithms.non_mutating.search_n"></a><a class="link" href="search_n.html" title="search_n">search_n</a>
</h5></div></div></div>
<a name="range.reference.algorithms.non_mutating.search_n.prototype"></a><h6>
-<a name="id840239"></a>
+<a name="id738948"></a>
<a class="link" href="search_n.html#range.reference.algorithms.non_mutating.search_n.prototype">Prototype</a>
</h6>
<p>
@@ -55,7 +54,7 @@
<p>
</p>
<a name="range.reference.algorithms.non_mutating.search_n.description"></a><h6>
-<a name="id840972"></a>
+<a name="id739697"></a>
<a class="link" href="search_n.html#range.reference.algorithms.non_mutating.search_n.description">Description</a>
</h6>
<p>
@@ -64,14 +63,14 @@
and by a predicate when one is supplied.
</p>
<a name="range.reference.algorithms.non_mutating.search_n.definition"></a><h6>
-<a name="id841041"></a>
+<a name="id739763"></a>
<a class="link" href="search_n.html#range.reference.algorithms.non_mutating.search_n.definition">Definition</a>
</h6>
<p>
Defined in the header file <code class="computeroutput"><span class="identifier">boost</span><span class="special">/</span><span class="identifier">range</span><span class="special">/</span><span class="identifier">algorithm</span><span class="special">/</span><span class="identifier">search_n</span><span class="special">.</span><span class="identifier">hpp</span></code>
</p>
<a name="range.reference.algorithms.non_mutating.search_n.requirements"></a><h6>
-<a name="id841112"></a>
+<a name="id739834"></a>
<a class="link" href="search_n.html#range.reference.algorithms.non_mutating.search_n.requirements">Requirements</a>
</h6>
<p>
@@ -125,7 +124,7 @@
</li>
</ul></div>
<a name="range.reference.algorithms.non_mutating.search_n.complexity"></a><h6>
-<a name="id841408"></a>
+<a name="id740123"></a>
<a class="link" href="search_n.html#range.reference.algorithms.non_mutating.search_n.complexity">Complexity</a>
</h6>
<p>
Modified: branches/release/libs/range/doc/html/range/reference/algorithms/non_mutating/upper_bound.html
==============================================================================
--- branches/release/libs/range/doc/html/range/reference/algorithms/non_mutating/upper_bound.html (original)
+++ branches/release/libs/range/doc/html/range/reference/algorithms/non_mutating/upper_bound.html 2010-12-26 10:13:43 EST (Sun, 26 Dec 2010)
@@ -24,11 +24,10 @@
</div>
<div class="section">
<div class="titlepage"><div><div><h5 class="title">
-<a name="range.reference.algorithms.non_mutating.upper_bound"></a><a class="link" href="upper_bound.html" title="upper_bound">
- upper_bound</a>
+<a name="range.reference.algorithms.non_mutating.upper_bound"></a><a class="link" href="upper_bound.html" title="upper_bound">upper_bound</a>
</h5></div></div></div>
<a name="range.reference.algorithms.non_mutating.upper_bound.prototype"></a><h6>
-<a name="id841454"></a>
+<a name="id740164"></a>
<a class="link" href="upper_bound.html#range.reference.algorithms.non_mutating.upper_bound.prototype">Prototype</a>
</h6>
<p>
@@ -49,7 +48,7 @@
<p>
</p>
<a name="range.reference.algorithms.non_mutating.upper_bound.description"></a><h6>
-<a name="id841738"></a>
+<a name="id740453"></a>
<a class="link" href="upper_bound.html#range.reference.algorithms.non_mutating.upper_bound.description">Description</a>
</h6>
<p>
@@ -71,14 +70,14 @@
same manner as the returned iterator described above.
</p>
<a name="range.reference.algorithms.non_mutating.upper_bound.definition"></a><h6>
-<a name="id841934"></a>
+<a name="id740647"></a>
<a class="link" href="upper_bound.html#range.reference.algorithms.non_mutating.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.non_mutating.upper_bound.requirements"></a><h6>
-<a name="id842007"></a>
+<a name="id740718"></a>
<a class="link" href="upper_bound.html#range.reference.algorithms.non_mutating.upper_bound.requirements">Requirements</a>
</h6>
<p>
@@ -129,7 +128,7 @@
</li>
</ul></div>
<a name="range.reference.algorithms.non_mutating.upper_bound.precondition_"></a><h6>
-<a name="id842284"></a>
+<a name="id740986"></a>
<a class="link" href="upper_bound.html#range.reference.algorithms.non_mutating.upper_bound.precondition_">Precondition:</a>
</h6>
<p>
@@ -147,7 +146,7 @@
order according to <code class="computeroutput"><span class="identifier">pred</span></code>.
</p>
<a name="range.reference.algorithms.non_mutating.upper_bound.complexity"></a><h6>
-<a name="id842377"></a>
+<a name="id741078"></a>
<a class="link" href="upper_bound.html#range.reference.algorithms.non_mutating.upper_bound.complexity">Complexity</a>
</h6>
<p>
Modified: branches/release/libs/range/doc/html/range/reference/algorithms/numeric.html
==============================================================================
--- branches/release/libs/range/doc/html/range/reference/algorithms/numeric.html (original)
+++ branches/release/libs/range/doc/html/range/reference/algorithms/numeric.html 2010-12-26 10:13:43 EST (Sun, 26 Dec 2010)
@@ -5,7 +5,7 @@
<link rel="stylesheet" href="../../../../../../../doc/src/boostbook.css" type="text/css">
<meta name="generator" content="DocBook XSL Stylesheets V1.75.2">
<link rel="home" href="../../../index.html" title="Chapter 1. Range 2.0">
-<link rel="up" href="../algorithms.html" title="Range Algorithm">
+<link rel="up" href="../algorithms.html" title="Range Algorithms">
<link rel="prev" href="new/remove_erase_if.html" title="remove_erase_if">
<link rel="next" href="numeric/accumulate.html" title="accumulate">
</head>
@@ -24,16 +24,13 @@
</div>
<div class="section">
<div class="titlepage"><div><div><h4 class="title">
-<a name="range.reference.algorithms.numeric"></a><a class="link" href="numeric.html" title="Numeric algorithms"> Numeric algorithms</a>
+<a name="range.reference.algorithms.numeric"></a><a class="link" href="numeric.html" title="Numeric algorithms">Numeric algorithms</a>
</h4></div></div></div>
<div class="toc"><dl>
-<dt><span class="section"> accumulate</span></dt>
-<dt><span class="section"><a href="numeric/adjacent_difference.html">
- adjacent_difference</a></span></dt>
-<dt><span class="section"><a href="numeric/inner_product.html">
- inner_product</a></span></dt>
-<dt><span class="section"><a href="numeric/partial_sum.html">
- partial_sum</a></span></dt>
+<dt><span class="section">accumulate</span></dt>
+<dt><span class="section">adjacent_difference</span></dt>
+<dt><span class="section">inner_product</span></dt>
+<dt><span class="section">partial_sum</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/numeric/accumulate.html
==============================================================================
--- branches/release/libs/range/doc/html/range/reference/algorithms/numeric/accumulate.html (original)
+++ branches/release/libs/range/doc/html/range/reference/algorithms/numeric/accumulate.html 2010-12-26 10:13:43 EST (Sun, 26 Dec 2010)
@@ -24,10 +24,10 @@
</div>
<div class="section">
<div class="titlepage"><div><div><h5 class="title">
-<a name="range.reference.algorithms.numeric.accumulate"></a><a class="link" href="accumulate.html" title="accumulate"> accumulate</a>
+<a name="range.reference.algorithms.numeric.accumulate"></a><a class="link" href="accumulate.html" title="accumulate">accumulate</a>
</h5></div></div></div>
<a name="range.reference.algorithms.numeric.accumulate.prototype"></a><h6>
-<a name="id860544"></a>
+<a name="id758668"></a>
<a class="link" href="accumulate.html#range.reference.algorithms.numeric.accumulate.prototype">Prototype</a>
</h6>
<p>
@@ -52,7 +52,7 @@
<p>
</p>
<a name="range.reference.algorithms.numeric.accumulate.description"></a><h6>
-<a name="id860802"></a>
+<a name="id758929"></a>
<a class="link" href="accumulate.html#range.reference.algorithms.numeric.accumulate.description">Description</a>
</h6>
<p>
@@ -63,18 +63,18 @@
The return value is the resultant value of the above algorithm.
</p>
<a name="range.reference.algorithms.numeric.accumulate.definition"></a><h6>
-<a name="id860880"></a>
+<a name="id759004"></a>
<a class="link" href="accumulate.html#range.reference.algorithms.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.numeric.accumulate.requirements"></a><h6>
-<a name="id860942"></a>
+<a name="id759066"></a>
<a class="link" href="accumulate.html#range.reference.algorithms.numeric.accumulate.requirements">Requirements</a>
</h6>
<a name="range.reference.algorithms.numeric.accumulate.for_the_first_version"></a><h6>
-<a name="id860966"></a>
+<a name="id759087"></a>
<a class="link" href="accumulate.html#range.reference.algorithms.numeric.accumulate.for_the_first_version">For
the first version</a>
</h6>
@@ -99,7 +99,7 @@
</li>
</ol></div>
<a name="range.reference.algorithms.numeric.accumulate.for_the_second_version"></a><h6>
-<a name="id861115"></a>
+<a name="id759229"></a>
<a class="link" href="accumulate.html#range.reference.algorithms.numeric.accumulate.for_the_second_version">For
the second version</a>
</h6>
@@ -133,7 +133,7 @@
</li>
</ol></div>
<a name="range.reference.algorithms.numeric.accumulate.complexity"></a><h6>
-<a name="id861313"></a>
+<a name="id759422"></a>
<a class="link" href="accumulate.html#range.reference.algorithms.numeric.accumulate.complexity">Complexity</a>
</h6>
<p>
Modified: branches/release/libs/range/doc/html/range/reference/algorithms/numeric/adjacent_difference.html
==============================================================================
--- branches/release/libs/range/doc/html/range/reference/algorithms/numeric/adjacent_difference.html (original)
+++ branches/release/libs/range/doc/html/range/reference/algorithms/numeric/adjacent_difference.html 2010-12-26 10:13:43 EST (Sun, 26 Dec 2010)
@@ -24,11 +24,10 @@
</div>
<div class="section">
<div class="titlepage"><div><div><h5 class="title">
-<a name="range.reference.algorithms.numeric.adjacent_difference"></a><a class="link" href="adjacent_difference.html" title="adjacent_difference">
- adjacent_difference</a>
+<a name="range.reference.algorithms.numeric.adjacent_difference"></a><a class="link" href="adjacent_difference.html" title="adjacent_difference">adjacent_difference</a>
</h5></div></div></div>
<a name="range.reference.algorithms.numeric.adjacent_difference.prototype"></a><h6>
-<a name="id861384"></a>
+<a name="id759487"></a>
<a class="link" href="adjacent_difference.html#range.reference.algorithms.numeric.adjacent_difference.prototype">Prototype</a>
</h6>
<p>
@@ -55,7 +54,7 @@
<p>
</p>
<a name="range.reference.algorithms.numeric.adjacent_difference.description"></a><h6>
-<a name="id861646"></a>
+<a name="id759751"></a>
<a class="link" href="adjacent_difference.html#range.reference.algorithms.numeric.adjacent_difference.description">Description</a>
</h6>
<p>
@@ -69,18 +68,18 @@
instead of <code class="computeroutput"><span class="keyword">operator</span><span class="special">-()</span></code>.
</p>
<a name="range.reference.algorithms.numeric.adjacent_difference.definition"></a><h6>
-<a name="id861750"></a>
+<a name="id759852"></a>
<a class="link" href="adjacent_difference.html#range.reference.algorithms.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.numeric.adjacent_difference.requirements"></a><h6>
-<a name="id861814"></a>
+<a name="id759914"></a>
<a class="link" href="adjacent_difference.html#range.reference.algorithms.numeric.adjacent_difference.requirements">Requirements</a>
</h6>
<a name="range.reference.algorithms.numeric.adjacent_difference.for_the_first_version"></a><h6>
-<a name="id861837"></a>
+<a name="id759935"></a>
<a class="link" href="adjacent_difference.html#range.reference.algorithms.numeric.adjacent_difference.for_the_first_version">For
the first version</a>
</h6>
@@ -111,7 +110,7 @@
</li>
</ol></div>
<a name="range.reference.algorithms.numeric.adjacent_difference.for_the_second_version"></a><h6>
-<a name="id862051"></a>
+<a name="id760142"></a>
<a class="link" href="adjacent_difference.html#range.reference.algorithms.numeric.adjacent_difference.for_the_second_version">For
the second version</a>
</h6>
@@ -146,7 +145,7 @@
</li>
</ol></div>
<a name="range.reference.algorithms.numeric.adjacent_difference.precondition_"></a><h6>
-<a name="id862253"></a>
+<a name="id760336"></a>
<a class="link" href="adjacent_difference.html#range.reference.algorithms.numeric.adjacent_difference.precondition_">Precondition:</a>
</h6>
<p>
@@ -154,7 +153,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.numeric.adjacent_difference.complexity"></a><h6>
-<a name="id862327"></a>
+<a name="id760410"></a>
<a class="link" href="adjacent_difference.html#range.reference.algorithms.numeric.adjacent_difference.complexity">Complexity</a>
</h6>
<p>
Modified: branches/release/libs/range/doc/html/range/reference/algorithms/numeric/inner_product.html
==============================================================================
--- branches/release/libs/range/doc/html/range/reference/algorithms/numeric/inner_product.html (original)
+++ branches/release/libs/range/doc/html/range/reference/algorithms/numeric/inner_product.html 2010-12-26 10:13:43 EST (Sun, 26 Dec 2010)
@@ -24,11 +24,10 @@
</div>
<div class="section">
<div class="titlepage"><div><div><h5 class="title">
-<a name="range.reference.algorithms.numeric.inner_product"></a><a class="link" href="inner_product.html" title="inner_product">
- inner_product</a>
+<a name="range.reference.algorithms.numeric.inner_product"></a><a class="link" href="inner_product.html" title="inner_product">inner_product</a>
</h5></div></div></div>
<a name="range.reference.algorithms.numeric.inner_product.prototype"></a><h6>
-<a name="id862430"></a>
+<a name="id760510"></a>
<a class="link" href="inner_product.html#range.reference.algorithms.numeric.inner_product.prototype">Prototype</a>
</h6>
<p>
@@ -54,7 +53,7 @@
<p>
</p>
<a name="range.reference.algorithms.numeric.inner_product.description"></a><h6>
-<a name="id862790"></a>
+<a name="id760873"></a>
<a class="link" href="inner_product.html#range.reference.algorithms.numeric.inner_product.description">Description</a>
</h6>
<p>
@@ -67,18 +66,18 @@
algorithm please see inner_product.
</p>
<a name="range.reference.algorithms.numeric.inner_product.definition"></a><h6>
-<a name="id862869"></a>
+<a name="id760949"></a>
<a class="link" href="inner_product.html#range.reference.algorithms.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.numeric.inner_product.requirements"></a><h6>
-<a name="id862931"></a>
+<a name="id761010"></a>
<a class="link" href="inner_product.html#range.reference.algorithms.numeric.inner_product.requirements">Requirements</a>
</h6>
<a name="range.reference.algorithms.numeric.inner_product.for_the_first_version"></a><h6>
-<a name="id862955"></a>
+<a name="id761031"></a>
<a class="link" href="inner_product.html#range.reference.algorithms.numeric.inner_product.for_the_first_version">For
the first version</a>
</h6>
@@ -113,7 +112,7 @@
</li>
</ol></div>
<a name="range.reference.algorithms.numeric.inner_product.for_the_second_version"></a><h6>
-<a name="id863220"></a>
+<a name="id761288"></a>
<a class="link" href="inner_product.html#range.reference.algorithms.numeric.inner_product.for_the_second_version">For
the second version</a>
</h6>
@@ -162,14 +161,14 @@
</li>
</ol></div>
<a name="range.reference.algorithms.numeric.inner_product.precondition_"></a><h6>
-<a name="id863533"></a>
+<a name="id761589"></a>
<a class="link" href="inner_product.html#range.reference.algorithms.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.numeric.inner_product.complexity"></a><h6>
-<a name="id863606"></a>
+<a name="id761662"></a>
<a class="link" href="inner_product.html#range.reference.algorithms.numeric.inner_product.complexity">Complexity</a>
</h6>
<p>
Modified: branches/release/libs/range/doc/html/range/reference/algorithms/numeric/partial_sum.html
==============================================================================
--- branches/release/libs/range/doc/html/range/reference/algorithms/numeric/partial_sum.html (original)
+++ branches/release/libs/range/doc/html/range/reference/algorithms/numeric/partial_sum.html 2010-12-26 10:13:43 EST (Sun, 26 Dec 2010)
@@ -24,11 +24,10 @@
</div>
<div class="section">
<div class="titlepage"><div><div><h5 class="title">
-<a name="range.reference.algorithms.numeric.partial_sum"></a><a class="link" href="partial_sum.html" title="partial_sum">
- partial_sum</a>
+<a name="range.reference.algorithms.numeric.partial_sum"></a><a class="link" href="partial_sum.html" title="partial_sum">partial_sum</a>
</h5></div></div></div>
<a name="range.reference.algorithms.numeric.partial_sum.prototype"></a><h6>
-<a name="id863674"></a>
+<a name="id761728"></a>
<a class="link" href="partial_sum.html#range.reference.algorithms.numeric.partial_sum.prototype">Prototype</a>
</h6>
<p>
@@ -49,7 +48,7 @@
<p>
</p>
<a name="range.reference.algorithms.numeric.partial_sum.description"></a><h6>
-<a name="id863926"></a>
+<a name="id761985"></a>
<a class="link" href="partial_sum.html#range.reference.algorithms.numeric.partial_sum.description">Description</a>
</h6>
<p>
@@ -58,18 +57,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.numeric.partial_sum.definition"></a><h6>
-<a name="id864065"></a>
+<a name="id762125"></a>
<a class="link" href="partial_sum.html#range.reference.algorithms.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.numeric.partial_sum.requirements"></a><h6>
-<a name="id864128"></a>
+<a name="id762186"></a>
<a class="link" href="partial_sum.html#range.reference.algorithms.numeric.partial_sum.requirements">Requirements</a>
</h6>
<a name="range.reference.algorithms.numeric.partial_sum.for_the_first_version"></a><h6>
-<a name="id864151"></a>
+<a name="id762206"></a>
<a class="link" href="partial_sum.html#range.reference.algorithms.numeric.partial_sum.for_the_first_version">For
the first version</a>
</h6>
@@ -99,7 +98,7 @@
</li>
</ol></div>
<a name="range.reference.algorithms.numeric.partial_sum.for_the_second_version"></a><h6>
-<a name="id864365"></a>
+<a name="id762414"></a>
<a class="link" href="partial_sum.html#range.reference.algorithms.numeric.partial_sum.for_the_second_version">For
the second version</a>
</h6>
@@ -128,7 +127,7 @@
</li>
</ol></div>
<a name="range.reference.algorithms.numeric.partial_sum.precondition_"></a><h6>
-<a name="id864536"></a>
+<a name="id762579"></a>
<a class="link" href="partial_sum.html#range.reference.algorithms.numeric.partial_sum.precondition_">Precondition:</a>
</h6>
<p>
@@ -136,7 +135,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.numeric.partial_sum.complexity"></a><h6>
-<a name="id864610"></a>
+<a name="id762652"></a>
<a class="link" href="partial_sum.html#range.reference.algorithms.numeric.partial_sum.complexity">Complexity</a>
</h6>
<p>
Modified: branches/release/libs/range/doc/html/range/reference/algorithms/permutation.html
==============================================================================
--- branches/release/libs/range/doc/html/range/reference/algorithms/permutation.html (original)
+++ branches/release/libs/range/doc/html/range/reference/algorithms/permutation.html 2010-12-26 10:13:43 EST (Sun, 26 Dec 2010)
@@ -5,7 +5,7 @@
<link rel="stylesheet" href="../../../../../../../doc/src/boostbook.css" type="text/css">
<meta name="generator" content="DocBook XSL Stylesheets V1.75.2">
<link rel="home" href="../../../index.html" title="Chapter 1. Range 2.0">
-<link rel="up" href="../algorithms.html" title="Range Algorithm">
+<link rel="up" href="../algorithms.html" title="Range Algorithms">
<link rel="prev" href="heap/sort_heap.html" title="sort_heap">
<link rel="next" href="permutation/next_permutation.html" title="next_permutation">
</head>
@@ -24,14 +24,12 @@
</div>
<div class="section">
<div class="titlepage"><div><div><h4 class="title">
-<a name="range.reference.algorithms.permutation"></a><a class="link" href="permutation.html" title="Permutation algorithms"> Permutation
+<a name="range.reference.algorithms.permutation"></a><a class="link" href="permutation.html" title="Permutation algorithms">Permutation
algorithms</a>
</h4></div></div></div>
<div class="toc"><dl>
-<dt><span class="section"><a href="permutation/next_permutation.html">
- next_permutation</a></span></dt>
-<dt><span class="section"><a href="permutation/prev_permutation.html">
- prev_permutation</a></span></dt>
+<dt><span class="section">next_permutation</span></dt>
+<dt><span class="section">prev_permutation</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/permutation/next_permutation.html
==============================================================================
--- branches/release/libs/range/doc/html/range/reference/algorithms/permutation/next_permutation.html (original)
+++ branches/release/libs/range/doc/html/range/reference/algorithms/permutation/next_permutation.html 2010-12-26 10:13:43 EST (Sun, 26 Dec 2010)
@@ -24,11 +24,10 @@
</div>
<div class="section">
<div class="titlepage"><div><div><h5 class="title">
-<a name="range.reference.algorithms.permutation.next_permutation"></a><a class="link" href="next_permutation.html" title="next_permutation">
- next_permutation</a>
+<a name="range.reference.algorithms.permutation.next_permutation"></a><a class="link" href="next_permutation.html" title="next_permutation">next_permutation</a>
</h5></div></div></div>
<a name="range.reference.algorithms.permutation.next_permutation.prototype"></a><h6>
-<a name="id852445"></a>
+<a name="id750959"></a>
<a class="link" href="next_permutation.html#range.reference.algorithms.permutation.next_permutation.prototype">Prototype</a>
</h6>
<p>
@@ -49,7 +48,7 @@
<p>
</p>
<a name="range.reference.algorithms.permutation.next_permutation.description"></a><h6>
-<a name="id852789"></a>
+<a name="id751305"></a>
<a class="link" href="next_permutation.html#range.reference.algorithms.permutation.next_permutation.description">Description</a>
</h6>
<p>
@@ -67,14 +66,14 @@
the predicate versions.
</p>
<a name="range.reference.algorithms.permutation.next_permutation.definition"></a><h6>
-<a name="id852893"></a>
+<a name="id751404"></a>
<a class="link" href="next_permutation.html#range.reference.algorithms.permutation.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.next_permutation.requirements"></a><h6>
-<a name="id852965"></a>
+<a name="id751475"></a>
<a class="link" href="next_permutation.html#range.reference.algorithms.permutation.next_permutation.requirements">Requirements</a>
</h6>
<p>
@@ -125,7 +124,7 @@
</li>
</ul></div>
<a name="range.reference.algorithms.permutation.next_permutation.complexity"></a><h6>
-<a name="id853224"></a>
+<a name="id751723"></a>
<a class="link" href="next_permutation.html#range.reference.algorithms.permutation.next_permutation.complexity">Complexity</a>
</h6>
<p>
Modified: branches/release/libs/range/doc/html/range/reference/algorithms/permutation/prev_permutation.html
==============================================================================
--- branches/release/libs/range/doc/html/range/reference/algorithms/permutation/prev_permutation.html (original)
+++ branches/release/libs/range/doc/html/range/reference/algorithms/permutation/prev_permutation.html 2010-12-26 10:13:43 EST (Sun, 26 Dec 2010)
@@ -24,11 +24,10 @@
</div>
<div class="section">
<div class="titlepage"><div><div><h5 class="title">
-<a name="range.reference.algorithms.permutation.prev_permutation"></a><a class="link" href="prev_permutation.html" title="prev_permutation">
- prev_permutation</a>
+<a name="range.reference.algorithms.permutation.prev_permutation"></a><a class="link" href="prev_permutation.html" title="prev_permutation">prev_permutation</a>
</h5></div></div></div>
<a name="range.reference.algorithms.permutation.prev_permutation.prototype"></a><h6>
-<a name="id853305"></a>
+<a name="id751799"></a>
<a class="link" href="prev_permutation.html#range.reference.algorithms.permutation.prev_permutation.prototype">Prototype</a>
</h6>
<p>
@@ -49,7 +48,7 @@
<p>
</p>
<a name="range.reference.algorithms.permutation.prev_permutation.description"></a><h6>
-<a name="id853649"></a>
+<a name="id752146"></a>
<a class="link" href="prev_permutation.html#range.reference.algorithms.permutation.prev_permutation.description">Description</a>
</h6>
<p>
@@ -67,14 +66,14 @@
the predicate versions.
</p>
<a name="range.reference.algorithms.permutation.prev_permutation.definition"></a><h6>
-<a name="id853755"></a>
+<a name="id752245"></a>
<a class="link" href="prev_permutation.html#range.reference.algorithms.permutation.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.prev_permutation.requirements"></a><h6>
-<a name="id853828"></a>
+<a name="id752316"></a>
<a class="link" href="prev_permutation.html#range.reference.algorithms.permutation.prev_permutation.requirements">Requirements</a>
</h6>
<p>
@@ -125,7 +124,7 @@
</li>
</ul></div>
<a name="range.reference.algorithms.permutation.prev_permutation.complexity"></a><h6>
-<a name="id854087"></a>
+<a name="id752565"></a>
<a class="link" href="prev_permutation.html#range.reference.algorithms.permutation.prev_permutation.complexity">Complexity</a>
</h6>
<p>
Modified: branches/release/libs/range/doc/html/range/reference/algorithms/set.html
==============================================================================
--- branches/release/libs/range/doc/html/range/reference/algorithms/set.html (original)
+++ branches/release/libs/range/doc/html/range/reference/algorithms/set.html 2010-12-26 10:13:43 EST (Sun, 26 Dec 2010)
@@ -5,7 +5,7 @@
<link rel="stylesheet" href="../../../../../../../doc/src/boostbook.css" type="text/css">
<meta name="generator" content="DocBook XSL Stylesheets V1.75.2">
<link rel="home" href="../../../index.html" title="Chapter 1. Range 2.0">
-<link rel="up" href="../algorithms.html" title="Range Algorithm">
+<link rel="up" href="../algorithms.html" title="Range Algorithms">
<link rel="prev" href="non_mutating/upper_bound.html" title="upper_bound">
<link rel="next" href="set/includes.html" title="includes">
</head>
@@ -24,16 +24,14 @@
</div>
<div class="section">
<div class="titlepage"><div><div><h4 class="title">
-<a name="range.reference.algorithms.set"></a><a class="link" href="set.html" title="Set algorithms"> Set algorithms</a>
+<a name="range.reference.algorithms.set"></a><a class="link" href="set.html" title="Set algorithms">Set algorithms</a>
</h4></div></div></div>
<div class="toc"><dl>
-<dt><span class="section"> includes</span></dt>
-<dt><span class="section"> set_union</span></dt>
-<dt><span class="section"><a href="set/set_intersection.html">
- set_intersection</a></span></dt>
-<dt><span class="section"> set_difference</span></dt>
-<dt><span class="section"><a href="set/set_symmetric_difference.html">
- set_symmetric_difference</a></span></dt>
+<dt><span class="section">includes</span></dt>
+<dt><span class="section">set_union</span></dt>
+<dt><span class="section">set_intersection</span></dt>
+<dt><span class="section">set_difference</span></dt>
+<dt><span class="section">set_symmetric_difference</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/set/includes.html
==============================================================================
--- branches/release/libs/range/doc/html/range/reference/algorithms/set/includes.html (original)
+++ branches/release/libs/range/doc/html/range/reference/algorithms/set/includes.html 2010-12-26 10:13:43 EST (Sun, 26 Dec 2010)
@@ -24,10 +24,10 @@
</div>
<div class="section">
<div class="titlepage"><div><div><h5 class="title">
-<a name="range.reference.algorithms.set.includes"></a><a class="link" href="includes.html" title="includes"> includes</a>
+<a name="range.reference.algorithms.set.includes"></a><a class="link" href="includes.html" title="includes">includes</a>
</h5></div></div></div>
<a name="range.reference.algorithms.set.includes.prototype"></a><h6>
-<a name="id842532"></a>
+<a name="id741228"></a>
<a class="link" href="includes.html#range.reference.algorithms.set.includes.prototype">Prototype</a>
</h6>
<p>
@@ -47,7 +47,7 @@
<p>
</p>
<a name="range.reference.algorithms.set.includes.description"></a><h6>
-<a name="id842809"></a>
+<a name="id741508"></a>
<a class="link" href="includes.html#range.reference.algorithms.set.includes.description">Description</a>
</h6>
<p>
@@ -59,14 +59,14 @@
the predicate versions.
</p>
<a name="range.reference.algorithms.set.includes.definition"></a><h6>
-<a name="id842906"></a>
+<a name="id741601"></a>
<a class="link" href="includes.html#range.reference.algorithms.set.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.includes.requirements"></a><h6>
-<a name="id842976"></a>
+<a name="id741671"></a>
<a class="link" href="includes.html#range.reference.algorithms.set.includes.requirements">Requirements</a>
</h6>
<p>
@@ -144,7 +144,7 @@
</li>
</ul></div>
<a name="range.reference.algorithms.set.includes.precondition_"></a><h6>
-<a name="id843405"></a>
+<a name="id742080"></a>
<a class="link" href="includes.html#range.reference.algorithms.set.includes.precondition_">Precondition:</a>
</h6>
<p>
@@ -162,7 +162,7 @@
according to <code class="computeroutput"><span class="identifier">pred</span></code>.
</p>
<a name="range.reference.algorithms.set.includes.complexity"></a><h6>
-<a name="id843520"></a>
+<a name="id742194"></a>
<a class="link" href="includes.html#range.reference.algorithms.set.includes.complexity">Complexity</a>
</h6>
<p>
Modified: branches/release/libs/range/doc/html/range/reference/algorithms/set/set_difference.html
==============================================================================
--- branches/release/libs/range/doc/html/range/reference/algorithms/set/set_difference.html (original)
+++ branches/release/libs/range/doc/html/range/reference/algorithms/set/set_difference.html 2010-12-26 10:13:43 EST (Sun, 26 Dec 2010)
@@ -24,10 +24,10 @@
</div>
<div class="section">
<div class="titlepage"><div><div><h5 class="title">
-<a name="range.reference.algorithms.set.set_difference"></a><a class="link" href="set_difference.html" title="set_difference"> set_difference</a>
+<a name="range.reference.algorithms.set.set_difference"></a><a class="link" href="set_difference.html" title="set_difference">set_difference</a>
</h5></div></div></div>
<a name="range.reference.algorithms.set.set_difference.prototype"></a><h6>
-<a name="id846098"></a>
+<a name="id744721"></a>
<a class="link" href="set_difference.html#range.reference.algorithms.set.set_difference.prototype">Prototype</a>
</h6>
<p>
@@ -56,7 +56,7 @@
<p>
</p>
<a name="range.reference.algorithms.set.set_difference.description"></a><h6>
-<a name="id846439"></a>
+<a name="id745067"></a>
<a class="link" href="set_difference.html#range.reference.algorithms.set.set_difference.description">Description</a>
</h6>
<p>
@@ -70,14 +70,14 @@
the predicate versions.
</p>
<a name="range.reference.algorithms.set.set_difference.definition"></a><h6>
-<a name="id846529"></a>
+<a name="id745154"></a>
<a class="link" href="set_difference.html#range.reference.algorithms.set.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.set_difference.requirements"></a><h6>
-<a name="id846601"></a>
+<a name="id745225"></a>
<a class="link" href="set_difference.html#range.reference.algorithms.set.set_difference.requirements">Requirements</a>
</h6>
<p>
@@ -163,7 +163,7 @@
</li>
</ul></div>
<a name="range.reference.algorithms.set.set_difference.precondition_"></a><h6>
-<a name="id847086"></a>
+<a name="id745690"></a>
<a class="link" href="set_difference.html#range.reference.algorithms.set.set_difference.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.set_difference.complexity"></a><h6>
-<a name="id847201"></a>
+<a name="id745805"></a>
<a class="link" href="set_difference.html#range.reference.algorithms.set.set_difference.complexity">Complexity</a>
</h6>
<p>
Modified: branches/release/libs/range/doc/html/range/reference/algorithms/set/set_intersection.html
==============================================================================
--- branches/release/libs/range/doc/html/range/reference/algorithms/set/set_intersection.html (original)
+++ branches/release/libs/range/doc/html/range/reference/algorithms/set/set_intersection.html 2010-12-26 10:13:43 EST (Sun, 26 Dec 2010)
@@ -24,11 +24,10 @@
</div>
<div class="section">
<div class="titlepage"><div><div><h5 class="title">
-<a name="range.reference.algorithms.set.set_intersection"></a><a class="link" href="set_intersection.html" title="set_intersection">
- set_intersection</a>
+<a name="range.reference.algorithms.set.set_intersection"></a><a class="link" href="set_intersection.html" title="set_intersection">set_intersection</a>
</h5></div></div></div>
<a name="range.reference.algorithms.set.set_intersection.prototype"></a><h6>
-<a name="id844869"></a>
+<a name="id743516"></a>
<a class="link" href="set_intersection.html#range.reference.algorithms.set.set_intersection.prototype">Prototype</a>
</h6>
<p>
@@ -57,7 +56,7 @@
<p>
</p>
<a name="range.reference.algorithms.set.set_intersection.description"></a><h6>
-<a name="id845211"></a>
+<a name="id743862"></a>
<a class="link" href="set_intersection.html#range.reference.algorithms.set.set_intersection.description">Description</a>
</h6>
<p>
@@ -71,14 +70,14 @@
the predicate versions.
</p>
<a name="range.reference.algorithms.set.set_intersection.definition"></a><h6>
-<a name="id845301"></a>
+<a name="id743949"></a>
<a class="link" href="set_intersection.html#range.reference.algorithms.set.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.set_intersection.requirements"></a><h6>
-<a name="id845372"></a>
+<a name="id744019"></a>
<a class="link" href="set_intersection.html#range.reference.algorithms.set.set_intersection.requirements">Requirements</a>
</h6>
<p>
@@ -164,7 +163,7 @@
</li>
</ul></div>
<a name="range.reference.algorithms.set.set_intersection.precondition_"></a><h6>
-<a name="id845858"></a>
+<a name="id744484"></a>
<a class="link" href="set_intersection.html#range.reference.algorithms.set.set_intersection.precondition_">Precondition:</a>
</h6>
<p>
@@ -182,7 +181,7 @@
according to <code class="computeroutput"><span class="identifier">pred</span></code>.
</p>
<a name="range.reference.algorithms.set.set_intersection.complexity"></a><h6>
-<a name="id845974"></a>
+<a name="id744599"></a>
<a class="link" href="set_intersection.html#range.reference.algorithms.set.set_intersection.complexity">Complexity</a>
</h6>
<p>
Modified: branches/release/libs/range/doc/html/range/reference/algorithms/set/set_symmetric_difference.html
==============================================================================
--- branches/release/libs/range/doc/html/range/reference/algorithms/set/set_symmetric_difference.html (original)
+++ branches/release/libs/range/doc/html/range/reference/algorithms/set/set_symmetric_difference.html 2010-12-26 10:13:43 EST (Sun, 26 Dec 2010)
@@ -24,11 +24,10 @@
</div>
<div class="section">
<div class="titlepage"><div><div><h5 class="title">
-<a name="range.reference.algorithms.set.set_symmetric_difference"></a><a class="link" href="set_symmetric_difference.html" title="set_symmetric_difference">
- set_symmetric_difference</a>
+<a name="range.reference.algorithms.set.set_symmetric_difference"></a><a class="link" href="set_symmetric_difference.html" title="set_symmetric_difference">set_symmetric_difference</a>
</h5></div></div></div>
<a name="range.reference.algorithms.set.set_symmetric_difference.prototype"></a><h6>
-<a name="id847328"></a>
+<a name="id745928"></a>
<a class="link" href="set_symmetric_difference.html#range.reference.algorithms.set.set_symmetric_difference.prototype">Prototype</a>
</h6>
<p>
@@ -59,7 +58,7 @@
<p>
</p>
<a name="range.reference.algorithms.set.set_symmetric_difference.description"></a><h6>
-<a name="id847671"></a>
+<a name="id746274"></a>
<a class="link" href="set_symmetric_difference.html#range.reference.algorithms.set.set_symmetric_difference.description">Description</a>
</h6>
<p>
@@ -75,14 +74,14 @@
the predicate versions.
</p>
<a name="range.reference.algorithms.set.set_symmetric_difference.definition"></a><h6>
-<a name="id847762"></a>
+<a name="id746362"></a>
<a class="link" href="set_symmetric_difference.html#range.reference.algorithms.set.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.set_symmetric_difference.requirements"></a><h6>
-<a name="id847834"></a>
+<a name="id746432"></a>
<a class="link" href="set_symmetric_difference.html#range.reference.algorithms.set.set_symmetric_difference.requirements">Requirements</a>
</h6>
<p>
@@ -168,7 +167,7 @@
</li>
</ul></div>
<a name="range.reference.algorithms.set.set_symmetric_difference.precondition_"></a><h6>
-<a name="id848321"></a>
+<a name="id746896"></a>
<a class="link" href="set_symmetric_difference.html#range.reference.algorithms.set.set_symmetric_difference.precondition_">Precondition:</a>
</h6>
<p>
@@ -186,7 +185,7 @@
according to <code class="computeroutput"><span class="identifier">pred</span></code>.
</p>
<a name="range.reference.algorithms.set.set_symmetric_difference.complexity"></a><h6>
-<a name="id848437"></a>
+<a name="id747010"></a>
<a class="link" href="set_symmetric_difference.html#range.reference.algorithms.set.set_symmetric_difference.complexity">Complexity</a>
</h6>
<p>
Modified: branches/release/libs/range/doc/html/range/reference/algorithms/set/set_union.html
==============================================================================
--- branches/release/libs/range/doc/html/range/reference/algorithms/set/set_union.html (original)
+++ branches/release/libs/range/doc/html/range/reference/algorithms/set/set_union.html 2010-12-26 10:13:43 EST (Sun, 26 Dec 2010)
@@ -24,10 +24,10 @@
</div>
<div class="section">
<div class="titlepage"><div><div><h5 class="title">
-<a name="range.reference.algorithms.set.set_union"></a><a class="link" href="set_union.html" title="set_union"> set_union</a>
+<a name="range.reference.algorithms.set.set_union"></a><a class="link" href="set_union.html" title="set_union">set_union</a>
</h5></div></div></div>
<a name="range.reference.algorithms.set.set_union.prototype"></a><h6>
-<a name="id843644"></a>
+<a name="id742315"></a>
<a class="link" href="set_union.html#range.reference.algorithms.set.set_union.prototype">Prototype</a>
</h6>
<p>
@@ -56,7 +56,7 @@
<p>
</p>
<a name="range.reference.algorithms.set.set_union.description"></a><h6>
-<a name="id843986"></a>
+<a name="id742661"></a>
<a class="link" href="set_union.html#range.reference.algorithms.set.set_union.description">Description</a>
</h6>
<p>
@@ -69,14 +69,14 @@
in the predicate versions.
</p>
<a name="range.reference.algorithms.set.set_union.definition"></a><h6>
-<a name="id844073"></a>
+<a name="id742744"></a>
<a class="link" href="set_union.html#range.reference.algorithms.set.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.set_union.requirements"></a><h6>
-<a name="id844144"></a>
+<a name="id742815"></a>
<a class="link" href="set_union.html#range.reference.algorithms.set.set_union.requirements">Requirements</a>
</h6>
<p>
@@ -162,7 +162,7 @@
</li>
</ul></div>
<a name="range.reference.algorithms.set.set_union.precondition_"></a><h6>
-<a name="id844630"></a>
+<a name="id743280"></a>
<a class="link" href="set_union.html#range.reference.algorithms.set.set_union.precondition_">Precondition:</a>
</h6>
<p>
@@ -180,7 +180,7 @@
according to <code class="computeroutput"><span class="identifier">pred</span></code>.
</p>
<a name="range.reference.algorithms.set.set_union.complexity"></a><h6>
-<a name="id844744"></a>
+<a name="id743392"></a>
<a class="link" href="set_union.html#range.reference.algorithms.set.set_union.complexity">Complexity</a>
</h6>
<p>
Modified: branches/release/libs/range/doc/html/range/reference/concept_implementation.html
==============================================================================
--- branches/release/libs/range/doc/html/range/reference/concept_implementation.html (original)
+++ branches/release/libs/range/doc/html/range/reference/concept_implementation.html 2010-12-26 10:13:43 EST (Sun, 26 Dec 2010)
@@ -24,7 +24,7 @@
</div>
<div class="section">
<div class="titlepage"><div><div><h3 class="title">
-<a name="range.reference.concept_implementation"></a><a class="link" href="concept_implementation.html" title="Range concept implementation"> Range concept
+<a name="range.reference.concept_implementation"></a><a class="link" href="concept_implementation.html" title="Range concept implementation">Range concept
implementation</a>
</h3></div></div></div>
<div class="toc"><dl>
Modified: branches/release/libs/range/doc/html/range/reference/concept_implementation/semantics.html
==============================================================================
--- branches/release/libs/range/doc/html/range/reference/concept_implementation/semantics.html (original)
+++ branches/release/libs/range/doc/html/range/reference/concept_implementation/semantics.html 2010-12-26 10:13:43 EST (Sun, 26 Dec 2010)
@@ -31,7 +31,7 @@
<dt><span class="section">Functions</span></dt>
</dl></div>
<a name="range.reference.concept_implementation.semantics.notation"></a><h6>
-<a name="id766560"></a>
+<a name="id665247"></a>
<a class="link" href="semantics.html#range.reference.concept_implementation.semantics.notation">notation</a>
</h6>
<div class="informaltable"><table class="table">
Modified: branches/release/libs/range/doc/html/range/reference/concept_implementation/semantics/functions.html
==============================================================================
--- branches/release/libs/range/doc/html/range/reference/concept_implementation/semantics/functions.html (original)
+++ branches/release/libs/range/doc/html/range/reference/concept_implementation/semantics/functions.html 2010-12-26 10:13:43 EST (Sun, 26 Dec 2010)
@@ -168,8 +168,27 @@
</td>
<td>
<p>
- <code class="computeroutput"><span class="identifier">boost</span><span class="special">::</span><span class="identifier">end</span><span class="special">(</span><span class="identifier">x</span><span class="special">)</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">x</span><span class="special">)</span></code>
+ <code class="computeroutput"><span class="identifier">The</span> <span class="identifier">size</span>
+ <span class="identifier">of</span> <span class="identifier">the</span>
+ <span class="identifier">range</span> <span class="identifier">with</span>
+ <span class="identifier">complexity</span> <span class="identifier">O</span><span class="special">(</span><span class="number">1</span><span class="special">).</span> <span class="identifier">For</span>
+ <span class="identifier">RandomAccessRanges</span> <span class="keyword">this</span> <span class="identifier">is</span>
+ <span class="identifier">achieved</span> <span class="identifier">via</span>
+ <span class="identifier">boost</span><span class="special">::</span><span class="identifier">end</span><span class="special">(</span><span class="identifier">x</span><span class="special">)</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">x</span><span class="special">).</span> <span class="identifier">For</span>
+ <span class="identifier">other</span> <span class="identifier">traversal</span>
+ <span class="identifier">categories</span> <span class="identifier">range_calculate_size</span><span class="special">(</span><span class="identifier">x</span><span class="special">)</span> <span class="identifier">is</span>
+ <span class="identifier">returned</span><span class="special">.</span>
+ <span class="identifier">Note</span> <span class="identifier">that</span>
+ <span class="identifier">unless</span> <span class="identifier">range_calculate_size</span><span class="special">(</span><span class="identifier">x</span><span class="special">)</span> <span class="identifier">has</span>
+ <span class="identifier">been</span> <span class="identifier">implemented</span>
+ <span class="identifier">by</span> <span class="identifier">the</span>
+ <span class="identifier">user</span> <span class="identifier">as</span>
+ <span class="identifier">an</span> <span class="identifier">extension</span>
+ <span class="identifier">then</span> <span class="identifier">the</span>
+ <span class="identifier">Argument</span> <span class="identifier">Dependent</span>
+ <span class="identifier">Lookup</span> <span class="identifier">will</span>
+ <span class="keyword">return</span> <span class="identifier">x</span><span class="special">.</span><span class="identifier">size</span><span class="special">()</span></code>
</p>
</td>
<td>
Modified: branches/release/libs/range/doc/html/range/reference/concept_implementation/semantics/metafunctions.html
==============================================================================
--- branches/release/libs/range/doc/html/range/reference/concept_implementation/semantics/metafunctions.html (original)
+++ branches/release/libs/range/doc/html/range/reference/concept_implementation/semantics/metafunctions.html 2010-12-26 10:13:43 EST (Sun, 26 Dec 2010)
@@ -217,6 +217,44 @@
</p>
</td>
</tr>
+<tr>
+<td>
+ <p>
+ <code class="computeroutput"><span class="identifier">has_range_iterator</span><span class="special"><</span><span class="identifier">X</span><span class="special">>::</span><span class="identifier">type</span></code>
+ </p>
+ </td>
+<td>
+ <p>
+ <code class="computeroutput"><span class="identifier">mpl</span><span class="special">::</span><span class="identifier">true_</span></code> if <code class="computeroutput"><span class="identifier">range_mutable_iterator</span><span class="special"><</span><span class="identifier">X</span><span class="special">>::</span><span class="identifier">type</span></code>
+ is a valid expression, <code class="computeroutput"><span class="identifier">mpl</span><span class="special">::</span><span class="identifier">false_</span></code>
+ otherwise
+ </p>
+ </td>
+<td>
+ <p>
+ compile time
+ </p>
+ </td>
+</tr>
+<tr>
+<td>
+ <p>
+ <code class="computeroutput"><span class="identifier">has_range_const_iterator</span><span class="special"><</span><span class="identifier">X</span><span class="special">>::</span><span class="identifier">type</span></code>
+ </p>
+ </td>
+<td>
+ <p>
+ <code class="computeroutput"><span class="identifier">mpl</span><span class="special">::</span><span class="identifier">true_</span></code> if <code class="computeroutput"><span class="identifier">range_const_iterator</span><span class="special"><</span><span class="identifier">X</span><span class="special">>::</span><span class="identifier">type</span></code>
+ is a valid expression, <code class="computeroutput"><span class="identifier">mpl</span><span class="special">::</span><span class="identifier">false_</span></code>
+ otherwise
+ </p>
+ </td>
+<td>
+ <p>
+ compile time
+ </p>
+ </td>
+</tr>
</tbody>
</table></div>
</div>
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-12-26 10:13:43 EST (Sun, 26 Dec 2010)
@@ -24,14 +24,14 @@
</div>
<div class="section">
<div class="titlepage"><div><div><h3 class="title">
-<a name="range.reference.extending"></a><a class="link" href="extending.html" title="Extending the library"> Extending the library</a>
+<a name="range.reference.extending"></a><a class="link" href="extending.html" title="Extending the library">Extending the library</a>
</h3></div></div></div>
<div class="toc"><dl>
-<dt><span class="section"><a href="extending/method_1.html"> Method 1: provide
+<dt><span class="section"><a href="extending/method_1.html">Method 1: provide
member functions and nested types</a></span></dt>
-<dt><span class="section"><a href="extending/method_2.html"> Method 2: provide
+<dt><span class="section"><a href="extending/method_2.html">Method 2: provide
free-standing functions and specialize metafunctions</a></span></dt>
-<dt><span class="section"><a href="extending/method_3.html"> Method 3: provide
+<dt><span class="section"><a href="extending/method_3.html">Method 3: provide
range adaptor implementations</a></span></dt>
</dl></div>
</div>
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-12-26 10:13:43 EST (Sun, 26 Dec 2010)
@@ -24,7 +24,7 @@
</div>
<div class="section">
<div class="titlepage"><div><div><h4 class="title">
-<a name="range.reference.extending.method_1"></a><a class="link" href="method_1.html" title="Method 1: provide member functions and nested types"> Method 1: provide
+<a name="range.reference.extending.method_1"></a><a class="link" href="method_1.html" title="Method 1: provide member functions and nested types">Method 1: provide
member functions and nested types</a>
</h4></div></div></div>
<p>
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-12-26 10:13:43 EST (Sun, 26 Dec 2010)
@@ -24,7 +24,7 @@
</div>
<div class="section">
<div class="titlepage"><div><div><h4 class="title">
-<a name="range.reference.extending.method_2"></a><a class="link" href="method_2.html" title="Method 2: provide free-standing functions and specialize metafunctions"> Method 2: provide
+<a name="range.reference.extending.method_2"></a><a class="link" href="method_2.html" title="Method 2: provide free-standing functions and specialize metafunctions">Method 2: provide
free-standing functions and specialize metafunctions</a>
</h4></div></div></div>
<p>
@@ -83,6 +83,26 @@
</p>
</td>
</tr>
+<tr>
+<td>
+ <p>
+ <code class="computeroutput"><span class="identifier">range_calculate_size</span><span class="special">(</span><span class="identifier">x</span><span class="special">)</span></code>
+ </p>
+ </td>
+<td>
+ <p>
+ Optional. This can be used to specify a mechanism for constant-time
+ computation of the size of a range. The default behaviour is
+ to return <code class="computeroutput"><span class="identifier">boost</span><span class="special">::</span><span class="identifier">end</span><span class="special">(</span><span class="identifier">x</span><span class="special">)</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">x</span><span class="special">)</span></code>
+ for random access ranges, and to return <code class="computeroutput"><span class="identifier">x</span><span class="special">.</span><span class="identifier">size</span><span class="special">()</span></code> for ranges with lesser traversal
+ capability. This behaviour can be changed by implementing <code class="computeroutput"><span class="identifier">range_calculate_size</span></code> in a manner
+ that will be found via ADL. The ability to calculate size in
+ O(1) is often possible even with ranges with traversal categories
+ less than random access.
+ </p>
+ </td>
+</tr>
</tbody>
</table></div>
<p>
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-12-26 10:13:43 EST (Sun, 26 Dec 2010)
@@ -24,13 +24,13 @@
</div>
<div class="section">
<div class="titlepage"><div><div><h4 class="title">
-<a name="range.reference.extending.method_3"></a><a class="link" href="method_3.html" title="Method 3: provide range adaptor implementations"> Method 3: provide
+<a name="range.reference.extending.method_3"></a><a class="link" href="method_3.html" title="Method 3: provide range adaptor implementations">Method 3: provide
range adaptor implementations</a>
</h4></div></div></div>
<div class="toc"><dl>
-<dt><span class="section"><a href="method_3/method_3_1.html"> Method
+<dt><span class="section"><a href="method_3/method_3_1.html">Method
3.1: Implement a Range Adaptor without arguments</a></span></dt>
-<dt><span class="section"><a href="method_3/method_3_2.html"> Method
+<dt><span class="section"><a href="method_3/method_3_2.html">Method
3.2: Implement a Range Adaptor with arguments</a></span></dt>
</dl></div>
</div>
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-12-26 10:13:43 EST (Sun, 26 Dec 2010)
@@ -24,7 +24,7 @@
</div>
<div class="section">
<div class="titlepage"><div><div><h5 class="title">
-<a name="range.reference.extending.method_3.method_3_1"></a><a class="link" href="method_3_1.html" title="Method 3.1: Implement a Range Adaptor without arguments"> Method
+<a name="range.reference.extending.method_3.method_3_1"></a><a class="link" href="method_3_1.html" title="Method 3.1: Implement a Range Adaptor without arguments">Method
3.1: Implement a Range Adaptor without arguments</a>
</h5></div></div></div>
<p>
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-12-26 10:13:43 EST (Sun, 26 Dec 2010)
@@ -24,7 +24,7 @@
</div>
<div class="section">
<div class="titlepage"><div><div><h5 class="title">
-<a name="range.reference.extending.method_3.method_3_2"></a><a class="link" href="method_3_2.html" title="Method 3.2: Implement a Range Adaptor with arguments"> Method
+<a name="range.reference.extending.method_3.method_3_2"></a><a class="link" href="method_3_2.html" title="Method 3.2: Implement a Range Adaptor with arguments">Method
3.2: Implement a Range Adaptor with arguments</a>
</h5></div></div></div>
<div class="orderedlist"><ol class="orderedlist" type="1">
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-12-26 10:13:43 EST (Sun, 26 Dec 2010)
@@ -24,12 +24,12 @@
</div>
<div class="section">
<div class="titlepage"><div><div><h3 class="title">
-<a name="range.reference.ranges"></a><a class="link" href="ranges.html" title="Provided Ranges"> Provided Ranges</a>
+<a name="range.reference.ranges"></a><a class="link" href="ranges.html" title="Provided Ranges">Provided Ranges</a>
</h3></div></div></div>
<div class="toc"><dl>
-<dt><span class="section"> counting_range</span></dt>
-<dt><span class="section"> istream_range</span></dt>
-<dt><span class="section"> irange</span></dt>
+<dt><span class="section">counting_range</span></dt>
+<dt><span class="section">istream_range</span></dt>
+<dt><span class="section">irange</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/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-12-26 10:13:43 EST (Sun, 26 Dec 2010)
@@ -24,10 +24,10 @@
</div>
<div class="section">
<div class="titlepage"><div><div><h4 class="title">
-<a name="range.reference.ranges.counting_range"></a><a class="link" href="counting_range.html" title="counting_range"> counting_range</a>
+<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="id864730"></a>
+<a name="id762769"></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="id865103"></a>
+<a name="id763151"></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="id865161"></a>
+<a name="id763206"></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="id865223"></a>
+<a name="id763267"></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-12-26 10:13:43 EST (Sun, 26 Dec 2010)
@@ -24,10 +24,10 @@
</div>
<div class="section">
<div class="titlepage"><div><div><h4 class="title">
-<a name="range.reference.ranges.irange"></a><a class="link" href="irange.html" title="irange"> irange</a>
+<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="id865658"></a>
+<a name="id763696"></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="id865946"></a>
+<a name="id763990"></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="id866026"></a>
+<a name="id764067"></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="id866088"></a>
+<a name="id764128"></a>
<a class="link" href="irange.html#range.reference.ranges.irange.requirements">Requirements</a>
</h6>
<div class="orderedlist"><ol class="orderedlist" type="1">
@@ -80,7 +80,7 @@
</li>
</ol></div>
<a name="range.reference.ranges.irange.complexity"></a><h6>
-<a name="id866173"></a>
+<a name="id764211"></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-12-26 10:13:43 EST (Sun, 26 Dec 2010)
@@ -24,10 +24,10 @@
</div>
<div class="section">
<div class="titlepage"><div><div><h4 class="title">
-<a name="range.reference.ranges.istream_range"></a><a class="link" href="istream_range.html" title="istream_range"> istream_range</a>
+<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="id865300"></a>
+<a name="id763339"></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="id865512"></a>
+<a name="id763555"></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="id865579"></a>
+<a name="id763619"></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/utilities.html
==============================================================================
--- branches/release/libs/range/doc/html/range/reference/utilities.html (original)
+++ branches/release/libs/range/doc/html/range/reference/utilities.html 2010-12-26 10:13:43 EST (Sun, 26 Dec 2010)
@@ -24,12 +24,12 @@
</div>
<div class="section">
<div class="titlepage"><div><div><h3 class="title">
-<a name="range.reference.utilities"></a><a class="link" href="utilities.html" title="Utilities"> Utilities</a>
+<a name="range.reference.utilities"></a><a class="link" href="utilities.html" title="Utilities">Utilities</a>
</h3></div></div></div>
<div class="toc"><dl>
-<dt><span class="section"> Class iterator_range</span></dt>
-<dt><span class="section"> Class sub_range</span></dt>
-<dt><span class="section"> Function join</span></dt>
+<dt><span class="section">Class iterator_range</span></dt>
+<dt><span class="section">Class sub_range</span></dt>
+<dt><span class="section">Function join</span></dt>
</dl></div>
<p>
Having an abstraction that encapsulates a pair of iterators is very useful.
Modified: branches/release/libs/range/doc/html/range/reference/utilities/iterator_range.html
==============================================================================
--- branches/release/libs/range/doc/html/range/reference/utilities/iterator_range.html (original)
+++ branches/release/libs/range/doc/html/range/reference/utilities/iterator_range.html 2010-12-26 10:13:43 EST (Sun, 26 Dec 2010)
@@ -24,7 +24,7 @@
</div>
<div class="section">
<div class="titlepage"><div><div><h4 class="title">
-<a name="range.reference.utilities.iterator_range"></a><a class="link" href="iterator_range.html" title="Class iterator_range"> Class <code class="computeroutput"><span class="identifier">iterator_range</span></code></a>
+<a name="range.reference.utilities.iterator_range"></a><a class="link" href="iterator_range.html" title="Class iterator_range">Class <code class="computeroutput"><span class="identifier">iterator_range</span></code></a>
</h4></div></div></div>
<p>
The intention of the <code class="computeroutput"><span class="identifier">iterator_range</span></code>
@@ -48,7 +48,7 @@
type.
</p>
<a name="range.reference.utilities.iterator_range.synopsis"></a><h5>
-<a name="id866556"></a>
+<a name="id764572"></a>
<a class="link" href="iterator_range.html#range.reference.utilities.iterator_range.synopsis">Synopsis</a>
</h5>
<p>
@@ -188,7 +188,7 @@
iterators from the same container.
</p>
<a name="range.reference.utilities.iterator_range.details_member_functions"></a><h5>
-<a name="id869702"></a>
+<a name="id767779"></a>
<a class="link" href="iterator_range.html#range.reference.utilities.iterator_range.details_member_functions">Details
member functions</a>
</h5>
@@ -207,7 +207,7 @@
<span class="special">==</span> <span class="identifier">r</span><span class="special">.</span><span class="identifier">end</span><span class="special">();</span></code>
</p></blockquote></div>
<a name="range.reference.utilities.iterator_range.details_functions"></a><h5>
-<a name="id869933"></a>
+<a name="id768014"></a>
<a class="link" href="iterator_range.html#range.reference.utilities.iterator_range.details_functions">Details
functions</a>
</h5>
Modified: branches/release/libs/range/doc/html/range/reference/utilities/join.html
==============================================================================
--- branches/release/libs/range/doc/html/range/reference/utilities/join.html (original)
+++ branches/release/libs/range/doc/html/range/reference/utilities/join.html 2010-12-26 10:13:43 EST (Sun, 26 Dec 2010)
@@ -24,7 +24,7 @@
</div>
<div class="section">
<div class="titlepage"><div><div><h4 class="title">
-<a name="range.reference.utilities.join"></a><a class="link" href="join.html" title="Function join"> Function join</a>
+<a name="range.reference.utilities.join"></a><a class="link" href="join.html" title="Function join">Function join</a>
</h4></div></div></div>
<p>
The intention of the <code class="computeroutput"><span class="identifier">join</span></code>
@@ -39,33 +39,76 @@
check if the end of a range has been reached internally during traversal.
</p>
<a name="range.reference.utilities.join.synposis"></a><h5>
-<a name="id872294"></a>
+<a name="id770410"></a>
<a class="link" href="join.html#range.reference.utilities.join.synposis">Synposis</a>
</h5>
<p>
</p>
<pre class="programlisting"><span class="keyword">template</span><span class="special"><</span><span class="keyword">typename</span> <span class="identifier">SinglePassRange1</span><span class="special">,</span> <span class="keyword">typename</span> <span class="identifier">SinglePassRange2</span><span class="special">></span>
-<span class="identifier">iterator_range</span><span class="special"><</span><span class="identifier">range_detail</span><span class="special">::</span><span class="identifier">join_iterator</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">SinglePassRange1</span><span class="special">>::</span><span class="identifier">type</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">SinglePassRange2</span><span class="special">>::</span><span class="identifier">type</span><span class="special">,</span>
- <span class="keyword">typename</span> <span class="identifier">add_const</span><span class="special"><</span>
- <span class="keyword">typename</span> <span class="identifier">range_value</span><span class="special"><</span><span class="keyword">const</span> <span class="identifier">SinglePassRange1</span><span class="special">>::</span><span class="identifier">type</span><span class="special">>::</span><span class="identifier">type</span><span class="special">></span>
-<span class="special">></span>
+<span class="identifier">joined_range</span><span class="special"><</span><span class="keyword">const</span> <span class="identifier">SinglePassRange1</span><span class="special">,</span> <span class="keyword">const</span> <span class="identifier">SinglePassRange2</span><span class="special">></span>
<span class="identifier">join</span><span class="special">(</span><span class="keyword">const</span> <span class="identifier">SinglePassRange1</span><span class="special">&</span> <span class="identifier">rng1</span><span class="special">,</span> <span class="keyword">const</span> <span class="identifier">SinglePassRange2</span><span class="special">&</span> <span class="identifier">rng2</span><span class="special">)</span>
<span class="keyword">template</span><span class="special"><</span><span class="keyword">typename</span> <span class="identifier">SinglePassRange1</span><span class="special">,</span> <span class="keyword">typename</span> <span class="identifier">SinglePassRange2</span><span class="special">></span>
-<span class="identifier">iterator_range</span><span class="special"><</span><span class="identifier">range_detail</span><span class="special">::</span><span class="identifier">join_iterator</span><span class="special"><</span>
- <span class="keyword">typename</span> <span class="identifier">range_iterator</span><span class="special"><</span><span class="identifier">SinglePassRange1</span><span class="special">>::</span><span class="identifier">type</span><span class="special">,</span>
- <span class="keyword">typename</span> <span class="identifier">range_iterator</span><span class="special"><</span><span class="identifier">SinglePassRange2</span><span class="special">>::</span><span class="identifier">type</span><span class="special">,</span>
- <span class="keyword">typename</span> <span class="identifier">range_value</span><span class="special"><</span><span class="identifier">SinglePassRange1</span><span class="special">>::</span><span class="identifier">type</span><span class="special">></span>
-<span class="special">></span>
+<span class="identifier">joined_range</span><span class="special"><</span><span class="identifier">SinglePassRange1</span><span class="special">,</span> <span class="identifier">SinglePassRange2</span><span class="special">></span>
<span class="identifier">join</span><span class="special">(</span><span class="identifier">SinglePassRange1</span><span class="special">&</span> <span class="identifier">rng1</span><span class="special">,</span> <span class="identifier">SinglePassRange2</span><span class="special">&</span> <span class="identifier">rng2</span><span class="special">);</span>
</pre>
<p>
</p>
+<p>
+ For the const version:
+ </p>
+<div class="itemizedlist"><ul class="itemizedlist" type="disc">
+<li class="listitem">
+ <span class="bold"><strong>Precondition:</strong></span> The <code class="computeroutput"><span class="identifier">range_value</span><span class="special"><</span><span class="identifier">SinglePassRange2</span><span class="special">>::</span><span class="identifier">type</span></code>
+ must be convertible to <code class="computeroutput"><span class="identifier">range_value</span><span class="special"><</span><span class="identifier">SinglePassRange1</span><span class="special">>::</span><span class="identifier">type</span></code>.
+ The <code class="computeroutput"><span class="identifier">range_reference</span><span class="special"><</span><span class="keyword">const</span>
+ <span class="identifier">SinglePassRange2</span><span class="special">>::</span><span class="identifier">type</span></code> must be convertible to <code class="computeroutput"><span class="identifier">range_reference</span><span class="special"><</span><span class="keyword">const</span> <span class="identifier">SinglePassRange1</span><span class="special">>::</span><span class="identifier">type</span></code>.
+ </li>
+<li class="listitem">
+ <span class="bold"><strong>Range Category:</strong></span> Both <code class="computeroutput"><span class="identifier">rng1</span></code> and <code class="computeroutput"><span class="identifier">rng2</span></code>
+ must be a model of <a class="link" href="../../concepts/single_pass_range.html" title="Single Pass Range">Single
+ Pass Range</a> or better.
+ </li>
+<li class="listitem">
+ <span class="bold"><strong>Range Return Type:</strong></span> <code class="computeroutput"><span class="identifier">joined_range</span><span class="special"><</span><span class="keyword">const</span>
+ <span class="identifier">SinglePassRange1</span><span class="special">,</span>
+ <span class="keyword">const</span> <span class="identifier">SinglePassRange2</span><span class="special">></span></code> which is a model of the lesser
+ of the two range concepts passed.
+ </li>
+<li class="listitem">
+ <span class="bold"><strong>Returned Range Category:</strong></span> The minimum
+ of the range category of <code class="computeroutput"><span class="identifier">rng1</span></code>
+ and <code class="computeroutput"><span class="identifier">rng2</span></code>.
+ </li>
+</ul></div>
+<p>
+ For the mutable version:
+ </p>
+<div class="itemizedlist"><ul class="itemizedlist" type="disc">
+<li class="listitem">
+ <span class="bold"><strong>Precondition:</strong></span> The <code class="computeroutput"><span class="identifier">range_value</span><span class="special"><</span><span class="identifier">SinglePassRange2</span><span class="special">>::</span><span class="identifier">type</span></code>
+ must be convertible to <code class="computeroutput"><span class="identifier">range_value</span><span class="special"><</span><span class="identifier">SinglePassRange1</span><span class="special">>::</span><span class="identifier">type</span></code>.
+ The <code class="computeroutput"><span class="identifier">range_reference</span><span class="special"><</span><span class="identifier">SinglePassRange2</span><span class="special">>::</span><span class="identifier">type</span></code>
+ must be convertible to <code class="computeroutput"><span class="identifier">range_reference</span><span class="special"><</span><span class="identifier">SinglePassRange1</span><span class="special">>::</span><span class="identifier">type</span></code>.
+ </li>
+<li class="listitem">
+ <span class="bold"><strong>Range Category:</strong></span> Both <code class="computeroutput"><span class="identifier">rng1</span></code> and <code class="computeroutput"><span class="identifier">rng2</span></code>
+ must be a model of <a class="link" href="../../concepts/single_pass_range.html" title="Single Pass Range">Single
+ Pass Range</a> or better.
+ </li>
+<li class="listitem">
+ <span class="bold"><strong>Range Return Type:</strong></span> <code class="computeroutput"><span class="identifier">joined_range</span><span class="special"><</span><span class="identifier">SinglePassRange1</span><span class="special">,</span> <span class="identifier">SinglePassRange2</span><span class="special">></span></code> which is a model of the lesser
+ of the two range concepts passed.
+ </li>
+<li class="listitem">
+ <span class="bold"><strong>Returned Range Category:</strong></span> The minimum
+ of the range category of <code class="computeroutput"><span class="identifier">rng1</span></code>
+ and <code class="computeroutput"><span class="identifier">rng2</span></code>.
+ </li>
+</ul></div>
<a name="range.reference.utilities.join.example"></a><h5>
-<a name="id872828"></a>
+<a name="id771245"></a>
<a class="link" href="join.html#range.reference.utilities.join.example">Example</a>
</h5>
<p>
Modified: branches/release/libs/range/doc/html/range/reference/utilities/sub_range.html
==============================================================================
--- branches/release/libs/range/doc/html/range/reference/utilities/sub_range.html (original)
+++ branches/release/libs/range/doc/html/range/reference/utilities/sub_range.html 2010-12-26 10:13:43 EST (Sun, 26 Dec 2010)
@@ -24,7 +24,7 @@
</div>
<div class="section">
<div class="titlepage"><div><div><h4 class="title">
-<a name="range.reference.utilities.sub_range"></a><a class="link" href="sub_range.html" title="Class sub_range"> Class <code class="computeroutput"><span class="identifier">sub_range</span></code></a>
+<a name="range.reference.utilities.sub_range"></a><a class="link" href="sub_range.html" title="Class sub_range">Class <code class="computeroutput"><span class="identifier">sub_range</span></code></a>
</h4></div></div></div>
<p>
The <code class="computeroutput"><span class="identifier">sub_range</span></code> class inherits
@@ -35,7 +35,7 @@
is.
</p>
<a name="range.reference.utilities.sub_range.synopsis"></a><h5>
-<a name="id871048"></a>
+<a name="id769145"></a>
<a class="link" href="sub_range.html#range.reference.utilities.sub_range.synopsis">Synopsis</a>
</h5>
<p>
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-12-26 10:13:43 EST (Sun, 26 Dec 2010)
@@ -7,7 +7,7 @@
<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">
-<link rel="next" href="library_headers.html" title="Library Headers">
+<link rel="next" href="headers.html" title="Library Headers">
</head>
<body bgcolor="white" text="black" link="#0000FF" vlink="#840084" alink="#0000FF">
<table cellpadding="2" width="100%"><tr>
@@ -20,11 +20,11 @@
</tr></table>
<hr>
<div class="spirit-nav">
-<a accesskey="p" href="reference/extending/method_3/method_3_2.html"><img src="../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../index.html"><img src="../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../index.html"><img src="../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="library_headers.html"><img src="../../../../../doc/src/images/next.png" alt="Next"></a>
+<a accesskey="p" href="reference/extending/method_3/method_3_2.html"><img src="../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../index.html"><img src="../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../index.html"><img src="../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="headers.html"><img src="../../../../../doc/src/images/next.png" alt="Next"></a>
</div>
<div class="section">
<div class="titlepage"><div><div><h2 class="title" style="clear: both">
-<a name="range.style_guide"></a><a class="link" href="style_guide.html" title="Terminology and style guidelines"> Terminology and style guidelines</a>
+<a name="range.style_guide"></a><a class="link" href="style_guide.html" title="Terminology and style guidelines">Terminology and style guidelines</a>
</h2></div></div></div>
<p>
The use of a consistent terminology is as important for <a class="link" href="concepts.html" title="Range Concepts">Ranges</a>
@@ -39,41 +39,43 @@
</p>
<div class="itemizedlist"><ul class="itemizedlist" type="disc">
<li class="listitem">
+<p class="simpara">
<span class="bold"><strong><span class="emphasis"><em>Value access</em></span></strong></span> category:
- <div class="itemizedlist"><ul class="itemizedlist" type="circle">
+ </p>
+<div class="itemizedlist"><ul class="itemizedlist" type="circle">
<li class="listitem">
- Readable Range
- </li>
+ Readable Range
+ </li>
<li class="listitem">
- Writeable Range
- </li>
+ Writeable Range
+ </li>
<li class="listitem">
- Swappable Range
- </li>
+ Swappable Range
+ </li>
<li class="listitem">
- Lvalue Range
- </li>
+ Lvalue Range
+ </li>
</ul></div>
- </li>
+</li>
<li class="listitem">
+<p class="simpara">
<span class="bold"><strong><span class="emphasis"><em>Traversal</em></span></strong></span> category:
- <div class="itemizedlist"><ul class="itemizedlist" type="circle">
+ </p>
+<div class="itemizedlist"><ul class="itemizedlist" type="circle">
<li class="listitem">
- <a class="link" href="concepts/single_pass_range.html" title="Single Pass Range">Single Pass Range</a>
- </li>
+ <a class="link" href="concepts/single_pass_range.html" title="Single Pass Range">Single Pass Range</a>
+ </li>
<li class="listitem">
- <a class="link" href="concepts/forward_range.html" title="Forward Range">Forward Range</a>
- </li>
+ <a class="link" href="concepts/forward_range.html" title="Forward Range">Forward Range</a>
+ </li>
<li class="listitem">
- <a class="link" href="concepts/bidirectional_range.html" title="Bidirectional Range">Bidirectional
- Range</a>
- </li>
+ <a class="link" href="concepts/bidirectional_range.html" title="Bidirectional Range">Bidirectional Range</a>
+ </li>
<li class="listitem">
- <a class="link" href="concepts/random_access_range.html" title="Random Access Range">Random Access
- Range</a>
- </li>
+ <a class="link" href="concepts/random_access_range.html" title="Random Access Range">Random Access Range</a>
+ </li>
</ul></div>
- </li>
+</li>
</ul></div>
<p>
Notice how we have used the categories from the <a href="../../../../../libs/iterator/doc/new-iter-concepts.html" target="_top">new
@@ -145,7 +147,7 @@
</tr></table>
<hr>
<div class="spirit-nav">
-<a accesskey="p" href="reference/extending/method_3/method_3_2.html"><img src="../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../index.html"><img src="../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../index.html"><img src="../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="library_headers.html"><img src="../../../../../doc/src/images/next.png" alt="Next"></a>
+<a accesskey="p" href="reference/extending/method_3/method_3_2.html"><img src="../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../index.html"><img src="../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../index.html"><img src="../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="headers.html"><img src="../../../../../doc/src/images/next.png" alt="Next"></a>
</div>
</body>
</html>
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-12-26 10:13:43 EST (Sun, 26 Dec 2010)
@@ -7,7 +7,7 @@
<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">
-<link rel="next" href="upgrade/upgrade_from_1_42.html" title="Upgrade from version 1.42">
+<link rel="next" href="upgrade/upgrade_from_1_45.html" title="Upgrade from version 1.45">
</head>
<body bgcolor="white" text="black" link="#0000FF" vlink="#840084" alink="#0000FF">
<table cellpadding="2" width="100%"><tr>
@@ -20,16 +20,18 @@
</tr></table>
<hr>
<div class="spirit-nav">
-<a accesskey="p" href="mfc_atl/references.html"><img src="../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../index.html"><img src="../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../index.html"><img src="../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="upgrade/upgrade_from_1_42.html"><img src="../../../../../doc/src/images/next.png" alt="Next"></a>
+<a accesskey="p" href="mfc_atl/references.html"><img src="../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../index.html"><img src="../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../index.html"><img src="../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="upgrade/upgrade_from_1_45.html"><img src="../../../../../doc/src/images/next.png" alt="Next"></a>
</div>
<div class="section">
<div class="titlepage"><div><div><h2 class="title" style="clear: both">
-<a name="range.upgrade"></a><a class="link" href="upgrade.html" title="Upgrade version of Boost.Range"> Upgrade version of Boost.Range</a>
+<a name="range.upgrade"></a><a class="link" href="upgrade.html" title="Upgrade version of Boost.Range">Upgrade version of Boost.Range</a>
</h2></div></div></div>
<div class="toc"><dl>
-<dt><span class="section"><a href="upgrade/upgrade_from_1_42.html"> Upgrade from version
+<dt><span class="section"><a href="upgrade/upgrade_from_1_45.html">Upgrade from version
+ 1.45</a></span></dt>
+<dt><span class="section"><a href="upgrade/upgrade_from_1_42.html">Upgrade from version
1.42</a></span></dt>
-<dt><span class="section"><a href="upgrade/upgrade_from_1_34.html"> Upgrade from version
+<dt><span class="section"><a href="upgrade/upgrade_from_1_34.html">Upgrade from version
1.34</a></span></dt>
</dl></div>
</div>
@@ -43,7 +45,7 @@
</tr></table>
<hr>
<div class="spirit-nav">
-<a accesskey="p" href="mfc_atl/references.html"><img src="../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../index.html"><img src="../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../index.html"><img src="../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="upgrade/upgrade_from_1_42.html"><img src="../../../../../doc/src/images/next.png" alt="Next"></a>
+<a accesskey="p" href="mfc_atl/references.html"><img src="../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../index.html"><img src="../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../index.html"><img src="../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="upgrade/upgrade_from_1_45.html"><img src="../../../../../doc/src/images/next.png" alt="Next"></a>
</div>
</body>
</html>
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-12-26 10:13:43 EST (Sun, 26 Dec 2010)
@@ -24,7 +24,7 @@
</div>
<div class="section">
<div class="titlepage"><div><div><h3 class="title">
-<a name="range.upgrade.upgrade_from_1_34"></a><a class="link" href="upgrade_from_1_34.html" title="Upgrade from version 1.34"> Upgrade from version
+<a name="range.upgrade.upgrade_from_1_34"></a><a class="link" href="upgrade_from_1_34.html" title="Upgrade from version 1.34">Upgrade from version
1.34</a>
</h3></div></div></div>
<p>
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-12-26 10:13:43 EST (Sun, 26 Dec 2010)
@@ -6,7 +6,7 @@
<meta name="generator" content="DocBook XSL Stylesheets V1.75.2">
<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">
+<link rel="prev" href="upgrade_from_1_45.html" title="Upgrade from version 1.45">
<link rel="next" href="upgrade_from_1_34.html" title="Upgrade from version 1.34">
</head>
<body bgcolor="white" text="black" link="#0000FF" vlink="#840084" alink="#0000FF">
@@ -20,11 +20,11 @@
</tr></table>
<hr>
<div class="spirit-nav">
-<a accesskey="p" href="../upgrade.html"><img src="../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../upgrade.html"><img src="../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="upgrade_from_1_34.html"><img src="../../../../../../doc/src/images/next.png" alt="Next"></a>
+<a accesskey="p" href="upgrade_from_1_45.html"><img src="../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../upgrade.html"><img src="../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="upgrade_from_1_34.html"><img src="../../../../../../doc/src/images/next.png" alt="Next"></a>
</div>
<div class="section">
<div class="titlepage"><div><div><h3 class="title">
-<a name="range.upgrade.upgrade_from_1_42"></a><a class="link" href="upgrade_from_1_42.html" title="Upgrade from version 1.42"> Upgrade from version
+<a name="range.upgrade.upgrade_from_1_42"></a><a class="link" href="upgrade_from_1_42.html" title="Upgrade from version 1.42">Upgrade from version
1.42</a>
</h3></div></div></div>
<p>
@@ -35,7 +35,7 @@
<a class="link" href="../reference/adaptors.html" title="Range Adaptors">Range adaptors</a>
</li>
<li class="listitem">
- <a class="link" href="../reference/algorithms.html" title="Range Algorithm">Range algorithms</a>
+ <a class="link" href="../reference/algorithms.html" title="Range Algorithms">Range algorithms</a>
</li>
</ol></div>
<p>
@@ -62,7 +62,7 @@
</tr></table>
<hr>
<div class="spirit-nav">
-<a accesskey="p" href="../upgrade.html"><img src="../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../upgrade.html"><img src="../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="upgrade_from_1_34.html"><img src="../../../../../../doc/src/images/next.png" alt="Next"></a>
+<a accesskey="p" href="upgrade_from_1_45.html"><img src="../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../upgrade.html"><img src="../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="upgrade_from_1_34.html"><img src="../../../../../../doc/src/images/next.png" alt="Next"></a>
</div>
</body>
</html>
Modified: branches/release/libs/range/doc/introduction.qbk
==============================================================================
--- branches/release/libs/range/doc/introduction.qbk (original)
+++ branches/release/libs/range/doc/introduction.qbk 2010-12-26 10:13:43 EST (Sun, 26 Dec 2010)
@@ -1,4 +1,9 @@
-[section Introduction]
+[/
+ Copyright 2010 Neil Groves
+ 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)
+/]
+[section:introduction Introduction]
Generic algorithms have so far been specified in terms of two or more iterators. Two iterators would together form a range of values that the algorithm could work on. This leads to a very general interface, but also to a somewhat clumsy use of the algorithms with redundant specification of container names. Therefore we would like to raise the abstraction level for algorithms so they specify their interface in terms of __ranges__ as much as possible.
Modified: branches/release/libs/range/doc/mfc_atl.qbk
==============================================================================
--- branches/release/libs/range/doc/mfc_atl.qbk (original)
+++ branches/release/libs/range/doc/mfc_atl.qbk 2010-12-26 10:13:43 EST (Sun, 26 Dec 2010)
@@ -1,3 +1,8 @@
+[/
+ Copyright 2010 Neil Groves
+ 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)
+/]
[def __mfc_collections__ [@http://msdn.microsoft.com/en-us/library/942860sh.aspx MFC Collection Classes]]
[def __atl_collections__ [@http://msdn.microsoft.com/en-us/library/15e672bd.aspx ATL Collection Classes]]
Modified: branches/release/libs/range/doc/portability.qbk
==============================================================================
--- branches/release/libs/range/doc/portability.qbk (original)
+++ branches/release/libs/range/doc/portability.qbk 2010-12-26 10:13:43 EST (Sun, 26 Dec 2010)
@@ -1,4 +1,9 @@
-[section Portability]
+[/
+ Copyright 2010 Neil Groves
+ 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)
+/]
+[section:portability Portability]
A huge effort has been made to port the library to as many compilers as possible.
Modified: branches/release/libs/range/doc/reference.qbk
==============================================================================
--- branches/release/libs/range/doc/reference.qbk (original)
+++ branches/release/libs/range/doc/reference.qbk 2010-12-26 10:13:43 EST (Sun, 26 Dec 2010)
@@ -1,3 +1,8 @@
+[/
+ Copyright 2010 Neil Groves
+ 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)
+/]
[section:reference Reference]
[include reference/overview.qbk]
Modified: branches/release/libs/range/doc/reference/adaptors.qbk
==============================================================================
--- branches/release/libs/range/doc/reference/adaptors.qbk (original)
+++ branches/release/libs/range/doc/reference/adaptors.qbk 2010-12-26 10:13:43 EST (Sun, 26 Dec 2010)
@@ -1,3 +1,8 @@
+[/
+ Copyright 2010 Neil Groves
+ 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)
+/]
[section:adaptors Range Adaptors]
[section:introduction Introduction and motivation]
Modified: branches/release/libs/range/doc/reference/adaptors/adjacent_filtered.qbk
==============================================================================
--- branches/release/libs/range/doc/reference/adaptors/adjacent_filtered.qbk (original)
+++ branches/release/libs/range/doc/reference/adaptors/adjacent_filtered.qbk 2010-12-26 10:13:43 EST (Sun, 26 Dec 2010)
@@ -1,3 +1,8 @@
+[/
+ Copyright 2010 Neil Groves
+ 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)
+/]
[section:adjacent_filtered adjacent_filtered]
[table
@@ -10,6 +15,7 @@
* [*Postcondition:] For all adjacent elements `[x,y]` in the returned range, `bi_pred(x,y)` is `true`.
* [*Throws:] Whatever the copy constructor of `bi_pred` might throw.
* [*Range Category:] __single_pass_range__
+* [*Return Type:] `boost::adjacent_filtered_range<typeof(rng)>`
* [*Returned Range Category:] The minimum of the range category of `rng` and __forward_range__
[section:adjacent_filtered_example adjacent_filtered example]
Modified: branches/release/libs/range/doc/reference/adaptors/copied.qbk
==============================================================================
--- branches/release/libs/range/doc/reference/adaptors/copied.qbk (original)
+++ branches/release/libs/range/doc/reference/adaptors/copied.qbk 2010-12-26 10:13:43 EST (Sun, 26 Dec 2010)
@@ -1,3 +1,8 @@
+[/
+ Copyright 2010 Neil Groves
+ 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)
+/]
[section:copied copied]
[table
Modified: branches/release/libs/range/doc/reference/adaptors/examples/adjacent_filtered.cpp
==============================================================================
--- branches/release/libs/range/doc/reference/adaptors/examples/adjacent_filtered.cpp (original)
+++ branches/release/libs/range/doc/reference/adaptors/examples/adjacent_filtered.cpp 2010-12-26 10:13:43 EST (Sun, 26 Dec 2010)
@@ -1,3 +1,12 @@
+// Boost.Range library
+//
+// Copyright Thorsten Ottosen 2003-2004. Use, modification and
+// distribution is subject to 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)
+//
+// For more information, see http://www.boost.org/libs/range/
+//
#include <boost/range/adaptor/adjacent_filtered.hpp>
#include <boost/range/algorithm/copy.hpp>
#include <boost/assign.hpp>
Modified: branches/release/libs/range/doc/reference/adaptors/examples/copied.cpp
==============================================================================
--- branches/release/libs/range/doc/reference/adaptors/examples/copied.cpp (original)
+++ branches/release/libs/range/doc/reference/adaptors/examples/copied.cpp 2010-12-26 10:13:43 EST (Sun, 26 Dec 2010)
@@ -1,3 +1,12 @@
+// Boost.Range library
+//
+// Copyright Thorsten Ottosen 2003-2004. Use, modification and
+// distribution is subject to 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)
+//
+// For more information, see http://www.boost.org/libs/range/
+//
#include <boost/range/adaptor/copied.hpp>
#include <boost/range/algorithm/copy.hpp>
#include <boost/assign.hpp>
Modified: branches/release/libs/range/doc/reference/adaptors/examples/filtered.cpp
==============================================================================
--- branches/release/libs/range/doc/reference/adaptors/examples/filtered.cpp (original)
+++ branches/release/libs/range/doc/reference/adaptors/examples/filtered.cpp 2010-12-26 10:13:43 EST (Sun, 26 Dec 2010)
@@ -1,3 +1,12 @@
+// Boost.Range library
+//
+// Copyright Thorsten Ottosen 2003-2004. Use, modification and
+// distribution is subject to 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)
+//
+// For more information, see http://www.boost.org/libs/range/
+//
#include <boost/range/adaptor/filtered.hpp>
#include <boost/range/algorithm/copy.hpp>
#include <boost/assign.hpp>
Modified: branches/release/libs/range/doc/reference/adaptors/examples/indexed.cpp
==============================================================================
--- branches/release/libs/range/doc/reference/adaptors/examples/indexed.cpp (original)
+++ branches/release/libs/range/doc/reference/adaptors/examples/indexed.cpp 2010-12-26 10:13:43 EST (Sun, 26 Dec 2010)
@@ -1,3 +1,12 @@
+// Boost.Range library
+//
+// Copyright Thorsten Ottosen 2003-2004. Use, modification and
+// distribution is subject to 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)
+//
+// For more information, see http://www.boost.org/libs/range/
+//
#include <boost/range/adaptor/indexed.hpp>
#include <boost/range/algorithm/copy.hpp>
#include <boost/assign.hpp>
Modified: branches/release/libs/range/doc/reference/adaptors/examples/indirected.cpp
==============================================================================
--- branches/release/libs/range/doc/reference/adaptors/examples/indirected.cpp (original)
+++ branches/release/libs/range/doc/reference/adaptors/examples/indirected.cpp 2010-12-26 10:13:43 EST (Sun, 26 Dec 2010)
@@ -1,3 +1,12 @@
+// Boost.Range library
+//
+// Copyright Thorsten Ottosen 2003-2004. Use, modification and
+// distribution is subject to 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)
+//
+// For more information, see http://www.boost.org/libs/range/
+//
#include <boost/range/adaptor/indirected.hpp>
#include <boost/range/algorithm/copy.hpp>
#include <boost/shared_ptr.hpp>
Modified: branches/release/libs/range/doc/reference/adaptors/examples/map_keys.cpp
==============================================================================
--- branches/release/libs/range/doc/reference/adaptors/examples/map_keys.cpp (original)
+++ branches/release/libs/range/doc/reference/adaptors/examples/map_keys.cpp 2010-12-26 10:13:43 EST (Sun, 26 Dec 2010)
@@ -1,3 +1,12 @@
+// Boost.Range library
+//
+// Copyright Thorsten Ottosen 2003-2004. Use, modification and
+// distribution is subject to 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)
+//
+// For more information, see http://www.boost.org/libs/range/
+//
#include <boost/range/adaptor/map.hpp>
#include <boost/range/algorithm/copy.hpp>
#include <boost/assign.hpp>
Modified: branches/release/libs/range/doc/reference/adaptors/examples/map_values.cpp
==============================================================================
--- branches/release/libs/range/doc/reference/adaptors/examples/map_values.cpp (original)
+++ branches/release/libs/range/doc/reference/adaptors/examples/map_values.cpp 2010-12-26 10:13:43 EST (Sun, 26 Dec 2010)
@@ -1,3 +1,12 @@
+// Boost.Range library
+//
+// Copyright Thorsten Ottosen 2003-2004. Use, modification and
+// distribution is subject to 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)
+//
+// For more information, see http://www.boost.org/libs/range/
+//
#include <boost/range/adaptor/map.hpp>
#include <boost/range/algorithm/copy.hpp>
#include <boost/assign.hpp>
Modified: branches/release/libs/range/doc/reference/adaptors/examples/replaced.cpp
==============================================================================
--- branches/release/libs/range/doc/reference/adaptors/examples/replaced.cpp (original)
+++ branches/release/libs/range/doc/reference/adaptors/examples/replaced.cpp 2010-12-26 10:13:43 EST (Sun, 26 Dec 2010)
@@ -1,3 +1,12 @@
+// Boost.Range library
+//
+// Copyright Thorsten Ottosen 2003-2004. Use, modification and
+// distribution is subject to 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)
+//
+// For more information, see http://www.boost.org/libs/range/
+//
#include <boost/range/adaptor/replaced.hpp>
#include <boost/range/algorithm/copy.hpp>
#include <boost/assign.hpp>
Modified: branches/release/libs/range/doc/reference/adaptors/examples/replaced_if.cpp
==============================================================================
--- branches/release/libs/range/doc/reference/adaptors/examples/replaced_if.cpp (original)
+++ branches/release/libs/range/doc/reference/adaptors/examples/replaced_if.cpp 2010-12-26 10:13:43 EST (Sun, 26 Dec 2010)
@@ -1,3 +1,12 @@
+// Boost.Range library
+//
+// Copyright Thorsten Ottosen 2003-2004. Use, modification and
+// distribution is subject to 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)
+//
+// For more information, see http://www.boost.org/libs/range/
+//
#include <boost/range/adaptor/replaced_if.hpp>
#include <boost/range/algorithm/copy.hpp>
#include <boost/assign.hpp>
Modified: branches/release/libs/range/doc/reference/adaptors/examples/reversed.cpp
==============================================================================
--- branches/release/libs/range/doc/reference/adaptors/examples/reversed.cpp (original)
+++ branches/release/libs/range/doc/reference/adaptors/examples/reversed.cpp 2010-12-26 10:13:43 EST (Sun, 26 Dec 2010)
@@ -1,3 +1,12 @@
+// Boost.Range library
+//
+// Copyright Thorsten Ottosen 2003-2004. Use, modification and
+// distribution is subject to 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)
+//
+// For more information, see http://www.boost.org/libs/range/
+//
#include <boost/range/adaptor/reversed.hpp>
#include <boost/range/algorithm/copy.hpp>
#include <boost/assign.hpp>
Modified: branches/release/libs/range/doc/reference/adaptors/examples/sliced.cpp
==============================================================================
--- branches/release/libs/range/doc/reference/adaptors/examples/sliced.cpp (original)
+++ branches/release/libs/range/doc/reference/adaptors/examples/sliced.cpp 2010-12-26 10:13:43 EST (Sun, 26 Dec 2010)
@@ -1,3 +1,12 @@
+// Boost.Range library
+//
+// Copyright Thorsten Ottosen 2003-2004. Use, modification and
+// distribution is subject to 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)
+//
+// For more information, see http://www.boost.org/libs/range/
+//
#include <boost/range/adaptor/sliced.hpp>
#include <boost/range/algorithm/copy.hpp>
#include <boost/assign.hpp>
Modified: branches/release/libs/range/doc/reference/adaptors/examples/strided.cpp
==============================================================================
--- branches/release/libs/range/doc/reference/adaptors/examples/strided.cpp (original)
+++ branches/release/libs/range/doc/reference/adaptors/examples/strided.cpp 2010-12-26 10:13:43 EST (Sun, 26 Dec 2010)
@@ -1,3 +1,12 @@
+// Boost.Range library
+//
+// Copyright Thorsten Ottosen 2003-2004. Use, modification and
+// distribution is subject to 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)
+//
+// For more information, see http://www.boost.org/libs/range/
+//
#include <boost/range/adaptor/strided.hpp>
#include <boost/range/algorithm/copy.hpp>
#include <boost/assign.hpp>
Modified: branches/release/libs/range/doc/reference/adaptors/examples/tokenized.cpp
==============================================================================
--- branches/release/libs/range/doc/reference/adaptors/examples/tokenized.cpp (original)
+++ branches/release/libs/range/doc/reference/adaptors/examples/tokenized.cpp 2010-12-26 10:13:43 EST (Sun, 26 Dec 2010)
@@ -1,3 +1,12 @@
+// Boost.Range library
+//
+// Copyright Thorsten Ottosen 2003-2004. Use, modification and
+// distribution is subject to 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)
+//
+// For more information, see http://www.boost.org/libs/range/
+//
#include <boost/range/adaptor/tokenized.hpp>
#include <boost/range/algorithm_ext/push_back.hpp>
#include <boost/assert.hpp>
Modified: branches/release/libs/range/doc/reference/adaptors/examples/transformed.cpp
==============================================================================
--- branches/release/libs/range/doc/reference/adaptors/examples/transformed.cpp (original)
+++ branches/release/libs/range/doc/reference/adaptors/examples/transformed.cpp 2010-12-26 10:13:43 EST (Sun, 26 Dec 2010)
@@ -1,3 +1,12 @@
+// Boost.Range library
+//
+// Copyright Thorsten Ottosen 2003-2004. Use, modification and
+// distribution is subject to 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)
+//
+// For more information, see http://www.boost.org/libs/range/
+//
#include <boost/range/adaptor/transformed.hpp>
#include <boost/range/algorithm/copy.hpp>
#include <boost/range/assign.hpp>
Modified: branches/release/libs/range/doc/reference/adaptors/examples/uniqued.cpp
==============================================================================
--- branches/release/libs/range/doc/reference/adaptors/examples/uniqued.cpp (original)
+++ branches/release/libs/range/doc/reference/adaptors/examples/uniqued.cpp 2010-12-26 10:13:43 EST (Sun, 26 Dec 2010)
@@ -1,3 +1,12 @@
+// Boost.Range library
+//
+// Copyright Thorsten Ottosen 2003-2004. Use, modification and
+// distribution is subject to 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)
+//
+// For more information, see http://www.boost.org/libs/range/
+//
#include <boost/range/adaptor/uniqued.hpp>
#include <boost/range/algorithm/copy.hpp>
#include <boost/assign.hpp>
Modified: branches/release/libs/range/doc/reference/adaptors/filtered.qbk
==============================================================================
--- branches/release/libs/range/doc/reference/adaptors/filtered.qbk (original)
+++ branches/release/libs/range/doc/reference/adaptors/filtered.qbk 2010-12-26 10:13:43 EST (Sun, 26 Dec 2010)
@@ -1,3 +1,8 @@
+[/
+ Copyright 2010 Neil Groves
+ 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)
+/]
[section:filtered filtered]
[table
@@ -10,6 +15,7 @@
* [*Postcondition:] For all adjacent elements `[x]` in the returned range, `pred(x)` is `true`.
* [*Throws:] Whatever the copy constructor of `pred` might throw.
* [*Range Category:] __forward_range__
+* [*Range Return Type:] `boost::filtered_range<typeof(rng)>`
* [*Returned Range Category:] The minimum of the range category of `rng` and __bidirectional_range__
[section:filtered_example filtered example]
Modified: branches/release/libs/range/doc/reference/adaptors/indexed.qbk
==============================================================================
--- branches/release/libs/range/doc/reference/adaptors/indexed.qbk (original)
+++ branches/release/libs/range/doc/reference/adaptors/indexed.qbk 2010-12-26 10:13:43 EST (Sun, 26 Dec 2010)
@@ -1,3 +1,8 @@
+[/
+ Copyright 2010 Neil Groves
+ 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)
+/]
[section:indexed indexed]
[table
@@ -8,6 +13,7 @@
* [*Returns:] A range adapted to return both the element and the associated index. The returned range consists of iterators that have in addition to the usual iterator member functions an `index()` member function that returns the appropriate index for the element in the sequence corresponding with the iterator.
* [*Range Category:] __single_pass_range__
+* [*Range Return Type:] `boost::indexed_range<typeof(rng)>`
* [*Returned Range Category:] The range category of `rng`
[section:indexed_example indexed example]
Modified: branches/release/libs/range/doc/reference/adaptors/indirected.qbk
==============================================================================
--- branches/release/libs/range/doc/reference/adaptors/indirected.qbk (original)
+++ branches/release/libs/range/doc/reference/adaptors/indirected.qbk 2010-12-26 10:13:43 EST (Sun, 26 Dec 2010)
@@ -1,3 +1,8 @@
+[/
+ Copyright 2010 Neil Groves
+ 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)
+/]
[section:indirected indirected]
[table
@@ -9,6 +14,7 @@
* [*Precondition:] The `value_type` of the range defines unary `operator*()`
* [*Postcondition:] For all elements `x` in the returned range, `x` is the result of `*y` where `y` is the corresponding element in the original range.
* [*Range Category:] __single_pass_range__
+* [*Range Return Type:] `boost::indirected_range<typeof(rng)>`
* [*Returned Range Category:] The range category of `rng`
[section:indirected_example indirected example]
Modified: branches/release/libs/range/doc/reference/adaptors/map_keys.qbk
==============================================================================
--- branches/release/libs/range/doc/reference/adaptors/map_keys.qbk (original)
+++ branches/release/libs/range/doc/reference/adaptors/map_keys.qbk 2010-12-26 10:13:43 EST (Sun, 26 Dec 2010)
@@ -1,3 +1,8 @@
+[/
+ Copyright 2010 Neil Groves
+ 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)
+/]
[section:map_keys map_keys]
[table
@@ -9,6 +14,7 @@
* [*Precondition:] The `value_type` of the range is an instantiation of `std::pair`.
* [*Postcondition:] For all elements `x` in the returned range, `x` is the result of `y.first` where `y` is the corresponding element in the original range.
* [*Range Category:] __single_pass_range__
+* [*Range Return Type:] `boost::select_first_range<typeof(rng)>`
* [*Returned Range Category:] The range category of `rng`.
[section:map_keys_example map_keys example]
Modified: branches/release/libs/range/doc/reference/adaptors/map_values.qbk
==============================================================================
--- branches/release/libs/range/doc/reference/adaptors/map_values.qbk (original)
+++ branches/release/libs/range/doc/reference/adaptors/map_values.qbk 2010-12-26 10:13:43 EST (Sun, 26 Dec 2010)
@@ -1,3 +1,8 @@
+[/
+ Copyright 2010 Neil Groves
+ 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)
+/]
[section:map_values map_values]
[table
@@ -9,6 +14,7 @@
* [*Precondition:] The `value_type` of the range is an instantiation of `std::pair`.
* [*Postcondition:] For all elements `x` in the returned range, `x` is the result of `y.second` where `y` is the corresponding element in the original range.
* [*Range Category:] __single_pass_range__
+* [*Range Return Type:] for constant ranges, `boost::select_second_const<typeof(rng)>` otherwise `boost:select_second_mutable<typeof(rng)>`
* [*Returned Range Category:] The range category of `rng`.
[section:map_values_example map_values example]
Modified: branches/release/libs/range/doc/reference/adaptors/replaced.qbk
==============================================================================
--- branches/release/libs/range/doc/reference/adaptors/replaced.qbk (original)
+++ branches/release/libs/range/doc/reference/adaptors/replaced.qbk 2010-12-26 10:13:43 EST (Sun, 26 Dec 2010)
@@ -1,3 +1,8 @@
+[/
+ Copyright 2010 Neil Groves
+ 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)
+/]
[section:replaced replaced]
[table
@@ -11,6 +16,7 @@
* `old_value` is convertible to the `value_type` of the range.
* [*Postcondition:] For all elements `x` in the returned range, the value `x` is equal to the value of `(y == old_value) ? new_value : y` where `y` is the corresponding element in the original range.
* [*Range Category:] __forward_range__
+* [*Range Return Type:] `boost::replaced_range<typeof(rng)>`
* [*Returned Range Category:] The range category of `rng`.
[section:replaced_example replaced example]
Modified: branches/release/libs/range/doc/reference/adaptors/replaced_if.qbk
==============================================================================
--- branches/release/libs/range/doc/reference/adaptors/replaced_if.qbk (original)
+++ branches/release/libs/range/doc/reference/adaptors/replaced_if.qbk 2010-12-26 10:13:43 EST (Sun, 26 Dec 2010)
@@ -1,3 +1,8 @@
+[/
+ Copyright 2010 Neil Groves
+ 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)
+/]
[section:replaced_if replaced_if]
[table
@@ -11,6 +16,7 @@
* `new_value` is convertible to the `value_type` of the range.
* [*Postconditions:] For all elements `x` in the returned range, the value `x` is equal to the value of `pred(y) ? new_value : y` where `y` is the corresponding element in the original range.
* [*Range Category:] __forward_range__
+* [*Range Return Type:] `boost::replaced_if_range<typeof(rng)>`
* [*Returned Range Category:] The range category of `rng`.
[section:replaced_if_example replaced_if example]
Modified: branches/release/libs/range/doc/reference/adaptors/reversed.qbk
==============================================================================
--- branches/release/libs/range/doc/reference/adaptors/reversed.qbk (original)
+++ branches/release/libs/range/doc/reference/adaptors/reversed.qbk 2010-12-26 10:13:43 EST (Sun, 26 Dec 2010)
@@ -1,3 +1,8 @@
+[/
+ Copyright 2010 Neil Groves
+ 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)
+/]
[section:reversed reversed]
[table
@@ -8,6 +13,7 @@
* [*Returns:] A range whose iterators behave as if they were the original iterators wrapped in `reverse_iterator`.
* [*Range Category:] __bidirectional_range__
+* [*Range Return Type:] `boost::reversed_range<typeof(rng)>`
* [*Returned Range Category:] The range category of `rng`.
[section:reversed_example reversed example]
Modified: branches/release/libs/range/doc/reference/adaptors/sliced.qbk
==============================================================================
--- branches/release/libs/range/doc/reference/adaptors/sliced.qbk (original)
+++ branches/release/libs/range/doc/reference/adaptors/sliced.qbk 2010-12-26 10:13:43 EST (Sun, 26 Dec 2010)
@@ -1,3 +1,8 @@
+[/
+ Copyright 2010 Neil Groves
+ 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)
+/]
[section:sliced sliced]
[table
@@ -9,6 +14,7 @@
* [*Precondition:] `0 <= n && n <= m && m < distance(rng)`
* [*Returns:] `make_range(rng, n, m)`
* [*Range Category:] __random_access_range__
+* [*Range Return Type:] `boost::sliced_range<typeof(rng)>`
* [*Returned Range Category:] __random_access_range__
[section:sliced_example sliced example]
Modified: branches/release/libs/range/doc/reference/adaptors/strided.qbk
==============================================================================
--- branches/release/libs/range/doc/reference/adaptors/strided.qbk (original)
+++ branches/release/libs/range/doc/reference/adaptors/strided.qbk 2010-12-26 10:13:43 EST (Sun, 26 Dec 2010)
@@ -1,3 +1,8 @@
+[/
+ Copyright 2010 Neil Groves
+ 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)
+/]
[section:strided strided]
[table
@@ -6,10 +11,10 @@
[[Function] [`boost::adaptors::stride(rng, n)`]]
]
-* [*Precondition:] `0 <= n && n < distance(rng)`
+* [*Precondition:] `0 <= n` and `boost::size(rng)` is a valid expression.
* [*Returns:] A new range based on `rng` where traversal is performed in steps of `n`.
-* [*Range Category:] __random_access_range__
-* [*Returned Range Category:] __random_access_range__
+* [*Range Category:] __single_pass_range__
+* [*Returned Range Category:] The range category of `rng`.
[section:strided_example strided example]
``
Modified: branches/release/libs/range/doc/reference/adaptors/tokenized.qbk
==============================================================================
--- branches/release/libs/range/doc/reference/adaptors/tokenized.qbk (original)
+++ branches/release/libs/range/doc/reference/adaptors/tokenized.qbk 2010-12-26 10:13:43 EST (Sun, 26 Dec 2010)
@@ -1,3 +1,8 @@
+[/
+ Copyright 2010 Neil Groves
+ 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)
+/]
[section:tokenized tokenized]
[table
@@ -36,6 +41,7 @@
* [*Returns:] A range whose iterators behave as if they were the original iterators wrapped in `regex_token_iterator`. The first iterator in the range would be constructed by forwarding all the arguments of `tokenized()` to the `regex_token_iterator` constructor.
* [*Throws:] Whatever constructing and copying equivalent `regex_token_iterator`s might throw.
* [*Range Category:] __random_access_range__
+* [*Range Return Type:] `boost::tokenized_range<typeof(rng)>`
* [*Returned Range Category:] __random_access_range__
[endsect]
Modified: branches/release/libs/range/doc/reference/adaptors/transformed.qbk
==============================================================================
--- branches/release/libs/range/doc/reference/adaptors/transformed.qbk (original)
+++ branches/release/libs/range/doc/reference/adaptors/transformed.qbk 2010-12-26 10:13:43 EST (Sun, 26 Dec 2010)
@@ -1,3 +1,8 @@
+[/
+ Copyright 2010 Neil Groves
+ 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)
+/]
[section:transformed transformed]
[table
@@ -10,6 +15,7 @@
* [*Postcondition:] For all elements `x` in the returned range, `x` is the result of `fun(y)` where `y` is the corresponding element in the original range.
* [*Throws:] Whatever the copy-constructor of `fun` might throw.
* [*Range Category:] __single_pass_range__
+* [*Range Return Type:] `boost::transformed_range<typeof(rng)>`
* [*Returned Range Category:] The range category of `rng`.
[section:transformed_example transformed example]
Modified: branches/release/libs/range/doc/reference/adaptors/uniqued.qbk
==============================================================================
--- branches/release/libs/range/doc/reference/adaptors/uniqued.qbk (original)
+++ branches/release/libs/range/doc/reference/adaptors/uniqued.qbk 2010-12-26 10:13:43 EST (Sun, 26 Dec 2010)
@@ -1,3 +1,8 @@
+[/
+ Copyright 2010 Neil Groves
+ 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)
+/]
[section:uniqued uniqued]
[table
@@ -9,6 +14,7 @@
* [*Precondition:] The `value_type` of the range is comparable with `operator==()`.
* [*Postcondition:] For all adjacent elements `[x,y]` in the returned range, `x==y` is false.
* [*Range Category:] __forward_range__
+* [*Range Return Type:] `boost::uniqued_range<typeof(rng)>`
* [*Returned Range Category:] The minimum of the range concept of `rng` and __forward_range__.
[section:uniqued_example uniqued example]
Modified: branches/release/libs/range/doc/reference/algorithm/adjacent_find.qbk
==============================================================================
--- branches/release/libs/range/doc/reference/algorithm/adjacent_find.qbk (original)
+++ branches/release/libs/range/doc/reference/algorithm/adjacent_find.qbk 2010-12-26 10:13:43 EST (Sun, 26 Dec 2010)
@@ -1,3 +1,8 @@
+[/
+ Copyright 2010 Neil Groves
+ 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)
+/]
[section:adjacent_find adjacent_find]
[heading Prototype]
Modified: branches/release/libs/range/doc/reference/algorithm/binary_search.qbk
==============================================================================
--- branches/release/libs/range/doc/reference/algorithm/binary_search.qbk (original)
+++ branches/release/libs/range/doc/reference/algorithm/binary_search.qbk 2010-12-26 10:13:43 EST (Sun, 26 Dec 2010)
@@ -1,3 +1,8 @@
+[/
+ Copyright 2010 Neil Groves
+ 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)
+/]
[section:binary_search binary_search]
[heading Prototype]
Modified: branches/release/libs/range/doc/reference/algorithm/copy.qbk
==============================================================================
--- branches/release/libs/range/doc/reference/algorithm/copy.qbk (original)
+++ branches/release/libs/range/doc/reference/algorithm/copy.qbk 2010-12-26 10:13:43 EST (Sun, 26 Dec 2010)
@@ -1,3 +1,8 @@
+[/
+ Copyright 2010 Neil Groves
+ 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)
+/]
[section:copy copy]
[heading Prototype]
Modified: branches/release/libs/range/doc/reference/algorithm/copy_backward.qbk
==============================================================================
--- branches/release/libs/range/doc/reference/algorithm/copy_backward.qbk (original)
+++ branches/release/libs/range/doc/reference/algorithm/copy_backward.qbk 2010-12-26 10:13:43 EST (Sun, 26 Dec 2010)
@@ -1,3 +1,8 @@
+[/
+ Copyright 2010 Neil Groves
+ 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)
+/]
[section:copy_backward copy_backward]
[heading Prototype]
Modified: branches/release/libs/range/doc/reference/algorithm/count.qbk
==============================================================================
--- branches/release/libs/range/doc/reference/algorithm/count.qbk (original)
+++ branches/release/libs/range/doc/reference/algorithm/count.qbk 2010-12-26 10:13:43 EST (Sun, 26 Dec 2010)
@@ -1,3 +1,8 @@
+[/
+ Copyright 2010 Neil Groves
+ 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)
+/]
[section:count count]
[heading Prototype]
Modified: branches/release/libs/range/doc/reference/algorithm/count_if.qbk
==============================================================================
--- branches/release/libs/range/doc/reference/algorithm/count_if.qbk (original)
+++ branches/release/libs/range/doc/reference/algorithm/count_if.qbk 2010-12-26 10:13:43 EST (Sun, 26 Dec 2010)
@@ -1,3 +1,8 @@
+[/
+ Copyright 2010 Neil Groves
+ 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)
+/]
[section:count_if count_if]
[heading Prototype]
Modified: branches/release/libs/range/doc/reference/algorithm/equal.qbk
==============================================================================
--- branches/release/libs/range/doc/reference/algorithm/equal.qbk (original)
+++ branches/release/libs/range/doc/reference/algorithm/equal.qbk 2010-12-26 10:13:43 EST (Sun, 26 Dec 2010)
@@ -1,3 +1,8 @@
+[/
+ Copyright 2010 Neil Groves
+ 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)
+/]
[section:equal equal]
[heading Prototype]
Modified: branches/release/libs/range/doc/reference/algorithm/equal_range.qbk
==============================================================================
--- branches/release/libs/range/doc/reference/algorithm/equal_range.qbk (original)
+++ branches/release/libs/range/doc/reference/algorithm/equal_range.qbk 2010-12-26 10:13:43 EST (Sun, 26 Dec 2010)
@@ -1,3 +1,8 @@
+[/
+ Copyright 2010 Neil Groves
+ 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)
+/]
[section:equal_range equal_range]
[heading Prototype]
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-12-26 10:13:43 EST (Sun, 26 Dec 2010)
@@ -1,3 +1,8 @@
+[/
+ Copyright 2010 Neil Groves
+ 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)
+/]
[section:fill fill]
[heading Prototype]
Modified: branches/release/libs/range/doc/reference/algorithm/fill_n.qbk
==============================================================================
--- branches/release/libs/range/doc/reference/algorithm/fill_n.qbk (original)
+++ branches/release/libs/range/doc/reference/algorithm/fill_n.qbk 2010-12-26 10:13:43 EST (Sun, 26 Dec 2010)
@@ -1,3 +1,8 @@
+[/
+ Copyright 2010 Neil Groves
+ 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)
+/]
[section:fill_n fill_n]
[heading Prototype]
Modified: branches/release/libs/range/doc/reference/algorithm/find.qbk
==============================================================================
--- branches/release/libs/range/doc/reference/algorithm/find.qbk (original)
+++ branches/release/libs/range/doc/reference/algorithm/find.qbk 2010-12-26 10:13:43 EST (Sun, 26 Dec 2010)
@@ -1,3 +1,8 @@
+[/
+ Copyright 2010 Neil Groves
+ 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)
+/]
[section:find find]
[heading Prototype]
Modified: branches/release/libs/range/doc/reference/algorithm/find_end.qbk
==============================================================================
--- branches/release/libs/range/doc/reference/algorithm/find_end.qbk (original)
+++ branches/release/libs/range/doc/reference/algorithm/find_end.qbk 2010-12-26 10:13:43 EST (Sun, 26 Dec 2010)
@@ -1,3 +1,8 @@
+[/
+ Copyright 2010 Neil Groves
+ 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)
+/]
[section:find_end find_end]
[heading Prototype]
Modified: branches/release/libs/range/doc/reference/algorithm/find_first_of.qbk
==============================================================================
--- branches/release/libs/range/doc/reference/algorithm/find_first_of.qbk (original)
+++ branches/release/libs/range/doc/reference/algorithm/find_first_of.qbk 2010-12-26 10:13:43 EST (Sun, 26 Dec 2010)
@@ -1,3 +1,8 @@
+[/
+ Copyright 2010 Neil Groves
+ 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)
+/]
[section:find_first_of find_first_of]
[heading Prototype]
Modified: branches/release/libs/range/doc/reference/algorithm/find_if.qbk
==============================================================================
--- branches/release/libs/range/doc/reference/algorithm/find_if.qbk (original)
+++ branches/release/libs/range/doc/reference/algorithm/find_if.qbk 2010-12-26 10:13:43 EST (Sun, 26 Dec 2010)
@@ -1,3 +1,8 @@
+[/
+ Copyright 2010 Neil Groves
+ 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)
+/]
[section:find_if find_if]
[heading Prototype]
Modified: branches/release/libs/range/doc/reference/algorithm/for_each.qbk
==============================================================================
--- branches/release/libs/range/doc/reference/algorithm/for_each.qbk (original)
+++ branches/release/libs/range/doc/reference/algorithm/for_each.qbk 2010-12-26 10:13:43 EST (Sun, 26 Dec 2010)
@@ -1,3 +1,8 @@
+[/
+ Copyright 2010 Neil Groves
+ 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)
+/]
[section:for_each for_each]
[heading Prototype]
Modified: branches/release/libs/range/doc/reference/algorithm/generate.qbk
==============================================================================
--- branches/release/libs/range/doc/reference/algorithm/generate.qbk (original)
+++ branches/release/libs/range/doc/reference/algorithm/generate.qbk 2010-12-26 10:13:43 EST (Sun, 26 Dec 2010)
@@ -1,3 +1,8 @@
+[/
+ Copyright 2010 Neil Groves
+ 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)
+/]
[section:generate generate]
[heading Prototype]
Modified: branches/release/libs/range/doc/reference/algorithm/includes.qbk
==============================================================================
--- branches/release/libs/range/doc/reference/algorithm/includes.qbk (original)
+++ branches/release/libs/range/doc/reference/algorithm/includes.qbk 2010-12-26 10:13:43 EST (Sun, 26 Dec 2010)
@@ -1,3 +1,8 @@
+[/
+ Copyright 2010 Neil Groves
+ 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)
+/]
[section:includes includes]
[heading Prototype]
Modified: branches/release/libs/range/doc/reference/algorithm/inplace_merge.qbk
==============================================================================
--- branches/release/libs/range/doc/reference/algorithm/inplace_merge.qbk (original)
+++ branches/release/libs/range/doc/reference/algorithm/inplace_merge.qbk 2010-12-26 10:13:43 EST (Sun, 26 Dec 2010)
@@ -1,3 +1,8 @@
+[/
+ Copyright 2010 Neil Groves
+ 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)
+/]
[section:inplace_merge inplace_merge]
[heading Prototype]
Modified: branches/release/libs/range/doc/reference/algorithm/lexicographical_compare.qbk
==============================================================================
--- branches/release/libs/range/doc/reference/algorithm/lexicographical_compare.qbk (original)
+++ branches/release/libs/range/doc/reference/algorithm/lexicographical_compare.qbk 2010-12-26 10:13:43 EST (Sun, 26 Dec 2010)
@@ -1,3 +1,8 @@
+[/
+ Copyright 2010 Neil Groves
+ 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)
+/]
[section:lexicographical_compare lexicographical_compare]
[heading Prototype]
Modified: branches/release/libs/range/doc/reference/algorithm/lower_bound.qbk
==============================================================================
--- branches/release/libs/range/doc/reference/algorithm/lower_bound.qbk (original)
+++ branches/release/libs/range/doc/reference/algorithm/lower_bound.qbk 2010-12-26 10:13:43 EST (Sun, 26 Dec 2010)
@@ -1,3 +1,8 @@
+[/
+ Copyright 2010 Neil Groves
+ 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)
+/]
[section:lower_bound lower_bound]
[heading Prototype]
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-12-26 10:13:43 EST (Sun, 26 Dec 2010)
@@ -1,3 +1,8 @@
+[/
+ Copyright 2010 Neil Groves
+ 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)
+/]
[section:make_heap make_heap]
[heading Prototype]
Modified: branches/release/libs/range/doc/reference/algorithm/max_element.qbk
==============================================================================
--- branches/release/libs/range/doc/reference/algorithm/max_element.qbk (original)
+++ branches/release/libs/range/doc/reference/algorithm/max_element.qbk 2010-12-26 10:13:43 EST (Sun, 26 Dec 2010)
@@ -1,3 +1,8 @@
+[/
+ Copyright 2010 Neil Groves
+ 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)
+/]
[section:max_element max_element]
[heading Prototype]
Modified: branches/release/libs/range/doc/reference/algorithm/merge.qbk
==============================================================================
--- branches/release/libs/range/doc/reference/algorithm/merge.qbk (original)
+++ branches/release/libs/range/doc/reference/algorithm/merge.qbk 2010-12-26 10:13:43 EST (Sun, 26 Dec 2010)
@@ -1,3 +1,8 @@
+[/
+ Copyright 2010 Neil Groves
+ 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)
+/]
[section:merge merge]
[heading Prototype]
Modified: branches/release/libs/range/doc/reference/algorithm/min_element.qbk
==============================================================================
--- branches/release/libs/range/doc/reference/algorithm/min_element.qbk (original)
+++ branches/release/libs/range/doc/reference/algorithm/min_element.qbk 2010-12-26 10:13:43 EST (Sun, 26 Dec 2010)
@@ -1,3 +1,8 @@
+[/
+ Copyright 2010 Neil Groves
+ 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)
+/]
[section:min_element min_element]
[heading Prototype]
Modified: branches/release/libs/range/doc/reference/algorithm/mismatch.qbk
==============================================================================
--- branches/release/libs/range/doc/reference/algorithm/mismatch.qbk (original)
+++ branches/release/libs/range/doc/reference/algorithm/mismatch.qbk 2010-12-26 10:13:43 EST (Sun, 26 Dec 2010)
@@ -1,3 +1,8 @@
+[/
+ Copyright 2010 Neil Groves
+ 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)
+/]
[section:mismatch mismatch]
[heading Prototype]
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-12-26 10:13:43 EST (Sun, 26 Dec 2010)
@@ -1,3 +1,8 @@
+[/
+ Copyright 2010 Neil Groves
+ 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)
+/]
[section:next_permutation next_permutation]
[heading Prototype]
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-12-26 10:13:43 EST (Sun, 26 Dec 2010)
@@ -1,3 +1,8 @@
+[/
+ Copyright 2010 Neil Groves
+ 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)
+/]
[section:nth_element nth_element]
[heading Prototype]
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-12-26 10:13:43 EST (Sun, 26 Dec 2010)
@@ -1,3 +1,8 @@
+[/
+ Copyright 2010 Neil Groves
+ 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)
+/]
[section:partial_sort partial_sort]
[heading Prototype]
Modified: branches/release/libs/range/doc/reference/algorithm/partition.qbk
==============================================================================
--- branches/release/libs/range/doc/reference/algorithm/partition.qbk (original)
+++ branches/release/libs/range/doc/reference/algorithm/partition.qbk 2010-12-26 10:13:43 EST (Sun, 26 Dec 2010)
@@ -1,3 +1,8 @@
+[/
+ Copyright 2010 Neil Groves
+ 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)
+/]
[section:partition partition]
[heading Prototype]
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-12-26 10:13:43 EST (Sun, 26 Dec 2010)
@@ -1,3 +1,8 @@
+[/
+ Copyright 2010 Neil Groves
+ 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)
+/]
[section:pop_heap pop_heap]
[heading Prototype]
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-12-26 10:13:43 EST (Sun, 26 Dec 2010)
@@ -1,3 +1,8 @@
+[/
+ Copyright 2010 Neil Groves
+ 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)
+/]
[section:prev_permutation prev_permutation]
[heading Prototype]
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-12-26 10:13:43 EST (Sun, 26 Dec 2010)
@@ -1,3 +1,8 @@
+[/
+ Copyright 2010 Neil Groves
+ 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)
+/]
[section:push_heap push_heap]
[heading Prototype]
Modified: branches/release/libs/range/doc/reference/algorithm/random_shuffle.qbk
==============================================================================
--- branches/release/libs/range/doc/reference/algorithm/random_shuffle.qbk (original)
+++ branches/release/libs/range/doc/reference/algorithm/random_shuffle.qbk 2010-12-26 10:13:43 EST (Sun, 26 Dec 2010)
@@ -1,3 +1,8 @@
+[/
+ Copyright 2010 Neil Groves
+ 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)
+/]
[section:random_shuffle random_shuffle]
[heading Prototype]
Modified: branches/release/libs/range/doc/reference/algorithm/remove.qbk
==============================================================================
--- branches/release/libs/range/doc/reference/algorithm/remove.qbk (original)
+++ branches/release/libs/range/doc/reference/algorithm/remove.qbk 2010-12-26 10:13:43 EST (Sun, 26 Dec 2010)
@@ -1,5 +1,9 @@
+[/
+ Copyright 2010 Neil Groves
+ 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)
+/]
[section:remove remove]
-
[heading Prototype]
``
@@ -53,6 +57,4 @@
Linear. `remove` performs exactly `distance(rng)` comparisons for equality.
-[endsect]
-
-
+[endsect]
\ No newline at end of file
Modified: branches/release/libs/range/doc/reference/algorithm/remove_copy.qbk
==============================================================================
--- branches/release/libs/range/doc/reference/algorithm/remove_copy.qbk (original)
+++ branches/release/libs/range/doc/reference/algorithm/remove_copy.qbk 2010-12-26 10:13:43 EST (Sun, 26 Dec 2010)
@@ -1,3 +1,8 @@
+[/
+ Copyright 2010 Neil Groves
+ 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)
+/]
[section:remove_copy remove_copy]
[heading Prototype]
Modified: branches/release/libs/range/doc/reference/algorithm/remove_copy_if.qbk
==============================================================================
--- branches/release/libs/range/doc/reference/algorithm/remove_copy_if.qbk (original)
+++ branches/release/libs/range/doc/reference/algorithm/remove_copy_if.qbk 2010-12-26 10:13:43 EST (Sun, 26 Dec 2010)
@@ -1,3 +1,8 @@
+[/
+ Copyright 2010 Neil Groves
+ 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)
+/]
[section:remove_copy_if remove_copy_if]
[heading Prototype]
Modified: branches/release/libs/range/doc/reference/algorithm/remove_if.qbk
==============================================================================
--- branches/release/libs/range/doc/reference/algorithm/remove_if.qbk (original)
+++ branches/release/libs/range/doc/reference/algorithm/remove_if.qbk 2010-12-26 10:13:43 EST (Sun, 26 Dec 2010)
@@ -1,3 +1,8 @@
+[/
+ Copyright 2010 Neil Groves
+ 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)
+/]
[section:remove_if remove_if]
[heading Prototype]
Modified: branches/release/libs/range/doc/reference/algorithm/replace.qbk
==============================================================================
--- branches/release/libs/range/doc/reference/algorithm/replace.qbk (original)
+++ branches/release/libs/range/doc/reference/algorithm/replace.qbk 2010-12-26 10:13:43 EST (Sun, 26 Dec 2010)
@@ -1,3 +1,8 @@
+[/
+ Copyright 2010 Neil Groves
+ 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)
+/]
[section:replace replace]
[heading Prototype]
Modified: branches/release/libs/range/doc/reference/algorithm/replace_copy.qbk
==============================================================================
--- branches/release/libs/range/doc/reference/algorithm/replace_copy.qbk (original)
+++ branches/release/libs/range/doc/reference/algorithm/replace_copy.qbk 2010-12-26 10:13:43 EST (Sun, 26 Dec 2010)
@@ -1,3 +1,8 @@
+[/
+ Copyright 2010 Neil Groves
+ 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)
+/]
[section:replace_copy replace_copy]
[heading Prototype]
Modified: branches/release/libs/range/doc/reference/algorithm/replace_copy_if.qbk
==============================================================================
--- branches/release/libs/range/doc/reference/algorithm/replace_copy_if.qbk (original)
+++ branches/release/libs/range/doc/reference/algorithm/replace_copy_if.qbk 2010-12-26 10:13:43 EST (Sun, 26 Dec 2010)
@@ -1,3 +1,8 @@
+[/
+ Copyright 2010 Neil Groves
+ 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)
+/]
[section:replace_copy_if replace_copy_if]
[heading Prototype]
Modified: branches/release/libs/range/doc/reference/algorithm/replace_if.qbk
==============================================================================
--- branches/release/libs/range/doc/reference/algorithm/replace_if.qbk (original)
+++ branches/release/libs/range/doc/reference/algorithm/replace_if.qbk 2010-12-26 10:13:43 EST (Sun, 26 Dec 2010)
@@ -1,3 +1,8 @@
+[/
+ Copyright 2010 Neil Groves
+ 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)
+/]
[section:replace_if replace_if]
[heading Prototype]
Modified: branches/release/libs/range/doc/reference/algorithm/reverse.qbk
==============================================================================
--- branches/release/libs/range/doc/reference/algorithm/reverse.qbk (original)
+++ branches/release/libs/range/doc/reference/algorithm/reverse.qbk 2010-12-26 10:13:43 EST (Sun, 26 Dec 2010)
@@ -1,3 +1,8 @@
+[/
+ Copyright 2010 Neil Groves
+ 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)
+/]
[section:reverse reverse]
[heading Prototype]
Modified: branches/release/libs/range/doc/reference/algorithm/reverse_copy.qbk
==============================================================================
--- branches/release/libs/range/doc/reference/algorithm/reverse_copy.qbk (original)
+++ branches/release/libs/range/doc/reference/algorithm/reverse_copy.qbk 2010-12-26 10:13:43 EST (Sun, 26 Dec 2010)
@@ -1,3 +1,8 @@
+[/
+ Copyright 2010 Neil Groves
+ 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)
+/]
[section:reverse_copy reverse_copy]
[heading Prototype]
Modified: branches/release/libs/range/doc/reference/algorithm/rotate.qbk
==============================================================================
--- branches/release/libs/range/doc/reference/algorithm/rotate.qbk (original)
+++ branches/release/libs/range/doc/reference/algorithm/rotate.qbk 2010-12-26 10:13:43 EST (Sun, 26 Dec 2010)
@@ -1,3 +1,8 @@
+[/
+ Copyright 2010 Neil Groves
+ 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)
+/]
[section:rotate rotate]
[heading Prototype]
Modified: branches/release/libs/range/doc/reference/algorithm/rotate_copy.qbk
==============================================================================
--- branches/release/libs/range/doc/reference/algorithm/rotate_copy.qbk (original)
+++ branches/release/libs/range/doc/reference/algorithm/rotate_copy.qbk 2010-12-26 10:13:43 EST (Sun, 26 Dec 2010)
@@ -1,3 +1,8 @@
+[/
+ Copyright 2010 Neil Groves
+ 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)
+/]
[section:rotate_copy rotate_copy]
[heading Prototype]
Modified: branches/release/libs/range/doc/reference/algorithm/search.qbk
==============================================================================
--- branches/release/libs/range/doc/reference/algorithm/search.qbk (original)
+++ branches/release/libs/range/doc/reference/algorithm/search.qbk 2010-12-26 10:13:43 EST (Sun, 26 Dec 2010)
@@ -1,3 +1,8 @@
+[/
+ Copyright 2010 Neil Groves
+ 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)
+/]
[section:search search]
[heading Prototype]
Modified: branches/release/libs/range/doc/reference/algorithm/search_n.qbk
==============================================================================
--- branches/release/libs/range/doc/reference/algorithm/search_n.qbk (original)
+++ branches/release/libs/range/doc/reference/algorithm/search_n.qbk 2010-12-26 10:13:43 EST (Sun, 26 Dec 2010)
@@ -1,3 +1,8 @@
+[/
+ Copyright 2010 Neil Groves
+ 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)
+/]
[section:search_n search_n]
[heading Prototype]
Modified: branches/release/libs/range/doc/reference/algorithm/set_difference.qbk
==============================================================================
--- branches/release/libs/range/doc/reference/algorithm/set_difference.qbk (original)
+++ branches/release/libs/range/doc/reference/algorithm/set_difference.qbk 2010-12-26 10:13:43 EST (Sun, 26 Dec 2010)
@@ -1,3 +1,8 @@
+[/
+ Copyright 2010 Neil Groves
+ 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)
+/]
[section:set_difference set_difference]
[heading Prototype]
Modified: branches/release/libs/range/doc/reference/algorithm/set_intersection.qbk
==============================================================================
--- branches/release/libs/range/doc/reference/algorithm/set_intersection.qbk (original)
+++ branches/release/libs/range/doc/reference/algorithm/set_intersection.qbk 2010-12-26 10:13:43 EST (Sun, 26 Dec 2010)
@@ -1,3 +1,8 @@
+[/
+ Copyright 2010 Neil Groves
+ 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)
+/]
[section:set_intersection set_intersection]
[heading Prototype]
Modified: branches/release/libs/range/doc/reference/algorithm/set_symmetric_difference.qbk
==============================================================================
--- branches/release/libs/range/doc/reference/algorithm/set_symmetric_difference.qbk (original)
+++ branches/release/libs/range/doc/reference/algorithm/set_symmetric_difference.qbk 2010-12-26 10:13:43 EST (Sun, 26 Dec 2010)
@@ -1,3 +1,8 @@
+[/
+ Copyright 2010 Neil Groves
+ 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)
+/]
[section:set_symmetric_difference set_symmetric_difference]
[heading Prototype]
Modified: branches/release/libs/range/doc/reference/algorithm/set_union.qbk
==============================================================================
--- branches/release/libs/range/doc/reference/algorithm/set_union.qbk (original)
+++ branches/release/libs/range/doc/reference/algorithm/set_union.qbk 2010-12-26 10:13:43 EST (Sun, 26 Dec 2010)
@@ -1,3 +1,8 @@
+[/
+ Copyright 2010 Neil Groves
+ 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)
+/]
[section:set_union set_union]
[heading Prototype]
Modified: branches/release/libs/range/doc/reference/algorithm/sort.qbk
==============================================================================
--- branches/release/libs/range/doc/reference/algorithm/sort.qbk (original)
+++ branches/release/libs/range/doc/reference/algorithm/sort.qbk 2010-12-26 10:13:43 EST (Sun, 26 Dec 2010)
@@ -1,3 +1,8 @@
+[/
+ Copyright 2010 Neil Groves
+ 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)
+/]
[section:sort sort]
[heading Prototype]
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-12-26 10:13:43 EST (Sun, 26 Dec 2010)
@@ -1,3 +1,8 @@
+[/
+ Copyright 2010 Neil Groves
+ 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)
+/]
[section:sort_heap sort_heap]
[heading Prototype]
Modified: branches/release/libs/range/doc/reference/algorithm/stable_partition.qbk
==============================================================================
--- branches/release/libs/range/doc/reference/algorithm/stable_partition.qbk (original)
+++ branches/release/libs/range/doc/reference/algorithm/stable_partition.qbk 2010-12-26 10:13:43 EST (Sun, 26 Dec 2010)
@@ -1,3 +1,8 @@
+[/
+ Copyright 2010 Neil Groves
+ 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)
+/]
[section:stable_partition stable_partition]
[heading Prototype]
Modified: branches/release/libs/range/doc/reference/algorithm/stable_sort.qbk
==============================================================================
--- branches/release/libs/range/doc/reference/algorithm/stable_sort.qbk (original)
+++ branches/release/libs/range/doc/reference/algorithm/stable_sort.qbk 2010-12-26 10:13:43 EST (Sun, 26 Dec 2010)
@@ -1,3 +1,8 @@
+[/
+ Copyright 2010 Neil Groves
+ 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)
+/]
[section:stable_sort stable_sort]
[heading Prototype]
Modified: branches/release/libs/range/doc/reference/algorithm/swap_ranges.qbk
==============================================================================
--- branches/release/libs/range/doc/reference/algorithm/swap_ranges.qbk (original)
+++ branches/release/libs/range/doc/reference/algorithm/swap_ranges.qbk 2010-12-26 10:13:43 EST (Sun, 26 Dec 2010)
@@ -1,3 +1,8 @@
+[/
+ Copyright 2010 Neil Groves
+ 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)
+/]
[section:swap_ranges swap_ranges]
[heading Prototype]
Modified: branches/release/libs/range/doc/reference/algorithm/transform.qbk
==============================================================================
--- branches/release/libs/range/doc/reference/algorithm/transform.qbk (original)
+++ branches/release/libs/range/doc/reference/algorithm/transform.qbk 2010-12-26 10:13:43 EST (Sun, 26 Dec 2010)
@@ -1,3 +1,8 @@
+[/
+ Copyright 2010 Neil Groves
+ 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)
+/]
[section:transform transform]
[heading Prototype]
Modified: branches/release/libs/range/doc/reference/algorithm/unique.qbk
==============================================================================
--- branches/release/libs/range/doc/reference/algorithm/unique.qbk (original)
+++ branches/release/libs/range/doc/reference/algorithm/unique.qbk 2010-12-26 10:13:43 EST (Sun, 26 Dec 2010)
@@ -1,3 +1,8 @@
+[/
+ Copyright 2010 Neil Groves
+ 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)
+/]
[section:unique unique]
[heading Prototype]
Modified: branches/release/libs/range/doc/reference/algorithm/unique_copy.qbk
==============================================================================
--- branches/release/libs/range/doc/reference/algorithm/unique_copy.qbk (original)
+++ branches/release/libs/range/doc/reference/algorithm/unique_copy.qbk 2010-12-26 10:13:43 EST (Sun, 26 Dec 2010)
@@ -1,3 +1,8 @@
+[/
+ Copyright 2010 Neil Groves
+ 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)
+/]
[section:unique_copy unique_copy]
[heading Prototype]
Modified: branches/release/libs/range/doc/reference/algorithm/upper_bound.qbk
==============================================================================
--- branches/release/libs/range/doc/reference/algorithm/upper_bound.qbk (original)
+++ branches/release/libs/range/doc/reference/algorithm/upper_bound.qbk 2010-12-26 10:13:43 EST (Sun, 26 Dec 2010)
@@ -1,3 +1,8 @@
+[/
+ Copyright 2010 Neil Groves
+ 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)
+/]
[section:upper_bound upper_bound]
[heading Prototype]
Modified: branches/release/libs/range/doc/reference/algorithm_ext/copy_n.qbk
==============================================================================
--- branches/release/libs/range/doc/reference/algorithm_ext/copy_n.qbk (original)
+++ branches/release/libs/range/doc/reference/algorithm_ext/copy_n.qbk 2010-12-26 10:13:43 EST (Sun, 26 Dec 2010)
@@ -1,3 +1,8 @@
+[/
+ Copyright 2010 Neil Groves
+ 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)
+/]
[section:copy_n copy_n]
[heading Prototype]
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-12-26 10:13:43 EST (Sun, 26 Dec 2010)
@@ -1,3 +1,8 @@
+[/
+ Copyright 2010 Neil Groves
+ 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)
+/]
[section:erase erase]
[heading Prototype]
Modified: branches/release/libs/range/doc/reference/algorithm_ext/for_each.qbk
==============================================================================
--- branches/release/libs/range/doc/reference/algorithm_ext/for_each.qbk (original)
+++ branches/release/libs/range/doc/reference/algorithm_ext/for_each.qbk 2010-12-26 10:13:43 EST (Sun, 26 Dec 2010)
@@ -1,3 +1,8 @@
+[/
+ Copyright 2010 Neil Groves
+ 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)
+/]
[section:for_each for_each]
[heading Prototype]
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-12-26 10:13:43 EST (Sun, 26 Dec 2010)
@@ -1,3 +1,8 @@
+[/
+ Copyright 2010 Neil Groves
+ 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)
+/]
[section:insert insert]
[heading Prototype]
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-12-26 10:13:43 EST (Sun, 26 Dec 2010)
@@ -1,3 +1,8 @@
+[/
+ Copyright 2010 Neil Groves
+ 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)
+/]
[section:iota iota]
[heading Prototype]
Modified: branches/release/libs/range/doc/reference/algorithm_ext/is_sorted.qbk
==============================================================================
--- branches/release/libs/range/doc/reference/algorithm_ext/is_sorted.qbk (original)
+++ branches/release/libs/range/doc/reference/algorithm_ext/is_sorted.qbk 2010-12-26 10:13:43 EST (Sun, 26 Dec 2010)
@@ -1,3 +1,8 @@
+[/
+ Copyright 2010 Neil Groves
+ 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)
+/]
[section:is_sorted is_sorted]
[heading Prototype]
Modified: branches/release/libs/range/doc/reference/algorithm_ext/overwrite.qbk
==============================================================================
--- branches/release/libs/range/doc/reference/algorithm_ext/overwrite.qbk (original)
+++ branches/release/libs/range/doc/reference/algorithm_ext/overwrite.qbk 2010-12-26 10:13:43 EST (Sun, 26 Dec 2010)
@@ -1,3 +1,8 @@
+[/
+ Copyright 2010 Neil Groves
+ 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)
+/]
[section:overwrite overwrite]
[heading Prototype]
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-12-26 10:13:43 EST (Sun, 26 Dec 2010)
@@ -1,3 +1,8 @@
+[/
+ Copyright 2010 Neil Groves
+ 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)
+/]
[section:push_back push_back]
[heading Prototype]
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-12-26 10:13:43 EST (Sun, 26 Dec 2010)
@@ -1,3 +1,8 @@
+[/
+ Copyright 2010 Neil Groves
+ 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)
+/]
[section:push_front push_front]
[heading Prototype]
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-12-26 10:13:43 EST (Sun, 26 Dec 2010)
@@ -1,3 +1,8 @@
+[/
+ Copyright 2010 Neil Groves
+ 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)
+/]
[section:remove_erase remove_erase]
[heading Prototype]
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-12-26 10:13:43 EST (Sun, 26 Dec 2010)
@@ -1,3 +1,8 @@
+[/
+ Copyright 2010 Neil Groves
+ 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)
+/]
[section:remove_erase_if remove_erase_if]
[heading Prototype]
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-12-26 10:13:43 EST (Sun, 26 Dec 2010)
@@ -1,6 +1,10 @@
-[section:algorithms Range Algorithm]
-
-[section:range_algorithm_introduction Introduction and motivation]
+[/
+ Copyright 2010 Neil Groves
+ 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)
+/]
+[section:algorithms Range Algorithms]
+[section:introduction Introduction and motivation]
In its most simple form a [*Range Algorithm] (or range-based algorithm) is simply an iterator-based algorithm where the /two/ iterator arguments have been replaced by /one/ range argument. For example, we may write
``
@@ -173,6 +177,4 @@
[include numeric/inner_product.qbk]
[include numeric/partial_sum.qbk]
[endsect]
-
-[endsect]
-
+[endsect]
\ No newline at end of file
Modified: branches/release/libs/range/doc/reference/extending.qbk
==============================================================================
--- branches/release/libs/range/doc/reference/extending.qbk (original)
+++ branches/release/libs/range/doc/reference/extending.qbk 2010-12-26 10:13:43 EST (Sun, 26 Dec 2010)
@@ -1,3 +1,8 @@
+[/
+ Copyright 2010 Neil Groves
+ 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)
+/]
[section:extending Extending the library]
[section:method_1 Method 1: provide member functions and nested types]
@@ -36,6 +41,7 @@
[[Function ] [Related concept ]]
[[`range_begin(x)`] [__single_pass_range__]]
[[`range_end(x)` ] [__single_pass_range__]]
+ [[`range_calculate_size(x)`] [ Optional. This can be used to specify a mechanism for constant-time computation of the size of a range. The default behaviour is to return `boost::end(x) - boost::begin(x)` for random access ranges, and to return `x.size()` for ranges with lesser traversal capability. This behaviour can be changed by implementing `range_calculate_size` in a manner that will be found via ADL. The ability to calculate size in O(1) is often possible even with ranges with traversal categories less than random access.]]
]
`range_begin()` and `range_end()` must be overloaded for both `const` and `mutable` reference arguments.
Modified: branches/release/libs/range/doc/reference/numeric/accumulate.qbk
==============================================================================
--- branches/release/libs/range/doc/reference/numeric/accumulate.qbk (original)
+++ branches/release/libs/range/doc/reference/numeric/accumulate.qbk 2010-12-26 10:13:43 EST (Sun, 26 Dec 2010)
@@ -1,3 +1,8 @@
+[/
+ Copyright 2010 Neil Groves
+ 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)
+/]
[section:accumulate accumulate]
[heading Prototype]
Modified: branches/release/libs/range/doc/reference/numeric/adjacent_difference.qbk
==============================================================================
--- branches/release/libs/range/doc/reference/numeric/adjacent_difference.qbk (original)
+++ branches/release/libs/range/doc/reference/numeric/adjacent_difference.qbk 2010-12-26 10:13:43 EST (Sun, 26 Dec 2010)
@@ -1,3 +1,8 @@
+[/
+ Copyright 2010 Neil Groves
+ 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)
+/]
[section:adjacent_difference adjacent_difference]
[heading Prototype]
Modified: branches/release/libs/range/doc/reference/numeric/inner_product.qbk
==============================================================================
--- branches/release/libs/range/doc/reference/numeric/inner_product.qbk (original)
+++ branches/release/libs/range/doc/reference/numeric/inner_product.qbk 2010-12-26 10:13:43 EST (Sun, 26 Dec 2010)
@@ -1,3 +1,8 @@
+[/
+ Copyright 2010 Neil Groves
+ 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)
+/]
[section:inner_product inner_product]
[heading Prototype]
Modified: branches/release/libs/range/doc/reference/numeric/partial_sum.qbk
==============================================================================
--- branches/release/libs/range/doc/reference/numeric/partial_sum.qbk (original)
+++ branches/release/libs/range/doc/reference/numeric/partial_sum.qbk 2010-12-26 10:13:43 EST (Sun, 26 Dec 2010)
@@ -1,3 +1,8 @@
+[/
+ Copyright 2010 Neil Groves
+ 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)
+/]
[section:partial_sum partial_sum]
[heading Prototype]
Modified: branches/release/libs/range/doc/reference/overview.qbk
==============================================================================
--- branches/release/libs/range/doc/reference/overview.qbk (original)
+++ branches/release/libs/range/doc/reference/overview.qbk 2010-12-26 10:13:43 EST (Sun, 26 Dec 2010)
@@ -1,4 +1,9 @@
-[section Overview]
+[/
+ Copyright 2010 Neil Groves
+ 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)
+/]
+[section:overview Overview]
Three types of objects are currently supported by the library:
Modified: branches/release/libs/range/doc/reference/ranges.qbk
==============================================================================
--- branches/release/libs/range/doc/reference/ranges.qbk (original)
+++ branches/release/libs/range/doc/reference/ranges.qbk 2010-12-26 10:13:43 EST (Sun, 26 Dec 2010)
@@ -1,3 +1,8 @@
+[/
+ Copyright 2010 Neil Groves
+ 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)
+/]
[section:ranges Provided Ranges]
[include ranges/counting_range.qbk]
Modified: branches/release/libs/range/doc/reference/ranges/counting_range.qbk
==============================================================================
--- branches/release/libs/range/doc/reference/ranges/counting_range.qbk (original)
+++ branches/release/libs/range/doc/reference/ranges/counting_range.qbk 2010-12-26 10:13:43 EST (Sun, 26 Dec 2010)
@@ -1,3 +1,8 @@
+[/
+ Copyright 2010 Neil Groves
+ 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)
+/]
[section:counting_range counting_range]
[heading Prototype]
Modified: branches/release/libs/range/doc/reference/ranges/irange.qbk
==============================================================================
--- branches/release/libs/range/doc/reference/ranges/irange.qbk (original)
+++ branches/release/libs/range/doc/reference/ranges/irange.qbk 2010-12-26 10:13:43 EST (Sun, 26 Dec 2010)
@@ -1,3 +1,8 @@
+[/
+ Copyright 2010 Neil Groves
+ 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)
+/]
[section:irange irange]
[heading Prototype]
Modified: branches/release/libs/range/doc/reference/ranges/istream_range.qbk
==============================================================================
--- branches/release/libs/range/doc/reference/ranges/istream_range.qbk (original)
+++ branches/release/libs/range/doc/reference/ranges/istream_range.qbk 2010-12-26 10:13:43 EST (Sun, 26 Dec 2010)
@@ -1,3 +1,8 @@
+[/
+ Copyright 2010 Neil Groves
+ 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)
+/]
[section:istream_range istream_range]
[heading Prototype]
Modified: branches/release/libs/range/doc/reference/semantics.qbk
==============================================================================
--- branches/release/libs/range/doc/reference/semantics.qbk (original)
+++ branches/release/libs/range/doc/reference/semantics.qbk 2010-12-26 10:13:43 EST (Sun, 26 Dec 2010)
@@ -1,4 +1,9 @@
-[section Semantics]
+[/
+ Copyright 2010 Neil Groves
+ 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)
+/]
+[section:semantics Semantics]
[heading notation]
@@ -68,6 +73,16 @@
[`boost::reverse_iterator<range_iterator<const X>::type`]
[compile time]
]
+ [
+ [`has_range_iterator<X>::type`]
+ [`mpl::true_` if `range_mutable_iterator<X>::type` is a valid expression, `mpl::false_` otherwise]
+ [compile time]
+ ]
+ [
+ [`has_range_const_iterator<X>::type`]
+ [`mpl::true_` if `range_const_iterator<X>::type` is a valid expression, `mpl::false_` otherwise]
+ [compile time]
+ ]
]
[endsect]
@@ -114,7 +129,7 @@
[
[`size(x)`]
[`range_difference<X>::type`]
- [`boost::end(x) - boost::begin(x)`]
+ [`The size of the range with complexity O(1). For RandomAccessRanges this is achieved via boost::end(x) - boost::begin(x). For other traversal categories range_calculate_size(x) is returned. Note that unless range_calculate_size(x) has been implemented by the user as an extension then the Argument Dependent Lookup will return x.size()`]
[constant time]
]
[
Modified: branches/release/libs/range/doc/reference/synopsis.qbk
==============================================================================
--- branches/release/libs/range/doc/reference/synopsis.qbk (original)
+++ branches/release/libs/range/doc/reference/synopsis.qbk 2010-12-26 10:13:43 EST (Sun, 26 Dec 2010)
@@ -1,4 +1,9 @@
-[section Synopsis]
+[/
+ Copyright 2010 Neil Groves
+ 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)
+/]
+[section:synopsis Synopsis]
``
namespace boost
Modified: branches/release/libs/range/doc/reference/utilities.qbk
==============================================================================
--- branches/release/libs/range/doc/reference/utilities.qbk (original)
+++ branches/release/libs/range/doc/reference/utilities.qbk 2010-12-26 10:13:43 EST (Sun, 26 Dec 2010)
@@ -1,3 +1,8 @@
+[/
+ Copyright 2010 Neil Groves
+ 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)
+/]
[section:utilities Utilities]
Having an abstraction that encapsulates a pair of iterators is very useful. The standard library uses `std::pair` in some circumstances, but that class is cumbersome to use because we need to specify two template arguments, and for all range algorithm purposes we must enforce the two template arguments to be the same. Moreover, `std::pair<iterator,iterator>` is hardly self-documenting whereas more domain specific class names are. Therefore these two classes are provided:
@@ -266,25 +271,31 @@
Note that the joined range incurs a performance cost due to the need to check if the end of a range has been reached internally during traversal.
[h4 Synposis]
+
``
template<typename SinglePassRange1, typename SinglePassRange2>
-iterator_range<range_detail::join_iterator<
- typename range_iterator<const SinglePassRange1>::type,
- typename range_iterator<const SinglePassRange2>::type,
- typename add_const<
- typename range_value<const SinglePassRange1>::type>::type>
->
+joined_range<const SinglePassRange1, const SinglePassRange2>
join(const SinglePassRange1& rng1, const SinglePassRange2& rng2)
template<typename SinglePassRange1, typename SinglePassRange2>
-iterator_range<range_detail::join_iterator<
- typename range_iterator<SinglePassRange1>::type,
- typename range_iterator<SinglePassRange2>::type,
- typename range_value<SinglePassRange1>::type>
->
+joined_range<SinglePassRange1, SinglePassRange2>
join(SinglePassRange1& rng1, SinglePassRange2& rng2);
``
+For the const version:
+
+* [*Precondition:] The `range_value<SinglePassRange2>::type` must be convertible to `range_value<SinglePassRange1>::type`. The `range_reference<const SinglePassRange2>::type` must be convertible to `range_reference<const SinglePassRange1>::type`.
+* [*Range Category:] Both `rng1` and `rng2` must be a model of __single_pass_range__ or better.
+* [*Range Return Type:] `joined_range<const SinglePassRange1, const SinglePassRange2>` which is a model of the lesser of the two range concepts passed.
+* [*Returned Range Category:] The minimum of the range category of `rng1` and `rng2`.
+
+For the mutable version:
+
+* [*Precondition:] The `range_value<SinglePassRange2>::type` must be convertible to `range_value<SinglePassRange1>::type`. The `range_reference<SinglePassRange2>::type` must be convertible to `range_reference<SinglePassRange1>::type`.
+* [*Range Category:] Both `rng1` and `rng2` must be a model of __single_pass_range__ or better.
+* [*Range Return Type:] `joined_range<SinglePassRange1, SinglePassRange2>` which is a model of the lesser of the two range concepts passed.
+* [*Returned Range Category:] The minimum of the range category of `rng1` and `rng2`.
+
[h4 Example]
The expression `join(irange(0,5), irange(5,10))` would evaluate to a range representing an integer range `[0,10)`
Deleted: branches/release/libs/range/doc/style.css
==============================================================================
--- branches/release/libs/range/doc/style.css 2010-12-26 10:13:43 EST (Sun, 26 Dec 2010)
+++ (empty file)
@@ -1,42 +0,0 @@
-/*
-// Boost.Range library
-//
-// Copyright Thorsten Ottosen 2003-2008. Use, modification and
-// distribution is subject to 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)
-//
-// For more information, see http://www.boost.org/libs/range/
-//
-*/
-pre{
- BORDER-RIGHT: gray 1pt solid;
- PADDING-RIGHT: 2pt;
- BORDER-TOP: gray 1pt solid;
- DISPLAY: block;
- PADDING-LEFT: 2pt;
- PADDING-BOTTOM: 2pt;
- BORDER-LEFT: gray 1pt solid;
- MARGIN-RIGHT: 32pt;
- PADDING-TOP: 2pt;
- BORDER-BOTTOM: gray 1pt solid;
- FONT-FAMILY: "Courier New", Courier, mono;
- background-color: #EEEEEE;
-}
-
-
-.keyword{color: #0000FF;}
-.identifier{}
-.comment{font-style: italic; color: #008000;}
-.special{color: #800040;}
-.preprocessor{color: #3F007F;}
-.string{font-style: italic; color: #666666;}
-.literal{font-style: italic; color: #666666;}
-
-table
-{
- cellpadding: 5px;
- border: 2px;
-}
-
-
Modified: branches/release/libs/range/doc/style.qbk
==============================================================================
--- branches/release/libs/range/doc/style.qbk (original)
+++ branches/release/libs/range/doc/style.qbk 2010-12-26 10:13:43 EST (Sun, 26 Dec 2010)
@@ -1,3 +1,8 @@
+[/
+ Copyright 2010 Neil Groves
+ 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)
+/]
[section:style_guide Terminology and style guidelines]
The use of a consistent terminology is as important for __ranges__ and range-based algorithms as it is for iterators and iterator-based algorithms. If a conventional set of names are adopted, we can avoid misunderstandings and write generic function prototypes that are [*/self-documenting/].
Modified: branches/release/libs/range/doc/upgrade.qbk
==============================================================================
--- branches/release/libs/range/doc/upgrade.qbk (original)
+++ branches/release/libs/range/doc/upgrade.qbk 2010-12-26 10:13:43 EST (Sun, 26 Dec 2010)
@@ -1,5 +1,18 @@
+[/
+ Copyright 2010 Neil Groves
+ 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)
+/]
[section:upgrade Upgrade version of Boost.Range]
+[section:upgrade_from_1_45 Upgrade from version 1.45]
+
+# __size__ in addition to supporting __random_access_range__ now also supports extensibility via calls to the unqualified `range_calculate_size(rng)` function.
+# __range_adaptors_strided__ now in addition to working with any RandomAccessRange additionally works for any SinglePassRange for which `boost::size(rng)` is valid.
+# __range_adaptors_strided__ no longer requires `distance(rng) % stride_size == 0` or `stride_size < distance(rng)`
+
+[endsect]
+
[section:upgrade_from_1_42 Upgrade from version 1.42]
New features:
Modified: branches/release/libs/range/index.html
==============================================================================
--- branches/release/libs/range/index.html (original)
+++ branches/release/libs/range/index.html 2010-12-26 10:13:43 EST (Sun, 26 Dec 2010)
@@ -11,3 +11,6 @@
Automatic redirection failed, please go to doc/html/index.html
</body>
</html>
+<!-- Copyright Neil Groves 2010. 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) -->
Modified: branches/release/libs/range/test/Jamfile.v2
==============================================================================
--- branches/release/libs/range/test/Jamfile.v2 (original)
+++ branches/release/libs/range/test/Jamfile.v2 2010-12-26 10:13:43 EST (Sun, 26 Dec 2010)
@@ -137,6 +137,8 @@
[ range-test const_ranges ]
[ range-test counting_range ]
[ range-test extension_mechanism ]
+ [ range-test extension_size ]
+ [ range-test has_range_iterator ]
[ range-test irange ]
[ range-test istream_range ]
[ range-test iterator_pair ]
Modified: branches/release/libs/range/test/adaptor_test/strided.cpp
==============================================================================
--- branches/release/libs/range/test/adaptor_test/strided.cpp (original)
+++ branches/release/libs/range/test/adaptor_test/strided.cpp 2010-12-26 10:13:43 EST (Sun, 26 Dec 2010)
@@ -8,6 +8,9 @@
//
// For more information, see http://www.boost.org/libs/range/
//
+// The strided_defect_Trac5014 test case is a modified version of a test case
+// contribued by Michel Morin as part of the trac ticket.
+//
#include <boost/range/adaptor/strided.hpp>
#include <boost/test/test_tools.hpp>
@@ -24,35 +27,44 @@
{
namespace
{
- const int STRIDE_SIZE = 2;
-
template< class Container >
- void strided_test_impl( Container& c )
+ void strided_test_impl( Container& c, int stride_size )
{
using namespace boost::adaptors;
- BOOST_ASSERT( c.size() % STRIDE_SIZE == 0 );
+ // Rationale:
+ // This requirement was too restrictive. It makes the use of the
+ // strided adaptor too dangerous, and a simple solution existed
+ // to make it safe, hence the strided adaptor has been modified
+ // and this restriction no longer applies.
+ //BOOST_ASSERT( c.size() % STRIDE_SIZE == 0 );
Container reference;
{
typedef BOOST_DEDUCED_TYPENAME Container::const_iterator iterator_t;
+ typedef BOOST_DEDUCED_TYPENAME Container::difference_type diff_t;
+ typedef BOOST_DEDUCED_TYPENAME Container::size_type size_type;
iterator_t it = c.begin();
- for (iterator_t last = c.end();
- it != last; it += STRIDE_SIZE)
+
+ iterator_t last = c.end();
+ for (; it != last; )
{
reference.push_back(*it);
+
+ for (int i = 0; (it != last) && (i < stride_size); ++i)
+ ++it;
}
}
Container test;
- boost::push_back( test, c | strided(2) );
+ boost::push_back( test, c | strided(stride_size) );
BOOST_CHECK_EQUAL_COLLECTIONS( test.begin(), test.end(),
reference.begin(), reference.end() );
Container test2;
- boost::push_back( test2, adaptors::stride(c, 2) );
+ boost::push_back( test2, adaptors::stride(c, stride_size) );
BOOST_CHECK_EQUAL_COLLECTIONS( test2.begin(), test2.end(),
reference.begin(), reference.end() );
@@ -60,41 +72,193 @@
// Test the const versions:
const Container& cc = c;
Container test3;
- boost::push_back( test3, cc | strided(2) );
+ boost::push_back( test3, cc | strided(stride_size) );
BOOST_CHECK_EQUAL_COLLECTIONS( test3.begin(), test3.end(),
reference.begin(), reference.end() );
Container test4;
- boost::push_back( test4, adaptors::stride(cc, 2) );
+ boost::push_back( test4, adaptors::stride(cc, stride_size) );
BOOST_CHECK_EQUAL_COLLECTIONS( test4.begin(), test4.end(),
reference.begin(), reference.end() );
}
template< class Container >
- void strided_test_impl()
+ void strided_test_impl(int stride_size)
{
using namespace boost::assign;
Container c;
// Test empty
- strided_test_impl(c);
+ strided_test_impl(c, stride_size);
// Test two elements
c += 1,2;
- strided_test_impl(c);
+ strided_test_impl(c, stride_size);
// Test many elements
c += 1,1,1,2,2,3,4,5,6,6,6,7,8,9;
- strided_test_impl(c);
+ strided_test_impl(c, stride_size);
+
+ // Test an odd number of elements to determine that the relaxation
+ // of the requirements has been successful
+ // Test a sequence of length 1 with a stride of 2
+ c.clear();
+ c += 1;
+ strided_test_impl(c, stride_size);
+
+ // Test a sequence of length 2 with a stride of 2
+ c.clear();
+ c += 1,2;
+ strided_test_impl(c, stride_size);
+
+ // Test a sequence of length 3 with a stride of 2
+ c.clear();
+ c += 1,2,3;
+ strided_test_impl(c, stride_size);
+ }
+
+ template<typename Container>
+ void strided_test_zero_stride()
+ {
+ Container c;
+ c.push_back(1);
+
+ typedef boost::strided_range<Container> strided_range_t;
+ strided_range_t rng( boost::adaptors::stride(c, 0) );
+ typedef typename boost::range_iterator<strided_range_t>::type iter_t;
+
+ iter_t first(boost::begin(c), 0, 0, boost::size(c));
+ iter_t last(boost::end(c), 0, boost::size(c), boost::size(c));
+
+ iter_t it = first;
+ for (int i = 0; i < 10; ++i, ++it)
+ {
+ BOOST_CHECK(it == first);
+ }
+ }
+
+ template<typename Container>
+ void strided_test_impl()
+ {
+ strided_test_zero_stride< Container >();
+
+ const int MAX_STRIDE_SIZE = 10;
+ for (int stride_size = 1; stride_size <= MAX_STRIDE_SIZE; ++stride_size)
+ {
+ strided_test_impl< Container >(stride_size);
+ }
}
void strided_test()
{
- strided_test_impl< std::vector< int > >();
- strided_test_impl< std::deque< int > >();
+ strided_test_impl< std::vector<int> >();
+ strided_test_impl< std::deque<int> >();
+ strided_test_impl< std::list<int> >();
+ }
+
+ void strided_defect_Trac5014()
+ {
+ using namespace boost::assign;
+
+ std::vector<int> v;
+ for (int i = 0; i < 30; ++i)
+ v.push_back(i);
+
+ std::vector<int> reference;
+ reference += 0,4,8,12,16,20,24,28;
+
+ std::vector<int> output;
+ boost::push_back(output, v | boost::adaptors::strided(4));
+
+ BOOST_CHECK_EQUAL_COLLECTIONS( reference.begin(), reference.end(),
+ output.begin(), output.end() );
+
+ BOOST_CHECK_EQUAL( output.back(), 28 );
+ }
+
+ template<typename BaseIterator, typename Category>
+ class strided_mock_iterator
+ : public boost::iterator_adaptor<
+ strided_mock_iterator<BaseIterator,Category>
+ , BaseIterator
+ , boost::use_default
+ , Category
+ >
+ {
+ typedef boost::iterator_adaptor<
+ strided_mock_iterator
+ , BaseIterator
+ , boost::use_default
+ , Category
+ > super_t;
+ public:
+ explicit strided_mock_iterator(BaseIterator it)
+ : super_t(it)
+ {
+ }
+
+ private:
+ void increment()
+ {
+ ++(this->base_reference());
+ }
+
+ bool equal(const strided_mock_iterator& other) const
+ {
+ return this->base() == other.base();
+ }
+
+ BOOST_DEDUCED_TYPENAME super_t::reference dereference() const
+ {
+ return *(this->base());
+ }
+
+ friend class boost::iterator_core_access;
+ };
+
+ template<typename Category, typename Range>
+ boost::iterator_range<strided_mock_iterator<BOOST_DEDUCED_TYPENAME boost::range_iterator<Range>::type, Category> >
+ as_mock_range(Range& rng)
+ {
+ typedef BOOST_DEDUCED_TYPENAME boost::range_iterator<Range>::type range_iter_t;
+ typedef strided_mock_iterator<range_iter_t, Category> mock_iter_t;
+
+ return boost::iterator_range<mock_iter_t>(
+ mock_iter_t(boost::begin(rng)),
+ mock_iter_t(boost::end(rng)));
+ }
+
+ void strided_test_traversal()
+ {
+ using namespace boost::assign;
+
+ std::vector<int> v;
+ for (int i = 0; i < 30; ++i)
+ v.push_back(i);
+
+ std::vector<int> reference;
+ reference += 0,4,8,12,16,20,24,28;
+
+ std::vector<int> output;
+ boost::push_back(output, as_mock_range<boost::forward_traversal_tag>(v) | boost::adaptors::strided(4));
+
+ BOOST_CHECK_EQUAL_COLLECTIONS( reference.begin(), reference.end(),
+ output.begin(), output.end() );
+
+ output.clear();
+ boost::push_back(output, as_mock_range<boost::bidirectional_traversal_tag>(v) | boost::adaptors::strided(4));
+
+ BOOST_CHECK_EQUAL_COLLECTIONS( reference.begin(), reference.end(),
+ output.begin(), output.end() );
+
+ output.clear();
+ boost::push_back(output, as_mock_range<boost::random_access_traversal_tag>(v) | boost::adaptors::strided(4));
+
+ BOOST_CHECK_EQUAL_COLLECTIONS( reference.begin(), reference.end(),
+ output.begin(), output.end() );
}
}
}
@@ -106,6 +270,8 @@
= BOOST_TEST_SUITE( "RangeTestSuite.adaptor.strided" );
test->add( BOOST_TEST_CASE( &boost::strided_test ) );
+ test->add( BOOST_TEST_CASE( &boost::strided_defect_Trac5014 ) );
+ test->add( BOOST_TEST_CASE( &boost::strided_test_traversal ) );
return test;
}
Modified: branches/release/libs/range/test/adaptors.cpp
==============================================================================
--- branches/release/libs/range/test/adaptors.cpp (original)
+++ branches/release/libs/range/test/adaptors.cpp 2010-12-26 10:13:43 EST (Sun, 26 Dec 2010)
@@ -67,9 +67,8 @@
}
-
template< class Rng >
-void check()
+void check_direct()
{
using namespace boost::adaptors;
@@ -104,7 +103,6 @@
}
-
template< class IndirectRng >
void check_indirect()
{
@@ -189,8 +187,8 @@
void check_adaptors()
{
- check< std::vector<int> >();
- check< std::list<int> >();
+ check_direct< std::vector<int> >();
+ check_direct< std::list<int> >();
check_indirect< std::vector<int*> >();
check_indirect< std::list<int*> >();
Modified: branches/release/libs/range/test/algorithm_test/count_if.cpp
==============================================================================
--- branches/release/libs/range/test/algorithm_test/count_if.cpp (original)
+++ branches/release/libs/range/test/algorithm_test/count_if.cpp 2010-12-26 10:13:43 EST (Sun, 26 Dec 2010)
@@ -72,9 +72,9 @@
BOOST_CHECK_EQUAL( 0u, boost::count_if(cref_cont, false_predicate()) );
BOOST_CHECK_EQUAL( 0u, boost::count_if(boost::make_iterator_range(cont), false_predicate()) );
- BOOST_CHECK_EQUAL( cont.size(), boost::count_if(cont, true_predicate()) );
- BOOST_CHECK_EQUAL( cont.size(), boost::count_if(cref_cont, true_predicate()) );
- BOOST_CHECK_EQUAL( cont.size(), boost::count_if(boost::make_iterator_range(cont), true_predicate()) );
+ BOOST_CHECK_EQUAL( boost::size(cont), boost::count_if(cont, true_predicate()) );
+ BOOST_CHECK_EQUAL( boost::size(cont), boost::count_if(cref_cont, true_predicate()) );
+ BOOST_CHECK_EQUAL( boost::size(cont), boost::count_if(boost::make_iterator_range(cont), true_predicate()) );
}
void test_count_if()
Modified: branches/release/libs/range/test/algorithm_test/search_n.cpp
==============================================================================
--- branches/release/libs/range/test/algorithm_test/search_n.cpp (original)
+++ branches/release/libs/range/test/algorithm_test/search_n.cpp 2010-12-26 10:13:43 EST (Sun, 26 Dec 2010)
@@ -21,6 +21,104 @@
namespace
{
+ template<typename ForwardIterator, typename Integer, typename Value>
+ inline ForwardIterator
+ reference_search_n(ForwardIterator first, ForwardIterator last,
+ Integer count, const Value& value)
+ {
+ if (count <= 0)
+ return first;
+ else if (count == 1)
+ return std::find(first, last, value);
+ else
+ {
+ first = std::find(first, last, value);
+ while (first != last)
+ {
+ typename std::iterator_traits<ForwardIterator>::difference_type n = count;
+ ForwardIterator i = first;
+ ++i;
+ while (i != last && n != 1 && *i==value)
+ {
+ ++i;
+ --n;
+ }
+ if (n == 1)
+ return first;
+ if (i == last)
+ return last;
+ first = std::find(++i, last, value);
+ }
+ }
+ return last;
+ }
+
+ template<typename ForwardIterator, typename Integer, typename Value,
+ typename BinaryPredicate>
+ inline ForwardIterator
+ reference_search_n(ForwardIterator first, ForwardIterator last,
+ Integer count, const Value& value,
+ BinaryPredicate pred)
+ {
+ typedef typename std::iterator_traits<ForwardIterator>::iterator_category cat_t;
+
+ if (count <= 0)
+ return first;
+ if (count == 1)
+ {
+ while (first != last && !static_cast<bool>(pred(*first, value)))
+ ++first;
+ return first;
+ }
+ else
+ {
+ typedef typename std::iterator_traits<ForwardIterator>::difference_type difference_t;
+
+ while (first != last && !static_cast<bool>(pred(*first, value)))
+ ++first;
+
+ while (first != last)
+ {
+ difference_t n = count;
+ ForwardIterator i = first;
+ ++i;
+ while (i != last && n != 1 && static_cast<bool>(pred(*i, value)))
+ {
+ ++i;
+ --n;
+ }
+ if (n == 1)
+ return first;
+ if (i == last)
+ return last;
+ first = ++i;
+ while (first != last && !static_cast<bool>(pred(*first, value)))
+ ++first;
+ }
+ }
+ return last;
+ }
+
+ template< class Container1, class Value, class Pred >
+ void test_search_n_pred_impl(Container1& cont1, Value value, Pred pred)
+ {
+ typedef BOOST_DEDUCED_TYPENAME Container1::const_iterator const_iterator1_t;
+ typedef BOOST_DEDUCED_TYPENAME Container1::iterator iterator1_t;
+
+ const Container1& ccont1 = cont1;
+
+ for (std::size_t n = 0; n < cont1.size(); ++n)
+ {
+ iterator1_t it = boost::search_n(cont1, n, value, pred);
+ BOOST_CHECK( it == boost::search_n(boost::make_iterator_range(cont1), n, value, pred) );
+ BOOST_CHECK( it == reference_search_n(cont1.begin(), cont1.end(), n, value, pred) );
+
+ const_iterator1_t cit = boost::search_n(ccont1, n, value, pred);
+ BOOST_CHECK( cit == boost::search_n(boost::make_iterator_range(ccont1), n, value, pred) );
+ BOOST_CHECK( cit == reference_search_n(ccont1.begin(), ccont1.end(), n, value, pred) );
+ }
+ }
+
template< class Container1, class Value >
void test_search_n_impl(Container1& cont1, Value value)
{
@@ -33,12 +131,17 @@
{
iterator1_t it = boost::search_n(cont1, n, value);
BOOST_CHECK( it == boost::search_n(boost::make_iterator_range(cont1), n, value) );
- BOOST_CHECK( it == std::search_n(cont1.begin(), cont1.end(), n, value) );
+ BOOST_CHECK( it == reference_search_n(cont1.begin(), cont1.end(), n, value) );
const_iterator1_t cit = boost::search_n(ccont1, n, value);
BOOST_CHECK( cit == boost::search_n(boost::make_iterator_range(ccont1), n, value) );
- BOOST_CHECK( cit == std::search_n(ccont1.begin(), ccont1.end(), n, value) );
+ BOOST_CHECK( cit == reference_search_n(ccont1.begin(), ccont1.end(), n, value) );
}
+
+ test_search_n_pred_impl(cont1, value, std::less<int>());
+ test_search_n_pred_impl(cont1, value, std::greater<int>());
+ test_search_n_pred_impl(cont1, value, std::equal_to<int>());
+ test_search_n_pred_impl(cont1, value, std::not_equal_to<int>());
}
template< class Container1, class Container2 >
Deleted: branches/release/libs/range/test/replace_copy.cpp
==============================================================================
Modified: branches/release/libs/range/test/string.cpp
==============================================================================
--- branches/release/libs/range/test/string.cpp (original)
+++ branches/release/libs/range/test/string.cpp 2010-12-26 10:13:43 EST (Sun, 26 Dec 2010)
@@ -42,7 +42,7 @@
typedef std::size_t size_type;
typedef value_type array_t[Length];
typedef const value_type const_array_t[Length];
-
+
explicit test_string(const CharT literal_sz[])
{
std::copy(literal_sz, literal_sz + Length, m_buffer.data());
@@ -62,35 +62,35 @@
inline BOOST_DEDUCED_TYPENAME boost::range_iterator<T>::type
str_begin( T& r )
{
- return boost::begin( boost::as_literal(r) );
+ return boost::begin( boost::as_literal(r) );
}
template< class T >
inline BOOST_DEDUCED_TYPENAME boost::range_iterator<T>::type
str_end( T& r )
{
- return boost::end( boost::as_literal(r) );
+ return boost::end( boost::as_literal(r) );
}
template< class T >
-inline BOOST_DEDUCED_TYPENAME boost::range_size<T>::type
+inline BOOST_DEDUCED_TYPENAME boost::range_difference<T>::type
str_size( const T& r )
{
- return boost::size( boost::as_literal(r) );
+ return boost::size( boost::as_literal(r) );
}
template< class T >
inline bool
str_empty( T& r )
{
- return boost::empty( boost::as_literal(r) );
+ return boost::empty( boost::as_literal(r) );
}
template< typename Container, typename T >
BOOST_DEDUCED_TYPENAME boost::range_iterator<Container>::type
find( Container& c, T value )
{
- return std::find( str_begin(c), str_end(c),
+ return std::find( str_begin(c), str_end(c),
value );
}
@@ -98,16 +98,16 @@
BOOST_DEDUCED_TYPENAME boost::range_iterator<const Container>::type
find( const Container& c, T value )
{
- return std::find( str_begin(c), str_end(c),
+ return std::find( str_begin(c), str_end(c),
value );
}
template< typename Container, typename T >
BOOST_DEDUCED_TYPENAME boost::range_iterator<Container>::type
find_mutable( Container& c, T value )
-{
+{
str_size( c );
- return std::find( str_begin(c), str_end(c),
+ return std::find( str_begin(c), str_end(c),
value );
}
@@ -116,15 +116,15 @@
find_const( const Container& c, T value )
{
str_size( c );
- return std::find( str_begin(c), str_end(c),
+ return std::find( str_begin(c), str_end(c),
value );
}
-std::vector<char>
+std::vector<char>
check_rvalue_return()
{
- return std::vector<char>( 10, 'm' );
+ return std::vector<char>( 10, 'm' );
}
using namespace boost;
@@ -132,44 +132,45 @@
void check_char()
{
+ typedef boost::range_difference<std::string>::type diff_t;
typedef char* char_iterator_t;
typedef char char_array_t[10];
-
+
test_string<char, 8> a_string("a string");
test_string<char, 14> another_string("another string");
const char* char_s = a_string.const_sz();
char my_string[] = "another_string";
const char my_const_string[] = "another string";
- const unsigned my_string_length = 14;
+ const diff_t my_string_length = 14;
char* char_s2 = a_string.mutable_sz();
-
- BOOST_STATIC_ASSERT(( is_same< range_value<char_iterator_t>::type,
+
+ BOOST_STATIC_ASSERT(( is_same< range_value<char_iterator_t>::type,
detail::iterator_traits<char_iterator_t>::value_type>::value ));
BOOST_STATIC_ASSERT(( is_same< range_iterator<char_iterator_t>::type, char_iterator_t >::value ));
- BOOST_STATIC_ASSERT(( is_same< range_difference<char_iterator_t>::type,
+ BOOST_STATIC_ASSERT(( is_same< range_difference<char_iterator_t>::type,
::std::ptrdiff_t >::value ));
BOOST_STATIC_ASSERT(( is_same< range_size<char_iterator_t>::type, std::size_t >::value ));
BOOST_STATIC_ASSERT(( is_same< range_iterator<char_iterator_t>::type, char_iterator_t >::value ));
BOOST_STATIC_ASSERT(( is_same< range_iterator<const char*>::type, const char* >::value ));
-
- BOOST_STATIC_ASSERT(( is_same< range_value<char_array_t>::type,
+
+ BOOST_STATIC_ASSERT(( is_same< range_value<char_array_t>::type,
char>::value ));
BOOST_STATIC_ASSERT(( is_same< range_iterator<char_array_t>::type, char* >::value ));
BOOST_STATIC_ASSERT(( is_same< range_iterator<const char_array_t>::type, const char* >::value ));
- BOOST_STATIC_ASSERT(( is_same< range_difference<char_array_t>::type,
+ BOOST_STATIC_ASSERT(( is_same< range_difference<char_array_t>::type,
::std::ptrdiff_t >::value ));
BOOST_STATIC_ASSERT(( is_same< range_size<char_array_t>::type, std::size_t >::value ));
BOOST_STATIC_ASSERT(( is_same< range_iterator<char_array_t>::type, char* >::value ));
BOOST_STATIC_ASSERT(( is_same< range_iterator<const char_array_t>::type, const char* >::value ));
BOOST_CHECK_EQUAL( str_begin( char_s ), char_s );
- std::size_t sz = str_size(char_s);
- const char* str_end1 = str_begin( char_s ) + sz;
+ const diff_t sz = str_size(char_s);
+ const char* str_end1 = str_begin( char_s ) + sz;
BOOST_CHECK_EQUAL( str_end( char_s ), str_end1 );
BOOST_CHECK_EQUAL( str_empty( char_s ), (char_s == 0 || char_s[0] == char()) );
- BOOST_CHECK_EQUAL( sz, std::char_traits<char>::length( char_s ) );
+ BOOST_CHECK_EQUAL( sz, static_cast<diff_t>(std::char_traits<char>::length(char_s)) );
BOOST_CHECK_EQUAL( str_begin( my_string ), my_string );
range_iterator<char_array_t>::type str_end2 = str_begin( my_string ) + str_size(my_string);
@@ -177,7 +178,7 @@
BOOST_CHECK_EQUAL( str_end3, str_end2 );
BOOST_CHECK_EQUAL( str_empty( my_string ), (my_string == 0 || my_string[0] == char()) );
BOOST_CHECK_EQUAL( str_size( my_string ), my_string_length );
- BOOST_CHECK_EQUAL( str_size( my_string ), std::char_traits<char>::length( my_string ) );
+ BOOST_CHECK_EQUAL( str_size( my_string ), static_cast<diff_t>(std::char_traits<char>::length(my_string)) );
char to_search = 'n';
BOOST_CHECK( find_mutable( char_s, to_search ) != str_end( char_s ) );
@@ -186,7 +187,7 @@
BOOST_CHECK( find_mutable( my_string, to_search ) != str_end(my_string) );
BOOST_CHECK( find_const( my_string, to_search ) != str_end(my_string) );
- BOOST_CHECK( find_mutable( char_s2, to_search ) != str_end(char_s) );
+ BOOST_CHECK( find_mutable( char_s2, to_search ) != str_end(char_s) );
BOOST_CHECK( find_const( char_s2, to_search ) != str_end(char_s2) );
BOOST_CHECK( find_const( as_array( my_string ), to_search ) != str_end(my_string) );
@@ -212,32 +213,33 @@
void check_string()
{
check_char();
-
+
#ifndef BOOST_NO_STD_WSTRING
typedef wchar_t* wchar_iterator_t;
test_string<wchar_t, 13> a_wide_string(L"a wide string");
test_string<wchar_t, 19> another_wide_string(L"another wide string");
-
+
const wchar_t* char_ws = a_wide_string.const_sz();
wchar_t my_wstring[] = L"another wide string";
wchar_t* char_ws2 = a_wide_string.mutable_sz();
-
- BOOST_STATIC_ASSERT(( is_same< range_value<wchar_iterator_t>::type,
+
+ BOOST_STATIC_ASSERT(( is_same< range_value<wchar_iterator_t>::type,
detail::iterator_traits<wchar_iterator_t>::value_type>::value ));
BOOST_STATIC_ASSERT(( is_same< range_iterator<wchar_iterator_t>::type, wchar_iterator_t >::value ));
BOOST_STATIC_ASSERT(( is_same< range_iterator<const wchar_t*>::type, const wchar_t* >::value ));
- BOOST_STATIC_ASSERT(( is_same< range_difference<wchar_iterator_t>::type,
+ BOOST_STATIC_ASSERT(( is_same< range_difference<wchar_iterator_t>::type,
detail::iterator_traits<wchar_iterator_t>::difference_type >::value ));
BOOST_STATIC_ASSERT(( is_same< range_size<wchar_iterator_t>::type, std::size_t >::value ));
BOOST_STATIC_ASSERT(( is_same< range_iterator<wchar_iterator_t>::type, wchar_iterator_t >::value ));
BOOST_STATIC_ASSERT(( is_same< range_iterator<const wchar_t*>::type, const wchar_t* >::value ));
-
- std::size_t sz = str_size( char_ws );
+
+ typedef boost::range_difference<std::wstring>::type diff_t;
+ const diff_t sz = str_size( char_ws );
BOOST_CHECK_EQUAL( str_begin( char_ws ), char_ws );
BOOST_CHECK_EQUAL( str_end(char_ws), (str_begin( char_ws ) + sz) );
BOOST_CHECK_EQUAL( str_empty( char_ws ), (char_ws == 0 || char_ws[0] == wchar_t()) );
- BOOST_CHECK_EQUAL( sz, std::char_traits<wchar_t>::length( char_ws ) );
+ BOOST_CHECK_EQUAL( sz, static_cast<diff_t>(std::char_traits<wchar_t>::length(char_ws)) );
wchar_t to_search = L'n';
BOOST_CHECK( find( char_ws, to_search ) != str_end(char_ws) );
@@ -250,10 +252,10 @@
#else
boost::ignore_unused_variable_warning( my_wstring );
-
-#endif
+
+#endif
#endif
-
+
find( check_rvalue_return(), 'n' );
}
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-12-26 10:13:43 EST (Sun, 26 Dec 2010)
@@ -26,7 +26,7 @@
struct check_results
{
template< class Container, class Iterator >
- static void check(
+ static void test(
Container& test,
Container& reference,
Iterator test_it,
@@ -43,7 +43,7 @@
struct check_results<return_found>
{
template< class Container, class Iterator >
- static void check(
+ static void test(
Container& test,
Container& reference,
Iterator test_it,
@@ -64,7 +64,7 @@
struct check_results<return_next>
{
template< class Container, class Iterator >
- static void check(
+ static void test(
Container& test,
Container& reference,
Iterator test_it,
@@ -93,7 +93,7 @@
struct check_results<return_prior>
{
template< class Container, class Iterator >
- static void check(
+ static void test(
Container& test,
Container& reference,
Iterator test_it,
@@ -122,7 +122,7 @@
struct check_results<return_begin_found>
{
template< class Container, class Iterator >
- static void check(
+ static void test(
Container& test,
Container& reference,
iterator_range<Iterator> test_rng,
@@ -149,7 +149,7 @@
struct check_results<return_begin_next>
{
template< class Container, class Iterator >
- static void check(
+ static void test(
Container& test,
Container& reference,
iterator_range<Iterator> test_rng,
@@ -182,7 +182,7 @@
struct check_results<return_begin_prior>
{
template< class Container, class Iterator >
- static void check(
+ static void test(
Container& test,
Container& reference,
iterator_range<Iterator> test_rng,
@@ -212,7 +212,7 @@
struct check_results<return_found_end>
{
template< class Container, class Iterator >
- static void check(
+ static void test(
Container& test,
Container& reference,
iterator_range<Iterator> test_rng,
@@ -236,7 +236,7 @@
struct check_results<return_next_end>
{
template< class Container, class Iterator >
- static void check(
+ static void test(
Container& test,
Container& reference,
iterator_range<Iterator> test_rng,
@@ -270,7 +270,7 @@
struct check_results<return_prior_end>
{
template< class Container, class Iterator >
- static void check(
+ static void test(
Container& test,
Container& reference,
iterator_range<Iterator> test_rng,
@@ -304,7 +304,7 @@
struct check_results<return_begin_end>
{
template< class Container, class Iterator >
- static void check(
+ static void test(
Container& test,
Container& reference,
iterator_range<Iterator> test_rng,
@@ -375,8 +375,8 @@
iterator_t range_result = policy.test_iter(test);
iterator_t reference_it = policy.reference(reference);
- check_results<return_found>::check(test, reference,
- range_result, reference_it);
+ check_results<return_found>::test(test, reference,
+ range_result, reference_it);
}
template< range_return_value result_type, class Container, class TestPolicy >
@@ -394,8 +394,8 @@
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,
- range_result, reference_it);
+ check_results<result_type>::test(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