[Boost-commit] svn:boost r61685 - in branches/release/libs/range/doc: . html html/range html/range/concepts html/range/history_ack html/range/library_headers html/range/reference html/range/reference/adaptors html/range/reference/adaptors/adaptors_reference html/range/reference/adaptors/reference html/range/reference/algorithms html/range/reference/algorithms/heap html/range/reference/algorithms/heap_algorithms html/range/reference/algorithms/mutating html/range/reference/algorithms/new html/range/reference/algorithms/non_mutating html/range/reference/algorithms/numeric html/range/reference/algorithms/permutation html/range/reference/algorithms/permutation_algorithms html/range/reference/algorithms/range_algorithm_mutating_algorithms html/range/reference/algorithms/range_algorithm_new_algorithms html/range/reference/algorithms/range_algorithm_non_mutating_algorithms html/range/reference/algorithms/range_numeric html/range/reference/algorithms/set html/range/reference/algorithms/set_algorithms html/range/reference/concept_implementation html/range/reference/concept_implementation/semantics html/range/reference/extending/method_3 html/range/reference/ranges html/range/reference/utilities html/range/upgrade html/range/utilities reference reference/adaptors reference/algorithm reference/algorithm_ext reference/ranges

Subject: [Boost-commit] svn:boost r61685 - in branches/release/libs/range/doc: . html html/range html/range/concepts html/range/history_ack html/range/library_headers html/range/reference html/range/reference/adaptors html/range/reference/adaptors/adaptors_reference html/range/reference/adaptors/reference html/range/reference/algorithms html/range/reference/algorithms/heap html/range/reference/algorithms/heap_algorithms html/range/reference/algorithms/mutating html/range/reference/algorithms/new html/range/reference/algorithms/non_mutating html/range/reference/algorithms/numeric html/range/reference/algorithms/permutation html/range/reference/algorithms/permutation_algorithms html/range/reference/algorithms/range_algorithm_mutating_algorithms html/range/reference/algorithms/range_algorithm_new_algorithms html/range/reference/algorithms/range_algorithm_non_mutating_algorithms html/range/reference/algorithms/range_numeric html/range/reference/algorithms/set html/range/reference/algorithms/set_algorithms html/range/reference/concept_implementation html/range/reference/concept_implementation/semantics html/range/reference/extending/method_3 html/range/reference/ranges html/range/reference/utilities html/range/upgrade html/range/utilities reference reference/adaptors reference/algorithm reference/algorithm_ext reference/ranges
From: neil_at_[hidden]
Date: 2010-04-29 17:19:07

Author: neilgroves
Date: 2010-04-29 17:18:58 EDT (Thu, 29 Apr 2010)
New Revision: 61685
URL: http://svn.boost.org/trac/boost/changeset/61685

Log:
Boost.Range documentation merge from the trunk. Corrects inconsitency with return types, Range Return Categories etc.
Added:
   branches/release/libs/range/doc/html/range/history_ack/
      - copied from r61653, /trunk/libs/range/doc/html/range/history_ack/
   branches/release/libs/range/doc/html/range/library_headers/
      - copied from r61653, /trunk/libs/range/doc/html/range/library_headers/
   branches/release/libs/range/doc/html/range/library_headers/adaptors.html
      - copied unchanged from r61653, /trunk/libs/range/doc/html/range/library_headers/adaptors.html
   branches/release/libs/range/doc/html/range/library_headers/algorithm.html
      - copied unchanged from r61653, /trunk/libs/range/doc/html/range/library_headers/algorithm.html
   branches/release/libs/range/doc/html/range/library_headers/algorithm_extensions.html
      - copied unchanged from r61653, /trunk/libs/range/doc/html/range/library_headers/algorithm_extensions.html
   branches/release/libs/range/doc/html/range/library_headers/general.html
      - copied unchanged from r61653, /trunk/libs/range/doc/html/range/library_headers/general.html
   branches/release/libs/range/doc/html/range/reference/adaptors/general_requirements.html
      - copied unchanged from r61653, /trunk/libs/range/doc/html/range/reference/adaptors/general_requirements.html
   branches/release/libs/range/doc/html/range/reference/adaptors/introduction.html
      - copied unchanged from r61653, /trunk/libs/range/doc/html/range/reference/adaptors/introduction.html
   branches/release/libs/range/doc/html/range/reference/adaptors/reference/
      - copied from r61653, /trunk/libs/range/doc/html/range/reference/adaptors/reference/
   branches/release/libs/range/doc/html/range/reference/adaptors/reference.html
      - copied unchanged from r61653, /trunk/libs/range/doc/html/range/reference/adaptors/reference.html
   branches/release/libs/range/doc/html/range/reference/adaptors/reference/adjacent_filtered.html
      - copied unchanged from r61653, /trunk/libs/range/doc/html/range/reference/adaptors/reference/adjacent_filtered.html
   branches/release/libs/range/doc/html/range/reference/adaptors/reference/copied.html
      - copied unchanged from r61653, /trunk/libs/range/doc/html/range/reference/adaptors/reference/copied.html
   branches/release/libs/range/doc/html/range/reference/adaptors/reference/filtered.html
      - copied unchanged from r61653, /trunk/libs/range/doc/html/range/reference/adaptors/reference/filtered.html
   branches/release/libs/range/doc/html/range/reference/adaptors/reference/indexed.html
      - copied unchanged from r61653, /trunk/libs/range/doc/html/range/reference/adaptors/reference/indexed.html
   branches/release/libs/range/doc/html/range/reference/adaptors/reference/indirected.html
      - copied unchanged from r61653, /trunk/libs/range/doc/html/range/reference/adaptors/reference/indirected.html
   branches/release/libs/range/doc/html/range/reference/adaptors/reference/map_keys.html
      - copied unchanged from r61653, /trunk/libs/range/doc/html/range/reference/adaptors/reference/map_keys.html
   branches/release/libs/range/doc/html/range/reference/adaptors/reference/map_values.html
      - copied unchanged from r61653, /trunk/libs/range/doc/html/range/reference/adaptors/reference/map_values.html
   branches/release/libs/range/doc/html/range/reference/adaptors/reference/replaced.html
      - copied unchanged from r61653, /trunk/libs/range/doc/html/range/reference/adaptors/reference/replaced.html
   branches/release/libs/range/doc/html/range/reference/adaptors/reference/replaced_if.html
      - copied unchanged from r61653, /trunk/libs/range/doc/html/range/reference/adaptors/reference/replaced_if.html
   branches/release/libs/range/doc/html/range/reference/adaptors/reference/reversed.html
      - copied unchanged from r61653, /trunk/libs/range/doc/html/range/reference/adaptors/reference/reversed.html
   branches/release/libs/range/doc/html/range/reference/adaptors/reference/sliced.html
      - copied unchanged from r61653, /trunk/libs/range/doc/html/range/reference/adaptors/reference/sliced.html
   branches/release/libs/range/doc/html/range/reference/adaptors/reference/strided.html
      - copied unchanged from r61653, /trunk/libs/range/doc/html/range/reference/adaptors/reference/strided.html
   branches/release/libs/range/doc/html/range/reference/adaptors/reference/tokenized.html
      - copied unchanged from r61653, /trunk/libs/range/doc/html/range/reference/adaptors/reference/tokenized.html
   branches/release/libs/range/doc/html/range/reference/adaptors/reference/transformed.html
      - copied unchanged from r61653, /trunk/libs/range/doc/html/range/reference/adaptors/reference/transformed.html
   branches/release/libs/range/doc/html/range/reference/adaptors/reference/uniqued.html
      - copied unchanged from r61653, /trunk/libs/range/doc/html/range/reference/adaptors/reference/uniqued.html
   branches/release/libs/range/doc/html/range/reference/algorithms/heap/
      - copied from r61653, /trunk/libs/range/doc/html/range/reference/algorithms/heap/
   branches/release/libs/range/doc/html/range/reference/algorithms/heap.html
      - copied unchanged from r61653, /trunk/libs/range/doc/html/range/reference/algorithms/heap.html
   branches/release/libs/range/doc/html/range/reference/algorithms/heap/make_heap.html
      - copied unchanged from r61653, /trunk/libs/range/doc/html/range/reference/algorithms/heap/make_heap.html
   branches/release/libs/range/doc/html/range/reference/algorithms/heap/pop_heap.html
      - copied unchanged from r61653, /trunk/libs/range/doc/html/range/reference/algorithms/heap/pop_heap.html
   branches/release/libs/range/doc/html/range/reference/algorithms/heap/push_heap.html
      - copied unchanged from r61653, /trunk/libs/range/doc/html/range/reference/algorithms/heap/push_heap.html
   branches/release/libs/range/doc/html/range/reference/algorithms/heap/sort_heap.html
      - copied unchanged from r61653, /trunk/libs/range/doc/html/range/reference/algorithms/heap/sort_heap.html
   branches/release/libs/range/doc/html/range/reference/algorithms/mutating/
      - copied from r61653, /trunk/libs/range/doc/html/range/reference/algorithms/mutating/
   branches/release/libs/range/doc/html/range/reference/algorithms/mutating.html
      - copied unchanged from r61653, /trunk/libs/range/doc/html/range/reference/algorithms/mutating.html
   branches/release/libs/range/doc/html/range/reference/algorithms/mutating/copy.html
      - copied unchanged from r61653, /trunk/libs/range/doc/html/range/reference/algorithms/mutating/copy.html
   branches/release/libs/range/doc/html/range/reference/algorithms/mutating/copy_backward.html
      - copied unchanged from r61653, /trunk/libs/range/doc/html/range/reference/algorithms/mutating/copy_backward.html
   branches/release/libs/range/doc/html/range/reference/algorithms/mutating/fill.html
      - copied unchanged from r61653, /trunk/libs/range/doc/html/range/reference/algorithms/mutating/fill.html
   branches/release/libs/range/doc/html/range/reference/algorithms/mutating/fill_n.html
      - copied unchanged from r61653, /trunk/libs/range/doc/html/range/reference/algorithms/mutating/fill_n.html
   branches/release/libs/range/doc/html/range/reference/algorithms/mutating/generate.html
      - copied unchanged from r61653, /trunk/libs/range/doc/html/range/reference/algorithms/mutating/generate.html
   branches/release/libs/range/doc/html/range/reference/algorithms/mutating/inplace_merge.html
      - copied unchanged from r61653, /trunk/libs/range/doc/html/range/reference/algorithms/mutating/inplace_merge.html
   branches/release/libs/range/doc/html/range/reference/algorithms/mutating/merge.html
      - copied unchanged from r61653, /trunk/libs/range/doc/html/range/reference/algorithms/mutating/merge.html
   branches/release/libs/range/doc/html/range/reference/algorithms/mutating/nth_element.html
      - copied unchanged from r61653, /trunk/libs/range/doc/html/range/reference/algorithms/mutating/nth_element.html
   branches/release/libs/range/doc/html/range/reference/algorithms/mutating/partial_sort.html
      - copied unchanged from r61653, /trunk/libs/range/doc/html/range/reference/algorithms/mutating/partial_sort.html
   branches/release/libs/range/doc/html/range/reference/algorithms/mutating/partition.html
      - copied unchanged from r61653, /trunk/libs/range/doc/html/range/reference/algorithms/mutating/partition.html
   branches/release/libs/range/doc/html/range/reference/algorithms/mutating/random_shuffle.html
      - copied unchanged from r61653, /trunk/libs/range/doc/html/range/reference/algorithms/mutating/random_shuffle.html
   branches/release/libs/range/doc/html/range/reference/algorithms/mutating/remove.html
      - copied unchanged from r61653, /trunk/libs/range/doc/html/range/reference/algorithms/mutating/remove.html
   branches/release/libs/range/doc/html/range/reference/algorithms/mutating/remove_copy.html
      - copied unchanged from r61653, /trunk/libs/range/doc/html/range/reference/algorithms/mutating/remove_copy.html
   branches/release/libs/range/doc/html/range/reference/algorithms/mutating/remove_copy_if.html
      - copied unchanged from r61653, /trunk/libs/range/doc/html/range/reference/algorithms/mutating/remove_copy_if.html
   branches/release/libs/range/doc/html/range/reference/algorithms/mutating/remove_if.html
      - copied unchanged from r61653, /trunk/libs/range/doc/html/range/reference/algorithms/mutating/remove_if.html
   branches/release/libs/range/doc/html/range/reference/algorithms/mutating/replace.html
      - copied unchanged from r61653, /trunk/libs/range/doc/html/range/reference/algorithms/mutating/replace.html
   branches/release/libs/range/doc/html/range/reference/algorithms/mutating/replace_copy.html
      - copied unchanged from r61653, /trunk/libs/range/doc/html/range/reference/algorithms/mutating/replace_copy.html
   branches/release/libs/range/doc/html/range/reference/algorithms/mutating/replace_copy_if.html
      - copied unchanged from r61653, /trunk/libs/range/doc/html/range/reference/algorithms/mutating/replace_copy_if.html
   branches/release/libs/range/doc/html/range/reference/algorithms/mutating/replace_if.html
      - copied unchanged from r61653, /trunk/libs/range/doc/html/range/reference/algorithms/mutating/replace_if.html
   branches/release/libs/range/doc/html/range/reference/algorithms/mutating/reverse.html
      - copied unchanged from r61653, /trunk/libs/range/doc/html/range/reference/algorithms/mutating/reverse.html
   branches/release/libs/range/doc/html/range/reference/algorithms/mutating/reverse_copy.html
      - copied unchanged from r61653, /trunk/libs/range/doc/html/range/reference/algorithms/mutating/reverse_copy.html
   branches/release/libs/range/doc/html/range/reference/algorithms/mutating/rotate.html
      - copied unchanged from r61653, /trunk/libs/range/doc/html/range/reference/algorithms/mutating/rotate.html
   branches/release/libs/range/doc/html/range/reference/algorithms/mutating/rotate_copy.html
      - copied unchanged from r61653, /trunk/libs/range/doc/html/range/reference/algorithms/mutating/rotate_copy.html
   branches/release/libs/range/doc/html/range/reference/algorithms/mutating/sort.html
      - copied unchanged from r61653, /trunk/libs/range/doc/html/range/reference/algorithms/mutating/sort.html
   branches/release/libs/range/doc/html/range/reference/algorithms/mutating/stable_partition.html
      - copied unchanged from r61653, /trunk/libs/range/doc/html/range/reference/algorithms/mutating/stable_partition.html
   branches/release/libs/range/doc/html/range/reference/algorithms/mutating/stable_sort.html
      - copied unchanged from r61653, /trunk/libs/range/doc/html/range/reference/algorithms/mutating/stable_sort.html
   branches/release/libs/range/doc/html/range/reference/algorithms/mutating/swap_ranges.html
      - copied unchanged from r61653, /trunk/libs/range/doc/html/range/reference/algorithms/mutating/swap_ranges.html
   branches/release/libs/range/doc/html/range/reference/algorithms/mutating/transform.html
      - copied unchanged from r61653, /trunk/libs/range/doc/html/range/reference/algorithms/mutating/transform.html
   branches/release/libs/range/doc/html/range/reference/algorithms/mutating/unique.html
      - copied unchanged from r61653, /trunk/libs/range/doc/html/range/reference/algorithms/mutating/unique.html
   branches/release/libs/range/doc/html/range/reference/algorithms/mutating/unique_copy.html
      - copied unchanged from r61653, /trunk/libs/range/doc/html/range/reference/algorithms/mutating/unique_copy.html
   branches/release/libs/range/doc/html/range/reference/algorithms/new/
      - copied from r61653, /trunk/libs/range/doc/html/range/reference/algorithms/new/
   branches/release/libs/range/doc/html/range/reference/algorithms/new.html
      - copied unchanged from r61653, /trunk/libs/range/doc/html/range/reference/algorithms/new.html
   branches/release/libs/range/doc/html/range/reference/algorithms/new/copy_n.html
      - copied unchanged from r61653, /trunk/libs/range/doc/html/range/reference/algorithms/new/copy_n.html
   branches/release/libs/range/doc/html/range/reference/algorithms/new/erase.html
      - copied unchanged from r61653, /trunk/libs/range/doc/html/range/reference/algorithms/new/erase.html
   branches/release/libs/range/doc/html/range/reference/algorithms/new/for_each.html
      - copied unchanged from r61653, /trunk/libs/range/doc/html/range/reference/algorithms/new/for_each.html
   branches/release/libs/range/doc/html/range/reference/algorithms/new/insert.html
      - copied unchanged from r61653, /trunk/libs/range/doc/html/range/reference/algorithms/new/insert.html
   branches/release/libs/range/doc/html/range/reference/algorithms/new/iota.html
      - copied unchanged from r61653, /trunk/libs/range/doc/html/range/reference/algorithms/new/iota.html
   branches/release/libs/range/doc/html/range/reference/algorithms/new/is_sorted.html
      - copied unchanged from r61653, /trunk/libs/range/doc/html/range/reference/algorithms/new/is_sorted.html
   branches/release/libs/range/doc/html/range/reference/algorithms/new/overwrite.html
      - copied unchanged from r61653, /trunk/libs/range/doc/html/range/reference/algorithms/new/overwrite.html
   branches/release/libs/range/doc/html/range/reference/algorithms/new/push_back.html
      - copied unchanged from r61653, /trunk/libs/range/doc/html/range/reference/algorithms/new/push_back.html
   branches/release/libs/range/doc/html/range/reference/algorithms/new/push_front.html
      - copied unchanged from r61653, /trunk/libs/range/doc/html/range/reference/algorithms/new/push_front.html
   branches/release/libs/range/doc/html/range/reference/algorithms/new/remove_erase.html
      - copied unchanged from r61653, /trunk/libs/range/doc/html/range/reference/algorithms/new/remove_erase.html
   branches/release/libs/range/doc/html/range/reference/algorithms/new/remove_erase_if.html
      - copied unchanged from r61653, /trunk/libs/range/doc/html/range/reference/algorithms/new/remove_erase_if.html
   branches/release/libs/range/doc/html/range/reference/algorithms/non.html
      - copied unchanged from r61653, /trunk/libs/range/doc/html/range/reference/algorithms/non.html
   branches/release/libs/range/doc/html/range/reference/algorithms/non_mutating/
      - copied from r61653, /trunk/libs/range/doc/html/range/reference/algorithms/non_mutating/
   branches/release/libs/range/doc/html/range/reference/algorithms/non_mutating.html
      - copied unchanged from r61653, /trunk/libs/range/doc/html/range/reference/algorithms/non_mutating.html
   branches/release/libs/range/doc/html/range/reference/algorithms/non_mutating/adjacent_find.html
      - copied unchanged from r61653, /trunk/libs/range/doc/html/range/reference/algorithms/non_mutating/adjacent_find.html
   branches/release/libs/range/doc/html/range/reference/algorithms/non_mutating/binary_search.html
      - copied unchanged from r61653, /trunk/libs/range/doc/html/range/reference/algorithms/non_mutating/binary_search.html
   branches/release/libs/range/doc/html/range/reference/algorithms/non_mutating/count.html
      - copied unchanged from r61653, /trunk/libs/range/doc/html/range/reference/algorithms/non_mutating/count.html
   branches/release/libs/range/doc/html/range/reference/algorithms/non_mutating/count_if.html
      - copied unchanged from r61653, /trunk/libs/range/doc/html/range/reference/algorithms/non_mutating/count_if.html
   branches/release/libs/range/doc/html/range/reference/algorithms/non_mutating/equal.html
      - copied unchanged from r61653, /trunk/libs/range/doc/html/range/reference/algorithms/non_mutating/equal.html
   branches/release/libs/range/doc/html/range/reference/algorithms/non_mutating/equal_range.html
      - copied unchanged from r61653, /trunk/libs/range/doc/html/range/reference/algorithms/non_mutating/equal_range.html
   branches/release/libs/range/doc/html/range/reference/algorithms/non_mutating/find.html
      - copied unchanged from r61653, /trunk/libs/range/doc/html/range/reference/algorithms/non_mutating/find.html
   branches/release/libs/range/doc/html/range/reference/algorithms/non_mutating/find_end.html
      - copied unchanged from r61653, /trunk/libs/range/doc/html/range/reference/algorithms/non_mutating/find_end.html
   branches/release/libs/range/doc/html/range/reference/algorithms/non_mutating/find_first_of.html
      - copied unchanged from r61653, /trunk/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_if.html
      - copied unchanged from r61653, /trunk/libs/range/doc/html/range/reference/algorithms/non_mutating/find_if.html
   branches/release/libs/range/doc/html/range/reference/algorithms/non_mutating/for_each.html
      - copied unchanged from r61653, /trunk/libs/range/doc/html/range/reference/algorithms/non_mutating/for_each.html
   branches/release/libs/range/doc/html/range/reference/algorithms/non_mutating/lexicographical_compare.html
      - copied unchanged from r61653, /trunk/libs/range/doc/html/range/reference/algorithms/non_mutating/lexicographical_compare.html
   branches/release/libs/range/doc/html/range/reference/algorithms/non_mutating/lower_bound.html
      - copied unchanged from r61653, /trunk/libs/range/doc/html/range/reference/algorithms/non_mutating/lower_bound.html
   branches/release/libs/range/doc/html/range/reference/algorithms/non_mutating/max_element.html
      - copied unchanged from r61653, /trunk/libs/range/doc/html/range/reference/algorithms/non_mutating/max_element.html
   branches/release/libs/range/doc/html/range/reference/algorithms/non_mutating/min_element.html
      - copied unchanged from r61653, /trunk/libs/range/doc/html/range/reference/algorithms/non_mutating/min_element.html
   branches/release/libs/range/doc/html/range/reference/algorithms/non_mutating/mismatch.html
      - copied unchanged from r61653, /trunk/libs/range/doc/html/range/reference/algorithms/non_mutating/mismatch.html
   branches/release/libs/range/doc/html/range/reference/algorithms/non_mutating/search.html
      - copied unchanged from r61653, /trunk/libs/range/doc/html/range/reference/algorithms/non_mutating/search.html
   branches/release/libs/range/doc/html/range/reference/algorithms/non_mutating/search_n.html
      - copied unchanged from r61653, /trunk/libs/range/doc/html/range/reference/algorithms/non_mutating/search_n.html
   branches/release/libs/range/doc/html/range/reference/algorithms/non_mutating/upper_bound.html
      - copied unchanged from r61653, /trunk/libs/range/doc/html/range/reference/algorithms/non_mutating/upper_bound.html
   branches/release/libs/range/doc/html/range/reference/algorithms/numeric/
      - copied from r61653, /trunk/libs/range/doc/html/range/reference/algorithms/numeric/
   branches/release/libs/range/doc/html/range/reference/algorithms/numeric.html
      - copied unchanged from r61653, /trunk/libs/range/doc/html/range/reference/algorithms/numeric.html
   branches/release/libs/range/doc/html/range/reference/algorithms/numeric/accumulate.html
      - copied unchanged from r61653, /trunk/libs/range/doc/html/range/reference/algorithms/numeric/accumulate.html
   branches/release/libs/range/doc/html/range/reference/algorithms/numeric/adjacent_difference.html
      - copied unchanged from r61653, /trunk/libs/range/doc/html/range/reference/algorithms/numeric/adjacent_difference.html
   branches/release/libs/range/doc/html/range/reference/algorithms/numeric/inner_product.html
      - copied unchanged from r61653, /trunk/libs/range/doc/html/range/reference/algorithms/numeric/inner_product.html
   branches/release/libs/range/doc/html/range/reference/algorithms/numeric/partial_sum.html
      - copied unchanged from r61653, /trunk/libs/range/doc/html/range/reference/algorithms/numeric/partial_sum.html
   branches/release/libs/range/doc/html/range/reference/algorithms/permutation/
      - copied from r61653, /trunk/libs/range/doc/html/range/reference/algorithms/permutation/
   branches/release/libs/range/doc/html/range/reference/algorithms/permutation.html
      - copied unchanged from r61653, /trunk/libs/range/doc/html/range/reference/algorithms/permutation.html
   branches/release/libs/range/doc/html/range/reference/algorithms/permutation/next_permutation.html
      - copied unchanged from r61653, /trunk/libs/range/doc/html/range/reference/algorithms/permutation/next_permutation.html
   branches/release/libs/range/doc/html/range/reference/algorithms/permutation/prev_permutation.html
      - copied unchanged from r61653, /trunk/libs/range/doc/html/range/reference/algorithms/permutation/prev_permutation.html
   branches/release/libs/range/doc/html/range/reference/algorithms/set/
      - copied from r61653, /trunk/libs/range/doc/html/range/reference/algorithms/set/
   branches/release/libs/range/doc/html/range/reference/algorithms/set.html
      - copied unchanged from r61653, /trunk/libs/range/doc/html/range/reference/algorithms/set.html
   branches/release/libs/range/doc/html/range/reference/algorithms/set/includes.html
      - copied unchanged from r61653, /trunk/libs/range/doc/html/range/reference/algorithms/set/includes.html
   branches/release/libs/range/doc/html/range/reference/algorithms/set/set_difference.html
      - copied unchanged from r61653, /trunk/libs/range/doc/html/range/reference/algorithms/set/set_difference.html
   branches/release/libs/range/doc/html/range/reference/algorithms/set/set_intersection.html
      - copied unchanged from r61653, /trunk/libs/range/doc/html/range/reference/algorithms/set/set_intersection.html
   branches/release/libs/range/doc/html/range/reference/algorithms/set/set_symmetric_difference.html
      - copied unchanged from r61653, /trunk/libs/range/doc/html/range/reference/algorithms/set/set_symmetric_difference.html
   branches/release/libs/range/doc/html/range/reference/algorithms/set/set_union.html
      - copied unchanged from r61653, /trunk/libs/range/doc/html/range/reference/algorithms/set/set_union.html
   branches/release/libs/range/doc/html/range/reference/concept_implementation/
      - copied from r61653, /trunk/libs/range/doc/html/range/reference/concept_implementation/
   branches/release/libs/range/doc/html/range/reference/concept_implementation.html
      - copied unchanged from r61653, /trunk/libs/range/doc/html/range/reference/concept_implementation.html
   branches/release/libs/range/doc/html/range/reference/concept_implementation/overview.html
      - copied unchanged from r61653, /trunk/libs/range/doc/html/range/reference/concept_implementation/overview.html
   branches/release/libs/range/doc/html/range/reference/concept_implementation/semantics/
      - copied from r61653, /trunk/libs/range/doc/html/range/reference/concept_implementation/semantics/
   branches/release/libs/range/doc/html/range/reference/concept_implementation/semantics.html
      - copied unchanged from r61653, /trunk/libs/range/doc/html/range/reference/concept_implementation/semantics.html
   branches/release/libs/range/doc/html/range/reference/concept_implementation/semantics/functions.html
      - copied unchanged from r61653, /trunk/libs/range/doc/html/range/reference/concept_implementation/semantics/functions.html
   branches/release/libs/range/doc/html/range/reference/concept_implementation/semantics/metafunctions.html
      - copied unchanged from r61653, /trunk/libs/range/doc/html/range/reference/concept_implementation/semantics/metafunctions.html
   branches/release/libs/range/doc/html/range/reference/concept_implementation/synopsis.html
      - copied unchanged from r61653, /trunk/libs/range/doc/html/range/reference/concept_implementation/synopsis.html
   branches/release/libs/range/doc/html/range/reference/utilities/
      - copied from r61653, /trunk/libs/range/doc/html/range/reference/utilities/
   branches/release/libs/range/doc/html/range/reference/utilities.html
      - copied unchanged from r61653, /trunk/libs/range/doc/html/range/reference/utilities.html
   branches/release/libs/range/doc/html/range/reference/utilities/iterator_range.html
      - copied unchanged from r61653, /trunk/libs/range/doc/html/range/reference/utilities/iterator_range.html
   branches/release/libs/range/doc/html/range/reference/utilities/join.html
      - copied unchanged from r61653, /trunk/libs/range/doc/html/range/reference/utilities/join.html
   branches/release/libs/range/doc/html/range/reference/utilities/sub_range.html
      - copied unchanged from r61653, /trunk/libs/range/doc/html/range/reference/utilities/sub_range.html
   branches/release/libs/range/doc/reference/algorithm/count_if.qbk
      - copied unchanged from r61653, /trunk/libs/range/doc/reference/algorithm/count_if.qbk
   branches/release/libs/range/doc/reference/algorithm/remove_copy.qbk
      - copied unchanged from r61653, /trunk/libs/range/doc/reference/algorithm/remove_copy.qbk
   branches/release/libs/range/doc/reference/algorithm/remove_copy_if.qbk
      - copied unchanged from r61653, /trunk/libs/range/doc/reference/algorithm/remove_copy_if.qbk
   branches/release/libs/range/doc/reference/algorithm/replace_copy.qbk
      - copied unchanged from r61653, /trunk/libs/range/doc/reference/algorithm/replace_copy.qbk
   branches/release/libs/range/doc/reference/algorithm/replace_copy_if.qbk
      - copied unchanged from r61653, /trunk/libs/range/doc/reference/algorithm/replace_copy_if.qbk
   branches/release/libs/range/doc/reference/algorithm/reverse_copy.qbk
      - copied unchanged from r61653, /trunk/libs/range/doc/reference/algorithm/reverse_copy.qbk
   branches/release/libs/range/doc/reference/algorithm/rotate_copy.qbk
      - copied unchanged from r61653, /trunk/libs/range/doc/reference/algorithm/rotate_copy.qbk
   branches/release/libs/range/doc/reference/algorithm/search_n.qbk
      - copied unchanged from r61653, /trunk/libs/range/doc/reference/algorithm/search_n.qbk
   branches/release/libs/range/doc/reference/algorithm/swap_ranges.qbk
      - copied unchanged from r61653, /trunk/libs/range/doc/reference/algorithm/swap_ranges.qbk
   branches/release/libs/range/doc/reference/algorithm/unique_copy.qbk
      - copied unchanged from r61653, /trunk/libs/range/doc/reference/algorithm/unique_copy.qbk
   branches/release/libs/range/doc/reference/algorithm_ext/copy_n.qbk
      - copied unchanged from r61653, /trunk/libs/range/doc/reference/algorithm_ext/copy_n.qbk
   branches/release/libs/range/doc/reference/algorithm_ext/is_sorted.qbk
      - copied unchanged from r61653, /trunk/libs/range/doc/reference/algorithm_ext/is_sorted.qbk
   branches/release/libs/range/doc/reference/utilities.qbk
      - copied unchanged from r61653, /trunk/libs/range/doc/reference/utilities.qbk
Removed:
   branches/release/libs/range/doc/html/range/reference/adaptors/adaptors_reference/
   branches/release/libs/range/doc/html/range/reference/algorithms/heap_algorithms/
   branches/release/libs/range/doc/html/range/reference/algorithms/heap_algorithms.html
   branches/release/libs/range/doc/html/range/reference/algorithms/permutation_algorithms/
   branches/release/libs/range/doc/html/range/reference/algorithms/permutation_algorithms.html
   branches/release/libs/range/doc/html/range/reference/algorithms/range_algorithm_introduction.html
   branches/release/libs/range/doc/html/range/reference/algorithms/range_algorithm_mutating_algorithms/
   branches/release/libs/range/doc/html/range/reference/algorithms/range_algorithm_mutating_algorithms.html
   branches/release/libs/range/doc/html/range/reference/algorithms/range_algorithm_new_algorithms/
   branches/release/libs/range/doc/html/range/reference/algorithms/range_algorithm_new_algorithms.html
   branches/release/libs/range/doc/html/range/reference/algorithms/range_algorithm_non_mutating_algorithms/
   branches/release/libs/range/doc/html/range/reference/algorithms/range_algorithm_non_mutating_algorithms.html
   branches/release/libs/range/doc/html/range/reference/algorithms/range_numeric/
   branches/release/libs/range/doc/html/range/reference/algorithms/range_numeric.html
   branches/release/libs/range/doc/html/range/reference/algorithms/set_algorithms/
   branches/release/libs/range/doc/html/range/reference/algorithms/set_algorithms.html
   branches/release/libs/range/doc/html/range/reference/overview.html
   branches/release/libs/range/doc/html/range/reference/semantics.html
   branches/release/libs/range/doc/html/range/utilities.html
   branches/release/libs/range/doc/utilities.qbk
Properties modified: 
   branches/release/libs/range/doc/   (props changed)
Text files modified: 
   branches/release/libs/range/doc/boost_range.qbk                                          |   157 ++++++++++++--                          
   branches/release/libs/range/doc/headers.qbk                                              |   109 ++++++++++                              
   branches/release/libs/range/doc/history_ack.qbk                                          |    31 ++                                      
   branches/release/libs/range/doc/html/index.html                                          |    69 +++---                                  
   branches/release/libs/range/doc/html/quickbook_HTML.manifest                             |   209 +++++++++++---------                    
   branches/release/libs/range/doc/html/range/concepts/bidirectional_range.html             |    23 +-                                      
   branches/release/libs/range/doc/html/range/concepts/concept_checking.html                |     2                                         
   branches/release/libs/range/doc/html/range/concepts/forward_range.html                   |    17                                         
   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               |    23 +-                                      
   branches/release/libs/range/doc/html/range/examples.html                                 |     6                                         
   branches/release/libs/range/doc/html/range/faq.html                                      |     5                                         
   branches/release/libs/range/doc/html/range/history_ack.html                              |    58 +++++                                   
   branches/release/libs/range/doc/html/range/library_headers.html                          |   402 --------------------------------------- 
   branches/release/libs/range/doc/html/range/mfc_atl.html                                  |     4                                         
   branches/release/libs/range/doc/html/range/portability.html                              |    10                                         
   branches/release/libs/range/doc/html/range/reference.html                                |    44 ++--                                    
   branches/release/libs/range/doc/html/range/reference/adaptors.html                       |    17                                         
   branches/release/libs/range/doc/html/range/reference/adaptors/adaptors_introduction.html |     6                                         
   branches/release/libs/range/doc/html/range/reference/adaptors/adaptors_synopsis.html     |     8                                         
   branches/release/libs/range/doc/html/range/reference/algorithms.html                     |    25 +-                                      
   branches/release/libs/range/doc/html/range/reference/extending.html                      |     6                                         
   branches/release/libs/range/doc/html/range/reference/extending/method_3/method_3_2.html  |     6                                         
   branches/release/libs/range/doc/html/range/reference/ranges.html                         |     6                                         
   branches/release/libs/range/doc/html/range/reference/ranges/counting_range.html          |     8                                         
   branches/release/libs/range/doc/html/range/reference/ranges/irange.html                  |    20                                         
   branches/release/libs/range/doc/html/range/reference/ranges/istream_range.html           |     6                                         
   branches/release/libs/range/doc/html/range/style_guide.html                              |     8                                         
   branches/release/libs/range/doc/html/range/upgrade/upgrade_from_1_34.html                |     7                                         
   branches/release/libs/range/doc/html/range/utilities/iterator_range.html                 |     6                                         
   branches/release/libs/range/doc/html/range/utilities/join.html                           |     4                                         
   branches/release/libs/range/doc/html/range/utilities/sub_range.html                      |     2                                         
   branches/release/libs/range/doc/reference.qbk                                            |     7                                         
   branches/release/libs/range/doc/reference/adaptors.qbk                                   |    30 --                                      
   branches/release/libs/range/doc/reference/adaptors/adjacent_filtered.qbk                 |     3                                         
   branches/release/libs/range/doc/reference/adaptors/copied.qbk                            |     3                                         
   branches/release/libs/range/doc/reference/adaptors/filtered.qbk                          |     4                                         
   branches/release/libs/range/doc/reference/adaptors/indexed.qbk                           |     3                                         
   branches/release/libs/range/doc/reference/adaptors/indirected.qbk                        |     3                                         
   branches/release/libs/range/doc/reference/adaptors/map_keys.qbk                          |     3                                         
   branches/release/libs/range/doc/reference/adaptors/map_values.qbk                        |     3                                         
   branches/release/libs/range/doc/reference/adaptors/replaced.qbk                          |     3                                         
   branches/release/libs/range/doc/reference/adaptors/replaced_if.qbk                       |     3                                         
   branches/release/libs/range/doc/reference/adaptors/reversed.qbk                          |     3                                         
   branches/release/libs/range/doc/reference/adaptors/sliced.qbk                            |     3                                         
   branches/release/libs/range/doc/reference/adaptors/strided.qbk                           |     3                                         
   branches/release/libs/range/doc/reference/adaptors/tokenized.qbk                         |     3                                         
   branches/release/libs/range/doc/reference/adaptors/transformed.qbk                       |     3                                         
   branches/release/libs/range/doc/reference/adaptors/uniqued.qbk                           |     3                                         
   branches/release/libs/range/doc/reference/algorithm/adjacent_find.qbk                    |     2                                         
   branches/release/libs/range/doc/reference/algorithm/copy.qbk                             |     2                                         
   branches/release/libs/range/doc/reference/algorithm/copy_backward.qbk                    |     2                                         
   branches/release/libs/range/doc/reference/algorithm/fill.qbk                             |     2                                         
   branches/release/libs/range/doc/reference/algorithm/fill_n.qbk                           |     2                                         
   branches/release/libs/range/doc/reference/algorithm/generate.qbk                         |     2                                         
   branches/release/libs/range/doc/reference/algorithm/inplace_merge.qbk                    |     8                                         
   branches/release/libs/range/doc/reference/algorithm/merge.qbk                            |     2                                         
   branches/release/libs/range/doc/reference/algorithm/mismatch.qbk                         |     4                                         
   branches/release/libs/range/doc/reference/algorithm/nth_element.qbk                      |     2                                         
   branches/release/libs/range/doc/reference/algorithm/partial_sort.qbk                     |     2                                         
   branches/release/libs/range/doc/reference/algorithm/partition.qbk                        |     2                                         
   branches/release/libs/range/doc/reference/algorithm/random_shuffle.qbk                   |     2                                         
   branches/release/libs/range/doc/reference/algorithm/remove.qbk                           |     2                                         
   branches/release/libs/range/doc/reference/algorithm/remove_if.qbk                        |     2                                         
   branches/release/libs/range/doc/reference/algorithm/replace.qbk                          |     2                                         
   branches/release/libs/range/doc/reference/algorithm/replace_if.qbk                       |     2                                         
   branches/release/libs/range/doc/reference/algorithm/reverse.qbk                          |     2                                         
   branches/release/libs/range/doc/reference/algorithm/rotate.qbk                           |     4                                         
   branches/release/libs/range/doc/reference/algorithm/sort.qbk                             |     2                                         
   branches/release/libs/range/doc/reference/algorithm/stable_partition.qbk                 |     2                                         
   branches/release/libs/range/doc/reference/algorithm/stable_sort.qbk                      |     2                                         
   branches/release/libs/range/doc/reference/algorithm/transform.qbk                        |     4                                         
   branches/release/libs/range/doc/reference/algorithm/unique.qbk                           |     2                                         
   branches/release/libs/range/doc/reference/algorithms.qbk                                 |    29 ++                                      
   branches/release/libs/range/doc/reference/ranges/irange.qbk                              |     6                                         
   75 files changed, 717 insertions(+), 777 deletions(-)

Modified: branches/release/libs/range/doc/boost_range.qbk
==============================================================================
--- branches/release/libs/range/doc/boost_range.qbk	(original)
+++ branches/release/libs/range/doc/boost_range.qbk	2010-04-29 17:18:58 EDT (Thu, 29 Apr 2010)
@@ -33,36 +33,131 @@
 [def __bidirectional_range__    [link range.concepts.bidirectional_range Bidirectional Range]]
 [def __random_access_range__    [link range.concepts.random_access_range Random Access Range]]
 
-[def __iterator_range__         [link range.utilities.iterator_range `iterator_range`]]
-[def __sub_range__              [link range.utilities.sub_range `sub_range`]]
+[def __iterator_range__         [link range.reference.utilities.iterator_range `iterator_range`]]
+[def __sub_range__              [link range.reference.utilities.sub_range `sub_range`]]
 [def __minimal_interface__      [link range.reference.extending minimal interface]]
-[def __range_result_iterator__  [link range.reference.semantics.metafunctions `range_result_iterator`]]
+[def __range_result_iterator__  [link range.reference.concept_implementation.semantics.metafunctions `range_result_iterator`]]
 [def __extending_for_udts__ [link range.reference.extending Extending the library for UDTs]]
-[def __implementation_of_metafunctions__ [link range.reference.semantics.metafunctions Implementation of metafunctions]]
-[def __implementation_of_functions__     [link range.reference.semantics.functions Implementation of functions]]
+[def __implementation_of_metafunctions__ [link range.reference.concept_implementation.semantics.metafunctions Implementation of metafunctions]]
+[def __implementation_of_functions__     [link range.reference.concept_implementation.semantics.functions Implementation of functions]]
 
-[def __range_value__            [link range.reference.semantics.metafunctions `range_value`]]
-[def __range_iterator__         [link range.reference.semantics.metafunctions `range_iterator`]]
-[def __range_difference__       [link range.reference.semantics.metafunctions `range_difference`]]
-[def __range_pointer__          [link range.reference.semantics.metafunctions `range_pointer`]]
-[def __range_category__         [link range.reference.semantics.metafunctions `range_category`]]
-[def __range_reverse_iterator__ [link range.reference.semantics.metafunctions `range_reverse_iterator`]]
-[def __begin__                  [link range.reference.semantics.functions `begin`]]
-[def __const_begin__            [link range.reference.semantics.functions `const_begin`]]
-[def __end__                    [link range.reference.semantics.functions `end`]]
-[def __const_end__              [link range.reference.semantics.functions `const_end`]]
-[def __empty__                  [link range.reference.semantics.functions `empty`]]
-[def __distance__               [link range.reference.semantics.functions `distance`]]
-[def __size__                   [link range.reference.semantics.functions `size`]]
-[def __rbegin__                 [link range.reference.semantics.functions `rbegin`]]
-[def __const_rbegin__           [link range.reference.semantics.functions `const_rbegin`]]
-[def __rend__                   [link range.reference.semantics.functions `rend`]]
-[def __const_rend__             [link range.reference.semantics.functions `const_rend`]]
-[def __as_array__               [link range.reference.semantics.functions `as_array`]]
-[def __as_literal__             [link range.reference.semantics.functions `as_literal`]]
-
-[def __range_adaptors__         [link range.reference.adaptors Range adaptors]]
-[def __range_algorithms__       [link range.reference.algorithms Range algorithms]]
+[def __range_value__            [link range.reference.concept_implementation.semantics.metafunctions `range_value`]]
+[def __range_iterator__         [link range.reference.concept_implementation.semantics.metafunctions `range_iterator`]]
+[def __range_difference__       [link range.reference.concept_implementation.semantics.metafunctions `range_difference`]]
+[def __range_pointer__          [link range.reference.concept_implementation.semantics.metafunctions `range_pointer`]]
+[def __range_category__         [link range.reference.concept_implementation.semantics.metafunctions `range_category`]]
+[def __range_reverse_iterator__ [link range.reference.concept_implementation.semantics.metafunctions `range_reverse_iterator`]]
+[def __begin__                  [link range.reference.concept_implementation.semantics.functions `begin`]]
+[def __const_begin__            [link range.reference.concept_implementation.semantics.functions `const_begin`]]
+[def __end__                    [link range.reference.concept_implementation.semantics.functions `end`]]
+[def __const_end__              [link range.reference.concept_implementation.semantics.functions `const_end`]]
+[def __empty__                  [link range.reference.concept_implementation.semantics.functions `empty`]]
+[def __distance__               [link range.reference.concept_implementation.semantics.functions `distance`]]
+[def __size__                   [link range.reference.concept_implementation.semantics.functions `size`]]
+[def __rbegin__                 [link range.reference.concept_implementation.semantics.functions `rbegin`]]
+[def __const_rbegin__           [link range.reference.concept_implementation.semantics.functions `const_rbegin`]]
+[def __rend__                   [link range.reference.concept_implementation.semantics.functions `rend`]]
+[def __const_rend__             [link range.reference.concept_implementation.semantics.functions `const_rend`]]
+[def __as_array__               [link range.reference.concept_implementation.semantics.functions `as_array`]]
+[def __as_literal__             [link range.reference.concept_implementation.semantics.functions `as_literal`]]
+[def __counting_range__         [link range.reference.ranges.counting_range `counting_range`]]
+[def __irange__                 [link range.reference.ranges.irange `irange`]]
+[def __istream_range__          [link range.reference.ranges.istream_range `istream_range`]]
+[def __join__                   [link range.reference.utilities.join `join`]]
+
+[def __range_adaptors__                   [link range.reference.adaptors Range adaptors]]
+[def __range_adaptors_adjacent_filtered__ [link range.reference.adaptors.reference.adjacent_filtered adjacent_filtered]]
+[def __range_adaptors_copied__            [link range.reference.adaptors.reference.copied copied]]
+[def __range_adaptors_filtered__          [link range.reference.adaptors.reference.filtered filtered]]
+[def __range_adaptors_indexed__           [link range.reference.adaptors.reference.indexed indexed]]
+[def __range_adaptors_indirected__        [link range.reference.adaptors.reference.indirected indirected]]
+[def __range_adaptors_map_keys__          [link range.reference.adaptors.reference.map_keys map_keys]]
+[def __range_adaptors_map_values__        [link range.reference.adaptors.reference.map_values map_values]]
+[def __range_adaptors_replaced__          [link range.reference.adaptors.reference.replaced replaced]]
+[def __range_adaptors_replaced_if__       [link range.reference.adaptors.reference.replaced_if replaced_if]]
+[def __range_adaptors_reversed__          [link range.reference.adaptors.reference.reversed reversed]]
+[def __range_adaptors_sliced__            [link range.reference.adaptors.reference.sliced sliced]]
+[def __range_adaptors_strided__           [link range.reference.adaptors.reference.strided strided]]
+[def __range_adaptors_tokenized__         [link range.reference.adaptors.reference.tokenized tokenized]]
+[def __range_adaptors_transformed__       [link range.reference.adaptors.reference.transformed transformed]]
+[def __range_adaptors_uniqued__           [link range.reference.adaptors.reference.uniqued uniqued]]
+
+
+[def __range_algorithms__                         [link range.reference.algorithms Range algorithms]]
+[def __range_algorithms_adjacent_find__           [link range.reference.algorithms.non_mutating.adjacent_find adjacent_find]]
+[def __range_algorithms_binary_search__           [link range.reference.algorithms.non_mutating.binary_search binary_search]]
+[def __range_algorithms_count__                   [link range.reference.algorithms.non_mutating.count count]]
+[def __range_algorithms_count_if__                [link range.reference.algorithms.non_mutating.count_if count_if]]
+[def __range_algorithms_equal__                   [link range.reference.algorithms.non_mutating.equal equal]]
+[def __range_algorithms_equal_range__             [link range.reference.algorithms.non_mutating.equal_range equal_range]]
+[def __range_algorithms_for_each__                [link range.reference.algorithms.non_mutating.for_each for_each]]
+[def __range_algorithms_find__                    [link range.reference.algorithms.non_mutating.find find]]
+[def __range_algorithms_find_end__                [link range.reference.algorithms.non_mutating.find_end find_end]]
+[def __range_algorithms_find_first_of__           [link range.reference.algorithms.non_mutating.find_first_of find_first_of]]
+[def __range_algorithms_find_if__                 [link range.reference.algorithms.non_mutating.find_if find_if]]
+[def __range_algorithms_lexicographical_compare__ [link range.reference.algorithms.non_mutating.lexicographical_compare lexicographical_compare]]
+[def __range_algorithms_lower_bound__             [link range.reference.algorithms.non_mutating.lower_bound lower_bound]]
+[def __range_algorithms_max_element__             [link range.reference.algorithms.non_mutating.max_element max_element]]
+[def __range_algorithms_min_element__             [link range.reference.algorithms.non_mutating.min_element min_element]]
+[def __range_algorithms_mismatch__                [link range.reference.algorithms.non_mutating.mismatch mismatch]]
+[def __range_algorithms_search__                  [link range.reference.algorithms.non_mutating.search search]]
+[def __range_algorithms_search_n__                [link range.reference.algorithms.non_mutating.search_n search_n]]
+[def __range_algorithms_upper_bound__             [link range.reference.algorithms.non_mutating.upper_bound upper_bound]]
+
+[def __range_algorithms_copy__                    [link range.reference.algorithms.mutating.copy copy]]
+[def __range_algorithms_copy_backward__           [link range.reference.algorithms.mutating.copy_backward copy_backward]]
+[def __range_algorithms_fill__                    [link range.reference.algorithms.mutating.fill fill]]
+[def __range_algorithms_fill_n__                  [link range.reference.algorithms.mutating.fill_n fill_n]]
+[def __range_algorithms_generate__                [link range.reference.algorithms.mutating.generate generate]]
+[def __range_algorithms_inplace_merge__           [link range.reference.algorithms.mutating.inplace_merge inplace_merge]]
+[def __range_algorithms_merge__                   [link range.reference.algorithms.mutating.merge merge]]
+[def __range_algorithms_nth_element__             [link range.reference.algorithms.mutating.nth_element nth_element]]
+[def __range_algorithms_partial_sort__            [link range.reference.algorithms.mutating.partial_sort partial_sort]]
+[def __range_algorithms_partition__               [link range.reference.algorithms.mutating.partition partition]]
+[def __range_algorithms_random_shuffle__          [link range.reference.algorithms.mutating.random_shuffle random_shuffle]]
+[def __range_algorithms_remove__                  [link range.reference.algorithms.mutating.remove remove]]
+[def __range_algorithms_remove_copy__             [link range.reference.algorithms.mutating.remove_copy remove_copy]]
+[def __range_algorithms_remove_copy_if__          [link range.reference.algorithms.mutating.remove_copy_if remove_copy_if]]
+[def __range_algorithms_remove_if__               [link range.reference.algorithms.mutating.remove_if remove_if]]
+[def __range_algorithms_replace__                 [link range.reference.algorithms.mutating.replace replace]]
+[def __range_algorithms_replace_copy__            [link range.reference.algorithms.mutating.replace_copy replace_copy]]
+[def __range_algorithms_replace_copy_if__         [link range.reference.algorithms.mutating.replace_copy_if replace_copy_if]]
+[def __range_algorithms_replace_if__              [link range.reference.algorithms.mutating.replace_if replace_if]]
+[def __range_algorithms_reverse__                 [link range.reference.algorithms.mutating.reverse reverse]]
+[def __range_algorithms_reverse_copy__            [link range.reference.algorithms.mutating.reverse_copy reverse_copy]]
+[def __range_algorithms_rotate__                  [link range.reference.algorithms.mutating.rotate rotate]]
+[def __range_algorithms_rotate_copy__             [link range.reference.algorithms.mutating.rotate_copy rotate_copy]]
+[def __range_algorithms_sort__                    [link range.reference.algorithms.mutating.sort sort]]
+[def __range_algorithms_stable_partition__        [link range.reference.algorithms.mutating.stable_partition stable_partition]]
+[def __range_algorithms_stable_sort__             [link range.reference.algorithms.mutating.stable_sort stable_sort]]
+[def __range_algorithms_swap_ranges__             [link range.reference.algorithms.mutating.swap_ranges swap_ranges]]
+[def __range_algorithms_transform__               [link range.reference.algorithms.mutating.transform transform]]
+[def __range_algorithms_unique__                  [link range.reference.algorithms.mutating.unique unique]]
+[def __range_algorithms_unique_copy__             [link range.reference.algorithms.mutating.unique_copy unique_copy]]
+
+[def __range_algorithms_includes__                 [link range.reference.algorithms.set.includes includes]]
+[def __range_algorithms_set_union__                [link range.reference.algorithms.set.set_union set_union]]
+[def __range_algorithms_set_intersection__         [link range.reference.algorithms.set.set_intersection set_intersection]]
+[def __range_algorithms_set_difference__           [link range.reference.algorithms.set.set_difference set_difference]]
+[def __range_algorithms_set_symmetric_difference__ [link range.reference.algorithms.set.set_symmetric_difference set_symmetric_difference]]
+
+[def __range_algorithms_push_heap__         [link range.reference.algorithms.heap.push_heap push_heap]]
+[def __range_algorithms_pop_heap__          [link range.reference.algorithms.heap.pop_heap pop_heap]]
+[def __range_algorithms_make_heap__         [link range.reference.algorithms.heap.make_heap make_heap]]
+[def __range_algorithms_sort_heap__         [link range.reference.algorithms.heap.sort_heap sort_heap]]
+
+[def __range_algorithms_next_permutation__  [link range.reference.algorithms.permutation.next_permutation next_permutation]]
+[def __range_algorithms_prev_permutation__ [link range.reference.algorithms.permutation.prev_permutation prev_permutation]]
+
+[def __range_algorithm_ext_copy_n__         [link range.reference.algorithms.new.copy_n copy_n]]
+[def __range_algorithm_ext_erase__          [link range.reference.algorithms.new.erase erase]]
+[def __range_algorithm_ext_for_each__       [link range.reference.algorithms.new.for_each for_each]]
+[def __range_algorithm_ext_insert__         [link range.reference.algorithms.new.insert insert]]
+[def __range_algorithm_ext_iota__           [link range.reference.algorithms.new.iota iota]]
+[def __range_algorithm_ext_is_sorted__      [link range.reference.algorithms.new.is_sorted is_sorted]]
+[def __range_algorithm_ext_overwrite__      [link range.reference.algorithms.new.overwrite overwrite]]
+[def __range_algorithm_ext_push_back__      [link range.reference.algorithms.new.push_back push_back]]
+[def __range_algorithm_ext_push_front__     [link range.reference.algorithms.new.push_front push_front]]
 
 [def __single_pass_iterator__   [@boost:/libs/iterator/doc/new-iter-concepts.html#singls-pass-iterators-lib-single-pass-iterators Single Pass Iterator]]
 [def __forward_traversal_iterator__ [@boost:/libs/iterator/doc/new-iter-concepts.html#forward-traversal-iterators-lib-forward-traversal-iterators Forward Traversal Iterator]]
@@ -80,11 +175,15 @@
 [def __sgi_inner_product__      [@http://www.sgi.com/tech/stl/inner_product.html inner_product]]
 [def __sgi_partial_sum__        [@http://www.sgi.com/tech/stl/partial_sum.html partial_sum]]
 
-Boost.Range is a collection of concepts and utilities that are particularly useful for specifying and implementing generic algorithms.
+Boost.Range is a collection of concepts and utilities, range-based algorithms,
+as well as range adaptors that allow for efficient and expressive code.
+
+Using Boost.Range inplace of the standard library alternatives results in more
+readable code and in many cases greater efficiency.
+
 [include introduction.qbk]
 [include concepts.qbk]
 [include reference.qbk]
-[include utilities.qbk]
 [include style.qbk]
 [include headers.qbk]
 [include examples.qbk]

Modified: branches/release/libs/range/doc/headers.qbk
==============================================================================
--- branches/release/libs/range/doc/headers.qbk	(original)
+++ branches/release/libs/range/doc/headers.qbk	2010-04-29 17:18:58 EDT (Thu, 29 Apr 2010)
@@ -1,5 +1,6 @@
 [section Library Headers]
 
+[section 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. ] [-                       ]]
@@ -23,7 +24,115 @@
     [[`<boost/range/iterator_range.hpp>`  ] [__iterator_range__         ] [-                       ]]
     [[`<boost/range/sub_range.hpp>`       ] [__sub_range__              ] [-                       ]]
     [[`<boost/range/concepts.hpp>`        ] [__range_concepts__         ] [-                       ]]
+    [[`<boost/range/adaptors.hpp>`        ] [every range adaptor        ] [-                       ]]
+    [[`<boost/range/algorithm.hpp>`       ] [every range equivalent of an STL algorithm ] [-                       ]]
+    [[`<boost/range/algorithm_ext.hpp>`   ] [every range algorithm that is an extension of the STL algorithms ] [-                       ]]
+    [[`<boost/range/counting_range.hpp>`  ] [ __counting_range__ ] [-]]
+    [[`<boost/range/istream_range.hpp>`   ] [ __istream_range__ ] [-]]
+    [[`<boost/range/irange.hpp>`          ] [ __irange__ ] [-]]
+    [[`<boost/range/join.hpp>`            ] [ __join__ ] [-]]
 ]
+[endsect]
+
+[section Adaptors]
+[table
+    [[Header                                        ][Includes                                           ]]
+    [[`<boost/range/adaptor/adjacent_filtered.hpp>`] [__range_adaptors_adjacent_filtered__ ]]
+    [[`<boost/range/adaptor/copied.hpp>`]            [__range_adaptors_copied__]]
+    [[`<boost/range/adaptor/filtered.hpp>`]          [__range_adaptors_filtered__]]
+    [[`<boost/range/adaptor/indexed.hpp>`]           [__range_adaptors_indexed__]]
+    [[`<boost/range/adaptor/indirected.hpp.`]        [__range_adaptors_indirected__]]
+    [[`<boost/range/adaptor/map.hpp>`]               [__range_adaptors_map_keys__ __range_adaptors_map_values__]]
+    [[`<boost/range/adaptor/replaced.hpp>`]          [__range_adaptors_replaced__]]
+    [[`<boost/range/adaptor/replaced_if.hpp>`]       [__range_adaptors_replaced_if__]]
+    [[`<boost/range/adaptor/reversed.hpp>`]          [__range_adaptors_reversed__]]
+    [[`<boost/range/adaptor/sliced.hpp>`]            [__range_adaptors_sliced__]]
+    [[`<boost/range/adaptor/strided.hpp>`]           [__range_adaptors_strided__]]
+    [[`<boost/range/adaptor/tokenized.hpp>`]         [__range_adaptors_tokenized__]]
+    [[`<boost/range/adaptor/transformed.hpp>`]       [__range_adaptors_transformed__]]
+    [[`<boost/range/adaptor/uniqued.hpp>`]           [__range_adaptors_uniqued__]]
+]
+[endsect]
+
+[section Algorithm]
+[table
+    [[Header                                        ][Includes                                           ]]
+    [[`<boost/range/algorithm/adjacent_find.hpp>`]           [__range_algorithms_adjacent_find__]]
+    [[`<boost/range/algorithm/binary_search.hpp>`]           [__range_algorithms_binary_search__]]
+    [[`<boost/range/algorithm/copy.hpp>`]                    [__range_algorithms_copy__]]
+    [[`<boost/range/algorithm/copy_backward.hpp>`]           [__range_algorithms_copy_backward__]]
+    [[`<boost/range/algorithm/count.hpp>`]                   [__range_algorithms_count__]]
+    [[`<boost/range/algorithm/count_if.hpp>`]                [__range_algorithms_count_if__]]
+    [[`<boost/range/algorithm/equal.hpp>`]                   [__range_algorithms_equal__]]
+    [[`<boost/range/algorithm/equal_range.hpp>`]             [__range_algorithms_equal_range__]]
+    [[`<boost/range/algorithm/fill.hpp>`]                    [__range_algorithms_fill__]]
+    [[`<boost/range/algorithm/fill_n.hpp>`]                  [__range_algorithms_fill_n__]]
+    [[`<boost/range/algorithm/find.hpp>`]                    [__range_algorithms_find__]]
+    [[`<boost/range/algorithm/find_end.hpp>`]                [__range_algorithms_find_end__]]
+    [[`<boost/range/algorithm/find_first_of.hpp>`]           [__range_algorithms_find_first_of__]]
+    [[`<boost/range/algorithm/find_if.hpp>`]                 [__range_algorithms_find_if__]]
+    [[`<boost/range/algorithm/for_each.hpp>`]                [__range_algorithms_for_each__]]
+    [[`<boost/range/algorithm/generate.hpp>`]                [__range_algorithms_generate__]]
+    [[`<boost/range/algorithm/heap_algorithm.hpp>`]          [__range_algorithms_push_heap__
+                                                              __range_algorithms_pop_heap__
+                                                              __range_algorithms_make_heap__
+                                                              __range_algorithms_sort_heap__]]
+    [[`<boost/range/algorithm/inplace_merge.hpp>`]           [__range_algorithms_inplace_merge__]]
+    [[`<boost/range/algorithm/lexicographical_compare.hpp>`] [__range_algorithms_lexicographical_compare__]]
+    [[`<boost/range/algorithm/lower_bound.hpp>`]             [__range_algorithms_lower_bound__]]
+    [[`<boost/range/algorithm/max_element.hpp>`]             [__range_algorithms_max_element__]]
+    [[`<boost/range/algorithm/merge.hpp>`]                   [__range_algorithms_merge__]]
+    [[`<boost/range/algorithm/min_element.hpp>`]             [__range_algorithms_min_element__]]
+    [[`<boost/range/algorithm/mismatch.hpp>`]                [__range_algorithms_mismatch__]]
+    [[`<boost/range/algorithm/nth_element.hpp>`]             [__range_algorithms_nth_element__]]
+    [[`<boost/range/algorithm/partial_sort.hpp>`]            [__range_algorithms_partial_sort__]]
+    [[`<boost/range/algorithm/partition.hpp>`]               [__range_algorithms_partition__]]
+    [[`<boost/range/algorithm/permutation.hpp>`]             [__range_algorithms_next_permutation__
+                                                              __range_algorithms_prev_permutation__]]
+    [[`<boost/range/algorithm/random_shuffle.hpp>`]          [__range_algorithms_random_shuffle__]]
+    [[`<boost/range/algorithm/remove.hpp>`]                  [__range_algorithms_remove__]]
+    [[`<boost/range/algorithm/remove_copy.hpp>`]             [__range_algorithms_remove_copy__]]
+    [[`<boost/range/algorithm/remove_copy_if.hpp>`]          [__range_algorithms_remove_copy_if__]]
+    [[`<boost/range/algorithm/remove_if.hpp>`]               [__range_algorithms_remove_if__]]
+    [[`<boost/range/algorithm/replace.hpp>`]                 [__range_algorithms_replace__]]
+    [[`<boost/range/algorithm/replace_copy.hpp>`]            [__range_algorithms_replace_copy__]]
+    [[`<boost/range/algorithm/replace_copy_if.hpp>`]         [__range_algorithms_replace_copy_if__]]
+    [[`<boost/range/algorithm/replace_if.hpp>`]              [__range_algorithms_replace_if__]]
+    [[`<boost/range/algorithm/reverse.hpp>`]                 [__range_algorithms_reverse__]]
+    [[`<boost/range/algorithm/reverse_copy.hpp>`]            [__range_algorithms_reverse_copy__]]
+    [[`<boost/range/algorithm/rotate.hpp>`]                  [__range_algorithms_rotate__]]
+    [[`<boost/range/algorithm/rotate_copy.hpp>`]             [__range_algorithms_rotate_copy__]]
+    [[`<boost/range/algorithm/search.hpp>`]                  [__range_algorithms_search__]]
+    [[`<boost/range/algorithm/search_n.hpp>`]                [__range_algorithms_search_n__]]
+    [[`<boost/range/algorithm/set_algorithm.hpp>`]           [__range_algorithms_includes__
+                                                              __range_algorithms_set_union__
+                                                              __range_algorithms_set_intersection__
+                                                              __range_algorithms_set_difference__
+                                                              __range_algorithms_set_symmetric_difference__]]
+    [[`<boost/range/algorithm/sort.hpp>`]                    [__range_algorithms_sort__]]
+    [[`<boost/range/algorithm/stable_partition.hpp>`]        [__range_algorithms_stable_partition__]]
+    [[`<boost/range/algorithm/swap_ranges.hpp>`]             [__range_algorithms_swap_ranges__]]
+    [[`<boost/range/algorithm/transform.hpp>`]               [__range_algorithms_transform__]]
+    [[`<boost/range/algorithm/unique.hpp>`]                  [__range_algorithms_unique__]]
+    [[`<boost/range/algorithm/unique_copy.hpp>`]             [__range_algorithms_unique_copy__]]
+    [[`<boost/range/algorithm/upper_bound.hpp>`]             [__range_algorithms_upper_bound__]]
+]
+[endsect]
+
+[section Algorithm Extensions]
+[table
+    [[Header                                        ][Includes                                           ]]
+    [[`<boost/range/algorithm_ext/copy_n.hpp>`]     [__range_algorithm_ext_copy_n__]]
+    [[`<boost/range/algorithm_ext/erase.hpp>`]      [__range_algorithm_ext_erase__]]
+    [[`<boost/range/algorithm_ext/for_each.hpp>`]   [__range_algorithm_ext_for_each__]]
+    [[`<boost/range/algorithm_ext/insert.hpp>`]     [__range_algorithm_ext_insert__]]
+    [[`<boost/range/algorithm_ext/iota.hpp>`]       [__range_algorithm_ext_iota__]]
+    [[`<boost/range/algorithm_ext/is_sorted.hpp>`]  [__range_algorithm_ext_is_sorted__]]
+    [[`<boost/range/algorithm_ext/overwrite.hpp>`]  [__range_algorithm_ext_overwrite__]]
+    [[`<boost/range/algorithm_ext/push_back.hpp>`]  [__range_algorithm_ext_push_back__]]
+    [[`<boost/range/algorithm_ext/push_front.hpp>`] [__range_algorithm_ext_push_front__]]
+]
+[endsect]
 
 [endsect]
 

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-04-29 17:18:58 EDT (Thu, 29 Apr 2010)
@@ -1,12 +1,13 @@
 [section:history_ack History and Acknowledgement]
 
+[heading Version 1 - before Boost 1.43]
 The library have been under way for a long time. Dietmar Kühl originally intended to submit an `array_traits` class template which had most of the functionality present now, but only for arrays and standard containers.
 
 Meanwhile work on algorithms for containers in various contexts showed the need for handling pairs of iterators, and string libraries needed special treatment of character arrays. In the end it made sense to formalize the minimal requirements of these similar concepts. And the results are the Range concepts found in this library.
 
 The term Range was adopted because of paragraph 24.1/7 from the C++ standard:
 
-Most of the library's algorithmic templates that operate on data structures have interfaces that use ranges. A range is a pair of iterators that designate the beginning and end of the computation. A range [i, i) is an empty range; in general, a range [i, j) refers to the elements in the data structure starting with the one pointed to by i and up to but not including the one pointed to by j. Range [i, j) is valid if and only if j is reachable from i. The result of the application of functions in the library to invalid ranges is undefined. 
+Most of the library's algorithmic templates that operate on data structures have interfaces that use ranges. A range is a pair of iterators that designate the beginning and end of the computation. A range [i, i) is an empty range; in general, a range [i, j) refers to the elements in the data structure starting with the one pointed to by i and up to but not including the one pointed to by j. Range [i, j) is valid if and only if j is reachable from i. The result of the application of functions in the library to invalid ranges is undefined.
 
 Special thanks goes to
 
@@ -14,9 +15,33 @@
 * Pavel Vozenilek for help with porting the library
 * Jonathan Turkanis and John Torjo for help with documentation
 * Hartmut Kaiser for being review manager
-* Jonathan Turkanis for porting the lib (as far sa possible) to vc6 and vc7. 
+* Jonathan Turkanis for porting the lib (as far sa possible) to vc6 and vc7.
 
-The concept checks and their documentation was provided by Daniel Walker. 
+The concept checks and their documentation was provided by Daniel Walker.
+
+[heading Version 2 - Boost 1.43 and beyond]
+This version introduced Range Adaptors and Range Algorithms. This version 2 is
+the result of a merge of all of the RangeEx features into Boost.Range.
+
+There were an enormous number of very significant contributors through all
+stages of this library.
+
+The people in the following list all made contributions in the form of reviews,
+user feedback, design suggestions, or defect detection:
+
+* Thorsten Ottosen: review management, design advice, documentation feedback
+* Eric Niebler:     feedback
+* Joel de Guzman:   review
+* Mathias Gaunard:  review
+* David Abrahams:   implementation advice
+* Robert Jones:     defect reports, usage feedback
+* Sean Parent:      contributed experience from the Adobe range library
+* Arno Schoedl:     implementations, and review
+* Rogier van Dalen: review
+* Vincente Botet:   review, documentation feedback
+
+Regardless of how I write this section it will never truly fairly capture the
+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-04-29 17:18:58 EDT (Thu, 29 Apr 2010)
@@ -30,7 +30,7 @@
 </h3></div></div>
 <div><p class="copyright">Copyright &#169; 2003 -2010 Thorsten Ottosen, Neil Groves</p></div>
 <div><div class="legalnotice" title="Legal Notice">
-<a name="id3005003"></a><p>
+<a name="id2680258"></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>
@@ -49,40 +49,36 @@
 <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">Synopsis</span></dt>
-<dt><span class="section">Semantics</span></dt>
+<dt><span class="section"><a href="range/reference/concept_implementation.html"> Range concept
+      implementation</a></span></dt>
 <dd><dl>
-<dt><span class="section">Metafunctions</span></dt>
-<dt><span class="section">Functions</span></dt>
+<dt><span class="section">Synopsis</span></dt>
+<dt><span class="section">Semantics</span></dt>
 </dl></dd>
 <dt><span class="section"> Range Adaptors</span></dt>
 <dd><dl>
-<dt><span class="section"><a href="range/reference/adaptors/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"> Synopsis</span></dt>
-<dt><span class="section"><a href="range/reference/adaptors/adaptors_general_requirements.html">
-        General Requirements</a></span></dt>
-<dt><span class="section"> Reference</span></dt>
+<dt><span class="section"><a href="range/reference/adaptors/general_requirements.html"> General
+        Requirements</a></span></dt>
+<dt><span class="section"> Reference</span></dt>
 </dl></dd>
 <dt><span class="section"> Range Algorithm</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"><a href="range/reference/algorithms/range_algorithm_mutating_algorithms.html">
-        Mutating algorithms</a></span></dt>
-<dt><span class="section"><a href="range/reference/algorithms/range_algorithm_non_mutating_algorithms.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_algorithms.html">
-        Permutation algorithms</a></span></dt>
-<dt><span class="section"><a href="range/reference/algorithms/range_algorithm_new_algorithms.html">
-        New algorithms</a></span></dt>
-<dt><span class="section"><a href="range/reference/algorithms/range_numeric.html"> Numeric
+<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
+        algorithms</a></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>
 <dd><dl>
@@ -90,6 +86,12 @@
 <dt><span class="section"> istream_range</span></dt>
 <dt><span class="section"> irange</span></dt>
 </dl></dd>
+<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>
+</dl></dd>
 <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
@@ -100,14 +102,15 @@
         range adaptor implementations</a></span></dt>
 </dl></dd>
 </dl></dd>
-<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>
-</dl></dd>
 <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>
+</dl></dd>
 <dt><span class="section">Examples</span></dt>
 <dt><span class="section"> MFC/ATL (courtesy of Shunsuke Sogame)</span></dt>
 <dd><dl>
@@ -130,12 +133,16 @@
 </dl>
 </div>
 <p>
-    Boost.Range is a collection of concepts and utilities that are particularly useful
-    for specifying and implementing generic algorithms.
+    Boost.Range is a collection of concepts and utilities, range-based algorithms,
+    as well as range adaptors that allow for efficient and expressive code.
+  </p>
+<p>
+    Using Boost.Range inplace of the standard library alternatives results in more
+    readable code and in many cases greater efficiency.
   </p>
 </div>
 <table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
-<td align="left"><p><small>Last revised: April 11, 2010 at 21:49:16 GMT</small></p></td>
+<td align="left"><p><small>Last revised: April 28, 2010 at 17:51:33 GMT</small></p></td>
 <td align="right"><div class="copyright-footer"></div></td>
 </tr></table>
 <hr>

Modified: branches/release/libs/range/doc/html/quickbook_HTML.manifest
==============================================================================
--- branches/release/libs/range/doc/html/quickbook_HTML.manifest	(original)
+++ branches/release/libs/range/doc/html/quickbook_HTML.manifest	2010-04-29 17:18:58 EDT (Thu, 29 Apr 2010)
@@ -9,117 +9,134 @@
 range/concepts/concept_checking.html
 range/reference.html
 range/reference/overview.html
-range/reference/synopsis.html
-range/reference/semantics.html
-range/reference/semantics/metafunctions.html
-range/reference/semantics/functions.html
+range/reference/concept_implementation.html
+range/reference/concept_implementation/synopsis.html
+range/reference/concept_implementation/semantics.html
+range/reference/concept_implementation/semantics/metafunctions.html
+range/reference/concept_implementation/semantics/functions.html
 range/reference/adaptors.html
-range/reference/adaptors/adaptors_introduction.html
-range/reference/adaptors/adaptors_synopsis.html
-range/reference/adaptors/adaptors_general_requirements.html
-range/reference/adaptors/adaptors_reference.html
-range/reference/adaptors/adaptors_reference/adjacent_filtered.html
-range/reference/adaptors/adaptors_reference/copied.html
-range/reference/adaptors/adaptors_reference/filtered.html
-range/reference/adaptors/adaptors_reference/indexed.html
-range/reference/adaptors/adaptors_reference/indirected.html
-range/reference/adaptors/adaptors_reference/map_keys.html
-range/reference/adaptors/adaptors_reference/map_values.html
-range/reference/adaptors/adaptors_reference/replaced.html
-range/reference/adaptors/adaptors_reference/replaced_if.html
-range/reference/adaptors/adaptors_reference/reversed.html
-range/reference/adaptors/adaptors_reference/sliced.html
-range/reference/adaptors/adaptors_reference/strided.html
-range/reference/adaptors/adaptors_reference/tokenized.html
-range/reference/adaptors/adaptors_reference/transformed.html
-range/reference/adaptors/adaptors_reference/uniqued.html
+range/reference/adaptors/introduction.html
+range/reference/adaptors/general_requirements.html
+range/reference/adaptors/reference.html
+range/reference/adaptors/reference/adjacent_filtered.html
+range/reference/adaptors/reference/copied.html
+range/reference/adaptors/reference/filtered.html
+range/reference/adaptors/reference/indexed.html
+range/reference/adaptors/reference/indirected.html
+range/reference/adaptors/reference/map_keys.html
+range/reference/adaptors/reference/map_values.html
+range/reference/adaptors/reference/replaced.html
+range/reference/adaptors/reference/replaced_if.html
+range/reference/adaptors/reference/reversed.html
+range/reference/adaptors/reference/sliced.html
+range/reference/adaptors/reference/strided.html
+range/reference/adaptors/reference/tokenized.html
+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/range_algorithm_mutating_algorithms.html
-range/reference/algorithms/range_algorithm_mutating_algorithms/copy.html
-range/reference/algorithms/range_algorithm_mutating_algorithms/copy_backward.html
-range/reference/algorithms/range_algorithm_mutating_algorithms/fill.html
-range/reference/algorithms/range_algorithm_mutating_algorithms/fill_n.html
-range/reference/algorithms/range_algorithm_mutating_algorithms/generate.html
-range/reference/algorithms/range_algorithm_mutating_algorithms/inplace_merge.html
-range/reference/algorithms/range_algorithm_mutating_algorithms/merge.html
-range/reference/algorithms/range_algorithm_mutating_algorithms/nth_element.html
-range/reference/algorithms/range_algorithm_mutating_algorithms/partial_sort.html
-range/reference/algorithms/range_algorithm_mutating_algorithms/partition.html
-range/reference/algorithms/range_algorithm_mutating_algorithms/random_shuffle.html
-range/reference/algorithms/range_algorithm_mutating_algorithms/remove.html
-range/reference/algorithms/range_algorithm_mutating_algorithms/remove_if.html
-range/reference/algorithms/range_algorithm_mutating_algorithms/replace.html
-range/reference/algorithms/range_algorithm_mutating_algorithms/replace_if.html
-range/reference/algorithms/range_algorithm_mutating_algorithms/rotate.html
-range/reference/algorithms/range_algorithm_mutating_algorithms/sort.html
-range/reference/algorithms/range_algorithm_mutating_algorithms/stable_partition.html
-range/reference/algorithms/range_algorithm_mutating_algorithms/stable_sort.html
-range/reference/algorithms/range_algorithm_mutating_algorithms/transform.html
-range/reference/algorithms/range_algorithm_mutating_algorithms/unique.html
-range/reference/algorithms/range_algorithm_non_mutating_algorithms.html
-range/reference/algorithms/range_algorithm_non_mutating_algorithms/adjacent_find.html
-range/reference/algorithms/range_algorithm_non_mutating_algorithms/binary_search.html
-range/reference/algorithms/range_algorithm_non_mutating_algorithms/count.html
-range/reference/algorithms/range_algorithm_non_mutating_algorithms/equal.html
-range/reference/algorithms/range_algorithm_non_mutating_algorithms/equal_range.html
-range/reference/algorithms/range_algorithm_non_mutating_algorithms/for_each.html
-range/reference/algorithms/range_algorithm_non_mutating_algorithms/find.html
-range/reference/algorithms/range_algorithm_non_mutating_algorithms/find_end.html
-range/reference/algorithms/range_algorithm_non_mutating_algorithms/find_first_of.html
-range/reference/algorithms/range_algorithm_non_mutating_algorithms/find_if.html
-range/reference/algorithms/range_algorithm_non_mutating_algorithms/lexicographical_compare.html
-range/reference/algorithms/range_algorithm_non_mutating_algorithms/lower_bound.html
-range/reference/algorithms/range_algorithm_non_mutating_algorithms/max_element.html
-range/reference/algorithms/range_algorithm_non_mutating_algorithms/min_element.html
-range/reference/algorithms/range_algorithm_non_mutating_algorithms/mismatch.html
-range/reference/algorithms/range_algorithm_non_mutating_algorithms/search.html
-range/reference/algorithms/range_algorithm_non_mutating_algorithms/upper_bound.html
-range/reference/algorithms/set_algorithms.html
-range/reference/algorithms/set_algorithms/includes.html
-range/reference/algorithms/set_algorithms/set_union.html
-range/reference/algorithms/set_algorithms/set_intersection.html
-range/reference/algorithms/set_algorithms/set_difference.html
-range/reference/algorithms/set_algorithms/set_symmetric_difference.html
-range/reference/algorithms/heap_algorithms.html
-range/reference/algorithms/heap_algorithms/push_heap.html
-range/reference/algorithms/heap_algorithms/pop_heap.html
-range/reference/algorithms/heap_algorithms/make_heap.html
-range/reference/algorithms/heap_algorithms/sort_heap.html
-range/reference/algorithms/permutation_algorithms.html
-range/reference/algorithms/permutation_algorithms/next_permutation.html
-range/reference/algorithms/permutation_algorithms/prev_permutation.html
-range/reference/algorithms/range_algorithm_new_algorithms.html
-range/reference/algorithms/range_algorithm_new_algorithms/erase.html
-range/reference/algorithms/range_algorithm_new_algorithms/for_each.html
-range/reference/algorithms/range_algorithm_new_algorithms/insert.html
-range/reference/algorithms/range_algorithm_new_algorithms/iota.html
-range/reference/algorithms/range_algorithm_new_algorithms/overwrite.html
-range/reference/algorithms/range_algorithm_new_algorithms/push_back.html
-range/reference/algorithms/range_algorithm_new_algorithms/push_front.html
-range/reference/algorithms/range_algorithm_new_algorithms/remove_erase.html
-range/reference/algorithms/range_algorithm_new_algorithms/remove_erase_if.html
-range/reference/algorithms/range_numeric.html
-range/reference/algorithms/range_numeric/accumulate.html
-range/reference/algorithms/range_numeric/adjacent_difference.html
-range/reference/algorithms/range_numeric/inner_product.html
-range/reference/algorithms/range_numeric/partial_sum.html
+range/reference/algorithms/mutating.html
+range/reference/algorithms/mutating/copy.html
+range/reference/algorithms/mutating/copy_backward.html
+range/reference/algorithms/mutating/fill.html
+range/reference/algorithms/mutating/fill_n.html
+range/reference/algorithms/mutating/generate.html
+range/reference/algorithms/mutating/inplace_merge.html
+range/reference/algorithms/mutating/merge.html
+range/reference/algorithms/mutating/nth_element.html
+range/reference/algorithms/mutating/partial_sort.html
+range/reference/algorithms/mutating/partition.html
+range/reference/algorithms/mutating/random_shuffle.html
+range/reference/algorithms/mutating/remove.html
+range/reference/algorithms/mutating/remove_copy.html
+range/reference/algorithms/mutating/remove_copy_if.html
+range/reference/algorithms/mutating/remove_if.html
+range/reference/algorithms/mutating/replace.html
+range/reference/algorithms/mutating/replace_copy.html
+range/reference/algorithms/mutating/replace_copy_if.html
+range/reference/algorithms/mutating/replace_if.html
+range/reference/algorithms/mutating/reverse.html
+range/reference/algorithms/mutating/reverse_copy.html
+range/reference/algorithms/mutating/rotate.html
+range/reference/algorithms/mutating/rotate_copy.html
+range/reference/algorithms/mutating/sort.html
+range/reference/algorithms/mutating/stable_partition.html
+range/reference/algorithms/mutating/stable_sort.html
+range/reference/algorithms/mutating/swap_ranges.html
+range/reference/algorithms/mutating/transform.html
+range/reference/algorithms/mutating/unique.html
+range/reference/algorithms/mutating/unique_copy.html
+range/reference/algorithms/non_mutating.html
+range/reference/algorithms/non_mutating/adjacent_find.html
+range/reference/algorithms/non_mutating/binary_search.html
+range/reference/algorithms/non_mutating/count.html
+range/reference/algorithms/non_mutating/count_if.html
+range/reference/algorithms/non_mutating/equal.html
+range/reference/algorithms/non_mutating/equal_range.html
+range/reference/algorithms/non_mutating/for_each.html
+range/reference/algorithms/non_mutating/find.html
+range/reference/algorithms/non_mutating/find_end.html
+range/reference/algorithms/non_mutating/find_first_of.html
+range/reference/algorithms/non_mutating/find_if.html
+range/reference/algorithms/non_mutating/lexicographical_compare.html
+range/reference/algorithms/non_mutating/lower_bound.html
+range/reference/algorithms/non_mutating/max_element.html
+range/reference/algorithms/non_mutating/min_element.html
+range/reference/algorithms/non_mutating/mismatch.html
+range/reference/algorithms/non_mutating/search.html
+range/reference/algorithms/non_mutating/search_n.html
+range/reference/algorithms/non_mutating/upper_bound.html
+range/reference/algorithms/set.html
+range/reference/algorithms/set/includes.html
+range/reference/algorithms/set/set_union.html
+range/reference/algorithms/set/set_intersection.html
+range/reference/algorithms/set/set_difference.html
+range/reference/algorithms/set/set_symmetric_difference.html
+range/reference/algorithms/heap.html
+range/reference/algorithms/heap/push_heap.html
+range/reference/algorithms/heap/pop_heap.html
+range/reference/algorithms/heap/make_heap.html
+range/reference/algorithms/heap/sort_heap.html
+range/reference/algorithms/permutation.html
+range/reference/algorithms/permutation/next_permutation.html
+range/reference/algorithms/permutation/prev_permutation.html
+range/reference/algorithms/new.html
+range/reference/algorithms/new/copy_n.html
+range/reference/algorithms/new/erase.html
+range/reference/algorithms/new/for_each.html
+range/reference/algorithms/new/insert.html
+range/reference/algorithms/new/iota.html
+range/reference/algorithms/new/is_sorted.html
+range/reference/algorithms/new/overwrite.html
+range/reference/algorithms/new/push_back.html
+range/reference/algorithms/new/push_front.html
+range/reference/algorithms/new/remove_erase.html
+range/reference/algorithms/new/remove_erase_if.html
+range/reference/algorithms/numeric.html
+range/reference/algorithms/numeric/accumulate.html
+range/reference/algorithms/numeric/adjacent_difference.html
+range/reference/algorithms/numeric/inner_product.html
+range/reference/algorithms/numeric/partial_sum.html
 range/reference/ranges.html
 range/reference/ranges/counting_range.html
 range/reference/ranges/istream_range.html
 range/reference/ranges/irange.html
+range/reference/utilities.html
+range/reference/utilities/iterator_range.html
+range/reference/utilities/sub_range.html
+range/reference/utilities/join.html
 range/reference/extending.html
 range/reference/extending/method_1.html
 range/reference/extending/method_2.html
 range/reference/extending/method_3.html
 range/reference/extending/method_3/method_3_1.html
 range/reference/extending/method_3/method_3_2.html
-range/utilities.html
-range/utilities/iterator_range.html
-range/utilities/sub_range.html
-range/utilities/join.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/examples.html
 range/mfc_atl.html
 range/mfc_atl/requirements.html

Modified: branches/release/libs/range/doc/html/range/concepts/bidirectional_range.html
==============================================================================
--- branches/release/libs/range/doc/html/range/concepts/bidirectional_range.html	(original)
+++ branches/release/libs/range/doc/html/range/concepts/bidirectional_range.html	2010-04-29 17:18:58 EDT (Thu, 29 Apr 2010)
@@ -27,7 +27,7 @@
 <a name="range.concepts.bidirectional_range"></a><a class="link" href="bidirectional_range.html" title="Bidirectional Range">Bidirectional Range</a>
 </h3></div></div></div>
 <a name="range.concepts.bidirectional_range.notation"></a><h5>
-<a name="id3017410"></a>
+<a name="id2692676"></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="id3017508"></a>
+<a name="id2692774"></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="id3017574"></a>
+<a name="id2692840"></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="id3017602"></a>
+<a name="id2692868"></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="id3017768"></a>
+<a name="id2693034"></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="id3018247"></a>
+<a name="id2693513"></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="id3018398"></a>
+<a name="id2693664"></a>
         <a class="link" href="bidirectional_range.html#range.concepts.bidirectional_range.invariants">Invariants</a>
       </h5>
 <div class="informaltable"><table class="table">
@@ -272,15 +272,16 @@
 </tbody>
 </table></div>
 <a name="range.concepts.bidirectional_range.see_also"></a><h5>
-<a name="id3018659"></a>
+<a name="id2693925"></a>
         <a class="link" href="bidirectional_range.html#range.concepts.bidirectional_range.see_also">See also</a>
       </h5>
 <p>
-        <a class="link" href="../reference/semantics/metafunctions.html" title="Metafunctions">Implementation of
-        metafunctions</a>
+        <a class="link" href="../reference/concept_implementation/semantics/metafunctions.html" title="Metafunctions">Implementation
+        of metafunctions</a>
       </p>
 <p>
-        <a class="link" href="../reference/semantics/functions.html" title="Functions">Implementation of functions</a>
+        <a class="link" href="../reference/concept_implementation/semantics/functions.html" title="Functions">Implementation
+        of functions</a>
       </p>
 </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/concepts/concept_checking.html
==============================================================================
--- branches/release/libs/range/doc/html/range/concepts/concept_checking.html	(original)
+++ branches/release/libs/range/doc/html/range/concepts/concept_checking.html	2010-04-29 17:18:58 EDT (Thu, 29 Apr 2010)
@@ -79,7 +79,7 @@
 </li>
 </ul></div>
 <a name="range.concepts.concept_checking.see_also"></a><h5>
-<a name="id3019669"></a>
+<a name="id2694938"></a>
         <a class="link" href="concept_checking.html#range.concepts.concept_checking.see_also">See also</a>
       </h5>
 <p>

Modified: branches/release/libs/range/doc/html/range/concepts/forward_range.html
==============================================================================
--- branches/release/libs/range/doc/html/range/concepts/forward_range.html	(original)
+++ branches/release/libs/range/doc/html/range/concepts/forward_range.html	2010-04-29 17:18:58 EDT (Thu, 29 Apr 2010)
@@ -27,7 +27,7 @@
 <a name="range.concepts.forward_range"></a><a class="link" href="forward_range.html" title="Forward Range">Forward Range</a>
 </h3></div></div></div>
 <a name="range.concepts.forward_range.notation"></a><h5>
-<a name="id3017003"></a>
+<a name="id2692268"></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="id3017099"></a>
+<a name="id2692364"></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="id3017171"></a>
+<a name="id2692436"></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="id3017200"></a>
+<a name="id2692465"></a>
         <a class="link" href="forward_range.html#range.concepts.forward_range.associated_types">Associated
         types</a>
       </h5>
@@ -132,15 +132,16 @@
 </tbody>
 </table></div>
 <a name="range.concepts.forward_range.see_also"></a><h5>
-<a name="id3017357"></a>
+<a name="id2692622"></a>
         <a class="link" href="forward_range.html#range.concepts.forward_range.see_also">See also</a>
       </h5>
 <p>
-        <a class="link" href="../reference/semantics/metafunctions.html" title="Metafunctions">Implementation of
-        metafunctions</a>
+        <a class="link" href="../reference/concept_implementation/semantics/metafunctions.html" title="Metafunctions">Implementation
+        of metafunctions</a>
       </p>
 <p>
-        <a class="link" href="../reference/semantics/functions.html" title="Functions">Implementation of functions</a>
+        <a class="link" href="../reference/concept_implementation/semantics/functions.html" title="Functions">Implementation
+        of functions</a>
       </p>
 </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/concepts/random_access_range.html
==============================================================================
--- branches/release/libs/range/doc/html/range/concepts/random_access_range.html	(original)
+++ branches/release/libs/range/doc/html/range/concepts/random_access_range.html	2010-04-29 17:18:58 EDT (Thu, 29 Apr 2010)
@@ -27,7 +27,7 @@
 <a name="range.concepts.random_access_range"></a><a class="link" href="random_access_range.html" title="Random Access Range">Random Access Range</a>
 </h3></div></div></div>
 <a name="range.concepts.random_access_range.description"></a><h5>
-<a name="id3018712"></a>
+<a name="id2693982"></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="id3018784"></a>
+<a name="id2694053"></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="id3018812"></a>
+<a name="id2694081"></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="id3018959"></a>
+<a name="id2694229"></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="id3019185"></a>
+<a name="id2694455"></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="id3019239"></a>
+<a name="id2694508"></a>
         <a class="link" href="random_access_range.html#range.concepts.random_access_range.invariants">Invariants</a>
       </h5>
 <div class="informaltable"><table class="table">

Modified: branches/release/libs/range/doc/html/range/concepts/single_pass_range.html
==============================================================================
--- branches/release/libs/range/doc/html/range/concepts/single_pass_range.html	(original)
+++ branches/release/libs/range/doc/html/range/concepts/single_pass_range.html	2010-04-29 17:18:58 EDT (Thu, 29 Apr 2010)
@@ -27,7 +27,7 @@
 <a name="range.concepts.single_pass_range"></a><a class="link" href="single_pass_range.html" title="Single Pass Range">Single Pass Range</a>
 </h3></div></div></div>
 <a name="range.concepts.single_pass_range.notation"></a><h5>
-<a name="id3015625"></a>
+<a name="id2690886"></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="id3015727"></a>
+<a name="id2690988"></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="id3015799"></a>
+<a name="id2691060"></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="id3015973"></a>
+<a name="id2691234"></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="id3016307"></a>
+<a name="id2691568"></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="id3016578"></a>
+<a name="id2691839"></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="id3016661"></a>
+<a name="id2691922"></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,18 +316,19 @@
 </tbody>
 </table></div>
 <a name="range.concepts.single_pass_range.see_also"></a><h5>
-<a name="id3016932"></a>
+<a name="id2692193"></a>
         <a class="link" href="single_pass_range.html#range.concepts.single_pass_range.see_also">See also</a>
       </h5>
 <p>
         <a class="link" href="../reference/extending.html" title="Extending the library">Extending the library for UDTs</a>
       </p>
 <p>
-        <a class="link" href="../reference/semantics/metafunctions.html" title="Metafunctions">Implementation of
-        metafunctions</a>
+        <a class="link" href="../reference/concept_implementation/semantics/metafunctions.html" title="Metafunctions">Implementation
+        of metafunctions</a>
       </p>
 <p>
-        <a class="link" href="../reference/semantics/functions.html" title="Functions">Implementation of functions</a>
+        <a class="link" href="../reference/concept_implementation/semantics/functions.html" title="Functions">Implementation
+        of functions</a>
       </p>
 <p>
         <a href="http://www.sgi.com/Technology/STL/Container.html" target="_top">Container</a>

Modified: branches/release/libs/range/doc/html/range/examples.html
==============================================================================
--- branches/release/libs/range/doc/html/range/examples.html	(original)
+++ branches/release/libs/range/doc/html/range/examples.html	2010-04-29 17:18:58 EDT (Thu, 29 Apr 2010)
@@ -6,7 +6,7 @@
 <meta name="generator" content="DocBook XSL Stylesheets V1.75.1">
 <link rel="home" href="../index.html" title="Chapter&#160;1.&#160;Range 2.0">
 <link rel="up" href="../index.html" title="Chapter&#160;1.&#160;Range 2.0">
-<link rel="prev" href="library_headers.html" title="Library Headers">
+<link rel="prev" href="library_headers/algorithm_extensions.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.html"><img src="../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../index.html"><img src="../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../index.html"><img src="../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="mfc_atl.html"><img src="../../../../../doc/html/images/next.png" alt="Next"></a>
+<a accesskey="p" href="library_headers/algorithm_extensions.html"><img src="../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../index.html"><img src="../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../index.html"><img src="../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="mfc_atl.html"><img src="../../../../../doc/html/images/next.png" alt="Next"></a>
 </div>
 <div class="section" title="Examples">
 <div class="titlepage"><div><div><h2 class="title" style="clear: both">
@@ -56,7 +56,7 @@
 </tr></table>
 <hr>
 <div class="spirit-nav">
-<a accesskey="p" href="library_headers.html"><img src="../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../index.html"><img src="../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../index.html"><img src="../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="mfc_atl.html"><img src="../../../../../doc/html/images/next.png" alt="Next"></a>
+<a accesskey="p" href="library_headers/algorithm_extensions.html"><img src="../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../index.html"><img src="../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../index.html"><img src="../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="mfc_atl.html"><img src="../../../../../doc/html/images/next.png" alt="Next"></a>
 </div>
 </body>
 </html>

Modified: branches/release/libs/range/doc/html/range/faq.html
==============================================================================
--- branches/release/libs/range/doc/html/range/faq.html	(original)
+++ branches/release/libs/range/doc/html/range/faq.html	2010-04-29 17:18:58 EDT (Thu, 29 Apr 2010)
@@ -46,10 +46,9 @@
 <p>
         </p>
 <p>
-          Note that an <a class="link" href="utilities/iterator_range.html" title="Class iterator_range"><code class="computeroutput"><span class="identifier">iterator_range</span></code></a> is somewhat more
+          Note that an <a class="link" href="reference/utilities/iterator_range.html" title="Class iterator_range"><code class="computeroutput"><span class="identifier">iterator_range</span></code></a> is somewhat more
           convenient than a <code class="computeroutput"><span class="identifier">pair</span></code>
-          and that a <a class="link" href="utilities/sub_range.html" title="Class sub_range"><code class="computeroutput"><span class="identifier">sub_range</span></code></a>
-          does propagate const-ness.
+          and that a <a class="link" href="reference/utilities/sub_range.html" title="Class sub_range"><code class="computeroutput"><span class="identifier">sub_range</span></code></a> does propagate const-ness.
         </p>
 <p>
       </p>

Modified: branches/release/libs/range/doc/html/range/history_ack.html
==============================================================================
--- branches/release/libs/range/doc/html/range/history_ack.html	(original)
+++ branches/release/libs/range/doc/html/range/history_ack.html	2010-04-29 17:18:58 EDT (Thu, 29 Apr 2010)
@@ -25,6 +25,11 @@
 <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>
 </h2></div></div></div>
+<a name="range.history_ack.version_1___before_boost_1_43"></a><h4>
+<a name="id2824280"></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>
 <p>
       The library have been under way for a long time. Dietmar K&#252;hl originally intended
       to submit an <code class="computeroutput"><span class="identifier">array_traits</span></code> class
@@ -73,6 +78,59 @@
 <p>
       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="id2824384"></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>
+<p>
+      This version introduced Range Adaptors and Range Algorithms. This version 2
+      is the result of a merge of all of the RangeEx features into Boost.Range.
+    </p>
+<p>
+      There were an enormous number of very significant contributors through all
+      stages of this library.
+    </p>
+<p>
+      The people in the following list all made contributions in the form of reviews,
+      user feedback, design suggestions, or defect detection:
+    </p>
+<div class="itemizedlist"><ul class="itemizedlist" type="disc">
+<li class="listitem">
+        Thorsten Ottosen: review management, design advice, documentation feedback
+      </li>
+<li class="listitem">
+        Eric Niebler: feedback
+      </li>
+<li class="listitem">
+        Joel de Guzman: review
+      </li>
+<li class="listitem">
+        Mathias Gaunard: review
+      </li>
+<li class="listitem">
+        David Abrahams: implementation advice
+      </li>
+<li class="listitem">
+        Robert Jones: defect reports, usage feedback
+      </li>
+<li class="listitem">
+        Sean Parent: contributed experience from the Adobe range library
+      </li>
+<li class="listitem">
+        Arno Schoedl: implementations, and review
+      </li>
+<li class="listitem">
+        Rogier van Dalen: review
+      </li>
+<li class="listitem">
+        Vincente Botet: review, documentation feedback
+      </li>
+</ul></div>
+<p>
+      Regardless of how I write this section it will never truly fairly capture the
+      gratitude that I feel to all who have contributed. Thank you everyone.
+    </p>
 </div>
 <table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
 <td align="left"></td>

Modified: branches/release/libs/range/doc/html/range/library_headers.html
==============================================================================
--- branches/release/libs/range/doc/html/range/library_headers.html	(original)
+++ branches/release/libs/range/doc/html/range/library_headers.html	2010-04-29 17:18:58 EDT (Thu, 29 Apr 2010)
@@ -7,7 +7,7 @@
 <link rel="home" href="../index.html" title="Chapter&#160;1.&#160;Range 2.0">
 <link rel="up" href="../index.html" title="Chapter&#160;1.&#160;Range 2.0">
 <link rel="prev" href="style_guide.html" title="Terminology and style guidelines">
-<link rel="next" href="examples.html" title="Examples">
+<link rel="next" href="library_headers/general.html" title="General">
 </head>
 <body bgcolor="white" text="black" link="#0000FF" vlink="#840084" alink="#0000FF">
 <table cellpadding="2" width="100%"><tr>
@@ -20,401 +20,19 @@
 </tr></table>
 <hr>
 <div class="spirit-nav">
-<a accesskey="p" href="style_guide.html"><img src="../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../index.html"><img src="../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../index.html"><img src="../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="examples.html"><img src="../../../../../doc/html/images/next.png" alt="Next"></a>
+<a accesskey="p" href="style_guide.html"><img src="../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../index.html"><img src="../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../index.html"><img src="../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="library_headers/general.html"><img src="../../../../../doc/html/images/next.png" alt="Next"></a>
 </div>
 <div class="section" title="Library Headers">
 <div class="titlepage"><div><div><h2 class="title" style="clear: both">
 <a name="range.library_headers"></a><a class="link" href="library_headers.html" title="Library Headers">Library Headers</a>
 </h2></div></div></div>
-<div class="informaltable"><table class="table">
-<colgroup>
-<col>
-<col>
-<col>
-</colgroup>
-<thead><tr>
-<th>
-              <p>
-                Header
-              </p>
-            </th>
-<th>
-              <p>
-                Includes
-              </p>
-            </th>
-<th>
-              <p>
-                Related Concept
-              </p>
-            </th>
-</tr></thead>
-<tbody>
-<tr>
-<td>
-              <p>
-                <code class="computeroutput"><span class="special">&lt;</span><span class="identifier">boost</span><span class="special">/</span><span class="identifier">range</span><span class="special">.</span><span class="identifier">hpp</span><span class="special">&gt;</span></code>
-              </p>
-            </td>
-<td>
-              <p>
-                everything from Boost.Range version 1 (Boost versions 1.42 and below).
-                Includes the core range functions and metafunctinos, but excludes
-                Range Adaptors and Range Algorithms.
-              </p>
-            </td>
-<td>
-              <p>
-                -
-              </p>
-            </td>
-</tr>
-<tr>
-<td>
-              <p>
-                <code class="computeroutput"><span class="special">&lt;</span><span class="identifier">boost</span><span class="special">/</span><span class="identifier">range</span><span class="special">/</span><span class="identifier">metafunctions</span><span class="special">.</span><span class="identifier">hpp</span><span class="special">&gt;</span></code>
-              </p>
-            </td>
-<td>
-              <p>
-                every metafunction
-              </p>
-            </td>
-<td>
-              <p>
-                -
-              </p>
-            </td>
-</tr>
-<tr>
-<td>
-              <p>
-                <code class="computeroutput"><span class="special">&lt;</span><span class="identifier">boost</span><span class="special">/</span><span class="identifier">range</span><span class="special">/</span><span class="identifier">functions</span><span class="special">.</span><span class="identifier">hpp</span><span class="special">&gt;</span></code>
-              </p>
-            </td>
-<td>
-              <p>
-                every function
-              </p>
-            </td>
-<td>
-              <p>
-                -
-              </p>
-            </td>
-</tr>
-<tr>
-<td>
-              <p>
-                <code class="computeroutput"><span class="special">&lt;</span><span class="identifier">boost</span><span class="special">/</span><span class="identifier">range</span><span class="special">/</span><span class="identifier">value_type</span><span class="special">.</span><span class="identifier">hpp</span><span class="special">&gt;</span></code>
-              </p>
-            </td>
-<td>
-              <p>
-                <a class="link" href="reference/semantics/metafunctions.html" title="Metafunctions"><code class="computeroutput"><span class="identifier">range_value</span></code></a>
-              </p>
-            </td>
-<td>
-              <p>
-                <a class="link" href="concepts/single_pass_range.html" title="Single Pass Range">Single Pass Range</a>
-              </p>
-            </td>
-</tr>
-<tr>
-<td>
-              <p>
-                <code class="computeroutput"><span class="special">&lt;</span><span class="identifier">boost</span><span class="special">/</span><span class="identifier">range</span><span class="special">/</span><span class="identifier">iterator</span><span class="special">.</span><span class="identifier">hpp</span><span class="special">&gt;</span></code>
-              </p>
-            </td>
-<td>
-              <p>
-                <a class="link" href="reference/semantics/metafunctions.html" title="Metafunctions"><code class="computeroutput"><span class="identifier">range_iterator</span></code></a>
-              </p>
-            </td>
-<td>
-              <p>
-                <a class="link" href="concepts/single_pass_range.html" title="Single Pass Range">Single Pass Range</a>
-              </p>
-            </td>
-</tr>
-<tr>
-<td>
-              <p>
-                <code class="computeroutput"><span class="special">&lt;</span><span class="identifier">boost</span><span class="special">/</span><span class="identifier">range</span><span class="special">/</span><span class="identifier">difference_type</span><span class="special">.</span><span class="identifier">hpp</span><span class="special">&gt;</span></code>
-              </p>
-            </td>
-<td>
-              <p>
-                <a class="link" href="reference/semantics/metafunctions.html" title="Metafunctions"><code class="computeroutput"><span class="identifier">range_difference</span></code></a>
-              </p>
-            </td>
-<td>
-              <p>
-                <a class="link" href="concepts/forward_range.html" title="Forward Range">Forward Range</a>
-              </p>
-            </td>
-</tr>
-<tr>
-<td>
-              <p>
-                <code class="computeroutput"><span class="special">&lt;</span><span class="identifier">boost</span><span class="special">/</span><span class="identifier">range</span><span class="special">/</span><span class="identifier">pointer</span><span class="special">.</span><span class="identifier">hpp</span><span class="special">&gt;</span></code>
-              </p>
-            </td>
-<td>
-              <p>
-                <a class="link" href="reference/semantics/metafunctions.html" title="Metafunctions"><code class="computeroutput"><span class="identifier">range_pointer</span></code></a>
-              </p>
-            </td>
-<td>
-              <p>
-                -
-              </p>
-            </td>
-</tr>
-<tr>
-<td>
-              <p>
-                <code class="computeroutput"><span class="special">&lt;</span><span class="identifier">boost</span><span class="special">/</span><span class="identifier">range</span><span class="special">/</span><span class="identifier">category</span><span class="special">.</span><span class="identifier">hpp</span><span class="special">&gt;</span></code>
-              </p>
-            </td>
-<td>
-              <p>
-                <a class="link" href="reference/semantics/metafunctions.html" title="Metafunctions"><code class="computeroutput"><span class="identifier">range_category</span></code></a>
-              </p>
-            </td>
-<td>
-              <p>
-                -
-              </p>
-            </td>
-</tr>
-<tr>
-<td>
-              <p>
-                <code class="computeroutput"><span class="special">&lt;</span><span class="identifier">boost</span><span class="special">/</span><span class="identifier">range</span><span class="special">/</span><span class="identifier">reverse_iterator</span><span class="special">.</span><span class="identifier">hpp</span><span class="special">&gt;</span></code>
-              </p>
-            </td>
-<td>
-              <p>
-                <a class="link" href="reference/semantics/metafunctions.html" title="Metafunctions"><code class="computeroutput"><span class="identifier">range_reverse_iterator</span></code></a>
-              </p>
-            </td>
-<td>
-              <p>
-                <a class="link" href="concepts/bidirectional_range.html" title="Bidirectional Range">Bidirectional
-                Range</a>
-              </p>
-            </td>
-</tr>
-<tr>
-<td>
-              <p>
-                <code class="computeroutput"><span class="special">&lt;</span><span class="identifier">boost</span><span class="special">/</span><span class="identifier">range</span><span class="special">/</span><span class="identifier">begin</span><span class="special">.</span><span class="identifier">hpp</span><span class="special">&gt;</span></code>
-              </p>
-            </td>
-<td>
-              <p>
-                <a class="link" href="reference/semantics/functions.html" title="Functions"><code class="computeroutput"><span class="identifier">begin</span></code></a> and <a class="link" href="reference/semantics/functions.html" title="Functions"><code class="computeroutput"><span class="identifier">const_begin</span></code></a>
-              </p>
-            </td>
-<td>
-              <p>
-                <a class="link" href="concepts/single_pass_range.html" title="Single Pass Range">Single Pass Range</a>
-              </p>
-            </td>
-</tr>
-<tr>
-<td>
-              <p>
-                <code class="computeroutput"><span class="special">&lt;</span><span class="identifier">boost</span><span class="special">/</span><span class="identifier">range</span><span class="special">/</span><span class="identifier">end</span><span class="special">.</span><span class="identifier">hpp</span><span class="special">&gt;</span></code>
-              </p>
-            </td>
-<td>
-              <p>
-                <a class="link" href="reference/semantics/functions.html" title="Functions"><code class="computeroutput"><span class="identifier">end</span></code></a> and <a class="link" href="reference/semantics/functions.html" title="Functions"><code class="computeroutput"><span class="identifier">const_end</span></code></a>
-              </p>
-            </td>
-<td>
-              <p>
-                <a class="link" href="concepts/single_pass_range.html" title="Single Pass Range">Single Pass Range</a>
-              </p>
-            </td>
-</tr>
-<tr>
-<td>
-              <p>
-                <code class="computeroutput"><span class="special">&lt;</span><span class="identifier">boost</span><span class="special">/</span><span class="identifier">range</span><span class="special">/</span><span class="identifier">empty</span><span class="special">.</span><span class="identifier">hpp</span><span class="special">&gt;</span></code>
-              </p>
-            </td>
-<td>
-              <p>
-                <a class="link" href="reference/semantics/functions.html" title="Functions"><code class="computeroutput"><span class="identifier">empty</span></code></a>
-              </p>
-            </td>
-<td>
-              <p>
-                <a class="link" href="concepts/single_pass_range.html" title="Single Pass Range">Single Pass Range</a>
-              </p>
-            </td>
-</tr>
-<tr>
-<td>
-              <p>
-                <code class="computeroutput"><span class="special">&lt;</span><span class="identifier">boost</span><span class="special">/</span><span class="identifier">range</span><span class="special">/</span><span class="identifier">distance</span><span class="special">.</span><span class="identifier">hpp</span><span class="special">&gt;</span></code>
-              </p>
-            </td>
-<td>
-              <p>
-                <a class="link" href="reference/semantics/functions.html" title="Functions"><code class="computeroutput"><span class="identifier">distance</span></code></a>
-              </p>
-            </td>
-<td>
-              <p>
-                <a class="link" href="concepts/forward_range.html" title="Forward Range">Forward Range</a>
-              </p>
-            </td>
-</tr>
-<tr>
-<td>
-              <p>
-                <code class="computeroutput"><span class="special">&lt;</span><span class="identifier">boost</span><span class="special">/</span><span class="identifier">range</span><span class="special">/</span><span class="identifier">size</span><span class="special">.</span><span class="identifier">hpp</span><span class="special">&gt;</span></code>
-              </p>
-            </td>
-<td>
-              <p>
-                <a class="link" href="reference/semantics/functions.html" title="Functions"><code class="computeroutput"><span class="identifier">size</span></code></a>
-              </p>
-            </td>
-<td>
-              <p>
-                <a class="link" href="concepts/random_access_range.html" title="Random Access Range">Random Access
-                Range</a>
-              </p>
-            </td>
-</tr>
-<tr>
-<td>
-              <p>
-                <code class="computeroutput"><span class="special">&lt;</span><span class="identifier">boost</span><span class="special">/</span><span class="identifier">range</span><span class="special">/</span><span class="identifier">rbegin</span><span class="special">.</span><span class="identifier">hpp</span><span class="special">&gt;</span></code>
-              </p>
-            </td>
-<td>
-              <p>
-                <a class="link" href="reference/semantics/functions.html" title="Functions"><code class="computeroutput"><span class="identifier">rbegin</span></code></a> and <a class="link" href="reference/semantics/functions.html" title="Functions"><code class="computeroutput"><span class="identifier">const_rbegin</span></code></a>
-              </p>
-            </td>
-<td>
-              <p>
-                <a class="link" href="concepts/bidirectional_range.html" title="Bidirectional Range">Bidirectional
-                Range</a>
-              </p>
-            </td>
-</tr>
-<tr>
-<td>
-              <p>
-                <code class="computeroutput"><span class="special">&lt;</span><span class="identifier">boost</span><span class="special">/</span><span class="identifier">range</span><span class="special">/</span><span class="identifier">rend</span><span class="special">.</span><span class="identifier">hpp</span><span class="special">&gt;</span></code>
-              </p>
-            </td>
-<td>
-              <p>
-                <a class="link" href="reference/semantics/functions.html" title="Functions"><code class="computeroutput"><span class="identifier">rend</span></code></a> and <a class="link" href="reference/semantics/functions.html" title="Functions"><code class="computeroutput"><span class="identifier">const_rend</span></code></a>
-              </p>
-            </td>
-<td>
-              <p>
-                <a class="link" href="concepts/bidirectional_range.html" title="Bidirectional Range">Bidirectional
-                Range</a>
-              </p>
-            </td>
-</tr>
-<tr>
-<td>
-              <p>
-                <code class="computeroutput"><span class="special">&lt;</span><span class="identifier">boost</span><span class="special">/</span><span class="identifier">range</span><span class="special">/</span><span class="identifier">as_array</span><span class="special">.</span><span class="identifier">hpp</span><span class="special">&gt;</span></code>
-              </p>
-            </td>
-<td>
-              <p>
-                <a class="link" href="reference/semantics/functions.html" title="Functions"><code class="computeroutput"><span class="identifier">as_array</span></code></a>
-              </p>
-            </td>
-<td>
-              <p>
-                -
-              </p>
-            </td>
-</tr>
-<tr>
-<td>
-              <p>
-                <code class="computeroutput"><span class="special">&lt;</span><span class="identifier">boost</span><span class="special">/</span><span class="identifier">range</span><span class="special">/</span><span class="identifier">as_literal</span><span class="special">.</span><span class="identifier">hpp</span><span class="special">&gt;</span></code>
-              </p>
-            </td>
-<td>
-              <p>
-                <a class="link" href="reference/semantics/functions.html" title="Functions"><code class="computeroutput"><span class="identifier">as_literal</span></code></a>
-              </p>
-            </td>
-<td>
-              <p>
-                -
-              </p>
-            </td>
-</tr>
-<tr>
-<td>
-              <p>
-                <code class="computeroutput"><span class="special">&lt;</span><span class="identifier">boost</span><span class="special">/</span><span class="identifier">range</span><span class="special">/</span><span class="identifier">iterator_range</span><span class="special">.</span><span class="identifier">hpp</span><span class="special">&gt;</span></code>
-              </p>
-            </td>
-<td>
-              <p>
-                <a class="link" href="utilities/iterator_range.html" title="Class iterator_range"><code class="computeroutput"><span class="identifier">iterator_range</span></code></a>
-              </p>
-            </td>
-<td>
-              <p>
-                -
-              </p>
-            </td>
-</tr>
-<tr>
-<td>
-              <p>
-                <code class="computeroutput"><span class="special">&lt;</span><span class="identifier">boost</span><span class="special">/</span><span class="identifier">range</span><span class="special">/</span><span class="identifier">sub_range</span><span class="special">.</span><span class="identifier">hpp</span><span class="special">&gt;</span></code>
-              </p>
-            </td>
-<td>
-              <p>
-                <a class="link" href="utilities/sub_range.html" title="Class sub_range"><code class="computeroutput"><span class="identifier">sub_range</span></code></a>
-              </p>
-            </td>
-<td>
-              <p>
-                -
-              </p>
-            </td>
-</tr>
-<tr>
-<td>
-              <p>
-                <code class="computeroutput"><span class="special">&lt;</span><span class="identifier">boost</span><span class="special">/</span><span class="identifier">range</span><span class="special">/</span><span class="identifier">concepts</span><span class="special">.</span><span class="identifier">hpp</span><span class="special">&gt;</span></code>
-              </p>
-            </td>
-<td>
-              <p>
-                <a class="link" href="concepts.html" title="Range Concepts">Range concepts</a>
-              </p>
-            </td>
-<td>
-              <p>
-                -
-              </p>
-            </td>
-</tr>
-</tbody>
-</table></div>
+<div class="toc"><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="library_headers/algorithm_extensions.html">Algorithm
+      Extensions</a></span></dt>
+</dl></div>
 </div>
 <table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
 <td align="left"></td>
@@ -426,7 +44,7 @@
 </tr></table>
 <hr>
 <div class="spirit-nav">
-<a accesskey="p" href="style_guide.html"><img src="../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../index.html"><img src="../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../index.html"><img src="../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="examples.html"><img src="../../../../../doc/html/images/next.png" alt="Next"></a>
+<a accesskey="p" href="style_guide.html"><img src="../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../index.html"><img src="../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../index.html"><img src="../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="library_headers/general.html"><img src="../../../../../doc/html/images/next.png" alt="Next"></a>
 </div>
 </body>
 </html>

Modified: branches/release/libs/range/doc/html/range/mfc_atl.html
==============================================================================
--- branches/release/libs/range/doc/html/range/mfc_atl.html	(original)
+++ branches/release/libs/range/doc/html/range/mfc_atl.html	2010-04-29 17:18:58 EDT (Thu, 29 Apr 2010)
@@ -34,7 +34,7 @@
 <dt><span class="section"> References</span></dt>
 </dl></div>
 <a name="range.mfc_atl.introduction"></a><h5>
-<a name="id3128780"></a>
+<a name="id2817920"></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="id3128918"></a>
+<a name="id2818057"></a>
       <a class="link" href="mfc_atl.html#range.mfc_atl.overview">Overview</a>
     </h5>
 <p>

Modified: branches/release/libs/range/doc/html/range/portability.html
==============================================================================
--- branches/release/libs/range/doc/html/range/portability.html	(original)
+++ branches/release/libs/range/doc/html/range/portability.html	2010-04-29 17:18:58 EDT (Thu, 29 Apr 2010)
@@ -38,7 +38,7 @@
     </p>
 <p>
       Notice also that some compilers cannot do function template ordering properly.
-      In that case one must rely of <a class="link" href="reference/semantics/metafunctions.html" title="Metafunctions"><code class="computeroutput"><span class="identifier">range_iterator</span></code></a> and a single function
+      In that case one must rely of <a class="link" href="reference/concept_implementation/semantics/metafunctions.html" title="Metafunctions"><code class="computeroutput"><span class="identifier">range_iterator</span></code></a> and a single function
       definition instead of overloaded versions for const and non-const arguments.
       So if one cares about old compilers, one should not pass rvalues to the functions.
     </p>
@@ -50,12 +50,14 @@
         do not use built-in arrays,
       </li>
 <li class="listitem">
-        do not pass rvalues to <a class="link" href="reference/semantics/functions.html" title="Functions"><code class="computeroutput"><span class="identifier">begin</span></code></a><code class="computeroutput"><span class="special">()</span></code>,
-        <a class="link" href="reference/semantics/functions.html" title="Functions"><code class="computeroutput"><span class="identifier">end</span></code></a><code class="computeroutput"><span class="special">()</span></code> and <a class="link" href="utilities/iterator_range.html" title="Class iterator_range"><code class="computeroutput"><span class="identifier">iterator_range</span></code></a> Range constructors
+        do not pass rvalues to <a class="link" href="reference/concept_implementation/semantics/functions.html" title="Functions"><code class="computeroutput"><span class="identifier">begin</span></code></a><code class="computeroutput"><span class="special">()</span></code>,
+        <a class="link" href="reference/concept_implementation/semantics/functions.html" title="Functions"><code class="computeroutput"><span class="identifier">end</span></code></a><code class="computeroutput"><span class="special">()</span></code>
+        and <a class="link" href="reference/utilities/iterator_range.html" title="Class iterator_range"><code class="computeroutput"><span class="identifier">iterator_range</span></code></a> Range constructors
         and assignment operators,
       </li>
 <li class="listitem">
-        use <a class="link" href="reference/semantics/functions.html" title="Functions"><code class="computeroutput"><span class="identifier">const_begin</span></code></a><code class="computeroutput"><span class="special">()</span></code> and <a class="link" href="reference/semantics/functions.html" title="Functions"><code class="computeroutput"><span class="identifier">const_end</span></code></a><code class="computeroutput"><span class="special">()</span></code>
+        use <a class="link" href="reference/concept_implementation/semantics/functions.html" title="Functions"><code class="computeroutput"><span class="identifier">const_begin</span></code></a><code class="computeroutput"><span class="special">()</span></code>
+        and <a class="link" href="reference/concept_implementation/semantics/functions.html" title="Functions"><code class="computeroutput"><span class="identifier">const_end</span></code></a><code class="computeroutput"><span class="special">()</span></code>
         whenever your code by intention is read-only; this will also solve most rvalue
         problems,
       </li>

Modified: branches/release/libs/range/doc/html/range/reference.html
==============================================================================
--- branches/release/libs/range/doc/html/range/reference.html	(original)
+++ branches/release/libs/range/doc/html/range/reference.html	2010-04-29 17:18:58 EDT (Thu, 29 Apr 2010)
@@ -24,41 +24,37 @@
 </div>
 <div class="section" title="Reference">
 <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">Synopsis</span></dt>
-<dt><span class="section">Semantics</span></dt>
+<dt><span class="section"><a href="reference/concept_implementation.html"> Range concept
+      implementation</a></span></dt>
 <dd><dl>
-<dt><span class="section">Metafunctions</span></dt>
-<dt><span class="section">Functions</span></dt>
+<dt><span class="section">Synopsis</span></dt>
+<dt><span class="section">Semantics</span></dt>
 </dl></dd>
 <dt><span class="section"> Range Adaptors</span></dt>
 <dd><dl>
-<dt><span class="section"><a href="reference/adaptors/adaptors_introduction.html"> Introduction
+<dt><span class="section"><a href="reference/adaptors/introduction.html"> Introduction
         and motivation</a></span></dt>
-<dt><span class="section"> Synopsis</span></dt>
-<dt><span class="section"><a href="reference/adaptors/adaptors_general_requirements.html">
-        General Requirements</a></span></dt>
-<dt><span class="section"> Reference</span></dt>
+<dt><span class="section"><a href="reference/adaptors/general_requirements.html"> General
+        Requirements</a></span></dt>
+<dt><span class="section"> Reference</span></dt>
 </dl></dd>
 <dt><span class="section"> Range Algorithm</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"><a href="reference/algorithms/range_algorithm_mutating_algorithms.html">
-        Mutating algorithms</a></span></dt>
-<dt><span class="section"><a href="reference/algorithms/range_algorithm_non_mutating_algorithms.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_algorithms.html">
-        Permutation algorithms</a></span></dt>
-<dt><span class="section"><a href="reference/algorithms/range_algorithm_new_algorithms.html">
-        New algorithms</a></span></dt>
-<dt><span class="section"><a href="reference/algorithms/range_numeric.html"> Numeric
+<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
+        algorithms</a></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>
 <dd><dl>
@@ -66,6 +62,12 @@
 <dt><span class="section"> istream_range</span></dt>
 <dt><span class="section"> irange</span></dt>
 </dl></dd>
+<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>
+</dl></dd>
 <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

Modified: branches/release/libs/range/doc/html/range/reference/adaptors.html
==============================================================================
--- branches/release/libs/range/doc/html/range/reference/adaptors.html	(original)
+++ branches/release/libs/range/doc/html/range/reference/adaptors.html	2010-04-29 17:18:58 EDT (Thu, 29 Apr 2010)
@@ -6,8 +6,8 @@
 <meta name="generator" content="DocBook XSL Stylesheets V1.75.1">
 <link rel="home" href="../../index.html" title="Chapter&#160;1.&#160;Range 2.0">
 <link rel="up" href="../reference.html" title="Reference">
-<link rel="prev" href="semantics/functions.html" title="Functions">
-<link rel="next" href="adaptors/adaptors_introduction.html" title="Introduction and motivation">
+<link rel="prev" href="concept_implementation/semantics/functions.html" title="Functions">
+<link rel="next" href="adaptors/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,19 +20,18 @@
 </tr></table>
 <hr>
 <div class="spirit-nav">
-<a accesskey="p" href="semantics/functions.html"><img src="../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../reference.html"><img src="../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="adaptors/adaptors_introduction.html"><img src="../../../../../../doc/html/images/next.png" alt="Next"></a>
+<a accesskey="p" href="concept_implementation/semantics/functions.html"><img src="../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../reference.html"><img src="../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="adaptors/introduction.html"><img src="../../../../../../doc/html/images/next.png" alt="Next"></a>
 </div>
 <div class="section" title="Range Adaptors">
 <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>
 </h3></div></div></div>
 <div class="toc"><dl>
-<dt><span class="section"><a href="adaptors/adaptors_introduction.html"> Introduction
+<dt><span class="section"><a href="adaptors/introduction.html"> Introduction
         and motivation</a></span></dt>
-<dt><span class="section"> Synopsis</span></dt>
-<dt><span class="section"><a href="adaptors/adaptors_general_requirements.html">
-        General Requirements</a></span></dt>
-<dt><span class="section"> Reference</span></dt>
+<dt><span class="section"><a href="adaptors/general_requirements.html"> General
+        Requirements</a></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>
@@ -45,7 +44,7 @@
 </tr></table>
 <hr>
 <div class="spirit-nav">
-<a accesskey="p" href="semantics/functions.html"><img src="../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../reference.html"><img src="../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="adaptors/adaptors_introduction.html"><img src="../../../../../../doc/html/images/next.png" alt="Next"></a>
+<a accesskey="p" href="concept_implementation/semantics/functions.html"><img src="../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../reference.html"><img src="../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="adaptors/introduction.html"><img src="../../../../../../doc/html/images/next.png" alt="Next"></a>
 </div>
 </body>
 </html>

Modified: branches/release/libs/range/doc/html/range/reference/adaptors/adaptors_introduction.html
==============================================================================
--- branches/release/libs/range/doc/html/range/reference/adaptors/adaptors_introduction.html	(original)
+++ branches/release/libs/range/doc/html/range/reference/adaptors/adaptors_introduction.html	2010-04-29 17:18:58 EDT (Thu, 29 Apr 2010)
@@ -122,7 +122,7 @@
           situations, you will really appreciate the succinctness of <code class="computeroutput"><span class="keyword">operator</span><span class="special">|()</span></code>.
         </p>
 <a name="range.reference.adaptors.adaptors_introduction.composition_of_adaptors"></a><h6>
-<a name="id3026637"></a>
+<a name="id3057363"></a>
           <a class="link" href="adaptors_introduction.html#range.reference.adaptors.adaptors_introduction.composition_of_adaptors">Composition
           of Adaptors</a>
         </h6>
@@ -159,7 +159,7 @@
           is the design solution to this problem.
         </p>
 <a name="range.reference.adaptors.adaptors_introduction.range_adaptor_alternative_to_copy_if_algorithm"></a><h6>
-<a name="id3026947"></a>
+<a name="id3057673"></a>
           <a class="link" href="adaptors_introduction.html#range.reference.adaptors.adaptors_introduction.range_adaptor_alternative_to_copy_if_algorithm">Range
           Adaptor alternative to copy_if algorithm</a>
         </h6>
@@ -176,7 +176,7 @@
 <p>
         </p>
 <a name="range.reference.adaptors.adaptors_introduction.range_adaptor_alternative_to_count_if_algorithm"></a><h6>
-<a name="id3027116"></a>
+<a name="id3057842"></a>
           <a class="link" href="adaptors_introduction.html#range.reference.adaptors.adaptors_introduction.range_adaptor_alternative_to_count_if_algorithm">Range
           Adaptor alternative to count_if algorithm</a>
         </h6>

Modified: branches/release/libs/range/doc/html/range/reference/adaptors/adaptors_synopsis.html
==============================================================================
--- branches/release/libs/range/doc/html/range/reference/adaptors/adaptors_synopsis.html	(original)
+++ branches/release/libs/range/doc/html/range/reference/adaptors/adaptors_synopsis.html	2010-04-29 17:18:58 EDT (Thu, 29 Apr 2010)
@@ -6,8 +6,8 @@
 <meta name="generator" content="DocBook XSL Stylesheets V1.75.1">
 <link rel="home" href="../../../index.html" title="Chapter&#160;1.&#160;Range 2.0">
 <link rel="up" href="../adaptors.html" title="Range Adaptors">
-<link rel="prev" href="adaptors_introduction.html" title="Introduction and motivation">
-<link rel="next" href="adaptors_general_requirements.html" title="General Requirements">
+<link rel="prev" href="introduction.html" title="Introduction and motivation">
+<link rel="next" href="general_requirements.html" title="General Requirements">
 </head>
 <body bgcolor="white" text="black" link="#0000FF" vlink="#840084" alink="#0000FF">
 <table cellpadding="2" width="100%"><tr>
@@ -20,7 +20,7 @@
 </tr></table>
 <hr>
 <div class="spirit-nav">
-<a accesskey="p" href="adaptors_introduction.html"><img src="../../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../adaptors.html"><img src="../../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../../index.html"><img src="../../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="adaptors_general_requirements.html"><img src="../../../../../../../doc/html/images/next.png" alt="Next"></a>
+<a accesskey="p" href="introduction.html"><img src="../../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../adaptors.html"><img src="../../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../../index.html"><img src="../../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="general_requirements.html"><img src="../../../../../../../doc/html/images/next.png" alt="Next"></a>
 </div>
 <div class="section" title="Synopsis">
 <div class="titlepage"><div><div><h4 class="title">
@@ -61,7 +61,7 @@
 </tr></table>
 <hr>
 <div class="spirit-nav">
-<a accesskey="p" href="adaptors_introduction.html"><img src="../../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../adaptors.html"><img src="../../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../../index.html"><img src="../../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="adaptors_general_requirements.html"><img src="../../../../../../../doc/html/images/next.png" alt="Next"></a>
+<a accesskey="p" href="introduction.html"><img src="../../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../adaptors.html"><img src="../../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../../index.html"><img src="../../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="general_requirements.html"><img src="../../../../../../../doc/html/images/next.png" alt="Next"></a>
 </div>
 </body>
 </html>

Modified: branches/release/libs/range/doc/html/range/reference/algorithms.html
==============================================================================
--- branches/release/libs/range/doc/html/range/reference/algorithms.html	(original)
+++ branches/release/libs/range/doc/html/range/reference/algorithms.html	2010-04-29 17:18:58 EDT (Thu, 29 Apr 2010)
@@ -6,7 +6,7 @@
 <meta name="generator" content="DocBook XSL Stylesheets V1.75.1">
 <link rel="home" href="../../index.html" title="Chapter&#160;1.&#160;Range 2.0">
 <link rel="up" href="../reference.html" title="Reference">
-<link rel="prev" href="adaptors/adaptors_reference/uniqued.html" title="uniqued">
+<link rel="prev" href="adaptors/reference/uniqued.html" title="uniqued">
 <link rel="next" href="algorithms/range_algorithm_introduction.html" title="Introduction and motivation">
 </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="adaptors/adaptors_reference/uniqued.html"><img src="../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../reference.html"><img src="../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="algorithms/range_algorithm_introduction.html"><img src="../../../../../../doc/html/images/next.png" alt="Next"></a>
+<a accesskey="p" href="adaptors/reference/uniqued.html"><img src="../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../reference.html"><img src="../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="algorithms/range_algorithm_introduction.html"><img src="../../../../../../doc/html/images/next.png" alt="Next"></a>
 </div>
 <div class="section" title="Range Algorithm">
 <div class="titlepage"><div><div><h3 class="title">
@@ -29,18 +29,15 @@
 <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"><a href="algorithms/range_algorithm_mutating_algorithms.html">
-        Mutating algorithms</a></span></dt>
-<dt><span class="section"><a href="algorithms/range_algorithm_non_mutating_algorithms.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_algorithms.html">
-        Permutation algorithms</a></span></dt>
-<dt><span class="section"><a href="algorithms/range_algorithm_new_algorithms.html">
-        New algorithms</a></span></dt>
-<dt><span class="section"><a href="algorithms/range_numeric.html"> Numeric
+<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
+        algorithms</a></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>
@@ -53,7 +50,7 @@
 </tr></table>
 <hr>
 <div class="spirit-nav">
-<a accesskey="p" href="adaptors/adaptors_reference/uniqued.html"><img src="../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../reference.html"><img src="../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="algorithms/range_algorithm_introduction.html"><img src="../../../../../../doc/html/images/next.png" alt="Next"></a>
+<a accesskey="p" href="adaptors/reference/uniqued.html"><img src="../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../reference.html"><img src="../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="algorithms/range_algorithm_introduction.html"><img src="../../../../../../doc/html/images/next.png" alt="Next"></a>
 </div>
 </body>
 </html>

Deleted: branches/release/libs/range/doc/html/range/reference/algorithms/heap_algorithms.html
==============================================================================
--- branches/release/libs/range/doc/html/range/reference/algorithms/heap_algorithms.html	2010-04-29 17:18:58 EDT (Thu, 29 Apr 2010)
+++ (empty file)
@@ -1,53 +0,0 @@
-<html>
-<head>
-<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
-<title>Heap algorithms</title>
-<link rel="stylesheet" href="../../../../../../../doc/html/boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.75.1">
-<link rel="home" href="../../../index.html" title="Chapter&#160;1.&#160;Range 2.0">
-<link rel="up" href="../algorithms.html" title="Range Algorithm">
-<link rel="prev" href="set_algorithms/set_symmetric_difference.html" title="set_symmetric_difference">
-<link rel="next" href="heap_algorithms/push_heap.html" title="push_heap">
-</head>
-<body bgcolor="white" text="black" link="#0000FF" vlink="#840084" alink="#0000FF">
-<table cellpadding="2" width="100%"><tr>
-<td valign="top"><img alt="Boost C++ Libraries" width="277" height="86" src="../../../../../../../boost.png"></td>
-<td align="center">Home</td>
-<td align="center">Libraries</td>
-<td align="center">People</td>
-<td align="center">FAQ</td>
-<td align="center">More</td>
-</tr></table>
-<hr>
-<div class="spirit-nav">
-<a accesskey="p" href="set_algorithms/set_symmetric_difference.html"><img src="../../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../algorithms.html"><img src="../../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../../index.html"><img src="../../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="heap_algorithms/push_heap.html"><img src="../../../../../../../doc/html/images/next.png" alt="Next"></a>
-</div>
-<div class="section" title="Heap algorithms">
-<div class="titlepage"><div><div><h4 class="title">
-<a name="range.reference.algorithms.heap_algorithms"></a><a class="link" href="heap_algorithms.html" title="Heap algorithms"> Heap algorithms</a>
-</h4></div></div></div>
-<div class="toc"><dl>
-<dt><span class="section"><a href="heap_algorithms/push_heap.html">
-          push_heap</a></span></dt>
-<dt><span class="section"><a href="heap_algorithms/pop_heap.html">
-          pop_heap</a></span></dt>
-<dt><span class="section"><a href="heap_algorithms/make_heap.html">
-          make_heap</a></span></dt>
-<dt><span class="section"><a href="heap_algorithms/sort_heap.html">
-          sort_heap</a></span></dt>
-</dl></div>
-</div>
-<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
-<td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright &#169; 2003 -2010 Thorsten Ottosen, Neil Groves<p>
-        Distributed under the Boost Software License, Version 1.0. (See accompanying
-        file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
-      </p>
-</div></td>
-</tr></table>
-<hr>
-<div class="spirit-nav">
-<a accesskey="p" href="set_algorithms/set_symmetric_difference.html"><img src="../../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../algorithms.html"><img src="../../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../../index.html"><img src="../../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="heap_algorithms/push_heap.html"><img src="../../../../../../../doc/html/images/next.png" alt="Next"></a>
-</div>
-</body>
-</html>

Deleted: branches/release/libs/range/doc/html/range/reference/algorithms/permutation_algorithms.html
==============================================================================
--- branches/release/libs/range/doc/html/range/reference/algorithms/permutation_algorithms.html	2010-04-29 17:18:58 EDT (Thu, 29 Apr 2010)
+++ (empty file)
@@ -1,50 +0,0 @@
-<html>
-<head>
-<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
-<title>Permutation algorithms</title>
-<link rel="stylesheet" href="../../../../../../../doc/html/boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.75.1">
-<link rel="home" href="../../../index.html" title="Chapter&#160;1.&#160;Range 2.0">
-<link rel="up" href="../algorithms.html" title="Range Algorithm">
-<link rel="prev" href="heap_algorithms/sort_heap.html" title="sort_heap">
-<link rel="next" href="permutation_algorithms/next_permutation.html" title="next_permutation">
-</head>
-<body bgcolor="white" text="black" link="#0000FF" vlink="#840084" alink="#0000FF">
-<table cellpadding="2" width="100%"><tr>
-<td valign="top"><img alt="Boost C++ Libraries" width="277" height="86" src="../../../../../../../boost.png"></td>
-<td align="center">Home</td>
-<td align="center">Libraries</td>
-<td align="center">People</td>
-<td align="center">FAQ</td>
-<td align="center">More</td>
-</tr></table>
-<hr>
-<div class="spirit-nav">
-<a accesskey="p" href="heap_algorithms/sort_heap.html"><img src="../../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../algorithms.html"><img src="../../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../../index.html"><img src="../../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="permutation_algorithms/next_permutation.html"><img src="../../../../../../../doc/html/images/next.png" alt="Next"></a>
-</div>
-<div class="section" title="Permutation algorithms">
-<div class="titlepage"><div><div><h4 class="title">
-<a name="range.reference.algorithms.permutation_algorithms"></a><a class="link" href="permutation_algorithms.html" title="Permutation algorithms">
-        Permutation algorithms</a>
-</h4></div></div></div>
-<div class="toc"><dl>
-<dt><span class="section"><a href="permutation_algorithms/next_permutation.html">
-          next_permutation</a></span></dt>
-<dt><span class="section"><a href="permutation_algorithms/prev_permutation.html">
-          prev_permutation</a></span></dt>
-</dl></div>
-</div>
-<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
-<td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright &#169; 2003 -2010 Thorsten Ottosen, Neil Groves<p>
-        Distributed under the Boost Software License, Version 1.0. (See accompanying
-        file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
-      </p>
-</div></td>
-</tr></table>
-<hr>
-<div class="spirit-nav">
-<a accesskey="p" href="heap_algorithms/sort_heap.html"><img src="../../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../algorithms.html"><img src="../../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../../index.html"><img src="../../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="permutation_algorithms/next_permutation.html"><img src="../../../../../../../doc/html/images/next.png" alt="Next"></a>
-</div>
-</body>
-</html>

Deleted: branches/release/libs/range/doc/html/range/reference/algorithms/range_algorithm_introduction.html
==============================================================================
--- branches/release/libs/range/doc/html/range/reference/algorithms/range_algorithm_introduction.html	2010-04-29 17:18:58 EDT (Thu, 29 Apr 2010)
+++ (empty file)
@@ -1,257 +0,0 @@
-<html>
-<head>
-<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
-<title>Introduction and motivation</title>
-<link rel="stylesheet" href="../../../../../../../doc/html/boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.75.1">
-<link rel="home" href="../../../index.html" title="Chapter&#160;1.&#160;Range 2.0">
-<link rel="up" href="../algorithms.html" title="Range Algorithm">
-<link rel="prev" href="../algorithms.html" title="Range Algorithm">
-<link rel="next" href="range_algorithm_mutating_algorithms.html" title="Mutating algorithms">
-</head>
-<body bgcolor="white" text="black" link="#0000FF" vlink="#840084" alink="#0000FF">
-<table cellpadding="2" width="100%"><tr>
-<td valign="top"><img alt="Boost C++ Libraries" width="277" height="86" src="../../../../../../../boost.png"></td>
-<td align="center">Home</td>
-<td align="center">Libraries</td>
-<td align="center">People</td>
-<td align="center">FAQ</td>
-<td align="center">More</td>
-</tr></table>
-<hr>
-<div class="spirit-nav">
-<a accesskey="p" href="../algorithms.html"><img src="../../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../algorithms.html"><img src="../../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../../index.html"><img src="../../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="range_algorithm_mutating_algorithms.html"><img src="../../../../../../../doc/html/images/next.png" alt="Next"></a>
-</div>
-<div class="section" title="Introduction and motivation">
-<div class="titlepage"><div><div><h4 class="title">
-<a name="range.reference.algorithms.range_algorithm_introduction"></a><a class="link" href="range_algorithm_introduction.html" title="Introduction and motivation">
-        Introduction and motivation</a>
-</h4></div></div></div>
-<p>
-          In its most simple form a <span class="bold"><strong>Range Algorithm</strong></span>
-          (or range-based algorithm) is simply an iterator-based algorithm where
-          the <span class="emphasis"><em>two</em></span> iterator arguments have been replaced by
-          <span class="emphasis"><em>one</em></span> range argument. For example, we may write
-        </p>
-<p>
-          
-</p>
-<pre class="programlisting"><span class="preprocessor">#include</span> <span class="special">&lt;</span><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">hpp</span><span class="special">&gt;</span>
-<span class="preprocessor">#include</span> <span class="special">&lt;</span><span class="identifier">vector</span><span class="special">&gt;</span>
-
-<span class="identifier">std</span><span class="special">::</span><span class="identifier">vector</span><span class="special">&lt;</span><span class="keyword">int</span><span class="special">&gt;</span> <span class="identifier">vec</span> <span class="special">=</span> <span class="special">...;</span>
-<span class="identifier">boost</span><span class="special">::</span><span class="identifier">sort</span><span class="special">(</span><span class="identifier">vec</span><span class="special">);</span>
-</pre>
-<p>
-        </p>
-<p>
-          instead of
-        </p>
-<p>
-          
-</p>
-<pre class="programlisting"><span class="identifier">std</span><span class="special">::</span><span class="identifier">sort</span><span class="special">(</span><span class="identifier">vec</span><span class="special">.</span><span class="identifier">begin</span><span class="special">(),</span> <span class="identifier">vec</span><span class="special">.</span><span class="identifier">end</span><span class="special">());</span>
-</pre>
-<p>
-        </p>
-<p>
-          However, the return type of range algorithms is almost always different
-          from that of existing iterator-based algorithms.
-        </p>
-<p>
-          One group of algorithms, like <code class="computeroutput"><span class="identifier">boost</span><span class="special">::</span><span class="identifier">sort</span><span class="special">()</span></code>, will simply return the same range so
-          that we can continue to pass the range around and/or further modify it.
-          Because of this we may write 
-</p>
-<pre class="programlisting"><span class="identifier">boost</span><span class="special">:</span><span class="identifier">unique</span><span class="special">(</span><span class="identifier">boost</span><span class="special">::</span><span class="identifier">sort</span><span class="special">(</span><span class="identifier">vec</span><span class="special">));</span>
-</pre>
-<p>
-          to first sort the range and then run <code class="computeroutput"><span class="identifier">unique</span><span class="special">()</span></code> on the sorted range.
-        </p>
-<p>
-          Algorithms like <code class="computeroutput"><span class="identifier">boost</span><span class="special">::</span><span class="identifier">unique</span><span class="special">()</span></code>
-          fall into another group of algorithms that return (potentially) narrowed
-          views of the original range. By default <code class="computeroutput"><span class="identifier">boost</span><span class="special">::</span><span class="identifier">unique</span><span class="special">(</span><span class="identifier">rng</span><span class="special">)</span></code> returns the range <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">found</span><span class="special">)</span></code>
-          where <code class="computeroutput"><span class="identifier">found</span></code> denotes the
-          iterator returned by <code class="computeroutput"><span class="identifier">std</span><span class="special">::</span><span class="identifier">unique</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></code>
-        </p>
-<p>
-          Therefore exactly the unique values can be copied by writing 
-</p>
-<pre class="programlisting"><span class="identifier">boost</span><span class="special">::</span><span class="identifier">copy</span><span class="special">(</span><span class="identifier">boost</span><span class="special">::</span><span class="identifier">unique</span><span class="special">(</span><span class="identifier">boost</span><span class="special">::</span><span class="identifier">sort</span><span class="special">(</span><span class="identifier">vec</span><span class="special">)),</span>
-            <span class="identifier">std</span><span class="special">::</span><span class="identifier">ostream_iterator</span><span class="special">&lt;</span><span class="keyword">int</span><span class="special">&gt;(</span><span class="identifier">std</span><span class="special">::</span><span class="identifier">cout</span><span class="special">));</span>
-</pre>
-<p>
-        </p>
-<p>
-          Algorithms like <code class="computeroutput"><span class="identifier">boost</span><span class="special">::</span><span class="identifier">unique</span></code> usually return the same range:
-          <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">found</span><span class="special">)</span></code>. However, this behaviour may be changed
-          by supplying the algorithms with a template argument:
-        </p>
-<div class="informaltable"><table class="table">
-<colgroup>
-<col>
-<col>
-</colgroup>
-<thead><tr>
-<th>
-                  <p>
-                    Expression
-                  </p>
-                </th>
-<th>
-                  <p>
-                    Return
-                  </p>
-                </th>
-</tr></thead>
-<tbody>
-<tr>
-<td>
-                  <p>
-                    <code class="computeroutput"><span class="identifier">boost</span><span class="special">::</span><span class="identifier">unique</span><span class="special">&lt;</span><span class="identifier">boost</span><span class="special">::</span><span class="identifier">return_found</span><span class="special">&gt;(</span><span class="identifier">rng</span><span class="special">)</span></code>
-                  </p>
-                </td>
-<td>
-                  <p>
-                    returns a single iterator like <code class="computeroutput"><span class="identifier">std</span><span class="special">::</span><span class="identifier">unique</span></code>
-                  </p>
-                </td>
-</tr>
-<tr>
-<td>
-                  <p>
-                    <code class="computeroutput"><span class="identifier">boost</span><span class="special">::</span><span class="identifier">unique</span><span class="special">&lt;</span><span class="identifier">boost</span><span class="special">::</span><span class="identifier">return_begin_found</span><span class="special">&gt;(</span><span class="identifier">rng</span><span class="special">)</span></code>
-                  </p>
-                </td>
-<td>
-                  <p>
-                    returns the range <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">found</span><span class="special">)</span></code>
-                    (this is the default)
-                  </p>
-                </td>
-</tr>
-<tr>
-<td>
-                  <p>
-                    <code class="computeroutput"><span class="identifier">boost</span><span class="special">::</span><span class="identifier">unique</span><span class="special">&lt;</span><span class="identifier">boost</span><span class="special">::</span><span class="identifier">return_begin_next</span><span class="special">&gt;(</span><span class="identifier">rng</span><span class="special">)</span></code>
-                  </p>
-                </td>
-<td>
-                  <p>
-                    returns the range <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">next</span><span class="special">(</span><span class="identifier">found</span><span class="special">))</span></code>
-                  </p>
-                </td>
-</tr>
-<tr>
-<td>
-                  <p>
-                    <code class="computeroutput"><span class="identifier">boost</span><span class="special">::</span><span class="identifier">unique</span><span class="special">&lt;</span><span class="identifier">boost</span><span class="special">::</span><span class="identifier">return_found_end</span><span class="special">&gt;(</span><span class="identifier">rng</span><span class="special">)</span></code>
-                  </p>
-                </td>
-<td>
-                  <p>
-                    returns the range <code class="computeroutput"><span class="special">[</span><span class="identifier">found</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></code>
-                  </p>
-                </td>
-</tr>
-<tr>
-<td>
-                  <p>
-                    <code class="computeroutput"><span class="identifier">boost</span><span class="special">::</span><span class="identifier">unique</span><span class="special">&lt;</span><span class="identifier">boost</span><span class="special">::</span><span class="identifier">return_next_end</span><span class="special">&gt;(</span><span class="identifier">rng</span><span class="special">)</span></code>
-                  </p>
-                </td>
-<td>
-                  <p>
-                    returns the range <code class="computeroutput"><span class="special">[</span><span class="identifier">boost</span><span class="special">::</span><span class="identifier">next</span><span class="special">(</span><span class="identifier">found</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></code>
-                  </p>
-                </td>
-</tr>
-<tr>
-<td>
-                  <p>
-                    <code class="computeroutput"><span class="identifier">boost</span><span class="special">::</span><span class="identifier">unique</span><span class="special">&lt;</span><span class="identifier">boost</span><span class="special">::</span><span class="identifier">return_begin_end</span><span class="special">&gt;(</span><span class="identifier">rng</span><span class="special">)</span></code>
-                  </p>
-                </td>
-<td>
-                  <p>
-                    returns the entire original range.
-                  </p>
-                </td>
-</tr>
-</tbody>
-</table></div>
-<p>
-          This functionality has the following advantages:
-        </p>
-<div class="orderedlist"><ol class="orderedlist" type="1">
-<li class="listitem">
-            it allows for <span class="emphasis"><em><span class="bold"><strong>seamless functional-style
-            programming</strong></span></em></span> where you do not need to use named
-            local variables to store intermediate results
-          </li>
-<li class="listitem">
-            it is very <span class="emphasis"><em><span class="bold"><strong>safe</strong></span></em></span>
-            because the algorithm can verify out-of-bounds conditions and handle
-            tricky conditions that lead to empty ranges
-          </li>
-</ol></div>
-<p>
-          For example, consider how easy we may erase the duplicates in a sorted
-          container:
-        </p>
-<p>
-          
-</p>
-<pre class="programlisting"><span class="identifier">std</span><span class="special">::</span><span class="identifier">vector</span><span class="special">&lt;</span><span class="keyword">int</span><span class="special">&gt;</span> <span class="identifier">vec</span> <span class="special">=</span> <span class="special">...;</span>
-<span class="identifier">boost</span><span class="special">::</span><span class="identifier">erase</span><span class="special">(</span><span class="identifier">vec</span><span class="special">,</span> <span class="identifier">boost</span><span class="special">::</span><span class="identifier">unique</span><span class="special">&lt;</span><span class="identifier">boost</span><span class="special">::</span><span class="identifier">return_found_end</span><span class="special">&gt;(</span><span class="identifier">boost</span><span class="special">::</span><span class="identifier">sort</span><span class="special">(</span><span class="identifier">vec</span><span class="special">)));</span>
-</pre>
-<p>
-        </p>
-<p>
-          Notice the use of <code class="computeroutput"><span class="identifier">boost</span><span class="special">::</span><span class="identifier">return_found_end</span></code>.
-          What if we wanted to erase all the duplicates except one of them? In old-fashined
-          STL-programming we might write
-        </p>
-<p>
-          
-</p>
-<pre class="programlisting"><span class="comment">// assume 'vec' is already sorted
-</span><span class="identifier">std</span><span class="special">::</span><span class="identifier">vector</span><span class="special">&lt;</span><span class="keyword">int</span><span class="special">&gt;::</span><span class="identifier">iterator</span> <span class="identifier">i</span> <span class="special">=</span> <span class="identifier">std</span><span class="special">::</span><span class="identifier">unique</span><span class="special">(</span><span class="identifier">vec</span><span class="special">.</span><span class="identifier">begin</span><span class="special">(),</span> <span class="identifier">vec</span><span class="special">.</span><span class="identifier">end</span><span class="special">());</span>
-
-<span class="comment">// remember this check or you get into problems
-</span><span class="keyword">if</span> <span class="special">(</span><span class="identifier">i</span> <span class="special">!=</span> <span class="identifier">vec</span><span class="special">.</span><span class="identifier">end</span><span class="special">())</span>
-    <span class="special">++</span><span class="identifier">i</span><span class="special">;</span>
-
-<span class="identifier">vec</span><span class="special">.</span><span class="identifier">erase</span><span class="special">(</span><span class="identifier">i</span><span class="special">,</span> <span class="identifier">vec</span><span class="special">.</span><span class="identifier">end</span><span class="special">());</span>
-</pre>
-<p>
-        </p>
-<p>
-          The same task may be accomplished simply with 
-</p>
-<pre class="programlisting"><span class="identifier">boost</span><span class="special">::</span><span class="identifier">erase</span><span class="special">(</span><span class="identifier">vec</span><span class="special">,</span> <span class="identifier">boost</span><span class="special">::</span><span class="identifier">unique</span><span class="special">&lt;</span><span class="identifier">boost</span><span class="special">::</span><span class="identifier">return_next_end</span><span class="special">&gt;(</span><span class="identifier">vec</span><span class="special">));</span>
-</pre>
-<p>
-          and there is no need to worry about generating an invalid range. Furthermore,
-          if the container is complex, calling <code class="computeroutput"><span class="identifier">vec</span><span class="special">.</span><span class="identifier">begin</span><span class="special">()</span></code> several times will be more expensive
-          than using a range algorithm.
-        </p>
-</div>
-<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
-<td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright &#169; 2003 -2010 Thorsten Ottosen, Neil Groves<p>
-        Distributed under the Boost Software License, Version 1.0. (See accompanying
-        file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
-      </p>
-</div></td>
-</tr></table>
-<hr>
-<div class="spirit-nav">
-<a accesskey="p" href="../algorithms.html"><img src="../../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../algorithms.html"><img src="../../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../../index.html"><img src="../../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="range_algorithm_mutating_algorithms.html"><img src="../../../../../../../doc/html/images/next.png" alt="Next"></a>
-</div>
-</body>
-</html>

Deleted: branches/release/libs/range/doc/html/range/reference/algorithms/range_algorithm_mutating_algorithms.html
==============================================================================
--- branches/release/libs/range/doc/html/range/reference/algorithms/range_algorithm_mutating_algorithms.html	2010-04-29 17:18:58 EDT (Thu, 29 Apr 2010)
+++ (empty file)
@@ -1,88 +0,0 @@
-<html>
-<head>
-<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
-<title>Mutating algorithms</title>
-<link rel="stylesheet" href="../../../../../../../doc/html/boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.75.1">
-<link rel="home" href="../../../index.html" title="Chapter&#160;1.&#160;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="next" href="range_algorithm_mutating_algorithms/copy.html" title="Range Algorithm - copy">
-</head>
-<body bgcolor="white" text="black" link="#0000FF" vlink="#840084" alink="#0000FF">
-<table cellpadding="2" width="100%"><tr>
-<td valign="top"><img alt="Boost C++ Libraries" width="277" height="86" src="../../../../../../../boost.png"></td>
-<td align="center">Home</td>
-<td align="center">Libraries</td>
-<td align="center">People</td>
-<td align="center">FAQ</td>
-<td align="center">More</td>
-</tr></table>
-<hr>
-<div class="spirit-nav">
-<a accesskey="p" href="range_algorithm_introduction.html"><img src="../../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../algorithms.html"><img src="../../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../../index.html"><img src="../../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="range_algorithm_mutating_algorithms/copy.html"><img src="../../../../../../../doc/html/images/next.png" alt="Next"></a>
-</div>
-<div class="section" title="Mutating algorithms">
-<div class="titlepage"><div><div><h4 class="title">
-<a name="range.reference.algorithms.range_algorithm_mutating_algorithms"></a><a class="link" href="range_algorithm_mutating_algorithms.html" title="Mutating algorithms">
-        Mutating algorithms</a>
-</h4></div></div></div>
-<div class="toc"><dl>
-<dt><span class="section"><a href="range_algorithm_mutating_algorithms/copy.html">
-          Range Algorithm - copy</a></span></dt>
-<dt><span class="section"><a href="range_algorithm_mutating_algorithms/copy_backward.html">
-          Range Algorithm - copy_backward</a></span></dt>
-<dt><span class="section"><a href="range_algorithm_mutating_algorithms/fill.html">
-          Range Algorithm - fill</a></span></dt>
-<dt><span class="section"><a href="range_algorithm_mutating_algorithms/fill_n.html">
-          Range Algorithm - fill_n</a></span></dt>
-<dt><span class="section"><a href="range_algorithm_mutating_algorithms/generate.html">
-          Range Algorithm - generate</a></span></dt>
-<dt><span class="section"><a href="range_algorithm_mutating_algorithms/inplace_merge.html">
-          Range Algorithm - inplace_merge</a></span></dt>
-<dt><span class="section"><a href="range_algorithm_mutating_algorithms/merge.html">
-          Range Algorithm - merge</a></span></dt>
-<dt><span class="section"><a href="range_algorithm_mutating_algorithms/nth_element.html">
-          Range Algorithm - nth_element</a></span></dt>
-<dt><span class="section"><a href="range_algorithm_mutating_algorithms/partial_sort.html">
-          Range Algorithm - partial_sort</a></span></dt>
-<dt><span class="section"><a href="range_algorithm_mutating_algorithms/partition.html">
-          Range Algorithm - partition</a></span></dt>
-<dt><span class="section"><a href="range_algorithm_mutating_algorithms/random_shuffle.html">
-          Range Algorithm - random_shuffle</a></span></dt>
-<dt><span class="section"><a href="range_algorithm_mutating_algorithms/remove.html">
-          Range Algorithm - remove</a></span></dt>
-<dt><span class="section"><a href="range_algorithm_mutating_algorithms/remove_if.html">
-          Range Algorithm - remove_if</a></span></dt>
-<dt><span class="section"><a href="range_algorithm_mutating_algorithms/replace.html">
-          Range Algorithm - replace</a></span></dt>
-<dt><span class="section"><a href="range_algorithm_mutating_algorithms/replace_if.html">
-          Range Algorithm - replace_if</a></span></dt>
-<dt><span class="section"><a href="range_algorithm_mutating_algorithms/rotate.html">
-          Range Algorithm - rotate</a></span></dt>
-<dt><span class="section"><a href="range_algorithm_mutating_algorithms/sort.html">
-          Range Algorithm - sort</a></span></dt>
-<dt><span class="section"><a href="range_algorithm_mutating_algorithms/stable_partition.html">
-          Range Algorithm - stable_partition</a></span></dt>
-<dt><span class="section"><a href="range_algorithm_mutating_algorithms/stable_sort.html">
-          Range Algorithm - stable_sort</a></span></dt>
-<dt><span class="section"><a href="range_algorithm_mutating_algorithms/transform.html">
-          Range Algorithm - transform</a></span></dt>
-<dt><span class="section"><a href="range_algorithm_mutating_algorithms/unique.html">
-          Range Algorithm - unique</a></span></dt>
-</dl></div>
-</div>
-<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
-<td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright &#169; 2003 -2010 Thorsten Ottosen, Neil Groves<p>
-        Distributed under the Boost Software License, Version 1.0. (See accompanying
-        file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
-      </p>
-</div></td>
-</tr></table>
-<hr>
-<div class="spirit-nav">
-<a accesskey="p" href="range_algorithm_introduction.html"><img src="../../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../algorithms.html"><img src="../../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../../index.html"><img src="../../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="range_algorithm_mutating_algorithms/copy.html"><img src="../../../../../../../doc/html/images/next.png" alt="Next"></a>
-</div>
-</body>
-</html>

Deleted: branches/release/libs/range/doc/html/range/reference/algorithms/range_algorithm_new_algorithms.html
==============================================================================
--- branches/release/libs/range/doc/html/range/reference/algorithms/range_algorithm_new_algorithms.html	2010-04-29 17:18:58 EDT (Thu, 29 Apr 2010)
+++ (empty file)
@@ -1,64 +0,0 @@
-<html>
-<head>
-<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
-<title>New algorithms</title>
-<link rel="stylesheet" href="../../../../../../../doc/html/boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.75.1">
-<link rel="home" href="../../../index.html" title="Chapter&#160;1.&#160;Range 2.0">
-<link rel="up" href="../algorithms.html" title="Range Algorithm">
-<link rel="prev" href="permutation_algorithms/prev_permutation.html" title="prev_permutation">
-<link rel="next" href="range_algorithm_new_algorithms/erase.html" title="erase">
-</head>
-<body bgcolor="white" text="black" link="#0000FF" vlink="#840084" alink="#0000FF">
-<table cellpadding="2" width="100%"><tr>
-<td valign="top"><img alt="Boost C++ Libraries" width="277" height="86" src="../../../../../../../boost.png"></td>
-<td align="center">Home</td>
-<td align="center">Libraries</td>
-<td align="center">People</td>
-<td align="center">FAQ</td>
-<td align="center">More</td>
-</tr></table>
-<hr>
-<div class="spirit-nav">
-<a accesskey="p" href="permutation_algorithms/prev_permutation.html"><img src="../../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../algorithms.html"><img src="../../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../../index.html"><img src="../../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="range_algorithm_new_algorithms/erase.html"><img src="../../../../../../../doc/html/images/next.png" alt="Next"></a>
-</div>
-<div class="section" title="New algorithms">
-<div class="titlepage"><div><div><h4 class="title">
-<a name="range.reference.algorithms.range_algorithm_new_algorithms"></a><a class="link" href="range_algorithm_new_algorithms.html" title="New algorithms">
-        New algorithms</a>
-</h4></div></div></div>
-<div class="toc"><dl>
-<dt><span class="section"><a href="range_algorithm_new_algorithms/erase.html">
-          erase</a></span></dt>
-<dt><span class="section"><a href="range_algorithm_new_algorithms/for_each.html">
-          for_each</a></span></dt>
-<dt><span class="section"><a href="range_algorithm_new_algorithms/insert.html">
-          insert</a></span></dt>
-<dt><span class="section"><a href="range_algorithm_new_algorithms/iota.html">
-          iota</a></span></dt>
-<dt><span class="section"><a href="range_algorithm_new_algorithms/overwrite.html">
-          overwrite</a></span></dt>
-<dt><span class="section"><a href="range_algorithm_new_algorithms/push_back.html">
-          push_back</a></span></dt>
-<dt><span class="section"><a href="range_algorithm_new_algorithms/push_front.html">
-          push_front</a></span></dt>
-<dt><span class="section"><a href="range_algorithm_new_algorithms/remove_erase.html">
-          remove_erase</a></span></dt>
-<dt><span class="section"><a href="range_algorithm_new_algorithms/remove_erase_if.html">
-          remove_erase_if</a></span></dt>
-</dl></div>
-</div>
-<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
-<td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright &#169; 2003 -2010 Thorsten Ottosen, Neil Groves<p>
-        Distributed under the Boost Software License, Version 1.0. (See accompanying
-        file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
-      </p>
-</div></td>
-</tr></table>
-<hr>
-<div class="spirit-nav">
-<a accesskey="p" href="permutation_algorithms/prev_permutation.html"><img src="../../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../algorithms.html"><img src="../../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../../index.html"><img src="../../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="range_algorithm_new_algorithms/erase.html"><img src="../../../../../../../doc/html/images/next.png" alt="Next"></a>
-</div>
-</body>
-</html>

Deleted: branches/release/libs/range/doc/html/range/reference/algorithms/range_algorithm_non_mutating_algorithms.html
==============================================================================
--- branches/release/libs/range/doc/html/range/reference/algorithms/range_algorithm_non_mutating_algorithms.html	2010-04-29 17:18:58 EDT (Thu, 29 Apr 2010)
+++ (empty file)
@@ -1,80 +0,0 @@
-<html>
-<head>
-<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
-<title>Non-mutating algorithms</title>
-<link rel="stylesheet" href="../../../../../../../doc/html/boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.75.1">
-<link rel="home" href="../../../index.html" title="Chapter&#160;1.&#160;Range 2.0">
-<link rel="up" href="../algorithms.html" title="Range Algorithm">
-<link rel="prev" href="range_algorithm_mutating_algorithms/unique.html" title="Range Algorithm - unique">
-<link rel="next" href="range_algorithm_non_mutating_algorithms/adjacent_find.html" title="Range Algorithm - adjacent_find">
-</head>
-<body bgcolor="white" text="black" link="#0000FF" vlink="#840084" alink="#0000FF">
-<table cellpadding="2" width="100%"><tr>
-<td valign="top"><img alt="Boost C++ Libraries" width="277" height="86" src="../../../../../../../boost.png"></td>
-<td align="center">Home</td>
-<td align="center">Libraries</td>
-<td align="center">People</td>
-<td align="center">FAQ</td>
-<td align="center">More</td>
-</tr></table>
-<hr>
-<div class="spirit-nav">
-<a accesskey="p" href="range_algorithm_mutating_algorithms/unique.html"><img src="../../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../algorithms.html"><img src="../../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../../index.html"><img src="../../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="range_algorithm_non_mutating_algorithms/adjacent_find.html"><img src="../../../../../../../doc/html/images/next.png" alt="Next"></a>
-</div>
-<div class="section" title="Non-mutating algorithms">
-<div class="titlepage"><div><div><h4 class="title">
-<a name="range.reference.algorithms.range_algorithm_non_mutating_algorithms"></a><a class="link" href="range_algorithm_non_mutating_algorithms.html" title="Non-mutating algorithms">
-        Non-mutating algorithms</a>
-</h4></div></div></div>
-<div class="toc"><dl>
-<dt><span class="section"><a href="range_algorithm_non_mutating_algorithms/adjacent_find.html">
-          Range Algorithm - adjacent_find</a></span></dt>
-<dt><span class="section"><a href="range_algorithm_non_mutating_algorithms/binary_search.html">
-          binary_search</a></span></dt>
-<dt><span class="section"><a href="range_algorithm_non_mutating_algorithms/count.html">
-          count</a></span></dt>
-<dt><span class="section"><a href="range_algorithm_non_mutating_algorithms/equal.html">
-          equal</a></span></dt>
-<dt><span class="section"><a href="range_algorithm_non_mutating_algorithms/equal_range.html">
-          equal_range</a></span></dt>
-<dt><span class="section"><a href="range_algorithm_non_mutating_algorithms/for_each.html">
-          for_each</a></span></dt>
-<dt><span class="section"><a href="range_algorithm_non_mutating_algorithms/find.html">
-          find</a></span></dt>
-<dt><span class="section"><a href="range_algorithm_non_mutating_algorithms/find_end.html">
-          find_end</a></span></dt>
-<dt><span class="section"><a href="range_algorithm_non_mutating_algorithms/find_first_of.html">
-          find_first_of</a></span></dt>
-<dt><span class="section"><a href="range_algorithm_non_mutating_algorithms/find_if.html">
-          find_if</a></span></dt>
-<dt><span class="section"><a href="range_algorithm_non_mutating_algorithms/lexicographical_compare.html">
-          lexicographical_compare</a></span></dt>
-<dt><span class="section"><a href="range_algorithm_non_mutating_algorithms/lower_bound.html">
-          lower_bound</a></span></dt>
-<dt><span class="section"><a href="range_algorithm_non_mutating_algorithms/max_element.html">
-          max_element</a></span></dt>
-<dt><span class="section"><a href="range_algorithm_non_mutating_algorithms/min_element.html">
-          min_element</a></span></dt>
-<dt><span class="section"><a href="range_algorithm_non_mutating_algorithms/mismatch.html">
-          mismatch</a></span></dt>
-<dt><span class="section"><a href="range_algorithm_non_mutating_algorithms/search.html">
-          search</a></span></dt>
-<dt><span class="section"><a href="range_algorithm_non_mutating_algorithms/upper_bound.html">
-          upper_bound</a></span></dt>
-</dl></div>
-</div>
-<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
-<td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright &#169; 2003 -2010 Thorsten Ottosen, Neil Groves<p>
-        Distributed under the Boost Software License, Version 1.0. (See accompanying
-        file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
-      </p>
-</div></td>
-</tr></table>
-<hr>
-<div class="spirit-nav">
-<a accesskey="p" href="range_algorithm_mutating_algorithms/unique.html"><img src="../../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../algorithms.html"><img src="../../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../../index.html"><img src="../../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="range_algorithm_non_mutating_algorithms/adjacent_find.html"><img src="../../../../../../../doc/html/images/next.png" alt="Next"></a>
-</div>
-</body>
-</html>

Deleted: branches/release/libs/range/doc/html/range/reference/algorithms/range_numeric.html
==============================================================================
--- branches/release/libs/range/doc/html/range/reference/algorithms/range_numeric.html	2010-04-29 17:18:58 EDT (Thu, 29 Apr 2010)
+++ (empty file)
@@ -1,54 +0,0 @@
-<html>
-<head>
-<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
-<title>Numeric algorithms</title>
-<link rel="stylesheet" href="../../../../../../../doc/html/boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.75.1">
-<link rel="home" href="../../../index.html" title="Chapter&#160;1.&#160;Range 2.0">
-<link rel="up" href="../algorithms.html" title="Range Algorithm">
-<link rel="prev" href="range_algorithm_new_algorithms/remove_erase_if.html" title="remove_erase_if">
-<link rel="next" href="range_numeric/accumulate.html" title="accumulate">
-</head>
-<body bgcolor="white" text="black" link="#0000FF" vlink="#840084" alink="#0000FF">
-<table cellpadding="2" width="100%"><tr>
-<td valign="top"><img alt="Boost C++ Libraries" width="277" height="86" src="../../../../../../../boost.png"></td>
-<td align="center">Home</td>
-<td align="center">Libraries</td>
-<td align="center">People</td>
-<td align="center">FAQ</td>
-<td align="center">More</td>
-</tr></table>
-<hr>
-<div class="spirit-nav">
-<a accesskey="p" href="range_algorithm_new_algorithms/remove_erase_if.html"><img src="../../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../algorithms.html"><img src="../../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../../index.html"><img src="../../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="range_numeric/accumulate.html"><img src="../../../../../../../doc/html/images/next.png" alt="Next"></a>
-</div>
-<div class="section" title="Numeric algorithms">
-<div class="titlepage"><div><div><h4 class="title">
-<a name="range.reference.algorithms.range_numeric"></a><a class="link" href="range_numeric.html" title="Numeric algorithms"> Numeric
-        algorithms</a>
-</h4></div></div></div>
-<div class="toc"><dl>
-<dt><span class="section"><a href="range_numeric/accumulate.html">
-          accumulate</a></span></dt>
-<dt><span class="section"><a href="range_numeric/adjacent_difference.html">
-          adjacent_difference</a></span></dt>
-<dt><span class="section"><a href="range_numeric/inner_product.html">
-          inner_product</a></span></dt>
-<dt><span class="section"><a href="range_numeric/partial_sum.html">
-          partial_sum</a></span></dt>
-</dl></div>
-</div>
-<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
-<td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright &#169; 2003 -2010 Thorsten Ottosen, Neil Groves<p>
-        Distributed under the Boost Software License, Version 1.0. (See accompanying
-        file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
-      </p>
-</div></td>
-</tr></table>
-<hr>
-<div class="spirit-nav">
-<a accesskey="p" href="range_algorithm_new_algorithms/remove_erase_if.html"><img src="../../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../algorithms.html"><img src="../../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../../index.html"><img src="../../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="range_numeric/accumulate.html"><img src="../../../../../../../doc/html/images/next.png" alt="Next"></a>
-</div>
-</body>
-</html>

Deleted: branches/release/libs/range/doc/html/range/reference/algorithms/set_algorithms.html
==============================================================================
--- branches/release/libs/range/doc/html/range/reference/algorithms/set_algorithms.html	2010-04-29 17:18:58 EDT (Thu, 29 Apr 2010)
+++ (empty file)
@@ -1,55 +0,0 @@
-<html>
-<head>
-<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
-<title>Set algorithms</title>
-<link rel="stylesheet" href="../../../../../../../doc/html/boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.75.1">
-<link rel="home" href="../../../index.html" title="Chapter&#160;1.&#160;Range 2.0">
-<link rel="up" href="../algorithms.html" title="Range Algorithm">
-<link rel="prev" href="range_algorithm_non_mutating_algorithms/upper_bound.html" title="upper_bound">
-<link rel="next" href="set_algorithms/includes.html" title="includes">
-</head>
-<body bgcolor="white" text="black" link="#0000FF" vlink="#840084" alink="#0000FF">
-<table cellpadding="2" width="100%"><tr>
-<td valign="top"><img alt="Boost C++ Libraries" width="277" height="86" src="../../../../../../../boost.png"></td>
-<td align="center">Home</td>
-<td align="center">Libraries</td>
-<td align="center">People</td>
-<td align="center">FAQ</td>
-<td align="center">More</td>
-</tr></table>
-<hr>
-<div class="spirit-nav">
-<a accesskey="p" href="range_algorithm_non_mutating_algorithms/upper_bound.html"><img src="../../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../algorithms.html"><img src="../../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../../index.html"><img src="../../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="set_algorithms/includes.html"><img src="../../../../../../../doc/html/images/next.png" alt="Next"></a>
-</div>
-<div class="section" title="Set algorithms">
-<div class="titlepage"><div><div><h4 class="title">
-<a name="range.reference.algorithms.set_algorithms"></a><a class="link" href="set_algorithms.html" title="Set algorithms"> Set algorithms</a>
-</h4></div></div></div>
-<div class="toc"><dl>
-<dt><span class="section"><a href="set_algorithms/includes.html">
-          includes</a></span></dt>
-<dt><span class="section"><a href="set_algorithms/set_union.html">
-          set_union</a></span></dt>
-<dt><span class="section"><a href="set_algorithms/set_intersection.html">
-          set_intersection</a></span></dt>
-<dt><span class="section"><a href="set_algorithms/set_difference.html">
-          set_difference</a></span></dt>
-<dt><span class="section"><a href="set_algorithms/set_symmetric_difference.html">
-          set_symmetric_difference</a></span></dt>
-</dl></div>
-</div>
-<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
-<td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright &#169; 2003 -2010 Thorsten Ottosen, Neil Groves<p>
-        Distributed under the Boost Software License, Version 1.0. (See accompanying
-        file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
-      </p>
-</div></td>
-</tr></table>
-<hr>
-<div class="spirit-nav">
-<a accesskey="p" href="range_algorithm_non_mutating_algorithms/upper_bound.html"><img src="../../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../algorithms.html"><img src="../../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../../index.html"><img src="../../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="set_algorithms/includes.html"><img src="../../../../../../../doc/html/images/next.png" alt="Next"></a>
-</div>
-</body>
-</html>

Modified: branches/release/libs/range/doc/html/range/reference/extending.html
==============================================================================
--- branches/release/libs/range/doc/html/range/reference/extending.html	(original)
+++ branches/release/libs/range/doc/html/range/reference/extending.html	2010-04-29 17:18:58 EDT (Thu, 29 Apr 2010)
@@ -6,7 +6,7 @@
 <meta name="generator" content="DocBook XSL Stylesheets V1.75.1">
 <link rel="home" href="../../index.html" title="Chapter&#160;1.&#160;Range 2.0">
 <link rel="up" href="../reference.html" title="Reference">
-<link rel="prev" href="ranges/irange.html" title="irange">
+<link rel="prev" href="utilities/join.html" title="Function join">
 <link rel="next" href="extending/method_1.html" title="Method 1: provide member functions and nested types">
 </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="ranges/irange.html"><img src="../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../reference.html"><img src="../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="extending/method_1.html"><img src="../../../../../../doc/html/images/next.png" alt="Next"></a>
+<a accesskey="p" href="utilities/join.html"><img src="../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../reference.html"><img src="../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="extending/method_1.html"><img src="../../../../../../doc/html/images/next.png" alt="Next"></a>
 </div>
 <div class="section" title="Extending the library">
 <div class="titlepage"><div><div><h3 class="title">
@@ -45,7 +45,7 @@
 </tr></table>
 <hr>
 <div class="spirit-nav">
-<a accesskey="p" href="ranges/irange.html"><img src="../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../reference.html"><img src="../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="extending/method_1.html"><img src="../../../../../../doc/html/images/next.png" alt="Next"></a>
+<a accesskey="p" href="utilities/join.html"><img src="../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../reference.html"><img src="../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="extending/method_1.html"><img src="../../../../../../doc/html/images/next.png" alt="Next"></a>
 </div>
 </body>
 </html>

Modified: branches/release/libs/range/doc/html/range/reference/extending/method_3/method_3_2.html
==============================================================================
--- branches/release/libs/range/doc/html/range/reference/extending/method_3/method_3_2.html	(original)
+++ branches/release/libs/range/doc/html/range/reference/extending/method_3/method_3_2.html	2010-04-29 17:18:58 EDT (Thu, 29 Apr 2010)
@@ -7,7 +7,7 @@
 <link rel="home" href="../../../../index.html" title="Chapter&#160;1.&#160;Range 2.0">
 <link rel="up" href="../method_3.html" title="Method 3: provide range adaptor implementations">
 <link rel="prev" href="method_3_1.html" title="Method 3.1: Implement a Range Adaptor without arguments">
-<link rel="next" href="../../../utilities.html" title="Utilities">
+<link rel="next" href="../../../style_guide.html" title="Terminology and style guidelines">
 </head>
 <body bgcolor="white" text="black" link="#0000FF" vlink="#840084" alink="#0000FF">
 <table cellpadding="2" width="100%"><tr>
@@ -20,7 +20,7 @@
 </tr></table>
 <hr>
 <div class="spirit-nav">
-<a accesskey="p" href="method_3_1.html"><img src="../../../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../method_3.html"><img src="../../../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../../../index.html"><img src="../../../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="../../../utilities.html"><img src="../../../../../../../../doc/html/images/next.png" alt="Next"></a>
+<a accesskey="p" href="method_3_1.html"><img src="../../../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../method_3.html"><img src="../../../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../../../index.html"><img src="../../../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="../../../style_guide.html"><img src="../../../../../../../../doc/html/images/next.png" alt="Next"></a>
 </div>
 <div class="section" title="Method 3.2: Implement a Range Adaptor with arguments">
 <div class="titlepage"><div><div><h5 class="title">
@@ -149,7 +149,7 @@
 </tr></table>
 <hr>
 <div class="spirit-nav">
-<a accesskey="p" href="method_3_1.html"><img src="../../../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../method_3.html"><img src="../../../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../../../index.html"><img src="../../../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="../../../utilities.html"><img src="../../../../../../../../doc/html/images/next.png" alt="Next"></a>
+<a accesskey="p" href="method_3_1.html"><img src="../../../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../method_3.html"><img src="../../../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../../../index.html"><img src="../../../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="../../../style_guide.html"><img src="../../../../../../../../doc/html/images/next.png" alt="Next"></a>
 </div>
 </body>
 </html>

Deleted: branches/release/libs/range/doc/html/range/reference/overview.html
==============================================================================
--- branches/release/libs/range/doc/html/range/reference/overview.html	2010-04-29 17:18:58 EDT (Thu, 29 Apr 2010)
+++ (empty file)
@@ -1,68 +0,0 @@
-<html>
-<head>
-<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
-<title>Overview</title>
-<link rel="stylesheet" href="../../../../../../doc/html/boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.75.1">
-<link rel="home" href="../../index.html" title="Chapter&#160;1.&#160;Range 2.0">
-<link rel="up" href="../reference.html" title="Reference">
-<link rel="prev" href="../reference.html" title="Reference">
-<link rel="next" href="synopsis.html" title="Synopsis">
-</head>
-<body bgcolor="white" text="black" link="#0000FF" vlink="#840084" alink="#0000FF">
-<table cellpadding="2" width="100%"><tr>
-<td valign="top"><img alt="Boost C++ Libraries" width="277" height="86" src="../../../../../../boost.png"></td>
-<td align="center">Home</td>
-<td align="center">Libraries</td>
-<td align="center">People</td>
-<td align="center">FAQ</td>
-<td align="center">More</td>
-</tr></table>
-<hr>
-<div class="spirit-nav">
-<a accesskey="p" href="../reference.html"><img src="../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../reference.html"><img src="../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="synopsis.html"><img src="../../../../../../doc/html/images/next.png" alt="Next"></a>
-</div>
-<div class="section" title="Overview">
-<div class="titlepage"><div><div><h3 class="title">
-<a name="range.reference.overview"></a><a class="link" href="overview.html" title="Overview">Overview</a>
-</h3></div></div></div>
-<p>
-        Three types of objects are currently supported by the library:
-      </p>
-<div class="itemizedlist"><ul class="itemizedlist" type="disc">
-<li class="listitem">
-          standard-like containers
-        </li>
-<li class="listitem"><code class="computeroutput"><span class="identifier">std</span><span class="special">::</span><span class="identifier">pair</span><span class="special">&lt;</span><span class="identifier">iterator</span><span class="special">,</span><span class="identifier">iterator</span><span class="special">&gt;</span></code></li>
-<li class="listitem">
-          built-in arrays
-        </li>
-</ul></div>
-<p>
-        Even though the behavior of the primary templates are exactly such that standard
-        containers will be supported by default, the requirements are much lower
-        than the standard container requirements. For example, the utility class
-        <a class="link" href="../utilities/iterator_range.html" title="Class iterator_range"><code class="computeroutput"><span class="identifier">iterator_range</span></code></a>
-        implements the <a class="link" href="extending.html" title="Extending the library">minimal interface</a>
-        required to make the class a <a class="link" href="../concepts/forward_range.html" title="Forward Range">Forward
-        Range</a>.
-      </p>
-<p>
-        Please also see <a class="link" href="../concepts.html" title="Range Concepts">Range concepts</a> for
-        more details.
-      </p>
-</div>
-<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
-<td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright &#169; 2003 -2010 Thorsten Ottosen, Neil Groves<p>
-        Distributed under the Boost Software License, Version 1.0. (See accompanying
-        file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
-      </p>
-</div></td>
-</tr></table>
-<hr>
-<div class="spirit-nav">
-<a accesskey="p" href="../reference.html"><img src="../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../reference.html"><img src="../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="synopsis.html"><img src="../../../../../../doc/html/images/next.png" alt="Next"></a>
-</div>
-</body>
-</html>

Modified: branches/release/libs/range/doc/html/range/reference/ranges.html
==============================================================================
--- branches/release/libs/range/doc/html/range/reference/ranges.html	(original)
+++ branches/release/libs/range/doc/html/range/reference/ranges.html	2010-04-29 17:18:58 EDT (Thu, 29 Apr 2010)
@@ -6,7 +6,7 @@
 <meta name="generator" content="DocBook XSL Stylesheets V1.75.1">
 <link rel="home" href="../../index.html" title="Chapter&#160;1.&#160;Range 2.0">
 <link rel="up" href="../reference.html" title="Reference">
-<link rel="prev" href="algorithms/range_numeric/partial_sum.html" title="partial_sum">
+<link rel="prev" href="algorithms/numeric/partial_sum.html" title="partial_sum">
 <link rel="next" href="ranges/counting_range.html" title="counting_range">
 </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="algorithms/range_numeric/partial_sum.html"><img src="../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../reference.html"><img src="../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="ranges/counting_range.html"><img src="../../../../../../doc/html/images/next.png" alt="Next"></a>
+<a accesskey="p" href="algorithms/numeric/partial_sum.html"><img src="../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../reference.html"><img src="../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="ranges/counting_range.html"><img src="../../../../../../doc/html/images/next.png" alt="Next"></a>
 </div>
 <div class="section" title="Provided Ranges">
 <div class="titlepage"><div><div><h3 class="title">
@@ -42,7 +42,7 @@
 </tr></table>
 <hr>
 <div class="spirit-nav">
-<a accesskey="p" href="algorithms/range_numeric/partial_sum.html"><img src="../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../reference.html"><img src="../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="ranges/counting_range.html"><img src="../../../../../../doc/html/images/next.png" alt="Next"></a>
+<a accesskey="p" href="algorithms/numeric/partial_sum.html"><img src="../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../reference.html"><img src="../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="ranges/counting_range.html"><img src="../../../../../../doc/html/images/next.png" alt="Next"></a>
 </div>
 </body>
 </html>

Modified: branches/release/libs/range/doc/html/range/reference/ranges/counting_range.html
==============================================================================
--- branches/release/libs/range/doc/html/range/reference/ranges/counting_range.html	(original)
+++ branches/release/libs/range/doc/html/range/reference/ranges/counting_range.html	2010-04-29 17:18:58 EDT (Thu, 29 Apr 2010)
@@ -27,7 +27,7 @@
 <a name="range.reference.ranges.counting_range"></a><a class="link" href="counting_range.html" title="counting_range"> counting_range</a>
 </h4></div></div></div>
 <a name="range.reference.ranges.counting_range.prototype"></a><h6>
-<a name="id3111863"></a>
+<a name="id2794262"></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="id3112247"></a>
+<a name="id2794647"></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="id3112306"></a>
+<a name="id2794705"></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="id3112370"></a>
+<a name="id2794769"></a>
           <a class="link" href="counting_range.html#range.reference.ranges.counting_range.requirements">Requirements</a>
         </h6>
 <div class="orderedlist"><ol class="orderedlist" type="1"><li class="listitem">

Modified: branches/release/libs/range/doc/html/range/reference/ranges/irange.html
==============================================================================
--- branches/release/libs/range/doc/html/range/reference/ranges/irange.html	(original)
+++ branches/release/libs/range/doc/html/range/reference/ranges/irange.html	2010-04-29 17:18:58 EDT (Thu, 29 Apr 2010)
@@ -7,7 +7,7 @@
 <link rel="home" href="../../../index.html" title="Chapter&#160;1.&#160;Range 2.0">
 <link rel="up" href="../ranges.html" title="Provided Ranges">
 <link rel="prev" href="istream_range.html" title="istream_range">
-<link rel="next" href="../extending.html" title="Extending the library">
+<link rel="next" href="../utilities.html" title="Utilities">
 </head>
 <body bgcolor="white" text="black" link="#0000FF" vlink="#840084" alink="#0000FF">
 <table cellpadding="2" width="100%"><tr>
@@ -20,31 +20,31 @@
 </tr></table>
 <hr>
 <div class="spirit-nav">
-<a accesskey="p" href="istream_range.html"><img src="../../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../ranges.html"><img src="../../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../../index.html"><img src="../../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="../extending.html"><img src="../../../../../../../doc/html/images/next.png" alt="Next"></a>
+<a accesskey="p" href="istream_range.html"><img src="../../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../ranges.html"><img src="../../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../../index.html"><img src="../../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="../utilities.html"><img src="../../../../../../../doc/html/images/next.png" alt="Next"></a>
 </div>
 <div class="section" title="irange">
 <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>
 </h4></div></div></div>
 <a name="range.reference.ranges.irange.prototype"></a><h6>
-<a name="id3112811"></a>
+<a name="id2795210"></a>
           <a class="link" href="irange.html#range.reference.ranges.irange.prototype">Prototype</a>
         </h6>
 <p>
           
 </p>
 <pre class="programlisting"><span class="keyword">template</span><span class="special">&lt;</span><span class="keyword">class</span> <span class="identifier">Integer</span><span class="special">&gt;</span>
-<span class="identifier">integer_range</span><span class="special">&lt;</span> <span class="identifier">range_detail</span><span class="special">::</span><span class="identifier">integer_iterator</span><span class="special">&lt;</span><span class="identifier">Integer</span><span class="special">&gt;</span> <span class="special">&gt;</span>
+<span class="identifier">iterator_range</span><span class="special">&lt;</span> <span class="identifier">range_detail</span><span class="special">::</span><span class="identifier">integer_iterator</span><span class="special">&lt;</span><span class="identifier">Integer</span><span class="special">&gt;</span> <span class="special">&gt;</span>
 <span class="identifier">irange</span><span class="special">(</span><span class="identifier">Integer</span> <span class="identifier">first</span><span class="special">,</span> <span class="identifier">Integer</span>  <span class="identifier">last</span><span class="special">);</span>
 
 <span class="keyword">template</span><span class="special">&lt;</span><span class="keyword">class</span> <span class="identifier">Integer</span><span class="special">,</span> <span class="keyword">class</span> <span class="identifier">StepSize</span><span class="special">&gt;</span>
-<span class="identifier">integer_range</span><span class="special">&lt;</span> <span class="identifier">range_detail</span><span class="special">::</span><span class="identifier">integer_iterator_with_step</span><span class="special">&lt;</span><span class="identifier">Integer</span><span class="special">,</span> <span class="identifier">StepSize</span><span class="special">&gt;</span> <span class="special">&gt;</span>
+<span class="identifier">iterator_range</span><span class="special">&lt;</span> <span class="identifier">range_detail</span><span class="special">::</span><span class="identifier">integer_iterator_with_step</span><span class="special">&lt;</span><span class="identifier">Integer</span><span class="special">,</span> <span class="identifier">StepSize</span><span class="special">&gt;</span> <span class="special">&gt;</span>
 <span class="identifier">irange</span><span class="special">(</span><span class="identifier">Integer</span> <span class="identifier">first</span><span class="special">,</span> <span class="identifier">Integer</span> <span class="identifier">last</span><span class="special">,</span> <span class="identifier">StepSize</span> <span class="identifier">step_size</span><span class="special">);</span>
 </pre>
 <p>
         </p>
 <a name="range.reference.ranges.irange.description"></a><h6>
-<a name="id3113106"></a>
+<a name="id2795506"></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="id3113188"></a>
+<a name="id2795587"></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="id3113250"></a>
+<a name="id2795650"></a>
           <a class="link" href="irange.html#range.reference.ranges.irange.requirements">Requirements</a>
         </h6>
 <div class="orderedlist"><ol class="orderedlist" type="1">
@@ -79,7 +79,7 @@
           </li>
 </ol></div>
 <a name="range.reference.ranges.irange.complexity"></a><h6>
-<a name="id3113330"></a>
+<a name="id2795730"></a>
           <a class="link" href="irange.html#range.reference.ranges.irange.complexity">Complexity</a>
         </h6>
 <p>
@@ -97,7 +97,7 @@
 </tr></table>
 <hr>
 <div class="spirit-nav">
-<a accesskey="p" href="istream_range.html"><img src="../../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../ranges.html"><img src="../../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../../index.html"><img src="../../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="../extending.html"><img src="../../../../../../../doc/html/images/next.png" alt="Next"></a>
+<a accesskey="p" href="istream_range.html"><img src="../../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../ranges.html"><img src="../../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../../index.html"><img src="../../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="../utilities.html"><img src="../../../../../../../doc/html/images/next.png" alt="Next"></a>
 </div>
 </body>
 </html>

Modified: branches/release/libs/range/doc/html/range/reference/ranges/istream_range.html
==============================================================================
--- branches/release/libs/range/doc/html/range/reference/ranges/istream_range.html	(original)
+++ branches/release/libs/range/doc/html/range/reference/ranges/istream_range.html	2010-04-29 17:18:58 EDT (Thu, 29 Apr 2010)
@@ -27,7 +27,7 @@
 <a name="range.reference.ranges.istream_range"></a><a class="link" href="istream_range.html" title="istream_range"> istream_range</a>
 </h4></div></div></div>
 <a name="range.reference.ranges.istream_range.prototype"></a><h6>
-<a name="id3112444"></a>
+<a name="id2794843"></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="id3112664"></a>
+<a name="id2795062"></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="id3112731"></a>
+<a name="id2795130"></a>
           <a class="link" href="istream_range.html#range.reference.ranges.istream_range.definition">Definition</a>
         </h6>
 <p>

Deleted: branches/release/libs/range/doc/html/range/reference/semantics.html
==============================================================================
--- branches/release/libs/range/doc/html/range/reference/semantics.html	2010-04-29 17:18:58 EDT (Thu, 29 Apr 2010)
+++ (empty file)
@@ -1,163 +0,0 @@
-<html>
-<head>
-<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
-<title>Semantics</title>
-<link rel="stylesheet" href="../../../../../../doc/html/boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.75.1">
-<link rel="home" href="../../index.html" title="Chapter&#160;1.&#160;Range 2.0">
-<link rel="up" href="../reference.html" title="Reference">
-<link rel="prev" href="synopsis.html" title="Synopsis">
-<link rel="next" href="semantics/metafunctions.html" title="Metafunctions">
-</head>
-<body bgcolor="white" text="black" link="#0000FF" vlink="#840084" alink="#0000FF">
-<table cellpadding="2" width="100%"><tr>
-<td valign="top"><img alt="Boost C++ Libraries" width="277" height="86" src="../../../../../../boost.png"></td>
-<td align="center">Home</td>
-<td align="center">Libraries</td>
-<td align="center">People</td>
-<td align="center">FAQ</td>
-<td align="center">More</td>
-</tr></table>
-<hr>
-<div class="spirit-nav">
-<a accesskey="p" href="synopsis.html"><img src="../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../reference.html"><img src="../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="semantics/metafunctions.html"><img src="../../../../../../doc/html/images/next.png" alt="Next"></a>
-</div>
-<div class="section" title="Semantics">
-<div class="titlepage"><div><div><h3 class="title">
-<a name="range.reference.semantics"></a><a class="link" href="semantics.html" title="Semantics">Semantics</a>
-</h3></div></div></div>
-<div class="toc"><dl>
-<dt><span class="section">Metafunctions</span></dt>
-<dt><span class="section">Functions</span></dt>
-</dl></div>
-<a name="range.reference.semantics.notation"></a><h5>
-<a name="id3021991"></a>
-        <a class="link" href="semantics.html#range.reference.semantics.notation">notation</a>
-      </h5>
-<div class="informaltable"><table class="table">
-<colgroup>
-<col>
-<col>
-<col>
-</colgroup>
-<thead><tr>
-<th>
-                <p>
-                  Type
-                </p>
-              </th>
-<th>
-                <p>
-                  Object
-                </p>
-              </th>
-<th>
-                <p>
-                  Describes
-                </p>
-              </th>
-</tr></thead>
-<tbody>
-<tr>
-<td>
-                <p>
-                  <code class="computeroutput"><span class="identifier">X</span></code>
-                </p>
-              </td>
-<td>
-                <p>
-                  <code class="computeroutput"><span class="identifier">x</span></code>
-                </p>
-              </td>
-<td>
-                <p>
-                  any type
-                </p>
-              </td>
-</tr>
-<tr>
-<td>
-                <p>
-                  <code class="computeroutput"><span class="identifier">T</span></code>
-                </p>
-              </td>
-<td>
-                <p>
-                  <code class="computeroutput"><span class="identifier">t</span></code>
-                </p>
-              </td>
-<td>
-                <p>
-                  denotes behavior of the primary templates
-                </p>
-              </td>
-</tr>
-<tr>
-<td>
-                <p>
-                  <code class="computeroutput"><span class="identifier">P</span></code>
-                </p>
-              </td>
-<td>
-                <p>
-                  <code class="computeroutput"><span class="identifier">p</span></code>
-                </p>
-              </td>
-<td>
-                <p>
-                  denotes <code class="computeroutput"><span class="identifier">std</span><span class="special">::</span><span class="identifier">pair</span><span class="special">&lt;</span><span class="identifier">iterator</span><span class="special">,</span><span class="identifier">iterator</span><span class="special">&gt;</span></code>
-                </p>
-              </td>
-</tr>
-<tr>
-<td>
-                <p>
-                  <code class="computeroutput"><span class="identifier">A</span><span class="special">[</span><span class="identifier">sz</span><span class="special">]</span></code>
-                </p>
-              </td>
-<td>
-                <p>
-                  <code class="computeroutput"><span class="identifier">a</span></code>
-                </p>
-              </td>
-<td>
-                <p>
-                  denotes an array of type <code class="computeroutput"><span class="identifier">A</span></code>
-                  of size <code class="computeroutput"><span class="identifier">sz</span></code>
-                </p>
-              </td>
-</tr>
-<tr>
-<td>
-                <p>
-                  <code class="computeroutput"><span class="identifier">Char</span><span class="special">*</span></code>
-                </p>
-              </td>
-<td>
-                <p>
-                  <code class="computeroutput"><span class="identifier">s</span></code>
-                </p>
-              </td>
-<td>
-                <p>
-                  denotes either <code class="computeroutput"><span class="keyword">char</span><span class="special">*</span></code> or <code class="computeroutput"><span class="keyword">wchar_t</span><span class="special">*</span></code>
-                </p>
-              </td>
-</tr>
-</tbody>
-</table></div>
-</div>
-<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
-<td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright &#169; 2003 -2010 Thorsten Ottosen, Neil Groves<p>
-        Distributed under the Boost Software License, Version 1.0. (See accompanying
-        file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
-      </p>
-</div></td>
-</tr></table>
-<hr>
-<div class="spirit-nav">
-<a accesskey="p" href="synopsis.html"><img src="../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../reference.html"><img src="../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="semantics/metafunctions.html"><img src="../../../../../../doc/html/images/next.png" alt="Next"></a>
-</div>
-</body>
-</html>

Modified: branches/release/libs/range/doc/html/range/style_guide.html
==============================================================================
--- branches/release/libs/range/doc/html/range/style_guide.html	(original)
+++ branches/release/libs/range/doc/html/range/style_guide.html	2010-04-29 17:18:58 EDT (Thu, 29 Apr 2010)
@@ -6,7 +6,7 @@
 <meta name="generator" content="DocBook XSL Stylesheets V1.75.1">
 <link rel="home" href="../index.html" title="Chapter&#160;1.&#160;Range 2.0">
 <link rel="up" href="../index.html" title="Chapter&#160;1.&#160;Range 2.0">
-<link rel="prev" href="utilities/join.html" title="Function join">
+<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">
 </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="utilities/join.html"><img src="../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../index.html"><img src="../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../index.html"><img src="../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="library_headers.html"><img src="../../../../../doc/html/images/next.png" alt="Next"></a>
+<a accesskey="p" href="reference/extending/method_3/method_3_2.html"><img src="../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../index.html"><img src="../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../index.html"><img src="../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="library_headers.html"><img src="../../../../../doc/html/images/next.png" alt="Next"></a>
 </div>
 <div class="section" title="Terminology and style guidelines">
 <div class="titlepage"><div><div><h2 class="title" style="clear: both">
@@ -92,7 +92,7 @@
     </p>
 <p>
       It might, however, be reasonable to specify only one category if the other
-      category does not matter. For example, the <a class="link" href="utilities/iterator_range.html" title="Class iterator_range"><code class="computeroutput"><span class="identifier">iterator_range</span></code></a> can be constructed
+      category does not matter. For example, the <a class="link" href="reference/utilities/iterator_range.html" title="Class iterator_range"><code class="computeroutput"><span class="identifier">iterator_range</span></code></a> can be constructed
       from a Forward Range. This means that we do not care about what <span class="bold"><strong><span class="emphasis"><em>value
       access</em></span></strong></span> properties the Range has. Similarly, a Readable
       Range will be one that has the lowest possible <span class="bold"><strong><span class="emphasis"><em>traversal</em></span></strong></span>
@@ -135,7 +135,7 @@
 </tr></table>
 <hr>
 <div class="spirit-nav">
-<a accesskey="p" href="utilities/join.html"><img src="../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../index.html"><img src="../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../index.html"><img src="../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="library_headers.html"><img src="../../../../../doc/html/images/next.png" alt="Next"></a>
+<a accesskey="p" href="reference/extending/method_3/method_3_2.html"><img src="../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../index.html"><img src="../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../index.html"><img src="../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="library_headers.html"><img src="../../../../../doc/html/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-04-29 17:18:58 EDT (Thu, 29 Apr 2010)
@@ -33,12 +33,11 @@
 <div class="orderedlist"><ol class="orderedlist" type="1">
 <li class="listitem">
           Direct support for character arrays was abandoned in favor of uniform treatment
-          of all arrays. Instead string algorithms can use the new function <a class="link" href="../reference/semantics/functions.html" title="Functions"><code class="computeroutput"><span class="identifier">as_literal</span></code></a><code class="computeroutput"><span class="special">()</span></code>.
+          of all arrays. Instead string algorithms can use the new function <a class="link" href="../reference/concept_implementation/semantics/functions.html" title="Functions"><code class="computeroutput"><span class="identifier">as_literal</span></code></a><code class="computeroutput"><span class="special">()</span></code>.
         </li>
 <li class="listitem">
-<a class="link" href="../reference/semantics/functions.html" title="Functions"><code class="computeroutput"><span class="identifier">size</span></code></a>
-          now requires a <a class="link" href="../concepts/random_access_range.html" title="Random Access Range">Random
-          Access Range</a>. The old behavior is provided as <a class="link" href="../reference/semantics/functions.html" title="Functions"><code class="computeroutput"><span class="identifier">distance</span></code></a><code class="computeroutput"><span class="special">()</span></code>.
+<a class="link" href="../reference/concept_implementation/semantics/functions.html" title="Functions"><code class="computeroutput"><span class="identifier">size</span></code></a> now requires a <a class="link" href="../concepts/random_access_range.html" title="Random Access Range">Random
+          Access Range</a>. The old behavior is provided as <a class="link" href="../reference/concept_implementation/semantics/functions.html" title="Functions"><code class="computeroutput"><span class="identifier">distance</span></code></a><code class="computeroutput"><span class="special">()</span></code>.
         </li>
 <li class="listitem">
 <code class="computeroutput"><span class="identifier">range_size</span><span class="special">&lt;</span><span class="identifier">T</span><span class="special">&gt;::</span><span class="identifier">type</span></code> has been completely removed in favor

Deleted: branches/release/libs/range/doc/html/range/utilities.html
==============================================================================
--- branches/release/libs/range/doc/html/range/utilities.html	2010-04-29 17:18:58 EDT (Thu, 29 Apr 2010)
+++ (empty file)
@@ -1,82 +0,0 @@
-<html>
-<head>
-<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
-<title>Utilities</title>
-<link rel="stylesheet" href="../../../../../doc/html/boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.75.1">
-<link rel="home" href="../index.html" title="Chapter&#160;1.&#160;Range 2.0">
-<link rel="up" href="../index.html" title="Chapter&#160;1.&#160;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="utilities/iterator_range.html" title="Class iterator_range">
-</head>
-<body bgcolor="white" text="black" link="#0000FF" vlink="#840084" alink="#0000FF">
-<table cellpadding="2" width="100%"><tr>
-<td valign="top"><img alt="Boost C++ Libraries" width="277" height="86" src="../../../../../boost.png"></td>
-<td align="center">Home</td>
-<td align="center">Libraries</td>
-<td align="center">People</td>
-<td align="center">FAQ</td>
-<td align="center">More</td>
-</tr></table>
-<hr>
-<div class="spirit-nav">
-<a accesskey="p" href="reference/extending/method_3/method_3_2.html"><img src="../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../index.html"><img src="../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../index.html"><img src="../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="utilities/iterator_range.html"><img src="../../../../../doc/html/images/next.png" alt="Next"></a>
-</div>
-<div class="section" title="Utilities">
-<div class="titlepage"><div><div><h2 class="title" style="clear: both">
-<a name="range.utilities"></a><a class="link" href="utilities.html" title="Utilities"> Utilities</a>
-</h2></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>
-</dl></div>
-<p>
-      Having an abstraction that encapsulates a pair of iterators is very useful.
-      The standard library uses <code class="computeroutput"><span class="identifier">std</span><span class="special">::</span><span class="identifier">pair</span></code> 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, <code class="computeroutput"><span class="identifier">std</span><span class="special">::</span><span class="identifier">pair</span><span class="special">&lt;</span><span class="identifier">iterator</span><span class="special">,</span><span class="identifier">iterator</span><span class="special">&gt;</span></code> is hardly self-documenting whereas more
-      domain specific class names are. Therefore these two classes are provided:
-    </p>
-<div class="itemizedlist"><ul class="itemizedlist" type="disc">
-<li class="listitem">
-        Class <code class="computeroutput"><span class="identifier">iterator_range</span></code>
-</li>
-<li class="listitem">
-        Class <code class="computeroutput"><span class="identifier">sub_range</span></code>
-</li>
-<li class="listitem">
-        Function <code class="computeroutput"><span class="identifier">join</span></code>
-</li>
-</ul></div>
-<p>
-      The <code class="computeroutput"><span class="identifier">iterator_range</span></code> class is
-      templated on an <a href="../../../../../libs/iterator/doc/new-iter-concepts.html#forward-traversal-iterators-lib-forward-traversal-iterators" target="_top">Forward
-      Traversal Iterator</a> and should be used whenever fairly general code
-      is needed. The <code class="computeroutput"><span class="identifier">sub_range</span></code> class
-      is templated on an <a class="link" href="concepts/forward_range.html" title="Forward Range">Forward Range</a>
-      and it is less general, but a bit easier to use since its template argument
-      is easier to specify. The biggest difference is, however, that a <code class="computeroutput"><span class="identifier">sub_range</span></code> can propagate constness because
-      it knows what a corresponding <code class="computeroutput"><span class="identifier">const_iterator</span></code>
-      is.
-    </p>
-<p>
-      Both classes can be used as ranges since they implement the <a class="link" href="reference/extending.html" title="Extending the library">minimal
-      interface</a> required for this to work automatically.
-    </p>
-</div>
-<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
-<td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright &#169; 2003 -2010 Thorsten Ottosen, Neil Groves<p>
-        Distributed under the Boost Software License, Version 1.0. (See accompanying
-        file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
-      </p>
-</div></td>
-</tr></table>
-<hr>
-<div class="spirit-nav">
-<a accesskey="p" href="reference/extending/method_3/method_3_2.html"><img src="../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../index.html"><img src="../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../index.html"><img src="../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="utilities/iterator_range.html"><img src="../../../../../doc/html/images/next.png" alt="Next"></a>
-</div>
-</body>
-</html>

Modified: branches/release/libs/range/doc/html/range/utilities/iterator_range.html
==============================================================================
--- branches/release/libs/range/doc/html/range/utilities/iterator_range.html	(original)
+++ branches/release/libs/range/doc/html/range/utilities/iterator_range.html	2010-04-29 17:18:58 EDT (Thu, 29 Apr 2010)
@@ -47,7 +47,7 @@
         limitation is simply propogated from the underlying iterator type.
       </p>
 <a name="range.utilities.iterator_range.synopsis"></a><h5>
-<a name="id3119597"></a>
+<a name="id2763343"></a>
         <a class="link" href="iterator_range.html#range.utilities.iterator_range.synopsis">Synopsis</a>
       </h5>
 <p>
@@ -187,7 +187,7 @@
         iterators from the same container.
       </p>
 <a name="range.utilities.iterator_range.details_member_functions"></a><h5>
-<a name="id3122828"></a>
+<a name="id2766569"></a>
         <a class="link" href="iterator_range.html#range.utilities.iterator_range.details_member_functions">Details
         member functions</a>
       </h5>
@@ -218,7 +218,7 @@
         </p>
 </blockquote></div>
 <a name="range.utilities.iterator_range.details_functions"></a><h5>
-<a name="id3123073"></a>
+<a name="id2766813"></a>
         <a class="link" href="iterator_range.html#range.utilities.iterator_range.details_functions">Details
         functions</a>
       </h5>

Modified: branches/release/libs/range/doc/html/range/utilities/join.html
==============================================================================
--- branches/release/libs/range/doc/html/range/utilities/join.html	(original)
+++ branches/release/libs/range/doc/html/range/utilities/join.html	2010-04-29 17:18:58 EDT (Thu, 29 Apr 2010)
@@ -39,7 +39,7 @@
         if the end of a range has been reached internally during traversal.
       </p>
 <a name="range.utilities.join.synposis"></a><h5>
-<a name="id3125510"></a>
+<a name="id2769247"></a>
         <a class="link" href="join.html#range.utilities.join.synposis">Synposis</a>
       </h5>
 <p>
@@ -65,7 +65,7 @@
 <p>
       </p>
 <a name="range.utilities.join.example"></a><h5>
-<a name="id3126057"></a>
+<a name="id2769794"></a>
         <a class="link" href="join.html#range.utilities.join.example">Example</a>
       </h5>
 <p>

Modified: branches/release/libs/range/doc/html/range/utilities/sub_range.html
==============================================================================
--- branches/release/libs/range/doc/html/range/utilities/sub_range.html	(original)
+++ branches/release/libs/range/doc/html/range/utilities/sub_range.html	2010-04-29 17:18:58 EDT (Thu, 29 Apr 2010)
@@ -35,7 +35,7 @@
         is.
       </p>
 <a name="range.utilities.sub_range.synopsis"></a><h5>
-<a name="id3124232"></a>
+<a name="id2767970"></a>
         <a class="link" href="sub_range.html#range.utilities.sub_range.synopsis">Synopsis</a>
       </h5>
 <p>

Modified: branches/release/libs/range/doc/reference.qbk
==============================================================================
--- branches/release/libs/range/doc/reference.qbk	(original)
+++ branches/release/libs/range/doc/reference.qbk	2010-04-29 17:18:58 EDT (Thu, 29 Apr 2010)
@@ -1,11 +1,16 @@
-[section Reference]
+[section:reference Reference]
 
 [include reference/overview.qbk]
+
+[section:concept_implementation Range concept implementation]
 [include reference/synopsis.qbk]
 [include reference/semantics.qbk]
+[endsect]
+
 [include reference/adaptors.qbk]
 [include reference/algorithms.qbk]
 [include reference/ranges.qbk]
+[include reference/utilities.qbk]
 [include reference/extending.qbk]
 
 [endsect]

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-04-29 17:18:58 EDT (Thu, 29 Apr 2010)
@@ -1,6 +1,6 @@
 [section:adaptors Range Adaptors]
 
-[section:adaptors_introduction Introduction and motivation]
+[section:introduction Introduction and motivation]
 
 A [*Range Adaptor] is a class that wraps an existing Range to provide a new Range with different behaviour. Since the behaviour of Ranges is determined by their associated iterators, a Range Adaptor simply wraps the underlying iterators with new special iterators. In this example
 
@@ -121,31 +121,7 @@
 
 [endsect]
 
-[section:adaptors_synopsis Synopsis]
-
-The library provides the following Adapter Generator expressions:
-
-``
-rng | boost::adaptors::adjacent_filtered(bi_pred)
-rng | boost::adaptors::copied(n,m)
-rng | boost::adaptors::filtered(pred)
-rng | boost::adaptors::indexed
-rng | boost::adaptors::indirected
-rng | boost::adaptors::map_keys
-rng | boost::adaptors::map_values
-rng | boost::adaptors::replaced(new_value, old_value)
-rng | boost::adaptors::replaced_if(pred, new_value)
-rng | boost::adaptors::reversed
-rng | boost::adaptors::sliced(n, m)
-rng | boost::adaptors::strided(n)
-rng | boost::adaptors::tokenized( <see arguments below> )
-rng | boost::adaptors::transformed(fun)
-rng | boost::adaptors::uniqued
-``
-
-[endsect]
-
-[section:adaptors_general_requirements General Requirements]
+[section:general_requirements General Requirements]
 
 In the description of generator expressions, the following notation is used:
 
@@ -183,7 +159,7 @@
 
 [endsect]
 
-[section:adaptors_reference Reference]
+[section:reference Reference]
 [include adaptors/adjacent_filtered.qbk]
 [include adaptors/copied.qbk]
 [include adaptors/filtered.qbk]

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-04-29 17:18:58 EDT (Thu, 29 Apr 2010)
@@ -9,7 +9,8 @@
 * [*Precondition:]  The `value_type` of the range is convertible to both argument types of `bi_pred`.
 * [*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:] `SinglePassRange`
+* [*Range Category:] __single_pass_range__
+* [*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-04-29 17:18:58 EDT (Thu, 29 Apr 2010)
@@ -8,7 +8,8 @@
 
 * [*Precondition:]  `0 <= n && n <= m && m < distance(rng)`
 * [*Returns:] A new `iterator_range` that holds the sliced range `[n,m)` of the original range.
-* [*Range Category:] `RandomAccessRange`
+* [*Range Category:] __random_access_range__
+* [*Returned Range Category:] __random_access_range__
 
 [section:copied_example copied example]
 ``

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-04-29 17:18:58 EDT (Thu, 29 Apr 2010)
@@ -9,8 +9,8 @@
 * [*Precondition:]  The `value_type` of the range is convertible to the argument type of `pred`.
 * [*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:] `ForwardRange`
-* [*Returned Range Category:] `ForwardRange`
+* [*Range Category:] __forward_range__
+* [*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-04-29 17:18:58 EDT (Thu, 29 Apr 2010)
@@ -7,7 +7,8 @@
 ]
 
 * [*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:] `SinglePassRange`
+* [*Range Category:] __single_pass_range__
+* [*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-04-29 17:18:58 EDT (Thu, 29 Apr 2010)
@@ -8,7 +8,8 @@
 
 * [*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:] `SinglePassRange`
+* [*Range Category:] __single_pass_range__
+* [*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-04-29 17:18:58 EDT (Thu, 29 Apr 2010)
@@ -8,7 +8,8 @@
 
 * [*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:] `SinglePassRange`
+* [*Range Category:] __single_pass_range__
+* [*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-04-29 17:18:58 EDT (Thu, 29 Apr 2010)
@@ -8,7 +8,8 @@
 
 * [*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:] `SinglePassRange`
+* [*Range Category:] __single_pass_range__
+* [*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-04-29 17:18:58 EDT (Thu, 29 Apr 2010)
@@ -10,7 +10,8 @@
     * `new_value` is convertible to the `value_type` of the range.
     * `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:] `ForwardRange`
+* [*Range Category:] __forward_range__
+* [*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-04-29 17:18:58 EDT (Thu, 29 Apr 2010)
@@ -10,7 +10,8 @@
     * The range `value_type` is convertible to the argument type of `pred`.
     * `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:] `ForwardRange`
+* [*Range Category:] __forward_range__
+* [*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-04-29 17:18:58 EDT (Thu, 29 Apr 2010)
@@ -7,7 +7,8 @@
 ]
 
 * [*Returns:] A range whose iterators behave as if they were the original iterators wrapped in `reverse_iterator`.
-* [*Range Category:] `BidirectionalRange`
+* [*Range Category:] __bidirectional_range__
+* [*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-04-29 17:18:58 EDT (Thu, 29 Apr 2010)
@@ -8,7 +8,8 @@
 
 * [*Precondition:] `0 <= n && n <= m && m < distance(rng)`
 * [*Returns:] `make_range(rng, n, m)`
-* [*Range Category:] `RandomAccessRange`
+* [*Range Category:] __random_access_range__
+* [*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-04-29 17:18:58 EDT (Thu, 29 Apr 2010)
@@ -8,7 +8,8 @@
 
 * [*Precondition:] `0 <= n && n < distance(rng)`
 * [*Returns:] A new range based on `rng` where traversal is performed in steps of `n`.
-* [*Range Category:] `RandomAccessRange`
+* [*Range Category:] __random_access_range__
+* [*Returned Range Category:] __random_access_range__
 
 [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-04-29 17:18:58 EDT (Thu, 29 Apr 2010)
@@ -35,7 +35,8 @@
     * `flags` has the type `regex_constants::syntax_option_type`.
 * [*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:] `RandomAccessRange`
+* [*Range Category:] __random_access_range__
+* [*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-04-29 17:18:58 EDT (Thu, 29 Apr 2010)
@@ -9,7 +9,8 @@
 * [*Precondition:] The `value_type` of the range is convertible to the argument type of `fun`.
 * [*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:] `SinglePassRange`
+* [*Range Category:] __single_pass_range__
+* [*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-04-29 17:18:58 EDT (Thu, 29 Apr 2010)
@@ -8,7 +8,8 @@
 
 * [*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:] `ForwardRange`
+* [*Range Category:] __forward_range__
+* [*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-04-29 17:18:58 EDT (Thu, 29 Apr 2010)
@@ -1,4 +1,4 @@
-[section:adjacent_find Range Algorithm - adjacent_find]
+[section:adjacent_find adjacent_find]
 
 [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-04-29 17:18:58 EDT (Thu, 29 Apr 2010)
@@ -1,4 +1,4 @@
-[section:copy Range Algorithm - copy]
+[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-04-29 17:18:58 EDT (Thu, 29 Apr 2010)
@@ -1,4 +1,4 @@
-[section:copy_backward Range Algorithm - copy_backward]
+[section:copy_backward copy_backward]
 
 [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-04-29 17:18:58 EDT (Thu, 29 Apr 2010)
@@ -1,4 +1,4 @@
-[section:fill Range Algorithm - fill]
+[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-04-29 17:18:58 EDT (Thu, 29 Apr 2010)
@@ -1,4 +1,4 @@
-[section:fill_n Range Algorithm - fill_n]
+[section:fill_n fill_n]
 
 [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-04-29 17:18:58 EDT (Thu, 29 Apr 2010)
@@ -1,4 +1,4 @@
-[section:generate Range Algorithm - generate]
+[section:generate generate]
 
 [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-04-29 17:18:58 EDT (Thu, 29 Apr 2010)
@@ -1,4 +1,4 @@
-[section:inplace_merge Range Algorithm - inplace_merge]
+[section:inplace_merge inplace_merge]
 
 [heading Prototype]
 
@@ -7,18 +7,18 @@
 BidirectionalRange&
 inplace_merge( BidirectionalRange& rng,
                typename range_iterator<BidirectionalRange>::type middle );
-               
+
 template<class BidirectionalRange>
 const BidirectionalRange&
 inplace_merge( const BidirectionalRange& rng,
                typename range_iterator<const BidirectionalRange>::type middle );
-               
+
 template<class BidirectionalRange, class BinaryPredicate>
 BidirectionalRange&
 inplace_merge( BidirectionalRange& rng,
                typename range_iterator<BidirectionalRange>::type middle,
                BinaryPredicate pred );
-               
+
 template<class BidirectionalRange, class BinaryPredicate>
 const BidirectionalRange&
 inplace_merge( const BidirectionalRange& rng,

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-04-29 17:18:58 EDT (Thu, 29 Apr 2010)
@@ -1,4 +1,4 @@
-[section:merge Range Algorithm - merge]
+[section:merge merge]
 
 [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-04-29 17:18:58 EDT (Thu, 29 Apr 2010)
@@ -75,12 +75,10 @@
 
 [heading Description]
 
-The versions of `mismatch` that return an iterator, return an iterator to the first position where `rng1` and `rng2` differ.
+`mismatch` finds the first position where the correseponding elements from the two ranges `rng1` and `rng2` are not equal.
 
 Equality is determined by `operator==` for non-predicate versions of `mismatch`, and by satisfying `pred` in the predicate versions.
 
-The versions of `mismatch` that return a `range_return`, defines `found` in the same manner as the returned iterator described above.
-
 [heading Definition]
 
 Defined in the header file `boost/range/algorithm/mismatch.hpp`

Modified: branches/release/libs/range/doc/reference/algorithm/nth_element.qbk
==============================================================================
--- branches/release/libs/range/doc/reference/algorithm/nth_element.qbk	(original)
+++ branches/release/libs/range/doc/reference/algorithm/nth_element.qbk	2010-04-29 17:18:58 EDT (Thu, 29 Apr 2010)
@@ -1,4 +1,4 @@
-[section:nth_element Range Algorithm - nth_element]
+[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-04-29 17:18:58 EDT (Thu, 29 Apr 2010)
@@ -1,4 +1,4 @@
-[section:partial_sort Range Algorithm - partial_sort]
+[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-04-29 17:18:58 EDT (Thu, 29 Apr 2010)
@@ -1,4 +1,4 @@
-[section:partition Range Algorithm - partition]
+[section:partition partition]
 
 [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-04-29 17:18:58 EDT (Thu, 29 Apr 2010)
@@ -1,4 +1,4 @@
-[section:random_shuffle Range Algorithm - random_shuffle]
+[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-04-29 17:18:58 EDT (Thu, 29 Apr 2010)
@@ -1,4 +1,4 @@
-[section:remove Range Algorithm - remove]
+[section:remove remove]
 
 [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-04-29 17:18:58 EDT (Thu, 29 Apr 2010)
@@ -1,4 +1,4 @@
-[section:remove_if Range Algorithm - remove_if]
+[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-04-29 17:18:58 EDT (Thu, 29 Apr 2010)
@@ -1,4 +1,4 @@
-[section:replace Range Algorithm - replace]
+[section:replace replace]
 
 [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-04-29 17:18:58 EDT (Thu, 29 Apr 2010)
@@ -1,4 +1,4 @@
-[section:replace_if Range Algorithm - replace_if]
+[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-04-29 17:18:58 EDT (Thu, 29 Apr 2010)
@@ -1,4 +1,4 @@
-[section:reverse Range Algorithm - reverse]
+[section:reverse reverse]
 
 [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-04-29 17:18:58 EDT (Thu, 29 Apr 2010)
@@ -1,4 +1,4 @@
-[section:rotate Range Algorithm - rotate]
+[section:rotate rotate]
 
 [heading Prototype]
 
@@ -6,7 +6,7 @@
 template<class ForwardRange>
 ForwardRange& rotate(ForwardRange& rng,
                      typename range_iterator<ForwardRange>::type middle);
-                     
+
 template<class ForwardRange>
 const ForwardRange& rotate(const ForwardRange& rng,
                            typename range_iterator<const ForwardRange>::type middle);

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-04-29 17:18:58 EDT (Thu, 29 Apr 2010)
@@ -1,4 +1,4 @@
-[section:sort Range Algorithm - sort]
+[section:sort sort]
 
 [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-04-29 17:18:58 EDT (Thu, 29 Apr 2010)
@@ -1,4 +1,4 @@
-[section:stable_partition Range Algorithm - stable_partition]
+[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-04-29 17:18:58 EDT (Thu, 29 Apr 2010)
@@ -1,4 +1,4 @@
-[section:stable_sort Range Algorithm - stable_sort]
+[section:stable_sort stable_sort]
 
 [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-04-29 17:18:58 EDT (Thu, 29 Apr 2010)
@@ -1,4 +1,4 @@
-[section:transform Range Algorithm - transform]
+[section:transform transform]
 
 [heading Prototype]
 
@@ -11,7 +11,7 @@
 OutputIterator transform(const SinglePassRange1& rng,
                          OutputIterator out,
                          UnaryOperation fun);
-                         
+
 template<
     class SinglePassRange1,
     class SinglePassRange2,

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-04-29 17:18:58 EDT (Thu, 29 Apr 2010)
@@ -1,4 +1,4 @@
-[section:unique Range Algorithm - unique]
+[section:unique unique]
 
 [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-04-29 17:18:58 EDT (Thu, 29 Apr 2010)
@@ -74,11 +74,11 @@
 ``
 boost::erase(vec, boost::unique<boost::return_next_end>(vec));
 ``
-and there is no need to worry about generating an invalid range. Furthermore, if the container is complex, calling `vec.begin()` several times will be more expensive than using a range algorithm.
+and there is no need to worry about generating an invalid range. Furthermore, if the container is complex, calling `vec.end()` several times will be more expensive than using a range algorithm.
 
 [endsect]
 
-[section:range_algorithm_mutating_algorithms Mutating algorithms]
+[section:mutating Mutating algorithms]
 [include algorithm/copy.qbk]
 [include algorithm/copy_backward.qbk]
 [include algorithm/fill.qbk]
@@ -91,21 +91,31 @@
 [include algorithm/partition.qbk]
 [include algorithm/random_shuffle.qbk]
 [include algorithm/remove.qbk]
+[include algorithm/remove_copy.qbk]
+[include algorithm/remove_copy_if.qbk]
 [include algorithm/remove_if.qbk]
 [include algorithm/replace.qbk]
+[include algorithm/replace_copy.qbk]
+[include algorithm/replace_copy_if.qbk]
 [include algorithm/replace_if.qbk]
+[include algorithm/reverse.qbk]
+[include algorithm/reverse_copy.qbk]
 [include algorithm/rotate.qbk]
+[include algorithm/rotate_copy.qbk]
 [include algorithm/sort.qbk]
 [include algorithm/stable_partition.qbk]
 [include algorithm/stable_sort.qbk]
+[include algorithm/swap_ranges.qbk]
 [include algorithm/transform.qbk]
 [include algorithm/unique.qbk]
+[include algorithm/unique_copy.qbk]
 [endsect]
 
-[section:range_algorithm_non_mutating_algorithms Non-mutating algorithms]
+[section:non_mutating Non-mutating algorithms]
 [include algorithm/adjacent_find.qbk]
 [include algorithm/binary_search.qbk]
 [include algorithm/count.qbk]
+[include algorithm/count_if.qbk]
 [include algorithm/equal.qbk]
 [include algorithm/equal_range.qbk]
 [include algorithm/for_each.qbk]
@@ -119,10 +129,11 @@
 [include algorithm/min_element.qbk]
 [include algorithm/mismatch.qbk]
 [include algorithm/search.qbk]
+[include algorithm/search_n.qbk]
 [include algorithm/upper_bound.qbk]
 [endsect]
 
-[section:set_algorithms Set algorithms]
+[section:set Set algorithms]
 [include algorithm/includes.qbk]
 [include algorithm/set_union.qbk]
 [include algorithm/set_intersection.qbk]
@@ -130,23 +141,25 @@
 [include algorithm/set_symmetric_difference.qbk]
 [endsect]
 
-[section:heap_algorithms Heap algorithms]
+[section:heap Heap algorithms]
 [include algorithm/push_heap.qbk]
 [include algorithm/pop_heap.qbk]
 [include algorithm/make_heap.qbk]
 [include algorithm/sort_heap.qbk]
 [endsect]
 
-[section:permutation_algorithms Permutation algorithms]
+[section:permutation Permutation algorithms]
 [include algorithm/next_permutation.qbk]
 [include algorithm/prev_permutation.qbk]
 [endsect]
 
-[section:range_algorithm_new_algorithms New algorithms]
+[section:new New algorithms]
+[include algorithm_ext/copy_n.qbk]
 [include algorithm_ext/erase.qbk]
 [include algorithm_ext/for_each.qbk]
 [include algorithm_ext/insert.qbk]
 [include algorithm_ext/iota.qbk]
+[include algorithm_ext/is_sorted.qbk]
 [include algorithm_ext/overwrite.qbk]
 [include algorithm_ext/push_back.qbk]
 [include algorithm_ext/push_front.qbk]
@@ -154,7 +167,7 @@
 [include algorithm_ext/remove_erase_if.qbk]
 [endsect]
 
-[section:range_numeric Numeric algorithms]
+[section:numeric Numeric algorithms]
 [include numeric/accumulate.qbk]
 [include numeric/adjacent_difference.qbk]
 [include numeric/inner_product.qbk]

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-04-29 17:18:58 EDT (Thu, 29 Apr 2010)
@@ -4,17 +4,17 @@
 
 ``
 template<class Integer>
-integer_range< range_detail::integer_iterator<Integer> >
+iterator_range< range_detail::integer_iterator<Integer> >
 irange(Integer first, Integer  last);
 
 template<class Integer, class StepSize>
-integer_range< range_detail::integer_iterator_with_step<Integer, StepSize> >
+iterator_range< range_detail::integer_iterator_with_step<Integer, StepSize> >
 irange(Integer first, Integer last, StepSize step_size);
 ``
 
 [heading Description]
 
-`irange` is a function to generate an Integer Range. 
+`irange` is a function to generate an Integer Range.
 
 `irange` allows treating integers as a model of the __random_access_range__ Concept. It should be noted that the `first` and `last` parameters denoted a half-open range.
 

Deleted: branches/release/libs/range/doc/utilities.qbk
==============================================================================
--- branches/release/libs/range/doc/utilities.qbk	2010-04-29 17:18:58 EDT (Thu, 29 Apr 2010)
+++ (empty file)
@@ -1,296 +0,0 @@
-[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:
-
-* Class `iterator_range`
-* Class `sub_range`
-* Function `join`
-
-The `iterator_range` class is templated on an __forward_traversal_iterator__ and should be used whenever fairly general code is needed. The `sub_range` class is templated on an __forward_range__ and it is less general, but a bit easier to use since its template argument is easier to specify. The biggest difference is, however, that a `sub_range` can propagate constness because it knows what a corresponding `const_iterator` is.
-
-Both classes can be used as ranges since they implement the __minimal_interface__ required for this to work automatically.
-
-[section:iterator_range Class `iterator_range`]
-
-The intention of the `iterator_range` class is to encapsulate two iterators so they fulfill the __forward_range__ concept. A few other functions are also provided for convenience.
-
-If the template argument is not a model of __forward_traversal_iterator__, one can still use a subset of the interface. In particular, `size()` requires Random Access Traversal Iterators whereas `empty()` only requires Single Pass Iterators.
-
-Recall that many default constructed iterators are [*/singular/] and hence can only be assigned, but not compared or incremented or anything. However, if one creates a default constructed `iterator_range`, then one can still call all its member functions. This design decision avoids the `iterator_range` imposing limitations upon ranges of iterators that are not singular. Any singularity limitation is simply propogated from the underlying iterator type.
-
-
-[h4 Synopsis]
-
-``
-namespace boost
-{
-    template< class ForwardTraversalIterator >
-    class iterator_range
-    {
-    public: // Forward Range types
-        typedef ForwardTraversalIterator   iterator;
-        typedef ForwardTraversalIterator   const_iterator;
-        typedef iterator_difference<iterator>::type difference_type;
-
-    public: // construction, assignment
-        template< class ForwardTraversalIterator2 >
-        iterator_range( ForwardTraversalIterator2 Begin, ForwardTraversalIterator2 End );
-                    
-        template< class ForwardRange >
-        iterator_range( ForwardRange& r );
-  
-        template< class ForwardRange >
-        iterator_range( const ForwardRange& r );
-        
-        template< class ForwardRange >
-        iterator_range& operator=( ForwardRange& r );
-
-        template< class ForwardRange >
-        iterator_range& operator=( const ForwardRange& r );
-    
-    public: // Forward Range functions
-        iterator  begin() const;
-        iterator  end() const;
-        
-    public: // convenience
-        operator    unspecified_bool_type() const;
-        bool        equal( const iterator_range& ) const;
-        value_type& front() const;
-        value_type& back() const;
-        iterator_range& advance_begin(difference_type n);
-        iterator_range& advance_end(difference_type n);
-        bool      empty() const;
-        // for Random Access Range only: 
-        reference operator[]( difference_type at ) const;
-        value_type operator()( difference_type at ) const;
-        size_type size() const;
-    };
-    
-    // stream output
-    template< class ForwardTraversalIterator, class T, class Traits >
-    std::basic_ostream<T,Traits>& 
-    operator<<( std::basic_ostream<T,Traits>& Os,
-                const iterator_range<ForwardTraversalIterator>& r );
-
-    // comparison
-    template< class ForwardTraversalIterator, class ForwardTraversalIterator2 >
-    bool operator==( const iterator_range<ForwardTraversalIterator>& l, 
-                     const iterator_range<ForwardTraversalIterator2>& r );
-
-    template< class ForwardTraversalIterator, class ForwardRange >
-    bool operator==( const iterator_range<ForwardTraversalIterator>& l, 
-                     const ForwardRange& r );
-
-    template< class ForwardTraversalIterator, class ForwardRange >
-    bool operator==( const ForwardRange& l,
-                     const iterator_range<ForwardTraversalIterator>& r );
-
-    template< class ForwardTraversalIterator, class ForwardTraversalIterator2 >
-    bool operator!=( const iterator_range<ForwardTraversalIterator>& l, 
-                     const iterator_range<ForwardTraversalIterator2>& r );
-
-    template< class ForwardTraversalIterator, class ForwardRange >
-    bool operator!=( const iterator_range<ForwardTraversalIterator>& l, 
-                     const ForwardRange& r );
-
-    template< class ForwardTraversalIterator, class ForwardRange >
-    bool operator!=( const ForwardRange& l,
-                     const iterator_range<ForwardTraversalIterator>& r );
-
-    template< class ForwardTraversalIterator, class ForwardTraversalIterator2 >
-    bool operator<( const iterator_range<ForwardTraversalIterator>& l, 
-                    const iterator_range<ForwardTraversalIterator2>& r );
-
-    template< class ForwardTraversalIterator, class ForwardRange >
-    bool operator<( const iterator_range<ForwardTraversalIterator>& l, 
-                    const ForwardRange& r );
-
-    template< class ForwardTraversalIterator, class ForwardRange >
-    bool operator<( const ForwardRange& l,
-                    const iterator_range<ForwardTraversalIterator>& r );
- 
-    // external construction
-    template< class ForwardTraversalIterator >
-    iterator_range< ForwardTraversalIterator >
-    make_iterator_range( ForwardTraversalIterator Begin, 
-                         ForwardTraversalIterator End );
-       
-    template< class ForwardRange >
-    iterator_range< typename range_iterator<ForwardRange>::type >
-    make_iterator_range( ForwardRange& r );
-
-    template< class ForwardRange >
-    iterator_range< typename range_iterator<const ForwardRange>::type >
-    make_iterator_range( const ForwardRange& r );
-    
-    template< class Range >
-    iterator_range< typename range_iterator<Range>::type >
-    make_iterator_range( Range& r,
-                         typename range_difference<Range>::type advance_begin,
-                         typename range_difference<Range>::type advance_end );
-    
-    template< class Range >
-    iterator_range< typename range_iterator<const Range>::type >
-    make_iterator_range( const Range& r, 
-                         typename range_difference<const Range>::type advance_begin,
-                         typename range_difference<const Range>::type advance_end );
-    
-    // convenience
-    template< class Sequence, class ForwardRange >
-    Sequence copy_range( const ForwardRange& r );
-    
-} // namespace 'boost'
-``    
-
-If an instance of `iterator_range` is constructed by a client with two iterators, the client must ensure that the two iterators delimit a valid closed-open range [begin,end).
-
-It is worth noticing that the templated constructors and assignment operators allow conversion from `iterator_range<iterator>` to `iterator_range<const_iterator>`. Similarly, since the comparison operators have two template arguments, we can compare ranges whenever the iterators are comparable; for example when we are dealing with const and non-const iterators from the same container.
-
-[h4 Details member functions]
-
-`operator unspecified_bool_type() const;`
-
-[:['[*Returns]] `!empty();`]
-
-`bool equal( iterator_range& r ) const;`
-
-[:['[*Returns]] `begin() == r.begin() && end() == r.end();`]
-
-[h4 Details functions]
-
-`bool operator==( const ForwardRange1& l, const ForwardRange2& r );`
-
-[:['[*Returns]] `size(l) != size(r) ? false : std::equal( begin(l), end(l), begin(r) );`]
-
-`bool operator!=( const ForwardRange1& l, const ForwardRange2& r );`
-
-[:['[*Returns]] `!( l == r );`]
-
-`bool operator<( const ForwardRange1& l, const ForwardRange2& r );`
-
-[:['[*Returns]] `std::lexicographical_compare( begin(l), end(l), begin(r), end(r) );`]
-
-``
-iterator_range make_iterator_range( Range& r,
-                                    typename range_difference<Range>::type advance_begin, 
-                                    typename range_difference<Range>::type advance_end );
-``
-
-[:['[*Effects:]]]
-
-``
-    iterator new_begin = begin( r ),
-    iterator new_end   = end( r );
-    std::advance( new_begin, advance_begin );
-    std::advance( new_end, advance_end );
-    return make_iterator_range( new_begin, new_end );
-``
-
-`Sequence copy_range( const ForwardRange& r );`
-
-[:['[*Returns]] `Sequence( begin(r), end(r) );`]
-
-[endsect]
-
-[section:sub_range Class `sub_range`]
-
-The `sub_range` class inherits all its functionality from the __iterator_range__ class. The `sub_range` class is often easier to use because one must specify the __forward_range__ template argument instead of an iterator. Moreover, the `sub_range` class can propagate constness since it knows what a corresponding `const_iterator` is.
-
-[h4 Synopsis]
-
-``
-namespace boost
-{
-    template< class ForwardRange >
-    class sub_range : public iterator_range< typename range_iterator<ForwardRange>::type >
-    {
-    public: 
-        typedef typename range_iterator<ForwardRange>::type iterator;
-        typedef typename range_iterator<const ForwardRange>::type  const_iterator;
-        typedef typename iterator_difference<iterator>::type difference_type;
-    
-    public: // construction, assignment
-        template< class ForwardTraversalIterator >
-        sub_range( ForwardTraversalIterator Begin, ForwardTraversalIterator End );
-
-        template< class ForwardRange2 >
-        sub_range( ForwardRange2& r );
-         
-        template< class ForwardRange2 >
-        sub_range( const Range2& r );
-         
-        template< class ForwardRange2 >
-        sub_range& operator=( ForwardRange2& r );
-
-        template< class ForwardRange2 >
-        sub_range& operator=( const ForwardRange2& r );    
-    
-    public:  // Forward Range functions 
-        iterator        begin();
-        const_iterator  begin() const;
-        iterator        end();
-        const_iterator  end() const;    
-        
-    public: // convenience 
-        value_type&       front();
-        const value_type& front() const;
-        value_type&       back();
-        const value_type& back() const;
-        // for Random Access Range only: 
-        value_type&       operator[]( size_type at );
-        const value_type& operator[]( size_type at ) const;
-    
-    public:
-        // rest of interface inherited from iterator_range
-    };
-    
-} // namespace 'boost'
-``
-
-The class should be trivial to use as seen below. Imagine that we have an algorithm that searches for a sub-string in a string. The result is an iterator_range, that delimits the match. We need to store the result from this algorithm. Here is an example of how we can do it with and without `sub_range`
-
-``
-std::string str("hello");
-iterator_range<std::string::iterator> ir = find_first( str, "ll" );
-sub_range<std::string>               sub = find_first( str, "ll" );
-``
-
-[endsect]
-
-[section:join Function join]
-
-The intention of the `join` function is to join two ranges into one longer range.
-
-The resultant range will have the lowest common traversal of the two ranges supplied as parameters.
-
-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>
->
-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>
->
-join(SinglePassRange1& rng1, SinglePassRange2& rng2);
-``
-
-[h4 Example]
-
-The expression `join(irange(0,5), irange(5,10))` would evaluate to a range representing an integer range `[0,10)`
-
-
-[endsect]
-
-[endsect]
-